Tree pattern represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree. More...

#include <PrefixRankedExtendedPattern.h>

Inheritance diagram for tree::PrefixRankedExtendedPattern< SymbolType >:

[legend]

Collaboration diagram for tree::PrefixRankedExtendedPattern< SymbolType >:

[legend]

Public Member Functions
	PrefixRankedExtendedPattern (common::ranked_symbol< SymbolType > subtreeWildcard, ext::set< common::ranked_symbol< SymbolType > > nodeWildcards, ext::set< common::ranked_symbol< SymbolType > > alphabet, ext::vector< common::ranked_symbol< SymbolType > > data)
	Creates a new instance of the pattern with concrete alphabet, content, and wildcard. More...

	PrefixRankedExtendedPattern (common::ranked_symbol< SymbolType > subtreeWildcard, ext::set< common::ranked_symbol< SymbolType > > nodeWildcards, ext::vector< common::ranked_symbol< SymbolType > > data)
	Creates a new instance of the pattern with concrete content and wildcard. The alphabet is deduced from the content. More...

	PrefixRankedExtendedPattern (const PrefixRankedPattern< SymbolType > &pattern)
	Creates a new instance of the pattern based on the PrefixRankedTree. The linear representation is copied from tree. Alphabet as well. Subtree wildcard is defaultly constructed. More...

	PrefixRankedExtendedPattern (const RankedExtendedPattern< SymbolType > &pattern)
	Creates a new instance of the pattern based on the RankedPattern. The linear representation is constructed by preorder traversal on the tree parameter. More...

const ext::set< common::ranked_symbol< SymbolType > > &	getAlphabet () const &

ext::set< common::ranked_symbol< SymbolType > > &&	getAlphabet () &&

void	extendAlphabet (const ext::set< common::ranked_symbol< SymbolType > > &symbols)

const ext::set< common::ranked_symbol< SymbolType > > &	getNodeWildcards () const &

ext::set< common::ranked_symbol< SymbolType > > &&	getNodeWildcards () &&

void	extendNodeWildcards (const ext::set< common::ranked_symbol< SymbolType > > &symbols)

const common::ranked_symbol< SymbolType > &	getSubtreeWildcard () const &

common::ranked_symbol< SymbolType > &&	getSubtreeWildcard () &&

const ext::vector< common::ranked_symbol< SymbolType > > &	getContent () const &

ext::vector< common::ranked_symbol< SymbolType > > &&	getContent () &&

void	setContent (ext::vector< common::ranked_symbol< SymbolType > > data)

bool	isEmpty () const

auto	operator<=> (const PrefixRankedExtendedPattern &other) const

bool	operator== (const PrefixRankedExtendedPattern &other) const

	operator string::LinearString< common::ranked_symbol< SymbolType > > () const
	Creates a new instance of the string from a linear representation of a tree. More...

Public Member Functions inherited from core::Components< PrefixRankedExtendedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NodeWildcards >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard >
void	accessComponent ()

Friends
ext::ostream &	operator<< (ext::ostream &out, const PrefixRankedExtendedPattern &instance)

Additional Inherited Members
Static Public Member Functions inherited from core::Components< PrefixRankedExtendedPattern< SymbolType >, ext::set< common::ranked_symbol< SymbolType > >, component::Set, std::tuple< GeneralAlphabet, NodeWildcards >, common::ranked_symbol< SymbolType >, component::Value, SubtreeWildcard >
static void	registerComponent ()

static void	unregisterComponent ()

Detailed Description

template<class SymbolType>
class tree::PrefixRankedExtendedPattern< SymbolType >

Tree pattern represented as linear sequece as result of preorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. Additionally the pattern contains a special wildcard symbol representing any subtree.

T = (A, C, W \in A, N \in A), A (Alphabet) = finite set of ranked symbols, C (Content) = linear representation of the pattern content W (Wildcard) = special symbol representing any subtree N (Node Wildcards) = special symbol representing any label

Template Parameters

SymbolType used for the symbol part of the ranked symbol

Constructor & Destructor Documentation

◆ PrefixRankedExtendedPattern() [1/4]

template<class SymbolType >

