Class Otree.otree2

constraint 'a = data2 node2
inherit otree
method is_whole : bool
val mutable is_empty : bool
method root : 'a
val mutable _initial_size : int
val mutable initial_size : int
val uid_table : (Diffast_misc.UID.t, 'a) Hashtbl.t
val mutable gindex_table : 'a array
val mutable gindex_offset : int
val mutable initial_leftmost_table : 'a array
method _gindex_table : 'a array
method _initial_leftmost_table : 'a array
method _set_gindex_table : 'a array -> unit
method _set_initial_leftmost_table : 'a array -> unit
method _initial_size : int
method initial_size : int
method search_node_by_uid : Diffast_misc.UID.t -> 'a
method search_node_by_gindex : GI.t -> 'a
method unregister_uid : Diffast_misc.UID.t -> unit
method register_uid : Diffast_misc.UID.t -> 'a -> unit
method mem_uid : Diffast_misc.UID.t -> bool
method mem_gindex : GI.t -> bool
method size_of_subtree_uid : Diffast_misc.UID.t -> int
method digest : Diffast_misc.Xhash.t
method is_flat : bool
method equals : 'b -> bool
method collapse_root : unit
method set_digest_of_root : unit
method collapse_node : 'a -> unit
method collapse_nodes : ('a -> bool) -> unit
method set_digests : ('a -> bool) -> unit
method collapse_nodei : index -> unit
method expand_nodei : index -> unit
method expand_root : unit
method expand : index list -> unit
method expand_uids : Diffast_misc.UID.t list -> unit
method expand_nodes : 'a list -> unit
method prune_initial_nodes : 'a list -> unit
method prune_nodes : 'a list -> unit
method prune : index list -> unit
method prune_uids : Diffast_misc.UID.t list -> unit
method private v_mutate : Diffast_misc.UID.t -> 'a cluster_mutation list -> 'a Diffast_misc.Xset.t
method private v_insert_cluster : ?partial:??? -> 'a -> (int * float * 'a * ('a * Diffast_misc.Path.Elem.t) list) -> 'a Diffast_misc.Xset.t
method private v_prune_cluster : 'a -> int -> 'a list -> 'a Diffast_misc.Xset.t
method insert_cluster : Diffast_misc.UID.t -> int -> ('a * ('a * int) list) -> unit
method prune_cluster : 'a -> 'a list -> unit
method prune_initial_cluster : 'a -> 'a list -> unit
method prune_cluster_by_uid : Diffast_misc.UID.t -> Diffast_misc.UID.t list -> unit
method prune_cluster_by_gindex : GI.t -> GI.t list -> unit
method delete_node_by_gindex : GI.t -> unit
method frontier_of_cluster : index list -> index list
method contraction_candidates : index list -> index list -> (index * index list) list * 'a list * bool
method contract : (index * index list) list -> 'a list -> unit
method initial_to_string : string
method dump_xml_ch : ?initial:??? -> ?pre_tags:??? -> ?post_tags:??? -> Diffast_misc.Xchannel.out_channel -> unit
method save_in_xml : ?initial:??? -> ?comp:??? -> ?add_ext:??? -> ?pre_tags:??? -> ?post_tags:??? -> string -> unit
method save_in_xml_gz : ?initial:??? -> ?add_ext:??? -> ?pre_tags:??? -> ?post_tags:??? -> string -> unit
method to_dot : ?mklab:??? -> index list -> Buffer.t
method to_dot_initial : ?mklab:??? -> index list -> Buffer.t
method iter_initial_ancestor_nodes : 'a -> ('a -> unit) -> unit
method iter_initial_ancestor_nodeposs : 'a -> ('a -> int -> unit) -> unit
method scan_cluster : ('a * 'a list) -> ('a -> unit) -> unit
method scan_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> ('a -> unit) -> unit
method scan_initial_cluster : ('a * 'a list) -> ('a -> unit) -> unit
method fast_scan_initial_cluster : ('a * 'a list) -> ('a -> unit) -> unit
method fast_size_of_initial_cluster : ('a * 'a list) -> int
method size_of_initial_cluster : ('a * 'a list) -> int
method size_of_initial_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> int
method scan_initial_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> ('a -> unit) -> unit
method scan_initial_cluster_g : (GI.t * GI.t list) -> ('a -> unit) -> unit
method size_of_cluster : ('a * 'a list) -> int
method size_of_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> int
method iter_initial_ancestors : Diffast_misc.UID.t -> (Diffast_misc.UID.t -> unit) -> unit
method _initial_leftmost : 'a -> 'a
method setup_initial_leftmost_table : unit
method initial_leftmost : 'a -> 'a
method initial_ancestor_nodes : 'a -> 'a list
method initial_ancestor_nodeposs : 'a -> ('a * int) list
method initial_ancestors : Diffast_misc.UID.t -> Diffast_misc.UID.t list
method is_initial_ancestor : 'a -> 'a -> bool
method fast_scan_whole_initial : ('a -> unit) -> unit
method fast_rev_scan_whole_initial : ('a -> unit) -> unit
method scan_whole_initial : ('a -> unit) -> unit
method scan_whole_initial_subtree : 'a -> ('a -> unit) -> unit
method rev_scan_whole_initial_subtree : 'a -> ('a -> unit) -> unit
method fast_scan_whole_initial_subtree : 'a -> ('a -> unit) -> unit
method fast_rev_scan_whole_initial_subtree : 'a -> ('a -> unit) -> unit
method whole_initial_subtree_size : 'a -> int
method fast_whole_initial_subtree_size : 'a -> int
method setup_initial_size : unit
method preorder_scan_whole_initial_subtree : 'a -> ?after:??? -> ('a -> unit) -> unit
method preorder_scan_whole_initial : ?after:??? -> ('a -> unit) -> unit
method setup_initial_parent : unit
method scan_whole_subtree : 'a -> ('a -> unit) -> unit
method setup_uid_table : unit
method setup_gindex_table : unit
method _register_gindexes : unit
method setup_initial_children : unit
method recover_all : unit
method recover_filtered : ('a -> bool) -> unit
method expand_all : 'a -> bool
method recover_and_expand : 'a -> bool
method iter_whole_initial_leaves : ('a -> unit) -> unit
method get_whole_initial_leaves : 'a list
method to_rep : string
method initial_subtree_mem : 'a -> 'a -> bool
method private _acc : ?ignore_ofs:??? -> ?from:??? -> ('a -> int -> 'a) -> Diffast_misc.Path.t -> 'a * int
method initial_acc : ?from:??? -> Diffast_misc.Path.t -> 'a
method acc : ?from:??? -> Diffast_misc.Path.t -> 'a
method private _acc_parent : ?ignore_ofs:??? -> ?from:??? -> ('a -> int -> 'a) -> Diffast_misc.Path.t -> 'a acc_result
method initial_acc_parent : ?ignore_ofs:??? -> ?from:??? -> Diffast_misc.Path.t -> 'a acc_result
method acc_parent : ?ignore_ofs:??? -> ?from:??? -> Diffast_misc.Path.t -> 'a acc_result
method setup_apath : unit