System.Collections Namespace

Classes

public class Bitset A variable length container of bits implemented as a List of ulongs.
public class Bucket<T>
public class ForwardList<T> A singly linked list of elements.
public class ForwardListNode<T>
public class ForwardListNodeIterator<T, R, P> Iterator type of a ForwardList .
public class HashMap<K, T, H, C> An associative array of key-value pairs that are organized in a Hashtable .
public class HashSet<T, H, C> A collection of unique elements that are organized in a Hashtable .
public class Hasher<T> A hash function object that calls one of the GetHashCode function overloads with its argument.
public class Hashtable<KeyType, ValueType, KeyOfValue, HashFun, Compare> A hashtable.
public class HashtableIterator<T, R, P, H> Iterator type of a Hashtable .
public class LinkedList<T> A doubly linked list of elements.
public class LinkedListNode<T>
public class LinkedListNodeIterator<T, R, P> Iterator type of a LinkedList .
public class List<T> Most fundamental container class. The list is like an array that can grow.
public class Map<Key, Value, KeyCompare> An associative array of key-value pairs that are kept sorted in a RedBlackTree .
public class Queue<T> A first-in-first-out container of elements implemented as a List .
public class RedBlackTree<KeyType, ValueType, KeyOfValue, Compare> A red-black tree.
public class RedBlackTreeNode<T>
public class RedBlackTreeNodeBase
public class RedBlackTreeNodeIterator<T, R, P> Iterator type of a RedBlackTree .
public class Set<T, C> A collection of unique elements that are kept sorted in a RedBlackTree .
public class Stack<T> A last-in-first-out container of elements implemented as a List .

Functions

public void ConstructiveCopy<ValueType>(ValueType* to, ValueType* from, long count)
public void ConstructiveMove<ValueType>(ValueType* to, ValueType* from, long count)
public nothrow void Destroy<ValueType>(ValueType* items, long count)
public inline nothrow ulong GetHashCode(char x)
public inline nothrow ulong GetHashCode(const String<char>& s)
public inline nothrow ulong GetHashCode(const String<uchar>& s)
public inline nothrow ulong GetHashCode(const String<wchar>& s)
public inline nothrow ulong GetHashCode(const Uuid& uuid)
public inline nothrow ulong GetHashCode(long x)
public inline nothrow ulong GetHashCode(uchar x)
public inline nothrow ulong GetHashCode(ulong x)
public inline nothrow ulong GetHashCode(void* x)
public inline nothrow ulong GetHashCode(wchar x)
public inline constexpr nothrow long GetNextHashtablePrime(long n)
public bool operator<<T>(const ForwardList<T>& left, const ForwardList<T>& right)
public nothrow bool operator<<T>(const LinkedList<T>& left, const LinkedList<T>& right)
public nothrow bool operator<<T>(const List<T>& left, const List<T>& right)
public inline nothrow bool operator<<Key, Value, KeyCompare>(const Map<Key, Value, KeyCompare>& left, const Map<Key, Value, KeyCompare>& right)
public inline nothrow bool operator<<T, C>(const Set<T, C>& left, const Set<T, C>& right)
public TextWriter& operator<<<K, T, H, C>(TextWriter& writer, const HashMap<K, T, H, C>& hashMap)
public TextWriter& operator<<<T, H, C>(TextWriter& writer, const HashSet<T, H, C>& hashSet)
public TextWriter& operator<<<T>(TextWriter& writer, const List<T>& list)
public TextWriter& operator<<<Key, Value, KeyCompare>(TextWriter& writer, const Map<Key, Value, KeyCompare>& map)
public TextWriter& operator<<<T, C>(TextWriter& writer, const Set<T, C>& set)
public bool operator==(const Bitset& left, const Bitset& right)
public bool operator==<T>(const ForwardList<T>& left, const ForwardList<T>& right)
public inline nothrow bool operator==<T, R, P>(const ForwardListNodeIterator<T, R, P>& left, const ForwardListNodeIterator<T, R, P>& right)
public nothrow bool operator==<K, T, H, C>(const HashMap<K, T, H, C>& left, const HashMap<K, T, H, C>& right)
public nothrow bool operator==<T, H, C>(const HashSet<T, H, C>& left, const HashSet<T, H, C>& right)
public nothrow bool operator==<T, R, P, H>(const HashtableIterator<T, R, P, H>& left, const HashtableIterator<T, R, P, H>& right)
public nothrow bool operator==<T>(const LinkedList<T>& left, const LinkedList<T>& right)
public inline nothrow bool operator==<T, R, P>(const LinkedListNodeIterator<T, R, P>& left, const LinkedListNodeIterator<T, R, P>& right)
public nothrow bool operator==<T>(const List<T>& left, const List<T>& right)
public inline nothrow bool operator==<Key, Value, KeyCompare>(const Map<Key, Value, KeyCompare>& left, const Map<Key, Value, KeyCompare>& right)
public inline nothrow bool operator==<T, R, P>(const RedBlackTreeNodeIterator<T, R, P>& left, const RedBlackTreeNodeIterator<T, R, P>& right)
public inline nothrow bool operator==<T, C>(const Set<T, C>& left, const Set<T, C>& right)

