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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
#![allow(non_snake_case)]
#![allow(non_camel_case_types)]
use std::cmp::Ordering;
use std::fmt;
use crate::avl_tree::{AVLTree, AVL_NULL};
use crate::data_structures::{
cmp_range_frags, InstPoint, RangeFrag, RangeFragIx, RangeId, SortedRangeFragIxs,
SortedRangeFrags, TypedIxVec,
};
#[derive(Clone)]
pub struct RangeFragAndRangeId {
pub frag: RangeFrag,
pub id: RangeId,
}
impl RangeFragAndRangeId {
fn new(frag: RangeFrag, id: RangeId) -> Self {
Self { frag, id }
}
}
impl PartialEq for RangeFragAndRangeId {
fn eq(&self, _other: &Self) -> bool {
panic!("impl PartialEq for RangeFragAndRangeId: should never be used");
}
}
impl PartialOrd for RangeFragAndRangeId {
fn partial_cmp(&self, _other: &Self) -> Option<Ordering> {
panic!("impl PartialOrd for RangeFragAndRangeId: should never be used");
}
}
impl fmt::Debug for RangeFragAndRangeId {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
write!(fmt, "(FnV {:?} {:?})", self.frag, self.id)
}
}
pub struct CommitmentMap {
pub tree: AVLTree<RangeFragAndRangeId>,
}
impl fmt::Debug for CommitmentMap {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
let as_vec = self.tree.to_vec();
as_vec.fmt(fmt)
}
}
impl CommitmentMap {
pub fn new() -> Self {
let dflt = RangeFragAndRangeId::new(RangeFrag::invalid_value(), RangeId::invalid_value());
Self {
tree: AVLTree::<RangeFragAndRangeId>::new(dflt),
}
}
pub fn add(&mut self, to_add_frags: &SortedRangeFrags, to_add_lr_id: RangeId) {
for frag in &to_add_frags.frags {
let to_add = RangeFragAndRangeId::new(frag.clone(), to_add_lr_id);
let added = self.tree.insert(
to_add,
Some(&|pair1: RangeFragAndRangeId, pair2: RangeFragAndRangeId| {
cmp_range_frags(&pair1.frag, &pair2.frag)
}),
);
assert!(added);
}
}
pub fn add_indirect(
&mut self,
to_add_frags: &SortedRangeFragIxs,
to_add_lr_id: RangeId,
frag_env: &TypedIxVec<RangeFragIx, RangeFrag>,
) {
for fix in &to_add_frags.frag_ixs {
let to_add = RangeFragAndRangeId::new(frag_env[*fix].clone(), to_add_lr_id);
let added = self.tree.insert(
to_add,
Some(&|pair1: RangeFragAndRangeId, pair2: RangeFragAndRangeId| {
cmp_range_frags(&pair1.frag, &pair2.frag)
}),
);
assert!(added);
}
}
pub fn del(&mut self, to_del_frags: &SortedRangeFrags) {
for frag in &to_del_frags.frags {
let to_del = RangeFragAndRangeId::new(frag.clone(), RangeId::invalid_value());
let deleted = self.tree.delete(
to_del,
Some(&|pair1: RangeFragAndRangeId, pair2: RangeFragAndRangeId| {
cmp_range_frags(&pair1.frag, &pair2.frag)
}),
);
assert!(deleted);
}
}
pub fn lookup_inst_point(&self, pt: InstPoint) -> Option<RangeId> {
let mut root = self.tree.root;
while root != AVL_NULL {
let root_node = &self.tree.pool[root as usize];
let root_item = &root_node.item;
if pt < root_item.frag.first {
root = root_node.left;
} else if root_item.frag.last < pt {
root = root_node.right;
} else {
return Some(root_item.id);
}
}
None
}
}