LLVM API Documentation
#include <Briggs.h>
Public Types | |
| typedef UnsafeArray::const_iterator | ConstUnsafeIterator |
Public Member Functions | |
| EdgeData () | |
| void | setup (SolverGraph &g, const GraphEdgeIterator &edgeItr) |
| unsigned | getWorstDegree () const |
| unsigned | getReverseWorstDegree () const |
| ConstUnsafeIterator | unsafeBegin () const |
| ConstUnsafeIterator | unsafeEnd () const |
| ConstUnsafeIterator | reverseUnsafeBegin () const |
| ConstUnsafeIterator | reverseUnsafeEnd () const |
Definition at line 216 of file Briggs.h.
| typedef UnsafeArray::const_iterator PBQP::Heuristics::Briggs::EdgeData::ConstUnsafeIterator |
| void PBQP::Heuristics::Briggs::EdgeData::setup | ( | SolverGraph & | g, | |
| const GraphEdgeIterator & | edgeItr | |||
| ) | [inline] |
Definition at line 231 of file Briggs.h.
References PBQP::Matrix::getCols(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeCosts(), and PBQP::Matrix::getRows().
Referenced by PBQP::Heuristics::Briggs::handleAddLink(), and PBQP::Heuristics::Briggs::initialise().
| unsigned PBQP::Heuristics::Briggs::EdgeData::getWorstDegree | ( | ) | const [inline] |
| unsigned PBQP::Heuristics::Briggs::EdgeData::getReverseWorstDegree | ( | ) | const [inline] |
| ConstUnsafeIterator PBQP::Heuristics::Briggs::EdgeData::unsafeBegin | ( | ) | const [inline] |
| ConstUnsafeIterator PBQP::Heuristics::Briggs::EdgeData::unsafeEnd | ( | ) | const [inline] |
| ConstUnsafeIterator PBQP::Heuristics::Briggs::EdgeData::reverseUnsafeBegin | ( | ) | const [inline] |
| ConstUnsafeIterator PBQP::Heuristics::Briggs::EdgeData::reverseUnsafeEnd | ( | ) | const [inline] |