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.
|
class | enumerable_iterators |
| Internal enumarable iterators definition. More...
|
|
class | enumerator |
| Supports a simple iteration over a generic collection. More...
|
|
class | icollection |
| Defines methods to manipulate generic collections. More...
|
|
class | icomparer |
| Exposes a method that compares two objects. More...
|
|
class | ienumerable |
| Exposes the enumerator, which supports a simple iteration over a collection of a specified type. More...
|
|
class | ienumerator |
| Supports a simple iteration over a generic collection. More...
|
|
class | iequality_comparer |
| Defines methods to support the comparison of objects for equality. More...
|
|
class | ilist |
| Represents a collection of objects that can be individually accessed by index. More...
|
|
class | list |
| Represents a strongly typed list of objects that can be accessed by index. Provides methods to search, sort, and manipulate lists. More...
|
|
class | params |
| An object of type xtd::collections::generic::params <type_t> is a lightweight proxy object that provides access to an array of objects of type const type_t (that may be allocated in read-only memory). More...
|
|
|
template<typename key_t , typename value_t > |
using | dictionary = std::unordered_map< key_t, value_t, helpers::hasher< key_t >, helpers::equator< key_t >, helpers::allocator< std::pair< const key_t, value_t > > > |
| Represents a collection of keys and values.
|
|
template<typename type_t > |
using | hash_set = std::unordered_set< type_t, helpers::hasher< type_t >, helpers::equator< type_t >, helpers::allocator< type_t > > |
| Represents a set of values.
|
|
template<typename key_t , typename value_t > |
using | key_value_pair = std::pair< key_t, value_t > |
| Defines a key/value pair that can be set or retrieved.
|
|
template<typename key_t , typename value_t > |
using | sorted_dictionary = std::map< key_t, value_t, helpers::comparer< key_t >, helpers::allocator< std::pair< const key_t, value_t > > > |
| Represents a collection of key/value pairs that are sorted on the key.
|
|
template<typename type_t > |
using | sorted_set = std::set< type_t, helpers::comparer< type_t >, helpers::allocator< type_t > > |
| Represents a collection of objects that is maintained in sorted order.
|
|