Java中ConcurrentLinkedDeque的hashCode()方法用于获取ConcurrentLinkedDeque实例的hashCode值。它返回一个整数值,该值是此ConcurrentLinkedDeque实例的hashCode值。
用法:
public int hashCode()
参数:此函数没有参数。
返回值:该方法返回一个整数值,该值是此ConcurrentLinkedDeque实例的hashCode值。
以下示例程序旨在说明ConcurrentLinkedDeque.hashCode()方法:
示例1:
// Java Program Demonstrate hashCode()
// method of ConcurrentLinkedDeque
import java.util.concurrent.ConcurrentLinkedDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of ConcurrentLinkedDeque
ConcurrentLinkedDeque<Integer> CLD
= new ConcurrentLinkedDeque<Integer>();
// Add numbers to end of ConcurrentLinkedDeque
CLD.add(7855642);
CLD.add(35658786);
CLD.add(5278367);
CLD.add(74381793);
System.out.println("Linked Blocking Deque: " + CLD);
// Get the hashCode value
// using hashCode() value
System.out.println("HashCode value: "
+ CLD.hashCode());
}
}
输出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793] HashCode value: 2101973421
示例2:
// Java Program Demonstrate hashCode()
// method of ConcurrentLinkedDeque
// when the list contains characters
import java.util.concurrent.ConcurrentLinkedDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of ConcurrentLinkedDeque
ConcurrentLinkedDeque<String> CLD
= new ConcurrentLinkedDeque<String>();
// Add numbers to end of ConcurrentLinkedDeque
CLD.add("1");
CLD.add("2");
CLD.add("3");
CLD.add("4");
System.out.println("Linked Blocking Deque: " + CLD);
// Get the hashCode value
// using hashCode() value
System.out.println("HashCode value: "
+ CLD.hashCode());
}
}
输出:
Linked Blocking Deque: [1, 2, 3, 4] HashCode value: 2101973421
相关用法
- Java ConcurrentLinkedDeque add()用法及代码示例
- Java ConcurrentLinkedDeque removeLastOccurrence()用法及代码示例
- Java ConcurrentLinkedDeque pop()用法及代码示例
- Java ConcurrentLinkedDeque poll()用法及代码示例
- Java ConcurrentLinkedDeque clear()用法及代码示例
- Java ConcurrentLinkedDeque equals()用法及代码示例
- Java ConcurrentLinkedDeque peekLast()用法及代码示例
- Java ConcurrentLinkedDeque peek()用法及代码示例
- Java ConcurrentLinkedDeque contains()用法及代码示例
- Java ConcurrentLinkedDeque pollLast()用法及代码示例
- Java ConcurrentLinkedDeque peekFirst()用法及代码示例
- Java ConcurrentLinkedDeque descendingIterator()用法及代码示例
- Java ConcurrentLinkedDeque toArray()用法及代码示例
- Java ConcurrentLinkedDeque iterator()用法及代码示例
- Java ConcurrentLinkedDeque removeFirst()用法及代码示例
注:本文由纯净天空筛选整理自Code_r大神的英文原创作品 ConcurrentLinkedDeque hashCode() method in Java with Example。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。