cpp_map 0.2.0

A simple C++ std::map emulator
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

// SPDX-License-Identifier: MIT OR Apache-2.0

// Copyright 2025 Eadf (github.com/eadf)
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.

use crate::IsLessThan;
use crate::linkedlist::LinkedList;
use std::fmt::Debug;

pub struct LinkedListIter<'a, K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    linked_list: &'a LinkedList<K, V>,
    front: Option<usize>,
    back: Option<usize>,
    remaining: usize,
}

impl<'a, K, V> LinkedListIter<'a, K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    pub(super) fn new(
        list: &'a LinkedList<K, V>,
        front: Option<usize>,
        back: Option<usize>,
        len: usize,
    ) -> Self {
        Self {
            linked_list: list,
            front,
            back,
            remaining: len,
        }
    }

    pub fn rev(self) -> Rev<Self> {
        Rev(self)
    }
}

// Reverse iterator wrapper
pub struct Rev<I>(pub I);

impl<'a, K, V> Iterator for LinkedListIter<'a, K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    type Item = (&'a K, &'a V);

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(idx) = self.front {
            let result = self.linked_list.get_at_(idx);
            self.front = self.linked_list.next_pos_(idx);
            result
        } else {
            None
        }
    }
}

// Implementation for the reverse iterator wrapper
impl<I> Iterator for Rev<I>
where
    I: DoubleEndedIterator,
{
    type Item = I::Item;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next_back()
    }
}

impl<I> DoubleEndedIterator for Rev<I>
where
    I: DoubleEndedIterator,
{
    fn next_back(&mut self) -> Option<Self::Item> {
        self.0.next()
    }
}

// DoubleEndedIterator for forward iterator
impl<K, V> DoubleEndedIterator for LinkedListIter<'_, K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    fn next_back(&mut self) -> Option<Self::Item> {
        if let Some(idx) = self.back {
            let result = self.linked_list.get_at_(idx);
            self.back = self.linked_list.prev_pos_(idx);
            result
        } else {
            None
        }
    }
}

// ExactSizeIterator implementation
impl<K, V> ExactSizeIterator for LinkedListIter<'_, K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    fn len(&self) -> usize {
        self.remaining
    }
}

impl<K, V> LinkedList<K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    pub fn iter(&self) -> LinkedListIter<'_, K, V> {
        LinkedListIter::new(self, self.first_(), self.first_(), self.len())
    }
}

// Implement FromIterator for convenient initialization
impl<K, V> FromIterator<(K, V)> for LinkedList<K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self {
        let mut skip_list = LinkedList::default();
        for (k, v) in iter {
            let _ = skip_list.insert(k, v);
        }
        skip_list
    }
}