rayon-hash 0.5.0

(deprecated) HashMap and HashSet with support for Rayon parallel iterators
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
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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
/// Rayon extensions to `RawTable`
use std::marker;
use std::ptr;

use rayon::iter::plumbing::*;
use rayon::prelude::*;

use crate::std_hash::table::{RawBucket, RawTable};

struct SplitBuckets<'a, K, V> {
    bucket: RawBucket<K, V>,
    end: usize,
    marker: marker::PhantomData<&'a ()>,
}

impl<'a, K, V> SplitBuckets<'a, K, V> {
    fn new(table: &'a RawTable<K, V>) -> Self {
        SplitBuckets {
            bucket: table.raw_bucket_at(0),
            end: table.capacity(),
            marker: marker::PhantomData,
        }
    }

    fn split<P: From<Self>>(&self) -> (P, Option<P>) {
        let mut left = SplitBuckets { ..*self };
        let len = left.end - left.bucket.index();
        if len > 1 {
            let mut right = SplitBuckets { ..left };
            right.bucket.index_add(len / 2);
            left.end = right.bucket.index();
            (P::from(left), Some(P::from(right)))
        } else {
            (P::from(left), None)
        }
    }
}

impl<'a, K, V> Iterator for SplitBuckets<'a, K, V> {
    type Item = RawBucket<K, V>;

    fn next(&mut self) -> Option<Self::Item> {
        while self.bucket.index() < self.end {
            let item = self.bucket;
            self.bucket.index_add(1);

            unsafe {
                if !item.is_empty() {
                    return Some(item);
                }
            }
        }
        None
    }
}

/// Parallel iterator over shared references to entries in a map.
pub struct ParIter<'a, K: 'a, V: 'a> {
    table: &'a RawTable<K, V>,
}

impl<'a, K: Sync, V: Sync> IntoParallelIterator for &'a RawTable<K, V> {
    type Item = (&'a K, &'a V);
    type Iter = ParIter<'a, K, V>;

    fn into_par_iter(self) -> Self::Iter {
        ParIter { table: self }
    }
}

impl<'a, K: Sync, V: Sync> ParallelIterator for ParIter<'a, K, V> {
    type Item = (&'a K, &'a V);

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        let buckets = SplitBuckets::new(self.table);
        let producer = ParIterProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParIterProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParIterProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self { iter }
    }
}

unsafe impl<'a, K: Sync, V: Sync> Send for ParIterProducer<'a, K, V> {}

impl<'a, K: Sync, V: Sync> UnindexedProducer for ParIterProducer<'a, K, V> {
    type Item = (&'a K, &'a V);

    fn split(self) -> (Self, Option<Self>) {
        self.iter.split()
    }

    fn fold_with<F>(self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.map(|bucket| unsafe {
            let pair_ptr = bucket.pair();
            (&(*pair_ptr).0, &(*pair_ptr).1)
        });
        folder.consume_iter(iter)
    }
}

/// Parallel iterator over shared references to keys in a map.
pub struct ParKeys<'a, K: 'a, V: 'a> {
    table: &'a RawTable<K, V>,
}

unsafe impl<'a, K: Sync, V> Send for ParKeys<'a, K, V> {}

impl<K: Sync, V> RawTable<K, V> {
    pub fn par_keys(&self) -> ParKeys<K, V> {
        ParKeys { table: self }
    }
}

impl<'a, K: Sync, V> ParallelIterator for ParKeys<'a, K, V> {
    type Item = &'a K;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        let buckets = SplitBuckets::new(self.table);
        let producer = ParKeysProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParKeysProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParKeysProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self { iter }
    }
}

unsafe impl<'a, K: Sync, V> Send for ParKeysProducer<'a, K, V> {}

impl<'a, K: Sync, V> UnindexedProducer for ParKeysProducer<'a, K, V> {
    type Item = &'a K;

    fn split(self) -> (Self, Option<Self>) {
        self.iter.split()
    }

    fn fold_with<F>(self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.map(|bucket| unsafe {
            let pair_ptr = bucket.pair();
            &(*pair_ptr).0
        });
        folder.consume_iter(iter)
    }
}

/// Parallel iterator over shared references to values in a map.
pub struct ParValues<'a, K: 'a, V: 'a> {
    table: &'a RawTable<K, V>,
}

unsafe impl<'a, K, V: Sync> Send for ParValues<'a, K, V> {}

impl<K, V: Sync> RawTable<K, V> {
    pub fn par_values(&self) -> ParValues<K, V> {
        ParValues { table: self }
    }
}

impl<'a, K, V: Sync> ParallelIterator for ParValues<'a, K, V> {
    type Item = &'a V;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        let buckets = SplitBuckets::new(self.table);
        let producer = ParValuesProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParValuesProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParValuesProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self { iter }
    }
}

unsafe impl<'a, K, V: Sync> Send for ParValuesProducer<'a, K, V> {}

impl<'a, K, V: Sync> UnindexedProducer for ParValuesProducer<'a, K, V> {
    type Item = &'a V;

    fn split(self) -> (Self, Option<Self>) {
        self.iter.split()
    }

    fn fold_with<F>(self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.map(|bucket| unsafe {
            let pair_ptr = bucket.pair();
            &(*pair_ptr).1
        });
        folder.consume_iter(iter)
    }
}

