rx-rs 0.1.3

A lightweight single-threaded push-based reactive programming library
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

use rx_rs::prelude::*;
use std::cell::RefCell;
use std::rc::Rc;

// ============================================================================
// DIAGNOSTIC AND BASELINE TESTS
// ============================================================================

#[test]
fn test_proper_cleanup_no_leak() {
    let x = RxRef::new(10);

    assert_eq!(x.subscriber_count(), 0);

    {
        let tracker = DisposableTracker::new();

        x.val().subscribe(tracker.tracker(), |val| {
            println!("Value: {}", val);
        });

        assert_eq!(x.subscriber_count(), 1);

        // Tracker drops here
    }

    // After tracker drops, subscription should be cleaned up
    assert_eq!(x.subscriber_count(), 0, "Subscription should be cleaned up");
}

#[test]
fn test_subscriber_count_analysis() {
    let x = RxRef::new(1);

    let counts = Rc::new(RefCell::new(Vec::new()));

    // Track subscriber count through various operations
    let initial = x.subscriber_count();
    counts.borrow_mut().push(("initial", initial));

    let val = x.val();
    counts
        .borrow_mut()
        .push(("after val()", x.subscriber_count()));

    let mapped = val.map(|v| v * 2);
    counts
        .borrow_mut()
        .push(("after map()", x.subscriber_count()));

    drop(mapped);
    counts
        .borrow_mut()
        .push(("after drop map", x.subscriber_count()));

    drop(val);
    counts
        .borrow_mut()
        .push(("after drop val", x.subscriber_count()));

    println!("Subscriber count analysis:");
    for (label, count) in counts.borrow().iter() {
        println!("  {}: {}", label, count);
    }

    // Verify cleanup
    assert_eq!(
        x.subscriber_count(),
        0,
        "All subscribers should be cleaned up"
    );
}