Detailed introduction to Java collection class Hashmap (code example)
This article brings you a detailed introduction (code example) about the Java collection class Hashmap. It has certain reference value. Friends in need can refer to it. I hope it will be helpful to you. helped.
1. Introduction to HashMap
HashMap is a very commonly used collection class in the development process of programmers. It is a collection class that exists in the form of key-value pairs,
In development, we can take advantage of its feature of replacing a key when it exists to implement an updated deduplication operation.
In another convenience, we can use map and fastJson to quickly form the json data format we need.
Before jdk1.8, HashMap existed in the form of an array linked list. The hashCode of the put key was calculated by the perturbation function to obtain the hash value, and then the value was calculated by (n-1)&hash. Go to the corresponding position (n represents the length of the array),
If a hash conflict occurs, first determine whether the key exists, and if it exists, overwrite it, otherwise use the "zipper method" to resolve the conflict, and then form linked list.
But after jdk1.8, HashMap has changed. If the length of the current linked list is greater than the threshold (the default is 8), then the linked list will be converted into a red-black tree, speeding up the search.
2. HashMap attribute
//The default initial capacity of HashMap is 2^4=16
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
//The maximum capacity of HashMap
static final int MAXIMUM_CAPACITY = 1 << 30;
// The default load factor is when the array length is
static final float DEFAULT_LOAD_FACTOR = 0.75f;
// When the number of nodes on the bucket is greater than this value, it will be converted into a red-black tree
static final int TREEIFY_THRESHOLD = 8;
// When the number of nodes on the bucket is less than this value, the tree will be converted to a linked list
static final int UNTREEIFY_THRESHOLD = 6;
// Structure in the bucket Convert to the minimum size of the table corresponding to the red-black tree
static final int MIN_TREEIFY_CAPACITY = 64;
// An array to store elements, always a power of 2 //Set that stores specific elements //Stores the number of elements, Note that this is not equal to the length of the array. // Counter for each expansion and change of map structure //The critical value is the actual size (capacity * fill factor) When the critical value is exceeded, expansion will be performed (*When // fill factor When Size>=threshold, then It is necessary to consider the expansion of the array, that is to say, this means a standard to measure whether the array needs to be expanded The code for tableSizeFor is: >>> is a bit-right shift symbol that ignores the sign bit |= is the & operation between the left and right numbers This method will Turn the initialization capacity you passed in into a number that is the power of the square of 2, so it is fixed here that the capacity of the HashMap must be the power of the square of 2 As for why it is a number that is the power of the square of 2 The reasons are as follows: 1.put method source code: See the sentence p = tab[i = (n - 1) & hash]) == null (n - 1) & hash is calculated to a position. If the position in the tab is empty, the insertion operation is performed directly. As an example, suppose there are 16 positions and 4 students have their own student numbers 此时我们分配位置的时候可以采用 1%16 = 1；2%16=2；3%16 = 3；4%16=4；给他们分配位置,但是考虑到性能问题。由于%操作比&慢10倍左右，因此采用&运算会提高性能。 通过限制 比如2的hashCode是2 那么它对应的二进制是 （0000 0010） 假设n=16 那么n-1=15对应的二进制是 1111 1111 & 0000 0010 = 1111 1111 = 0010 = 2 2%16=2 得到(n - 1) & hash和hash%n结果是一致的,考虑到性能所以每次的扩容都是以2的幂次方扩容。 The above is the detailed content of Detailed introduction to Java collection class Hashmap (code example). For more information, please follow other related articles on the PHP Chinese website! AI-powered app for creating realistic nude photos Online AI tool for removing clothes from photos. Undress images for free AI clothes remover Swap faces in any video effortlessly with our completely free AI face swap tool! Easy-to-use and free code editor Chinese version, very easy to use Powerful PHP integrated development environment Visual web development tools God-level code editing software (SublimeText3) Java 8 introduces the Stream API, providing a powerful and expressive way to process data collections. However, a common question when using Stream is: How to break or return from a forEach operation?
Traditional loops allow for early interruption or return, but Stream's forEach method does not directly support this method. This article will explain the reasons and explore alternative methods for implementing premature termination in Stream processing systems.
Further reading: Java Stream API improvements
Understand Stream forEach
The forEach method is a terminal operation that performs one operation on each element in the Stream. Its design intention is PHP is a scripting language widely used on the server side, especially suitable for web development. 1.PHP can embed HTML, process HTTP requests and responses, and supports a variety of databases. 2.PHP is used to generate dynamic web content, process form data, access databases, etc., with strong community support and open source resources. 3. PHP is an interpreted language, and the execution process includes lexical analysis, grammatical analysis, compilation and execution. 4.PHP can be combined with MySQL for advanced applications such as user registration systems. 5. When debugging PHP, you can use functions such as error_reporting() and var_dump(). 6. Optimize PHP code to use caching mechanisms, optimize database queries and use built-in functions. 7 PHP and Python each have their own advantages, and the choice should be based on project requirements. 1.PHP is suitable for web development, with simple syntax and high execution efficiency. 2. Python is suitable for data science and machine learning, with concise syntax and rich libraries. PHP is suitable for web development, especially in rapid development and processing dynamic content, but is not good at data science and enterprise-level applications. Compared with Python, PHP has more advantages in web development, but is not as good as Python in the field of data science; compared with Java, PHP performs worse in enterprise-level applications, but is more flexible in web development; compared with JavaScript, PHP is more concise in back-end development, but is not as good as JavaScript in front-end development. PHP and Python each have their own advantages and are suitable for different scenarios. 1.PHP is suitable for web development and provides built-in web servers and rich function libraries. 2. Python is suitable for data science and machine learning, with concise syntax and a powerful standard library. When choosing, it should be decided based on project requirements. Capsules are three-dimensional geometric figures, composed of a cylinder and a hemisphere at both ends. The volume of the capsule can be calculated by adding the volume of the cylinder and the volume of the hemisphere at both ends. This tutorial will discuss how to calculate the volume of a given capsule in Java using different methods.
Capsule volume formula
The formula for capsule volume is as follows:
Capsule volume = Cylindrical volume Volume Two hemisphere volume
in,
r: The radius of the hemisphere.
h: The height of the cylinder (excluding the hemisphere).
Example 1
enter
Radius = 5 units
Height = 10 units
Output
Volume = 1570.8 cubic units
explain
Calculate volume using formula:
Volume = π × r2 × h (4 PHPhassignificantlyimpactedwebdevelopmentandextendsbeyondit.1)ItpowersmajorplatformslikeWordPressandexcelsindatabaseinteractions.2)PHP'sadaptabilityallowsittoscaleforlargeapplicationsusingframeworkslikeLaravel.3)Beyondweb,PHPisusedincommand-linescrip The reasons why PHP is the preferred technology stack for many websites include its ease of use, strong community support, and widespread use. 1) Easy to learn and use, suitable for beginners. 2) Have a huge developer community and rich resources. 3) Widely used in WordPress, Drupal and other platforms. 4) Integrate tightly with web servers to simplify development deployment.
transient Node
transient Set
transient int size;
transient int modCount;size is greater than or equal to threshold, the expansion mechanism will not necessarily be triggered, but it will most likely be triggered. As long as there is a If a hash conflict occurs in the newly created Entry, immediately resize)
int threshold;
final float loadFactor;3. HashMap expansion mechanism
public HashMap(int initialCapacity, float loadFactor) {
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " +
initialCapacity);
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " +
loadFactor);
this.loadFactor = loadFactor;
this.threshold = tableSizeFor(initialCapacity);
}static final int tableSizeFor(int cap) {
int n = cap - 1;
n |= n >>> 1;
n |= n >>> 2;
n |= n >>> 4;
n |= n >>> 8;
n |= n >>> 16;
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}Name Student ID 张三 1 ##李四 2 王五 3 老李 4 length是一个2的幂数， (n - 1) & hash和hash%n结果是一致的。这就是为什么要限制容量必须是一个2的幂的原因。四.HashMap的简单应用
public static void mapMethod() {
HashMap<String, Object> map = new HashMap<>();
map.put("zhangsan", 11);
map.put("lisi", 11);
//重复key会覆盖
map.put("zhangsan", 22);
//便利
for(String key:map.keySet()) {
//根据key获取value
System.out.println(key+"=======value:"+map.get(key));
}
//containsKey方法判断当前map是否包含该方法
System.out.println(map.containsKey("zhangsan"));
//size打印map的长度
System.out.println(map.size());
//移除key
map.remove("zhangsan");
//判断是否存在value
System.out.println(map.containsValue("22"));
}
Hot AI Tools
Undresser.AI Undress
AI Clothes Remover
Undress AI Tool
Clothoff.io
Video Face Swap
Hot Article
Hot Tools
Notepad++7.3.1
SublimeText3 Chinese version
Zend Studio 13.0.1
Dreamweaver CS6
SublimeText3 Mac version
Hot Topics
1664
14
1423
52
1317
25
1268
29
1243
24
Break or return from Java 8 stream forEach?
Feb 07, 2025 pm 12:09 PM
PHP: A Key Language for Web Development
Apr 13, 2025 am 12:08 AM
PHP vs. Python: Understanding the Differences
Apr 11, 2025 am 12:15 AM
PHP vs. Other Languages: A Comparison
Apr 13, 2025 am 12:19 AM
PHP vs. Python: Core Features and Functionality
Apr 13, 2025 am 12:16 AM
Java Program to Find the Volume of Capsule
Feb 07, 2025 am 11:37 AM
PHP's Impact: Web Development and Beyond
Apr 18, 2025 am 12:10 AM
PHP: The Foundation of Many Websites
Apr 13, 2025 am 12:07 AM
