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
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
//! # Thread Pool Module - ThreadManager
//!
//! This module provides `ThreadManager`, a standalone utility for managing threads
//! with shared data, independent of the ThreadShare structures.
//!
//! ## ๐ Overview
//!
//! `ThreadManager` is a lightweight thread management utility that provides:
//!
//! - **Simplified Thread Spawning**: Spawn threads with descriptive names
//! - **Shared Data Management**: Manage multiple types of shared data
//! - **Thread Tracking**: Monitor active thread count and status
//! - **Automatic Thread Joining**: Wait for all threads to complete
//! - **Type-Safe Operations**: Compile-time guarantees for thread safety
//!
//! ## Key Features
//!
//! ### ๐งต Thread Management
//! - **Named Threads**: Each thread gets a descriptive name for debugging
//! - **Automatic Tracking**: Monitor active thread count and completion status
//! - **Error Handling**: Comprehensive error handling for thread failures
//! - **Resource Cleanup**: Automatic cleanup of completed threads
//!
//! ### ๐ฆ Shared Data Support
//! - **Type-Safe Access**: Compile-time type checking for shared data
//! - **Multiple Data Types**: Support for different types of shared data
//! - **Automatic Cloning**: Safe data sharing between threads
//! - **Thread Isolation**: Each thread gets its own clone of shared data
//!
//! ## Architecture
//!
//! `ThreadManager` uses internal structures to track:
//!
//! - **`threads: Arc<Mutex<HashMap<String, JoinHandle<()>>>>`** - Active thread tracking
//! - **`shared_data: Arc<Mutex<HashMap<TypeId, Box<dyn Any + Send + Sync>>>>`** - Shared data storage
//!
//! ## Example Usage
//!
//! ### Basic Thread Management
//! ```rust
//! use thread_share::{ThreadManager, share};
//!
//! fn main() -> Result<(), Box<dyn std::error::Error>> {
//! let manager = ThreadManager::new();
//! let data = share!(vec![1, 2, 3]);
//!
//! // Spawn individual threads
//! manager.spawn("sorter", data.clone(), |data| {
//! data.update(|v| v.sort());
//! })?;
//!
//! manager.spawn("validator", data.clone(), |data| {
//! assert!(data.get().is_sorted());
//! })?;
//!
//! // Wait for completion
//! manager.join_all()?;
//! Ok(())
//! }
//! ```
//!
//! ### Advanced Usage
//! ```rust
//! use thread_share::{ThreadManager, share};
//! use std::time::Duration;
//!
//! #[derive(Clone)]
//! struct WorkItem {
//! id: u32,
//! data: String,
//! }
//!
//! fn main() -> Result<(), Box<dyn std::error::Error>> {
//! let manager = ThreadManager::new();
//! let work_queue = share!(vec![
//! WorkItem { id: 1, data: "Task 1".to_string() },
//! WorkItem { id: 2, data: "Task 2".to_string() },
//! ]);
//!
//! // Spawn worker threads
//! for i in 0..3 {
//! let queue_clone = work_queue.clone();
//! let worker_id = i;
//! manager.spawn(&format!("worker-{}", i), queue_clone, move |queue| {
//! loop {
//! let mut items = queue.get();
//! if items.is_empty() {
//! break;
//! }
//!
//! if let Some(item) = items.pop() {
//! println!("Worker {} processing: {}", worker_id, item.data);
//! std::thread::sleep(Duration::from_millis(100));
//! }
//!
//! queue.set(items);
//! }
//! })?;
//! }
//!
//! // Wait for all workers to complete
//! manager.join_all()?;
//! println!("All work completed!");
//! Ok(())
//! }
//! ```
//!
//! ## Thread Lifecycle
//!
//! 1. **Creation**: `ThreadManager::new()` or `ThreadManager::default()`
//! 2. **Spawning**: `manager.spawn(name, data, function)` creates named threads
//! 3. **Execution**: Threads run with access to shared data
//! 4. **Monitoring**: Track active threads with `active_threads()`
//! 5. **Completion**: Wait for all threads with `join_all()`
//!
//! ## Performance Characteristics
//!
//! - **Thread Spawning**: Minimal overhead over standard `thread::spawn`
//! - **Thread Tracking**: Constant-time operations for thread management
//! - **Memory Usage**: Small overhead for tracking structures
//! - **Scalability**: Efficient for up to hundreds of threads
//! - **Lock Contention**: Minimal due to efficient `parking_lot` primitives
//!
//! ## Best Practices
//!
//! 1. **Use descriptive thread names** for easier debugging
//! 2. **Keep thread functions focused** on single responsibilities
//! 3. **Always call `join_all()`** to ensure proper cleanup
//! 4. **Monitor thread count** with `active_threads()` for debugging
//! 5. **Handle errors gracefully** from `spawn()` and `join_all()`
//! 6. **Clone shared data** for each thread to avoid ownership issues
//!
//! ## Error Handling
//!
//! ```rust
//! use thread_share::{ThreadManager, share};
//!
//! fn main() -> Result<(), Box<dyn std::error::Error>> {
//! let manager = ThreadManager::new();
//! let data = share!(0);
//!
//! // Handle spawn errors
//! if let Err(e) = manager.spawn("worker", data.clone(), |data| { /* logic */ }) {
//! eprintln!("Failed to spawn worker: {}", e);
//! return Ok(());
//! }
//!
//! // Handle join errors
//! if let Err(e) = manager.join_all() {
//! eprintln!("Thread execution failed: {}", e);
//! }
//! Ok(())
//! }
//! ```
//!
//! ## Thread Safety
//!
//! `ThreadManager` automatically implements `Send` and `Sync` traits,
//! making it safe to use across thread boundaries. The internal synchronization
//! primitives ensure that all operations are thread-safe.
//!
//! ## Memory Management
//!
//! - **Arc**: Provides reference counting for shared ownership
//! - **Mutex**: Ensures exclusive access to internal structures
//! - **HashMap**: Efficient storage for thread handles and shared data
//! - **Automatic Cleanup**: Completed threads are automatically removed
//!
//! ## Comparison with EnhancedThreadShare
//!
//! | Aspect | ThreadManager | EnhancedThreadShare |
//! |--------|---------------|-------------------|
//! | **Purpose** | Standalone utility | Integrated with ThreadShare |
//! | **Data Management** | Manual cloning required | Automatic data management |
//! | **Thread Tracking** | Manual thread management | Built-in thread tracking |
//! | **Use Case** | Complex thread scenarios | Simple thread management |
//! | **Flexibility** | High | Medium |
//! | **Ease of Use** | Medium | High |
//!
//! ## Integration with ThreadShare
//!
//! `ThreadManager` works seamlessly with `ThreadShare<T>`:
//!
//!
//! ## Advanced Patterns
//!
//! ### Thread Pools
//! ```rust
//! use thread_share::{ThreadManager, share};
//!
//! fn main() -> Result<(), Box<dyn std::error::Error>> {
//! let manager = ThreadManager::new();
//! let counter = share!(0u32);
//!
//! // Spawn worker pool
//! for i in 0..4 {
//! let counter_clone = counter.clone();
//! let worker_id = i;
//! manager.spawn(&format!("worker-{}", i), counter_clone, move |data| {
//! data.update(|x| *x = *x + 1);
//! println!("Worker {} incremented counter", worker_id);
//! })?;
//! }
//!
//! // Wait for all workers to complete
//! manager.join_all()?;
//! println!("Final counter value: {}", counter.get());
//! Ok(())
//! }
//! ```
//!
//! ### Producer-Consumer
//! ```rust
//! use thread_share::{ThreadManager, share};
//! use std::time::Duration;
//!
//! fn main() -> Result<(), Box<dyn std::error::Error>> {
//! let manager = ThreadManager::new();
//! let queue = share!(Vec::<String>::new());
//!
//! // Producer thread
//! manager.spawn("producer", queue.clone(), |queue| {
//! for i in 0..5 {
//! queue.update(|q| q.push(format!("Item {}", i)));
//! std::thread::sleep(Duration::from_millis(10));
//! }
//! })?;
//!
//! // Consumer thread
//! manager.spawn("consumer", queue.clone(), |queue| {
//! let mut consumed_count = 0;
//! while consumed_count < 5 {
//! let items = queue.get();
//! if items.is_empty() {
//! std::thread::sleep(Duration::from_millis(10));
//! continue;
//! }
//!
//! if let Some(item) = items.last() {
//! println!("Consumed: {}", item);
//! queue.update(|q| { q.pop(); });
//! consumed_count = consumed_count + 1;
//! }
//! }
//! })?;
//!
//! // Wait for completion
//! manager.join_all()?;
//! Ok(())
//! }
//! ```
use crateThreadShare;
use ;
use HashMap;
use ;
use thread;
/// Simplified thread management for ThreadShare
///
/// `ThreadManager` is a standalone utility for managing threads with shared data,
/// independent of the ThreadShare structures. It provides lightweight thread
/// management with comprehensive tracking and error handling.
///
/// ## Key Features
///
/// - **Simplified Thread Spawning**: Spawn threads with descriptive names
/// - **Shared Data Management**: Manage multiple types of shared data
/// - **Thread Tracking**: Monitor active thread count and status
/// - **Automatic Thread Joining**: Wait for all threads to complete
/// - **Type-Safe Operations**: Compile-time guarantees for thread safety
///
/// ## Example
///
/// ```rust
/// use thread_share::{ThreadManager, share};
///
/// fn main() -> Result<(), Box<dyn std::error::Error>> {
/// let manager = ThreadManager::new();
/// let data = share!(vec![1, 2, 3]);
///
/// // Spawn threads
/// manager.spawn("sorter", data.clone(), |data| {
/// data.update(|v| v.sort());
/// })?;
///
/// manager.spawn("validator", data.clone(), |data| {
/// let v = data.get();
/// for i in 1..v.len() {
/// assert!(v[i-1] <= v[i]);
/// }
/// })?;
///
/// // Wait for completion
/// manager.join_all()?;
/// Ok(())
/// }
/// ```
///
/// ## Thread Lifecycle
///
/// 1. **Creation**: `ThreadManager::new()` or `ThreadManager::default()`
/// 2. **Spawning**: `manager.spawn(name, data, function)` creates named threads
/// 3. **Execution**: Threads run with access to shared data
/// 4. **Monitoring**: Track active threads with `active_threads()`
/// 5. **Completion**: Wait for all threads with `join_all()`
///
/// ## Performance
///
/// - **Thread Spawning**: Minimal overhead over standard `thread::spawn`
/// - **Thread Tracking**: Constant-time operations for thread management
/// - **Memory Usage**: Small overhead for tracking structures
/// - **Scalability**: Efficient for up to hundreds of threads