fix: code style

DanGuge · DanGuge · commit 23f48caa9196 · 2023-09-21T15:29:16.000+08:00
diff --git a/hugegraph-core/src/main/java/org/apache/hugegraph/traversal/algorithm/HugeTraverser.java b/hugegraph-core/src/main/java/org/apache/hugegraph/traversal/algorithm/HugeTraverser.java
@@ -1028,8 +1028,8 @@ public class EdgesIterator implements Iterator<Iterator<Edge>>, Closeable {
         public EdgesIterator(EdgesQueryIterator queries) {
             List<Iterator<Edge>> iteratorList = new ArrayList<>();
             while (queries.hasNext()) {
-                iteratorList.add(
-                        graph().edges(queries.next()));
+                Iterator<Edge> edges = graph.edges(queries.next());
+                iteratorList.add(edges);
             }
             this.currentIter = iteratorList.iterator();
         }
diff --git a/hugegraph-core/src/main/java/org/apache/hugegraph/traversal/algorithm/OltpTraverser.java b/hugegraph-core/src/main/java/org/apache/hugegraph/traversal/algorithm/OltpTraverser.java
@@ -285,17 +285,17 @@ public static class ConcurrentVerticesConsumer implements Consumer<EdgeId> {
         private final Set<Id> excluded;
         private final Set<Id> neighbors;
         private final long limit;
+        private final AtomicInteger count;
 
         public ConcurrentVerticesConsumer(Id sourceV, Set<Id> excluded, long limit,
                                           Set<Id> neighbors) {
             this.sourceV = sourceV;
             this.excluded = excluded;
             this.limit = limit;
             this.neighbors = neighbors;
+            this.count = new AtomicInteger(0);
         }
 
-        private final AtomicInteger count = new AtomicInteger(0);
-
         @Override
         public void accept(EdgeId edgeId) {
             if (this.limit != NO_LIMIT && count.get() >= this.limit) {
diff --git a/hugegraph-core/src/main/java/org/apache/hugegraph/util/Consumers.java b/hugegraph-core/src/main/java/org/apache/hugegraph/util/Consumers.java
@@ -208,7 +208,7 @@ public void provide(V v) throws Throwable {
             try {
                 this.queue.put(v);
             } catch (InterruptedException e) {
-                LOG.warn("Interrupted while enqueue", e);
+                LOG.warn("Interrupt while queuing QUEUE_END", e);
             }
         }
     }

Original file line number	Diff line number	Diff line change
`@@ -1028,8 +1028,8 @@ public class EdgesIterator implements Iterator<Iterator<Edge>>, Closeable {`
`1028`	`1028`	`public EdgesIterator(EdgesQueryIterator queries) {`
`1029`	`1029`	`List<Iterator<Edge>> iteratorList = new ArrayList<>();`
`1030`	`1030`	`while (queries.hasNext()) {`
`1031`		`- iteratorList.add(`
`1032`		`- graph().edges(queries.next()));`
	`1031`	`+ Iterator<Edge> edges = graph.edges(queries.next());`
	`1032`	`+ iteratorList.add(edges);`
`1033`	`1033`	`}`
`1034`	`1034`	`this.currentIter = iteratorList.iterator();`
`1035`	`1035`	`}`
Original file line number	Diff line number	Diff line change
`@@ -208,7 +208,7 @@ public void provide(V v) throws Throwable {`
`208`	`208`	`try {`
`209`	`209`	`this.queue.put(v);`
`210`	`210`	`} catch (InterruptedException e) {`
`211`		`- LOG.warn("Interrupted while enqueue", e);`
	`211`	`+ LOG.warn("Interrupt while queuing QUEUE_END", e);`
`212`	`212`	`}`
`213`	`213`	`}`
`214`	`214`	`}`