Searched refs:buckets (Results 1 - 17 of 17) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/testsuite/backward/hash_set/
H A Dcheck_construct_destroy.cc40 int buckets; local
45 buckets = c.bucket_count();
46 ok = check_construct_destroy("empty container", buckets, 0) && ok;
48 ok = check_construct_destroy("empty container", buckets, buckets) && ok;
54 ok = check_construct_destroy("Construct from range", buckets+10, 0) && ok;
56 ok = check_construct_destroy("Construct from range", buckets+10, buckets+10) && ok;
62 ok = check_construct_destroy("Insert element", buckets+11, 0) && ok;
64 ok = check_construct_destroy("Insert element", buckets
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/20_util/hash/
H A Dchi2_quality.h20 // of N strings into k buckets (where k is significantly greater than N).
55 chi2_hash(const Container& c, long buckets) argument
57 std::vector<int> counts(buckets);
62 ++counts[hasher(*i) % buckets];
66 const double z = elements / buckets;
68 for (long i = 0; i < buckets; ++i)
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr37101.c18 int buckets; member in struct:_ClientResource
33 j = 2 * clientTable[client].buckets;
47 for (j = clientTable[client].buckets,
60 clientTable[client].buckets *= 2;
/haiku-buildtools/legacy/gcc/libobjc/objc/
H A Dsarray.h125 struct sbucket* buckets[INDEX_SIZE]; member in struct:sindex
136 struct sbucket** buckets;
213 buckets[x.off.boffset]->
216 return array->buckets[x.off.boffset]->elems[x.off.eoffset];
222 buckets[(index/BUCKET_SIZE)%INDEX_SIZE]->
225 return array->buckets[index/BUCKET_SIZE]->elems[index%BUCKET_SIZE];
/haiku-buildtools/gcc/libvtv/
H A Dvtv_map.h83 /* Create an empty map with a reasonable number of buckets for the
145 /* Return a copy with double the number of buckets. Returns NULL if
153 bucket_type buckets[0]; /* Actual array size is num_buckets. */ member in class:insert_only_hash_map
175 memset (result->buckets, 0, cap * sizeof (bucket_type));
189 if (this->buckets[i].first != NULL)
190 copy->put_internal (this->buckets[i].first, this->buckets[i].second,
208 bucket_type &bucket = this->buckets[bucket_index];
253 bucket_type &bucket = this->buckets[bucket_index];
296 const bucket_type &bucket = this->buckets[bucket_inde
[all...]
H A Dvtv_set.h383 { return buckets[index]; }
387 { return buckets[index]; }
402 volatile key_type buckets[0]; /* Actual array size is num_buckets. */ member in class:insert_only_hash_sets::insert_only_hash_set
470 if (s->buckets[i] != (key_type) illegal_key)
471 result->insert_no_resize (s->buckets[i]);
531 result->buckets[i] = (key_type) illegal_key;
607 if (buckets[i] != (key_type) illegal_key)
608 s->insert_no_resize (buckets[i]);
/haiku-buildtools/legacy/gcc/libobjc/
H A Dsarray.c133 the_bucket = &((*the_index)->buckets[boffset]);
135 the_bucket = &(array->buckets[boffset]);
152 the_bucket = &((*the_index)->buckets[boffset]);
163 the_bucket = &((*the_index)->buckets[boffset]);
262 arr->empty_index->buckets[counter] = arr->empty_bucket;
277 arr->buckets = new_buckets;
343 old_buckets = array->buckets;
348 /* copy buckets below old_max_index (they are still valid) */
371 array->buckets = new_buckets;
410 old_buckets = array->buckets;
[all...]
/haiku-buildtools/gcc/libcilkrts/runtime/
H A Dreducer_impl.cpp149 /** Number of buckets */
152 /** Array of pointers to buckets */
153 bucket **buckets; member in struct:cilkred_map
194 /** @brief Allocate and initialize the buckets */
284 __cilkrts_frame_malloc(w, nbuckets * sizeof(*(buckets)));
294 buckets = (bucket **)new_buckets;
296 buckets = new_buckets;
302 bucket **buckets,
309 fprintf(stderr, "W=%d, desc=free_buckets, buckets=%p, size=%zd\n",
310 w->self, buckets,
301 free_buckets(__cilkrts_worker *w, bucket **buckets, size_t nbuckets) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr53602.C203 struct buckets struct in namespace:boost::unordered::detail
218 buckets (boost::unordered::detail::table <Types>, boost::unordered::detail::move_tag) : buckets_ (), size_ () function in struct:boost::unordered::detail::buckets
260 struct table:boost::unordered::detail::buckets <typename Types::allocator, typename Types::bucket, typename Types::key_equal>
263 typedef boost::unordered::detail::buckets <typename Types::allocator, typename Types::bucket, typename Types::node> buckets; typedef in struct:boost::unordered::detail::table
264 typedef typename buckets::node_pointer node_pointer;
265 typedef typename buckets::const_node_pointer const_node_pointer;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/
H A Dpr47416.C170 template < class T > class hash_table:T::buckets, T::buffered_functions
/haiku-buildtools/binutils/gold/
H A Ddynobj.cc853 // Given a vector of hash codes, compute the number of hash buckets to
862 // Array used to determine the number of hash table buckets to use
865 // buckets, fewer than 37 we use 17 buckets, and so forth. We never
866 // use more than 262147 buckets. This is straight from the old GNU
868 static const unsigned int buckets[] = local
873 const int buckets_count = sizeof buckets / sizeof buckets[0];
881 if (symcount < buckets[i] * full_fraction)
883 ret = buckets[
[all...]
/haiku-buildtools/gcc/libstdc++-v3/python/libstdcxx/v6/
H A Dprinters.py709 self.buckets = hash['_M_buckets']
715 self.node = self.buckets[self.bucket]
732 self.node = self.buckets[self.bucket]
/haiku-buildtools/legacy/binutils/binutils/
H A Dreadelf.c6894 bfd_vma *buckets = NULL;
6925 error (_("Failed to read in number of buckets\n"));
6938 buckets = get_dynamic_data (file, nbuckets, hash_ent_size);
6941 if (buckets == NULL || chains == NULL)
6959 if (! buckets[hn])
6962 for (si = buckets[hn]; si < nchains && si > 0; si = chains[si])
7211 if (do_histogram && buckets != NULL)
7221 printf (_("\nHistogram for bucket list length (total of %lu buckets):\n"),
7233 for (si = buckets[hn]; si > 0 && si < nchains; si = chains[si])
7269 if (buckets !
6891 bfd_vma *buckets = NULL; local
[all...]
/haiku-buildtools/legacy/binutils/bfd/
H A Delf32-xtensa.c4348 value_map **buckets;
4432 values->buckets = (value_map **)
4434 if (values->buckets == NULL)
4448 free (table->buckets);
4498 bucket = map->buckets[idx];
4533 bucket_p = &map->buckets[idx];
4333 value_map **buckets; member in struct:value_map_hash_table_struct
/haiku-buildtools/binutils/binutils/
H A Dreadelf.c11010 bfd_vma * buckets = NULL;
11049 error (_("Failed to read in number of buckets\n"));
11062 buckets = get_dynamic_data (file, nbuckets, hash_ent_size);
11066 if (buckets == NULL || chains == NULL)
11070 free (buckets);
11072 buckets = NULL;
11101 error (_("Failed to read in number of buckets\n"));
11211 if (! buckets[hn])
11214 for (si = buckets[hn]; si < nchains && si > 0; si = chains[si])
11366 if (do_histogram && buckets !
11007 bfd_vma * buckets = NULL; local
[all...]
/haiku-buildtools/binutils/bfd/
H A Delf32-xtensa.c5169 value_map **buckets;
5253 values->buckets = (value_map **)
5255 if (values->buckets == NULL)
5269 free (table->buckets);
5319 bucket = map->buckets[idx];
5354 bucket_p = &map->buckets[idx];
5155 value_map **buckets; member in struct:value_map_hash_table_struct
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/
H A Dpr65240.h4888 void *buckets; member in struct:__anon1059

Completed in 409 milliseconds