本文整理了Java中org.joda.time.Instant.hashCode()
方法的一些代码示例,展示了Instant.hashCode()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Instant.hashCode()
方法的具体详情如下:
包路径:org.joda.time.Instant
类名称:Instant
方法名:hashCode
暂无
代码示例来源:origin: joda-time/joda-time
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((cutoverInstant == null) ? 0 : cutoverInstant.hashCode());
result = prime * result + minDaysInFirstWeek;
result = prime * result + ((zone == null) ? 0 : zone.hashCode());
return result;
}
代码示例来源:origin: JodaOrg/joda-time
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((cutoverInstant == null) ? 0 : cutoverInstant.hashCode());
result = prime * result + minDaysInFirstWeek;
result = prime * result + ((zone == null) ? 0 : zone.hashCode());
return result;
}
代码示例来源:origin: joda-time/joda-time
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: JodaOrg/joda-time
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: camunda/camunda-bpm-platform
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + iJulianChronology.hashCode() +
iGregorianChronology.hashCode() + iCutoverInstant.hashCode();
}
代码示例来源:origin: outbrain/Aletheia
@Override
public int hashCode() {
int result = source.hashCode();
result = 31 * result + destination.hashCode();
result = 31 * result + type.hashCode();
result = 31 * result + datacenter.hashCode();
result = 31 * result + tier.hashCode();
result = 31 * result + bucketStartTime.hashCode();
result = 31 * result + bucketEndTime.hashCode();
result = 31 * result + processingTimestamp.hashCode();
result = 31 * result + (int) (count ^ (count >>> 32));
result = 31 * result + application.hashCode();
return result;
}
代码示例来源:origin: io.virtdata/virtdata-lib-realer
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((cutoverInstant == null) ? 0 : cutoverInstant.hashCode());
result = prime * result + minDaysInFirstWeek;
result = prime * result + ((zone == null) ? 0 : zone.hashCode());
return result;
}
代码示例来源:origin: Nextdoor/bender
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((cutoverInstant == null) ? 0 : cutoverInstant.hashCode());
result = prime * result + minDaysInFirstWeek;
result = prime * result + ((zone == null) ? 0 : zone.hashCode());
return result;
}
代码示例来源:origin: org.joda/com.springsource.org.joda.time
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + iJulianChronology.hashCode() +
iGregorianChronology.hashCode() + iCutoverInstant.hashCode();
}
代码示例来源:origin: redfish64/TinyTravelTracker
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + iJulianChronology.hashCode() +
iGregorianChronology.hashCode() + iCutoverInstant.hashCode();
}
代码示例来源:origin: GoogleCloudPlatform/DataflowTemplates
h$ ^= (maxReadTime == null) ? 0 : maxReadTime.hashCode();
h$ *= 1000003;
h$ ^= (startReadTime == null) ? 0 : startReadTime.hashCode();
h$ *= 1000003;
h$ ^= commitOffsetsInFinalizeEnabled ? 1231 : 1237;
代码示例来源:origin: org.kill-bill.billing/killbill-osgi-bundles-jruby
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.joda-time
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: com.ning.billing/killbill-osgi-bundles-jruby
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: com.ning.billing/killbill-osgi-bundles-analytics
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: io.virtdata/virtdata-lib-realer
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
代码示例来源:origin: Nextdoor/bender
/**
* A suitable hash code for the chronology.
*
* @return the hash code
* @since 1.6
*/
public int hashCode() {
return "GJ".hashCode() * 11 + getZone().hashCode() +
getMinimumDaysInFirstWeek() + iCutoverInstant.hashCode();
}
内容来源于网络,如有侵权,请联系作者删除!