Seq
This module contains additional functions for working with sequences.
Deedle.Internals
is opened, it extends the standard Seq
module.
Functions and values
Function or value | Description |
alignWithOrdering seq1 seq2 comparer
Signature:seq1:seq<'T * 'TAddress> -> seq2:seq<'T * 'TAddress> -> comparer:IComparer<'T> -> seq<'T * 'TAddress option * 'TAddress option>
Type parameters: 'T, 'TAddress |
Align two ordered sequences of
|
alignWithoutOrdering seq1 seq2
Signature:seq1:seq<'T * 'TAddress> -> seq2:seq<'T * 'TAddress> -> seq<'T * 'TAddress option * 'TAddress option>
Type parameters: 'T, 'TAddress |
Align two unordered sequences of |
chunkedUsing comparer dir keys input
Signature:comparer:Comparer<'?8044> -> dir:Direction -> keys:seq<'?8044> -> input:seq<'?8044> -> seq<'?8044 * '?8044 list>
Type parameters: '?8044 |
Generate non-overlapping chunks from the input sequence. Chunks are aligned
to the specified keys. The |
chunkedWhile f input
Signature:f:('?8042 -> '?8042 -> bool) -> input:seq<'?8042> -> seq<'?8042 []>
Type parameters: '?8042 |
Generate non-verlapping chunks from the input sequence. A chunk is started
at the beginning and then immediately after the end of the previous chunk.
To find the end of the chunk, the function calls the provided argument |
chunkedWithBounds size boundary input
Signature:size:int -> boundary:Boundary -> input:seq<'?8048> -> seq<DataSegment<'?8048 []>>
Type parameters: '?8048 |
Similar to |
getEnumerator s
Signature:s:seq<'?8036> -> IEnumerator<'?8036>
Type parameters: '?8036 |
Calls the |
headOrNone input
Signature:input:seq<'?8032> -> '?8032 option
Type parameters: '?8032 |
If the input is non empty, returns |
isSorted data comparer
Signature:data:seq<'T> -> comparer:IComparer<'T> -> bool
Type parameters: 'T |
Returns true if the specified sequence is sorted. |
lastFew count input
Signature:count:int -> input:seq<'?8034> -> seq<'?8034>
Type parameters: '?8034 |
Returns the specified number of elements from the end of the sequence Note that this needs to store the specified number of elements in memory and it needs to iterate over the entire sequence. |
startAndEnd startCount endCount input
Signature:startCount:int -> endCount:int -> input:seq<'?8038> -> seq<Choice<'?8038,unit,'?8038>>
Type parameters: '?8038 |
Given a sequence, returns |
structuralEquals s1 s2
Signature:s1:seq<'T> -> s2:seq<'T> -> bool
Type parameters: 'T |
Comapre two sequences using the |
structuralHash s
Signature:s:seq<'T> -> int
Type parameters: 'T |
Calculate hash code of a sequence, based on the values |
tryFirstAndLast input
Signature:input:seq<'?8052> -> ('?8052 * '?8052) option
Type parameters: '?8052 |
Returns the first and the last element from a sequence or 'None' if the sequence is empty |
windowedWhile f input
Signature:f:('T -> 'T -> bool) -> input:seq<'T> -> seq<'T []>
Type parameters: 'T |
Generate floating windows from the input sequence. New floating window is
started for each element. To find the end of the window, the function calls
the provided argument |
windowedWithBounds size boundary input
Signature:size:int -> boundary:Boundary -> input:seq<'T> -> seq<DataSegment<'T []>>
Type parameters: 'T |
A version of
The result is a sequence of |