GroupCount 排序依据

Wol*_*ahl 4 java gremlin simplegraph

下面来自 simplegraph-core 测试套件的单元测试代码显示了机场的区域计数,但它的顺序并不像我预期的那样。

结果开始于:

NZ-BOP=  3
MZ-A=  1
MZ-B=  1
IN-TN=  5
MZ-N=  1
PW-004=  1
MZ-I=  2
BS-FP=  1
IN-TR=  1
MZ-T=  1
BJ-AQ=  1
GB-ENG= 27
Run Code Online (Sandbox Code Playgroud)

我调查了

并在标记为 gremlin 的问题中搜索“GroupCount”无济于事

什么是修复排序所必需的?

单元测试 另见https://github.com/BITPlan/com.bitplan.simplegraph/blob/master/simplegraph-core/src/test/java/com/bitplan/simplegraph/core/TestTinkerPop3.java

  @Test
  public void testSortedGroupCount() throws Exception {
    Graph graph = getAirRoutes();
    GraphTraversalSource g = graph.traversal();
    Map<Object, Long> counts = g.V().hasLabel("airport").groupCount()
        .by("region").order().by(Order.decr).next();
    assertEquals(1473, counts.size());
    for (Object key : counts.keySet()) {
      System.out.println(String.format("%s=%3d", key, counts.get(key)));
    }
  }
Run Code Online (Sandbox Code Playgroud)

ste*_*tte 5

您需要订购values具有local范围的:

g.V().hasLabel("airport").
  groupCount().
    by("region").
  order(local).
    by(values, Order.decr)
Run Code Online (Sandbox Code Playgroud)

通过local作用域,您可以在当前遍历器中进行排序(即Map对遍历中的每个内容进行排序)。

  @Test
  public void testSortedGroupCount() throws Exception {
    Graph graph = getAirRoutes();
    GraphTraversalSource g = graph.traversal();
    Map<Object, Long> counts = g.V().hasLabel("airport").groupCount()
        .by("region").order(Scope.local).by(Column.values,Order.decr).next();
    // /sf/answers/3455287531/
    assertEquals(1473, counts.size());
    assertEquals("LinkedHashMap",counts.getClass().getSimpleName());
    debug=true;
    if (debug)
      for (Object key : counts.keySet()) {
        System.out.println(String.format("%s=%3d", key, counts.get(key)));
      }

  }
Run Code Online (Sandbox Code Playgroud)

然后将显示:

US-AK=149
AU-QLD= 50
CA-ON= 46
CA-QC= 44
PF-U-A= 30
US-CA= 29
Run Code Online (Sandbox Code Playgroud)