maplike 0.13.7

Rust traits for abstract containers and operations over them. Treats every container as map. You can have the same code work on Vec, HashMap, BTreeMap, Option, Box.
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

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

//! `One`, a collection that holds always exactly one element.

use crate::containers::Container;
use crate::iter::{IntoIter, IntoValues, Iter, Values};
use crate::ops::{Assign, Get, Len, Modify, Put, Set, WithOne};

/// A collection that holds exactly one element.
#[derive(Clone, Copy, Debug, Eq, Ord, PartialEq, PartialOrd)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[cfg_attr(feature = "serde", serde(transparent))]
pub struct One<V> {
    value: V,
}

impl<V> One<V> {
    /// Create a new always-single-valued collection.
    pub fn new(value: V) -> Self {
        Self { value }
    }
}

impl<V> Container for One<V> {
    type Key = usize;
    type Value = V;
}

impl<V> WithOne<V> for One<V> {
    #[inline(always)]
    fn with_one(value: V) -> Self {
        Self { value }
    }
}

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

impl<V> Get<usize> for One<V> {
    #[inline(always)]
    fn get(&self, index: &usize) -> Option<&V> {
        if *index == 0 { Some(&self.value) } else { None }
    }
}

impl<V> Set<usize> for One<V> {
    type Output = Option<V>;

    #[inline(always)]
    fn set(&mut self, index: usize, value: V) -> Option<V> {
        assert_eq!(index, 0);
        Some(core::mem::replace(&mut self.value, value))
    }
}

impl<V> Modify<usize> for One<V> {
    #[inline(always)]
    fn modify<F>(&mut self, index: &usize, f: F)
    where
        F: FnOnce(&mut V),
    {
        assert_eq!(*index, 0);
        f(&mut self.value)
    }
}

// No implementation of `Remove` because there is always exactly one element.
// Removing an element would violate this invariant property.

impl<V> Put<V> for One<V> {
    #[inline(always)]
    fn put(&mut self, value: V) -> Option<V> {
        Some(core::mem::replace(&mut self.value, value))
    }
}

// No implementation of `Clear` for the same reason as `Remove`.

impl<V> Len for One<V> {
    #[inline(always)]
    fn len(&self) -> usize {
        1
    }
}

impl<'a, V: 'a> Values<'a> for One<V> {
    type Values = core::iter::Once<&'a V>;

    #[inline(always)]
    fn values(&'a self) -> Self::Values {
        core::iter::once(&self.value)
    }
}

impl<V> IntoValues for One<V> {
    type IntoValues = core::iter::Once<V>;

    #[inline(always)]
    fn into_values(self) -> Self::IntoValues {
        core::iter::once(self.value)
    }
}

impl<'a, V: 'a> Iter<'a, usize> for One<V> {
    type Iter = core::iter::Once<(usize, &'a V)>;

    #[inline(always)]
    fn iter(&'a self) -> Self::Iter {
        core::iter::once((0, &self.value))
    }
}

impl<V> IntoIter<usize> for One<V> {
    type IntoIter = core::iter::Enumerate<core::iter::Once<V>>;

    #[inline(always)]
    fn into_iter(self) -> Self::IntoIter {
        core::iter::once(self.value).enumerate()
    }
}