Files
addr2line
adler
aho_corasick
ansi_term
arraydeque
as_slice
atty
backtrace
base64
bincode_core
bitflags
byteorder
bytes
capnp
capnp_futures
capnp_rpc
cfg_if
chrono
clap
ctrlc
derivative
dlib
downcast_rs
enumflags2
enumflags2_derive
evdev_rs
evdev_sys
failure
failure_derive
flexi_logger
futures
futures_channel
futures_core
futures_executor
futures_io
futures_macro
futures_sink
futures_task
futures_util
async_await
future
io
lock
sink
stream
task
generic_array
getrandom
gimli
glob
hash32
heapless
hid_io_core
hid_io_protocol
hidapi
install_service
lazy_static
libc
libloading
libudev_sys
log
memchr
memmap
miniz_oxide
mio
nanoid
nix
num_cpus
num_enum
num_enum_derive
num_integer
num_traits
object
once_cell
open
pem
pin_project_lite
pin_utils
ppv_lite86
proc_macro2
proc_macro_hack
proc_macro_nested
quote
rand
rand_chacha
rand_core
rcgen
regex
regex_syntax
remove_dir_all
ring
rustc_demangle
rustls
scoped_tls
sct
serde
serde_derive
slab
smallvec
spin
stable_deref_trait
strsim
syn
synstructure
sys_info
tempfile
textwrap
thiserror
thiserror_impl
time
tokio
future
io
loom
macros
net
park
runtime
stream
sync
task
time
util
tokio_macros
tokio_rustls
tokio_util
typenum
udev
uhid_virt
uhidrs_sys
unicode_width
unicode_xid
untrusted
vec_map
wayland_client
wayland_commons
wayland_sys
webpki
which
x11
xcb
xkbcommon
yansi
yasna
zwp_virtual_keyboard
 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
#[cfg(feature = "vec_map")]
pub use vec_map::{Values, VecMap};

#[cfg(not(feature = "vec_map"))]
pub use self::vec_map::{Values, VecMap};

#[cfg(not(feature = "vec_map"))]
mod vec_map {
    use std::collections::btree_map;
    use std::collections::BTreeMap;
    use std::fmt::{self, Debug, Formatter};

    #[derive(Clone, Default, Debug)]
    pub struct VecMap<V> {
        inner: BTreeMap<usize, V>,
    }

    impl<V> VecMap<V> {
        pub fn new() -> Self {
            VecMap {
                inner: Default::default(),
            }
        }

        pub fn len(&self) -> usize {
            self.inner.len()
        }

        pub fn is_empty(&self) -> bool {
            self.inner.is_empty()
        }

        pub fn insert(&mut self, key: usize, value: V) -> Option<V> {
            self.inner.insert(key, value)
        }

        pub fn values(&self) -> Values<V> {
            self.inner.values()
        }

        pub fn iter(&self) -> Iter<V> {
            Iter {
                inner: self.inner.iter(),
            }
        }

        pub fn contains_key(&self, key: usize) -> bool {
            self.inner.contains_key(&key)
        }

        pub fn entry(&mut self, key: usize) -> Entry<V> {
            self.inner.entry(key)
        }

        pub fn get(&self, key: usize) -> Option<&V> {
            self.inner.get(&key)
        }
    }

    pub type Values<'a, V> = btree_map::Values<'a, usize, V>;

    pub type Entry<'a, V> = btree_map::Entry<'a, usize, V>;

    #[derive(Clone)]
    pub struct Iter<'a, V: 'a> {
        inner: btree_map::Iter<'a, usize, V>,
    }

    impl<'a, V: 'a + Debug> Debug for Iter<'a, V> {
        fn fmt(&self, f: &mut Formatter) -> fmt::Result {
            f.debug_list().entries(self.inner.clone()).finish()
        }
    }

    impl<'a, V: 'a> Iterator for Iter<'a, V> {
        type Item = (usize, &'a V);

        fn next(&mut self) -> Option<Self::Item> {
            self.inner.next().map(|(k, v)| (*k, v))
        }
    }

    impl<'a, V: 'a> DoubleEndedIterator for Iter<'a, V> {
        fn next_back(&mut self) -> Option<Self::Item> {
            self.inner.next_back().map(|(k, v)| (*k, v))
        }
    }
}