Constants

public const long[26] hashtablePrimes = [ 53, 97, 193, 389, 769, 1543, 3079, 6151, 12289, 24593, 49157, 98317, 196613, 393241, 786433, 1572869, 3145739, 6291469, 12582917, 25165843, 50331653, 100663319, 201326611, 402653189, 805306457, 1610612741 ]

Function Details

ConstructiveCopy Function

public void ConstructiveCopy<ValueType>(ValueType* to, ValueType* from, long count)

Template Parameters
ValueType
Constraint
ValueType  is  CopyConstructible
Definition
Line 375 of System.Base/List.cm

ConstructiveMove Function

public void ConstructiveMove<ValueType>(ValueType* to, ValueType* from, long count)

Template Parameters
ValueType
Constraint
ValueType  is  MoveConstructible
Definition
Line 385 of System.Base/List.cm

Destroy Function

public nothrow void Destroy<ValueType>(ValueType* items, long count)

Template Parameters
ValueType
Constraint
ValueType  is  Destructible
Definition
Line 395 of System.Base/List.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(char x)

Definition
Line 39 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(const String<char>& s)

Definition
Line 59 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(const String<uchar>& s)

Definition
Line 81 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(const String<wchar>& s)

Definition
Line 70 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(const Uuid& uuid)

Definition
Line 92 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(long x)

Definition
Line 29 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(uchar x)

Definition
Line 49 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(ulong x)

Definition
Line 34 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(void* x)

Definition
Line 54 of System.Base/Hashtable.cm

GetHashCode Function

public inline nothrow ulong GetHashCode(wchar x)

Definition
Line 44 of System.Base/Hashtable.cm

GetNextHashtablePrime Function

public inline constexpr nothrow long GetNextHashtablePrime(long n)

Definition
Line 19 of System.Base/Hashtable.cm

operator< Function

public bool operator<<T>(const ForwardList<T>& left, const ForwardList<T>& right)

Template Parameters
T
Constraint
T  is  TotallyOrdered
Definition
Line 280 of System.Base/ForwardList.cm

operator< Function

public nothrow bool operator<<T>(const LinkedList<T>& left, const LinkedList<T>& right)

Template Parameters
T
Constraint
T  is  TotallyOrdered
Definition
Line 375 of System.Base/LinkedList.cm

operator< Function

public nothrow bool operator<<T>(const List<T>& left, const List<T>& right)

Template Parameters
T
Constraint
T  is  TotallyOrdered
Definition
Line 370 of System.Base/List.cm

operator< Function

public inline nothrow bool operator<<Key, Value, KeyCompare>(const Map<Key, Value, KeyCompare>& left, const Map<Key, Value, KeyCompare>& right)

Template Parameters
Key
Value
KeyCompare
Constraint
Key  is  TotallyOrdered  and  Value  is  TotallyOrdered  and  KeyCompare  is  Relation  and  KeyCompare .Domain is  Key
Definition
Line 113 of System.Base/Map.cm

operator< Function

public inline nothrow bool operator<<T, C>(const Set<T, C>& left, const Set<T, C>& right)

Template Parameters
T
C
Constraint
T  is  Semiregular  and  C  is  Relation  and  C .Domain is  T
Definition
Line 105 of System.Base/Set.cm

operator<< Function

public TextWriter& operator<<<K, T, H, C>(TextWriter& writer, const HashMap<K, T, H, C>& hashMap)

