Skip to content

N_CodeJam_Collections

Jump to bottom
Andrew Koryavchenko edited this page Jun 17, 2018 · 14 revisions

CodeJam.Collections Namespace

The CodeJam.Collections namespace contains IEnumerable(T), array, or other collections related functionality.

Classes

 

Class Description
Public class Array(T) Array type extensions.
Public class ArrayExtensions Array class extensions.
Public class CollectionExtensions Various collections extensions.
Public class ComparerBuilder(T) Builds comparer functions and comparers.
Public class DictionaryExtensions Extensions for IDictionary(TKey, TValue)
Public class EnumerableExtensions Extensions for IEnumerable(T)
Public class IntervalTree(T, TKey) Interval tree implementation.
Public class KeyEqualityComparer Provides static methods for creating KeyEqualityComparer(T, TKey).
Public class KeyEqualityComparer(T, TKey) An implementation of the IEqualityComparer(T) interface for compare values by comparing their extracted key values.
Public class LazyDictionary Provides static methods for ILazyDictionary(TKey, TValue).
Public class LazyDictionary(TKey, TValue) Dictionary with lazy values initialization.
Public class OwnedCollection Factory methods for the owned collections.
Public class OwnedCollection(TOwner, TItem) Collection type that allows to associate collection items with the owner.
Public class OwnedCollection(TOwner, TKey, TItem) Keyed collection type that allows to associate collection items with the owner.
Public class OwnedCollectionBase(TOwner, TItem) Base collection type that allows to associate collection items with the owner.
Public class OwnedCollectionBase(TOwner, TKey, TItem) Base keyed collection type that allows to associate collection items with the owner.
Public class QueryableExtensions Extensions for IQueryable(T)
Public class Sequence Contains methods for sequence creation.
Public class SuffixTree Implementation of the suffix tree with Ukkonen's algorithm

Remarks

See http://stackoverflow.com/questions/9452701/ukkonens-suffix-tree-algorithm-in-plain-english/9513423 and http://www.cise.ufl.edu/~sahni/dsaaj/enrich/c16/suffix.htm
Public class SuffixTreeBase Base class for suffix tree algorithm implementation.

Structures

 

Structure Description
Public structure IndexedItem(T) Represents an element associated with its index in a sequence.
Public structure Suffix Suffix of the SuffixTree
Protected structure SuffixTreeBase.Node A suffix tree edge combined with the end node

Interfaces

 

Interface Description
Public interface ILazyDictionary(TKey, TValue) Dictionary with lazy values initialization.

Enumerations

 

Enumeration Description
Public enumeration DictionaryDuplicate Defines behavior for duplicates in lookup source
Public enumeration QueryRangeBoundaries Marks boundaries that should be checked for inifinte (null values)
 
Clone this wiki locally