xtd mainly uses std collections. To complete the std, xtd implements some owner collections.
Collections Sequence collectionsSequence collections implement data structures which can be accessed sequentially.
Associative collectionsAssociative collections implement sorted data structures that can be quickly searched (O(log n) complexity).
Container Definition std::set Represents a scollection of unique keys, sorted by keys. std::map Represents a scollection of key-value pairs, sorted by keys, keys are unique. std::multiset Represents a scollection of keys, sorted by keys. std::multimap Represents a scollection of key-value pairs, sorted by keys. Unordered associative collectionsUnordered associative collections implement unsorted (hashed) data structures that can be quickly searched (O(1) average, O(n) worst-case complexity).
Container adaptorsContainer adaptors provide a different interface for sequential collections.
Container Definition std::stack Adapts a container to provide stack (LIFO data structure). std::queue Adapts a container to provide queue (FIFO data structure). std::priority_queue Adapts a container to provide priority queue. std::flat_set Adapts a container to provide a collection of unique keys, sorted by keys. std::flat_map Adapts two collections to provide a collection of key-value pairs, sorted by unique keys. std::flat_multiset Adapts a container to provide a collection of keys, sorted by keys. std::flat_multimap Adapts two collections to provide a collection of key-value pairs, sorted by keys. Collections with eventsSpecialized collectionsRemarks The arranged_element_collection Collections is overloaded in various classes such as control, list_control, tab_control, status_bar, tool_bar, ...
Specialized and strongly-typed collections.
Thread-safe collectionsThread-safe collections can be used for multithreading.
Choose a collectionRemarks Not yet implemented, but coming soon.
In general, you should use generic collections. The following table describes some common collection scenarios and the collection classes you can use for those scenarios. If you're new to generic collections, the following table will help you choose the generic collection that works best for your task:
Algorithmic complexity of collectionsLors du choix d'une classe de collection, il convient de tenir compte des compromis possibles en termes de performances. Utilisez le tableau suivant pour comparer la complexité algorithmique de divers types de collection.
See alsoRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4