mirrors/loro
1
0
Fork 0
mirror of https://github.com/loro-dev/loro.git synced 2025-02-02 02:59:51 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

refactor: add linear diff calc mode to tree

Browse source
This commit is contained in:
Zixuan Chen 2024-08-08 10:39:04 +08:00
parent 9d8221ca29
commit de78cf9636
No known key found for this signature in database
1 changed files with 83 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

96
crates/loro-internal/src/diff_calc/tree.rs
View file

@ -20,20 +20,80 @@ use super::{DiffCalculatorTrait, DiffMode};
#[derive(Debug)]
pub(crate) struct TreeDiffCalculator {
container: ContainerIdx,
mode: TreeDiffCalculatorMode,
}
#[derive(Debug)]
enum TreeDiffCalculatorMode {
UndoRedo,
Linear(TreeDelta),
}
impl DiffCalculatorTrait for TreeDiffCalculator {
fn start_tracking(&mut self, _oplog: &OpLog, _vv: &crate::VersionVector, mode: DiffMode) {}
fn start_tracking(&mut self, _oplog: &OpLog, _vv: &crate::VersionVector, mode: DiffMode) {
if mode == DiffMode::Linear {
self.mode = TreeDiffCalculatorMode::Linear(TreeDelta::default());
} else {
self.mode = TreeDiffCalculatorMode::UndoRedo;
}
}
fn apply_change(
&mut self,
_oplog: &OpLog,
_op: crate::op::RichOp,
op: crate::op::RichOp,
_vv: Option<&crate::VersionVector>,
) {
match self.mode {
TreeDiffCalculatorMode::UndoRedo => {}
TreeDiffCalculatorMode::Linear(ref mut delta) => {
let id_full = op.id_full();
let op = op.op();
let content = op.content.as_tree().unwrap();
let item: TreeDeltaItem = match content {
crate::container::tree::tree_op::TreeOp::Create {
target,
parent,
position,
} => TreeDeltaItem {
target: *target,
action: TreeInternalDiff::Create {
parent: (*parent).into(),
position: position.clone(),
},
last_effective_move_op_id: id_full,
},
crate::container::tree::tree_op::TreeOp::Move {
target,
parent,
position,
} => TreeDeltaItem {
target: *target,
action: TreeInternalDiff::Move {
parent: (*parent).into(),
position: position.clone(),
},
last_effective_move_op_id: id_full,
},
crate::container::tree::tree_op::TreeOp::Delete { target } => TreeDeltaItem {
target: *target,
action: TreeInternalDiff::Delete {
parent: TreeParentId::Deleted,
position: None,
},
last_effective_move_op_id: id_full,
},
};
delta.diff.push(item);
}
}
}
fn finish_this_round(&mut self) {}
fn finish_this_round(&mut self) {
self.mode = TreeDiffCalculatorMode::UndoRedo;
}
fn calculate_diff(
&mut self,
@ -42,22 +102,32 @@ impl DiffCalculatorTrait for TreeDiffCalculator {
to: &crate::VersionVector,
mut on_new_container: impl FnMut(&ContainerID),
) -> (InternalDiff, DiffMode) {
let diff = self.diff(oplog, from, to);
diff.diff.iter().for_each(|d| {
// the metadata could be modified before, so (re)create a node need emit the map container diffs
// `Create` here is because maybe in a diff calc uncreate and then create back
if matches!(d.action, TreeInternalDiff::Create { .. }) {
on_new_container(&d.target.associated_meta_container())
}
});
match &mut self.mode {
TreeDiffCalculatorMode::UndoRedo => {
let diff = self.diff(oplog, from, to);
diff.diff.iter().for_each(|d| {
// the metadata could be modified before, so (re)create a node need emit the map container diffs
// `Create` here is because maybe in a diff calc uncreate and then create back
if matches!(d.action, TreeInternalDiff::Create { .. }) {
on_new_container(&d.target.associated_meta_container())
}
});
(InternalDiff::Tree(diff), DiffMode::Checkout)
(InternalDiff::Tree(diff), DiffMode::Checkout)
}
TreeDiffCalculatorMode::Linear(ans) => {
(InternalDiff::Tree(std::mem::take(ans)), DiffMode::Linear)
}
}
}
}
impl TreeDiffCalculator {
pub(crate) fn new(container: ContainerIdx) -> Self {
Self { container }
Self {
container,
mode: TreeDiffCalculatorMode::UndoRedo,
}
}
fn diff(&mut self, oplog: &OpLog, from: &VersionVector, to: &VersionVector) -> TreeDelta {