deterministic_rand 0.8.0

Hierarchical random number generators for concurrent simulations with switchable determinism.
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


//!
//! Extensions of iterator for determinism.
//!

/// Define a private namespace for all its items.
mod private
{

  use core ::cmp ::Ordering;
  #[ cfg( feature = "determinism" ) ]
  extern crate alloc;
  #[ cfg( feature = "determinism" ) ]
  use alloc ::vec ::IntoIter;
  #[ cfg( feature = "determinism" ) ]
  use ::itertools ::Itertools;

  /// Extensions of iterator to sort items of the iterator. Replaced by a no-op when determinism is switched off.
  /// Useful, for example, to eliminate non-deterministic iteration of `HashMap` and `HashSet` keys.
  #[ sealed ::sealed ]
  pub trait IfDeterminismIteratorExt: Iterator
  {
  /// Sorts the slice. Replaced by a no-op when determinism is switched off.
  /// Useful, for example, to eliminate non-deterministic iteration of `HashMap` and `HashSet` keys.
  #[ cfg( feature = "determinism" ) ]
  #[ inline( always ) ]
  fn if_determinism_then_sort( self ) -> IntoIter< Self ::Item >
  where
   Self: Sized,
   Self ::Item: Ord,
  {
   self.sorted()
 }

  /// Sorts the slice. Replaced by a no-op when determinism is switched off.
  /// Useful, for example, to eliminate non-deterministic iteration of `HashMap` and `HashSet` keys.
  #[ cfg( not( feature = "determinism" ) ) ]
  #[ inline( always ) ]
  fn if_determinism_then_sort( self ) -> Self
  where
   Self: Sized,
   Self ::Item: Ord,
  {
   self
 }

  /// Sorts the slice with a comparator function. Replaced by a no-op when determinism is switched off.
  /// Useful, for example, to eliminate non-deterministic iteration of `HashMap` and `HashSet` keys.
  #[ cfg( feature = "determinism" ) ]
  #[ inline( always ) ]
  fn if_determinism_then_sort_by< F >( self, cmp: F ) -> IntoIter< Self ::Item >
  where
   Self: Sized,
   F: FnMut( &Self ::Item, &Self ::Item ) -> Ordering,
  {
   self.sorted_by( cmp )
 }

  /// Sorts the slice with a comparator function. Replaced by a no-op when determinism is switched off.
  /// Useful, for example, to eliminate non-deterministic iteration of `HashMap` and `HashSet` keys.
  #[ cfg( not( feature = "determinism" ) ) ]
  #[ inline( always ) ]
  fn if_determinism_then_sort_by< F >( self, _: F ) -> Self
  where
   Self: Sized,
   F: FnMut( &Self ::Item, &Self ::Item ) -> Ordering,
  {
   self
 }
 }

  #[ sealed ::sealed ]
  impl< T: ?Sized > IfDeterminismIteratorExt for T
  where T: Iterator
  {
 }

}

crate ::mod_interface!
{
  prelude use IfDeterminismIteratorExt;
}