Public Types | |
| typedef QVector < QSharedPointer< Group > > | TGroupList |
| typedef QSet< GroupItem > | TItemSet |
Public Member Functions | |
| Group (int id) | |
| TGroupList | computeAndSplit (const TGroupList &groups) |
| bool | contains (const QString &state) const |
| int | count () const |
| int | id () const |
| bool | initial () const |
| void | insert (const GroupItem &state) |
| TItemSet | items () const |
Protected Types | |
| typedef QVector< int > | TTrGroupList |
Protected Member Functions | |
| TTrGroupList | computeTransitionGroupList (const TGroupList &groups, const GroupItem::TTrList &trList) |
Private Attributes | |
| int | m_id |
| TItemSet | m_states |
Detailed Description
Definition at line 840 of file algorithms.cpp.
Member Typedef Documentation
| typedef QVector<QSharedPointer<Group> > Group::TGroupList |
Definition at line 843 of file algorithms.cpp.
| typedef QSet<GroupItem> Group::TItemSet |
Definition at line 844 of file algorithms.cpp.
typedef QVector<int> Group::TTrGroupList [protected] |
Definition at line 901 of file algorithms.cpp.
Constructor & Destructor Documentation
| Group::Group | ( | int | id | ) | [inline] |
Definition at line 846 of file algorithms.cpp.
Referenced by computeAndSplit().
Here is the caller graph for this function:
Member Function Documentation
| TGroupList Group::computeAndSplit | ( | const TGroupList & | groups | ) | [inline] |
number of groups can be increased, return true if is splitted only current group can be changed due tu splitting (new group is than added)
Definition at line 871 of file algorithms.cpp.
References computeTransitionGroupList(), Group(), and m_states.
Here is the call graph for this function:
| TTrGroupList Group::computeTransitionGroupList | ( | const TGroupList & | groups, | |
| const GroupItem::TTrList & | trList | |||
| ) | [inline, protected] |
Definition at line 902 of file algorithms.cpp.
Referenced by computeAndSplit().
Here is the caller graph for this function:
| bool Group::contains | ( | const QString & | state | ) | const [inline] |
Definition at line 854 of file algorithms.cpp.
References m_states.
| int Group::count | ( | ) | const [inline] |
Definition at line 852 of file algorithms.cpp.
References m_states.
| int Group::id | ( | ) | const [inline] |
Definition at line 850 of file algorithms.cpp.
References m_id.
Referenced by operator<<().
Here is the caller graph for this function:
| bool Group::initial | ( | ) | const [inline] |
Definition at line 860 of file algorithms.cpp.
References GroupItem::isInitial(), and m_states.
Here is the call graph for this function:
| void Group::insert | ( | const GroupItem & | state | ) | [inline] |
Definition at line 858 of file algorithms.cpp.
References m_states.
| TItemSet Group::items | ( | ) | const [inline] |
Definition at line 856 of file algorithms.cpp.
References m_states.
Referenced by operator<<().
Here is the caller graph for this function:
Member Data Documentation
int Group::m_id [private] |
Definition at line 935 of file algorithms.cpp.
Referenced by id().
TItemSet Group::m_states [private] |
Definition at line 934 of file algorithms.cpp.
Referenced by computeAndSplit(), contains(), count(), initial(), insert(), and items().
The documentation for this class was generated from the following file:
- C:/CVUT/diplomka/Automata_editor/algorithms/algorithms.cpp
