構成 | |
struct | hash< osl::hash::HashKey > |
struct | hash< osl::hash::SignatureKey > |
struct | hash< Position > |
struct | hash_map |
struct | hash_set |
struct | multimap |
struct | hash< T * > |
struct | ConsistencyCheck |
struct | pool_allocator |
struct | slist |
pool_allocator Ȥ slist Υå [詳細] | |
struct | stack |
struct | vector |
関数 | |
template<class InputIterator, class OutputIterator, class Predicate> | |
OutputIterator | copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate predicate) |
Copy the elements of a range that satisfy a predicate. | |
static ConsistencyCheck | consistency_check (0) |
変数 | |
const int | gpl_pool_allocator_used = 0 |
gcc 3.4 ɸallocatornew/deleteƤ֤褦ˤʤäᡤ GPLʤϰgcc°pool_allocatorȤȤǸΨݤ
static ConsistencyCheck osl::stl::consistency_check | ( | 0 | ) | [static] |
OutputIterator osl::stl::copy_if | ( | InputIterator | first, | |
InputIterator | last, | |||
OutputIterator | result, | |||
Predicate | predicate | |||
) | [inline] |
Copy the elements of a range that satisfy a predicate.
The current STL lacks this copy_if algorithm. This implementation comes from a book: Effective STL, Scott Meyers, Addison-Wesley (Item 36).
const int osl::stl::gpl_pool_allocator_used = 0 |