lib/treemap/tree_map.rb
# entry is a key-value pair in an array: [key, value]
# Returns this map's entry that has the same key and value as <entry>, or null if this map has no such entry.
#
# This method uses the comparator for key equality rather than <equals>. If this map's comparator isn't consistent with equals,
# then {@code remove()} and {@code contains()} will violate the collections API.
#
# returns a Node
entry is a key-value pair in an array: [key, value]
Returns this map's entry that has the same key and value as , or null if this map has no such entry.

This method uses the comparator for key equality rather than . If this map's comparator isn't consistent with equals,
then  remove() and  contains() will violate the collections API.

returns a Node
entry is a key - value pair in an array : [ key value ] Returns this map ' s entry that has the same key and value as or null if this map has no such entry . This method uses the comparator for key equality rather than . If this map ' s comparator isn ' t consistent with equals then remove () and contains () will violate the collections API . returns a Node
def find_by_entry(key, value)
    key, value = *entry
    mine = find_by_object(key)
    mine if mine && mine.value == value
  end
def find_by_entry ( key , value ) key , value = * entry mine = find_by_object ( key ) mine if mine && mine . value == value end
entry is a key-value pair in an array: [key, value]
Returns this map's entry that has the same key and value as <entry>, or null if this map has no such entry.
entry is a key - value pair in an array : [ key value ] Returns this map ' s entry that has the same key and value as <entry > or null if this map has no such entry .
key
value