xtd::collections::generic Namespace Reference

Definition

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.

Namespaces
namespace	extensions
	The xtd::extensions namespace contains interface extensions.
namespace	helpers
	The xtd::collections::generic::helpers namespace contains helpers for generic collections, sush as comparer, equator an hasher structs.

Classes
class	comparer
	Provides a base class for implementations of the xtd::collections::generic::icomparer <type_t> generic interface. More...
class	dictionary
	Represents a collection of keys and values. More...
class	empty_comparer
	Provides an empty comparer class. More...
struct	enumerable
	Represents the enumerable concept. More...
class	enumerable_generator
	Represents an enumerable enumerable_generator. More...
struct	enumerator
	Supports a simple iteration over a generic collection. More...
struct	enumerator<>
	Supports a simple iteration over a generic collection. More...
class	equality_comparer
	Provides a base class for implementations of the xtd::collections::generic::iequality_comparer <type_t> generic interface. More...
class	hash_set
	Represents a set of values. More...
class	icollection
	Defines methods to manipulate generic collections. More...
class	icomparer
	Exposes a method that compares two objects. More...
class	idictionary
	Represents a generic collection of key/value pairs. More...
class	ienumerable
	Exposes the enumerator, which supports a simple iteration over a collection of a specified type. More...
class	ienumerable_abstract
	Abstract object that represent ienumerable. 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	iset
	Provides the base interface for the abstraction of sets. More...
class	key_not_found_exception
	The exception that is thrown when the key specified for accessing an element in a collection does not match any key in the collection. More...
struct	key_value_pair
	Defines a key/value pair that can be set or retrieved. More...
struct	key_value_pair< >
	Defines a key/value pair that can be set or retrieved. More...
class	linked_list
	Represents a doubly linked list. More...
class	linked_list_node
	Represents a node in a LinkedList<T>. This class cannot be inherited. 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	ordered_dictionary
	Represents a collection of key/value pairs that are accessible by the key or index. More...
class	queue
	Represents a first-in, first-out collection of objects. More...
class	stack
	Represents a variable size last-in-first-out (LIFO) collection of instances of the same specified type. More...

Alias
template<xtd::collections::generic::enumerable enumerable_type>
using	enumerable_value_type
	Represents the enumerable value type.
template<typename key_t, typename value_t, typename lesser_t = helpers::lesser<key_t>, typename allocator_t = helpers::allocator<std::pair<const key_t, value_t >>>
using	sorted_dictionary
	Represents a collection of key/value pairs that are sorted on the key.
template<typename key_t, typename value_t, typename allocator_t = helpers::allocator<std::pair<const key_t, value_t>>>
using	sorted_list
	Represents a collection of key/value pairs that are sorted by the keys and are accessible by key and by index.
template<typename type_t, typename lesser_t = xtd::collections::generic::helpers::lesser<type_t>, typename allocator_t = xtd::collections::generic::helpers::allocator<type_t >>
using	sorted_set
	Represents a collection of objects that is maintained in sorted order.