Basic algorithms existent in every definition of chunking. More...

#include <generic.hpp>

Inheritance diagram for lal::detail::chunks_generic< arrangement_t >:

Public Member Functions
	chunks_generic (const graphs::rooted_tree &rt, const arrangement_t &arr) noexcept
	Constructor.

virtual	~chunks_generic () noexcept
	Destructor.

const linarr::chunk_sequence &	get_chunk_sequence () const noexcept
	Returns a constant reference to the chunk sequence m_sequence.

linarr::chunk_sequence &&	retrieve_chunk_sequence () noexcept
	Moves the chunk sequence m_sequence.

Protected Member Functions
linarr::chunk &	last_chunk () noexcept
	Returns a reference to the last chunk in the sentence.

std::size_t	node_to_chunk (const node u) const noexcept
	Returns the chunk index of node u.

void	set_chunk_index (const node u, const std::size_t i) noexcept
	Sets the chunk index of node u to index i.

void	set_parent_chunk (linarr::chunk &c) noexcept
	Set the parent node of a chunks.

Protected Attributes
const graphs::rooted_tree &	m_rt
	Input rooted tree.

const arrangement_t	m_arr
	Linear arrangement.

const uint64_t	m_n
	Number of vertices of the tree.

linarr::chunk_sequence	m_sequence
	The sequence of chunks obtained.

Detailed Description

template<class arrangement_t>
class lal::detail::chunks_generic< arrangement_t >

Basic algorithms existent in every definition of chunking.

Chunking applied to syntactic dependency trees alone (a.k.a., rooted trees).

Template Parameters

arr_t Type of arrangement.

Constructor & Destructor Documentation

template<class arrangement_t >

lal::detail::chunks_generic< arrangement_t >::chunks_generic	(	const graphs::rooted_tree &	rt,
		const arrangement_t &	arr )

inlinenoexcept

Constructor.

Parameters

rt	Input rooted tree.
arr	Input linear arrangement.

The documentation for this class was generated from the following file: