blob: 62453756ff2634e5a7aa210ac925d056a3977e90 (
plain)
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
|
/*-
* ============LICENSE_START=======================================================
* VID
* ================================================================================
* Copyright (C) 2017 - 2019 AT&T Intellectual Property. 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.vid.utils
data class Node<T>(val value:T, val children:MutableMap<T, Node<T>> = hashMapOf())
data class Tree<T>(private val root:Node<T>) {
constructor(value: T) : this(Node(value))
fun getRootValue():T {
return root.value;
}
fun addPath(vararg path: T) {
addPath(path.asList())
}
fun addPath(path:Collection<T>) {
var currentNode = root
path.forEach {
currentNode = currentNode.children.getOrPut(it) {Node(it)}
}
}
fun getChildrenDepth(): Int {
return getMaxDepth(root) - 1
}
private fun getMaxDepth(level:Node<T>): Int {
return (level.children.map{getMaxDepth(it.value)}.max() ?: 0) + 1
}
fun getSubTree(vararg path: T): Tree<T>? {
return getSubTree(path.asList())
}
fun getSubTree(path:Collection<T>): Tree<T>? {
var currentNode:Node<T> = root
path.forEach {
currentNode = currentNode.children[it] ?: return null
}
return Tree(currentNode)
}
fun isPathExist(vararg path: T): Boolean {
return isPathExist(path.asList())
}
fun isPathExist(path:Collection<T>): Boolean {
return getSubTree(path)!=null
}
}
|
