Here is a list of all documented class members with links to the class documentation for each member:

- m -

• m__cc_node__to__graph_node : lal::properties::connected_components< graph_t >
• m__graph_node__to__cc_node : lal::properties::connected_components< graph_t >
• m_add_node : lal::detail::BFS< graph_t, >
• m_adjacency_list : lal::graphs::graph
• m_all_individual_treebank_ids : lal::io::treebank_collection_processor
• m_alpha : lal::generate::_rand_ulab_free_trees
• m_amount : lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_are_size_subtrees_valid : lal::graphs::rooted_tree
• m_arr : lal::detail::arrangement_wrapper< type >, lal::detail::chunks_Anderson< arrangement_t >, lal::detail::chunks_generic< arrangement_t >, lal::detail::chunks_Macutek< arrangement_t >, lal::detail::DMax::unconstrained::AEF_BnB, lal::generate::all_arrangements, lal::generate::all_bipartite_arrangements, lal::generate::rand_arrangements, lal::generate::rand_bipartite_arrangements
• m_be_verbose : lal::io::_treebank_processor_base
• m_border_nodes : lal::detail::DMax::unconstrained::AEF_BnB
• m_c : lal::generate::all_ulab_free_trees
• m_calculate_size_subtrees : lal::generate::_tree_generator< tree_t, >, lal::io::treebank_reader
• m_calculate_tree_type : lal::generate::_tree_generator< tree_t, >, lal::io::treebank_reader
• m_check_before_process : lal::io::_treebank_processor_base
• m_chunks : lal::linarr::chunk_sequence
• m_coloring : lal::generate::all_bipartite_arrangements, lal::generate::rand_bipartite_arrangements, lal::properties::bipartite_graph_coloring
• m_column_join_name : lal::io::treebank_collection_processor
• m_column_names : lal::io::_treebank_processor_base
• m_connected_components : lal::properties::connected_components< graph_t >
• m_cur : lal::iterators::E_iterator< graph_t, is_directed, >
• m_cur1 : lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_cur2 : lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_cur_edge : lal::iterators::E_iterator< graph_t, is_directed, >
• m_cur_ftree : lal::generate::all_lab_rooted_trees
• m_cur_pair : lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_cur_root : lal::generate::all_lab_rooted_trees
• m_cur_treebank_filename : lal::io::treebank_collection_reader
• m_cur_treebank_id : lal::io::treebank_collection_reader
• m_current_head_vector : lal::io::treebank_reader
• m_current_line : lal::io::treebank_reader
• m_cut_values : lal::detail::DMax::unconstrained::AEF_BnB
• m_data : lal::detail::array< T >, lal::detail::level_signature< t >
• m_degree_count : lal::detail::DMax::unconstrained::AEF_BnB
• m_dependencies : lal::linarr::dependency_flux
• m_direct : lal::linear_arrangement
• m_do_mirror : lal::generate::all_bipartite_arrangements
• m_E_p : lal::detail::DMax::unconstrained::AEF_BnB
• m_E_ps : lal::detail::DMax::unconstrained::AEF_BnB
• m_E_s : lal::detail::DMax::unconstrained::AEF_BnB
• m_error_msg : lal::io::head_vector_error, lal::io::treebank_file_error
• m_error_type : lal::io::head_vector_error, lal::io::treebank_file_error
• m_errors_from_processing : lal::io::treebank_collection_processor
• m_exists : lal::detail::set_array< value_t, indexer_t >
• m_exists_next : lal::iterators::E_iterator< graph_t, is_directed, >, lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_first_it : lal::generate::all_ulab_free_trees
• m_first_node : lal::detail::DMax::unconstrained::AEF_BnB
• m_fn : lal::generate::_rand_ulab_free_trees
• m_from_node_to_chunk : lal::linarr::chunk_sequence
• m_G : lal::detail::BFS< graph_t, >, lal::iterators::E_iterator< graph_t, is_directed, >, lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_Gen : lal::generate::rand_lab_free_trees, lal::generate::rand_lab_rooted_trees, lal::generate::rand_ulab_free_trees, lal::generate::rand_ulab_rooted_trees
• m_gen : lal::generate::_rand_lab_free_trees, lal::generate::_rand_ulab_rooted_trees, lal::generate::rand_arrangements, lal::generate::rand_bipartite_arrangements, lal::generate::rand_planar_arrangements, lal::generate::rand_projective_arrangements
• m_gen_lab_free_tree : lal::generate::all_lab_rooted_trees
• m_h1 : lal::generate::all_ulab_free_trees, lal::properties::branchless_path
• m_h2 : lal::generate::all_ulab_free_trees, lal::properties::branchless_path
• m_head_vector : lal::generate::_rand_ulab_rooted_trees
• m_hv_errors : lal::io::treebank_file_report
• m_I : lal::detail::set_array< value_t, indexer_t >
• m_in_adjacency_list : lal::graphs::directed_graph
• m_initialized : lal::numeric::integer, lal::numeric::rational
• m_intervals : lal::generate::all_planar_arrangements, lal::generate::all_projective_arrangements
• m_inverse : lal::linear_arrangement
• m_is_add_node_set : lal::detail::BFS< graph_t, >
• m_is_first : lal::generate::all_ulab_rooted_trees
• m_is_last : lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees
• m_is_node_assigned : lal::detail::DMax::unconstrained::AEF_BnB
• m_is_normalized : lal::graphs::graph
• m_is_process_current_set : lal::detail::BFS< graph_t, >
• m_is_process_neighbour_set : lal::detail::BFS< graph_t, >
• m_is_terminate_set : lal::detail::BFS< graph_t, >
• m_is_tree_type_valid : lal::graphs::tree
• m_it : lal::generate::all_lab_free_trees
• m_join_files : lal::io::treebank_collection_processor
• m_join_to_file : lal::io::treebank_collection_processor
• m_L : lal::generate::all_lab_free_trees, lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees
• m_leaves : lal::detail::DMax::unconstrained::AEF_BnB
• m_left : lal::detail::queue_array< value_t >
• m_left_span : lal::linarr::dependency_flux
• m_level_signatures : lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_list : lal::io::treebank_collection_reader
• m_lowest_lexicographic : lal::properties::branchless_path
• m_main_file : lal::io::treebank_collection_processor, lal::io::treebank_collection_reader
• m_max_arrs : lal::detail::DMax::unconstrained::AEF_BnB
• m_max_value : lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_memory : lal::linear_arrangement
• m_memory_bit_sort : lal::generate::all_planar_arrangements
• m_mirrored_level_signatures : lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_n : lal::detail::chunks_Anderson< arrangement_t >, lal::detail::chunks_generic< arrangement_t >, lal::detail::chunks_Macutek< arrangement_t >, lal::generate::_rand_lab_free_trees, lal::generate::_rand_ulab_rooted_trees, lal::generate::_tree_generator< tree_t, >, lal::generate::all_arrangements, lal::generate::rand_arrangements, lal::iterators::Q_iterator< GRAPH, is_directed, >, lal::linear_arrangement
• m_n_blue : lal::generate::all_bipartite_arrangements, lal::generate::rand_bipartite_arrangements
• m_n_nodes : lal::detail::DMax::unconstrained::AEF_BnB
• m_n_red : lal::generate::all_bipartite_arrangements, lal::generate::rand_bipartite_arrangements
• m_no_more_treebanks : lal::io::treebank_collection_reader
• m_no_more_trees : lal::io::treebank_reader
• m_node_left_degree : lal::detail::DMax::unconstrained::AEF_BnB
• m_node_level : lal::detail::DMax::unconstrained::AEF_BnB
• m_node_right_degree : lal::detail::DMax::unconstrained::AEF_BnB
• m_node_to_cc : lal::properties::connected_components< graph_t >
• m_node_to_orbit : lal::detail::DMax::unconstrained::AEF_BnB
• m_node_to_path_idx : lal::detail::DMax::unconstrained::AEF_BnB
• m_nodes : lal::linarr::chunk
• m_normalize_tree : lal::generate::_tree_generator< tree_t, >, lal::io::treebank_reader
• m_num_assigned_neighbors : lal::detail::DMax::unconstrained::AEF_BnB
• m_num_assigned_nodes_blue : lal::detail::DMax::unconstrained::AEF_BnB
• m_num_assigned_nodes_red : lal::detail::DMax::unconstrained::AEF_BnB
• m_num_edges : lal::graphs::graph
• m_num_nodes : lal::iterators::E_iterator< graph_t, is_directed, >
• m_num_nodes_blue : lal::detail::DMax::unconstrained::AEF_BnB
• m_num_nodes_red : lal::detail::DMax::unconstrained::AEF_BnB
• m_num_threads : lal::io::treebank_collection_processor
• m_num_trees : lal::io::treebank_reader
• m_num_unassigned_neighbors : lal::detail::DMax::unconstrained::AEF_BnB
• m_orbits : lal::detail::DMax::unconstrained::AEF_BnB
• m_out_dir : lal::io::treebank_collection_processor
• m_output_file : lal::io::treebank_processor
• m_output_header : lal::io::_treebank_processor_base
• m_p : lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees
• m_parent : lal::linarr::chunk
• m_path_info : lal::detail::DMax::unconstrained::AEF_BnB
• m_paths_in_tree : lal::detail::DMax::unconstrained::AEF_BnB
• m_position : lal::detail::set_array< value_t, indexer_t >, lal::properties::branchless_path
• m_predicted_LV : lal::detail::DMax::unconstrained::AEF_BnB
• m_predicted_LV__origin : lal::detail::DMax::unconstrained::AEF_BnB
• m_prev : lal::generate::all_ulab_rooted_trees
• m_previous_root : lal::generate::rand_planar_arrangements
• m_process_current : lal::detail::BFS< graph_t, >
• m_process_neighbour : lal::detail::BFS< graph_t, >
• m_process_visited_neighbors : lal::detail::BFS< graph_t, >
• m_Prufer_seq : lal::generate::_rand_lab_free_trees, lal::generate::all_lab_free_trees
• m_q : lal::generate::all_ulab_free_trees
• m_queue : lal::detail::BFS< graph_t, >, lal::detail::queue_array< value_t >
• m_r : lal::generate::all_ulab_free_trees
• m_rdata : lal::generate::rand_planar_arrangements, lal::generate::rand_projective_arrangements
• m_reached_end : lal::generate::all_arrangements, lal::generate::all_lab_free_trees, lal::generate::all_lab_rooted_trees, lal::generate::all_planar_arrangements, lal::generate::all_projective_arrangements, lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees, lal::io::treebank_collection_reader, lal::iterators::E_iterator< graph_t, is_directed, >, lal::iterators::Q_iterator< GRAPH, is_directed, >
• m_reached_end_blue : lal::generate::all_bipartite_arrangements
• m_reached_end_red : lal::generate::all_bipartite_arrangements
• m_red_or_blue : lal::generate::rand_bipartite_arrangements
• m_reports : lal::io::treebank_collection_report
• m_representatives : lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_right : lal::detail::queue_array< value_t >
• m_right_span : lal::linarr::dependency_flux
• m_rn : lal::generate::_rand_ulab_rooted_trees
• m_rn_times_n : lal::generate::_rand_ulab_rooted_trees
• m_rn_times_n_minus_1 : lal::generate::_rand_ulab_rooted_trees
• m_root : lal::detail::AVL< T >, lal::generate::all_planar_arrangements, lal::graphs::rooted_tree, lal::linarr::chunk
• m_rT : lal::generate::all_projective_arrangements, lal::generate::rand_projective_arrangements
• m_rt : lal::detail::chunks_Anderson< arrangement_t >, lal::detail::chunks_generic< arrangement_t >, lal::detail::chunks_Macutek< arrangement_t >, lal::detail::DMax::unconstrained::AEF_BnB
• m_save : lal::generate::all_ulab_rooted_trees
• m_separator : lal::io::_treebank_processor_base
• m_sequence : lal::detail::chunks_Anderson< arrangement_t >, lal::detail::chunks_generic< arrangement_t >, lal::detail::chunks_Macutek< arrangement_t >
• m_size : lal::detail::array< T >, lal::detail::set_array< value_t, indexer_t >, lal::generate::all_ulab_free_bistar_trees
• m_size_subtrees : lal::graphs::rooted_tree
• m_sm : lal::generate::all_lab_free_trees
• m_sorting_memory : lal::detail::DMax::unconstrained::AEF_BnB
• m_T : lal::generate::all_planar_arrangements, lal::generate::rand_planar_arrangements
• m_t : lal::detail::DMax::unconstrained::AEF_BnB, lal::detail::DMax::unconstrained::set_maximum_arrangements
• m_T_copy : lal::generate::all_planar_arrangements, lal::generate::rand_planar_arrangements
• m_terminate : lal::detail::BFS< graph_t, >
• m_tree_type : lal::graphs::tree
• m_treebank : lal::io::treebank_reader
• m_treebank_column_name : lal::io::treebank_collection_processor
• m_treebank_error : lal::io::treebank_collection_report, lal::io::treebank_file_report
• m_treebank_file : lal::io::treebank_reader
• m_treebank_filename : lal::io::treebank_processor
• m_treebank_id : lal::io::treebank_processor
• m_treebank_identifier : lal::io::treebank_reader
• m_treebank_reader : lal::io::treebank_collection_reader
• m_unif : lal::generate::_rand_lab_free_trees, lal::generate::_rand_ulab_rooted_trees
• m_union_find__root_of : lal::graphs::tree
• m_union_find__root_size : lal::graphs::tree
• m_use_rev_edges : lal::detail::BFS< graph_t, >
• m_val : lal::numeric::integer, lal::numeric::rational
• m_values : lal::detail::set_array< value_t, indexer_t >
• m_vertex_sequence : lal::properties::branchless_path
• m_vertex_set : lal::properties::branchless_path
• m_vis : lal::detail::BFS< graph_t, >
• m_W : lal::generate::all_ulab_free_trees
• m_weight : lal::linarr::dependency_flux
• m_what_fs : lal::io::_treebank_processor_base
• m_what_in_left : lal::generate::rand_bipartite_arrangements
• make_chunks() : lal::detail::chunks_Anderson< arrangement_t >
• make_current_edge() : lal::iterators::E_iterator< graph_t, is_directed, >
• make_current_pair() : lal::iterators::Q_iterator< GRAPH, is_directed, >
• max_pm_two : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• memory() : lal::detail::sorting::countingsort::memory< T >
• merge() : lal::detail::DMax::unconstrained::set_maximum_arrangements
• min_pm_two : lal::detail::DMax::unconstrained::AEF_BnB::path_info
• mirror() : lal::detail::level_signature< t >, lal::linear_arrangement
• move_full_directed_graph() : lal::graphs::directed_graph
• move_full_free_tree() : lal::graphs::free_tree
• move_full_graph() : lal::graphs::graph
• move_full_rooted_tree() : lal::graphs::rooted_tree
• move_full_undirected_graph() : lal::graphs::undirected_graph