blob: 377d8d968ba10b9169145e6ff146c2a1ca64a396 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
/*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkPathHeap_DEFINED
#define SkPathHeap_DEFINED
#include "SkRefCnt.h"
#include "SkChunkAlloc.h"
#include "SkTDArray.h"
class SkPath;
class SkReadBuffer;
class SkWriteBuffer;
class SkPathHeap : public SkRefCnt {
public:
SK_DECLARE_INST_COUNT(SkPathHeap)
SkPathHeap();
SkPathHeap(SkReadBuffer&);
virtual ~SkPathHeap();
/** Copy the path into the heap, and return the new total number of paths.
Thus, the returned value will be index+1, where index is the index of
this newly added (copied) path.
*/
int append(const SkPath&);
/** Add the specified path to the heap using its gen ID to de-duplicate.
Returns the path's index in the heap + 1.
*/
int insert(const SkPath&);
// called during picture-playback
int count() const { return fPaths.count(); }
const SkPath& operator[](int index) const {
return *fPaths[index];
}
void flatten(SkWriteBuffer&) const;
private:
// we store the paths in the heap (placement new)
SkChunkAlloc fHeap;
// we just store ptrs into fHeap here
SkTDArray<SkPath*> fPaths;
class LookupEntry {
public:
LookupEntry(const SkPath& path);
int storageSlot() const { return fStorageSlot; }
void setStorageSlot(int storageSlot) { fStorageSlot = storageSlot; }
static bool Less(const LookupEntry& a, const LookupEntry& b) {
return a.fGenerationID < b.fGenerationID;
}
private:
uint32_t fGenerationID; // the SkPath's generation ID
// the path's index in the heap + 1. It is 0 if the path is not yet in the heap.
int fStorageSlot;
};
SkTDArray<LookupEntry> fLookupTable;
SkPathHeap::LookupEntry* addIfNotPresent(const SkPath& path);
typedef SkRefCnt INHERITED;
};
#endif
|
