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
use std::sync::{
Arc,
atomic::{AtomicBool, AtomicU64, Ordering},
};
use uuid::Uuid;
use super::{CellValue, Gettable, Watchable};
use crate::{
cell::{Cell, CellImmutable, CellMutable},
signal::Signal,
};
// Lock-free completion state packed into a single u64:
// - Bits 0-61: generation (max 2^62-1)
// - Bit 62: inner_complete
// - Bit 63: outer_complete
const INNER_COMPLETE_BIT: u64 = 1 << 62;
const OUTER_COMPLETE_BIT: u64 = 1 << 63;
const GEN_MASK: u64 = (1 << 62) - 1;
pub trait SwitchMapExt<T>: Watchable<T> {
#[track_caller]
fn switch_map<U, F>(&self, f: F) -> Cell<U, CellImmutable>
where
T: CellValue,
U: CellValue,
F: Fn(&T) -> Cell<U, CellImmutable> + Send + Sync + 'static,
Self: Clone + Send + Sync + 'static,
{
let first_inner = f(&self.get());
let cell = Cell::<U, CellMutable>::new(first_inner.get());
let cell = if let Some(name) = self.name() {
cell.with_name(format!("{}::switch_map", name))
} else {
cell
};
// Stable key for the inner subscription guard so switch_map replaces (not accumulates)
let inner_guard_key = Uuid::new_v4();
// Packed state: generation (bits 0-61), inner_complete (bit 62), outer_complete (bit 63)
// All completion logic uses CAS loops on this single atomic for lock-free operation
let state = Arc::new(AtomicU64::new(0)); // gen 0, both incomplete
// Subscribe to first inner (generation 0)
let weak = cell.downgrade();
let state_for_first = state.clone();
let first_guard = first_inner.subscribe(move |signal| {
let current = state_for_first.load(Ordering::SeqCst);
if current & GEN_MASK != 0 {
return; // Generation changed, not current
}
if let Some(c) = weak.upgrade() {
match signal {
Signal::Value(_) => c.notify(signal.clone()),
Signal::Complete => {
// Set inner complete bit with CAS loop
loop {
let old = state_for_first.load(Ordering::SeqCst);
if old & GEN_MASK != 0 {
return; // Generation changed
}
if old & INNER_COMPLETE_BIT != 0 {
return; // Already marked complete
}
let new = old | INNER_COMPLETE_BIT;
if state_for_first
.compare_exchange(old, new, Ordering::SeqCst, Ordering::SeqCst)
.is_ok()
{
if new & OUTER_COMPLETE_BIT != 0 {
c.notify(Signal::Complete);
}
return;
}
}
}
Signal::Error(e) => c.notify(Signal::Error(e.clone())),
}
}
});
cell.own_keyed(inner_guard_key, first_guard);
// Single subscription to outer handles both value switching and completion tracking
let weak = cell.downgrade();
let f = Arc::new(f);
let state_for_outer = state.clone();
let first = Arc::new(AtomicBool::new(true));
let outer_guard = self.subscribe(move |signal| {
match signal {
Signal::Value(outer_value) => {
if first.swap(false, Ordering::SeqCst) {
return;
}
let Some(c) = weak.upgrade() else { return };
// Increment generation, clear inner_complete, preserve outer_complete
let my_gen = loop {
let old = state_for_outer.load(Ordering::SeqCst);
let outer_bit = old & OUTER_COMPLETE_BIT;
let old_gen = old & GEN_MASK;
let new_gen = old_gen + 1;
let new = new_gen | outer_bit; // new gen, outer preserved, inner cleared
if state_for_outer
.compare_exchange(old, new, Ordering::SeqCst, Ordering::SeqCst)
.is_ok()
{
break new_gen;
}
};
let inner = f(outer_value.as_ref());
// Subscribe to new inner for values and completion
let weak_inner = weak.clone();
let state_for_inner = state_for_outer.clone();
let value_guard = inner.subscribe(move |signal| {
let current = state_for_inner.load(Ordering::SeqCst);
if current & GEN_MASK != my_gen {
return; // Generation changed, not current
}
if let Some(c) = weak_inner.upgrade() {
match signal {
Signal::Value(_) => c.notify(signal.clone()),
Signal::Complete => loop {
let old = state_for_inner.load(Ordering::SeqCst);
if old & GEN_MASK != my_gen {
return;
}
if old & INNER_COMPLETE_BIT != 0 {
return;
}
let new = old | INNER_COMPLETE_BIT;
if state_for_inner
.compare_exchange(
old,
new,
Ordering::SeqCst,
Ordering::SeqCst,
)
.is_ok()
{
if new & OUTER_COMPLETE_BIT != 0 {
c.notify(Signal::Complete);
}
return;
}
},
Signal::Error(e) => c.notify(Signal::Error(e.clone())),
}
}
});
c.own_keyed(inner_guard_key, value_guard);
}
Signal::Complete => {
// Set outer complete bit with CAS loop
loop {
let old = state_for_outer.load(Ordering::SeqCst);
if old & OUTER_COMPLETE_BIT != 0 {
return;
}
let new = old | OUTER_COMPLETE_BIT;
if state_for_outer
.compare_exchange(old, new, Ordering::SeqCst, Ordering::SeqCst)
.is_ok()
{
if new & INNER_COMPLETE_BIT != 0
&& let Some(c) = weak.upgrade()
{
c.notify(Signal::Complete);
}
return;
}
}
}
Signal::Error(e) => {
if let Some(c) = weak.upgrade() {
c.notify(Signal::Error(e.clone()));
}
}
}
});
cell.own(outer_guard);
cell.lock()
}
}
impl<T, W: Watchable<T>> SwitchMapExt<T> for W {}
#[cfg(test)]
mod tests {
use super::*;
use crate::MapExt;
#[test]
fn test_switch_map_switches() {
let source = Cell::new(1u64);
let switched = source.switch_map(|v| {
let v = *v;
Cell::new(v * 10).map(move |x| x + v)
});
// Initial: 1 * 10 + 1 = 11
assert_eq!(switched.get(), 11);
}
}