| 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) | 
  
  
   
    | 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      ] |