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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
use array_trait::Array;
use slice_ops::{ops::SliceFind, AsSlice};
use core::ops::AsyncFn;
use crate::future::TryActions;
use super::ArrayEnumerateMap;
#[const_trait]
pub trait ArrayFind<T, const N: usize>: Array + AsSlice<Item = T>
{
/// Performs a linear search for the first value that equals `x`.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let i = x.find(&5).unwrap();
///
/// assert_eq!(i, 4);
/// assert_eq!(x[i], 5);
/// ```
fn find(&self, x: &T) -> Option<usize>
where
T: PartialEq;
/// Performs a linear search for the first value that satisfies the given predicate.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let f = |&xn| xn > 5;
///
/// let i = x.find_by(f).unwrap();
///
/// assert_eq!(i, 5);
/// ```
fn find_by<'a, F>(&'a self, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a;
/// Performs a linear search for the first value that matches the given key given a hashing function.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let f = |&xn| xn % 2;
///
/// let i = x.find_by_key(&0, f).unwrap();
///
/// assert_eq!(i, 2);
/// ```
fn find_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a;
/// Performs a linear search from the right for the first value that equals `x`.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let i = x.rfind(&5).unwrap();
///
/// assert_eq!(i, 8);
/// assert_eq!(x[i], 5);
/// ```
fn rfind(&self, x: &T) -> Option<usize>
where
T: PartialEq;
/// Performs a linear search from the right for the first value that satisfies the given predicate.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let f = |&xn| xn > 5;
///
/// let i = x.rfind_by(f).unwrap();
///
/// assert_eq!(i, 7);
/// ```
fn rfind_by<'a, F>(&'a self, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a;
/// Performs a linear search from the right for the first value that matches the given key given a hashing function.
///
/// # Example
///
/// ```rust
/// use array__ops::ops::*;
///
/// // v
/// let x = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3];
///
/// let f = |&xn| xn % 2;
///
/// let i = x.rfind_by_key(&0, f).unwrap();
///
/// assert_eq!(i, 7);
/// ```
fn rfind_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a;
async fn find_async(&self, x: &T) -> Option<usize>
where
T: PartialEq;
async fn find_by_async<'a, F>(&'a self, f: F) -> Option<usize>
where
F: AsyncFn(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a;
async fn find_by_key_async<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: AsyncFn(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a;
}
impl<T, const N: usize> ArrayFind<T, N> for [T; N]
{
fn find(&self, x: &T) -> Option<usize>
where
T: PartialEq
{
self.as_slice().find(x)
}
fn find_by<'a, F>(&'a self, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a
{
self.as_slice().find_by(f)
}
fn find_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a
{
self.as_slice().find_by_key(b, f)
}
fn rfind(&self, x: &T) -> Option<usize>
where
T: PartialEq
{
self.as_slice().rfind(x)
}
fn rfind_by<'a, F>(&'a self, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a
{
self.as_slice().rfind_by(f)
}
fn rfind_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: FnMut(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a
{
self.as_slice().rfind_by_key(b, f)
}
async fn find_async(&self, needle: &T) -> Option<usize>
where
T: PartialEq
{
self.find_by_async(async |x| x == needle).await
}
async fn find_by_async<'a, F>(&'a self, f: F) -> Option<usize>
where
F: AsyncFn(&'a T) -> bool /*+ ~const Destruct*/,
T: 'a
{
let ff = async |i, x| {
if f(x).await
{
Err(i)
}
else
{
Ok(())
}
};
#[allow(clippy::redundant_closure)]
TryActions::new(self.enumerate_map_ref(|i, x| ff(i, x))).await.err()
}
async fn find_by_key_async<'a, B, F>(&'a self, b: &B, f: F) -> Option<usize>
where
F: AsyncFn(&'a T) -> B /*+ ~const Destruct*/,
B: PartialEq,
T: 'a
{
let ff = async |i, x| {
if f(x).await == *b
{
Err(i)
}
else
{
Ok(())
}
};
#[allow(clippy::redundant_closure)]
TryActions::new(self.enumerate_map_ref(|i, x| ff(i, x))).await.err()
}
}