blob: c29d94a8e8d0fabc0a0e0ebfd53598766f5818c2 (
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
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/*-
* ============LICENSE_START=======================================================
* org.openecomp.aai
* ================================================================================
* Copyright (C) 2017 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.openecomp.aai.db.schema;
import com.thinkaurelius.titan.core.EdgeLabel;
import com.thinkaurelius.titan.core.PropertyKey;
import com.thinkaurelius.titan.core.TitanGraph;
import com.thinkaurelius.titan.core.schema.TitanGraphIndex;
import com.thinkaurelius.titan.core.schema.TitanManagement;
import java.util.Iterator;
import java.util.LinkedHashSet;
import org.apache.tinkerpop.gremlin.structure.Vertex;
public class AuditTitan extends Auditor {
private final TitanGraph graph;
/**
* Instantiates a new audit titan.
*
* @param g the g
*/
public AuditTitan(TitanGraph g) {
this.graph = g;
buildSchema();
}
/**
* Builds the schema.
*/
private void buildSchema() {
populateProperties();
populateIndexes();
populateEdgeLabels();
}
/**
* Populate properties.
*/
private void populateProperties() {
TitanManagement mgmt = graph.openManagement();
Iterable<PropertyKey> iterable = mgmt.getRelationTypes(PropertyKey.class);
Iterator<PropertyKey> titanProperties = iterable.iterator();
PropertyKey propKey;
while (titanProperties.hasNext()) {
propKey = titanProperties.next();
DBProperty prop = new DBProperty();
prop.setName(propKey.name());
prop.setCardinality(propKey.cardinality());
prop.setTypeClass(propKey.dataType());
this.properties.put(prop.getName(), prop);
}
}
/**
* Populate indexes.
*/
private void populateIndexes() {
TitanManagement mgmt = graph.openManagement();
Iterable<TitanGraphIndex> iterable = mgmt.getGraphIndexes(Vertex.class);
Iterator<TitanGraphIndex> titanIndexes = iterable.iterator();
TitanGraphIndex titanIndex;
while (titanIndexes.hasNext()) {
titanIndex = titanIndexes.next();
if (titanIndex.isCompositeIndex()) {
DBIndex index = new DBIndex();
LinkedHashSet<DBProperty> dbProperties = new LinkedHashSet<>();
index.setName(titanIndex.name());
index.setUnique(titanIndex.isUnique());
PropertyKey[] keys = titanIndex.getFieldKeys();
for (PropertyKey key : keys) {
dbProperties.add(this.properties.get(key.name()));
}
index.setProperties(dbProperties);
index.setStatus(titanIndex.getIndexStatus(keys[0]));
this.indexes.put(index.getName(), index);
}
}
}
/**
* Populate edge labels.
*/
private void populateEdgeLabels() {
TitanManagement mgmt = graph.openManagement();
Iterable<EdgeLabel> iterable = mgmt.getRelationTypes(EdgeLabel.class);
Iterator<EdgeLabel> titanEdgeLabels = iterable.iterator();
EdgeLabel edgeLabel;
while (titanEdgeLabels.hasNext()) {
edgeLabel = titanEdgeLabels.next();
EdgeProperty edgeProperty = new EdgeProperty();
edgeProperty.setName(edgeLabel.name());
edgeProperty.setMultiplicity(edgeLabel.multiplicity());
this.edgeLabels.put(edgeProperty.getName(), edgeProperty);
}
}
}
|
