take -package:bytestring package:vector
O(1) Yield at the first n elements without copying.
The vector may contain less than n elements, in which case it
is returned unchanged.
O(1) Yield the first n elements without copying. The
vector may contain less than n elements, in which case it is
returned unchanged.
Take the n first elements of the mutable vector without
making a copy. For negative n, the empty vector is returned.
If n is larger than the vector's length, the vector is
returned unchanged.
Take the n first elements of the mutable vector without
making a copy. For negative n, the empty vector is returned.
If n is larger than the vector's length, the vector is
returned unchanged.
O(1) Yield at the first n elements without copying.
The vector may contain less than n elements, in which case it
is returned unchanged.
Take the n first elements of the mutable vector without
making a copy. For negative n, the empty vector is returned.
If n is larger than the vector's length, the vector is
returned unchanged.
O(1) Yield at the first n elements without copying.
The vector may contain less than n elements, in which case it
is returned unchanged.
Take the n first elements of the mutable vector without
making a copy. For negative n, the empty vector is returned.
If n is larger than the vector's length, the vector is
returned unchanged.
O(1) Yield at the first n elements without copying.
The vector may contain less than n elements, in which case it
is returned unchanged.
Take the n first elements of the mutable vector without
making a copy. For negative n, the empty vector is returned.
If n is larger than the vector's length, the vector is
returned unchanged.
O(n) Yield the longest prefix of elements satisfying the
predicate. The current implementation is not copy-free, unless the
result vector is fused away.
Longest prefix of elements that satisfy the predicate
Longest prefix of elements that satisfy the predicate
Longest prefix of elements that satisfy the monadic predicate
O(n) Yield the longest prefix of elements satisfying the
predicate. The current implementation is not copy-free, unless the
result vector is fused away.
O(n) Yield the longest prefix of elements satisfying the
predicate. The current implementation is not copy-free, unless the
result vector is fused away.
O(n) Yield the longest prefix of elements satisfying the
predicate. The current implementation is not copy-free, unless the
result vector is fused away.
O(n) Yield the longest prefix of elements satisfying the
predicate. The current implementation is not copy-free, unless the
result vector is fused away.
O(1) Yield the first n elements without copying. The
vector must contain at least n elements, but this is not
checked.
O(1) Yield the first n elements without copying. The
vector must contain at least n elements, but this is not
checked.
Unsafe variant of
take. If
n is out of range, it will
simply create an invalid slice that likely violate memory safety.
Unsafe variant of
take. If
n is out of range, it will
simply create an invalid slice that likely violate memory safety.