Method find

vm/JavaAPI/src/java/util/TreeMap.java:3885–3926

(Object keyObj)

    }

    @SuppressWarnings("unchecked")
    Entry<K, V> find(Object keyObj) {
        java.lang.Comparable<K> object = comparator == null ? toComparable((K) keyObj)
                : null;
        K keyK = (K) keyObj;
        Node<K, V> node = root;
        while (node != null) {
            K[] keys = node.keys;
            int left_idx = node.left_idx;
            int result = cmp(object, keyK, keys[left_idx]);
            if (result < 0) {
                node = node.left;
            } else if (result == 0) {
                return createEntry(node,left_idx);
            } else {
                int right_idx = node.right_idx;
                if (left_idx != right_idx) {
                    result = cmp(object, keyK, keys[right_idx]);
                }
                if (result > 0) {
                    node = node.right;
                } else if (result == 0) {
                    return createEntry(node,right_idx);
                } else { /* search in node */
                    int low = left_idx + 1, mid = 0, high = right_idx - 1;
                    while (low <= high) {
                        mid = (low + high) >> 1;
                        result = cmp(object, keyK, keys[mid]);
                        if (result > 0) {
                            low = mid + 1;
                        } else if (result == 0) {
                            return createEntry(node,mid);
                        } else {
                            high = mid - 1;
                        }
                    }
                    return null;
                }
            }
        }
        return null;
    }
    
    Entry<K, V> createEntry(Node<K,V> node, int index) {
        TreeMap.Entry<K, V> entry = new TreeMap.Entry<K, V>(node.keys[index], node.values[index]);