Std.Iter
25 public declarations
- count
&Q -> Int where Q: SequenceHow many items a sequence yields.
- drop
Q -> Int -> Std.Iter.Dropped[Q, T]Everything after the first `skip` items.
- Dropped
A sequence of another's items past the first `skip`.
- empty
Std.Iter.Empty[T]The sequence with no items.
- Empty
A walk that yields nothing.
- filter
Q -> fn(T) -> Bool -> Std.Iter.Filtered[Q, T]Keep only the items a test accepts.
- Filtered
A sequence of another's items that satisfy a test.
- indexed
Array[T] -> Std.Iter.Indexed[T]Pair each of an array's items with its position.
- Indexed
A walk over an array's items paired with their positions.
- isEmpty
&Q -> Bool where Q: SequenceWhether a sequence yields nothing.
- items
Array[T] -> Std.Iter.Items[T]Walk an array's items.
- Items
A walk over an array's items.
- map
Q -> fn(A) -> B -> Std.Iter.Mapped[Q, A, B]Transform each item of a sequence as it is produced.
- Mapped
A sequence whose items are another's, transformed.
- range
N -> N -> Std.Iter.Range[N]The numbers from `first` up to but not including `last`.
- Range
A half-open range of whole numbers, from `first` up to but not including
- repeat
T -> Int -> Std.Iter.Repeated[T]The same value, `count` times.
- Repeated
A walk that yields the same item a fixed number of times.
- Sequence
A value that produces a sequence of items.
- sum
&Q -> Option[N] where N: Add, Q: SequenceThe sum of a sequence's items, or `None` when it has no first value.
- take
Q -> Int -> Std.Iter.Taken[Q, T]The first `limit` items, or all of them if there are fewer.
- Taken
A sequence of at most the first `limit` items of another.
- toArray
&Q -> Array[T] where Q: SequenceCollect a sequence into an array.
- zip
P -> Q -> Std.Iter.Zipped[P, Q, A, B]Pair two sequences, ending when either does.
- Zipped
A sequence pairing two others item by item.
