auralis-task 0.1.6

Scoped async task runtime with cancellation and priority scheduling
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

/// Criterion benchmarks for auralis-task.
///
/// Run with: `cargo bench -p auralis-task`
use criterion::{black_box, criterion_group, criterion_main, Criterion};
use std::cell::RefCell;
use std::rc::Rc;

use auralis_task::{init_flush_scheduler, ScheduleFlush, TaskScope};

// ---------------------------------------------------------------------------
// Sync scheduler for deterministic benchmarks
// ---------------------------------------------------------------------------

struct BenchScheduleFlush;
impl ScheduleFlush for BenchScheduleFlush {
    fn schedule(&self, callback: Box<dyn FnOnce()>) {
        callback();
    }
}
fn init() {
    init_flush_scheduler(Rc::new(BenchScheduleFlush));
}

// ---------------------------------------------------------------------------
// Batched scheduler — collects callbacks, flushes on demand.
// ---------------------------------------------------------------------------

struct BatchedFlush {
    callbacks: RefCell<Vec<Box<dyn FnOnce()>>>,
}
impl BatchedFlush {
    fn new() -> Rc<Self> {
        Rc::new(Self {
            callbacks: RefCell::new(Vec::new()),
        })
    }
    fn drain(&self) {
        while let Some(cb) = self.callbacks.borrow_mut().pop() {
            cb();
        }
    }
}
impl ScheduleFlush for BatchedFlush {
    fn schedule(&self, callback: Box<dyn FnOnce()>) {
        self.callbacks.borrow_mut().push(callback);
    }
}

// ---------------------------------------------------------------------------
// benchmark 1: TaskScope create + destroy (100 tasks)
// ---------------------------------------------------------------------------

fn bench_scope_create_destroy(c: &mut Criterion) {
    c.bench_function("scope_100_tasks_create_destroy", |b| {
        init();
        b.iter(|| {
            let scope = TaskScope::new();
            for _ in 0..100 {
                scope.spawn(async {});
            }
            let _ = black_box(scope);
        });
    });
}

// ---------------------------------------------------------------------------
// benchmark 2: deep nesting drop (200 levels)
// ---------------------------------------------------------------------------

fn bench_deep_nesting_drop(c: &mut Criterion) {
    c.bench_function("scope_200_levels_deep_drop", |b| {
        init();
        b.iter(|| {
            let root = TaskScope::new();
            {
                let mut current = TaskScope::new_child(&root);
                for _ in 0..199 {
                    current.spawn(async {});
                    current = TaskScope::new_child(&current);
                }
            }
            let _ = black_box(&root);
        });
    });
}

// ---------------------------------------------------------------------------
// benchmark 3: priority ordering (batched flush)
// ---------------------------------------------------------------------------

fn bench_priority_ordering(c: &mut Criterion) {
    use auralis_task::Priority;
    use std::cell::RefCell;

    c.bench_function("priority_1000_low_10_high", |b| {
        let order: Rc<RefCell<Vec<String>>> = Rc::new(RefCell::new(Vec::new()));

        b.iter(|| {
            // Use a batched scheduler so tasks accumulate in the queues
            // rather than running synchronously during each spawn.
            let sched = BatchedFlush::new();
            init_flush_scheduler(Rc::clone(&sched) as Rc<dyn ScheduleFlush>);
            order.borrow_mut().clear();

            // Spawn 1000 low-priority tasks.
            for i in 0..1000 {
                let o = Rc::clone(&order);
                auralis_task::spawn_global_with_priority(Priority::Low, async move {
                    o.borrow_mut().push(format!("low_{}", i));
                });
            }

            // Spawn 10 high-priority tasks.
            for i in 0..10 {
                let o = Rc::clone(&order);
                auralis_task::spawn_global_with_priority(Priority::High, async move {
                    o.borrow_mut().push(format!("high_{}", i));
                });
            }

            // Now flush — high-priority tasks run first.
            sched.drain();

            let result = order.borrow().clone();
            // Verify high-priority tasks ran first.
            for (i, item) in result.iter().enumerate().take(10) {
                assert!(
                    item.starts_with("high_"),
                    "expected high-priority task at index {i}, got: {item}"
                );
            }
            // Total count should be correct.
            assert_eq!(result.len(), 1010);
        });

        // Restore sync scheduler for other benchmarks.
        init();
    });
}

criterion_group!(
    benches,
    bench_scope_create_destroy,
    bench_deep_nesting_drop,
    bench_priority_ordering,
);
criterion_main!(benches);