tree::PrefixRankedExtendedPattern< SymbolType >::PrefixRankedExtendedPattern	(	common::ranked_symbol< SymbolType >	subtreeWildcard,
		ext::set< common::ranked_symbol< SymbolType > >	nodeWildcards,
		ext::set< common::ranked_symbol< SymbolType > >	alphabet,
		ext::vector< common::ranked_symbol< SymbolType > >	data
	)

explicit

Creates a new instance of the pattern with concrete alphabet, content, and wildcard.

Parameters

subtreeWildcard	the wildcard symbol
alphabet	the initial alphabet of the pattern
data	the initial pattern in linear representation

◆ PrefixRankedExtendedPattern() [2/4]

template<class SymbolType >

tree::PrefixRankedExtendedPattern< SymbolType >::PrefixRankedExtendedPattern	(	common::ranked_symbol< SymbolType >	subtreeWildcard,
		ext::set< common::ranked_symbol< SymbolType > >	nodeWildcards,
		ext::vector< common::ranked_symbol< SymbolType > >	data
	)

explicit

Creates a new instance of the pattern with concrete content and wildcard. The alphabet is deduced from the content.

Parameters

subtreeWildcard	the wildcard symbol
data	the initial pattern in linear representation

◆ PrefixRankedExtendedPattern() [3/4]

template<class SymbolType >

tree::PrefixRankedExtendedPattern< SymbolType >::PrefixRankedExtendedPattern ( const PrefixRankedPattern< SymbolType > & pattern )

explicit

Creates a new instance of the pattern based on the PrefixRankedTree. The linear representation is copied from tree. Alphabet as well. Subtree wildcard is defaultly constructed.

Parameters

pattern representation of a pattern.

◆ PrefixRankedExtendedPattern() [4/4]

template<class SymbolType >

tree::PrefixRankedExtendedPattern< SymbolType >::PrefixRankedExtendedPattern ( const RankedExtendedPattern< SymbolType > & pattern )

explicit

Creates a new instance of the pattern based on the RankedPattern. The linear representation is constructed by preorder traversal on the tree parameter.

Parameters

pattern representation of a pattern.

Member Function Documentation

◆ extendAlphabet()

template<class SymbolType >

void tree::PrefixRankedExtendedPattern< SymbolType >::extendAlphabet ( const ext::set< common::ranked_symbol< SymbolType > > & symbols )

inline

Adder of an alphabet symbols.

Parameters

symbols the new symbols to be added to the alphabet

◆ extendNodeWildcards()

template<class SymbolType >

void tree::PrefixRankedExtendedPattern< SymbolType >::extendNodeWildcards ( const ext::set< common::ranked_symbol< SymbolType > > & symbols )

inline

Adder of an alphabet symbols.

Parameters

symbols the new symbols to be added to the alphabet

◆ getAlphabet() [1/2]

template<class SymbolType >

ext::set< common::ranked_symbol< SymbolType > > && tree::PrefixRankedExtendedPattern< SymbolType >::getAlphabet ( ) &&

inline

Getter of the alphabet.

Returns: the alphabet of the pattern

Here is the call graph for this function:

◆ getAlphabet() [2/2]

template<class SymbolType >

const ext::set< common::ranked_symbol< SymbolType > > & tree::PrefixRankedExtendedPattern< SymbolType >::getAlphabet ( ) const &

inline

Getter of the alphabet.

Returns: the alphabet of the pattern

Here is the caller graph for this function:

◆ getContent() [1/2]

template<class SymbolType >

ext::vector< common::ranked_symbol< SymbolType > > && tree::PrefixRankedExtendedPattern< SymbolType >::getContent ( ) &&

Getter of the pattern representation.

Returns: List of symbols forming the linear representation of the pattern.

◆ getContent() [2/2]

template<class SymbolType >

const ext::vector< common::ranked_symbol< SymbolType > > & tree::PrefixRankedExtendedPattern< SymbolType >::getContent ( ) const &

Getter of the pattern representation.

Returns: List of symbols forming the linear representation of the pattern.

Here is the caller graph for this function:

◆ getNodeWildcards() [1/2]

template<class SymbolType >

ext::set< common::ranked_symbol< SymbolType > > && tree::PrefixRankedExtendedPattern< SymbolType >::getNodeWildcards ( ) &&

