mirror of
https://github.com/loro-dev/loro.git
synced 2025-02-02 11:06:14 +00:00
test: mermaid
This commit is contained in:
parent
77065bf57e
commit
d1e135ec30
2 changed files with 53 additions and 0 deletions
|
@ -118,6 +118,10 @@ fn get_dag_break_points<T: DagNode>(dag: &impl Dag<Node = T>) -> BreakPoints {
|
||||||
set.insert(id.counter);
|
set.insert(id.counter);
|
||||||
set.insert(id.counter + node.len() as Counter);
|
set.insert(id.counter + node.len() as Counter);
|
||||||
for dep in node.deps() {
|
for dep in node.deps() {
|
||||||
|
if dep.client_id == id.client_id {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
break_points
|
break_points
|
||||||
.break_points
|
.break_points
|
||||||
.entry(dep.client_id)
|
.entry(dep.client_id)
|
||||||
|
|
|
@ -4,6 +4,7 @@ use proptest::proptest;
|
||||||
|
|
||||||
use super::*;
|
use super::*;
|
||||||
use crate::{
|
use crate::{
|
||||||
|
array_mut_ref,
|
||||||
change::Lamport,
|
change::Lamport,
|
||||||
id::{ClientID, Counter, ID},
|
id::{ClientID, Counter, ID},
|
||||||
span::{CounterSpan, IdSpan},
|
span::{CounterSpan, IdSpan},
|
||||||
|
@ -220,6 +221,37 @@ struct Interaction {
|
||||||
len: usize,
|
len: usize,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
impl Interaction {
|
||||||
|
fn gen(rng: &mut impl rand::Rng, num: usize) -> Self {
|
||||||
|
if rng.gen_bool(0.5) {
|
||||||
|
let dag_idx = rng.gen_range(0..num);
|
||||||
|
let merge_with = (rng.gen_range(1..num - 1) + dag_idx) % num;
|
||||||
|
Self {
|
||||||
|
dag_idx,
|
||||||
|
merge_with: Some(merge_with),
|
||||||
|
len: rng.gen_range(1..10),
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
Self {
|
||||||
|
dag_idx: rng.gen_range(0..num),
|
||||||
|
merge_with: None,
|
||||||
|
len: rng.gen_range(1..10),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fn apply(&self, dags: &mut [TestDag]) {
|
||||||
|
if let Some(merge_with) = self.merge_with {
|
||||||
|
if merge_with != self.dag_idx {
|
||||||
|
let (from, to) = array_mut_ref!(dags, [self.dag_idx, merge_with]);
|
||||||
|
from.merge(to);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
dags[self.dag_idx].push(self.len);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
mod iter {
|
mod iter {
|
||||||
use super::*;
|
use super::*;
|
||||||
|
|
||||||
|
@ -256,6 +288,8 @@ mod iter {
|
||||||
}
|
}
|
||||||
|
|
||||||
mod mermaid {
|
mod mermaid {
|
||||||
|
use rle::Mergable;
|
||||||
|
|
||||||
use super::*;
|
use super::*;
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
|
@ -294,6 +328,21 @@ mod mermaid {
|
||||||
b.merge(&a);
|
b.merge(&a);
|
||||||
println!("{}", b.mermaid());
|
println!("{}", b.mermaid());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn gen() {
|
||||||
|
let num = 5;
|
||||||
|
let mut rng = rand::thread_rng();
|
||||||
|
let mut dags = (0..num).map(TestDag::new).collect::<Vec<_>>();
|
||||||
|
for _ in 0..100 {
|
||||||
|
Interaction::gen(&mut rng, num as usize).apply(&mut dags);
|
||||||
|
}
|
||||||
|
for i in 1..num {
|
||||||
|
let (a, other) = array_mut_ref!(&mut dags, [0, i as usize]);
|
||||||
|
a.merge(other);
|
||||||
|
}
|
||||||
|
println!("{}", dags[0].mermaid());
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
mod get_version_vector {
|
mod get_version_vector {
|
||||||
|
|
Loading…
Reference in a new issue