id_effect 0.4.0

Effect<A, E, R> (sync + async), capability DI, pipe — interpreter-style, no bundled executor
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

//! Integration tests for Fabric-aware implicit parallelism (primary + serial APIs).

use id_effect::{
  RedBlackTree, Stream, Trie,
  algebra::functor::vec,
  collections::{hash_map, hash_set},
  compute::{ComputeFabric, install_fabric},
  run_blocking,
  schema::order,
};
use std::sync::Arc;

fn install_test_fabric() {
  install_fabric(Arc::new(ComputeFabric::memory_cap_max_cpu(1.0)));
}

#[test]
fn parallel_dispatch_integration() {
  install_test_fabric();

  let input: Vec<i32> = (0..128).collect();
  let out = vec::map(input.clone(), |x| x + 1);
  assert_eq!(out.len(), 128);
  assert_eq!(out[0], 1);
  assert_eq!(vec::map_serial(input, |x| x + 1), out);

  let m = hash_map::from_iter([(1_i32, 10), (2, 20), (3, 30)]);
  let mapped = hash_map::map_values(m.clone(), |v| v * 2);
  assert_eq!(hash_map::get(&mapped, &2), Some(&40));
  assert_eq!(hash_map::map_values_serial(m.clone(), |v| v * 2), mapped);
  let filtered = hash_map::filter(&m, |k, _| *k > 1);
  assert!(!hash_map::has(&filtered, &1));
  assert_eq!(hash_map::filter_serial(&m, |k, _| *k > 1), filtered);

  let mut t = RedBlackTree::empty();
  for i in 0..64_i32 {
    t.insert(i, i * 10);
  }
  assert_eq!(t.entries(), t.entries_serial());
  assert_eq!(t.size(), t.size_serial());
  assert_eq!(t.greater_than(&32), t.greater_than_serial(&32));
  assert_eq!(t.less_than(&32), t.less_than_serial(&32));
  assert_eq!(t.values(), t.values_serial());

  let stream_mapped = run_blocking(
    Stream::from_iterable(0..64_i32)
      .map(|n| n * 2)
      .run_collect(),
    (),
  )
  .unwrap();
  assert_eq!(stream_mapped.len(), 64);

  let stream_filtered = run_blocking(
    Stream::from_iterable(0..64_i32)
      .filter(Box::new(|n: &i32| n % 2 == 0))
      .run_collect(),
    (),
  )
  .unwrap();
  assert_eq!(stream_filtered.len(), 32);

  let ord = order::order::number_i64();
  let data: Vec<i64> = (0..128).rev().collect();
  let sorted = order::order::sort_with(&ord, data.clone());
  assert_eq!(sorted.first(), Some(&0));
  assert_eq!(sorted.last(), Some(&127));
  assert_eq!(order::order::sort_with_serial(&ord, data), sorted);

  let large: Vec<i32> = (0..2048).collect();
  let large_out = vec::map(large.clone(), |x| x + 1);
  assert_eq!(large_out.len(), 2048);
  assert_eq!(large_out[2047], 2048);

  let auto_stream = run_blocking(
    Stream::from_iterable(0..2048_i32)
      .map(|n| n + 1)
      .run_collect(),
    (),
  )
  .unwrap();
  assert_eq!(auto_stream.len(), 2048);

  let mut small = RedBlackTree::empty();
  for i in 0..32_i32 {
    small.insert(i, i * 2);
  }
  let _ = small.greater_than_serial(&16);
  let _ = small.greater_than(&16);
  let _ = small.less_than_serial(&16);
  let _ = small.less_than(&16);
  let _ = small.size();
  let _ = small.entries();
  let _ = small.values();
}

#[test]
fn large_collection_parallel_paths() {
  install_test_fabric();

  let large: Vec<i32> = (0..3000).collect();
  let mapped = vec::map(large.clone(), |x| x + 1);
  assert_eq!(mapped, vec::map_serial(large, |x| x + 1));

  let pairs: Vec<(i32, i32)> = (0..3000).map(|i| (i, i * 2)).collect();
  let m = hash_map::from_iter(pairs);
  assert_eq!(
    hash_map::map_values(m.clone(), |v| v + 1),
    hash_map::map_values_serial(m.clone(), |v| v + 1)
  );
  assert_eq!(
    hash_map::filter(&m, |k, _| *k % 2 == 0),
    hash_map::filter_serial(&m, |k, _| *k % 2 == 0)
  );

  let set = hash_set::from_iter(0..3000_i32);
  assert_eq!(hash_set::values(&set), hash_set::values_serial(&set));

  let mut trie = Trie::empty();
  let keys: Vec<String> = (0..3000_i32).map(|i| format!("key-{i}")).collect();
  for (i, key) in keys.iter().enumerate() {
    trie.insert(key, i as i32);
  }
  assert_eq!(trie.size(), trie.size_serial());

  let mut tree = RedBlackTree::empty();
  for i in 0..3000_i32 {
    tree.insert(i, i * 2);
  }
  assert_eq!(tree.size(), tree.size_serial());
  assert_eq!(tree.entries(), tree.entries_serial());
  assert_eq!(tree.values(), tree.values_serial());
  assert_eq!(tree.greater_than(&0), tree.greater_than_serial(&0));
  assert_eq!(tree.less_than(&3000), tree.less_than_serial(&3000));

  let ord = order::order::number_i64();
  let data: Vec<i64> = (0..3000).rev().collect();
  assert_eq!(
    order::order::sort_with(&ord, data.clone()),
    order::order::sort_with_serial(&ord, data)
  );
}