Loyc.Collections

I seem to be drawn to creating general-purpose data structures; most of these data structures can be found in this assembly. Out of all these, my favorite data structure is the persistent hash-trees (essentially hashtables)

• VLists: see http://www.codeproject.com/Articles/26171/VList-data-structures-in-C
  • FVList<T>, RVList<T>, FWList<T>, RWList<T>
• Persistent (forkable/copy-on-write) hash-trees, mutable and immutable:
  • Set<T>, Map<K,V> - immutable set structure and dictionary class
  • MSet<T>, MMap<K,V> - mutable set and dictionary classes
  • InvertibleSet<T> - an immutable set that can be inverted, meaning "everything except { a, b, c }"
  • InternalSet<T> - common implementation behind all five data types
• ALists: see http://core.loyc.net/collections/alists-part1.html
  • AList<T>, BList<T>, BDictionary<K, V>, BMultiMap<K, V>
• CPTries: see http://www.codeproject.com/Articles/61230/CPTrie-A-sorted-data-structure-for-NET
  • CPIntTrie<TValue>, CPStringTrie<TValue>, CPByteTrie<TValue>
• Misc:
  • SimpleCache<T>