Inheritance diagram for Deveel.Data.Index.BlockIndex< T >.Block:

Classes
class	Enumerator

Public Member Functions
	Block (int blockSize)

IEnumerator< T >	GetEnumerator ()

bool	CanContain (int number)

void	Add (T value)
	Adss an int element to the block. More...

T	RemoveAt (int index)
	Removes the element at the given index from the block. More...

int	IndexOf (T value)
	summary> Performs an iterative search from the given position to the end of the list in the block. /summary> param name="value"> More...

int	IndexOf (T value, int startIndex)

void	Insert (T value, int index)
	Inserts an element to the block at the given index. More...

void	MoveTo (IIndexBlock< T > destBlock, int destIndex, int length)
	summary> Copies all the data from this block into the given destination block. /summary> param name="destBlock"> More...

void	CopyTo (IIndexBlock< T > destBlock)
	summary> Copies all the data from this block into the given array. /summary> param name="array">The destination array of the copy. More...

int	CopyTo (T[] destArray, int arrayIndex)

void	Clear ()
	Clears the block of all elements. More...

int	BinarySearch (object key, IIndexComparer< T > comparer)
	summary> Finds the first index in the block that equals the given key. /summary> param name="key"> More...

int	SearchFirst (object key, IIndexComparer< T > comparer)
	summary> Finds the last index in the block that equals the given key. /summary> param name="key"> More...

int	SearchLast (object key, IIndexComparer< T > comparer)
	summary> Assuming a sorted block, finds the first index in the block that equals the given value. /summary> param name="value"> More...

int	SearchFirst (T value)
	summary> Assuming a sorted block, finds the last index in the block that equals the given value. /summary> param name="value"> More...

int	SearchLast (T value)

Protected Member Functions
	Block ()

virtual T[]	GetArray (bool readOnly)

Properties
T[]	BaseArray `[get, set]`

virtual int	ArrayLength `[get]`

IIndexBlock< T > IIndexBlock< T >.	Next `[get, set]`

Block	Next `[get, set]`

IIndexBlock< T > IIndexBlock< T >.	Previous `[get, set]`

Block	Previous `[get, set]`

bool	HasChanged `[get]`

int	Count `[get, protected set]`

bool	IsFull `[get]`

bool	IsEmpty `[get]`

virtual T	Top `[get]`

virtual T	Bottom `[get]`

T	this[int index] `[get, set]`

Properties inherited from Deveel.Data.Index.IIndexBlock< T >
IIndexBlock< T >	Next `[get, set]`
	Gets or sets the next block in the hash. More...

IIndexBlock< T >	Previous `[get, set]`
	Gets or sets the previous block in the hash. More...

bool	HasChanged `[get]`

int	Count `[get]`

bool	IsFull `[get]`
	Gets a value indicating if the block is full. More...

bool	IsEmpty `[get]`
	Gets a value indicating if the block is empty. More...

T	Top `[get]`
	Gets the element at the top of the block. More...

T	Bottom `[get]`
	Gets the element at the bottom of the block. More...

T	this[int index] `[get, set]`
	Gets or sets the element at the given index within the block. More...

Private Member Functions
IEnumerator IEnumerable.	GetEnumerator ()

Static Private Member Functions
static bool	IsSmallerOrEqual (T x, T y)

static bool	IsGreaterOrEqual (T x, T y)

static bool	IsGreater (T x, T y)

static bool	IsSmaller (T x, T y)

Private Attributes
int	count

bool	changed

Detailed Description

Definition at line 59 of file BlockIndex_T.cs.

Constructor & Destructor Documentation

Deveel.Data.Index.BlockIndex< T >.Block.Block ( )

inlineprotected

Definition at line 63 of file BlockIndex_T.cs.

63 {

64 }

Deveel.Data.Index.BlockIndex< T >.Block.Block ( int blockSize )

inline

Definition at line 66 of file BlockIndex_T.cs.

                 : this() {
                 BaseArray = new T[blockSize];
                 count = 0;
             }

Member Function Documentation

void Deveel.Data.Index.BlockIndex< T >.Block.Add ( T value )

inline

Adss an int element to the block.

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 176 of file BlockIndex_T.cs.

                                      {
                 changed = true;
                 var arr = GetArray(false);
                 arr[count] = value;
                 ++count;
             }

int Deveel.Data.Index.BlockIndex< T >.Block.BinarySearch	(	object	key,
		IIndexComparer< T >	comparer
	)

inline

summary> Finds the first index in the block that equals the given key. /summary> param name="key">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 267 of file BlockIndex_T.cs.

                                                                             {
                 var arr = GetArray(true);
                 int low = 0;
                 int high = count - 1;
 
                 while (low <= high) {
                     int mid = (low + high)/2;
                     int cmp = comparer.CompareValue(arr[mid], (DataObject) key);
 
                     if (cmp < 0)
                         low = mid + 1;
                     else if (cmp > 0)
                         high = mid - 1;
                     else
                         return mid; // key found
                 }
                 return -(low + 1); // key not found.
             }

