Lines Matching refs:fCapacity
38 for (int round = 0; round < fCapacity; round++) {
73 int capacity() const { return fCapacity; }
78 for (int round = 0; round < fCapacity; round++) {
101 fCapacity = capacity;
102 fArray = AllocArray(fCapacity);
109 SKTDYNAMICHASH_CHECK(SkIsPow2(fCapacity));
110 SKTDYNAMICHASH_CHECK(fCapacity >= kMinCapacity);
114 for (int i = 0; i < fCapacity; i++) {
123 for (int i = 0; i < fCapacity; i++) {
131 for (int i = 0; i < fCapacity; i++) {
139 for (int i = 0; i < fCapacity; i++) {
143 for (int j = i+1; j < fCapacity; j++) {
159 for (int round = 0; round < fCapacity; round++) {
177 for (int round = 0; round < fCapacity; round++) {
191 if (fCount + fDeleted + 1 > (fCapacity * kGrowPercent) / 100) {
192 resize(fCapacity * 2);
197 if (fCount < (fCapacity * kShrinkPercent) / 100 && fCapacity / 2 > kMinCapacity) {
198 resize(fCapacity / 2);
204 int oldCapacity = fCapacity;
220 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
221 uint32_t hashMask() const { return fCapacity - 1; }
235 int fCapacity; // Number of entries in fArray. Always a power of 2.
