DeveelDB  20151217
complete SQL database system, primarly developed for .NET/Mono frameworks
Deveel.Data.Index.BlockIndexBase< T > Member List

This is the complete list of members for Deveel.Data.Index.BlockIndexBase< T >, including all inherited members.

Add(T value)Deveel.Data.Index.BlockIndexBase< T >inline
BlockIndexBase()Deveel.Data.Index.BlockIndexBase< T >inlineprotected
BlockIndexBase(IEnumerable< IIndexBlock< T >> blocks)Deveel.Data.Index.BlockIndexBase< T >inlineprotected
BlockIndexBase(IEnumerable< T > values)Deveel.Data.Index.BlockIndexBase< T >inlineprotected
BlockIndexBase(IIndex< T > index)Deveel.Data.Index.BlockIndexBase< T >inlineprotected
BlocksDeveel.Data.Index.BlockIndexBase< T >protected
CheckImmutable()Deveel.Data.Index.BlockIndexBase< T >inlineprivate
Contains(T value)Deveel.Data.Index.BlockIndexBase< T >inline
Contains(object key, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inline
CopyToArray(T[] array, int offset, int length)Deveel.Data.Index.BlockIndexBase< T >inlinepackage
CountDeveel.Data.Index.BlockIndexBase< T >
FindBlockContaining(object key, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
FindFirstBlock(object key, IIndexComparer< T > c)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
FindLastBlock(object key, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
FindLastBlock(T val)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
GetEnumerator()Deveel.Data.Index.BlockIndexBase< T >inline
GetEnumerator(int startOffset, int endOffset)Deveel.Data.Index.BlockIndexBase< T >inline
GetEnumerator()Deveel.Data.Index.BlockIndexBase< T >inlineprivate
GetEnumerator()Deveel.Data.Index.BlockIndexBase< T >inlineprivate
Insert(int index, T value)Deveel.Data.Index.BlockIndexBase< T >inline
InsertBlock(int index, IIndexBlock< T > block)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
InsertIntoBlock(T value, int blockIndex, IIndexBlock< T > block, int position)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
InsertSort(T value)Deveel.Data.Index.BlockIndexBase< T >inline
InsertSort(object key, T value, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inline
IsGreater(T x, T y)Deveel.Data.Index.BlockIndexBase< T >inlineprivatestatic
IsGreaterOrEqual(T x, T y)Deveel.Data.Index.BlockIndexBase< T >inlineprivatestatic
IsReadOnlyDeveel.Data.Index.BlockIndexBase< T >
IsSmaller(T x, T y)Deveel.Data.Index.BlockIndexBase< T >inlineprivatestatic
IsSmallerOrEqual(T x, T y)Deveel.Data.Index.BlockIndexBase< T >inlineprivatestatic
NewBlock()Deveel.Data.Index.BlockIndexBase< T >protectedpure virtual
OnDeleteBlock(IIndexBlock< T > block)Deveel.Data.Index.BlockIndexBase< T >inlineprotectedvirtual
RemoveAt(int index)Deveel.Data.Index.BlockIndexBase< T >inline
RemoveBlock(int index)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
RemoveFromBlock(int blockIndex, IIndexBlock< T > block, int position)Deveel.Data.Index.BlockIndexBase< T >inlineprivate
RemoveSort(T value)Deveel.Data.Index.BlockIndexBase< T >inline
RemoveSort(object key, T value, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inline
SearchFirst(object key, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inline
SearchLast(object key, IIndexComparer< T > comparer)Deveel.Data.Index.BlockIndexBase< T >inline
this[int index]Deveel.Data.Index.BlockIndexBase< T >
UniqueInsertSort(T value)Deveel.Data.Index.BlockIndexBase< T >inline