eips 0.2.4

Efficient intention-preserving sequence CRDT
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

/*
 * Copyright (C) 2025 taylor.fish <contact@taylor.fish>
 *
 * This file is part of Eips.
 *
 * Eips is free software: you can redistribute it and/or modify it under
 * the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Eips is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General
 * Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public
 * License along with Eips. If not, see <https://www.gnu.org/licenses/>.
 *
 * The Eips Lesser Network Exception and Eips Peer-to-Peer Exception
 * also apply to Eips. These exceptions are additional permissions
 * under section 7 of the GNU Affero General Public License, version 3.
 * You should have received a copy of these exceptions; if not, see
 * <https://codeberg.org/taylordotfish/eips-exceptions>.
 */

use rand::Rng;
#[allow(dead_code)]
mod common;
use common::{AllowedOps, Client, Update};

const ITERATIONS: usize = 500;

fn random_op<R: Rng>(
    client: &mut Client,
    allowed: AllowedOps,
    rng: &mut R,
) -> Update {
    let update = client.random_op(allowed, rng);
    client.apply(update);
    update
}

fn random_ops<R: Rng>(
    client: &mut Client,
    allowed: AllowedOps,
    rng: &mut R,
) -> Vec<Update> {
    (0..ITERATIONS).map(|_| random_op(client, allowed, rng)).collect()
}

fn replay_common(allowed: AllowedOps) -> Client {
    let mut rng = common::make_rng();
    let mut client1 = Client::new(rng.random_range(0..100) * 4);
    let updates1 = random_ops(&mut client1, allowed, &mut rng);

    let mut client2 = Client::new(rng.random_range(0..100) * 4 + 1);
    for &update in &updates1 {
        client2.apply(update);
    }
    assert!(client1.text() == client2.text());
    let updates2 = random_ops(&mut client2, allowed, &mut rng);
    for &update in &updates2 {
        client1.apply(update);
    }
    assert!(client1.text() == client2.text());

    let mut client3 = Client::new(rng.random_range(0..100) * 4 + 2);
    for _ in 0..2 {
        for &update in updates1.iter().chain(&updates2) {
            client3.apply(update);
        }
        assert!(client1.text() == client3.text());
    }
    client2
}

#[test]
fn replay_insert() {
    replay_common(AllowedOps::INSERT_ONLY);
}

#[test]
fn replay_all() {
    let client1 = replay_common(AllowedOps::ALL);
    let mut client2 = Client::new(500);
    for update in client1.updates() {
        client2.apply(update);
    }
    assert!(client1.text() == client2.text());

    let mut client3 = Client::new(501);
    for update in client2.clone(502).updates() {
        client3.apply(update);
    }
    assert!(client1.text() == client3.text());
}