maplike 0.10.2

Derive macros for maplike.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

// SPDX-FileCopyrightText: 2026 maplike contributors
//
// SPDX-License-Identifier: MIT OR Apache-2.0

use bidimap::BiBTreeMap;

use crate::{
    Assign, Clear, Container, Get, GetByLeft, GetByRight, Insert, IntoIter, RemoveByLeft,
    RemoveByRight, Set,
};

impl<L, R> Container for BiBTreeMap<L, R> {
    type Key = L;
    type Value = R;
}

impl<L, R> Assign for BiBTreeMap<L, R> {
    #[inline(always)]
    fn assign(&mut self, value: Self) {
        *self = value;
    }
}

impl<L: Ord, R: Ord> Get<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn get(&self, key: &L) -> Option<&R> {
        BiBTreeMap::get_by_left(self, key)
    }
}

impl<L: Ord, R: Ord> GetByLeft<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn get_by_left(&self, key: &L) -> Option<&R> {
        BiBTreeMap::get_by_left(self, key)
    }
}

impl<L: Ord, R: Ord> GetByRight<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn get_by_right(&self, key: &R) -> Option<&L> {
        BiBTreeMap::get_by_right(self, key)
    }
}

impl<L: Ord, R: Ord> Set<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn set(&mut self, key: L, value: R) {
        BiBTreeMap::insert(self, key, value);
    }
}

impl<L: Ord, R: Ord> Insert<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn insert(&mut self, key: L, value: R) {
        BiBTreeMap::insert(self, key, value);
    }
}

impl<L: Ord, R: Ord> RemoveByLeft<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn remove_by_left(&mut self, key: &L) -> Option<R> {
        BiBTreeMap::remove_by_left(self, key).map(|(_, value)| value)
    }
}

impl<L: Ord, R: Ord> RemoveByRight<L> for BiBTreeMap<L, R> {
    #[inline(always)]
    fn remove_by_right(&mut self, key: &R) -> Option<L> {
        BiBTreeMap::remove_by_right(self, key).map(|(key, _)| key)
    }
}

impl<L: Ord, R: Ord> Clear for BiBTreeMap<L, R> {
    #[inline(always)]
    fn clear(&mut self) {
        BiBTreeMap::clear(self);
    }
}

impl<L, R> IntoIter<L> for BiBTreeMap<L, R> {
    type IntoIter = bidimap::btree::IntoIter<L, R>;

    #[inline(always)]
    fn into_iter(self) -> bidimap::btree::IntoIter<L, R> {
        IntoIterator::into_iter(self)
    }
}