ListFun
Static members
Static member | Description |
AddByIndex(list, count, index_fun)
Signature: (list:List<'T> * count:int * index_fun:Func<int,'T>) -> List<'T>
Type parameters: 'T |
Add a specifable number of elements, each generated by a supplied function of the respective element index in the list. |
AddRange(list, value, count)
Signature: (list:List<'T> * value:'T * count:int) -> List<'T>
Type parameters: 'T |
|
BackwardMappedCopyToArray(...)
Signature: (sourceArray:List<'T> * backwardMap:int []) -> 'T []
Type parameters: 'T |
Returns an array copy of this list that is created by copying the elements at the positions specified in the supplied backward map. |
BackwardMappedCopyToArray(...)
Signature: (source:List<'T> * target:'T [] * backwardMap:int [] * offset:int) -> unit
Type parameters: 'T |
Copies from this list into the target array starting at the supplied offset using the supplied backward map that contains the source index for each index of the target array. |
BackwardMappedCopyToArray(...)
Signature: (sourceArray:List<'T> * backwardMap:int [] * fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
Returns an array copy of this list that is created by copying the elements at the positions specified in the supplied backward map. |
BackwardMappedCopyToArray(...)
Signature: (source:List<'T> * target:'Tr [] * backwardMap:int [] * offset:int * fun:Func<'T,'Tr>) -> unit
Type parameters: 'T, 'Tr |
Copies from this list into the target array starting at the supplied offset using the supplied backward map that contains the source index for each index of the target array. |
Copy(self)
Signature: self:List<'T> -> List<'T>
Type parameters: 'T |
|
Copy(list, fun)
Signature: (list:List<'T> * fun:Func<'T,'Tr>) -> List<'Tr>
Type parameters: 'T, 'Tr |
|
Copy(list, fun)
Signature: (list:List<'T> * fun:Func<'T,int,'Tr>) -> List<'Tr>
Type parameters: 'T, 'Tr |
|
CopyToArray(self)
Signature: self:List<'T> -> 'T []
Type parameters: 'T |
|
CopyToArray(self, count)
Signature: (self:List<'T> * count:int) -> 'T []
Type parameters: 'T |
|
CopyToArray(list, item_fun)
Signature: (list:List<'T> * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
CopyToArray(list, count, item_fun)
Signature: (list:List<'T> * count:int * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
CopyToArray(...)
Signature: (list:List<'T> * start:int * count:int * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
HeapAscendingDequeue(heap)
Signature: heap:List<'T> -> 'T
Type parameters: 'T |
Removes and returns the item at the top of the heap (i.e. the 0th position of the list). For default comparison functions this is the smallest element. |
HeapAscendingDequeueAll(heap)
Signature: heap:List<'T> -> IEnumerable<'T>
Type parameters: 'T |
Removes and returns all items from the heap as an IEnumerable. For default comparison functiosn this is in ascending order. |
HeapAscendingEnqueue(heap, element)
Signature: (heap:List<'T> * element:'T) -> unit
Type parameters: 'T |
Adds an element to the heap, and maintains the heap condition. For default comparison functions the smallest item is on top of the heap. |
HeapAscendingRemoveAt(heap, index)
Signature: (heap:List<'T> * index:int) -> 'T
Type parameters: 'T |
Reomves an arbitrary element from the heap, maintains the heap conditions, and returns the removed element. |
HeapDequeue(heap, compare)
Signature: (heap:List<'T> * compare:Func<'T,'T,int>) -> 'T
Type parameters: 'T |
Removes and returns the item at the top of the heap (i.e. the 0th position of the list). For default comparison functions this is the smallest element. |
HeapDequeueAll(heap, compare)
Signature: (heap:List<'T> * compare:Func<'T,'T,int>) -> IEnumerable<'T>
Type parameters: 'T |
Removes and returns all items from the heap as an IEnumerable. For default comparison functiosn this is in ascending order. |
HeapDescendingDequeue(heap)
Signature: heap:List<'T> -> 'T
Type parameters: 'T |
Removes and returns the item at the top of the heap (i.e. the 0th position of the list). For default comparison functions this is the smallest element. |
HeapDescendingDequeueAll(heap)
Signature: heap:List<'T> -> IEnumerable<'T>
Type parameters: 'T |
Removes and returns all items from the heap as an IEnumerable. For default comparison functiosn this is in ascending order. |
HeapDescendingEnqueue(heap, element)
Signature: (heap:List<'T> * element:'T) -> unit
Type parameters: 'T |
Adds an element to the heap, and maintains the heap condition. For default comparison functions the smallest item is on top of the heap. |
HeapDescendingRemoveAt(heap, index)
Signature: (heap:List<'T> * index:int) -> 'T
Type parameters: 'T |
Reomves an arbitrary element from the heap, maintains the heap conditions, and returns the removed element. |
HeapEnqueue(heap, compare, element)
Signature: (heap:List<'T> * compare:Func<'T,'T,int> * element:'T) -> unit
Type parameters: 'T |
Adds an element to the heap, and maintains the heap condition. For default comparison functions the smallest item is on top of the heap. |
HeapRemoveAt(heap, compare, index)
Signature: (heap:List<'T> * compare:Func<'T,'T,int> * index:int) -> 'T
Type parameters: 'T |
Reomves an arbitrary element from the heap, maintains the heap conditions, and returns the removed element. |
LargestIndex(a)
Signature: a:List<'T> -> int
Type parameters: 'T |
|
Map(list, item_fun)
Signature: (list:List<'T> * item_fun:Func<'T,'Tr>) -> List<'Tr>
Type parameters: 'T, 'Tr |
Create a copy with the elements piped through a function. |
Map(list, item_index_fun)
Signature: (list:List<'T> * item_index_fun:Func<'T,int,'Tr>) -> List<'Tr>
Type parameters: 'T, 'Tr |
Create a copy with the elements piped through a function. |
Map2(list0, list1, item0_item1_fun)
Signature: (list0:List<'T0> * list1:List<'T1> * item0_item1_fun:Func<'T0,'T1,'Tr>) -> List<'Tr>
Type parameters: 'T0, 'T1, 'Tr |
|
Map2(...)
Signature: (list0:List<'T0> * list1:List<'T1> * item0_item1_index_fun:Func<'T0,'T1,int,'Tr>) -> List<'Tr>
Type parameters: 'T0, 'T1, 'Tr |
|
Map3(...)
Signature: (list0:List<'T0> * list1:List<'T1> * list2:List<'T2> * item0_item1_item2_fun:Func<'T0,'T1,'T2,'Tr>) -> List<'Tr>
Type parameters: 'T0, 'T1, 'T2, 'Tr |
|
Map3(...)
Signature: (list0:List<'T0> * list1:List<'T1> * list2:List<'T2> * item0_item1_item2_index_fun:Func<'T0,'T1,'T2,int,'Tr>) -> List<'Tr>
Type parameters: 'T0, 'T1, 'T2, 'Tr |
|
MapToArray(list, item_fun)
Signature: (list:List<'T> * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
MapToArray(list, count, item_fun)
Signature: (list:List<'T> * count:int * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
MapToArray(list, start, count, item_fun)
Signature: (list:List<'T> * start:int * count:int * item_fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
MergeSortAscending(a0, a1)
Signature: (a0:'T [] * a1:'T []) -> 'T []
Type parameters: 'T |
|
MergeSortedAscending(a0, a1)
Signature: (a0:List<'T> * a1:List<'T>) -> List<'T>
Type parameters: 'T |
|
NLargestIndex(a, n)
Signature: (a:List<'T> * n:int) -> int
Type parameters: 'T |
|
NLargestIndices(values, n)
Signature: (values:IEnumerable<'T> * n:int) -> List<ComparableIndexedValue<'T>>
Type parameters: 'T |
|
NLargestIndicesAscending(values, n)
Signature: (values:IEnumerable<'T> * n:int) -> IEnumerable<ComparableIndexedValue<'T>>
Type parameters: 'T |
|
NSmallestIndex(a, n)
Signature: (a:List<'T> * n:int) -> int
Type parameters: 'T |
|
NSmallestIndices(values, n)
Signature: (values:IEnumerable<'T> * n:int) -> List<ComparableIndexedValue<'T>>
Type parameters: 'T |
|
NSmallestIndicesDescending(values, n)
Signature: (values:IEnumerable<'T> * n:int) -> IEnumerable<ComparableIndexedValue<'T>>
Type parameters: 'T |
|
Set(self, value)
Signature: (self:List<'T> * value:'T) -> List<'T>
Type parameters: 'T |
Set all elements to the same supplied value. |
Set(self, fun)
Signature: (self:List<'T> * fun:Func<int,'T>) -> List<'T>
Type parameters: 'T |
Set all elements to a function of the element index. |
Set(self, start, count, value)
Signature: (self:List<'T> * start:int * count:int * value:'T) -> List<'T>
Type parameters: 'T |
Set count elements starting at the supplied index to the same supplied value. |
Set(self, start, count, fun)
Signature: (self:List<'T> * start:int * count:int * fun:Func<int64,'T>) -> List<'T>
Type parameters: 'T |
Set count elements starting at the supplied index to the same supplied value. |
SmallestIndex(a)
Signature: a:List<'T> -> int
Type parameters: 'T |
|
Swap(self, i, j)
Signature: (self:List<'T> * i:int * j:int) -> unit
Type parameters: 'T |
Swap the two elements specified by ther indices. |
ToArray(self, fun)
Signature: (self:List<'T> * fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
ToArray(self, count, fun)
Signature: (self:List<'T> * count:int * fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |
|
ToArray(self, start, count, fun)
Signature: (self:List<'T> * start:int * count:int * fun:Func<'T,'Tr>) -> 'Tr []
Type parameters: 'T, 'Tr |