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
use super::capi::*;
use std::ptr::null_mut;
pub struct JudyL {
m: Pvoid_t,
}
impl JudyL {
pub fn new() -> JudyL {
JudyL{m: null_mut()}
}
pub fn insert(&mut self, index: Word_t, value: Word_t) -> bool {
unsafe {
let v = JudyLIns(&mut self.m, index, null_mut());
if v == null_mut() {
false
} else if *v != null_mut() {
false
} else {
*v = value as Pvoid_t;
true
}
}
}
pub fn get(&self, index: Word_t) -> Option<Word_t> {
unsafe {
let v = JudyLGet(self.m, index, null_mut());
if v == null_mut() {
None
} else {
Some(*v as Word_t)
}
}
}
pub fn free(&mut self) -> Word_t {
if self.m != null_mut() {
unsafe {
let ret = JudyLFreeArray(&mut self.m, null_mut());
assert!(self.m == null_mut());
ret
}
} else {
0
}
}
pub fn iter<'a>(&'a self) -> JudyLIterator<'a> {
JudyLIterator{j: self, i: 0}
}
pub fn count(&self, index1: Word_t, index2: Word_t) -> Word_t {
unsafe {
JudyLCount(self.m, index1, index2, null_mut())
}
}
pub fn remove(&mut self, index: &Word_t) -> bool {
1 == unsafe { JudyLDel(&mut self.m, *index, null_mut()) }
}
pub fn clear(&mut self) {
self.free();
}
pub fn len(&self) -> usize {
self.count(0, Word_t::max_value()) as usize
}
pub fn is_empty(&self) -> bool {
self.m == null_mut()
}
}
pub struct JudyLIterator<'a> {
j: &'a JudyL,
i: Word_t,
}
impl<'a> Iterator for JudyLIterator<'a> {
type Item = (Word_t, Word_t);
fn next(&mut self) -> Option<(Word_t, Word_t)> {
unsafe {
let v = JudyLNext(self.j.m, &mut self.i, null_mut());
if v == null_mut() {
None
} else {
Some((self.i, *v as Word_t))
}
}
}
}
impl Drop for JudyL {
fn drop(&mut self) {
self.free();
}
}