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

1 2 3 4 5 6

  /external/elfcopy/
hash.c 24 Elf32_Word *buckets = (Elf32_Word *)hash_data->d_buf; local
25 Elf32_Word nbuckets = *buckets++;
26 Elf32_Word *chains = ++buckets + nbuckets;
32 if (buckets[bucket] == STN_UNDEF) {
35 buckets[bucket] = symindex;
40 last_chain_index = buckets[bucket];
59 Elf32_Word *buckets = ++hash_data; local
64 index = buckets[elf_hash(symname) % nbuckets];
  /development/tools/axl/
chewperf.py 62 buckets = {}
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
71 top = max(buckets.keys())
73 if x not in buckets.keys():
74 buckets[x] = 0
79 for x in range(len(buckets.items())):
80 window[x % len(window)] = buckets.items()[x][1]
81 print "%s\t%s" % (buckets.items()[x][0], sum(window) / len(window)
    [all...]
  /build/tools/apriori/
hash.c 15 Elf32_Word *buckets = ++hash_data; local
18 index = buckets[elf_hash(symname) % nbuckets];
  /build/tools/lsd/
hash.c 16 Elf32_Word *buckets = ++hash_data; local
19 index = buckets[elf_hash(symname) % nbuckets];
  /frameworks/ex/common/tools/
make-iana-tld-pattern.py 101 def getBucket(buckets, line):
103 bucket = buckets.get(letter)
107 buckets[letter] = bucket
111 def makePattern(prefix, suffix, buckets, isWebUrl=False):
114 output += getBucket(buckets, 'a').dump(isFirst=True, isWebUrl=isWebUrl)
117 output += getBucket(buckets, chr(letter)).dump(isWebUrl=isWebUrl)
119 output += getBucket(buckets, 'z').dump(isLast=True, isWebUrl=isWebUrl)
135 buckets = {} variable
141 getBucket(buckets, domain[0]).add(domain.strip())
143 makePattern(TLD_PREFIX, TLD_SUFFIX, buckets, isWebUrl=False
    [all...]
  /packages/apps/Gallery3D/src/com/cooliris/media/
MediaBucketList.java 36 public static MediaItem getFirstItemSelection(ArrayList<MediaBucket> buckets) {
38 if (buckets != null) {
39 int numBuckets = buckets.size();
41 MediaBucket bucket = buckets.get(0);
56 public static MediaSet getFirstSetSelection(ArrayList<MediaBucket> buckets) {
58 if (buckets != null) {
59 int numBuckets = buckets.size();
61 MediaBucket bucket = buckets.get(0);
76 ArrayList<MediaBucket> buckets = mBuckets; local
77 int numBuckets = buckets.size()
    [all...]
DetailMode.java 34 public static CharSequence[] populateDetailModeStrings(Context context, ArrayList<MediaBucket> buckets) {
35 int numBuckets = buckets.size();
36 if (MediaBucketList.isSetSelection(buckets) && numBuckets == 1) {
40 return populateSetViewDetailModeStrings(context, MediaBucketList.getFirstSetSelection(buckets), 1);
41 } else if (MediaBucketList.isSetSelection(buckets) || MediaBucketList.isMultipleItemSelection(buckets)) {
45 MediaBucket bucket = buckets.get(i);
66 return populateItemViewDetailModeStrings(context, MediaBucketList.getFirstItemSelection(buckets));
  /external/emma/core/java12/com/vladium/util/
IntIntMap.java 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets; local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
111 final Entry [] buckets = m_buckets; local
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
130 final Entry [] buckets = m_buckets; local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next
178 Entry [] buckets = m_buckets; local
221 Entry [] buckets = m_buckets; local
290 final Entry [] buckets = m_buckets; local
    [all...]
ObjectIntMap.java 50 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
91 final Entry [] buckets = m_buckets; local
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
119 final Entry [] buckets = m_buckets; local
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
171 Entry [] buckets = m_buckets; local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
193 buckets = m_buckets
217 Entry [] buckets = m_buckets; local
286 final Entry [] buckets = m_buckets; local
    [all...]
IntObjectMap.java 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets; local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
112 final Entry [] buckets = m_buckets; local
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
164 Entry [] buckets = m_buckets; local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
189 buckets = m_buckets
248 final Entry [] buckets = m_buckets; local
    [all...]
IntSet.java 46 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
85 final Entry [] buckets = m_buckets; local
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
145 Entry [] buckets = m_buckets; local
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
161 buckets = m_buckets;
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
163 final Entry bucketListHead = buckets [bucketIndex];
165 buckets [bucketIndex] = newEntry
220 final Entry [] buckets = m_buckets; local
    [all...]
SoftValueMap.java 61 * @param initialCapacity initial number of hash buckets in the table
163 final SoftEntry [] buckets = m_buckets; local
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
234 SoftEntry [] buckets = m_buckets; local
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
281 buckets = m_buckets;
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
283 final SoftEntry bucketListHead = buckets [bucketIndex]
301 final SoftEntry [] buckets = m_buckets; local
345 final SoftEntry [] buckets = m_buckets; local
476 final SoftEntry [] buckets = m_buckets; local
    [all...]
  /external/webkit/LayoutTests/storage/domstorage/
quota-expected.txt 11 Putting 'data' into 40 sessionStorage buckets.
21 Putting 'data' into 39 localStorage buckets.
  /system/core/libcutils/
hashmap.c 35 Entry** buckets; member in struct:Hashmap
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
62 if (map->buckets == NULL) {
115 Entry* entry = map->buckets[i];
126 free(map->buckets);
127 map->buckets = newBuckets;
143 Entry* entry = map->buckets[i];
150 free(map->buckets);
193 Entry** p = &(map->buckets[index]);
225 Entry* entry = map->buckets[index]
    [all...]
  /external/iptables/include/linux/netfilter_ipv4/
ipt_dstlimit.h 22 u_int32_t size; /* how many buckets */
ipt_hashlimit.h 23 u_int32_t size; /* how many buckets */
  /external/kernel-headers/original/linux/netfilter_ipv4/
ipt_hashlimit.h 23 u_int32_t size; /* how many buckets */
  /external/webkit/LayoutTests/storage/domstorage/script-tests/
quota.js 22 debug("Putting 'data' into 39 " + storageString + " buckets.");
68 debug("Putting 'data' into 40 " + storageString + " buckets.");
  /bootable/recovery/applypatch/
bsdiff.c 123 off_t buckets[256]; local
126 for(i=0;i<256;i++) buckets[i]=0;
127 for(i=0;i<oldsize;i++) buckets[old[i]]++;
128 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
129 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
130 buckets[0]=0;
132 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
134 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]
    [all...]
  /external/bsdiff/
bsdiff.c 106 off_t buckets[256]; local
109 for(i=0;i<256;i++) buckets[i]=0;
110 for(i=0;i<oldsize;i++) buckets[old[i]]++;
111 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
112 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
113 buckets[0]=0;
115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
117 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]
    [all...]
  /development/tools/idegen/src/
Eclipse.java 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size()); local
63 buckets.add(new Bucket(pattern));
66 // Put source roots in respective buckets.
71 for (Bucket bucket : buckets) {
80 for (Bucket bucket : buckets) {
  /external/bison/lib/
hash.c 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
55 for a possibility of N_BUCKETS. Among those, N_BUCKETS_USED buckets
95 A good `hasher' function will distribute entries rather evenly in buckets.
100 larger hash table size (that is, a larger number of buckets) is prone to
103 Long buckets slow down the lookup algorithm. One might use big hash table
104 sizes in hope to reduce the average length of buckets, but this might
110 /* If an insertion makes the ratio of nonempty buckets to table size larger
115 every second time 80% of the buckets get used. */
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
142 table organization: the number of entries, number of buckets and maximu
    [all...]
hash.h 46 float shrink_threshold; /* ratio of used buckets to trigger a shrink */
48 float growth_threshold; /* ratio of used buckets to trigger a growth */
  /bionic/libc/stdio/
flockfile.c 68 FileLock* buckets[ FILE_LOCK_BUCKETS ]; member in struct:__anon526
80 memset(_lockTable->buckets, 0, sizeof(_lockTable->buckets));
105 pnode = &t->buckets[hash % FILE_LOCK_BUCKETS];
  /external/iptables/extensions/
libipt_hashlimit.man 26 The number of buckets of the hash table

Completed in 760 milliseconds

1 2 3 4 5 6