nitc :: MEntityTree
We introduce a new class so it can be easily refined by tools working with a Model.
nitc :: MEntityTree :: defaultinit
nitc $ MEntityTree :: SELF
Type of this instance, automatically specialized in every classcore :: Collection :: CONCURRENT
Type of the concurrent variant of this collectionordered_tree :: OrderedTree :: _parents
The parent of each element.ordered_tree :: OrderedTree :: _roots
The roots of the tree (in sequence)ordered_tree :: OrderedTree :: _sub
The branches of the trees.ordered_tree :: OrderedTree :: add_all
Append all nodeses
as children of p
.
core :: Object :: class_factory
Implementation used byget_class
to create the specific class.
core :: Collection :: combinations
Allr
-length combinations on self (in same order) without repeated elements.
core :: Collection :: combinations_with_replacement
Allr
-length combination on self (in same order) with repeated elements.
nitc :: MEntityTree :: defaultinit
core :: Object :: defaultinit
core :: Writable :: defaultinit
core :: Cloneable :: defaultinit
core :: Collection :: defaultinit
ordered_tree :: OrderedTree :: display
How to display a specific element of the treecore :: Collection :: has_all
Does the collection contain at least each element ofother
?
core :: Collection :: has_any
Does the collection contain at least one element ofother
?
core :: Collection :: has_exactly
Does the collection contain exactly all the elements ofother
?
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).ordered_tree :: OrderedTree :: parents
The parent of each element.ordered_tree :: OrderedTree :: parents=
The parent of each element.core :: Collection :: permutations
Allr
-length permutations on self (all possible ordering) without repeated elements.
core :: Collection :: product
Cartesian product, overr
times self
.
ordered_tree :: OrderedTree :: roots=
The roots of the tree (in sequence)core :: Collection :: serialize_to_pure_json
Utility to serialize a normal Json arrayordered_tree :: OrderedTree :: sort_with
Sort roots and other elements using a comparator methodordered_tree :: OrderedTree :: sub=
The branches of the trees.ordered_tree :: OrderedTree :: sub_to_a
core :: Collection :: to_concurrent
Wrapsself
in a thread-safe collection
core :: Collection :: to_counter
Create and fill up a counter with the elements of `self.core :: Collection :: to_curlslist
Convert Collection[String] to CURLSListcore :: Collection :: to_shuffle
Return a new array made of elements in a random order.ordered_tree :: OrderedTree :: write_line
Write the full line for the elemente
in o
.
core :: Writable :: write_to_bytes
Likewrite_to
but return a new Bytes (may be quite large)
core :: Writable :: write_to_file
Likewrite_to
but take care of creating the file
core :: Writable :: write_to_string
Likewrite_to
but return a new String (may be quite large).
# An OrderedTree bound to MEntity.
#
# We introduce a new class so it can be easily refined by tools working
# with a Model.
class MEntityTree
super OrderedTree[MEntity]
end
src/model/model.nit:147,1--153,3