Searched refs:fNodes (Results 1 - 10 of 10) sorted by relevance
| /third_party/skia/gm/ |
| H A D | animatedimageblurs.cpp | 46 fNodes[i].init(&fRand);
56 layerPaint.setImageFilter(SkImageFilters::Blur(fNodes[i].sigma(), fNodes[i].sigma(),
61 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f,
62 fNodes[i].pos().fY - fNodes[i].size()-0.5f,
63 fNodes[i].pos().fX + fNodes[i].size()+0.5f,
64 fNodes[
138 Node fNodes[kNumNodes]; global() member in AnimatedImageBlurs
[all...] |
| /third_party/skia/tests/ |
| H A D | IncrTopoSortTest.cpp | 88 : fNodes(numNodesToReserve) in Graph()
96 fNodes.push_back(tmp); // The graph gets the creation ref in addNode()
97 tmp->setIndexInSort(fNodes.count()-1); in addNode()
119 // invalid nodes from 'fNodes' and shifting valid nodes left to fill in the gaps. In this
122 // they are reintroduced to the 'fNodes' array but now in the appropriate position. The
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region in addEdges()
174 for (int i = 0; i < fNodes.count(); ++i) { in getActual()
175 (*actual) += fNodes[i]->id(); in getActual()
176 if (i < fNodes.count()-1) { in getActual()
185 for (int i = 0; i < fNodes in print()
306 SkTArray<sk_sp<Node>> fNodes; global() member in Graph
[all...] |
| /third_party/skia/src/core/ |
| H A D | SkRTree.cpp | 33 fNodes.reserve(1); in insert()
40 fNodes.reserve(CountNodes(fCount)); in insert()
47 SkDEBUGCODE(Node* p = fNodes.data()); in allocateNodeAtLevel()
48 fNodes.push_back(Node{}); in allocateNodeAtLevel()
49 Node& out = fNodes.back(); in allocateNodeAtLevel()
50 SkASSERT(fNodes.data() == p); // If this fails, we didn't reserve() enough. in allocateNodeAtLevel()
169 byteCount += fNodes.capacity() * sizeof(Node); in bytesUsed()
|
| H A D | SkRTree.h | 79 std::vector<Node> fNodes; member in SkRTree
|
| /third_party/icu/icu4c/source/i18n/ |
| H A D | tznames_impl.cpp | 187 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), in TextTrieMap()
194 fNodes[index].deleteValues(fValueDeleter); in ~TextTrieMap()
196 uprv_free(fNodes); in ~TextTrieMap()
209 // Trie is built, while fNodes and fLazyContents change with the lazy init in isEmpty()
257 if (fNodes == NULL) { in putImpl()
259 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); in putImpl()
260 if (fNodes == NULL) { in putImpl()
264 fNodes[0].clear(); // Init root node. in putImpl()
281 CharacterNode *node = fNodes; in putImpl()
302 uprv_memcpy(newNodes, fNodes, fNodesCoun in growNodes()
[all...] |
| H A D | tznames_impl.h | 146 CharacterNode *fNodes; member in TextTrieMap
|
| /third_party/node/deps/icu-small/source/i18n/ |
| H A D | tznames_impl.cpp | 187 : fIgnoreCase(ignoreCase), fNodes(nullptr), fNodesCapacity(0), fNodesCount(0), in TextTrieMap()
194 fNodes[index].deleteValues(fValueDeleter); in ~TextTrieMap()
196 uprv_free(fNodes); in ~TextTrieMap()
209 // Trie is built, while fNodes and fLazyContents change with the lazy init in isEmpty()
257 if (fNodes == nullptr) { in putImpl()
259 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); in putImpl()
260 if (fNodes == nullptr) { in putImpl()
264 fNodes[0].clear(); // Init root node. in putImpl()
281 CharacterNode *node = fNodes; in putImpl()
302 uprv_memcpy(newNodes, fNodes, fNodesCoun in growNodes()
[all...] |
| H A D | tznames_impl.h | 146 CharacterNode *fNodes; member in TextTrieMap
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| H A D | tznames_impl.cpp | 177 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), in TextTrieMap()
184 fNodes[index].deleteValues(fValueDeleter); in ~TextTrieMap()
186 uprv_free(fNodes); in ~TextTrieMap()
199 // Trie is built, while fNodes and fLazyContents change with the lazy init in isEmpty()
249 if (fNodes == NULL) { in putImpl()
251 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); in putImpl()
252 if (fNodes == NULL) { in putImpl()
256 fNodes[0].clear(); // Init root node. in putImpl()
273 CharacterNode *node = fNodes; in putImpl()
294 uprv_memcpy(newNodes, fNodes, fNodesCoun in growNodes()
[all...] |
| H A D | tznames_impl.h | 146 CharacterNode *fNodes; member in TextTrieMap
|
Completed in 14 milliseconds