Template Parameters
K
T
H
C
Definition
Line 107 of System.Base/HashMap.cm

operator<< Function

public TextWriter& operator<<<T, H, C>(TextWriter& writer, const HashSet<T, H, C>& hashSet)

Template Parameters
T
H
C
Definition
Line 97 of System.Base/HashSet.cm

operator<< Function

public TextWriter& operator<<<T>(TextWriter& writer, const List<T>& list)

Template Parameters
T
Definition
Line 404 of System.Base/List.cm

operator<< Function

public TextWriter& operator<<<Key, Value, KeyCompare>(TextWriter& writer, const Map<Key, Value, KeyCompare>& map)

Template Parameters
Key
Value
KeyCompare
Definition
Line 119 of System.Base/Map.cm

operator<< Function

public TextWriter& operator<<<T, C>(TextWriter& writer, const Set<T, C>& set)

Template Parameters
T
C
Definition
Line 111 of System.Base/Set.cm

operator== Function

public bool operator==(const Bitset& left, const Bitset& right)

Definition
Line 239 of System.Base/Bitset.cm

operator== Function

public bool operator==<T>(const ForwardList<T>& left, const ForwardList<T>& right)

Template Parameters
T
Constraint
T  is  Regular
Definition
Line 275 of System.Base/ForwardList.cm

operator== Function

public inline nothrow bool operator==<T, R, P>(const ForwardListNodeIterator<T, R, P>& left, const ForwardListNodeIterator<T, R, P>& right)

Template Parameters
T
R
P
Definition
Line 86 of System.Base/ForwardList.cm

operator== Function

public nothrow bool operator==<K, T, H, C>(const HashMap<K, T, H, C>& left, const HashMap<K, T, H, C>& right)

Template Parameters
K
T
H
C
Constraint
K  is  Semiregular  and  T  is  Semiregular  and  HashFunction <H , K > and  C  is  Relation  and  C .Domain is  K
Definition
Line 94 of System.Base/HashMap.cm

operator== Function

public nothrow bool operator==<T, H, C>(const HashSet<T, H, C>& left, const HashSet<T, H, C>& right)

Template Parameters
T
H
C
Constraint
T  is  Semiregular  and  HashFunction <H , T > and  C  is  Relation  and  C .Domain is  T
Definition
Line 87 of System.Base/HashSet.cm

operator== Function

public nothrow bool operator==<T, R, P, H>(const HashtableIterator<T, R, P, H>& left, const HashtableIterator<T, R, P, H>& right)

Template Parameters
T
R
P
H
Definition
Line 201 of System.Base/Hashtable.cm

operator== Function

public nothrow bool operator==<T>(const LinkedList<T>& left, const LinkedList<T>& right)

Template Parameters
T
Constraint
T  is  Regular
Definition
Line 366 of System.Base/LinkedList.cm

operator== Function

public inline nothrow bool operator==<T, R, P>(const LinkedListNodeIterator<T, R, P>& left, const LinkedListNodeIterator<T, R, P>& right)

Template Parameters
T
R
P
Definition
Line 109 of System.Base/LinkedList.cm

operator== Function

public nothrow bool operator==<T>(const List<T>& left, const List<T>& right)

Template Parameters
T
Constraint
T  is  Regular
Definition
Line 353 of System.Base/List.cm

operator== Function

public inline nothrow bool operator==<Key, Value, KeyCompare>(const Map<Key, Value, KeyCompare>& left, const Map<Key, Value, KeyCompare>& right)

Template Parameters
Key
Value
KeyCompare
Constraint
Key  is  Regular  and  Value  is  Regular  and  KeyCompare  is  Relation  and  KeyCompare .Domain is  Key
Definition
Line 107 of System.Base/Map.cm

operator== Function

public inline nothrow bool operator==<T, R, P>(const RedBlackTreeNodeIterator<T, R, P>& left, const RedBlackTreeNodeIterator<T, R, P>& right)

Template Parameters
T
R
P
Definition
Line 578 of System.Base/RedBlackTree.cm

operator== Function

public inline nothrow bool operator==<T, C>(const Set<T, C>& left, const Set<T, C>& right)

Template Parameters
T
C
Constraint
T  is  Regular  and  C  is  Relation  and  C .Domain is  T
Definition
Line 99 of System.Base/Set.cm