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

Direction.hashCode介绍

暂无

代码示例

代码示例来源：origin: apache/tinkerpop

@Override
public int hashCode() {
  int result = super.hashCode() ^ this.direction.hashCode() ^ this.returnClass.hashCode();
  for (final String edgeLabel : this.edgeLabels) {
    result ^= edgeLabel.hashCode();
  }
  return result;
}

代码示例来源：origin: apache/tinkerpop

@Override
public int hashCode() {
  return super.hashCode() ^ this.direction.hashCode();
}

代码示例来源：origin: org.apache.tinkerpop/gremlin-core

@Override
public int hashCode() {
  int result = super.hashCode() ^ this.direction.hashCode() ^ this.returnClass.hashCode();
  for (final String edgeLabel : this.edgeLabels) {
    result ^= edgeLabel.hashCode();
  }
  return result;
}

代码示例来源：origin: rmagen/elastic-gremlin

@Override
public int hashCode() {
  int result = direction.hashCode();
  result = 31 * result + Arrays.hashCode(edgeLabels);
  result = 31 * result + predicates.hashCode();
  result = 31 * result + revision;
  return result;
}

代码示例来源：origin: org.apache.tinkerpop/gremlin-core

@Override
public int hashCode() {
  return super.hashCode() ^ this.direction.hashCode();
}

代码示例来源：origin: org.umlg/sqlg-core

@Override
public int hashCode() {
  final int prime = 31;
  int result = 1;
  result = prime * result + ((direction == null) ? 0 : direction.hashCode());
  result = prime * result + ((edgeLabel == null) ? 0 : edgeLabel.hashCode());
  result = prime * result + ((vertexLabel == null) ? 0 : vertexLabel.hashCode());
  return result;
}

代码示例来源：origin: pietermartin/sqlg

@Override
public int hashCode() {
  final int prime = 31;
  int result = 1;
  result = prime * result + ((direction == null) ? 0 : direction.hashCode());
  result = prime * result + ((edgeLabel == null) ? 0 : edgeLabel.hashCode());
  result = prime * result + ((vertexLabel == null) ? 0 : vertexLabel.hashCode());
  return result;
}