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
use super::UnorderedMap;
use crate::collections::vector;
use borsh::{BorshDeserialize, BorshSerialize};
use std::iter::FusedIterator;
impl<'a, K, V> IntoIterator for &'a UnorderedMap<K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
type Item = (K, V);
type IntoIter = Iter<'a, K, V>;
fn into_iter(self) -> Self::IntoIter {
self.iter()
}
}
pub struct Iter<'a, K, V> {
keys: vector::Iter<'a, K>,
values: vector::Iter<'a, V>,
}
impl<'a, K, V> Iter<'a, K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
pub(super) fn new(map: &'a UnorderedMap<K, V>) -> Self {
Self { keys: map.keys.iter(), values: map.values.iter() }
}
}
impl<'a, K, V> Iterator for Iter<'a, K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
type Item = (K, V);
fn next(&mut self) -> Option<Self::Item> {
<Self as Iterator>::nth(self, 0)
}
fn nth(&mut self, n: usize) -> Option<Self::Item> {
Some((self.keys.nth(n)?, self.values.nth(n)?))
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.keys.size_hint()
}
fn count(self) -> usize {
self.keys.count()
}
}
impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
}
impl<'a, K, V> FusedIterator for Iter<'a, K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
}
impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V>
where
K: BorshSerialize + BorshDeserialize,
V: BorshSerialize + BorshDeserialize,
{
fn next_back(&mut self) -> Option<Self::Item> {
<Self as DoubleEndedIterator>::nth_back(self, 0)
}
fn nth_back(&mut self, n: usize) -> Option<Self::Item> {
Some((self.keys.nth_back(n)?, self.values.nth_back(n)?))
}
}