else if ((fh = f.hash) == MOVED)
 	tab = helpTransfer(tab, f);
 else {…}

 for (Node<K,V> p = f; p != lastRun; p = p.next) {
 	int ph = p.hash; K pk = p.key; V pv = p.val;
 	// 如果与运算结果是 0，那么就还在低位
 	if ((ph & n) == 0) // 如果是0 ，那么创建低位节点
 		ln = new Node<K,V>(ph, pk, pv, ln);
 	else // 1 则创建高位
 		hn = new Node<K,V>(ph, pk, pv, hn);
 }

 	public class SingletonIniti {
 	        private SingletonIniti() {
 	        }
 	
 	        private static class SingletonHolder {
 	                private static final SingletonIniti INSTANCE = newSingletonIniti();
 	         }
 	
 	        public static SingletonIniti getInstance() {
 	                return SingletonHolder.INSTANCE;
 	        }
 	}
 	```
 - 双重校验锁
 ```java
 	public class Singleton {
 	        private volatile static Singleton uniqueInstance;
 	        
 		private Singleton() {
 		}
 	
 		public static Singleton getUniqueInstance() {
 	                if (uniqueInstance == null) {
 		                synchronized (Singleton.class) {
 	                                if (uniqueInstance == null) {
 	                                        uniqueInstance = new Singleton();
 	                                }
 	                        }
 	                 }
 	                 return uniqueInstance;
 	          }
 	}
 	```