java.util.BitSet.hashCode()方法的使用及代码示例

x33g5p2x  于2022-01-16 转载在 其他  
字(4.8k)|赞(0)|评价(0)|浏览(125)

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

BitSet.hashCode介绍

[英]Returns the hash code value for this bit set. The hash code depends only on which bits are set within this BitSet.

The hash code is defined to be the result of the following calculation:

public int hashCode()

Note that the hash code changes if the set of bits is altered.
[中]返回此位集的哈希代码值。哈希代码仅取决于在此位集中设置的位。
哈希代码定义为以下计算的结果:

public int hashCode()

请注意,如果更改了位集,则哈希代码会更改。

代码示例

代码示例来源:origin: spring-projects/spring-framework

@Override
public int hashCode() {
  return (17 * this.months.hashCode() + 29 * this.daysOfMonth.hashCode() + 37 * this.daysOfWeek.hashCode() +
      41 * this.hours.hashCode() + 53 * this.minutes.hashCode() + 61 * this.seconds.hashCode());
}

代码示例来源:origin: org.springframework/spring-context

@Override
public int hashCode() {
  return (17 * this.months.hashCode() + 29 * this.daysOfMonth.hashCode() + 37 * this.daysOfWeek.hashCode() +
      41 * this.hours.hashCode() + 53 * this.minutes.hashCode() + 61 * this.seconds.hashCode());
}

代码示例来源:origin: PipelineAI/pipeline

@Override
public int hashCode() {
  int result = events.hashCode();
  result = 31 * result + numEmissions;
  result = 31 * result + numFallbackEmissions;
  result = 31 * result + numCollapsed;
  return result;
}

代码示例来源:origin: apache/ignite

/** {@inheritDoc} */
  @Override public int hashCode() {
    return 31 * states.hashCode() + size;
  }
}

代码示例来源:origin: nutzam/nutz

@Override
public int hashCode() {
  return (17 * this.months.hashCode() + 29 * this.daysOfMonth.hashCode() + 37 * this.daysOfWeek.hashCode() +
      41 * this.hours.hashCode() + 53 * this.minutes.hashCode() + 61 * this.seconds.hashCode());
}

代码示例来源:origin: ethereum/ethereumj

/**
 * Calculates a hash code for this class.
 * @return hash code representing the contents of an instance of this class.
 */
@Override
public int hashCode() {
  int hash = 7;
  hash = 61 * hash + (this.bitset != null ? this.bitset.hashCode() : 0);
  hash = 61 * hash + this.expectedNumberOfFilterElements;
  hash = 61 * hash + this.bitSetSize;
  hash = 61 * hash + this.k;
  return hash;
}

代码示例来源:origin: apache/kylin

@Override
public int hashCode() {
  return set.hashCode();
}

代码示例来源:origin: spotbugs/spotbugs

@Override
public int hashCode() {
  int result = super.hashCode();
  result = PRIME * result + depth;
  result = PRIME * result + (isTop ? 1231 : 1237);
  result = PRIME * result + (isValid ? 1231 : 1237);
  return result;
}

代码示例来源:origin: spotbugs/spotbugs

@Override
public int hashCode() {
  return exceptionSet.hashCode() + explicitSet.hashCode();
}

代码示例来源:origin: looly/hutool

@Override
public int hashCode() {
  int hash = 0;
  if (null != chain) {
    hash ^= chain.hashCode();
  }
  if (null != orderingBits) {
    hash ^= orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: looly/hutool

@Override
public int hashCode() {
  int hash = 0;
  if (null != chain) {
    hash ^= chain.hashCode();
  }
  if (null != orderingBits) {
    hash ^= orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: jtablesaw/tablesaw

public int hashCode() {
  int hash = 0;
  if (null != this.comparatorChain) {
    hash ^= this.comparatorChain.hashCode();
  }
  if (null != this.orderingBits) {
    hash ^= this.orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: commons-collections/commons-collections

/**
 * Implement a hash code for this comparator that is consistent with
 * {@link #equals(Object) equals}.
 * 
 * @return a suitable hash code
 * @since Commons Collections 3.0
 */
public int hashCode() {
  int hash = 0;
  if(null != comparatorChain) {
    hash ^= comparatorChain.hashCode();
  }
  if(null != orderingBits) {
    hash ^= orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: wildfly/wildfly

/**
 * Implement a hash code for this comparator that is consistent with
 * {@link #equals(Object) equals}.
 * 
 * @return a suitable hash code
 * @since Commons Collections 3.0
 */
public int hashCode() {
  int hash = 0;
  if(null != comparatorChain) {
    hash ^= comparatorChain.hashCode();
  }
  if(null != orderingBits) {
    hash ^= orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: org.apache.commons/commons-collections4

/**
 * Implement a hash code for this comparator that is consistent with
 * {@link #equals(Object) equals}.
 *
 * @return a suitable hash code
 * @since 3.0
 */
@Override
public int hashCode() {
  int hash = 0;
  if (null != comparatorChain) {
    hash ^= comparatorChain.hashCode();
  }
  if (null != orderingBits) {
    hash ^= orderingBits.hashCode();
  }
  return hash;
}

代码示例来源:origin: apache/kylin

@Override
  public int hashCode() {
    int result = helper != null ? helper.hashCode() : 0;
    result = 31 * result + (representation != null ? representation.hashCode() : 0);
    return result;
  }
}

代码示例来源:origin: OryxProject/oryx

@Override
public int hashCode() {
 return getFeatureNumber() ^ activeCategoryEncodings.hashCode();
}

代码示例来源:origin: palantir/atlasdb

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

代码示例来源:origin: vsch/flexmark-java

@Override
public int hashCode() {
  int result = myKeyMap.hashCode();
  result = 31 * result + myValueList.hashCode();
  result = 31 * result + myValidIndices.hashCode();
  return result;
}

代码示例来源:origin: com.netflix.hystrix/hystrix-core

@Override
public int hashCode() {
  int result = events.hashCode();
  result = 31 * result + numEmissions;
  result = 31 * result + numFallbackEmissions;
  result = 31 * result + numCollapsed;
  return result;
}

相关文章