The xtd::collections::generic namespace contains interfaces and classes that define generic collections, which allow users to create strongly typed collections that provide better type safety and performance than non-generic strongly typed collections.
|
template<class type_t , class hasher_t = xtd::collections::generic::helpers::hasher<type_t>, class equator_t = xtd::collections::generic::helpers::equator<type_t>, class allocator_t = xtd::collections::generic::helpers::allocator<type_t>> |
using | hash_set = std::unordered_set< type_t, hasher_t, equator_t, allocator_t > |
| Represents a set of values.
|
|
template<class type_t , class allocator_t = xtd::collections::generic::helpers::allocator<type_t>> |
using | linked_list = std::forward_list< type_t, allocator_t > |
| Represents a doubly linked list.
|
|
template<class type_t , class container_t = std::deque<type_t>> |
using | queue = std::stack< type_t, container_t > |
| Represents a collection of objects that is maintained in sorted order.
|
|
template<class key_t , class value_t , class lesser_t = helpers::lesser<key_t>, class allocator_t = helpers::allocator<std::pair<const key_t, value_t>>> |
using | sorted_dictionary = dictionary< key_t, value_t, helpers::hasher< key_t >, helpers::equator< key_t >, allocator_t > |
| Represents a collection of key/value pairs that are sorted on the key.
|
|
template<class key_t , class value_t , class allocator_t = helpers::allocator<std::pair<const key_t, value_t>>> |
using | sorted_list = sorted_dictionary< key_t, value_t, helpers::lesser< key_t >, allocator_t > |
| Represents a collection of key/value pairs that are sorted by the keys and are accessible by key and by index.
|
|
template<class type_t , class lesser_t = xtd::collections::generic::helpers::lesser<type_t>, class allocator_t = xtd::collections::generic::helpers::allocator<type_t>> |
using | sorted_set = std::set< type_t, lesser_t, allocator_t > |
| Represents a collection of objects that is maintained in sorted order.
|
|
template<class type_t , class container_t = std::deque<type_t>> |
using | stack = std::stack< type_t, container_t > |
| Represents a variable size last-in-first-out (LIFO) collection of instances of the same specified type.
|
|
template<class type_t > |
using | type_to_list_t = typename std::conditional< std::is_same< bool, type_t >::value, char, type_t >::type |
| Represents the type to list type.
|
|