Struct Ordered 

pub struct Ordered<T, V> { /* private fields */ }

A path whose index keeps its keys in order, so it answers ranges as well as equality.

A separate type rather than a flag on Path, because which questions a path can answer is decided when the type is written and there is no reason for the compiler not to know it. Docs::range takes one of these and nothing else, so asking an equality index for a range is a type error at the call site rather than a message at run time.

Implementations

impl<T, V> Ordered<T, V>

pub const fn new(path: &'static str) -> Ordered<T, V>

A path whose index is ordered.

The derive calls this.

pub const fn path(&self) -> &'static str

The path, as $.total.

Trait Implementations

impl<T, V> Clone for Ordered<T, V>

fn clone(&self) -> Ordered<T, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, V> Copy for Ordered<T, V>

impl<T, V> Debug for Ordered<T, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, V> From<Ordered<T, V>> for Path<T, V>

An ordered path answers equality too, so everything that takes a Path takes one of these.

fn from(o: Ordered<T, V>) -> Path<T, V>

Converts to this type from the input type.