OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2013 Google Inc. | 2 * Copyright 2013 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #ifndef SkDataTable_DEFINED | 8 #ifndef SkDataTable_DEFINED |
9 #define SkDataTable_DEFINED | 9 #define SkDataTable_DEFINED |
10 | 10 |
| 11 #include "../private/SkTDArray.h" |
11 #include "SkChunkAlloc.h" | 12 #include "SkChunkAlloc.h" |
12 #include "SkData.h" | 13 #include "SkData.h" |
13 #include "SkString.h" | 14 #include "SkString.h" |
14 #include "SkTDArray.h" | |
15 | 15 |
16 /** | 16 /** |
17 * Like SkData, SkDataTable holds an immutable data buffer. The data buffer is | 17 * Like SkData, SkDataTable holds an immutable data buffer. The data buffer is |
18 * organized into a table of entries, each with a length, so the entries are | 18 * organized into a table of entries, each with a length, so the entries are |
19 * not required to all be the same size. | 19 * not required to all be the same size. |
20 */ | 20 */ |
21 class SK_API SkDataTable : public SkRefCnt { | 21 class SK_API SkDataTable : public SkRefCnt { |
22 public: | 22 public: |
23 /** | 23 /** |
24 * Returns true if the table is empty (i.e. has no entries). | 24 * Returns true if the table is empty (i.e. has no entries). |
(...skipping 141 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
166 */ | 166 */ |
167 SkDataTable* detachDataTable(); | 167 SkDataTable* detachDataTable(); |
168 | 168 |
169 private: | 169 private: |
170 SkTDArray<SkDataTable::Dir> fDir; | 170 SkTDArray<SkDataTable::Dir> fDir; |
171 SkChunkAlloc* fHeap; | 171 SkChunkAlloc* fHeap; |
172 size_t fMinChunkSize; | 172 size_t fMinChunkSize; |
173 }; | 173 }; |
174 | 174 |
175 #endif | 175 #endif |
OLD | NEW |