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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
use crate::data::{new_hashmap, SeaDHashMap, SeaDHashSet, new_hashset};
use crate::id_allocator::U32IdAllocator;
use crate::map::VecMapU32;
use super::traversal::{
TraversalExecutor, TraversalContextData, TraversalMode,
FindPrefixTraverser, FindPrefixContext,
FindSuffixTraverser, FindSuffixContext,
FindSuperStringTraverser, FindSuperStringContext,
};
use crate::utils::{get_codepoint_at};
use crate::vec::sorted::SortedVecU32;
use crate::bt::traversal::TraversalResult;
use std::collections::HashSet;
use std::time::Duration;
use crate::vec::sorted_u8::SortedVecU8;
use crate::cmp::Compare;
use std::fmt::{Debug, Formatter, Error};
use std::borrow::Borrow;
pub type NodeId = u32;
pub type EdgeId = u32;
pub type Letter = u8;
pub type StrLength = u32;
pub type StrIdx = i16;
pub type NodeLength = i16;
pub const ROOT_ID: NodeId = 0;
pub const SOURCE_ID: NodeId = 1;
pub const NONE_SINK_ID: u32 = std::u32::MAX;
pub (in crate) struct SeaEdges {
inner: VecMapU32<SeaEdge>,
_next_edge_id_allocator: U32IdAllocator,
}
impl SeaEdges {
pub fn new() -> Self {
return SeaEdges {
inner: VecMapU32::new(),
_next_edge_id_allocator: U32IdAllocator::new(),
};
}
pub fn new_edge(&mut self, dest: NodeId, sink_id: NodeId, start_idx: StrIdx, end_idx: StrIdx) -> (SeaEdge, EdgeId) {
let edge_id = self.next_edge_id();
let edge = SeaEdge {
dest,
sink_id,
start_idx,
end_idx,
};
return (edge, edge_id as EdgeId);
}
fn next_edge_id(&mut self) -> NodeId {
return self._next_edge_id_allocator.next_id();
}
pub fn add(&mut self, id: EdgeId, edge: SeaEdge) {
self.inner.insert(id, edge);
}
pub fn get(&self, id: &EdgeId) -> Option<&SeaEdge> {
return self.inner.get(id);
}
pub fn get_mut(&mut self, id: &EdgeId) -> Option<&mut SeaEdge> {
return self.inner.get_mut(id);
}
}
impl Debug for SeaEdges {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.debug_struct("SeaEdges")
.field("edges", self.inner.borrow())
.finish()
}
}
pub (in crate) struct SeaNodes<V> {
internal: VecMapU32<SeaINode>,
sinks: VecMapU32<SeaSinkNode<V>>,
pub to_edges: SeaDHashMap<NodeId, SortedVecU8<(Letter, EdgeId)>>,
_internal_id_allocator: U32IdAllocator,
_sink_id_allocator: U32IdAllocator,
}
impl <V> SeaNodes<V> {
pub fn new() -> Self {
let mut nodes = SeaNodes {
internal: VecMapU32::new(),
sinks: VecMapU32::new(),
to_edges: new_hashmap(),
_internal_id_allocator: U32IdAllocator::new_start_at(2),
_sink_id_allocator: U32IdAllocator::new_start_at(0),
};
let root_node = SeaINode::new(-1, 0);
let mut source_node = SeaINode::new(0, ROOT_ID);
nodes.add_node(ROOT_ID, root_node);
nodes.add_node(SOURCE_ID, source_node);
return nodes;
}
#[inline]
pub fn new_inode(&mut self, length: NodeLength, suffix: NodeId) -> (SeaINode, NodeId) {
return (SeaINode::new(length, suffix), self.next_inode_id());
}
fn next_inode_id(&mut self) -> NodeId {
return self._internal_id_allocator.next_id();
}
fn next_sink_id(&mut self) -> NodeId {
return self._sink_id_allocator.next_id();
}
#[inline]
pub fn add_node(&mut self, node_id: u32, node: SeaINode) {
self.internal.insert(node_id, node);
}
#[inline]
pub fn add_sink(&mut self, id: NodeId, node: SeaSinkNode<V>) {
self.sinks.insert(id, node);
}
#[inline]
pub fn get_internal(&self, id: &NodeId) -> Option<&SeaINode> {
return self.internal.get(id);
}
#[inline]
pub fn get_mut_internal(&mut self, id: &NodeId) -> Option<&mut SeaINode> {
return self.internal.get_mut(id);
}
#[inline]
pub fn get_sink(&self, id: &NodeId) -> Option<&SeaSinkNode<V>> {
return self.sinks.get(id);
}
#[inline]
pub fn get_mut_sink(&mut self, id: &NodeId) -> Option<&mut SeaSinkNode<V>> {
return self.sinks.get_mut(id);
}
pub fn has_no_to_edges(&self, src_id: &NodeId) -> bool {
let container_opt = self.to_edges.get(src_id);
if container_opt.is_none() {
return false;
}
return container_opt.unwrap().is_empty();
}
pub fn add_to(&mut self, src_id: NodeId, letter: Letter, id: EdgeId) {
let container_opt = self.to_edges.get_mut(&src_id);
if container_opt.is_none() {
let mut container = SortedVecU8::new();
container.insert_unique((letter, id));
self.to_edges.insert(src_id, container);
return;
}
container_opt.unwrap().insert_unique((letter, id));
}
pub fn remove_to(&mut self, src_id: &NodeId, letter: &Letter) {
let container_opt = self.to_edges.get_mut(src_id);
if container_opt.is_none() {
return;
}
container_opt.unwrap().remove_by_key(letter, |item| item.0);
}
#[inline]
pub fn get_to(&self, src_id: &NodeId, letter: &Letter) -> Option<&EdgeId> {
let container_opt = self.to_edges.get(src_id);
if container_opt.is_none() {
return None;
}
return container_opt.unwrap().find(letter, |item| item.0).map(|item| &item.1);
}
pub fn get_to_edges(&self, src_id: &NodeId) -> Vec<EdgeId> {
let container_opt = self.to_edges.get(src_id);
if container_opt.is_none() {
return vec![];
}
return container_opt.unwrap().iter().map(|item| item.1).collect();
}
#[inline]
pub fn contains_to(&self, src_id: &NodeId, letter: &Letter) -> bool {
return self.get_to(src_id, letter).is_some();
}
}
impl<V: Debug> Debug for SeaNodes<V> {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.debug_struct("SeaNodes")
.field("sinks", &self.sinks)
.field("internal", &self.internal)
.field("to_edges", &self.to_edges)
.finish()
}
}
#[derive(Debug)]
pub struct SeaEdge {
pub dest: NodeId,
pub sink_id: NodeId,
pub start_idx: NodeLength,
pub end_idx: NodeLength,
}
#[derive(Debug)]
pub struct SeaINode {
_length: NodeLength,
suffix: NodeId,
pub sink_nodes: SortedVecU32<NodeId>,
}
impl SeaINode {
pub fn new(length: NodeLength, suffix: NodeId) -> Self {
return Self {
suffix,
sink_nodes: SortedVecU32::new(),
_length: length,
};
}
#[inline]
pub fn length(&self) -> NodeLength {
return self._length;
}
pub fn add_sink(&mut self, sink_id: NodeId) {
self.sink_nodes.insert_unique(sink_id);
}
pub fn remove_sink(&mut self, sink_id: &NodeId) {
self.sink_nodes.remove_item(&sink_id);
}
pub fn has_sink(&self, sink_id: &NodeId) -> bool {
return self.sink_nodes.contains(&sink_id);
}
pub fn sink_ids(&self) -> Vec<NodeId> {
return self.sink_nodes.iter().cloned().collect();
}
}
#[derive(Debug)]
pub struct SeaSinkNode<Val> {
pub word: Box<str>,
pub data: Val,
}
impl SeaSinkNode<()> {
#[inline]
pub fn new_empty(word: &str) -> Self {
return Self::new((), word);
}
}
impl <Val> SeaSinkNode<Val> {
#[inline]
pub fn new(data: Val, word: &str) -> Self {
return SeaSinkNode {
word: Box::from(word),
data,
};
}
#[inline]
pub fn length(&self) -> NodeLength {
return self.word.len() as NodeLength;
}
}
#[derive(Debug)]
pub struct SeaDawgCore<V = ()> {
pub (in crate) edges: SeaEdges,
pub (in crate) nodes: SeaNodes<V>,
sink_id: NodeId,
_size: u32,
_debug: bool,
_lite: bool,
}
impl <V> SeaDawgCore <V> {
pub fn new() -> Self {
return Self {
edges: SeaEdges::new(),
nodes: SeaNodes::new(),
sink_id: std::u32::MAX,
_size: 0,
_debug: false,
_lite: false,
};
}
#[inline]
pub fn enable_lite(&mut self) {
panic!("Not supported");
}
#[inline]
pub fn size(&self) -> u32 {
return self._size;
}
#[inline]
pub fn inodes_count(&self) -> usize {
return self.nodes.internal.len();
}
#[inline]
pub fn snodes_count(&self) -> usize {
return self.nodes.sinks.len();
}
#[inline]
pub fn edges_count(&self) -> usize {
return self.edges.inner.len();
}
#[inline]
pub fn get_sink(&self, node_id: &NodeId) -> Option<&SeaSinkNode<V>> {
return self.nodes.get_sink(node_id);
}
#[inline]
pub fn get_mut_sink(&mut self, node_id: &NodeId) -> Option<&mut SeaSinkNode<V>> {
return self.nodes.get_mut_sink(node_id);
}
pub fn add(&mut self, mut sink: SeaSinkNode<V>) {
let word = sink.word.clone();
let word_bytes = word.as_bytes();
self.sink_id = self.nodes.next_sink_id();
self.nodes.add_sink(self.sink_id.clone(), sink);
let mut update_data = (SOURCE_ID, 0);
let mut word_idx: usize = 0;
while word_idx < word_bytes.len() {
let letter = word_bytes[word_idx];
if !self.nodes.contains_to(&ROOT_ID, &letter) {
self.set_edge(ROOT_ID, self.sink_id, word_idx as i16, word_idx as i16, SOURCE_ID);
}
update_data = self.update(&*word_bytes, letter, update_data, word_idx as i16);
word_idx += 1;
}
if update_data.1 < word_bytes.len() as i16 {
let mut prev_node_id: Option<NodeId> = None;
let word_bytes_len = word_bytes.len();
for word_start_idx in 0..word_bytes_len {
let mut sub_node_id: NodeId = SOURCE_ID;
let mut sub_node_opt: Option<&mut SeaINode> = None;
let mut edge_id: EdgeId = 0;
let mut edge_src_id = 0;
let mut matching_edge_start_idx = 0usize;
let mut matching_edge_end_idx = 0usize;
let needle_len = word_bytes_len - word_start_idx;
let mut word_idx = word_start_idx;
let mut prev_idx = 0;
while word_idx < word_bytes_len {
let edge_letter = &word_bytes[word_idx as usize];
let edge_id_opt = self.nodes.get_to(&sub_node_id, edge_letter);
if edge_id_opt.is_none() {
break;
}
let matching_edge_id = edge_id_opt.unwrap();
let matching_edge_opt = self.edges.get(matching_edge_id);
let matching_edge = matching_edge_opt.unwrap();
matching_edge_start_idx = matching_edge.start_idx as usize;
matching_edge_end_idx = matching_edge.end_idx as usize;
let sink = self.get_sink(&matching_edge.sink_id);
let edge_word = sink.unwrap().word.as_bytes();
let partial_len: usize = (self.get_edge_idx_diff(matching_edge) + 1) as usize;
let needle_substring_len = word_idx + partial_len;
let word_bytes_remaining = needle_len as isize - (needle_substring_len - word_start_idx) as isize;
if word_bytes_remaining >= 0 && edge_word[matching_edge_start_idx..matching_edge_end_idx + 1].feq(&word_bytes[word_idx..needle_substring_len]) {
edge_src_id = sub_node_id;
edge_id = *edge_id_opt.unwrap();
let edge = self.edges.get(&edge_id).unwrap();
prev_idx = word_idx;
word_idx += partial_len;
sub_node_id = edge.dest;
} else {
edge_src_id = sub_node_id;
edge_id = *edge_id_opt.unwrap();
let edge = self.edges.get(&edge_id).unwrap();
sub_node_id = edge.dest;
break;
}
}
if word_idx > word_bytes_len {
let edge = self.edges.get(&edge_id).unwrap();
let sink = self.get_sink(&edge.sink_id);
unsafe {
let edge_word_ptr: *const [u8] = &sink.unwrap().word.as_bytes()[(edge.start_idx as usize)..(edge.end_idx as usize + 1)];
let edge_word: &[u8] = &*edge_word_ptr;
let mut split_idx = 0;
for temp_split_idx in 0..(word_bytes.len() - prev_idx) {
if !(&*edge_word)[temp_split_idx..temp_split_idx + 1].feq(&word_bytes[(prev_idx + temp_split_idx)..(prev_idx + temp_split_idx + 1)]) {
split_idx = temp_split_idx;
break;
}
}
if split_idx == 0 && ((word_bytes.len() - prev_idx) < (&*edge_word).len()) {
split_idx = word_bytes.len() - prev_idx - 1;
}
sub_node_id = self.split_edge(
&edge_src_id,
0,
split_idx as i16,
&*edge_word
);
}
sub_node_opt = self.nodes.get_mut_internal(&sub_node_id);
} else if word_idx < word_bytes_len {
let edge = self.edges.get(&edge_id).unwrap();
let sink = self.get_sink(&edge.sink_id);
let edge_dest = edge.dest;
let edge_dest_suffix = self.nodes.get_internal(&edge_dest).unwrap().suffix;
let mut split_idx = 0;
let edge_word_len = (matching_edge_end_idx - matching_edge_start_idx + 1) as usize;
let word_bytes_remaining = word_bytes_len - word_idx;
let mut should_add_edge = false;
if edge_word_len > 1 {
unsafe {
let edge_word_ptr: *const [u8] = &sink.unwrap().word.as_bytes()[(matching_edge_start_idx as usize)..(matching_edge_end_idx as usize + 1)];
let edge_word: &[u8] = &*edge_word_ptr;
let diff;
if word_bytes_remaining > edge_word_len {
diff = edge_word_len;
} else {
diff = word_bytes_remaining;
}
for temp_split_idx in 0..(diff) {
if !(&*edge_word)[temp_split_idx..(temp_split_idx + 1)].feq(&word_bytes[(word_idx + temp_split_idx)..(word_idx + temp_split_idx + 1)]) {
split_idx = temp_split_idx - 1;
should_add_edge = true;
break;
}
}
if split_idx == 0 && (word_bytes_remaining < edge_word_len) {
split_idx = word_bytes_remaining - 1;
}
let parent = edge_src_id;
edge_src_id = self.split_edge(
&edge_src_id,
0,
split_idx as i16,
&*edge_word
);
let mut edge_src_opt = self.nodes.get_mut_internal(&edge_src_id);
edge_src_opt.as_mut().unwrap().suffix = edge_dest_suffix;
edge_src_opt.unwrap().add_sink(self.sink_id);
}
} else {
should_add_edge = true;
}
if should_add_edge {
let update_node_next = self.nodes.get_internal(&edge_src_id).unwrap();
let sub_node_length = update_node_next._length + split_idx as NodeLength + 1;
let new_sub_node = self.nodes.new_inode(sub_node_length, edge_dest_suffix);
let mut sub_node = new_sub_node.0;
sub_node_id = new_sub_node.1;
self.nodes.add_node(sub_node_id, sub_node);
self.set_edge(
edge_src_id,
self.sink_id,
(word_idx + split_idx - 1) as i16,
(word_bytes_len - 1) as i16,
sub_node_id,
);
} else {
sub_node_id = edge_src_id;
}
sub_node_opt = self.nodes.get_mut_internal(&sub_node_id);
} else {
sub_node_opt = self.nodes.get_mut_internal(&sub_node_id);
}
if prev_node_id.is_some() {
let mut prev_node_opt = self.nodes.get_mut_internal(&prev_node_id.unwrap());
let prev_node = prev_node_opt.as_mut().unwrap();
if !self._lite {
prev_node.suffix = sub_node_id;
} else {
prev_node.suffix = prev_node_id.unwrap();
}
}
sub_node_opt = self.nodes.get_mut_internal(&sub_node_id);
sub_node_opt.unwrap().add_sink(self.sink_id);
prev_node_id = Some(sub_node_id);
}
if prev_node_id.is_some() && prev_node_id.unwrap() != SOURCE_ID {
let mut prev_node_opt = self.nodes.get_mut_internal(&prev_node_id.unwrap());
let prev_node = prev_node_opt.as_mut().unwrap();
if !self._lite {
prev_node.suffix = SOURCE_ID;
} else {
prev_node.suffix = prev_node_id.unwrap();
}
}
} else {
let mut cur_node = update_data.0;
while cur_node != SOURCE_ID {
let node = self.nodes.get_mut_internal(&cur_node).unwrap();
node.add_sink(self.sink_id);
let suffix_node_id = self.get_suffix_id(&cur_node);
cur_node = suffix_node_id;
}
}
self.sink_id = NONE_SINK_ID;
self._size += 1;
}
pub fn remove(&mut self, word: &str) -> Option<SeaSinkNode<V>> {
unimplemented!()
}
fn _find(&self, word_bytes: &[u8]) -> Option<(NodeId, EdgeId, NodeId)> {
let word_bytes_len = word_bytes.len();
let mut sub_node_id: NodeId = SOURCE_ID;
let mut edge_id: EdgeId = 0;
let mut edge_src_id = 0;
let mut matching_edge_start_idx = 0usize;
let mut matching_edge_end_idx = 0usize;
let needle_len = word_bytes_len;
let mut word_idx = 0;
let mut prev_idx = 0;
while word_idx < word_bytes_len {
let edge_letter = &word_bytes[word_idx as usize];
let edge_id_opt = self.nodes.get_to(&sub_node_id, edge_letter);
if edge_id_opt.is_none() {
break;
}
let matching_edge_id = edge_id_opt.unwrap();
let matching_edge_opt = self.edges.get(matching_edge_id);
let matching_edge = matching_edge_opt.unwrap();
matching_edge_start_idx = matching_edge.start_idx as usize;
matching_edge_end_idx = matching_edge.end_idx as usize;
let sink = self.get_sink(&matching_edge.sink_id);
let edge_word = sink.unwrap().word.as_bytes();
let partial_len: usize = (self.get_edge_idx_diff(matching_edge) + 1) as usize;
let needle_substring_len = word_idx + partial_len;
if needle_substring_len <= needle_len && edge_word[matching_edge_start_idx..matching_edge_end_idx + 1].feq(&word_bytes[word_idx..needle_substring_len]) {
edge_src_id = sub_node_id;
edge_id = *edge_id_opt.unwrap();
let edge = self.edges.get(&edge_id).unwrap();
prev_idx = word_idx;
word_idx += partial_len;
sub_node_id = edge.dest;
} else {
return None;
}
}
return Some((edge_src_id, edge_id, sub_node_id));
}
pub fn find_exact(&self, needle: &str) -> Option<NodeId> {
if needle.is_empty() {
return None;
}
let needle_bytes = needle.as_bytes();
let mut target_node_id: Option<NodeId> = None;
let needle_len = needle_bytes.len();
let mut word_idx: usize = 0;
let mut current_node_id = SOURCE_ID;
loop {
let word_cp = needle_bytes[word_idx as usize];
let matching_edge_id_option = self.nodes.get_to(¤t_node_id, &word_cp);
if matching_edge_id_option.is_none() {
break;
}
let matching_edge_id = matching_edge_id_option.unwrap();
let matching_edge_opt = self.edges.get(matching_edge_id);
let matching_edge = matching_edge_opt.unwrap();
let matching_edge_start_idx = matching_edge.start_idx as usize;
let matching_edge_end_idx = matching_edge.end_idx as usize;
let sink = self.get_sink(&matching_edge.sink_id);
let edge_word = sink.unwrap().word.as_bytes();
let partial_len: usize = (self.get_edge_idx_diff(matching_edge) + 1) as usize;
let needle_substring_len = word_idx + partial_len;
if needle_substring_len <= needle_len && edge_word[matching_edge_start_idx..matching_edge_end_idx + 1].feq(&needle_bytes[word_idx..needle_substring_len]) {
if needle_len == needle_substring_len {
let dest = self.nodes.get_internal(&matching_edge.dest).unwrap();
for sink_node_id in dest.sink_nodes.iter() {
let sink_node = self.nodes.get_sink(sink_node_id).unwrap();
if needle_bytes.feq(sink_node.word.as_bytes()) {
target_node_id = Some(*sink_node_id);
break;
}
}
break;
}
current_node_id = matching_edge.dest;
word_idx += partial_len;
continue;
}
break;
}
return target_node_id;
}
pub fn find_with_prefix(&self, prefix: &str) -> Vec<TraversalResult> {
let mut traverser = FindPrefixTraverser::new(prefix);
let prefix_inner = TraversalContextData::new(
TraversalMode::Traversal,
Some(SOURCE_ID),
vec![],
vec![],
0,
None,
);
let base_context = FindPrefixContext::new(prefix_inner);
let executor = TraversalExecutor::new();
return executor.execute_traversal(self, &mut traverser, base_context);
}
pub fn find_with_suffix(&self, needle: &str) -> Vec<TraversalResult> {
let mut traverser = FindSuffixTraverser::new(needle);
let context_inner = TraversalContextData::new(
TraversalMode::Traversal,
Some(SOURCE_ID),
vec![],
vec![],
0,
None,
);
let base_context = FindSuffixContext::new(context_inner);
let executor = TraversalExecutor::new();
return executor.execute_traversal(self, &mut traverser, base_context);
}
pub fn find_with_substring(&self, needle: &str) -> Vec<TraversalResult> {
let mut traverser = FindSuperStringTraverser::new(needle);
let context_inner = TraversalContextData::new(
TraversalMode::Traversal,
Some(SOURCE_ID),
vec![],
vec![],
0,
None,
);
let base_context = FindSuperStringContext::new(context_inner, false);
let executor = TraversalExecutor::new();
let results = executor.execute_traversal(self, &mut traverser, base_context);
return results;
}
fn update(&mut self, word: &[u8], letter: Letter, (mut update_node_id, mut start_idx): (NodeId, StrIdx), end_idx: StrIdx) -> (NodeId, StrIdx) {
let mut prev_node_id_option: Option<NodeId> = None;
let mut update_node_prime_option: Option<NodeId> = None;
let mut update_node_next_id: Option<NodeId> = None;
let prev_end_idx = end_idx - 1;
while !self.check_endpoint(&update_node_id, start_idx, prev_end_idx, letter, word) {
if start_idx <= prev_end_idx {
let possible_extension = self.extension(update_node_id, start_idx, prev_end_idx, word);
if update_node_prime_option.is_some() && update_node_prime_option.unwrap() == possible_extension {
self.redirect_edge(update_node_id, start_idx, prev_end_idx, update_node_next_id.unwrap(), word);
let canonized_data = self.canonize(self.get_suffix_id(&update_node_id), start_idx, prev_end_idx, word);
update_node_id = canonized_data.0;
start_idx = canonized_data.1;
continue;
}
update_node_prime_option = Some(possible_extension);
update_node_next_id = Some(self.split_edge(&update_node_id, start_idx, prev_end_idx, word));
} else {
update_node_next_id = Some(update_node_id);
}
assert!(!self.nodes.contains_to(&update_node_next_id.unwrap(), &letter), "Edge Clobbering detected");
let update_node_next = self.nodes.get_internal(&update_node_next_id.unwrap()).unwrap();
let sub_node_length = update_node_next._length + word.len() as NodeLength - end_idx as NodeLength;
let mut new_sub_node = self.nodes.new_inode(sub_node_length, SOURCE_ID);
let mut sub_node = new_sub_node.0;
let sub_node_id = new_sub_node.1;
self.nodes.add_node(sub_node_id, sub_node);
self.set_edge(
update_node_next_id.unwrap(),
self.sink_id,
end_idx,
(word.len() - 1) as StrIdx,
sub_node_id
);
let sub_node = self.nodes.get_mut_internal(&sub_node_id).unwrap();
sub_node.add_sink(self.sink_id);
update_node_next_id = Some(sub_node_id);
if prev_node_id_option.is_some() {
self.nodes.get_mut_internal(&prev_node_id_option.unwrap()).unwrap().suffix = update_node_next_id.unwrap();
if update_node_next_id.unwrap() != update_node_id {
}
}
prev_node_id_option = update_node_next_id.clone();
let canonized_data = self.canonize(
self.get_suffix_id(&update_node_id),
start_idx,
prev_end_idx,
word
);
update_node_id = canonized_data.0;
start_idx = canonized_data.1;
}
if prev_node_id_option.is_some() {
let suffix = self.get_suffix_id(&prev_node_id_option.unwrap());
if !self._lite {
self.nodes.get_mut_internal(&prev_node_id_option.unwrap()).unwrap().suffix = update_node_id;
} else {
self.nodes.get_mut_internal(&prev_node_id_option.unwrap()).unwrap().suffix = prev_node_id_option.unwrap();
}
}
return self.separate_node(update_node_id, start_idx, end_idx, word);
}
fn check_endpoint(&self, node_id: &NodeId, start_idx: StrIdx, end_idx: StrIdx, letter: Letter, word: &[u8]) -> bool {
if start_idx <= end_idx {
let word_letter = word[start_idx as usize];
let edge_id = self.nodes.get_to(node_id, &word_letter).unwrap();
let edge = self.edges.get(edge_id).unwrap();
let sink = self.get_sink(&edge.sink_id);
let word = &*sink.unwrap().word;
let partial_letter = get_codepoint_at(word, (edge.start_idx + end_idx - start_idx + 1) as usize);
return letter == partial_letter;
}
return self.nodes.contains_to(node_id, &letter);
}
fn canonize(&mut self, mut node_id: NodeId, mut start_idx: StrIdx, end_idx: StrIdx, word: &[u8]) -> (NodeId, StrIdx) {
if start_idx > end_idx {
return (node_id, start_idx);
}
let edge_letter = word[start_idx as usize];
let mut edge_id = self.nodes.get_to(&node_id, &edge_letter).unwrap();
let mut edge = self.edges.get(edge_id).unwrap();
let mut edge_src = node_id;
let mut edge_idx_diff = self.get_edge_idx_diff(edge) as StrIdx;
while edge_idx_diff <= end_idx - start_idx {
start_idx += edge_idx_diff + 1;
node_id = edge.dest;
if start_idx <= end_idx {
let word_letter = &word[start_idx as usize];
edge_id = self.nodes.get_to(&node_id, word_letter).unwrap();
edge = self.edges.get(edge_id).unwrap();
edge_src = node_id;
}
edge_idx_diff = self.get_edge_idx_diff(edge) as StrIdx;
}
return (node_id, start_idx);
}
fn extension(&self, node_id: NodeId, start_idx: StrIdx, end_idx: StrIdx, word: &[u8]) -> NodeId {
if start_idx > end_idx {
return node_id;
}
let letter = word[start_idx as usize];
let edge_id = self.nodes.get_to(&node_id, &letter).unwrap();
let edge = self.edges.get(edge_id).unwrap();
return edge.dest;
}
fn redirect_edge(&mut self, src_node_id: NodeId, start_idx: StrIdx, end_idx: StrIdx, dest: NodeId, word: &[u8]) {
let letter = word[start_idx as usize];
let edge_id = self.nodes.get_to(&src_node_id, &letter).unwrap();
let edge = self.edges.get(edge_id).unwrap();
let edge_start_idx = edge.start_idx;
let edge_sink_id = edge.sink_id;
let substring_idx_diff = end_idx - start_idx;
let edge_end_idx = edge_start_idx + substring_idx_diff;
self.set_edge(src_node_id, edge_sink_id, edge_start_idx, edge_end_idx, dest);
}
fn split_edge(&mut self, src_node_id: &NodeId, start_idx: StrIdx, end_idx: StrIdx, word: &[u8]) -> u32 {
if start_idx > end_idx {
panic!("Split edge cannot have start less than end");
}
let letter = word[start_idx as usize];
let src_node = self.nodes.get_internal(&src_node_id).unwrap();
let node_length = src_node.length();
let edge_id = self.nodes.get_to(&src_node_id, &letter).unwrap();
let edge = self.edges.get(edge_id).unwrap();
let edge_dest = edge.dest;
let edge_start_idx = edge.start_idx;
let edge_end_idx = edge.end_idx;
let edge_sink_id = edge.sink_id;
let left_substring_idx_diff = end_idx - start_idx;
let left_substring_length = left_substring_idx_diff + 1;
let new_new_node = self.nodes.new_inode(node_length + left_substring_length as NodeLength,SOURCE_ID);
let mut new_node = new_new_node.0;
let new_node_id = new_new_node.1;
self.nodes.add_node(new_node_id, new_node);
self.set_edge(
new_node_id,
edge_sink_id,
edge_start_idx + left_substring_length,
edge_end_idx,
edge_dest,
);
self.set_edge(
*src_node_id,
edge_sink_id,
edge_start_idx,
edge_start_idx + left_substring_idx_diff,
new_node_id,
);
return new_node_id;
}
fn separate_node(&mut self, mut src_node_id: NodeId, mut start_idx: StrIdx, end_idx: StrIdx, word: &[u8]) -> (NodeId, StrIdx) {
let canonized_data = self.canonize(src_node_id, start_idx, end_idx, word);
if canonized_data.1 <= end_idx {
return canonized_data;
}
let mut src_node = self.nodes.get_internal(&src_node_id).unwrap();
let canon_node_id = canonized_data.0;
let canon_node = self.nodes.get_internal(&canon_node_id).unwrap();
let sep_length = src_node.length() as StrIdx + end_idx - start_idx + 1;
if canon_node.length() == sep_length as NodeLength {
return canonized_data;
}
let sep_node_id = self.clone_node(&canon_node_id);
let mut sep_node = self.nodes.get_mut_internal(&sep_node_id).unwrap();
sep_node._length = sep_length as NodeLength;
let canon_node = self.nodes.get_mut_internal(&canon_node_id).unwrap();
canon_node.suffix = sep_node_id;
loop {
let letter = word[start_idx as usize];
let edge_id = self.nodes.get_to(&src_node_id, &letter).unwrap();
let edge = self.edges.get(edge_id).unwrap();
let edge_sink_id = edge.sink_id;
let edge_start_idx = edge.start_idx;
let edge_end_idx = edge.end_idx;
self.set_edge(
src_node_id,
edge_sink_id,
edge_start_idx,
edge_end_idx,
sep_node_id,
);
src_node = self.nodes.get_mut_internal(&src_node_id).unwrap();
let src_node_suffix = src_node.suffix;
let suffix_canonized_data = self.canonize(src_node_suffix, start_idx, end_idx - 1, word);
src_node_id = suffix_canonized_data.0;
start_idx = suffix_canonized_data.1;
let new_canonized_node_pair = self.canonize(src_node_id, start_idx, end_idx, word);
if (canonized_data.0 != new_canonized_node_pair.0) || canonized_data.1 != new_canonized_node_pair.1 {
break;
}
}
return (sep_node_id, end_idx + 1);
}
fn get_suffix_id(&self, node_id: &NodeId) -> NodeId {
let node = self.nodes.get_internal(node_id).unwrap();
return node.suffix;
}
pub (in crate) fn get_edge_idx_diff(&self, edge: &SeaEdge) -> NodeLength {
return edge.end_idx - edge.start_idx;
}
fn clone_node(&mut self, node_id: &NodeId) -> u32 {
let src_node = self.nodes.get_internal(node_id).unwrap();
let suffix = src_node.suffix;
let length = src_node.length();
let new_cloned_node = self.nodes.new_inode(length, suffix);
let cloned_node = new_cloned_node.0;
let cloned_node_id = new_cloned_node.1;
self.nodes.add_node(cloned_node_id ,cloned_node);
let to_edges = self.nodes.get_to_edges(node_id);
for edge_id in to_edges {
let edge = self.edges.get(&edge_id).unwrap();
let sink_id = edge.sink_id;
let start_idx = edge.start_idx;
let end_idx = edge.end_idx;
let edge_dest = edge.dest;
self.set_edge(
cloned_node_id,
sink_id,
start_idx,
end_idx,
edge_dest,
);
}
return cloned_node_id;
}
fn set_edge(
&mut self,
src_node_id: NodeId,
sink_id: NodeId,
start_idx: StrIdx,
end_idx: StrIdx,
dest: NodeId,
) -> EdgeId {
if start_idx > end_idx {
panic!("start idx cannot be greater than end");
}
let sink = self.get_sink(&sink_id);
let word = &*sink.unwrap().word;
let letter = get_codepoint_at(word, start_idx as usize);
let existing_edit_id_option = self.nodes.get_to(&src_node_id, &letter);
if existing_edit_id_option.is_some() {
let existing_edge_id = *existing_edit_id_option.unwrap();
if let Some(existing_edge) = self.edges.get_mut(&existing_edge_id) {
existing_edge.sink_id = sink_id;
existing_edge.start_idx = start_idx;
existing_edge.end_idx = end_idx;
existing_edge.dest = dest;
}
return existing_edge_id;
} else {
let (new_edge, new_edge_id) = self.edges.new_edge(
dest,
sink_id,
start_idx,
end_idx,
);
self.nodes.add_to(src_node_id, letter, new_edge_id);
self.edges.add(new_edge_id, new_edge);
return new_edge_id;
}
}
fn remove_edge(&mut self, src_node_id: NodeId, letter: Letter) -> Option<u32> {
let existing_edit_id_option = self.nodes.get_to(&src_node_id, &letter);
if existing_edit_id_option.is_none() {
return None;
}
let existing_edge_id = *existing_edit_id_option.unwrap();
if let Some(existing_edge) = self.edges.get_mut(&existing_edge_id) {
self.nodes.remove_to(&src_node_id, &letter);
return Some(existing_edge_id);
}
return None;
}
}