/// Parallel iterator over mutable references to entries in a map.
pub struct ParIterMut<'a, K: 'a, V: 'a> {
    table: &'a mut RawTable<K, V>,
}

unsafe impl<'a, K: Sync, V: Send> Send for ParIterMut<'a, K, V> {}

impl<'a, K: Sync, V: Send> IntoParallelIterator for &'a mut RawTable<K, V> {
    type Item = (&'a K, &'a mut V);
    type Iter = ParIterMut<'a, K, V>;

    fn into_par_iter(self) -> Self::Iter {
        ParIterMut { table: self }
    }
}

impl<'a, K: Sync, V: Send> ParallelIterator for ParIterMut<'a, K, V> {
    type Item = (&'a K, &'a mut V);

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        let buckets = SplitBuckets::new(self.table);
        let producer = ParIterMutProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParIterMutProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
    // To ensure invariance with respect to V
    marker: marker::PhantomData<&'a mut V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParIterMutProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self {
            iter,
            marker: marker::PhantomData,
        }
    }
}

unsafe impl<'a, K: Sync, V: Send> Send for ParIterMutProducer<'a, K, V> {}

impl<'a, K: Sync, V: Send> UnindexedProducer for ParIterMutProducer<'a, K, V> {
    type Item = (&'a K, &'a mut V);

    fn split(self) -> (Self, Option<Self>) {
        self.iter.split()
    }

    fn fold_with<F>(self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.map(|bucket| unsafe {
            let pair_ptr = bucket.pair();
            (&(*pair_ptr).0, &mut (*pair_ptr).1)
        });
        folder.consume_iter(iter)
    }
}

/// Parallel iterator over mutable references to values in a map.
pub struct ParValuesMut<'a, K: 'a, V: 'a> {
    table: &'a mut RawTable<K, V>,
}

unsafe impl<'a, K, V: Send> Send for ParValuesMut<'a, K, V> {}

impl<K, V: Send> RawTable<K, V> {
    pub fn par_values_mut(&mut self) -> ParValuesMut<K, V> {
        ParValuesMut { table: self }
    }
}

impl<'a, K, V: Send> ParallelIterator for ParValuesMut<'a, K, V> {
    type Item = &'a mut V;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        let buckets = SplitBuckets::new(self.table);
        let producer = ParValuesMutProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParValuesMutProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
    // To ensure invariance with respect to V
    marker: marker::PhantomData<&'a mut V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParValuesMutProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self {
            iter,
            marker: marker::PhantomData,
        }
    }
}

unsafe impl<'a, K, V: Send> Send for ParValuesMutProducer<'a, K, V> {}

impl<'a, K, V: Send> UnindexedProducer for ParValuesMutProducer<'a, K, V> {
    type Item = &'a mut V;

    fn split(self) -> (Self, Option<Self>) {
        self.iter.split()
    }

    fn fold_with<F>(self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.map(|bucket| unsafe {
            let pair_ptr = bucket.pair();
            &mut (*pair_ptr).1
        });
        folder.consume_iter(iter)
    }
}

/// Parallel iterator over the entries in a map, consuming it.
pub struct ParIntoIter<K, V> {
    table: RawTable<K, V>,
}

impl<K: Send, V: Send> IntoParallelIterator for RawTable<K, V> {
    type Item = (K, V);
    type Iter = ParIntoIter<K, V>;

    fn into_par_iter(self) -> Self::Iter {
        ParIntoIter { table: self }
    }
}

impl<K: Send, V: Send> ParallelIterator for ParIntoIter<K, V> {
    type Item = (K, V);

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        // Pre-set the map size to zero, indicating all items drained.
        let mut table = self.table;
        unsafe {
            table.set_size(0);
        }

        let buckets = SplitBuckets::new(&table);
        let producer = ParIntoIterProducer::from(buckets);
        bridge_unindexed(producer, consumer)
    }
}

struct ParIntoIterProducer<'a, K: 'a, V: 'a> {
    iter: SplitBuckets<'a, K, V>,
}

impl<'a, K, V> From<SplitBuckets<'a, K, V>> for ParIntoIterProducer<'a, K, V> {
    fn from(iter: SplitBuckets<'a, K, V>) -> Self {
        Self { iter }
    }
}

unsafe impl<'a, K: Send, V: Send> Send for ParIntoIterProducer<'a, K, V> {}

impl<'a, K: Send, V: Send> UnindexedProducer for ParIntoIterProducer<'a, K, V> {
    type Item = (K, V);

    fn split(mut self) -> (Self, Option<Self>) {
        // We must not drop self yet!
        let (left, right) = self.iter.split();
        self.iter = left;
        (self, right.map(Self::from))
    }

    fn fold_with<F>(mut self, folder: F) -> F
    where
        F: Folder<Self::Item>,
    {
        let iter = self.iter.by_ref().map(|bucket| unsafe {
            bucket.set_empty();
            ptr::read(bucket.pair())
        });
        folder.consume_iter(iter)
    }
}

impl<'a, K: 'a, V: 'a> Drop for ParIntoIterProducer<'a, K, V> {
    fn drop(&mut self) {
        while let Some(bucket) = self.iter.next() {
            unsafe {
                bucket.set_empty();
                ptr::drop_in_place(bucket.pair());
            }
        }
    }
}