hobbes::str::ptnode Class Reference

Collaboration diagram for hobbes::str::ptnode:

Public Member Functions
	ptnode ()
void	insert (const std::string &x)
std::map< size_t, seq >	rankedMatches (const std::string &x, size_t maxDist) const
seq	closestMatches (const std::string &x, size_t maxDist) const

Private Types
typedef std::map< char, std::unique_ptr< ptnode > >	Children

Private Member Functions
void	findRankedMatches (const std::string &pfx, const std::string &x, size_t xi, size_t edits, size_t maxDist, std::map< size_t, seq > *r, std::set< const ptnode *> *inserted) const

Private Attributes
Children	children
bool	terminal

Member Typedef Documentation

Children

typedef std::map<char, std::unique_ptr<ptnode> > hobbes::str::ptnode::Children

private

Constructor & Destructor Documentation

ptnode()

hobbes::str::ptnode::ptnode ( )

inline

Member Function Documentation

closestMatches()

seq hobbes::str::ptnode::closestMatches ( const std::string &  x, size_t  maxDist  ) const

inline

findRankedMatches()

void hobbes::str::ptnode::findRankedMatches ( const std::string &  pfx, const std::string &  x, size_t  xi, size_t  edits, size_t  maxDist, std::map< size_t, seq > *  r, std::set< const ptnode *> *  inserted  ) const

inlineprivate

insert()

void hobbes::str::ptnode::insert ( const std::string &  x )

inline

rankedMatches()

std::map<size_t, seq> hobbes::str::ptnode::rankedMatches ( const std::string &  x, size_t  maxDist  ) const

inline

Member Data Documentation

children

Children hobbes::str::ptnode::children

private

terminal

bool hobbes::str::ptnode::terminal

private

---

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

• lib/hobbes/util/str.C