HomeSort by relevance Sort by last modified time
    Searched full:tablesize (Results 1 - 25 of 127) sorted by null

1 2 3 4 5 6

  /external/guava/guava/src/com/google/common/collect/
Hashing.java 60 int tableSize = Integer.highestOneBit(expectedEntries);
62 if (expectedEntries > (int) (loadFactor * tableSize)) {
63 tableSize <<= 1;
64 return (tableSize > 0) ? tableSize : MAX_TABLE_SIZE;
66 return tableSize;
69 static boolean needsResizing(int size, int tableSize, double loadFactor) {
70 return size > loadFactor * tableSize && tableSize < MAX_TABLE_SIZE;
RegularImmutableBiMap.java 56 int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
57 this.mask = tableSize - 1;
58 ImmutableMapEntry<K, V>[] keyTable = createEntryArray(tableSize);
59 ImmutableMapEntry<K, V>[] valueTable = createEntryArray(tableSize);
105 int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
106 this.mask = tableSize - 1;
107 ImmutableMapEntry<K, V>[] keyTable = createEntryArray(tableSize);
108 ImmutableMapEntry<K, V>[] valueTable = createEntryArray(tableSize);
RegularImmutableMap.java 55 int tableSize = Hashing.closedTableSize(size, MAX_LOAD_FACTOR);
56 table = createEntryArray(tableSize);
57 mask = tableSize - 1;
80 int tableSize = Hashing.closedTableSize(size, MAX_LOAD_FACTOR);
81 table = createEntryArray(tableSize);
82 mask = tableSize - 1;
  /external/iproute2/netem/
normal.c 14 #define TABLESIZE 16384
29 double table[TABLESIZE+1];
32 i = rint(TABLESIZE * normal(x, 0.0, 1.0));
38 for (i = n = 0; i < TABLESIZE; i += 4) {
paretonormal.c 23 #define TABLESIZE 16384
54 double table[TABLESIZE+1];
57 i = rint(TABLESIZE*normal(x, 0.0, 1.0));
64 for (i = n = 0; i < TABLESIZE; i += 4) {
pareto.c 14 #define TABLESIZE 16384
maketable.c 78 #define TABLESIZE 16384/4
135 inverttable(int *table, int inversesize, int tablesize, int cumulative)
145 for (i=0; i < tablesize; ++i) {
228 inverse = inverttable(table, TABLESIZE, DISTTABLESIZE, total);
229 interpolatetable(inverse, TABLESIZE);
230 printtable(inverse, TABLESIZE);
README.distribution 63 4. Invert the table: for each table entry F(x) = y, make the y*TABLESIZE
65 for the ("normalized") inverse of size TABLESIZE, covering its domain 0
66 to 1 with granularity 1/TABLESIZE. Note that even with the granularity
  /frameworks/minikin/sample/
MinikinSkia.cpp 53 const size_t tableSize = mTypeface->getTableSize(tag);
54 *size = tableSize;
55 if (tableSize == 0) {
58 void* buf = malloc(tableSize);
62 mTypeface->getTableData(tag, 0, tableSize, buf);
  /frameworks/minikin/tests/
MinikinFontForTest.cpp 51 const size_t tableSize = mTypeface->getTableSize(tag);
52 *size = tableSize;
53 if (tableSize == 0) {
56 void* buf = malloc(tableSize);
60 mTypeface->getTableData(tag, 0, tableSize, buf);
  /bootable/recovery/minzip/
Hash.c 61 pHashTable->tableSize = roundUpPower2(initialSize);
65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));
83 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) {
119 for (count = i = 0; i < pHashTable->tableSize; i++) {
148 for (i = 0; i < pHashTable->tableSize; i++) {
166 pHashTable->tableSize = newSize;
185 assert(pHashTable->tableSize > 0);
190 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
191 pEnd = &pHashTable->pEntries[pHashTable->tableSize];
203 if (pHashTable->tableSize == 1
    [all...]
Hash.h 66 int tableSize; /* must be power of 2 */
112 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
158 int lim = pIter->pHashTable->tableSize;
172 return (pIter->idx >= pIter->pHashTable->tableSize);
175 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize);
  /frameworks/base/libs/hwui/hwui/
MinikinSkia.cpp 73 const size_t tableSize = mTypeface->getTableSize(tag);
74 *size = tableSize;
75 if (tableSize == 0) {
78 void* buf = malloc(tableSize);
82 mTypeface->getTableData(tag, 0, tableSize, buf);
  /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
TableSizingMethod.java 21 * AUTO: The table is divided evenly int tableSize/numElements sections.
  /frameworks/base/core/jni/android/graphics/
HarfBuzzNGFaceSkia.cpp 143 const size_t tableSize = typeface->getTableSize(tag);
144 if (!tableSize)
147 char* buffer = reinterpret_cast<char*>(malloc(tableSize));
150 size_t actualSize = typeface->getTableData(tag, 0, tableSize, buffer);
151 if (tableSize != actualSize) {
156 return hb_blob_create(const_cast<char*>(buffer), tableSize,
  /external/gptfdisk/
gptcl.h 37 uint32_t tableSize;
  /external/guava/guava/src/com/google/common/base/
SmallCharMatcher.java 83 int tableSize = Integer.highestOneBit(setSize - 1) << 1;
84 while (tableSize * DESIRED_LOAD_FACTOR < setSize) {
85 tableSize <<= 1;
87 return tableSize;
  /external/opencv3/3rdparty/openexr/Half/
eLut.cpp 88 const int tableSize = 1 << 9;
89 unsigned short eLut[tableSize];
99 for (int i = 0; i < tableSize; i++)
107 if (i < tableSize - 1)
  /prebuilts/go/darwin-x86/src/strings/
export_test.go 29 if int(m) != r.tableSize && t.table[m] != nil {
  /prebuilts/go/linux-x86/src/strings/
export_test.go 29 if int(m) != r.tableSize && t.table[m] != nil {
  /external/iproute2/
README.distribution 61 4. Invert the table: for each table entry F(x) = y, make the y*TABLESIZE
63 for the ("normalized") inverse of size TABLESIZE, covering its domain 0
64 to 1 with granularity 1/TABLESIZE. Note that even with the granularity
  /frameworks/minikin/libs/minikin/
CmapCoverage.cpp 188 const size_t tableSize = cmap_size - offset;
190 success = getCoverageFormat4(coverageVec, tableData, tableSize);
192 success = getCoverageFormat12(coverageVec, tableData, tableSize);
  /external/llvm/utils/TableGen/
CodeGenMapTable.cpp 222 void emitBinSearch(raw_ostream &OS, unsigned TableSize);
227 void emitMapFuncBody(raw_ostream &OS, unsigned TableSize);
364 unsigned TableSize = 0;
389 TableSize++;
393 if (!TableSize) {
398 return TableSize;
406 void MapTableEmitter::emitBinSearch(raw_ostream &OS, unsigned TableSize) {
409 OS << " unsigned end = " << TableSize << ";\n";
429 unsigned TableSize) {
437 emitBinSearch(OS, TableSize);
    [all...]
  /cts/libs/deviceutil/src/android/cts/util/
ReadElf.java 372 long tableOffset, long tableSize) throws IOException {
375 while (mFile.getFilePointer() < tableOffset + tableSize) {
411 private String readStrTabEntry(long tableOffset, long tableSize, long strOffset)
413 if (tableOffset == 0 || strOffset < 0 || strOffset >= tableSize) {
  /external/aac/libMpegTPDec/include/
tp_data.h 312 UINT sf_index, tableSize=sizeof(SamplingRateTable)/sizeof(UINT);
314 for (sf_index=0; sf_index<tableSize; sf_index++) {
318 if (sf_index>tableSize-1) {
319 return tableSize-1;

Completed in 335 milliseconds

1 2 3 4 5 6