io.vavr.control.Option.hashCode()方法的使用及代码示例

x33g5p2x  于2022-01-25 转载在 其他  
字(2.5k)|赞(0)|评价(0)|浏览(133)

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

Option.hashCode介绍

暂无

代码示例

代码示例来源:origin: com.mercateo.eventstore/client-common

/**
 * Computes a hash code from attributes: {@code type}, {@code dataTBD}.
 * @return hashCode value
 */
@Override
public int hashCode() {
 int h = 5381;
 h += (h << 5) + type.hashCode();
 h += (h << 5) + (dataTBD().hashCode());
 return h;
}

代码示例来源:origin: vavr-io/vavr-jackson

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

代码示例来源:origin: com.mercateo.eventstore/client-common

/**
 * Computes a hash code from attributes: {@code eventStreamId}, {@code eventNumber}, {@code eventType}, {@code eventId}, {@code eventSchemaRef}, {@code version}, {@code causality}, {@code eventInitiator}.
 * @return hashCode value
 */
@Override
public int hashCode() {
 int h = 5381;
 h += (h << 5) + eventStreamId.hashCode();
 h += (h << 5) + eventNumber.hashCode();
 h += (h << 5) + eventType.hashCode();
 h += (h << 5) + eventId.hashCode();
 h += (h << 5) + (eventSchemaRef().hashCode());
 h += (h << 5) + version.hashCode();
 h += (h << 5) + (causality().hashCode());
 h += (h << 5) + (eventInitiator().hashCode());
 return h;
}

代码示例来源:origin: vavr-io/vavr-jackson

@Override
public int hashCode() {
  int result = complexInnerClassHashMap != null ? complexInnerClassHashMap.hashCode() : 0;
  result = 31 * result + (complexInnerClassTreeMap != null ? complexInnerClassTreeMap.hashCode() : 0);
  result = 31 * result + (complexInnerClassHashMultimap != null ? complexInnerClassHashMultimap.hashCode() : 0);
  result = 31 * result + (complexInnerClassTreeMultimap != null ? complexInnerClassTreeMultimap.hashCode() : 0);
  result = 31 * result + (complexInnerClasses != null ? complexInnerClasses.hashCode() : 0);
  result = 31 * result + (complexInnerClassList != null ? complexInnerClassList.hashCode() : 0);
  result = 31 * result + (complexInnerClassQueue != null ? complexInnerClassQueue.hashCode() : 0);
  result = 31 * result + (complexInnerClassStream != null ? complexInnerClassStream.hashCode() : 0);
  result = 31 * result + (complexInnerClassVector != null ? complexInnerClassVector.hashCode() : 0);
  result = 31 * result + (complexInnerClassHashSet != null ? complexInnerClassHashSet.hashCode() : 0);
  result = 31 * result + (complexInnerClassTreeSet != null ? complexInnerClassTreeSet.hashCode() : 0);
  result = 31 * result + (complexInnerClassTuple2 != null ? complexInnerClassTuple2.hashCode() : 0);
  result = 31 * result + (opt1 != null ? opt1.hashCode() : 0);
  result = 31 * result + (opt2 != null ? opt2.hashCode() : 0);
  return result;
}

相关文章