|
1 | 1 | package blue.language; |
2 | 2 |
|
3 | | -import blue.language.utils.MergeReverser; |
4 | 3 | import blue.language.model.Node; |
5 | 4 | import blue.language.provider.BasicNodeProvider; |
| 5 | +import blue.language.utils.BlueIdCalculator; |
| 6 | +import blue.language.utils.MergeReverser; |
6 | 7 | import blue.language.utils.Properties; |
7 | 8 | import org.junit.jupiter.api.Test; |
8 | 9 |
|
| 10 | +import java.util.Arrays; |
| 11 | + |
9 | 12 | import static org.junit.jupiter.api.Assertions.*; |
10 | 13 |
|
11 | 14 | public class MergeReverserTest { |
@@ -51,4 +54,132 @@ public void testBasic1() throws Exception { |
51 | 54 | assertEquals(Properties.TEXT_TYPE_BLUE_ID, reversed.getAsText("/z/itemType/blueId")); |
52 | 55 | } |
53 | 56 |
|
| 57 | + @Test |
| 58 | + public void testNestedTypes() throws Exception { |
| 59 | + BasicNodeProvider nodeProvider = new BasicNodeProvider(); |
| 60 | + |
| 61 | + String a = "name: A\n" + |
| 62 | + "x: 5\n" + |
| 63 | + "y: 10"; |
| 64 | + nodeProvider.addSingleDocs(a); |
| 65 | + |
| 66 | + String b = "name: B\n" + |
| 67 | + "type:\n" + |
| 68 | + " blueId: " + nodeProvider.getBlueIdByName("A") + "\n" + |
| 69 | + "z: 15"; |
| 70 | + nodeProvider.addSingleDocs(b); |
| 71 | + |
| 72 | + String c = "name: C\n" + |
| 73 | + "type:\n" + |
| 74 | + " blueId: " + nodeProvider.getBlueIdByName("B") + "\n" + |
| 75 | + "w: 20"; |
| 76 | + nodeProvider.addSingleDocs(c); |
| 77 | + |
| 78 | + Node cNode = nodeProvider.getNodeByName("C"); |
| 79 | + Blue blue = new Blue(nodeProvider); |
| 80 | + Node resolved = blue.resolve(cNode); |
| 81 | + |
| 82 | + MergeReverser reverser = new MergeReverser(); |
| 83 | + Node reversed = reverser.reverse(resolved); |
| 84 | + |
| 85 | + assertEquals("C", reversed.getName()); |
| 86 | + assertEquals(nodeProvider.getBlueIdByName("B"), reversed.getType().getBlueId()); |
| 87 | + assertEquals(20, reversed.getAsInteger("/w/value")); |
| 88 | + assertFalse(reversed.getProperties().containsKey("x")); |
| 89 | + assertFalse(reversed.getProperties().containsKey("y")); |
| 90 | + assertFalse(reversed.getProperties().containsKey("z")); |
| 91 | + |
| 92 | + assertEquals(BlueIdCalculator.calculateBlueId(cNode), BlueIdCalculator.calculateBlueId(reversed)); |
| 93 | + } |
| 94 | + |
| 95 | + @Test |
| 96 | + public void testComplexNestedProperties() throws Exception { |
| 97 | + BasicNodeProvider nodeProvider = new BasicNodeProvider(); |
| 98 | + |
| 99 | + String m = "name: M\n" + |
| 100 | + "a:\n" + |
| 101 | + " b:\n" + |
| 102 | + " c:\n" + |
| 103 | + " d1: 1"; |
| 104 | + nodeProvider.addSingleDocs(m); |
| 105 | + |
| 106 | + String n = "name: N\n" + |
| 107 | + "c:\n" + |
| 108 | + " d2: 1"; |
| 109 | + nodeProvider.addSingleDocs(n); |
| 110 | + |
| 111 | + String p = "name: P\n" + |
| 112 | + "type:\n" + |
| 113 | + " blueId: " + nodeProvider.getBlueIdByName("M") + "\n" + |
| 114 | + "a:\n" + |
| 115 | + " b:\n" + |
| 116 | + " type:\n" + |
| 117 | + " blueId: " + nodeProvider.getBlueIdByName("N") + "\n" + |
| 118 | + " c:\n" + |
| 119 | + " d3: 3"; |
| 120 | + nodeProvider.addSingleDocs(p); |
| 121 | + |
| 122 | + Node pNode = nodeProvider.getNodeByName("P"); |
| 123 | + Blue blue = new Blue(nodeProvider); |
| 124 | + Node resolved = blue.resolve(pNode); |
| 125 | + assertEquals(1, resolved.getAsInteger("/a/b/c/d1/value")); |
| 126 | + assertEquals(1, resolved.getAsInteger("/a/b/c/d2/value")); |
| 127 | + assertEquals(3, resolved.getAsInteger("/a/b/c/d3/value")); |
| 128 | + |
| 129 | + MergeReverser reverser = new MergeReverser(); |
| 130 | + Node reversed = reverser.reverse(resolved); |
| 131 | + |
| 132 | + assertEquals("P", reversed.getName()); |
| 133 | + assertEquals(nodeProvider.getBlueIdByName("M"), reversed.getType().getBlueId()); |
| 134 | + assertEquals(nodeProvider.getBlueIdByName("N"), reversed.getAsNode("/a/b/type").getBlueId()); |
| 135 | + assertEquals(3, reversed.getAsInteger("/a/b/c/d3/value")); |
| 136 | + assertFalse(reversed.getProperties().containsKey("d1")); |
| 137 | + assertFalse(reversed.getAsNode("/a/b").getProperties().containsKey("d2")); |
| 138 | + } |
| 139 | + |
| 140 | + @Test |
| 141 | + public void testInheritedListAndMap() throws Exception { |
| 142 | + BasicNodeProvider nodeProvider = new BasicNodeProvider(); |
| 143 | + |
| 144 | + String base = "name: Base\n" + |
| 145 | + "list:\n" + |
| 146 | + " - A\n" + |
| 147 | + " - B\n" + |
| 148 | + "map:\n" + |
| 149 | + " key1: value1\n" + |
| 150 | + " key2: value2"; |
| 151 | + nodeProvider.addSingleDocs(base); |
| 152 | + |
| 153 | + String derived = "name: Derived\n" + |
| 154 | + "type:\n" + |
| 155 | + " blueId: " + nodeProvider.getBlueIdByName("Base") + "\n" + |
| 156 | + "list:\n" + |
| 157 | + " - A\n" + |
| 158 | + " - B\n" + |
| 159 | + " - C\n" + |
| 160 | + "map:\n" + |
| 161 | + " key3: value3"; |
| 162 | + nodeProvider.addSingleDocs(derived); |
| 163 | + |
| 164 | + Node derivedNode = nodeProvider.getNodeByName("Derived"); |
| 165 | + Blue blue = new Blue(nodeProvider); |
| 166 | + Node resolved = blue.resolve(derivedNode); |
| 167 | + |
| 168 | + MergeReverser reverser = new MergeReverser(); |
| 169 | + Node reversed = reverser.reverse(resolved); |
| 170 | + |
| 171 | + assertEquals("Derived", reversed.getName()); |
| 172 | + assertEquals(nodeProvider.getBlueIdByName("Base"), reversed.getType().getBlueId()); |
| 173 | + assertEquals(2, reversed.getAsNode("/list").getItems().size()); |
| 174 | + assertEquals(BlueIdCalculator.calculateBlueId( |
| 175 | + Arrays.asList( |
| 176 | + blue.yamlToNode("value: A\ntype: Text"), |
| 177 | + blue.yamlToNode("value: B\ntype: Text") |
| 178 | + ) |
| 179 | + ), reversed.getAsNode("/list").getItems().get(0).getBlueId()); |
| 180 | + assertEquals("C", reversed.getAsNode("/list").getItems().get(1).getValue()); |
| 181 | + assertEquals(1, reversed.getAsNode("/map").getProperties().size()); |
| 182 | + assertEquals("value3", reversed.getAsText("/map/key3/value")); |
| 183 | + } |
| 184 | + |
54 | 185 | } |
0 commit comments