67 lines
1.8 KiB
Rust
67 lines
1.8 KiB
Rust
use crate::op_tree::{OpSetMetadata, OpTreeNode};
|
|
use crate::query::{binary_search_by, QueryResult, TreeQuery};
|
|
use crate::types::{Key, Op};
|
|
use std::fmt::Debug;
|
|
|
|
#[derive(Debug, Clone, PartialEq)]
|
|
pub(crate) struct Prop<'a> {
|
|
key: Key,
|
|
pub(crate) ops: Vec<&'a Op>,
|
|
pub(crate) ops_pos: Vec<usize>,
|
|
pub(crate) pos: usize,
|
|
start: Option<usize>,
|
|
}
|
|
|
|
impl<'a> Prop<'a> {
|
|
pub(crate) fn new(prop: usize) -> Self {
|
|
Prop {
|
|
key: Key::Map(prop),
|
|
ops: vec![],
|
|
ops_pos: vec![],
|
|
pos: 0,
|
|
start: None,
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<'a> TreeQuery<'a> for Prop<'a> {
|
|
fn query_node_with_metadata(
|
|
&mut self,
|
|
child: &'a OpTreeNode,
|
|
m: &OpSetMetadata,
|
|
) -> QueryResult {
|
|
if let Some(start) = self.start {
|
|
if self.pos + child.len() >= start {
|
|
// skip empty nodes
|
|
if child.index.visible_len() == 0 {
|
|
self.pos += child.len();
|
|
QueryResult::Next
|
|
} else {
|
|
QueryResult::Descend
|
|
}
|
|
} else {
|
|
self.pos += child.len();
|
|
QueryResult::Next
|
|
}
|
|
} else {
|
|
// in the root node find the first op position for the key
|
|
let start = binary_search_by(child, |op| m.key_cmp(&op.key, &self.key));
|
|
self.start = Some(start);
|
|
self.pos = start;
|
|
QueryResult::Skip(start)
|
|
}
|
|
}
|
|
|
|
fn query_element(&mut self, op: &'a Op) -> QueryResult {
|
|
// don't bother looking at things past our key
|
|
if op.key != self.key {
|
|
return QueryResult::Finish;
|
|
}
|
|
if op.visible() {
|
|
self.ops.push(op);
|
|
self.ops_pos.push(self.pos);
|
|
}
|
|
self.pos += 1;
|
|
QueryResult::Next
|
|
}
|
|
}
|