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
/*
* Copyright (c) 2022 R3BL LLC
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
//! [`MTArena`] is defined here.
use ;
use ;
use crateReadGuarded;
/// [`MTArena`] is built on top of [`Arena`] but with support for sharing the arena between threads.
/// Also supports tree walking on a separate thread w/ a lambda that's supplied.
///
/// 1. [Wikipedia definition of memory
/// arena](https://en.wikipedia.org/wiki/Region-based_memory_management)
/// 2. You can learn more about how this library was built from this [developerlife.com
/// article](https://developerlife.com/2022/02/24/rust-non-binary-tree/).
///
/// # Examples
///
/// ```rust
/// use std::{sync::Arc,
/// thread::{self, JoinHandle}};
///
/// use r3bl_rs_utils::tree_memory_arena::{Arena, HasId, MTArena, ResultUidList, TraversalKind};
/// use r3bl_rs_utils_core::{style_primary, style_prompt};
///
/// type ThreadResult = Vec<usize>;
/// type Handles = Vec<JoinHandle<ThreadResult>>;
///
/// let mut handles: Handles = Vec::new();
/// let arena = MTArena::<String>::new();
///
/// // Thread 1 - add root. Spawn and wait (since the 2 threads below need the root).
/// {
/// let arena_arc = arena.get_arena_arc();
/// let thread = thread::spawn(move || {
/// let mut arena_write = arena_arc.write().unwrap();
/// let root = arena_write.add_new_node("foo".to_string(), None);
/// vec![root]
/// });
/// thread.join().unwrap();
/// }
///
/// // Perform tree walking in parallel. Note the lambda does capture many enclosing context
/// // variables.
/// {
/// let arena_arc = arena.get_arena_arc();
/// let fn_arc = Arc::new(move |uid, payload| {
/// println!(
/// "{} {} {} Arena weak_count:{} strong_count:{}",
/// style_primary("walker_fn - closure"),
/// uid,
/// payload,
/// Arc::weak_count(&arena_arc),
/// Arc::weak_count(&arena_arc)
/// );
/// });
///
/// // Walk tree w/ a new thread using arc to lambda.
/// {
/// let thread_handle: JoinHandle<ResultUidList> = arena.tree_walk_parallel(
/// 0, fn_arc.clone(), TraversalKind::BreadthFirst);
/// let result_node_list = thread_handle.join().unwrap();
/// println!("{:#?}", result_node_list);
/// }
///
/// // Walk tree w/ a new thread using arc to lambda.
/// {
/// let thread_handle: JoinHandle<ResultUidList> = arena.tree_walk_parallel(
/// 1, fn_arc.clone(), TraversalKind::DepthFirst);
/// let result_node_list = thread_handle.join().unwrap();
/// println!("{:#?}", result_node_list);
/// }
/// }
/// ```
/// 📜 There are more complex ways of using [`super::Arena`] and [`MTArena`]. Please look at these
/// extensive integration tests that put them thru their paces
/// [here](https://github.com/r3bl-org/r3bl-rs-utils/blob/main/tests/tree_memory_arena_test.rs).