63 lines
1.9 KiB
Rust
63 lines
1.9 KiB
Rust
use crate::op_tree::{OpSetMetadata, OpTreeNode};
|
|
use crate::query::{binary_search_by, QueryResult, TreeQuery, VisWindow};
|
|
use crate::types::{Clock, Key, Op};
|
|
use std::fmt::Debug;
|
|
|
|
#[derive(Debug, Clone, PartialEq)]
|
|
pub(crate) struct PropAt {
|
|
clock: Clock,
|
|
key: Key,
|
|
pub(crate) ops: Vec<Op>,
|
|
pub(crate) ops_pos: Vec<usize>,
|
|
pub(crate) pos: usize,
|
|
}
|
|
|
|
impl PropAt {
|
|
pub(crate) fn new(prop: usize, clock: Clock) -> Self {
|
|
PropAt {
|
|
clock,
|
|
key: Key::Map(prop),
|
|
ops: vec![],
|
|
ops_pos: vec![],
|
|
pos: 0,
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<'a> TreeQuery<'a> for PropAt {
|
|
fn query_node_with_metadata(
|
|
&mut self,
|
|
child: &'a OpTreeNode,
|
|
m: &OpSetMetadata,
|
|
ops: &[Op],
|
|
) -> QueryResult {
|
|
let start = binary_search_by(child, ops, |op| m.key_cmp(&op.key, &self.key));
|
|
let mut window: VisWindow = Default::default();
|
|
self.pos = start;
|
|
for pos in start..child.len() {
|
|
let op = &ops[child.get(pos).unwrap()];
|
|
if op.key != self.key {
|
|
break;
|
|
}
|
|
if window.visible_at(op, pos, &self.clock) {
|
|
for (vpos, vop) in window.seen_op(op, pos) {
|
|
if vop.is_counter() {
|
|
// this could be out of order because of inc's - we can find the right place
|
|
// since pos will always be in order
|
|
let pos = self
|
|
.ops_pos
|
|
.binary_search_by(|probe| probe.cmp(&vpos))
|
|
.unwrap_err();
|
|
self.ops.insert(pos, vop);
|
|
self.ops_pos.insert(pos, vpos);
|
|
} else {
|
|
self.ops.push(vop);
|
|
self.ops_pos.push(vpos);
|
|
}
|
|
}
|
|
}
|
|
self.pos += 1;
|
|
}
|
|
QueryResult::Finish
|
|
}
|
|
}
|