Skip to content

Commit f17c0c1

Browse files
author
David Baum
committed
remove warnings in city m2m package
1 parent cc6b603 commit f17c0c1

7 files changed

Lines changed: 107 additions & 183 deletions

File tree

generator2/org.getaviz.generator/src/main/java/org/getaviz/generator/city/m2m/BrickLayout.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -8,11 +8,11 @@
88
import org.getaviz.generator.city.CityUtils;
99
import org.getaviz.generator.database.DatabaseConnector;
1010

11-
public class BrickLayout {
11+
class BrickLayout {
1212
private static SettingsConfiguration config = SettingsConfiguration.getInstance();
1313
private static DatabaseConnector connector = DatabaseConnector.getInstance();
1414

15-
public static void brickLayout(Long model) {
15+
static void brickLayout(Long model) {
1616
StatementResult buildings = connector
1717
.executeRead("MATCH (n:City:Model)-[:CONTAINS*]->(b:Building) WHERE ID(n) = " + model + " RETURN b");
1818
while (buildings.hasNext()) {
@@ -35,7 +35,7 @@ private static void separateBuilding(Node building) {
3535
bsPosIndex_X, bsPosIndex_Y, bsPosIndex_Z;
3636
double b_lowerLeftX, b_upperY, b_lowerLeftZ;
3737
sideCapacity = building.get("sideCapacity").asInt();
38-
List<Node> classElements = null;
38+
List<Node> classElements;
3939
switch (config.getClassElementsMode()) {
4040
case ATTRIBUTES_ONLY:
4141
classElements = CityUtils.getData(building.id());

generator2/org.getaviz.generator/src/main/java/org/getaviz/generator/city/m2m/BuildingSegmentComparator.java

Lines changed: 18 additions & 44 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,6 @@
1212
public class BuildingSegmentComparator implements Comparable<BuildingSegmentComparator> {
1313
private Node segment;
1414
private Node relatedEntity;
15-
// Temporary attribute to use db and famix in same transformation
1615
private int coarseValue; // compares class elements (methods <-> attributes)
1716
private int fineValue; // compared after coarseValue
1817
private int finerValue; // compared after finevalue, if it was equal
@@ -39,40 +38,27 @@ public BuildingSegmentComparator(final Node segment) {
3938
case NOS: // numberOfStatements compared directly in compareTo-method
4039
finerValue = getCompValue_Type(relatedEntity); // If NOS are equal, sort for types
4140
break;
42-
case UNSORTED:
43-
break;
44-
default:
41+
case UNSORTED:
42+
default:
4543
break;
4644
}
4745
}
4846

49-
static int getCompValue_Visibility(final String modifier) {
50-
if (modifier.indexOf("private") >= 0) {
51-
return SortPriorities_Visibility.PRIVATE;
52-
} else if (modifier.indexOf("protected") >= 0) {
53-
return SortPriorities_Visibility.PROTECTED;
54-
} else if (modifier.indexOf("public") >= 0) {
55-
return SortPriorities_Visibility.PUBLIC;
56-
} else {
57-
return SortPriorities_Visibility.PACKAGE;
58-
}
59-
60-
}
61-
62-
static int getCompValue_Visibility(final Node relatedEntity) {
47+
private static int getCompValue_Visibility(final Node relatedEntity) {
6348
String visbility = relatedEntity.get("visibility").asString();
64-
if (visbility.equals("private")) {
65-
return SortPriorities_Visibility.PRIVATE;
66-
} else if (visbility.equals("protected")) {
67-
return SortPriorities_Visibility.PROTECTED;
68-
} else if (visbility.equals("public")) {
69-
return SortPriorities_Visibility.PUBLIC;
70-
} else {
71-
return SortPriorities_Visibility.PACKAGE;
49+
switch (visbility) {
50+
case "private":
51+
return SortPriorities_Visibility.PRIVATE;
52+
case "protected":
53+
return SortPriorities_Visibility.PROTECTED;
54+
case "public":
55+
return SortPriorities_Visibility.PUBLIC;
56+
default:
57+
return SortPriorities_Visibility.PACKAGE;
7258
}
7359
}
7460

75-
static int getCompValue_Type(final Node relatedEntity) {
61+
private static int getCompValue_Type(final Node relatedEntity) {
7662
if (relatedEntity.hasLabel(Labels.Field.name())) {
7763
boolean isPrimitive = false;
7864
StatementResult result = connector.executeRead("MATCH (n)-[OF_TYPE]->(t:Primitive) WHERE ID(n) = " + relatedEntity.id() + " RETURN t");
@@ -105,25 +91,17 @@ static int getCompValue_Type(final Node relatedEntity) {
10591

10692
@Override
10793
public int compareTo(final BuildingSegmentComparator comp) {
108-
int result;
10994
// Coarse sorting after attributes and methods if elements aren't the same type
11095
// of class element
111-
if (coarseValue < comp.coarseValue)
112-
result = -1;
113-
else if (coarseValue > comp.coarseValue)
114-
result = 1;
115-
else
116-
result = 0;
96+
int result = Integer.compare(coarseValue, comp.coarseValue);
11797

11898
if (result != 0)
11999
return result;
120100

121101
// Sorting after fine sort mode between equal class elements types (e.g. method
122102
// compared to method)
123103
switch (config.getClassElementsSortModeFine()) {
124-
case UNSORTED:
125-
return 0;
126-
case ALPHABETICALLY:
104+
case ALPHABETICALLY:
127105
String name = relatedEntity.get("name").asString();
128106
result = name.compareTo(comp.relatedEntity.get("name").asString());
129107
break;
@@ -145,7 +123,8 @@ else if (finerValue > comp.finerValue)
145123
else
146124
return 0;
147125
break;
148-
default:
126+
case UNSORTED:
127+
default:
149128
return 0;
150129
}
151130

@@ -160,12 +139,7 @@ else if (finerValue > comp.finerValue)
160139
private int compareNOS(final BuildingSegmentComparator comp) {
161140
long numberOfStatements = relatedEntity.get("effectiveLineCount").asLong(0);
162141
long numberOfStatementsComp = comp.relatedEntity.get("effectiveLineCount").asLong(0);
163-
if (numberOfStatements < numberOfStatementsComp)
164-
return 1;
165-
else if (numberOfStatements > numberOfStatementsComp)
166-
return -1;
167-
else
168-
return 0;
142+
return Long.compare(numberOfStatementsComp, numberOfStatements);
169143
}
170144

171145
public Node getSegment() {

generator2/org.getaviz.generator/src/main/java/org/getaviz/generator/city/m2m/City2City.java

Lines changed: 30 additions & 48 deletions
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ public class City2City implements Step {
2828
private Log log = LogFactory.getLog(this.getClass());
2929
private List<OutputColor> PCKG_colors;
3030
private List<OutputColor> NOS_colors;
31-
private HashMap<Long, double[]> properties = new HashMap<Long, double[]>();
31+
private HashMap<Long, double[]> properties = new HashMap<>();
3232
private DatabaseConnector connector = DatabaseConnector.getInstance();
3333
private OutputFormat outputFormat;
3434

@@ -95,9 +95,7 @@ public void run() {
9595
Node model = connector.executeRead("MATCH (n:Model {building_type: \'" + buildingTypeAsString +
9696
"\'}) RETURN n").next().get("n").asNode();
9797
if (buildingType == BuildingType.CITY_BRICKS || buildingType == BuildingType.CITY_PANELS) {
98-
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(m:BuildingSegment) RETURN m").forEachRemaining((result) -> {
99-
setBuildingSegmentAttributes(result.get("m").asNode().id());
100-
});
98+
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(m:BuildingSegment) RETURN m").forEachRemaining((result) -> setBuildingSegmentAttributes(result.get("m").asNode().id()));
10199
}
102100
int packageMaxLevel = connector.executeRead("MATCH p=(n:District)-[:CONTAINS*]->(m:District) WHERE NOT (m)-[:CONTAINS]->(:District) RETURN length(p) AS length ORDER BY length(p) DESC LIMIT 1").
103101
single().get("length").asInt() + 1;
@@ -109,12 +107,8 @@ public void run() {
109107
NOS_colors = OutputColor.createColorGradient(classColorStart, classColorEnd, NOS_max + 1);
110108
}
111109

112-
connector.executeRead("MATCH p=(n:Model:City)-[:CONTAINS*]->(m:District) RETURN p").forEachRemaining((result) -> {
113-
setDistrictAttributes(result.get("p").asPath());
114-
});
115-
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> {
116-
setBuildingAttributes(result.get("b").asNode());
117-
});
110+
connector.executeRead("MATCH p=(n:Model:City)-[:CONTAINS*]->(m:District) RETURN p").forEachRemaining((result) -> setDistrictAttributes(result.get("p").asPath()));
111+
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> setBuildingAttributes(result.get("b").asNode()));
118112
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(d:District)-[:VISUALIZES]->(element) RETURN d, element.hash as hash ORDER BY element.hash").forEachRemaining((result) -> {
119113
Node node = result.get("d").asNode();
120114
double width = node.get("width").asDouble(0.0);
@@ -139,14 +133,10 @@ public void run() {
139133
case CITY_BRICKS:
140134
BrickLayout.brickLayout(model.id()); break; // Layout for buildingSegments
141135
case CITY_PANELS:
142-
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> {
143-
setBuildingSegmentPositions(result.get("b").asNode());
144-
});
136+
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> setBuildingSegmentPositions(result.get("b").asNode()));
145137
break;
146138
case CITY_FLOOR:
147-
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> {
148-
calculateSegments(result.get("b").asNode());
149-
});
139+
connector.executeRead("MATCH (n:Model:City)-[:CONTAINS*]->(b:Building) RETURN b").forEachRemaining((result) -> calculateSegments(result.get("b").asNode()));
150140
break;
151141
default: {
152142
} // CityDebugUtils.infoEntities(cityRoot.document.entities, 0, true, true)
@@ -177,10 +167,10 @@ private void setBuildingAttributes(Node building) {
177167
}
178168

179169
private void setBuildingAttributesOriginal(Node building, int methodCounter, int dataCounter) {
180-
double width = 0.0;
181-
double length = 0.0;
182-
double height = 0.0;
183-
String color = "";
170+
double width;
171+
double length;
172+
double height;
173+
String color;
184174
if (dataCounter == 0) {
185175
width = widthMin;
186176
length = widthMin;
@@ -202,16 +192,15 @@ private void setBuildingAttributesOriginal(Node building, int methodCounter, int
202192
}
203193

204194
private void setBuildingAttributesPanels(Node building, int methodCounter, int dataCounter) {
205-
double height = 0.0;
206-
double width = 0.0;
207-
double length = 0.0;
208-
String color = "";
195+
double height;
196+
double width;
197+
double length;
209198
if (showBuildingBase) {
210199
height = heightMin;
211200
} else {
212201
height = 0;
213202
}
214-
int areaUnit = 1;
203+
int areaUnit;
215204
if (classElementsMode == ClassElementsModes.ATTRIBUTES_ONLY) {
216205
areaUnit = methodCounter;
217206
} else {
@@ -235,17 +224,11 @@ private String asPercentage(Color color) {
235224
return r + " " + g + " " + b;
236225
}
237226

238-
private String asPercentage(String color) {
239-
Color c = Color.decode(color);
240-
return asPercentage(c);
241-
}
242-
243227
private void setBuildingAttributesBricks(Node building, int methodCounter, int dataCounter) {
244-
double height = 0.0;
245-
double width = 0.0;
246-
double length = 0.0;
247-
int sideCapacity = 0;
248-
String color = "";
228+
double height;
229+
double width;
230+
int sideCapacity;
231+
String color;
249232
if (showBuildingBase) {
250233
height = heightMin;
251234
} else {
@@ -280,18 +263,17 @@ private void setBuildingAttributesBricks(Node building, int methodCounter, int d
280263
}
281264
width = brickSize * sideCapacity + brickHorizontalMargin * 2 +
282265
brickHorizontalGap * (sideCapacity - 1);
283-
length = brickSize * sideCapacity + brickHorizontalMargin * 2 +
284-
brickHorizontalGap * (sideCapacity - 1);
266+
double length = brickSize * sideCapacity + brickHorizontalMargin * 2 +
267+
brickHorizontalGap * (sideCapacity - 1);
285268
connector.executeWrite(
286269
cypherSetBuildingSegmentAttributes(building.id(), width, length, height, color) + ", n.sideCapacity = " +
287270
sideCapacity);
288271
}
289272

290273
private void setBuildingAttributesFloors(Node building, int methodCounter, int dataCounter) {
291-
double width = 0.0;
292-
double length = 0.0;
293-
double height = 0.0;
294-
String color = "";
274+
double width;
275+
double length;
276+
double height;
295277
if (dataCounter < 2) { // pko 2016
296278
width = 2; // TODO in settings datei aufnehmen
297279
length = 2;
@@ -330,14 +312,14 @@ private void setBuildingSegmentAttributesPanels(Long segment) {
330312
List<Node> childsA = connector.executeRead(
331313
"MATCH (s)-[:CONTAINS]->(child)-[r:VISUALIZES]->(e:Field) WHERE ID(s) = " + parent +
332314
" AND NOT (e)<-[:DECLARES]-(:Enum) RETURN e").stream().map(s -> s.get("e").asNode()).collect(Collectors.toList());
333-
int areaUnit = 1;
315+
int areaUnit;
334316
if (classElementsMode == ClassElementsModes.ATTRIBUTES_ONLY) {
335317
areaUnit = childsM.size();
336318
} else {
337319
areaUnit = childsA.size();
338320
}
339-
double width = 0.0;
340-
double length = 0.0;
321+
double width;
322+
double length;
341323
if (areaUnit <= 1) {
342324
width = widthMin;
343325
length = widthMin;
@@ -567,10 +549,10 @@ private void calculateChimneys(Node building) {
567549
// Calculates side capacity for progressive/balanced bricks layout
568550
private int calculateSideCapacity(double value) {
569551
int sc = 0; // side capacity
570-
int lc = 0; // layer capacity
571-
int nolMin = 0; // number of layers
572-
int bcMin = 0; // building capacity min
573-
int bcMax = 0; // building capacity max
552+
int lc; // layer capacity
553+
int nolMin; // number of layers
554+
int bcMin; // building capacity min
555+
int bcMax; // building capacity max
574556
do {
575557
sc++;
576558
lc = sc * 4;

generator2/org.getaviz.generator/src/main/java/org/getaviz/generator/city/m2m/CityKDTree.java

Lines changed: 4 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -2,35 +2,20 @@
22

33
import java.util.ArrayList;
44
import java.util.List;
5-
import org.getaviz.generator.city.m2m.Rectangle;
65

7-
public class CityKDTree{
8-
public CityKDTree() {
9-
super();
10-
this.root = new CityKDTreeNode();
11-
}
12-
13-
public CityKDTree(CityKDTreeNode root) {
14-
super();
15-
this.root = root;
16-
}
6+
class CityKDTree{
177

18-
public CityKDTree(Rectangle rectangle) {
8+
CityKDTree(Rectangle rectangle) {
199
super();
2010
this.root = new CityKDTreeNode(rectangle);
2111
}
2212

2313
private CityKDTreeNode root;
2414

25-
public List<CityKDTreeNode> getFittingNodes(Rectangle r){
15+
List<CityKDTreeNode> getFittingNodes(Rectangle r){
2616
List<CityKDTreeNode> fittingNodes = new ArrayList<CityKDTreeNode>();
2717
this.root.isEmptyLeaf(r, fittingNodes);
2818
return fittingNodes;
2919
}
30-
public CityKDTreeNode getRoot() {
31-
return root;
32-
}
33-
public void setRoot(CityKDTreeNode root) {
34-
this.root = root;
35-
}
20+
3621
}

0 commit comments

Comments
 (0)