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
|
/*
* ============LICENSE_START====================================
* DCAEGEN2-SERVICES-SDK
* =========================================================
* Copyright (C) 2019 Nokia. All rights reserved.
* =========================================================
* 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.
* ============LICENSE_END=====================================
*/
package org.onap.dcaegen2.services.sdk.rest.services.cbs.client.api.listener;
import static org.assertj.core.api.Assertions.assertThat;
import org.junit.jupiter.api.Test;
import org.onap.dcaegen2.services.sdk.rest.services.cbs.client.api.listener.MerkleTree;
/**
* @author <a href="mailto:piotr.jaszczyk@nokia.com">Piotr Jaszczyk</a>
* @since February 2019
*/
class MerkleTreeTest {
@Test
void shouldBeAbleToGetEntries() {
MerkleTree<String> cut = emptyTree()
.add("value1", "ala", "ma", "kota")
.add("value2", "ala", "ma", "psa");
assertThat(cut.get("ala", "ma", "kota")).contains("value1");
assertThat(cut.get("ala", "ma", "psa")).contains("value2");
}
@Test
void shouldReturnNoneForNonExistingPaths() {
MerkleTree<String> cut = emptyTree()
.add("value1", "ala", "ma", "kota")
.add("value2", "ala", "ma", "psa");
assertThat(cut.get("ala", "je", "obiad")).isEmpty();
}
@Test
void shouldReturnNoneWhenNodeDoesntContainValue() {
MerkleTree<String> cut = emptyTree()
.add("value1", "ala", "ma", "kota")
.add("value2", "ala", "ma", "psa");
assertThat(cut.get("ala", "ma")).isEmpty();
}
@Test
void shouldNotCreateNewObjectWhenNothingChanged() {
MerkleTree<String> cut = emptyTree()
.add("some value", "ala", "ma", "kota");
final MerkleTree<String> result = cut.add("some value", "ala", "ma", "kota");
assertThat(result).isSameAs(cut);
}
@Test
void shouldRecalculateHashesAfterAddingNewNode() {
MerkleTree<String> cut = emptyTree()
.add("value1", "ala", "ma", "kota")
.add("value2", "ala", "ma", "psa")
.add("value3", "ala", "name");
final MerkleTree<String> modified = cut.add("value4", "ala", "surname");
assertThat(modified).isNotSameAs(cut);
assertThat(modified.hashOf("ala", "ma")).isEqualTo(cut.hashOf("ala", "ma"));
assertThat(modified.hashOf("ala", "ma", "kota")).isEqualTo(cut.hashOf("ala", "ma", "kota"));
assertThat(modified.hashOf("ala", "ma", "psa")).isEqualTo(cut.hashOf("ala", "ma", "psa"));
assertThat(modified.hashOf("ala", "name")).isEqualTo(cut.hashOf("ala", "name"));
assertThat(modified.hashOf("ala", "surname")).isNotEqualTo(cut.hashOf("ala", "surname"));
assertThat(modified.hashOf("ala")).isNotEqualTo(cut.hashOf("ala"));
assertThat(modified.hash()).isNotEqualTo(cut.hash());
}
private MerkleTree<String> emptyTree() {
return MerkleTree.emptyWithDefaultDigest(String::getBytes);
}
}
|