if err != nil {
		return nil, err
	}
	if isShortcut {
		if bytes.Equal(lnode[:hashLength], key) {
			return rnode[:hashLength], nil
		}
		return nil, nil
	}
	if bitIsSet(key, s.trieHeight-height) {
		// visit right node
		return s.get(rnode, key, batch, 2*iBatch+2, height-1)
	}
	// visit left node
	return s.get(lnode, key, batch, 2*iBatch+1, height-1)
}

	"github.com/spaolacci/murmur3"
)

// defaultLeaf is the Trie default value : hash of 0x0
var defaultLeaf = hasher([]byte{0x0})

const (
	hashLength = 8
)

type hash [hashLength]byte

func bitIsSet(bits []byte, i int) bool {
	return bits[i/8]&(1<<uint(7-i%8)) != 0
}

func hasher(data ...[]byte) []byte {
	hasher := murmur3.New64()
	for i := 0; i < len(data); i++ {
		_, _ = hasher.Write(data[i])
	}

cuiweixie <******@****.***> 1664452800 +0800

 * to keep track of which items are filtered out of the source list.
 */
public class ImmutableFilteredList<T> extends AbstractList<T> {

    private final List<T> source;
    private final BitSet filter;

    private ImmutableFilteredList(List<T> source, BitSet filter) {
        this.source = source;
        this.filter = filter;
    }

    /**
     * Creates an {@code ImmutableFilteredList} which contains all the elements of {@code source}.

package com.google.common.base;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.VisibleForTesting;
import com.google.common.base.CharMatcher.NamedFastMatcher;
import java.util.BitSet;

/**
 * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with
 * linear probing to check for matches.
 *
 * @author Christopher Swenson
 */

package com.google.common.base;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.VisibleForTesting;
import com.google.common.base.CharMatcher.NamedFastMatcher;
import java.util.BitSet;

/**
 * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with
 * linear probing to check for matches.
 *
 * @author Christopher Swenson
 */

// Code generated by "stringer -bitset -type scoreAdjustTyp"; DO NOT EDIT.

package inlheur

import "strconv"
import "bytes"

func _() {
	// An "invalid array index" compiler error signifies that the constant values have changed.
	// Re-run the stringer command to generate them again.
	var x [1]struct{}
	_ = x[panicPathAdj-1]
	_ = x[initFuncAdj-2]
	_ = x[inLoopAdj-4]
	_ = x[passConstToIfAdj-8]
	_ = x[passConstToNestedIfAdj-16]

// Code generated by "stringer -bitset -type CSPropBits"; DO NOT EDIT.

package inlheur

import "strconv"
import "bytes"

func _() {
	// An "invalid array index" compiler error signifies that the constant values have changed.
	// Re-run the stringer command to generate them again.
	var x [1]struct{}
	_ = x[CallSiteInLoop-1]
	_ = x[CallSiteOnPanicPath-2]
	_ = x[CallSiteInInitFunc-4]
}

var _CSPropBits_value = [...]uint64{

		t.Fatal("leaf shortcut didn't move up to root")
	}

	key1 := make([]byte, 8)
	// set the last bit
	bitSet(key1, 63)
	keys := [][]byte{key0, key1}
	values = [][]byte{defaultLeaf, getFreshData(1)[0]}
	_, err := smt.Update(keys, values)
	assert.NoError(t, err)
}

func bitSet(bits []byte, i int) {
	bits[i/8] |= 1 << uint(7-i%8)
}

func TestSmtRaisesError(t *testing.T) {