smart_access 0.7.0

A minimalistic "lazy bidirectional pointer" framework.
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
143

use crate::at::At;
use core::ops;
use alloc::vec::Vec;


impl<T> At<()> for Vec<T> 
{
    type View = [T];

    fn access_at<R, F>(&mut self, _: (), f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        Some(f(self as &mut [T]))
    }
}


impl<T> At<usize> for Vec<T> 
{
    type View = T;

    fn access_at<R, F>(&mut self, i: usize, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        (self as &mut [T]).access_at(i,f)
    }
}


impl<T> At<ops::Range<usize>> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, i: ops::Range<usize>, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        if i.end > self.len() { return None; }
        if i.start > i.end    { return None; }

        let right_part   = self.split_off(i.end);
        let mut mid_part = self.split_off(i.start);

        let result = f(&mut mid_part);
        
        self.extend(mid_part);
        self.extend(right_part);

        Some(result)
    }
}


impl<T> At<ops::RangeFrom<usize>> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, i: ops::RangeFrom<usize>, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        if i.start > self.len() { return None; }

        let mut mid_part = self.split_off(i.start);

        let result = f(&mut mid_part);
        
        self.extend(mid_part);

        Some(result)
    }
}


impl<T> At<ops::RangeFull> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, _: ops::RangeFull, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        Some(f(self))
    }
}


impl<T> At<ops::RangeInclusive<usize>> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, i: ops::RangeInclusive<usize>, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        let (start, end) = (*i.start(), *i.end());

        if end >= self.len() { return None; }

        // overflow is prevented by the previous line
        if start > end+1   { return None; }

        let right_part   = self.split_off(end+1);
        let mut mid_part = self.split_off(start);

        let result = f(&mut mid_part);
        
        self.extend(mid_part);
        self.extend(right_part);

        Some(result)
    }
}


impl<T> At<ops::RangeTo<usize>> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, i: ops::RangeTo<usize>, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        if i.end > self.len() { return None; }

        let right_part = self.split_off(i.end);

        let result = f(self);
        
        self.extend(right_part);

        Some(result)
    }
}


impl<T> At<ops::RangeToInclusive<usize>> for Vec<T> {
    type View = Vec<T>;
    
    fn access_at<R, F>(&mut self, i: ops::RangeToInclusive<usize>, f: F) -> Option<R> where 
        F: FnOnce(&mut Self::View) -> R 
    {
        if i.end >= self.len() { return None; }

        let right_part = self.split_off(i.end+1);

        let result = f(self);
        
        self.extend(right_part);

        Some(result)
    }
}