MCPcopy Create free account
hub / github.com/codenameone/CodenameOne / findBiggestEntry

Method findBiggestEntry

Ports/CLDC11/src/java/util/TreeMap.java:3953–3962  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

3951 }
3952
3953 TreeMap.Entry<K, V> findBiggestEntry() {
3954 if (null != root){
3955 Node<K, V> node = maximum(root);
3956 TreeMap.Entry<K, V> ret = new TreeMap.Entry<K, V>(node.keys[node.right_idx], node.values[node.right_idx]);
3957 ret.node = node;
3958 ret.index = node.right_idx;
3959 return ret;
3960 }
3961 return null;
3962 }
3963
3964 TreeMap.Entry<K, V> findCeilingEntry(K key) {
3965 if (root == null) {

Callers 7

lastEntryMethod · 0.95
pollLastEntryMethod · 0.95
BoundedMapIteratorMethod · 0.45
theBiggestEntryMethod · 0.45
firstEntryMethod · 0.45
pollFirstEntryMethod · 0.45

Calls 1

maximumMethod · 0.95

Tested by

no test coverage detected