bool Deveel.Data.Index.BlockIndex< T >.Block.CanContain ( int number )

inline

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 171 of file BlockIndex_T.cs.

                                                {
                 return count + number + 1 < ArrayLength;
             }

void Deveel.Data.Index.BlockIndex< T >.Block.Clear ( )

inline

Clears the block of all elements.

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 261 of file BlockIndex_T.cs.

                                 {
                 changed = true;
                 count = 0;
             }

void Deveel.Data.Index.BlockIndex< T >.Block.CopyTo ( IIndexBlock< T > destBlock )

inline

summary> Copies all the data from this block into the given array. /summary> param name="array">The destination array of the copy.

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 246 of file BlockIndex_T.cs.

                                                          {
                 var block = (Block) destBlock;
                 var destArr = block.GetArray(false);
                 Array.Copy(GetArray(true), 0, destArr, 0, count);
                 block.count = count;
                 block.changed = true;
             }

int Deveel.Data.Index.BlockIndex< T >.Block.CopyTo	(	T[]	destArray,
		int	arrayIndex
	)

inline

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 255 of file BlockIndex_T.cs.

                                                              {
                 Array.Copy(GetArray(true), 0, destArray, arrayIndex, count);
                 return count;
             }

virtual T [] Deveel.Data.Index.BlockIndex< T >.Block.GetArray ( bool readOnly )

inlineprotectedvirtual

Definition at line 145 of file BlockIndex_T.cs.

                                                           {
                 if (readOnly) {
                     var newArray = new T[BaseArray.Length];
                     Array.Copy(BaseArray, 0, newArray, 0, BaseArray.Length);
                     return newArray;
                 }
                 return BaseArray;
             }

IEnumerator<T> Deveel.Data.Index.BlockIndex< T >.Block.GetEnumerator ( )

inline

Definition at line 78 of file BlockIndex_T.cs.

                                                   {
                 return new Enumerator(this);
             }

IEnumerator IEnumerable. Deveel.Data.Index.BlockIndex< T >.Block.GetEnumerator ( )

inlineprivate

Definition at line 82 of file BlockIndex_T.cs.

                                                     {
                 return GetEnumerator();
             }

int Deveel.Data.Index.BlockIndex< T >.Block.IndexOf ( T value )

inline

summary> Performs an iterative search from the given position to the end of the list in the block. /summary> param name="value">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 194 of file BlockIndex_T.cs.

                                         {
                 var arr = GetArray(true);
                 for (int i = count - 1; i >= 0; --i) {
                     if (arr[i].Equals(value))
                         return i;
                 }
                 return -1;
             }

int Deveel.Data.Index.BlockIndex< T >.Block.IndexOf	(	T	value,
		int	startIndex
	)

inline

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 204 of file BlockIndex_T.cs.

                                                         {
                 var arr = GetArray(true);
                 for (int i = startIndex; i < count; ++i) {
                     if (arr[i].Equals(value))
                         return i;
                 }
                 return -1;
             }

void Deveel.Data.Index.BlockIndex< T >.Block.Insert	(	T	value,
		int	index
	)

inline

Inserts an element to the block at the given index.

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 214 of file BlockIndex_T.cs.

                                                    {
                 changed = true;
                 var arr = GetArray(false);
                 Array.Copy(BaseArray, index, arr, index + 1, (count - index));
                 ++count;
                 arr[index] = value;
             }

static bool Deveel.Data.Index.BlockIndex< T >.Block.IsGreater	(	T	x,
		T	y
	)

inlinestaticprivate

Definition at line 162 of file BlockIndex_T.cs.

                                                     {
                 return x.CompareTo(y) > 0;
             }

static bool Deveel.Data.Index.BlockIndex< T >.Block.IsGreaterOrEqual	(	T	x,
		T	y
	)

inlinestaticprivate

Definition at line 158 of file BlockIndex_T.cs.

                                                            {
                 return x.CompareTo(y) >= 0;
             }

static bool Deveel.Data.Index.BlockIndex< T >.Block.IsSmaller	(	T	x,
		T	y
	)

inlinestaticprivate

Definition at line 166 of file BlockIndex_T.cs.

                                                     {
                 return x.CompareTo(y) < 0;
             }

static bool Deveel.Data.Index.BlockIndex< T >.Block.IsSmallerOrEqual	(	T	x,
		T	y
	)

inlinestaticprivate

Definition at line 154 of file BlockIndex_T.cs.

                                                            {
                 return x.CompareTo(y) <= 0;
             }

void Deveel.Data.Index.BlockIndex< T >.Block.MoveTo	(	IIndexBlock< T >	destBlock,
		int	destIndex,
		int	length
	)

inline

