org.vertexium.Graph.doEdgesExist()方法的使用及代码示例

x33g5p2x  于2022-01-20 转载在 其他  
字(1.7k)|赞(0)|评价(0)|浏览(113)

本文整理了Java中org.vertexium.Graph.doEdgesExist()方法的一些代码示例,展示了Graph.doEdgesExist()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Graph.doEdgesExist()方法的具体详情如下:
包路径:org.vertexium.Graph
类名称:Graph
方法名:doEdgesExist

Graph.doEdgesExist介绍

[英]Tests the existence of edges with the given authorizations.
[中]使用给定的授权测试边的存在性。

代码示例

代码示例来源:origin: org.visallo/visallo-web

@Handle
  public ClientApiEdgesExistsResponse handle(
      @Required(name = "edgeIds[]") String[] edgeIdsParameter,
      Authorizations authorizations
  ) throws Exception {
    List<String> edgeIds = Arrays.asList(edgeIdsParameter);
    Map<String, Boolean> graphEdges = graph.doEdgesExist(edgeIds, authorizations);
    ClientApiEdgesExistsResponse result = new ClientApiEdgesExistsResponse();
    result.getExists().putAll(graphEdges);
    return result;
  }
}

代码示例来源:origin: org.visallo/visallo-web-product-graph

.map(RelatedEdge::getEdgeId)
    .collect(Collectors.toList());
Map<String, Boolean> relatedEdgesById = graph.doEdgesExist(ids, authorizations);

代码示例来源:origin: org.visallo/visallo-core

.map(RelatedEdge::getEdgeId)
    .collect(Collectors.toList());
Map<String, Boolean> relatedEdgesById = graph.doEdgesExist(ids, authorizations);

代码示例来源:origin: visallo/vertexium

edgeIdList.add("v2tov3");
edgeIdList.add("bad");
Map<String, Boolean> edgesExist = graph.doEdgesExist(edgeIdList, AUTHORIZATIONS_A);
assertEquals(3, edgeIdList.size());
assertTrue("v1tov2 exist", edgesExist.get("v1tov2"));

代码示例来源:origin: org.vertexium/vertexium-test

edgeIdList.add("v2tov3");
edgeIdList.add("bad");
Map<String, Boolean> edgesExist = graph.doEdgesExist(edgeIdList, AUTHORIZATIONS_A);
assertEquals(3, edgeIdList.size());
assertTrue("v1tov2 exist", edgesExist.get("v1tov2"));

相关文章