Struct ByFirst 

pub struct ByFirst<'q, Q: ?Sized + 'q>(pub &'q Q);

Wrapper type for getting second keys/values with first keys/values via Index.

To assume that by-first is the “default” would be incorrect, so thus you one can wrap their indices with this and all is swell.

Examples

use bidir_map::{BidirMap, ByFirst};

let mut map = BidirMap::new();
map.insert(1, "a");
assert_eq!(map[ByFirst(&1)], "a");
assert_eq!(map[&ByFirst(&1)], "a");

Tuple Fields

0: &'q Q

Trait Implementations

impl<'q, Q: Clone + ?Sized + 'q> Clone for ByFirst<'q, Q>

fn clone(&self) -> ByFirst<'q, Q>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'q, Q: Hash + ?Sized + 'q> Hash for ByFirst<'q, Q>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, 'q, Kv1, Kv2: PartialEq, Q> Index<&'a ByFirst<'q, Q>> for BidirMap<Kv1, Kv2>

where Kv1: Borrow<Q> + PartialEq, Q: PartialEq<Kv1> + ?Sized + 'q,

type Output = Kv2

The returned type after indexing.

fn index(&self, key: &ByFirst<'_, Q>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'q, Kv1, Kv2: PartialEq, Q> Index<ByFirst<'q, Q>> for BidirMap<Kv1, Kv2>

where Kv1: Borrow<Q> + PartialEq, Q: PartialEq<Kv1> + ?Sized + 'q,

type Output = Kv2

The returned type after indexing.

fn index(&self, key: ByFirst<'_, Q>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'q, Q: Ord + ?Sized + 'q> Ord for ByFirst<'q, Q>

fn cmp(&self, other: &ByFirst<'q, Q>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'q, Q: PartialEq + ?Sized + 'q> PartialEq for ByFirst<'q, Q>

fn eq(&self, other: &ByFirst<'q, Q>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'q, Q: PartialOrd + ?Sized + 'q> PartialOrd for ByFirst<'q, Q>

fn partial_cmp(&self, other: &ByFirst<'q, Q>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'q, Q: Copy + ?Sized + 'q> Copy for ByFirst<'q, Q>

impl<'q, Q: Eq + ?Sized + 'q> Eq for ByFirst<'q, Q>

impl<'q, Q: ?Sized + 'q> StructuralPartialEq for ByFirst<'q, Q>