Skip to content

std::reverse

A wrapper that reverses a value’s order, for sorting one key of a tuple key descending: (Reverse.of(r.points), r.name).

Import with import std::reverse.

Types

struct Reverse<T>
    value: T
end

A value whose order is the reverse of its type’s: Reverse.of(a) < Reverse.of(b) exactly when b < a. It sorts one key of a tuple key descending while the others stay ascending, for any Comparable type, strings and dates included: (Reverse.of(r.points), r.name) orders by points, highest first, then by name. As a max_by or min_by key it turns one into the other.

To sort a whole list descending, pass Direction.Descending to Iter.sort or Iter.sort_by instead.

import std::iter.Iter
import std::maybe.Maybe.Some
import std::reverse.Reverse

assert Reverse.of(1) > Reverse.of(2)

rows = [("cy", "ann"), ("bob", "zed"), ("ann", "ann")]
by_owner = Iter.sort_by(rows, fn (name, owner) -> (Reverse.of(owner), name))
assert by_owner == [("bob", "zed"), ("ann", "ann"), ("cy", "ann")]

assert Iter.max_by(["bb", "a", "ccc"], fn s -> Reverse.of(s)) == Some("a")
fn of(value: T) -> Reverse<T>

type function on Reverse

value, ordered in reverse.

impl Comparable for Reverse<T>

fn compare(a: Reverse<T>, b: Reverse<T>) -> Ordering

impl Comparable.compare

impl Debug for Reverse<T>

fn inspect<T>(value: Reverse<T>) -> String where T: Debug

impl Debug.inspect