vdj_pipe::gdst::Match Struct Reference

Results of matching pattern to suffix tree. More...

#include <gdst.hpp>

Public Member Functions
	Match (const Branch_id bid=Branch_id(), const unsigned min_d=0, const unsigned i=0)
void	next (const boost::string_ref patt, Gdst const &st)
bool	check (const boost::string_ref patt, Gdst const &st)

Public Attributes
Branch_id	curr_
unsigned	min_d_
unsigned	i_
bool	at_pattern_end_
Nucleotide	pn_
bool	at_tree_end_
Branch_id	next_
bool	mismatch_
Nucleotide	en_

Detailed Description

Results of matching pattern to suffix tree.

Constructor & Destructor Documentation

vdj_pipe::gdst::Match::Match ( const Branch_id  bid = Branch_id(), const unsigned  min_d = 0, const unsigned  i = 0  )

inlineexplicit

Member Function Documentation

bool vdj_pipe::gdst::Match::check	(	const boost::string_ref	patt,
		Gdst const &	st
	)

void vdj_pipe::gdst::Match::next	(	const boost::string_ref	patt,
		Gdst const &	st
	)

Member Data Documentation

bool vdj_pipe::gdst::Match::at_pattern_end_

true if i_ == pattern.size()

bool vdj_pipe::gdst::Match::at_tree_end_

true if current node is leaf

Branch_id vdj_pipe::gdst::Match::curr_

current node

Nucleotide vdj_pipe::gdst::Match::en_

edge[i_]

unsigned vdj_pipe::gdst::Match::i_

current pattern index

unsigned vdj_pipe::gdst::Match::min_d_

distance after current node that is known to match

bool vdj_pipe::gdst::Match::mismatch_

true if pattern[i_] != edge[i_]

Branch_id vdj_pipe::gdst::Match::next_

Nucleotide vdj_pipe::gdst::Match::pn_

pattern[i_]

---

The documentation for this struct was generated from the following files:

• include/vdj_pipe/gdst/gdst.hpp
• lib/gdst.cpp