You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Marshall Clow 83e2c4d877 Move common header files into a 'support' directory; make 'testit' include -I to that directory; rename 'iterators.h' to 'iterator_test.h'; remove hard-coded paths to include files from more than 350 source files ... git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@171594 91177308-0d34-0410-b5e6-96231b3b80d8		13 years ago
..
unord.set.cnstr	Move common header files into a 'support' directory; make 'testit' include -I to that directory; rename 'iterators.h' to 'iterator_test.h'; remove hard-coded paths to include files from more than 350 source files	13 years ago
unord.set.swap	noexcept for <unordered_set>.	15 years ago
bucket.pass.cpp	license change	15 years ago
bucket_count.pass.cpp	license change	15 years ago
bucket_size.pass.cpp	license change	15 years ago
clear.pass.cpp	license change	15 years ago
count.pass.cpp	license change	15 years ago
emplace.pass.cpp	license change	15 years ago
emplace_hint.pass.cpp	license change	15 years ago
eq.pass.cpp	license change	15 years ago
equal_range_const.pass.cpp	license change	15 years ago
equal_range_non_const.pass.cpp	license change	15 years ago
erase_const_iter.pass.cpp	license change	15 years ago
erase_key.pass.cpp	license change	15 years ago
erase_range.pass.cpp	license change	15 years ago
find_const.pass.cpp	license change	15 years ago
find_non_const.pass.cpp	license change	15 years ago
insert_const_lvalue.pass.cpp	license change	15 years ago
insert_hint_const_lvalue.pass.cpp	license change	15 years ago
insert_hint_rvalue.pass.cpp	license change	15 years ago
insert_init.pass.cpp	Move common header files into a 'support' directory; make 'testit' include -I to that directory; rename 'iterators.h' to 'iterator_test.h'; remove hard-coded paths to include files from more than 350 source files	13 years ago
insert_range.pass.cpp	Move common header files into a 'support' directory; make 'testit' include -I to that directory; rename 'iterators.h' to 'iterator_test.h'; remove hard-coded paths to include files from more than 350 source files	13 years ago
insert_rvalue.pass.cpp	license change	15 years ago
iterators.fail.cpp	license change	15 years ago
iterators.pass.cpp	Bug 9096 - list::iterator not default constructible	15 years ago
load_factor.pass.cpp	unord test fixes by Edward Meewis	14 years ago
local_iterators.fail.cpp	license change	15 years ago
local_iterators.pass.cpp	license change	15 years ago
max_bucket_count.pass.cpp	license change	15 years ago
max_load_factor.pass.cpp	license change	15 years ago
max_size.pass.cpp	license change	15 years ago
rehash.pass.cpp	license change	15 years ago
reserve.pass.cpp	This commit establishes a new bucket_count policy in the unordered containers: The policy now allows a power-of-2 number of buckets to be requested (and that request honored) by the client. And if the number of buckets is set to a power of 2, then the constraint of the hash to the number of buckets uses & instead of %. If the client does not specify a number of buckets, then the policy remains unchanged: a prime number of buckets is selected. The growth policy is that the number of buckets is roughly doubled when needed. While growing, either the prime, or the power-of-2 strategy will be preserved. There is a small run time cost for putting in this switch. For very cheap hash functions, e.g. identity for int, the cost can be as high as 18%. However with more typical use cases, e.g. strings, the cost is in the noise level. I've measured cases with very cheap hash functions (int) that using a power-of-2 number of buckets can make look up about twice as fast. However I've also noted that a power-of-2 number of buckets is more susceptible to accidental catastrophic collisions. Though I've also noted that accidental catastrophic collisions are also possible when using a prime number of buckets (but seems far less likely). In short, this patch adds an extra tuning knob for those clients trying to get the last bit of performance squeezed out of their hash containers. Casual users of the hash containers will not notice the introduction of this tuning knob. Those clients who swear by power-of-2 hash containers can now opt-in to that strategy. Clients who prefer a prime number of buckets can continue as they have.	14 years ago
swap_member.pass.cpp	license change	15 years ago
types.pass.cpp	license change	15 years ago
version.pass.cpp	license change	15 years ago