Struct SORTING_STRATEGIES

pub struct SORTING_STRATEGIES { /* private fields */ }

Methods from Deref<Target = Map<&'static str, OrdFn>>

pub fn len(&self) -> usize

Returns the number of entries in the Map.

pub fn is_empty(&self) -> bool

Returns true if the Map is empty.

pub fn contains_key<T>(&self, key: &T) -> bool

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

Determines if key is in the Map.

pub fn get<T>(&self, key: &T) -> Option<&V>

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

Returns a reference to the value that key maps to.

pub fn get_key<T>(&self, key: &T) -> Option<&K>

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

Returns a reference to the map’s internal static instance of the given key.

This can be useful for interning schemes.

pub fn get_entry<T>(&self, key: &T) -> Option<(&K, &V)>

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

Like get, but returns both the key and the value.

pub fn entries(&self) -> Entries<'_, K, V>

Returns an iterator over the key/value pairs in the map.

Entries are returned in an arbitrary but fixed order.

pub fn keys(&self) -> Keys<'_, K, V>

Returns an iterator over the keys in the map.

Keys are returned in an arbitrary but fixed order.

pub fn values(&self) -> Values<'_, K, V>

Returns an iterator over the values in the map.

Values are returned in an arbitrary but fixed order.

Trait Implementations

impl Deref for SORTING_STRATEGIES

type Target = Map<&'static str, fn(&PathBuf) -> Key>

The resulting type after dereferencing.

fn deref(&self) -> &Map<&'static str, OrdFn>

Dereferences the value.

impl LazyStatic for SORTING_STRATEGIES