trees :: BinTreeMapIterator :: _current
trees :: BinTreeMapIterator :: _tree
trees :: BinTreeMapIterator :: current
trees :: BinTreeMapIterator :: current=
trees :: BinTreeMapIterator :: tree
trees :: BinTreeMapIterator :: tree=
trees $ BinTreeMapIterator :: SELF
Type of this instance, automatically specialized in every classtrees $ BinTreeMapIterator :: init
trees :: BinTreeMapIterator :: _current
trees :: BinTreeMapIterator :: _tree
core :: Object :: class_factory
Implementation used byget_class
to create the specific class.
trees :: BinTreeMapIterator :: current
trees :: BinTreeMapIterator :: current=
core :: MapIterator :: defaultinit
core :: Object :: defaultinit
core :: Object :: is_same_instance
Return true ifself
and other
are the same instance (i.e. same identity).
core :: Object :: is_same_serialized
Isself
the same as other
in a serialization context?
core :: Object :: is_same_type
Return true ifself
and other
have the same dynamic type.
core :: Object :: native_class_name
The class name of the object in CString format.core :: Object :: output_class_name
Display class name on stdout (debug only).trees :: BinTreeMapIterator :: tree
trees :: BinTreeMapIterator :: tree=
core :: MapIterator
Iterators for Map.
private class BinTreeMapIterator[K: Comparable, E]
super MapIterator[K, E]
var tree: BinTreeMap[K, E]
var current: nullable BinTreeNode[K, E] = null
init do current = tree.first_node
redef fun is_ok do return not current == null
redef fun next do current = current.next
redef fun item do return current.value
redef fun key do do return current.key
end
lib/trees/bintree.nit:453,1--465,3