modular_tree 0.9.0 → 0.10.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/lib/modular_tree/algorithms.rb +14 -2
- data/lib/modular_tree/version.rb +1 -1
- metadata +1 -1
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: ae3499e0ea36c7f7dd44068616ec8dd566e43be82c0e728dae86da829b085d7f
|
4
|
+
data.tar.gz: f1c35152a0b97dad0b50e85cf2061baf9bad2fed42ca4bc2bb8df3b000b81468
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 71c8a99e260fe03d2453371b0afe9bc79c22234fe74a79ddf61036affd1a3129c84597006c9b5648831f1b3f469f79f26f73fd1c6263c277cee3bcea91905480
|
7
|
+
data.tar.gz: cb5feecaf6a795c91011fbafca901bb1fea9814e9b1283407b623052d9b33b801d1935d9e5594115154384ab2f49763dd5bd672dba1a3b490d800b4a9129bf3b
|
@@ -10,14 +10,14 @@ module Tree
|
|
10
10
|
include BranchesProperty
|
11
11
|
|
12
12
|
# Bottom-up
|
13
|
-
def ancestors
|
13
|
+
def ancestors # TODO: rename #parents
|
14
14
|
curr = self
|
15
15
|
a = []
|
16
16
|
a.push curr.node while curr = curr.branch
|
17
17
|
a
|
18
18
|
end
|
19
19
|
|
20
|
-
# Top-down
|
20
|
+
# Top-down # TODO: rename #ancestors
|
21
21
|
def ancestry
|
22
22
|
curr = self
|
23
23
|
a = []
|
@@ -306,6 +306,18 @@ module Tree
|
|
306
306
|
|
307
307
|
def path = @path ||= ancestry[1..-1]&.map(&:key)&.join(separator) || ""
|
308
308
|
def uid() @uid ||= [parent&.uid, key].compact.join(separator) end
|
309
|
+
|
310
|
+
def search(*args, this: true, &block)
|
311
|
+
matcher = Matcher.new(*args, &block)
|
312
|
+
curr = this ? self : branch
|
313
|
+
while curr
|
314
|
+
return curr if matcher.match?(curr)
|
315
|
+
curr = curr.branch
|
316
|
+
end
|
317
|
+
end
|
318
|
+
|
319
|
+
# TODO
|
320
|
+
def lookup(key) = raise NotImplementedError
|
309
321
|
end
|
310
322
|
|
311
323
|
module DotAlgorithms
|
data/lib/modular_tree/version.rb
CHANGED