Update checkstyle to version 6.19
Change-Id: I32787f2a5f4f4b17fd4cdcf9bd2eb3903dcecfff
diff --git a/core/common/src/test/java/org/onosproject/codec/impl/FlowRuleCodecTest.java b/core/common/src/test/java/org/onosproject/codec/impl/FlowRuleCodecTest.java
index 11df9a1..fb1ff08 100644
--- a/core/common/src/test/java/org/onosproject/codec/impl/FlowRuleCodecTest.java
+++ b/core/common/src/test/java/org/onosproject/codec/impl/FlowRuleCodecTest.java
@@ -360,8 +360,7 @@
checkCommonData(rule);
rule.treatment().allInstructions()
- .forEach(instruction ->
- {
+ .forEach(instruction -> {
String subType;
if (instruction.type() == Instruction.Type.L0MODIFICATION) {
subType = ((L0ModificationInstruction) instruction)
diff --git a/core/common/src/test/java/org/onosproject/store/trivial/SimpleGroupStore.java b/core/common/src/test/java/org/onosproject/store/trivial/SimpleGroupStore.java
index f3f0bd7..c55d009 100644
--- a/core/common/src/test/java/org/onosproject/store/trivial/SimpleGroupStore.java
+++ b/core/common/src/test/java/org/onosproject/store/trivial/SimpleGroupStore.java
@@ -416,7 +416,7 @@
Optional<GroupBucket> matchingBucket =
existing.buckets().buckets()
.stream()
- .filter((existingBucket)->(existingBucket.equals(bucket)))
+ .filter((existingBucket) -> (existingBucket.equals(bucket)))
.findFirst();
if (matchingBucket.isPresent()) {
((StoredGroupBucketEntry) matchingBucket.
diff --git a/core/store/dist/src/main/java/org/onosproject/store/statistic/impl/DistributedFlowStatisticStore.java b/core/store/dist/src/main/java/org/onosproject/store/statistic/impl/DistributedFlowStatisticStore.java
index 8bfbf09..75600e7 100644
--- a/core/store/dist/src/main/java/org/onosproject/store/statistic/impl/DistributedFlowStatisticStore.java
+++ b/core/store/dist/src/main/java/org/onosproject/store/statistic/impl/DistributedFlowStatisticStore.java
@@ -197,10 +197,14 @@
// create one if absent and add this rule
current.putIfAbsent(cp, new HashSet<>());
- current.computeIfPresent(cp, (c, e) -> { e.add(rule); return e; });
+ current.computeIfPresent(cp, (c, e) -> {
+ e.add(rule); return e;
+ });
// remove previous one if present
- previous.computeIfPresent(cp, (c, e) -> { e.remove(rule); return e; });
+ previous.computeIfPresent(cp, (c, e) -> {
+ e.remove(rule); return e;
+ });
}
@Override
diff --git a/core/store/primitives/src/test/java/org/onosproject/store/primitives/resources/impl/AtomixConsistentTreeMapTest.java b/core/store/primitives/src/test/java/org/onosproject/store/primitives/resources/impl/AtomixConsistentTreeMapTest.java
index a3e75a3..f27148e 100644
--- a/core/store/primitives/src/test/java/org/onosproject/store/primitives/resources/impl/AtomixConsistentTreeMapTest.java
+++ b/core/store/primitives/src/test/java/org/onosproject/store/primitives/resources/impl/AtomixConsistentTreeMapTest.java
@@ -117,7 +117,7 @@
result.value())).join());
//test all compute methods in this section
allKeys.forEach(key -> map.computeIfAbsent(
- key, v ->allValues.get(allKeys.indexOf(key)
+ key, v -> allValues.get(allKeys.indexOf(key)
)).thenAccept(result ->
assertArrayEquals(
allValues.get(allKeys.indexOf(key)),
@@ -657,4 +657,4 @@
return 0;
}
}
-}
\ No newline at end of file
+}