#include "kl.h"#include <cassert>#include <map>#include <stack>#include "bitmap.h"#include "blocks.h"#include "error.h"#include "kl_error.h"Include dependency graph for kl.cpp:
Namespaces | |
| namespace | atlas |
| namespace | atlas::kl |
Typedefs | |
| typedef std::set< KLPol >::iterator | KLPtr |
| typedef std::vector< Edge > | EdgeList |
| typedef klsupport::ExtremalRow::iterator | PI |
| typedef KLRow::iterator | KLI |
| typedef Thicket::EdgeList | EdgeList |
Functions | |
| void | atlas::pause () |
| size_t | atlas::firstAscent (const descents::DescentStatus &, const descents::DescentStatus &, size_t) |
| size_t | atlas::goodAscent (const descents::DescentStatus &, const descents::DescentStatus &, size_t) |
| void | atlas::kl::wGraph (wgraph::WGraph &wg, const KLContext &klc) |
| size_t | atlas::firstAscent (const descents::DescentStatus &d1, const descents::DescentStatus &d2, size_t rank) |
| size_t | atlas::goodAscent (const descents::DescentStatus &d1, const descents::DescentStatus &d2, size_t rank) |
Variables | |
| std::vector< size_t > | d_vertices |
| std::vector< EdgeList > | d_edges |
| std::vector< size_t > | d_xlist |
| std::vector< klsupport::ExtremalRow > | d_extr |
| std::vector< klsupport::ExtremalRow > | d_prim |
| std::vector< KLRow > | d_klr |
| std::vector< PI > | d_firstPrim |
| std::vector< KLI > | d_firstKL |
| Helper * | d_helper |
| size_t | source |
| size_t | y |
| size_t | s |
| std::vector< KLPol > | recursion |
| std::stack< size_t > | d_stack |
| bitmap::BitMap | d_done |
| EdgeList::const_iterator | d_current |
| EdgeList::const_iterator | d_currentEnd |
| size_t | d_pos |
| const Thicket * | d_thicket |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1.4.6