Class edge stores all information in a chart edge. More...
#include <chart.h>
Inheritance diagram for freeling::edge:
Collaboration diagram for freeling::edge:
Public Member Functions | |
| edge (const std::wstring &, const std::list< std::wstring > &, const int posgov) | |
| Constructors of the subclass edge. | |
| edge () | |
| ~edge () | |
| const std::list< std::wstring > | get_matched () const |
| get matched part of the rule. | |
| const std::list< std::pair < int, int > > | get_backpath () const |
| get list of cells used to satisfy edge rule | |
| bool | active () const |
| Check if the edge is complete (inactive) or not. | |
| void | shift (int, int) |
| Advance the edge one position. | |
Private Attributes | |
| std::list< std::wstring > | matched |
| Part of the rule already matched. | |
| std::list< std::pair< int, int > > | backpath |
Detailed Description
Class edge stores all information in a chart edge.
Constructor & Destructor Documentation
| freeling::edge::edge | ( | const std::wstring & | , |
| const std::list< std::wstring > & | , | ||
| const int | posgov | ||
| ) |
Constructors of the subclass edge.
Member Function Documentation
| bool freeling::edge::active | ( | ) | const |
Check if the edge is complete (inactive) or not.
| const std::list<std::pair<int,int> > freeling::edge::get_backpath | ( | ) | const |
get list of cells used to satisfy edge rule
| const std::list<std::wstring> freeling::edge::get_matched | ( | ) | const |
get matched part of the rule.
| void freeling::edge::shift | ( | int | , |
| int | |||
| ) |
Advance the edge one position.
Member Data Documentation
std::list<std::pair<int,int> > freeling::edge::backpath [private] |
std::list<std::wstring> freeling::edge::matched [private] |
Part of the rule already matched.
The documentation for this class was generated from the following file:
