栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > Java

硬核hashmap

Java 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

硬核hashmap

文章目录
    • 构造方法
    • 初始化容量大小算法 tableSizeFor
    • put
      • 扩容
        • 树的切割
        • 树化
        • 链化
        • 红黑树平衡调整
        • 左旋
        • 右旋
    • get

构造方法
 public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
    }
    public HashMap() {
        this.loadFactor = DEFAULT_LOAD_FACTOR; 
    }
    public HashMap(Map m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }
  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);
    }
初始化容量大小算法 tableSizeFor
  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;
    }
put
 public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
    }
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
                   boolean evict) {
         
        Node[] tab; Node 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 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)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;
    }
扩容
final Node[] resize() {
		
        Node[] oldTab = table;
        
        int oldCap = (oldTab == null) ? 0 : oldTab.length;
        
        int oldThr = threshold;
        
        int newCap, newThr = 0;
        
        if (oldCap > 0) {
        	
            if (oldCap >= MAXIMUM_CAPACITY) {
            	
                threshold = Integer.MAX_VALUE;
                return oldTab;
            }
            
            else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                     oldCap >= DEFAULT_INITIAL_CAPACITY)
                newThr = oldThr << 1; // double threshold
        }
        
        else if (oldThr > 0) 
        	
            newCap = oldThr;
         
        else {            
            newCap = DEFAULT_INITIAL_CAPACITY;
            newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
        }
        
        if (newThr == 0) {
            float ft = (float)newCap * loadFactor;
            newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
                      (int)ft : Integer.MAX_VALUE);
        }
        threshold = newThr;
        @SuppressWarnings({"rawtypes","unchecked"})
        Node[] newTab = (Node[])new Node[newCap];
        table = newTab;
        if (oldTab != null) {
        	
            for (int j = 0; j < oldCap; ++j) {
            	
                Node e;
                
                if ((e = oldTab[j]) != null) {
                	
                    oldTab[j] = null;
                    
                    if (e.next == null)
                    	
                        newTab[e.hash & (newCap - 1)] = e;
                     
                    else if (e instanceof TreeNode)
                        ((TreeNode)e).split(this, newTab, j, oldCap);
                    else { 
                   	
                        Node loHead = null, loTail = null;
                        Node hiHead = null, hiTail = null;
                        
                        Node next;
                        
                        do {
                        	
                            next = e.next;
        
         					
                            if ((e.hash & oldCap) == 0) {
                            	
                                if (loTail == null)
                                    loHead = e;
                                else
                                	
                                    loTail.next = e;
                                loTail = e;
                            }
                            
                            else {
                            	
                                if (hiTail == null)
                                    hiHead = e;
                                else
                                	
                                    hiTail.next = e;
                                hiTail = e;
                            }
                        } while ((e = next) != null);
                        
                        if (loTail != null) {
                            loTail.next = null;
                            newTab[j] = loHead;
                        }
                         
                        if (hiTail != null) {
                            hiTail.next = null;
                            newTab[j + oldCap] = hiHead;
                        }
                    }
                }
            }
        }
        return newTab;
    }
树的切割
 final void split(HashMap map, Node[] tab, int index, int bit) {
            TreeNode b = this;
            
            for (TreeNode e = b, next; e != null; e = next) {
                next = (TreeNode)e.next;
                e.next = null;
                
                if ((e.hash & bit) == 0) {
                	
                    if ((e.prev = loTail) == null)
                        loHead = e;
                    else
                    	
                        loTail.next = e;
                    
                    loTail = e;
                    
                    ++lc;
                }
                 
                else {
                	
                    if ((e.prev = hiTail) == null)
                        hiHead = e;
                    else
                    	
                        hiTail.next = e;
                    
                    hiTail = e;
                      
                    ++hc;
                }
            }
			
            if (loHead != null) {
            	
                if (lc <= UNTREEIFY_THRESHOLD)
                	
                    tab[index] = loHead.untreeify(map);
                else {
                	
                    tab[index] = loHead;
                    if (hiHead != null) // (else is already treeified)
                    	
                        loHead.treeify(tab);
                }
            }
            
            if (hiHead != null) {
            
                if (hc <= UNTREEIFY_THRESHOLD)
                	
                    tab[index + bit] = hiHead.untreeify(map);
                else {
                	
                    tab[index + bit] = hiHead;
                    if (loHead != null)
                        hiHead.treeify(tab);
                }
            }
        }
树化
final void treeify(Node[] tab) {
            TreeNode root = null;
            for (TreeNode x = this, next; x != null; x = next) {
                next = (TreeNode)x.next;
                x.left = x.right = null;
                if (root == null) {
                    x.parent = null;
                    x.red = false;
                    root = x;
                }
                else {
                    K k = x.key;
                    int h = x.hash;
                    Class kc = null;
                    for (TreeNode p = root;;) {
                        int dir, ph;
                        K pk = p.key;
                        if ((ph = p.hash) > h)
                            dir = -1;
                        else if (ph < h)
                            dir = 1;
                        else if ((kc == null &&
                                  (kc = comparableClassFor(k)) == null) ||
                                 (dir = compareComparables(kc, k, pk)) == 0)
                            dir = tieBreakOrder(k, pk);

                        TreeNode xp = p;
                        if ((p = (dir <= 0) ? p.left : p.right) == null) {
                            x.parent = xp;
                            if (dir <= 0)
                                xp.left = x;
                            else
                                xp.right = x;
                            
                            root = balanceInsertion(root, x);
                            break;
                        }
                    }
                }
            }
            
            moveRootToFront(tab, root);
        }
链化
 final Node untreeify(HashMap map) {
            Node hd = null, tl = null;
            for (Node q = this; q != null; q = q.next) {
                Node p = map.replacementNode(q, null);
                if (tl == null)
                    hd = p;
                else
                    tl.next = p;
                tl = p;
            }
            return hd;
        }
红黑树平衡调整



   static  TreeNode balanceInsertion(TreeNode root,
                                                    TreeNode x) {
            
            x.red = true;
            
            for (TreeNode xp, xpp, xppl, xppr;;) {
            	
                if ((xp = x.parent) == null) {
                    x.red = false;
                    return x;
                }
                
                else if (!xp.red || (xpp = xp.parent) == null)
                    return root;
                
                if (xp == (xppl = xpp.left)) {
                	
                    if ((xppr = xpp.right) != null && xppr.red) {
                        xppr.red = false;
                        xp.red = false;
                        xpp.red = true;
                        
                        x = xpp;
                    }
                    
                    else {
                   		
                        if (x == xp.right) {
                            root = rotateLeft(root, x = xp);
                            xpp = (xp = x.parent) == null ? null : xp.parent;
                        }
                        
                        if (xp != null) {
                            xp.red = false;
                            if (xpp != null) {
                                xpp.red = true;
                                root = rotateRight(root, xpp);
                            }
                        }
                    }
                }
                else {
                	
                    if (xppl != null && xppl.red) {
                        xppl.red = false;
                        xp.red = false;
                        xpp.red = true;
                        x = xpp;
                    }
                    
                    else {
                    	 
                        if (x == xp.left) {
                            root = rotateRight(root, x = xp);
                            xpp = (xp = x.parent) == null ? null : xp.parent;
                        }
                         
                        if (xp != null) {
                            xp.red = false;
                            if (xpp != null) {
                                xpp.red = true;
                                root = rotateLeft(root, xpp);
                            }
                        }
                    }
                }
            }
        }
左旋

  static  TreeNode rotateLeft(TreeNode root,
                                              TreeNode p) {
            TreeNode r, pp, rl;
            
            if (p != null && (r = p.right) != null) {
            	
                if ((rl = p.right = r.left) != null)
                    rl.parent = p;
                
                if ((pp = r.parent = p.parent) == null)
                    (root = r).red = false;
                
                else if (pp.left == p)
                    pp.left = r;
                else
                    pp.right = r;
                r.left = p;
                p.parent = r;
            }
            return root;
        }
右旋

 static  TreeNode rotateRight(TreeNode root,
                                               TreeNode p) {
            TreeNode l, pp, lr;
            
            if (p != null && (l = p.left) != null) {
            	
                if ((lr = p.left = l.right) != null)
                    lr.parent = p;
                    
                if ((pp = l.parent = p.parent) == null)
                    (root = l).red = false;
                
                else if (pp.right == p)
                    pp.right = l;
                else
                    pp.left = l;
                l.right = p;
                p.parent = l;
            }
            return root;
        }
get
    public V get(Object key) {
        Node e;
        return (e = getNode(hash(key), key)) == null ? null : e.value;
    }
 
    final Node getNode(int hash, Object key) {
        Node[] tab; Node first, e; int n; K k;
        if ((tab = table) != null && (n = tab.length) > 0 &&
            (first = tab[(n - 1) & hash]) != null) {
            if (first.hash == hash && // always check first node
                ((k = first.key) == key || (key != null && key.equals(k))))
                return first;
            if ((e = first.next) != null) {
                if (first instanceof TreeNode)
                    return ((TreeNode)first).getTreeNode(hash, key);
                do {
                    if (e.hash == hash &&
                        ((k = e.key) == key || (key != null && key.equals(k))))
                        return e;
                } while ((e = e.next) != null);
            }
        }
        return null;
    }

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/948693.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号