forked from diffplug/durian
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreeStreamTest.java
95 lines (81 loc) · 2.8 KB
/
TreeStreamTest.java
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
/*
* Copyright 2016 DiffPlug
*
* 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 com.diffplug.common.base;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
import org.junit.Assert;
import org.junit.Test;
import com.diffplug.common.base.TreeNode;
import com.diffplug.common.base.TreeStream;
public class TreeStreamTest {
// @formatter:off
private TreeNode<String> testData = TreeNode.createTestData(
"root",
" A",
" B",
" C",
" 1",
" 2",
" 3",
" a");
// @formatter:on
@Test
public void toParentTest() {
toParentTestCase("root");
toParentTestCase("A", "root");
toParentTestCase("a", "2", "1", "root");
toParentTestCase("3", "2", "1", "root");
}
private void toParentTestCase(String root, String... values) {
List<String> actual = TreeStream.toParent(TreeNode.treeDef(), getNode(root))
.map(TreeNode::getContent)
.collect(Collectors.toList());
Assert.assertEquals(root, actual.get(0));
Assert.assertEquals(Arrays.asList(values), actual.subList(1, actual.size()));
}
@Test
public void breadthFirstTest() {
breadthFirstTestCase("root", "A", "1", "B", "2", "C", "3", "a");
}
private void breadthFirstTestCase(String root, String... values) {
List<String> actual = TreeStream.breadthFirst(TreeNode.treeDef(), getNode(root))
.map(TreeNode::getContent)
.collect(Collectors.toList());
Assert.assertEquals(root, actual.get(0));
Assert.assertEquals(Arrays.asList(values), actual.subList(1, actual.size()));
}
@Test
public void depthFirstTest() {
depthFirstTestCase(TreeNode.treeDef(), "root", "A", "B", "C", "1", "2", "3", "a");
}
private void depthFirstTestCase(TreeDef<TreeNode<String>> treeDef, String root, String... values) {
List<String> actual = TreeStream.depthFirst(treeDef, getNode(root))
.map(TreeNode::getContent)
.collect(Collectors.toList());
Assert.assertEquals(root, actual.get(0));
Assert.assertEquals(Arrays.asList(values), actual.subList(1, actual.size()));
}
@Test
public void filterTest() {
// filter out non-alphabetic nodes
depthFirstTestCase(TreeNode.<String> treeDef().filter(node -> node.getContent().codePoints().allMatch(Character::isAlphabetic)),
"root", "A", "B", "C");
}
private TreeNode<String> getNode(String name) {
return testData.findByContent(name);
}
}