(Node<K,V> node, int index)
| 3933 | } |
| 3934 | |
| 3935 | Entry<K, V> createEntry(Node<K,V> node, int index) { |
| 3936 | TreeMap.Entry<K, V> entry = new TreeMap.Entry<K, V>(node.keys[index], node.values[index]); |
| 3937 | entry.node = node; |
| 3938 | entry.index = index; |
| 3939 | return entry; |
| 3940 | } |
| 3941 | |
| 3942 | TreeMap.Entry<K, V> findSmallestEntry() { |
| 3943 | if (null != root){ |
no outgoing calls
no test coverage detected