partition
fn partition<T>(Vec<T> xs, T -> bool pred) -> Partitioned<T> Import
Source: use collections::vec::{partition}; src/collections/vec.hy Split xs into (matched, rest) by pred. Order inside each bucket is preserved.
Parameters#
| Name | Type |
|---|---|
xs | Vec<T> |
pred | T -> bool |
Returns#
Partitioned<T>
See also#
fold_int: The same asfold; kept for older code.contains: Returnstruewhenneedleis inxs.index_of: Returns the index of the firstneedleinxs, or-1.binary_search: Findsneedlein the ascending vectorxsby halving, and returns an index holding it.dedup: Returnsxswith runs of equal neighbours collapsed to one value.map: Returns a new vector withmapperapplied to each element, in order.filter: Returns the elements for whichpredistrue, in order.first: Returns the first element, orNonewhenxsis empty.