089a7cc5de
This patch is very similar to r260431. This patch is the first in a series of patches that's meant to better support map. map has a special "value_type" that differs from pair<const Key, Value>. In order to meet the EmplaceConstructible and CopyInsertable requirements we need to teach __tree about this special value_type. This patch creates a "__tree_node_types" traits class that contains all of the typedefs needed by the associative containers and their iterators. These typedefs include ones for each node type and node pointer type, as well as special typedefs for "map"'s value type. Although the associative containers already supported incomplete types, this patch makes it official by adding tests. This patch will be followed up shortly with various cleanups within __tree and fixes for various map bugs and problems. llvm-svn: 261416 |
||
|---|---|---|
| .. | ||
| set.cons | ||
| set.special | ||
| allocator_mismatch.fail.cpp | ||
| clear.pass.cpp | ||
| count.pass.cpp | ||
| emplace.pass.cpp | ||
| emplace_hint.pass.cpp | ||
| empty.pass.cpp | ||
| equal_range.pass.cpp | ||
| erase_iter.pass.cpp | ||
| erase_iter_iter.pass.cpp | ||
| erase_key.pass.cpp | ||
| find.pass.cpp | ||
| incomplete_type.pass.cpp | ||
| insert_cv.pass.cpp | ||
| insert_initializer_list.pass.cpp | ||
| insert_iter_cv.pass.cpp | ||
| insert_iter_iter.pass.cpp | ||
| insert_iter_rv.pass.cpp | ||
| insert_rv.pass.cpp | ||
| iterator.pass.cpp | ||
| lower_bound.pass.cpp | ||
| max_size.pass.cpp | ||
| size.pass.cpp | ||
| types.pass.cpp | ||
| upper_bound.pass.cpp | ||
| version.pass.cpp | ||