inline

Getter of the alphabet.

Returns: the alphabet of the pattern

Here is the call graph for this function:

◆ getNodeWildcards() [2/2]

template<class SymbolType >

const ext::set< common::ranked_symbol< SymbolType > > & tree::PrefixRankedExtendedPattern< SymbolType >::getNodeWildcards ( ) const &

inline

Getter of the alphabet.

Returns: the alphabet of the pattern

Here is the caller graph for this function:

◆ getSubtreeWildcard() [1/2]

template<class SymbolType >

common::ranked_symbol< SymbolType > && tree::PrefixRankedExtendedPattern< SymbolType >::getSubtreeWildcard ( ) &&

inline

Getter of the wildcard symbol.

Returns: the wildcard symbol of the pattern

Here is the call graph for this function:

◆ getSubtreeWildcard() [2/2]

template<class SymbolType >

const common::ranked_symbol< SymbolType > & tree::PrefixRankedExtendedPattern< SymbolType >::getSubtreeWildcard ( ) const &

inline

Getter of the wildcard symbol.

Returns: the wildcard symbol of the pattern

Here is the caller graph for this function:

◆ isEmpty()

template<class SymbolType >

bool tree::PrefixRankedExtendedPattern< SymbolType >::isEmpty

Returns: true if pattern is an empty word (vector length is 0). The method is present to allow compatibility with strings. Tree is never empty in this datatype.

◆ operator string::LinearString< common::ranked_symbol< SymbolType > >()

template<class SymbolType >

tree::PrefixRankedExtendedPattern< SymbolType >::operator string::LinearString< common::ranked_symbol< SymbolType > > ( ) const

inlineexplicit

Creates a new instance of the string from a linear representation of a tree.

Returns: tree casted to string

Here is the call graph for this function:

◆ operator<=>()

template<class SymbolType >

auto tree::PrefixRankedExtendedPattern< SymbolType >::operator<=> ( const PrefixRankedExtendedPattern< SymbolType > & other ) const

inline

The three way comparison implementation

Parameters

other the other instance

Returns: the ordering between this object and the other.

Here is the call graph for this function:

◆ operator==()

template<class SymbolType >

bool tree::PrefixRankedExtendedPattern< SymbolType >::operator== ( const PrefixRankedExtendedPattern< SymbolType > & other ) const

inline

The equality comparison implementation.

Parameters

other the other object to compare with.

Returns: true if this and other objects are equal, false othervise

Here is the call graph for this function:

◆ setContent()

template<class SymbolType >

void tree::PrefixRankedExtendedPattern< SymbolType >::setContent ( ext::vector< common::ranked_symbol< SymbolType > > data )

Setter of the representation of the pattern.

Exceptions

TreeException when new pattern representation is not valid or when symbol of the representation are not present in the alphabet

Parameters

data	new List of symbols forming the representation of the pattern.

Here is the call graph for this function:

Friends And Related Function Documentation

◆ operator<<

template<class SymbolType >

ext::ostream & operator<<	(	ext::ostream &	out,
		const PrefixRankedExtendedPattern< SymbolType > &	instance
	)

friend

Print this object as raw representation to ostream.

Parameters

out	ostream where to print
instance	object to print

Returns: modified output stream

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

alib2data/src/tree/ranked/PrefixRankedExtendedPattern.h

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ PrefixRankedExtendedPattern() [1/4]

◆ PrefixRankedExtendedPattern() [2/4]

◆ PrefixRankedExtendedPattern() [3/4]

◆ PrefixRankedExtendedPattern() [4/4]

Member Function Documentation

◆ extendAlphabet()

◆ extendNodeWildcards()

◆ getAlphabet() [1/2]

◆ getAlphabet() [2/2]

◆ getContent() [1/2]

◆ getContent() [2/2]

◆ getNodeWildcards() [1/2]

◆ getNodeWildcards() [2/2]

◆ getSubtreeWildcard() [1/2]

◆ getSubtreeWildcard() [2/2]

◆ isEmpty()

◆ operator string::LinearString< common::ranked_symbol< SymbolType > >()

◆ operator<=>()

◆ operator==()

◆ setContent()

Friends And Related Function Documentation

◆ operator<<