nuget
contains actuall data od deque, Deque(Of T) provides abstraction above this data
Data
Type Parameters
| Name | Description |
|---|---|
S |
01 Syntax
Microsoft.VisualBasic.ComponentModel.Collection.Deque.Data`1
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| DoubleSize | 1 | Doubles the number of references to data blocks, copies existing data blocks to the middle of new reference array of double size do not actually allocate any data blocks |
| AllocBlockBeginning | 1 | allocs one data block in front of the first block currently allocated doubles the size of reference array if necessary |
| AllocBlockEnd | 1 | allocs one data block in front of the first block currently allocated doubles the size of reference array if necessary |
| AddBegining | 1 | Adds Item as a new Head of the Deque(Of T), Count is incremented |
| AddEnd | 1 | Adds Item as a new Tail of the Deque(Of T), Count is incremented |
| RemoveHead | 1 | returns the firts element of the Deque(Of T) while removing it from Deque(Of T) |
| RemoveTail | 1 | returns the last element of the Deque(Of T) and removes it from Deque(Of T) |
| Insert | 1 | Inserts element on a specified index id Deque(Of T) Insert at the beggining or end in O(1) Allows to insert item on index 0 of an empty Deque(Of T) - List(Of T) behaves the same… |
| RemoveAt | 1 | Removes an element from the specified index of Deque(Of T), removal of the first and the last item in O(1) |
| IndexOf | 1 | Searches for the specified object and returns the zero-based index of the first occurrence within the entire Deque(Of T). |
| Remove | 1 | Removes item from the Deque(Of T), removal of the first and the last item in O(1) |
| Contains | 1 | Determines whether an element is in the Deque(Of T). |
| Clear | 1 | Removes all elements from the Deque(Of T). |
| CopyTo | 1 | Copies the entire Deque(Of T) to a compatible one-dimensional array, starting at the specified index of the target array. |
03 Properties
04 Fields
| Name | Overloads | Summary |
|---|---|---|
| sizeOfBlock | 1 | Number of elements in Deque(Of T) |
| NumOfBlockRefs | 1 | Current number of allocated references to data blocks, data blocks themselves doesn't have to be allocated yet |
| NumOfBlockInitialized | 1 | Current number of actually allocated blocks |
| beforeFirst | 1 | number of allocated indices before the Head of a Deque to be able to allocate blocks only when its necessary - only one block at time |
| headBlockIndex | 1 | index of the first allocated block - in array of block references |
| HeadIndex | 1 | index of the firts item in the Deque - relative to the first index in the first block there is reference to (not to the first block actually allocated) pretends that data is s… |
05 Members
DoubleSize
Doubles the number of references to data blocks, copies existing data blocks to the middle of new reference array of double size do not actually allocate any data blocks
AllocBlockBeginning
allocs one data block in front of the first block currently allocated doubles the size of reference array if necessary
AllocBlockEnd
allocs one data block in front of the first block currently allocated doubles the size of reference array if necessary
AddBegining(
`0)Adds Item as a new Head of the Deque(Of T), Count is incremented
Parameters
| Name | Type | Description |
|---|---|---|
item | `0 | - |
AddEnd(
`0)Adds Item as a new Tail of the Deque(Of T), Count is incremented
Parameters
| Name | Type | Description |
|---|---|---|
item | `0 | - |
RemoveHead
returns the firts element of the Deque(Of T) while removing it from Deque(Of T)
RemoveTail
returns the last element of the Deque(Of T) and removes it from Deque(Of T)
Insert(
Int32, `0)Inserts element on a specified index id Deque(Of T) Insert at the beggining or end in O(1) Allows to insert item on index 0 of an empty Deque(Of T) - List(Of T) behaves the same way, I recon
Parameters
| Name | Type | Description |
|---|---|---|
index | Int32 | - |
item | `0 | - |
RemoveAt(
Int32)Removes an element from the specified index of Deque(Of T), removal of the first and the last item in O(1)
Parameters
| Name | Type | Description |
|---|---|---|
index | Int32 | - |
IndexOf(
`0)Searches for the specified object and returns the zero-based index of the first occurrence within the entire Deque(Of T).
Returns
e zero-based index of the first occurrence of item within the entire Deque(Of T), if found; otherwise, -1.
Remove(
`0)Removes item from the Deque(Of T), removal of the first and the last item in O(1)
Parameters
| Name | Type | Description |
|---|---|---|
item | `0 | - |
Contains(
`0)Determines whether an element is in the Deque(Of T).
Parameters
| Name | Type | Description |
|---|---|---|
item | `0 | - |
Returns
true if item is found in the List(Of T); otherwise, false
Clear
Removes all elements from the Deque(Of T).
CopyTo(
`0(), Int32, Boolean)Copies the entire Deque(Of T) to a compatible one-dimensional array, starting at the specified index of the target array.
afterLast
number of allocated indices after the Tail of a Deque to be able to allocate blocks only when its necessary - only one block at time
TailIndex
index of last item in the Deque
Item(
Int32)allows to treat the Deque(Of T) as if it stored data linearly
Parameters
| Name | Type | Description |
|---|---|---|
i | Int32 | - |
sizeOfBlock
Number of elements in Deque(Of T)
NumOfBlockRefs
Current number of allocated references to data blocks, data blocks themselves doesn't have to be allocated yet
NumOfBlockInitialized
Current number of actually allocated blocks
beforeFirst
number of allocated indices before the Head of a Deque to be able to allocate blocks only when its necessary - only one block at time
headBlockIndex
index of the first allocated block - in array of block references
HeadIndex
index of the firts item in the Deque - relative to the first index in the first block there is reference to (not to the first block actually allocated) pretends that data is stored linearly