summary> Copies all the data from this block into the given destination block. /summary> param name="destBlock">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 223 of file BlockIndex_T.cs.

                                                                                     {
                 var block = (Block) destBlock;
 
                 var arr = GetArray(false);
                 var destArr = block.GetArray(false);
 
                 // Make room in the destination block
                 int destbSize = block.Count;
                 if (destbSize > 0) {
                     Array.Copy(destArr, 0, destArr, length, destbSize);
                 }
 
                 // Copy from this block into the destination block.
                 Array.Copy(arr, count - length, destArr, 0, length);
                 // Alter size of destination and source block.
                 block.count += length;
                 count -= length;
                 // Mark both blocks as changed
                 changed = true;
                 block.changed = true;
             }

T Deveel.Data.Index.BlockIndex< T >.Block.RemoveAt ( int index )

inline

Removes the element at the given index from the block.

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 184 of file BlockIndex_T.cs.

                                          {
                 changed = true;
                 var arr = GetArray(false);
                 var val = arr[index];
                 Array.Copy(BaseArray, index + 1, arr, index, (count - index));
                 --count;
                 return val;
             }

int Deveel.Data.Index.BlockIndex< T >.Block.SearchFirst	(	object	key,
		IIndexComparer< T >	comparer
	)

inline

summary> Finds the last index in the block that equals the given key. /summary> param name="key">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 287 of file BlockIndex_T.cs.

                                                                            {
                 var arr = GetArray(true);
                 int low = 0;
                 int high = count - 1;
 
                 while (low <= high) {
                     if (high - low <= 2) {
                         for (int i = low; i <= high; ++i) {
                             int cmp1 = comparer.CompareValue(arr[i], (DataObject) key);
                             if (cmp1 == 0)
                                 return i;
 
                             if (cmp1 > 0)
                                 return -(i + 1);
                         }
 
                         return -(high + 2);
                     }
 
                     int mid = (low + high)/2;
                     int cmp = comparer.CompareValue(arr[mid], (DataObject) key);
 
                     if (cmp < 0) {
                         low = mid + 1;
                     } else if (cmp > 0) {
                         high = mid - 1;
                     } else {
                         high = mid;
                     }
                 }
                 return -(low + 1); // key not found.
 
             }

int Deveel.Data.Index.BlockIndex< T >.Block.SearchFirst ( T value )

inline

summary> Assuming a sorted block, finds the last index in the block that equals the given value. /summary> param name="value">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 355 of file BlockIndex_T.cs.

                                             {
                 var arr = GetArray(true);
                 int low = 0;
                 int high = count - 1;
 
                 while (low <= high) {
 
                     if (high - low <= 2) {
                         for (int i = low; i <= high; ++i) {
                             if (arr[i].Equals(value))
                                 return i;
                             if (IsGreater(arr[i], value))
                                 return -(i + 1);
                         }
                         return -(high + 2);
                     }
 
                     int mid = (low + high)/2;
 
                     if (IsSmaller(arr[mid], value)) {
                         low = mid + 1;
                     } else if (IsGreater(arr[mid], value)) {
                         high = mid - 1;
                     } else {
                         high = mid;
                     }
                 }
                 return -(low + 1); // key not found.
             }

int Deveel.Data.Index.BlockIndex< T >.Block.SearchLast	(	object	key,
		IIndexComparer< T >	comparer
	)

inline

summary> Assuming a sorted block, finds the first index in the block that equals the given value. /summary> param name="value">

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 322 of file BlockIndex_T.cs.

                                                                           {
                 var arr = GetArray(true);
                 int low = 0;
                 int high = count - 1;
 
                 while (low <= high) {
 
                     if (high - low <= 2) {
                         for (int i = high; i >= low; --i) {
                             int cmp1 = comparer.CompareValue(arr[i], (DataObject) key);
                             if (cmp1 == 0)
                                 return i;
                             if (cmp1 < 0)
                                 return -(i + 2);
                         }
                         return -(low + 1);
                     }
 
                     int mid = (low + high)/2;
                     int cmp = comparer.CompareValue(arr[mid], (DataObject) key);
 
                     if (cmp < 0) {
                         low = mid + 1;
                     } else if (cmp > 0) {
                         high = mid - 1;
                     } else {
                         low = mid;
                     }
                 }
                 return -(low + 1); // key not found.
             }

int Deveel.Data.Index.BlockIndex< T >.Block.SearchLast ( T value )

inline

Implements Deveel.Data.Index.IIndexBlock< T >.

Definition at line 386 of file BlockIndex_T.cs.

                                            {
                 var arr = GetArray(true);
                 int low = 0;
                 int high = count - 1;
 
                 while (low <= high) {
 
                     if (high - low <= 2) {
                         for (int i = high; i >= low; --i) {
                             if (arr[i].Equals(value))
                                 return i;
                             if (IsSmaller(arr[i], value))
                                 return -(i + 2);
                         }
                         return -(low + 1);
                     }
 
                     int mid = (low + high)/2;
 
                     if (IsSmaller(arr[mid], value)) {
                         low = mid + 1;
                     } else if (IsGreater(arr[mid], value)) {
                         high = mid - 1;
                     } else {
                         low = mid;
                     }
                 }
                 return -(low + 1); // key not found.
             }