code: protected final void forEach(Node<V> currentNode,int layout,int number,BitConsumer<V> consumer)
  	{
  		if(layout==0)
  		{
  			consumer.accept(number, currentNode.getData());
  			return ;
  		}
  		Node<V>[] sub=currentNode.getSub();
  		for(int i=0;i<sub.length;i++)
  		{
  			Node<V> node=sub[i];
  			if(node!=null)
  			{
  				layout--;
  				int num=number+i&getConfig().mask<<layout;
  				forEach(node, layout, num,consumer);
  				layout++;
  			}
  		}
  	}
docs: 循环搜索路径上存储的k-v
  @param currentNode
  @param layout
  @param number 逆向出来的数值key