| /external/clearsilver/util/test/ |
| hdf_copy_test.hdf | 24 Bucket = Discrete
25 Bucket.FieldId = QUEUE
26 Bucket.Dimension = Y
31 Bucket = Time
32 Bucket.FieldId = TIME
33 Bucket.Dimension = Y
38 Bucket = Discrete
39 Bucket.FieldId = AGENT
40 Bucket.Dimension = X
|
| hdf_copy_test.c | 23 while (hdf_get_obj(cur_node,"next_stage") && strcmp(hdf_get_value(cur_node,"Bucket.FieldId",""),"QUEUE")) {
|
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| MediaBucketList.java | 32 // If only albums are selected, a bucket contains mediaSets.
33 // If items are selected, a bucket contains mediaSets and mediaItems.
41 MediaBucket bucket = buckets.get(0); local
42 if (bucket != null && !isSetSelection(bucket)) {
43 ArrayList<MediaItem> items = bucket.mediaItems;
61 MediaBucket bucket = buckets.get(0); local
62 if (bucket != null && isSetSelection(bucket)) {
63 set = bucket.mediaSet
80 MediaBucket bucket = buckets.get(i); local
109 MediaBucket bucket = null; local
205 MediaBucket bucket = selectedBuckets.get(i); local
[all...] |
| ConcatenatedDataSource.java | 55 MediaBucket bucket = mediaBuckets.get(i); local
56 MediaSet set = bucket.mediaSet;
60 singleBucket.set(0, bucket);
|
| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
252 struct hash_entry const *bucket local
281 struct hash_entry const *bucket; local
300 struct hash_entry const *bucket local
330 struct hash_entry const *bucket; local
362 struct hash_entry const *bucket; local
607 struct hash_entry *bucket; local
650 struct hash_entry *bucket; local
747 struct hash_entry *bucket local
822 struct hash_entry *bucket; local
911 struct hash_entry *bucket; local
986 struct hash_entry *bucket; local
1031 struct hash_entry const *bucket; local
[all...] |
| /external/webkit/LayoutTests/storage/domstorage/ |
| quota-expected.txt | 12 Putting 'data' into another bucket.h
22 Putting 'data' into another bucket.h
26 Removing bucket 38.
27 Adding 'Hello!' into a new bucket.
|
| /external/elfcopy/ |
| hash.c | 28 unsigned long bucket = elf_hash(symbol) % nbuckets; local
32 if (buckets[bucket] == STN_UNDEF) {
33 INFO("Adding [%s] to hash at bucket [%ld] (first add)\n",
34 symbol, bucket);
35 buckets[bucket] = symindex;
38 INFO("Collision on adding [%s] to hash at bucket [%ld]\n",
39 symbol, bucket);
40 last_chain_index = buckets[bucket];
|
| /external/qemu/distrib/sdl-1.2.12/src/video/dga/ |
| SDL_dgavideo.c | 595 vidmem_bucket *bucket; local
600 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
601 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
602 if ( bucket->prev )
623 vidmem_bucket *bucket; local
655 vidmem_bucket *bucket, *freeable; local
678 vidmem_bucket *bucket; local
691 vidmem_bucket *bucket; local
772 vidmem_bucket *bucket, *freeable; local
[all...] |
| /external/clearsilver/util/ |
| neo_hash.c | 142 UINT32 hashv, bucket; local
150 bucket = (*node)->hashv & (hash->size - 1);
155 bucket = hashv & (hash->size - 1);
160 bucket = 0;
170 bucket++;
173 while (bucket < hash->size)
175 if (hash->nodes[bucket])
177 *key = hash->nodes[bucket]->key;
178 return hash->nodes[bucket]->value;
180 bucket++
188 UINT32 hashv, bucket; local
[all...] |
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size());
63 buckets.add(new Bucket(pattern));
71 for (Bucket bucket : buckets) {
72 if (bucket.matches(path)) {
73 bucket.sourceRoots.add(sourceRoot);
80 for (Bucket bucket : buckets) {
81 for (File sourceRoot : bucket.sourceRoots)
[all...] |
| /external/webkit/LayoutTests/storage/domstorage/script-tests/ |
| quota.js | 26 debug("Putting 'data' into another bucket.h");
37 debug("Removing bucket 38.");
40 debug("Adding 'Hello!' into a new bucket.");
72 debug("Putting 'data' into another bucket.h");
|
| /external/iproute2/man/man8/ |
| tc-tbf.8 | 3 tbf \- Token Bucket Filter
24 The Token Bucket Filter is a classless queueing discipline available for
51 in one go. Tokens arrive at a steady rate, until the bucket is full.
57 to limit the speed at which the bucket empties. This peakrate is implemented as a second TBF
58 with a very small bucket, so that it doesn't burst.
60 To achieve perfection, the second bucket may contain only a single packet, which leads to
77 bucket, the rate and possibly the peakrate (if set). These two parameters
82 Size of the bucket, in bytes. This is the maximum amount of bytes that tokens can be available for instantaneously.
86 If your buffer is too small, packets may be dropped because more tokens arrive per timer tick than fit in your bucket.
109 Maximum depletion rate of the bucket. Limited to 1mbit/s on Intel, 10mbit/s on Alpha. The peakrate does
[all...] |
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 29 class Bucket:
103 bucket = buckets.get(letter)
105 if bucket is None:
106 bucket = Bucket(letter)
107 buckets[letter] = bucket
109 return bucket
|
| /external/qemu/distrib/sdl-1.2.12/src/video/fbcon/ |
| SDL_fbvideo.c | 1079 vidmem_bucket *bucket; local
1084 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
1085 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
1086 if ( bucket->prev )
1107 vidmem_bucket *bucket; local
1139 vidmem_bucket *bucket, *freeable; local
1152 vidmem_bucket *bucket; local
1227 vidmem_bucket *bucket, *freeable; local
[all...] |
| SDL_fbvideo.h | 161 vidmem_bucket *bucket; local
167 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
168 bucket->dirty = 0;
|
| /development/tools/axl/ |
| chewperf.py | 64 bucket = x[0] / 1000
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 86 // index into the corresponding hash bucket:
90 // traverse the singly-linked list of entries in the bucket:
110 // index into the corresponding hash bucket:
114 // traverse the singly-linked list of entries in the bucket:
129 // index into the corresponding hash bucket:
133 // traverse the singly-linked list of entries in the bucket:
174 // index into the corresponding hash bucket:
177 // traverse the singly-linked list of entries in the bucket:
217 // index into the corresponding hash bucket:
220 // traverse the singly-linked list of entries in the bucket
[all...] |
| ObjectIntMap.java | 90 // index into the corresponding hash bucket:
95 // traverse the singly-linked list of entries in the bucket:
118 // index into the corresponding hash bucket:
123 // traverse the singly-linked list of entries in the bucket:
166 // index into the corresponding hash bucket:
170 // traverse the singly-linked list of entries in the bucket:
212 // index into the corresponding hash bucket:
216 // traverse the singly-linked list of entries in the bucket:
249 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
283 // and then with that value reduced to actually shrink capacity. As it is right now, the bucket table ca
[all...] |
| /external/dbus/dbus/ |
| dbus-hash.c | 100 * When there are this many entries per bucket, on average, rebuild
107 * hash tables bucket list. The idea is to make it so that
145 * hash bucket, or #NULL for end of
158 DBusHashEntry ***bucket,
170 DBusHashEntry **buckets; /**< Pointer to bucket array. Each
172 * bucket's hash chain, or #NULL.
175 /**< Bucket array used for small tables
214 DBusHashEntry **bucket; /**< Pointer to bucket that points to member in struct:__anon3364
219 DBusHashEntry *next_entry; /**< Next entry to be iterated onto in current bucket */
780 DBusHashEntry **bucket; local
1101 DBusHashEntry **bucket; local
1283 DBusHashEntry **bucket; local
1312 DBusHashEntry **bucket; local
1341 DBusHashEntry **bucket; local
1371 DBusHashEntry **bucket; local
1400 DBusHashEntry **bucket; local
[all...] |
| /external/stlport/test/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 36 // We have no children in this bucket yet.
41 // Search this bucket.
55 // Add a new child to the bucket.
|
| /ndk/sources/android/stlport/test/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /external/iptables/extensions/ |
| libip6t_limit.man | 1 This module matches at a limited rate using a token bucket filter.
|
| libipt_limit.man | 1 This module matches at a limited rate using a token bucket filter.
|
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 107 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
108 Object cache = sCache[bucket];
112 sCache[bucket] = cache;
114 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
|
