llvm/libcxx/include at 6a03f169db971c334793a023821df184eddddc57 - llvm

ext

…

support

…

__bit_reference

Apply constexpr to <bitset>.

2012-07-07 17:04:52 +00:00

__config

libc++: switch from using _ATTRIBUTE(noreturn) (which conflicts with a

2012-07-26 02:04:22 +00:00

__debug

…

__functional_03

…

__functional_base

…

__functional_base_03

…

__hash_table

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.

2012-07-06 17:31:14 +00:00

__locale

locale::id really needs to be constructed at compile time.

2012-07-26 16:14:37 +00:00

__mutex_base

noexcept applied to <condition_variable>.

2012-07-21 16:32:53 +00:00

__split_buffer

…

__sso_allocator

…

__std_stream

…

__tree

…

__tuple

…

__tuple_03

…

__undef_min_max

…

algorithm

…

array

constexpr applied to <array>.

2012-07-20 19:20:49 +00:00

atomic

…

bitset

Apply constexpr to <bitset>.

2012-07-07 17:04:52 +00:00

cassert

…

ccomplex

…

cctype

…

cerrno

…

cfenv

…

cfloat

…

chrono

Applied constexpr to <chrono>.

2012-07-13 19:17:27 +00:00

cinttypes

…

ciso646

…

climits

…

clocale

…

cmath

Apply noexcept to those functions implemented in <cmath> as a conforming extension.

2012-07-06 19:13:50 +00:00

codecvt

…

complex

constexpr applied to <complex>.

2012-07-20 22:18:27 +00:00

complex.h

…

condition_variable

noexcept applied to <condition_variable>.

2012-07-21 16:32:53 +00:00

csetjmp

…

csignal

…

cstdarg

…

cstdbool

…

cstddef

…

cstdint

…

cstdio

…

cstdlib

Apply noexcept to those functions implemented in <cstdlib> as a conforming extension.

2012-07-06 19:16:56 +00:00

cstring

…

ctgmath

…

ctime

…

cwchar

…

cwctype

…

deque

Change emplace for vector and deque to create the temporary (when necessary) before any changes to the container are made. Nikolay Ivchenkov deserves the credit for pushing this problem and the solution for it.

2012-07-08 23:23:04 +00:00

exception

libc++: switch from using _ATTRIBUTE(noreturn) (which conflicts with a

2012-07-26 02:04:22 +00:00

forward_list

…

fstream

…

functional

Further tweaks on relaxing complete type checking for function.

2012-07-20 18:56:07 +00:00

future

Apple LWG 2067: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3318.html#2067 . This is the only actionable change that has been made to the C++ draft since C++11. In general it has not been decided exactly how libc++ will track changes made to C++11. New features and design changes will probably be #ifdef'd, especially if they are not backwards compatible. Defects and 'dumb mistakes' are more likely to just be put in. Decisions on telling one from the other will be made on a case by case basis.

2012-07-21 19:34:12 +00:00

initializer_list

…

iomanip

…

ios

noexcept and constexpr applied to <ios>.

2012-07-21 01:03:40 +00:00

iosfwd

…

iostream

…

istream

…

iterator

noexcept applied to <iterator>.

2012-07-20 19:36:34 +00:00

limits

…

list

…

locale

Fixed a bug in wstring_convert concerning zero-length inputs. Thanks to Jonathan Coxhead for reporting this bug.

2012-07-12 18:07:41 +00:00

map

…

memory

Appy constexpr to <memory>. Picked up a few missing noexcepts as well.

2012-07-07 20:56:04 +00:00

mutex

noexcept and constexpr applied to <mutex>.

2012-07-21 16:13:09 +00:00

new

…

numeric

…

ostream

…

queue

…

random

noexcept applied to <random>.

2012-07-20 21:44:27 +00:00

ratio

…

regex

noexcept and constexpr applied to <regex>.

2012-07-21 01:31:58 +00:00

scoped_allocator

…

set

…

sstream

…

stack

…

stdexcept

…

streambuf

…

string

constexpr applied to <string>.

2012-07-20 19:09:12 +00:00

strstream

…

system_error

…

tgmath.h

…

thread

noexcept applied to <thread>.

2012-07-21 16:50:47 +00:00

tuple

Appy constexpr to <memory>. Picked up a few missing noexcepts as well.

2012-07-07 20:56:04 +00:00

type_traits

Further tweaks on relaxing complete type checking for function.

2012-07-20 18:56:07 +00:00

typeindex

…

typeinfo

…

unordered_map

…

unordered_set

…

utility

…

valarray

noexcept applied to <valarray>.

2012-07-21 00:51:28 +00:00

vector

Change emplace for vector and deque to create the temporary (when necessary) before any changes to the container are made. Nikolay Ivchenkov deserves the credit for pushing this problem and the solution for it.

2012-07-08 23:23:04 +00:00