forked from Workiva/go-datastructures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
iterator.go
60 lines (48 loc) · 1.53 KB
/
iterator.go
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
/*
Copyright 2014 Workiva, LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package xfast
// Entries is a typed list of Entry interfaces.
type Entries []Entry
// Iterator will iterate of the results of a query.
type Iterator struct {
n *node
first bool
}
// Next will return a bool indicating if another value exists
// in the iterator.
func (iter *Iterator) Next() bool {
if iter.first {
iter.first = false
return iter.n != nil
}
iter.n = iter.n.children[1]
return iter.n != nil
}
// Value will return the Entry representing the iterator's current position.
// If no Entry exists at the present condition, the iterator is
// exhausted and this method will return nil.
func (iter *Iterator) Value() Entry {
if iter.n == nil {
return nil
}
return iter.n.entry
}
// exhaust is a helper function that will exhaust this iterator
// and return a list of entries. This is for internal use only.
func (iter *Iterator) exhaust() Entries {
entries := make(Entries, 0, 100)
for it := iter; it.Next(); {
entries = append(entries, it.Value())
}
return entries
}