Here is a list of all documented functions with links to the class documentation for each member:
- r -
- rand_arrangements() : lal::generate::rand_arrangements
- rand_bipartite_arrangements() : lal::generate::rand_bipartite_arrangements
- rand_lab_free_trees() : lal::generate::rand_lab_free_trees
- rand_lab_rooted_trees() : lal::generate::rand_lab_rooted_trees
- rand_planar_arrangements() : lal::generate::rand_planar_arrangements
- rand_projective_arrangements() : lal::generate::rand_projective_arrangements
- rand_ulab_free_trees() : lal::generate::rand_ulab_free_trees
- rand_ulab_rooted_trees() : lal::generate::rand_ulab_rooted_trees
- ranrut() : lal::generate::_rand_ulab_rooted_trees
- rational() : lal::numeric::rational
- recover_state() : lal::detail::DMax::unconstrained::AEF_BnB
- relabel_chunks() : lal::detail::chunks_Anderson< arrangement_t >
- remove() : lal::detail::AVL< T >, lal::detail::set_array< value_t, indexer_t >
- remove_edge() : lal::graphs::directed_graph, lal::graphs::free_tree, lal::graphs::rooted_tree, lal::graphs::undirected_graph
- remove_edge_bulk() : lal::graphs::directed_graph, lal::graphs::free_tree, lal::graphs::rooted_tree, lal::graphs::undirected_graph
- remove_edges() : lal::graphs::directed_graph, lal::graphs::free_tree, lal::graphs::rooted_tree, lal::graphs::undirected_graph
- remove_edges_incident_to() : lal::graphs::directed_graph, lal::graphs::free_tree, lal::graphs::rooted_tree, lal::graphs::undirected_graph
- remove_feature() : lal::io::_treebank_processor_base
- remove_largest() : lal::detail::AVL< T >
- remove_leftmost() : lal::detail::AVL< T >
- remove_node() : lal::graphs::directed_graph, lal::graphs::free_tree, lal::graphs::rooted_tree, lal::graphs::undirected_graph
- remove_rightmost() : lal::detail::AVL< T >
- remove_single_edge() : lal::graphs::directed_graph, lal::graphs::undirected_graph
- remove_smallest() : lal::detail::AVL< T >
- remove_sorted() : lal::detail::sorting::sorted_vector< T, unique, allocator_t >
- replace_with() : lal::detail::AVL< T >::tree_node
- reserve_degree() : lal::graphs::undirected_graph
- reserve_in_degree() : lal::graphs::directed_graph
- reserve_out_degree() : lal::graphs::directed_graph
- reset() : lal::detail::BFS< graph_t, >, lal::detail::queue_array< value_t >, lal::generate::all_arrangements, lal::generate::all_bipartite_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_bistar_trees, lal::generate::all_ulab_free_trees, lal::generate::all_ulab_rooted_trees, lal::iterators::E_iterator< graph_t, is_directed, >, lal::iterators::Q_iterator< GRAPH, is_directed, >
- reset_count() : lal::detail::sorting::countingsort::memory< T >
- resize() : lal::detail::array< T >, lal::linear_arrangement
- retrieve_all_representatives() : lal::detail::DMax::unconstrained::set_maximum_arrangements
- retrieve_chunk_sequence() : lal::detail::chunks_generic< arrangement_t >
- right_counter() : lal::detail::AVL< T >::tree_node
- right_left_case() : lal::detail::AVL< T >
- right_right_case() : lal::detail::AVL< T >
- right_rotation() : lal::detail::AVL< T >
- right_size() : lal::detail::AVL< T >::tree_node
- roll_back_constraints() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__antenna() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_hub() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_hub__h1() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_hub__h2() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_internal() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_lowest__level_0() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_lowest__level_0__towards_h1() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_lowest__level_0__towards_h2() : lal::detail::DMax::unconstrained::AEF_BnB
- roll_back_LV__bridge__from_lowest__level_pm2() : lal::detail::DMax::unconstrained::AEF_BnB
- rooted_tree() : lal::graphs::rooted_tree