| Clal::detail::first_true< values >::_ft_impl< idx, v1, vs > | Implementation of first_true |
| Clal::detail::first_true< values >::_ft_impl< idx, v > | Implementation of first_true |
| Clal::detail::ith_type< ith_idx, Ts >::_ith_type_impl< cur_idx, t1, ts > | Implementation of ith_type |
| Clal::detail::ith_type< ith_idx, Ts >::_ith_type_impl< cur_idx, t1 > | Implementation of ith_type. Partial template specialization |
| ►Clal::generate::_rand_lab_free_trees | Uniformly random selection of labelled free trees |
| Clal::generate::_rand_lab_rooted_trees | Uniformly random selection of labelled rooted trees |
| ►Clal::generate::_rand_ulab_rooted_trees | Uniformly random selection of unlabelled rooted trees |
| Clal::generate::_rand_ulab_free_trees | Uniformly random selection of unlabelled free trees |
| Clal::generate::_tree_generator< tree_t, > | Base class for tree generators |
| ►Clal::generate::_tree_generator< graphs::free_tree > | |
| Clal::generate::all_lab_free_trees | Exhaustive enumeration of labelled free trees |
| Clal::generate::all_ulab_free_bistar_trees | Exhaustive enumeration of unlabelled free trees |
| Clal::generate::all_ulab_free_trees | Exhaustive enumeration of unlabelled free trees |
| Clal::generate::rand_lab_free_trees | Uniformly random selection of labelled free trees |
| Clal::generate::rand_ulab_free_trees | Uniformly random selection of unlabelled free trees |
| ►Clal::generate::_tree_generator< graphs::rooted_tree > | |
| Clal::generate::all_lab_rooted_trees | Exhaustive enumeration of labelled rooted trees |
| Clal::generate::all_ulab_rooted_trees | Exhaustive enumeration of unlabelled rooted trees |
| Clal::generate::rand_lab_rooted_trees | Uniformly random selection of labelled rooted trees |
| Clal::generate::rand_ulab_rooted_trees | Uniformly random selection of unlabelled rooted trees |
| ►Clal::io::_treebank_processor_base | The processor base class |
| Clal::io::treebank_collection_processor | Automatic processing of treebank collections |
| Clal::io::treebank_processor | Automatic processing of treebank files |
| Clal::detail::DMax::unconstrained::AEF_BnB | A Branch and Bound algorithm for the maximum sum of edge lengths |
| Clal::generate::all_arrangements | Exhaustive enumeration of arrangements of any graph |
| Clal::generate::all_bipartite_arrangements | Exhaustive enumeration of all bipartite arrangements of any bipartite graph |
| Clal::generate::all_planar_arrangements | Exhaustive enumeration of planar arrangements of a free tree |
| Clal::generate::all_projective_arrangements | Exhaustive enumeration of projective arrangements of a rooted tree |
| Clal::detail::arrangement_wrapper< type > | A wrapper to easily use identity arrangements |
| Clal::detail::array< T > | Wrapper of a C array for automatic deallocation of memory |
| Clal::detail::array< char > | |
| Clal::detail::array< color_t > | |
| Clal::detail::array< edge > | |
| Clal::detail::array< int64_t > | |
| Clal::detail::array< lal::detail::array< node > > | |
| Clal::detail::array< lal::detail::DMax::unconstrained::AEF_BnB::path_info > | |
| Clal::detail::array< LV_propagation_origin > | |
| Clal::detail::array< node > | |
| Clal::detail::array< std::size_t > | |
| Clal::detail::array< std::vector< node > > | |
| Clal::detail::array< uint64_t > | |
| Clal::detail::array< value_t > | |
| Clal::detail::AVL< T > | Simple class that implements an AVL tree |
| Clal::detail::BFS< graph_t, > | Abstract graph Breadth-First Search traversal |
| Clal::properties::bipartite_graph_coloring | A class to represent a coloring of the vertices of a bipartite graph |
| Clal::detail::bool_sequence< values > | A sequence of Boolean values |
| Clal::properties::branchless_path | Branchless paths in trees |
| Clal::linarr::chunk | Definition of a chunk |
| Clal::linarr::chunk_sequence | Chunk sequence of a syntactic dependency tree |
| ►Clal::detail::chunks_generic< arrangement_t > | Basic algorithms existent in every definition of chunking |
| Clal::detail::chunks_Anderson< arrangement_t > | Implementation of Anderson's algorithm for chunking |
| Clal::detail::chunks_Macutek< arrangement_t > | Implementation of Mačutek's algorithm for chunking |
| Clal::detail::conditional_list< bool_seq, type_seq > | Generalization of std::conditional_list |
| Clal::properties::connected_components< graph_t > | The connected components of a graph |
| Clal::linarr::dependency_flux | Dependency flux |
| Clal::iterators::E_iterator< graph_t, is_directed, > | Iterator over the set of edges of a graph |
| Clal::detail::edge_size | Struct used in many algorithms to sort edges according to some integer value |
| Clal::detail::DMax::planar::edge_size_sigma | A tuple used to construct the sorted adjacency list |
| Clal::generate::exhaustive_random_type< is_exhaustive > | Shorthand to get one of exhaustive_t or random_t |
| Clal::generate::exhaustive_t | Type for exhasutive enumeration of trees |
| Clal::detail::first_true< values > | From a list of Boolean values, find the first that is set to true |
| Clal::detail::AVL< T >::frequencies | Frequency of a value in the tree v |
| ►Clal::graphs::graph | Abstract class for graphs |
| ►Clal::graphs::directed_graph | Directed graph class |
| Clal::graphs::rooted_tree | Rooted tree graph class |
| ►Clal::graphs::tree | Tree graph class |
| Clal::graphs::free_tree | Free tree graph class |
| Clal::graphs::rooted_tree | Rooted tree graph class |
| ►Clal::graphs::undirected_graph | Undirected graph class |
| Clal::graphs::free_tree | Free tree graph class |
| Clal::io::head_vector_error | Head vector error report class |
| Clal::detail::DMax::unconstrained::AEF_BnB::indexer_edge | A helper class to be able to store edges in m_E_p, m_E_ps, m_E_s |
| Clal::numeric::integer | Arbitrary precision integer |
| Clal::detail::is_pointer_iterator< Iterated_Type, Iterator > | Decide if a type is a pointer or iterator to another |
| Clal::detail::ith_type< ith_idx, Ts > | Selection of the ith type of a list of types |
| ►Clal::detail::ith_type< ith_idx, Ts... > | |
| Clal::detail::ith_type< ith_idx, type_sequence< Ts... > > | Partial template specialization of ith_type for type_sequence |
| Clal::generate::labelled_t | Type for labelled tree generation |
| Clal::generate::labelled_unlabelled_type< is_labelled > | Shorthand to get one of labelled_t or unlabelled_t |
| Clal::detail::level_signature< t > | A class that implements level signatures of an array |
| Clal::linear_arrangement | Linear arrangement of vertices |
| Clal::detail::sorting::countingsort::memory< T > | Memory used for the counting sort algorithm |
| Clal::detail::sorting::countingsort::memory< node > | |
| Clal::detail::node_size | Struct used in many algorithms to sort vertices according to some integer value |
| Clal::node_t | Typesafe node type |
| Clal::detail::DMax::unconstrained::AEF_BnB::path_info | Data related to paths in the tree |
| Clal::position_t | Typesafe position type |
| Clal::iterators::Q_iterator< GRAPH, is_directed, > | Iterator over the set of pairs of independent edges of a graph |
| Clal::detail::queue_array< value_t > | Simple array-like fixed-size queue |
| Clal::detail::queue_array< node > | |
| Clal::generate::rand_arrangements | Random generation of arrangements of any graph |
| Clal::generate::rand_bipartite_arrangements | Random generation of arrangements of any bipartite graph |
| Clal::generate::rand_planar_arrangements | Uniformly random selection of planar arrangements of a free tree |
| Clal::generate::rand_projective_arrangements | Uniformly random selection of projective arrangements of a rooted tree |
| Clal::generate::random_t | Type for random generation of trees |
| Clal::numeric::rational | Exact rational number |
| Clal::detail::set_array< value_t, indexer_t > | A set-like data structure implemented with an array |
| Clal::detail::set_array< edge, lal::detail::DMax::unconstrained::AEF_BnB::indexer_edge > | |
| Clal::detail::set_array< node > | |
| Clal::detail::DMax::unconstrained::set_maximum_arrangements | Set of maximum arrangements up to isomorphism |
| Clal::detail::DMax::planar::sorted_adjacency_list_info | A piece of information within u's list |
| Clal::detail::sorting::sorted_vector< T, unique, allocator_t > | Sorted vector class |
| Clal::generate::tree_generator_type< exhaustive_random, labelled_unlabelled, tree_t > | Automatic tree generator type generator |
| Clal::detail::AVL< T >::tree_node | Node of the tree |
| Clal::io::treebank_collection_reader | A reader for a collection of treebanks |
| Clal::io::treebank_collection_report | Report on a treebank collection |
| Clal::io::treebank_collection_report_location | An auxiliary struct in replacement of std::tuple |
| Clal::io::treebank_file_error | Treebank file error report class |
| Clal::io::treebank_file_report | Report on a treebank file |
| Clal::io::treebank_reader | A reader for a single treebank file |
| Clal::detail::type_sequence< Ts > | A sequence of types |
| Clal::generate::unlabelled_t | Type for unlabelled tree generation |
1.11.0