SYMBOL INDEX (2377 symbols across 499 files) FILE: cola/libavoid/actioninfo.cpp type Avoid (line 33) | namespace Avoid { function Obstacle (line 94) | Obstacle *ActionInfo::obstacle(void) const function ShapeRef (line 103) | ShapeRef *ActionInfo::shape(void) const function ConnRef (line 109) | ConnRef *ActionInfo::conn(void) const function JunctionRef (line 115) | JunctionRef *ActionInfo::junction(void) const FILE: cola/libavoid/actioninfo.h function namespace (line 34) | namespace Avoid { FILE: cola/libavoid/connectionpin.cpp type Avoid (line 36) | namespace Avoid { function Point (line 245) | const Point ShapeConnectionPin::position(const Polygon& newPoly) const function ConnDirFlags (line 331) | ConnDirFlags ShapeConnectionPin::directions(void) const function ConnectionPinIds (line 388) | ConnectionPinIds ShapeConnectionPin::ids(void) const FILE: cola/libavoid/connectionpin.h function namespace (line 41) | namespace Avoid { FILE: cola/libavoid/connector.cpp type Avoid (line 45) | namespace Avoid { function ConnType (line 170) | ConnType ConnRef::routingType(void) const function PolyLine (line 590) | const PolyLine& ConnRef::route(void) const function PolyLine (line 596) | PolyLine& ConnRef::routeRef(void) function Polygon (line 647) | Polygon& ConnRef::displayRoute(void) function Point (line 683) | Point midpoint(Point a, Point b) function VertInf (line 729) | VertInf *ConnRef::src(void) const function VertInf (line 735) | VertInf *ConnRef::dst(void) const function VertInf (line 741) | VertInf *ConnRef::start(void) function Router (line 797) | Router *ConnRef::router(void) const function validateBendPoint (line 807) | bool validateBendPoint(VertInf *aInf, VertInf *bInf, VertInf *cInf) function PointRepVector (line 1340) | PointRepVector PtOrder::sortedPoints(const size_t dim) function midVertexNumber (line 1488) | static int midVertexNumber(const Point& p0, const Point& p1, const Poi... function splitBranchingSegments (line 1572) | void splitBranchingSegments(Avoid::Polygon& poly, bool polyIsConn, function segDir (line 1653) | static int segDir(const Point& p1, const Point& p2) function posInlineWithConnEndSegs (line 1674) | static bool posInlineWithConnEndSegs(const double pos, const size_t dim, function pathLength (line 1721) | static double pathLength(Avoid::Point **c_path, Avoid::Point **p_path, FILE: cola/libavoid/connector.h function namespace (line 42) | namespace Avoid { FILE: cola/libavoid/connend.cpp type Avoid (line 41) | namespace Avoid { function ConnEndType (line 114) | ConnEndType ConnEnd::type(void) const function Point (line 120) | const Point ConnEnd::position(void) const function ConnDirFlags (line 137) | ConnDirFlags ConnEnd::directions(void) const function ShapeRef (line 150) | ShapeRef *ConnEnd::shape(void) const function JunctionRef (line 156) | JunctionRef *ConnEnd::junction(void) const FILE: cola/libavoid/connend.h function namespace (line 42) | namespace Avoid { FILE: cola/libavoid/debug.h function namespace (line 45) | namespace Avoid { FILE: cola/libavoid/debughandler.h function namespace (line 39) | namespace Avoid { FILE: cola/libavoid/geometry.cpp type Avoid (line 49) | namespace Avoid { function inBetween (line 57) | bool inBetween(const Point& a, const Point& b, const Point& c) function colinear (line 81) | bool colinear(const Point& a, const Point& b, const Point& c, function pointOnLine (line 107) | bool pointOnLine(const Point& a, const Point& b, const Point& c, function segmentIntersect (line 134) | bool segmentIntersect(const Point& a, const Point& b, const Point& c, function segmentShapeIntersect (line 168) | bool segmentShapeIntersect(const Point& e1, const Point& e2, const Poi... function inValidRegion (line 201) | bool inValidRegion(bool IgnoreRegions, const Point& a0, const Point& a1, function cornerSide (line 263) | int cornerSide(const Point &c1, const Point &c2, const Point &c3, function euclideanDist (line 294) | double euclideanDist(const Point& a, const Point& b) function manhattanDist (line 304) | double manhattanDist(const Point& a, const Point& b) function dist (line 312) | double dist(const Point& a, const Point& b) function totalLength (line 321) | double totalLength(const Polygon& poly) function angle (line 332) | double angle(const Point& a, const Point& b, const Point& c) function inPoly (line 351) | bool inPoly(const Polygon& poly, const Point& q, bool countBorder) function inPolyGen (line 382) | bool inPolyGen(const PolygonInterface& argpoly, const Point& q) function segmentIntersectPoint (line 478) | int segmentIntersectPoint(const Point& a1, const Point& a2, function rayIntersectPoint (line 578) | int rayIntersectPoint(const Point& a1, const Point& a2, function rotationalAngle (line 613) | double rotationalAngle(const Point& p) FILE: cola/libavoid/geometry.h function namespace (line 42) | namespace Avoid { function Point (line 99) | static inline Point projection(const Point& a, const Point& b, const Poi... FILE: cola/libavoid/geomtypes.cpp type Avoid (line 37) | namespace Avoid function Point (line 111) | Point Point::operator+(const Point& rhs) const function Point (line 117) | Point Point::operator-(const Point& rhs) const function Point (line 191) | const Point& ReferencingPolygon::at(size_t index) const function Box (line 210) | Box PolygonInterface::offsetBoundingBox(double offset) const function Polygon (line 282) | Polygon PolygonInterface::boundingRectPolygon(void) const function Point (line 289) | static Point unitNormalForEdge(const Point &pt1, const Point &pt2) function Polygon (line 303) | Polygon PolygonInterface::offsetPolygon(double offset) const function Point (line 390) | const Point& Polygon::at(size_t index) const function shorten_line (line 415) | static void shorten_line(double& x1, double& y1, double& x2, double& y2, function Polygon (line 532) | Polygon Polygon::simplify(void) const function Polygon (line 640) | Polygon Polygon::curvedPolyline(const double curve_amount, FILE: cola/libavoid/geomtypes.h function namespace (line 39) | namespace Avoid FILE: cola/libavoid/graph.cpp type Avoid (line 40) | namespace Avoid { function orthogTurnOrder (line 85) | static inline int orthogTurnOrder(const Point& a, const Point& b, function VertInf (line 578) | VertInf *EdgeInf::otherVert(const VertInf *vert) const function EdgeInf (line 586) | EdgeInf *EdgeInf::checkEdgeVisibility(VertInf *i, VertInf *j, bool kno... function EdgeInf (line 622) | EdgeInf *EdgeInf::existingEdge(VertInf *i, VertInf *j) function EdgeInf (line 771) | EdgeInf *EdgeList::begin(void) function EdgeInf (line 777) | EdgeInf *EdgeList::end(void) FILE: cola/libavoid/graph.h function namespace (line 35) | namespace Avoid { FILE: cola/libavoid/hyperedge.cpp type Avoid (line 39) | namespace Avoid { function HyperedgeNewAndDeletedObjectLists (line 74) | HyperedgeNewAndDeletedObjectLists HyperedgeRerouter::newAndDeletedObje... function ConnRefSet (line 212) | ConnRefSet HyperedgeRerouter::calcHyperedgeConnectors(void) FILE: cola/libavoid/hyperedge.h function namespace (line 38) | namespace Avoid { FILE: cola/libavoid/hyperedgeimprover.cpp type Avoid (line 39) | namespace Avoid { class HyperedgeShiftSegment (line 41) | class HyperedgeShiftSegment : public ShiftSegment method HyperedgeShiftSegment (line 44) | HyperedgeShiftSegment(HyperedgeTreeNode *n1, HyperedgeTreeNode *n2, method Point (line 70) | Point& lowPoint(void) method Point (line 74) | Point& highPoint(void) method Point (line 78) | const Point& lowPoint(void) const method Point (line 82) | const Point& highPoint(void) const method setBalanceCount (line 90) | void setBalanceCount(void) method balanceCount (line 130) | int balanceCount(void) const method adjustPosition (line 135) | void adjustPosition(void) method overlapsWith (line 185) | bool overlapsWith(const ShiftSegment *rhs, const size_t dim) const method immovable (line 204) | bool immovable(void) const method settled (line 208) | bool settled(void) const method mergesWith (line 212) | bool mergesWith(HyperedgeShiftSegment *other) function CmpHyperedgeSegmentDirOrder (line 253) | static bool CmpHyperedgeSegmentDirOrder(const ShiftSegment *lhsSuper, function HyperedgeNewAndDeletedObjectLists (line 1026) | HyperedgeNewAndDeletedObjectLists function HyperedgeTreeNode (line 1046) | HyperedgeTreeNode *HyperedgeImprover::moveJunctionAlongCommonEdge( FILE: cola/libavoid/hyperedgeimprover.h function namespace (line 33) | namespace Avoid { FILE: cola/libavoid/hyperedgetree.cpp type Avoid (line 36) | namespace Avoid { function travellingForwardOnConnector (line 171) | static bool travellingForwardOnConnector(ConnRef *conn, JunctionRef *j... function HyperedgeTreeNode (line 410) | HyperedgeTreeNode *HyperedgeTreeEdge::followFrom(HyperedgeTreeNode *fr... FILE: cola/libavoid/hyperedgetree.h function namespace (line 38) | namespace Avoid { FILE: cola/libavoid/junction.cpp type Avoid (line 34) | namespace Avoid { function Rectangle (line 63) | Rectangle JunctionRef::makeRectangle(Router *router, const Point& posi... function Point (line 121) | Point JunctionRef::position(void) const function Point (line 136) | Point JunctionRef::recommendedPosition(void) const function ConnRef (line 190) | ConnRef *JunctionRef::removeJunctionAndMergeConnectors(void) FILE: cola/libavoid/junction.h function namespace (line 39) | namespace Avoid { FILE: cola/libavoid/makepath.cpp type Avoid (line 50) | namespace Avoid { class ANode (line 52) | class ANode method ANode (line 64) | ANode(VertInf *vinf, int time) method ANode (line 73) | ANode() class AStarPathPrivate (line 84) | class AStarPathPrivate method AStarPathPrivate (line 87) | AStarPathPrivate() method ANode (line 104) | ANode *newANode(const ANode& node, const bool addToPending = true) class ANodeCmp (line 153) | class ANodeCmp method ANodeCmp (line 156) | ANodeCmp() function Dot (line 182) | static double Dot(const Point& l, const Point& r) function CrossLength (line 187) | static double CrossLength(const Point& l, const Point& r) function angleBetween (line 196) | static double angleBetween(const Point& p1, const Point& p2, const Poi... function constructPolygonPath (line 214) | static void constructPolygonPath(Polygon& connRoute, VertInf *inf2, function dimDirection (line 292) | static inline int dimDirection(double difference) function cost (line 310) | static double cost(ConnRef *lineRef, const double dist, VertInf *inf2, function printDirections (line 495) | static void printDirections(FILE *fp, unsigned int directions) function orthogonalDirectionsCount (line 517) | static unsigned int orthogonalDirectionsCount(const unsigned int direc... function orthogonalDirection (line 540) | static unsigned int orthogonalDirection(const Point &a, const Point &b) function dirRight (line 566) | static unsigned int dirRight(unsigned int direction) function dirLeft (line 591) | static unsigned int dirLeft(unsigned int direction) function dirReverse (line 616) | static unsigned int dirReverse(unsigned int direction) function bends (line 648) | int bends(const Point& curr, unsigned int currDir, const Point& dest, function estimatedCostSpecific (line 782) | static double estimatedCostSpecific(ConnRef *lineRef, const Point *last, class CmpVisEdgeRotation (line 879) | class CmpVisEdgeRotation method CmpVisEdgeRotation (line 882) | CmpVisEdgeRotation(const VertInf* lastPt) function pointAlignedWithOneOf (line 901) | static inline bool pointAlignedWithOneOf(const Point& point, FILE: cola/libavoid/makepath.h function namespace (line 30) | namespace Avoid { FILE: cola/libavoid/mtst.cpp type Avoid (line 49) | namespace Avoid { type delete_vertex (line 66) | struct delete_vertex function HyperedgeTreeNode (line 98) | HyperedgeTreeNode *MinimumTerminalSpanningTree::rootJunction(void) const function HyperedgeTreeNode (line 135) | HyperedgeTreeNode *MinimumTerminalSpanningTree::addNode(VertInf *vertex, function VertInf (line 252) | VertInf **MinimumTerminalSpanningTree::resetDistsForPath(VertInf *curr... function VertInf (line 523) | VertInf *MinimumTerminalSpanningTree::orthogonalPartner(VertInf *vert, function LayeredOrthogonalEdgeList (line 577) | LayeredOrthogonalEdgeList MinimumTerminalSpanningTree:: function VertexPair (line 964) | VertexPair MinimumTerminalSpanningTree:: FILE: cola/libavoid/mtst.h function namespace (line 37) | namespace Avoid { FILE: cola/libavoid/obstacle.cpp type Avoid (line 31) | namespace Avoid { function VertInf (line 237) | VertInf *Obstacle::firstVert(void) function VertInf (line 243) | VertInf *Obstacle::lastVert(void) function Polygon (line 255) | const Polygon& Obstacle::polygon(void) const function Router (line 261) | Router *Obstacle::router(void) const function Box (line 267) | Box Obstacle::routingBox(void) const function Polygon (line 277) | Polygon Obstacle::routingPolygon(void) const function Point (line 287) | Point Obstacle::shapeCentre(void) function VertInf (line 311) | VertInf *Obstacle::getPointVertex(const Point& point) function ConnRefList (line 340) | ConnRefList Obstacle::attachedConnectors(void) const FILE: cola/libavoid/obstacle.h function namespace (line 42) | namespace Avoid { FILE: cola/libavoid/orthogonal.cpp type Avoid (line 50) | namespace Avoid { class UnsignedPair (line 67) | class UnsignedPair method UnsignedPair (line 70) | UnsignedPair(unsigned ind1, unsigned ind2) class CmpIndexes (line 96) | class CmpIndexes method CmpIndexes (line 99) | CmpIndexes(ConnRef *conn, size_t dim) class NudgingShiftSegment (line 115) | class NudgingShiftSegment : public ShiftSegment method NudgingShiftSegment (line 119) | NudgingShiftSegment(ConnRef *conn, const size_t low, const size_t high, method NudgingShiftSegment (line 138) | NudgingShiftSegment(ConnRef *conn, const size_t low, const size_t high, method Point (line 159) | Point& lowPoint(void) method Point (line 163) | Point& highPoint(void) method Point (line 167) | const Point& lowPoint(void) const method Point (line 171) | const Point& highPoint(void) const method nudgeDistance (line 175) | double nudgeDistance(void) const method immovable (line 179) | bool immovable(void) const method createSolverVariable (line 183) | void createSolverVariable(const bool justUnifying) method updatePositionsFromSolver (line 235) | void updatePositionsFromSolver(const bool justUnifying) method fixedOrder (line 266) | int fixedOrder(bool& isFixed) const method order (line 288) | int order(void) const method zigzag (line 300) | bool zigzag(void) const method overlapsWith (line 306) | bool overlapsWith(const ShiftSegment *rhsSuper, const size_t dim) const method canAlignWith (line 361) | bool canAlignWith(const NudgingShiftSegment *rhs, method shouldAlignWith (line 383) | bool shouldAlignWith(const ShiftSegment *rhsSuper, method mergeWith (line 443) | void mergeWith(const ShiftSegment *rhsSuper, const size_t dim) method hasCheckpointAtPosition (line 479) | bool hasCheckpointAtPosition(const double position, method lowC (line 503) | bool lowC(void) const method highC (line 514) | bool highC(void) const type ScanVisDirFlag (line 529) | enum ScanVisDirFlag { function ScanVisDirFlags (line 542) | static ScanVisDirFlags getPosVertInfDirections(VertInf *v, size_t dim) type PosVertInf (line 588) | struct PosVertInf method PosVertInf (line 590) | PosVertInf(double p, VertInf *vI, ScanVisDirFlags d = VisDirNone) type CmpVertInf (line 629) | struct CmpVertInf class LineSegment (line 659) | class LineSegment method LineSegment (line 662) | LineSegment(const double& b, const double& f, const double& p, method LineSegment (line 680) | LineSegment(const double& bf, const double& p, VertInf *bfvi = nullptr) method overlaps (line 711) | bool overlaps(const LineSegment& rhs) const method mergeVertInfs (line 732) | void mergeVertInfs(const LineSegment& segment) method VertInf (line 739) | VertInf *beginVertInf(void) const method VertInf (line 754) | VertInf *finishVertInf(void) const method VertInf (line 770) | VertInf *commitPositionX(Router *router, double posX) method horiCommitBegin (line 790) | void horiCommitBegin(Router *router, VertInf *vert = nullptr) method horiCommitFinish (line 809) | void horiCommitFinish(Router *router, VertInf *vert = nullptr) method addSegmentsUpTo (line 829) | VertSet::iterator addSegmentsUpTo(double finishPos) method addEdgeHorizontal (line 856) | void addEdgeHorizontal(Router *router) method setLongRangeVisibilityFlags (line 867) | void setLongRangeVisibilityFlags(size_t dim) method VertSet (line 956) | VertSet addEdgeHorizontalTillIntersection(Router *router, method insertBreakpointsBegin (line 987) | void insertBreakpointsBegin(Router *router, LineSegment& vertLine) method insertBreakpointsFinish (line 1012) | void insertBreakpointsFinish(Router *router, LineSegment& vertLine) method generateVisibilityEdgesFromBreakpointSet (line 1035) | void generateVisibilityEdgesFromBreakpointSet(Router *router, size_t... class SegmentListWrapper (line 1225) | class SegmentListWrapper method LineSegment (line 1228) | LineSegment *insert(LineSegment segment) method SegmentList (line 1264) | SegmentList& list(void) function intersectSegments (line 1276) | static void intersectSegments(Router *router, SegmentList& segments, function processEventVert (line 1368) | static void processEventVert(Router *router, NodeSet& scanline, function processEventHori (line 1551) | static void processEventHori(Router *router, NodeSet& scanline, function fixConnectionPointVisibilityOnOutsideOfVisibilityGraph (line 1691) | void fixConnectionPointVisibilityOnOutsideOfVisibilityGraph(Event **ev... function generateStaticOrthogonalVisGraph (line 1730) | extern void generateStaticOrthogonalVisGraph(Router *router) function insideRectBounds (line 1991) | static bool insideRectBounds(const Point& point, const RectBounds& rec... function buildOrthogonalNudgingSegments (line 2015) | static void buildOrthogonalNudgingSegments(Router *router, class CmpLineOrder (line 2282) | class CmpLineOrder method CmpLineOrder (line 2285) | CmpLineOrder(PtOrderMap& ord, const size_t dim) function ShiftSegmentList (line 2378) | static ShiftSegmentList linesort(bool nudgeFinalSegments, class PotentialSegmentConstraint (line 2461) | class PotentialSegmentConstraint method PotentialSegmentConstraint (line 2464) | PotentialSegmentConstraint(size_t index1, size_t index2, method sepDistance (line 2476) | double sepDistance(void) const method stillValid (line 2484) | bool stillValid(void) const method rewriteIndex (line 2488) | void rewriteIndex(size_t oldIndex, size_t newIndex) class ImproveOrthogonalRoutes (line 2509) | class ImproveOrthogonalRoutes function improveOrthogonalRoutes (line 3252) | extern void improveOrthogonalRoutes(Router *router) FILE: cola/libavoid/orthogonal.h function namespace (line 29) | namespace Avoid { FILE: cola/libavoid/router.cpp type Avoid (line 44) | namespace Avoid { function DebugHandler (line 154) | DebugHandler *Router::debugHandler(void) const function ShapeRef (line 159) | ShapeRef *Router::shapeContainingPoint(const Point& point) class CmpConnCostRef (line 1040) | class CmpConnCostRef method CmpConnCostRef (line 1043) | CmpConnCostRef() function cheapEstimatedCost (line 1056) | static double cheapEstimatedCost(ConnRef *lineRef) class CrossingConnectorsInfo (line 1087) | class CrossingConnectorsInfo method addCrossing (line 1092) | void addCrossing(ConnRef *conn1, ConnRef *conn2) method ConnCostRefSetList (line 1111) | ConnCostRefSetList crossingSetsListToRemoveCrossingsFromGroups(void) method connsKnownToCross (line 1205) | bool connsKnownToCross(ConnRef *conn1, ConnRef *conn2) method ConnCostRef (line 1227) | ConnCostRef removeConnectorWithMostCrossings( method groupForConn (line 1287) | CrossingConnectorsMapList::iterator groupForConn(ConnRef *conn) method groupForCrossingConns (line 1310) | CrossingConnectorsMapList::iterator groupForCrossingConns( class CmpOrderedConnCostRef (line 1395) | class CmpOrderedConnCostRef method CmpOrderedConnCostRef (line 1398) | CmpOrderedConnCostRef() function AngleAFromThreeSides (line 1755) | static double AngleAFromThreeSides(const double a, const double b, function ConnType (line 1970) | ConnType Router::validConnType(const ConnType select) const function HyperedgeRerouter (line 2072) | HyperedgeRerouter *Router::hyperedgeRerouter(void) function reduceRange (line 2164) | static void reduceRange(double& val) function HyperedgeNewAndDeletedObjectLists (line 3090) | HyperedgeNewAndDeletedObjectLists FILE: cola/libavoid/router.h function namespace (line 47) | namespace Avoid { FILE: cola/libavoid/scanline.cpp type Avoid (line 35) | namespace Avoid { function compare_events (line 294) | int compare_events(const void *a, const void *b) function buildConnectorRouteCheckpointCache (line 311) | void buildConnectorRouteCheckpointCache(Router *router) function clearConnectorRouteCheckpointCache (line 362) | void clearConnectorRouteCheckpointCache(Router *router) function processShiftEvent (line 388) | static void processShiftEvent(NodeSet& scanline, Event *e, size_t dim, function buildOrthogonalChannelInfo (line 462) | void buildOrthogonalChannelInfo(Router *router, FILE: cola/libavoid/scanline.h function namespace (line 35) | namespace Avoid { FILE: cola/libavoid/shape.cpp type Avoid (line 36) | namespace Avoid { function absoluteOffsetInverse (line 77) | static double absoluteOffsetInverse(double offset, function Polygon (line 228) | const Polygon& ShapeRef::polygon(void) const function Point (line 260) | Point ShapeRef::position(void) const FILE: cola/libavoid/shape.h function namespace (line 41) | namespace topology { function namespace (line 45) | namespace Avoid { FILE: cola/libavoid/tests/2junctions.cpp function test (line 5) | int test() function main (line 105) | int main(void) FILE: cola/libavoid/tests/buildOrthogonalChannelInfo1.cpp function test (line 5) | void test() function main (line 61) | int main(void) FILE: cola/libavoid/tests/checkpointNudging1.cpp function main (line 5) | int main(void) { FILE: cola/libavoid/tests/checkpointNudging2.cpp function main (line 5) | int main(void) { FILE: cola/libavoid/tests/checkpointNudging3.cpp function main (line 6) | int main(void) { FILE: cola/libavoid/tests/checkpoints01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/checkpoints02.cpp function main (line 9) | int main(void) { FILE: cola/libavoid/tests/checkpoints03.cpp function main (line 7) | int main(void) { FILE: cola/libavoid/tests/complex.cpp function connCallback (line 29) | static void connCallback(void *ptr) function main (line 46) | int main(void) FILE: cola/libavoid/tests/connectionpin01.cpp function main (line 30) | int main(void) FILE: cola/libavoid/tests/connectionpin02.cpp function main (line 30) | int main(void) FILE: cola/libavoid/tests/connectionpin03.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/connendmove.cpp function main (line 31) | int main(void) FILE: cola/libavoid/tests/corneroverlap01.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/endlessLoop01.cpp function outputDiagram (line 5) | void outputDiagram(Avoid::Router * router) function test (line 13) | void test() function main (line 138) | int main(void) FILE: cola/libavoid/tests/example.cpp function connCallback (line 29) | static void connCallback(void *ptr) function main (line 46) | int main(void) FILE: cola/libavoid/tests/finalSegmentNudging1.cpp function main (line 5) | int main(void) { FILE: cola/libavoid/tests/finalSegmentNudging2.cpp function main (line 5) | int main(void) { FILE: cola/libavoid/tests/finalSegmentNudging3.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/forwardFlowingConnectors01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/freeFloatingDirection01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/hola01.cpp function main (line 12) | int main(void) { FILE: cola/libavoid/tests/hyperedge01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/hyperedge02.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/hyperedgeLoop1.cpp function test (line 7) | void test() function main (line 83) | int main(void) FILE: cola/libavoid/tests/hyperedgeRerouting01.cpp function outputDiagram (line 6) | void outputDiagram(Avoid::Router * router) function test (line 14) | int test() function main (line 147) | int main(int argc, char* argv[]) FILE: cola/libavoid/tests/improveHyperedge01.cpp function test (line 5) | int test() function main (line 106) | int main(void) FILE: cola/libavoid/tests/improveHyperedge02.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/improveHyperedge03.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/improveHyperedge04.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/improveHyperedge05.cpp function outputDiagram (line 5) | void outputDiagram(Avoid::Router * router) function test (line 13) | void test() function main (line 150) | int main(void) FILE: cola/libavoid/tests/improveHyperedge06.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/infinity.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inline.cpp function main (line 32) | int main(void) FILE: cola/libavoid/tests/inlineOverlap09.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inlineOverlap10.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inlineOverlap11.cpp function main (line 5) | int main(void) FILE: cola/libavoid/tests/inlineShapes.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap02.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap03.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap04.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap05.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap06.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap07.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/inlineoverlap08.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/junction01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/junction02.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/junction03.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/junction04.cpp function main (line 29) | int main(void) FILE: cola/libavoid/tests/latesetup.cpp function connCallback (line 29) | static void connCallback(void *ptr) function main (line 46) | int main(void) FILE: cola/libavoid/tests/lineSegWrapperCrash1.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash2.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash3.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash4.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash5.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash6.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash7.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/lineSegWrapperCrash8.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/multiconnact.cpp function connCallback (line 29) | static void connCallback(void *ptr) function main (line 46) | int main(void) FILE: cola/libavoid/tests/node1.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/nudgeCrossing01.cpp function main (line 11) | int main(void) { FILE: cola/libavoid/tests/nudgeintobug.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/nudgeold.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/nudgingSkipsCheckpoint01.cpp function main (line 7) | int main(void) { FILE: cola/libavoid/tests/nudgingSkipsCheckpoint02.cpp function main (line 7) | int main(void) { FILE: cola/libavoid/tests/orderassertion.cpp function main (line 6) | int main(void) { FILE: cola/libavoid/tests/orthordering01.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/orthordering02.cpp function main (line 4) | int main(void) { FILE: cola/libavoid/tests/overlappingRects.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/penaltyRerouting01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/performance01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/reallyslowrouting.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/removeJunctions01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/restrictedNudging.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/slowrouting.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/tjunct.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/treeRootCrash01.cpp function test (line 4) | void test() function main (line 136) | int main(int argc, char* argv[]) FILE: cola/libavoid/tests/treeRootCrash02.cpp function test (line 6) | void test() function main (line 239) | int main(int argc, char* argv[]) FILE: cola/libavoid/tests/unsatisfiableRangeAssertion.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/validPaths01.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/validPaths02.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/tests/vertlineassertion.cpp function main (line 3) | int main(void) { FILE: cola/libavoid/timer.cpp type Avoid (line 34) | namespace Avoid { FILE: cola/libavoid/timer.h function namespace (line 31) | namespace Avoid { FILE: cola/libavoid/vertices.cpp type Avoid (line 40) | namespace Avoid { function VertID (line 64) | VertID& VertID::operator= (const VertID& rhs) function VertID (line 108) | VertID VertID::operator+(const int& rhs) const function VertID (line 114) | VertID VertID::operator-(const int& rhs) const function VertID (line 120) | VertID& VertID::operator++(int) function ostream (line 149) | ostream& operator<<(ostream& os, const VertID& vID) function EdgeInf (line 190) | EdgeInf *VertInf::hasNeighbour(VertInf *target, bool orthogonal) const function ConnDirFlags (line 290) | ConnDirFlags VertInf::directionFrom(const VertInf *other) const function VertInf (line 381) | VertInf **VertInf::makeTreeRootPointer(VertInf *root) function VertInf (line 388) | VertInf *VertInf::treeRoot(void) const function VertInf (line 393) | VertInf **VertInf::treeRootPointer(void) const function VertInf (line 415) | VertInf *VertInf::sptfRoot(void) const function directVis (line 422) | bool directVis(VertInf *src, VertInf *dst) function VertInf (line 557) | VertInf *VertInfList::removeVertex(VertInf *vert) function VertInf (line 660) | VertInf *VertInfList::getVertexByID(const VertID& id) function VertInf (line 688) | VertInf *VertInfList::getVertexByPos(const Point& p) function VertInf (line 702) | VertInf *VertInfList::shapesBegin(void) function VertInf (line 708) | VertInf *VertInfList::connsBegin(void) function VertInf (line 719) | VertInf *VertInfList::end(void) FILE: cola/libavoid/vertices.h function namespace (line 38) | namespace Avoid { FILE: cola/libavoid/viscluster.cpp type Avoid (line 33) | namespace Avoid { function ReferencingPolygon (line 96) | ReferencingPolygon& ClusterRef::polygon(void) function Polygon (line 102) | Polygon& ClusterRef::rectangularPolygon(void) function Router (line 108) | Router *ClusterRef::router(void) const FILE: cola/libavoid/viscluster.h function namespace (line 36) | namespace Avoid { FILE: cola/libavoid/visibility.cpp type Avoid (line 47) | namespace Avoid { function vertexVisibility (line 115) | void vertexVisibility(VertInf *point, VertInf *partner, bool knownNew, class PointPair (line 171) | class PointPair method PointPair (line 174) | PointPair(const Point& centerPoint, VertInf *inf) class EdgePair (line 213) | class EdgePair method EdgePair (line 216) | EdgePair() method EdgePair (line 228) | EdgePair(const PointPair& p1, VertInf *v) method setNegativeAngle (line 269) | void setNegativeAngle(void) method setCurrAngle (line 273) | double setCurrAngle(const PointPair& p) class isBoundingShape (line 322) | class isBoundingShape method isBoundingShape (line 326) | isBoundingShape(ShapeSet& set) : function sweepVisible (line 350) | static bool sweepVisible(SweepEdgeList& T, const PointPair& point, function vertexSweep (line 436) | static void vertexSweep(VertInf *vert) FILE: cola/libavoid/visibility.h function namespace (line 30) | namespace Avoid { FILE: cola/libavoid/vpsc.cpp type Avoid (line 55) | namespace Avoid { type node (line 132) | struct node { function Constraint (line 431) | Constraint* IncSolver::mostViolated(Constraints &l) function Block (line 781) | Block* Block::merge(Block* b, Constraint* c) { function Constraint (line 864) | Constraint *Block::findMinInConstraint() { function Constraint (line 913) | Constraint *Block::findMinOutConstraint() { function Constraint (line 1135) | Constraint *Block::findMinLM() { function Constraint (line 1146) | Constraint *Block::findMinLMBetween(Variable* const lv, Variable* cons... function Constraint (line 1237) | Constraint* Block::splitBetween(Variable* const vl, Variable* const vr, function ostream (line 1281) | ostream& operator <<(ostream &os, const Block& b) class EqualityConstraintSet (line 1399) | class EqualityConstraintSet method EqualityConstraintSet (line 1402) | EqualityConstraintSet(Variables vs) method isRedundant (line 1411) | bool isRedundant(Variable *lhs, Variable *rhs, double sep) method mergeSets (line 1426) | void mergeSets(Variable *lhs, Variable *rhs, double sep) method setForVar (line 1452) | VarOffsetMapList::iterator setForVar(Variable *var) function Constraints (line 1468) | Constraints constraintsRemovingRedundantEqualities(Variables const &vars, FILE: cola/libavoid/vpsc.h function namespace (line 77) | namespace Avoid { function class (line 208) | class Constraint function class (line 247) | class Blocks FILE: cola/libcola/box.cpp type cola (line 25) | namespace cola { FILE: cola/libcola/box.h function namespace (line 31) | namespace cola { FILE: cola/libcola/cc_clustercontainmentconstraints.cpp type cola (line 33) | namespace cola { class ClusterShapeOffsets (line 38) | class ClusterShapeOffsets : public SubConstraintInfo method ClusterShapeOffsets (line 41) | ClusterShapeOffsets(unsigned ind, vpsc::Dim dim, double offset, int ... function SubConstraintAlternatives (line 124) | SubConstraintAlternatives FILE: cola/libcola/cc_clustercontainmentconstraints.h function namespace (line 29) | namespace vpsc { function namespace (line 33) | namespace cola { FILE: cola/libcola/cc_nonoverlapconstraints.cpp type cola (line 33) | namespace cola { function SubConstraintAlternatives (line 344) | SubConstraintAlternatives FILE: cola/libcola/cc_nonoverlapconstraints.h function namespace (line 32) | namespace vpsc { function namespace (line 36) | namespace cola { function usesClusterBounds (line 68) | bool usesClusterBounds(void) const function resize (line 72) | void resize(double xOffset, double yOffset) function class (line 84) | class ShapePairInfo function class (line 124) | class NonOverlapConstraintExemptions { function class (line 136) | class NonOverlapConstraints : public CompoundConstraint { FILE: cola/libcola/cluster.cpp type cola (line 33) | namespace cola { function Box (line 265) | Box RectangularCluster::margin(void) const function Box (line 283) | Box RectangularCluster::padding(void) const FILE: cola/libcola/cluster.h function namespace (line 36) | namespace cola { FILE: cola/libcola/cola.cpp type cola (line 36) | namespace cola { function Rectangle (line 599) | Rectangle bounds(vector& rs) { function removeClusterOverlap (line 615) | void removeClusterOverlap(RootCluster& clusterHierarchy, vpsc::Rectang... function removeClusterOverlapFast (line 679) | void removeClusterOverlapFast(RootCluster& clusterHierarchy, vpsc::Rec... function ConstrainedMajorizationLayout (line 685) | ConstrainedMajorizationLayout* simpleCMLFactory( FILE: cola/libcola/cola.h function namespace (line 40) | namespace vpsc { class Rectangle; } function namespace (line 41) | namespace topology { function namespace (line 44) | namespace dialect { function namespace (line 56) | namespace cola { type std (line 102) | typedef std::vector Locks; function class (line 107) | class Resize { function vpsc (line 127) | const vpsc::Rectangle* getTarget() const { type std (line 135) | typedef std::vector Resizes; type DesiredPosition (line 141) | struct DesiredPosition { type std (line 147) | typedef std::vector DesiredPositions; type std (line 154) | typedef std::pair DesiredPositionInDim; type std (line 155) | typedef std::vector DesiredPositionsInDim; function class (line 168) | class PreIteration { function class (line 216) | class TestConvergence { function virtual (line 223) | virtual ~TestConvergence() {} function reset (line 245) | void reset() { function class (line 270) | class ConstrainedMajorizationLayout { function setNonOverlappingClusters (line 375) | void setNonOverlappingClusters() { function moveBoundingBoxes (line 401) | void moveBoundingBoxes() { function setConstrainedLayout (line 441) | void setConstrainedLayout(bool c) { function class (line 531) | class TopologyAddonInterface function class (line 622) | class ConstrainedFDLayout { type ProjectionResult (line 925) | struct ProjectionResult { FILE: cola/libcola/cola_log.h function namespace (line 37) | namespace cola { function class (line 118) | class Output2FILE function FILE (line 125) | inline FILE*& Output2FILE::Stream() function Output (line 131) | inline void Output2FILE::Output(const std::string& msg) function std (line 168) | inline std::string NowTime() function std (line 186) | inline std::string NowTime() FILE: cola/libcola/colafd.cpp type cola (line 65) | namespace cola { function delete_vector (line 68) | void delete_vector(vector &v) { function dotProd (line 74) | inline double dotProd(valarray x, valarray y) { function dumpSquareMatrix (line 83) | void dumpSquareMatrix(unsigned n, T** L) { function dijkstra (line 184) | void dijkstra(const unsigned s, const unsigned n, double* d, function getPosition (line 273) | void getPosition(Position& X, Position& Y, Position& pos) { function cmpCompoundConstraintPriority (line 410) | static bool cmpCompoundConstraintPriority(const cola::CompoundConstrai... function TopologyAddonInterface (line 952) | TopologyAddonInterface *ConstrainedFDLayout::getTopology(void) function setupVarsAndConstraints (line 958) | void setupVarsAndConstraints(unsigned n, const CompoundConstraints& ccs, function setupExtraConstraints (line 990) | static void setupExtraConstraints(const CompoundConstraints& ccs, function updateCompoundConstraints (line 1006) | void updateCompoundConstraints(const vpsc::Dim dim, function project (line 1015) | void project(vpsc::Variables& vs, vpsc::Constraints& cs, valarray CompoundConstraints; function class (line 288) | class BoundaryConstraint : public CompoundConstraint function class (line 345) | class AlignmentConstraint : public CompoundConstraint function class (line 432) | class SeparationConstraint : public CompoundConstraint function class (line 499) | class OrthogonalEdgeConstraint : public CompoundConstraint function class (line 534) | class MultiSeparationConstraint : public CompoundConstraint function class (line 611) | class DistributionConstraint : public CompoundConstraint { function class (line 679) | class FixedRelativeConstraint : public CompoundConstraint { function class (line 730) | class PageBoundaryConstraints : public CompoundConstraint { function class (line 788) | class UnsatisfiableConstraintInfo { type std (line 826) | typedef std::vector UnsatisfiableConstrai... FILE: cola/libcola/conjugate_gradient.cpp function matrix_times_vector (line 39) | static void function inner (line 72) | double function compute_cost (line 81) | double compute_cost(valarray const &A, function conjugate_gradient (line 96) | void FILE: cola/libcola/connected_components.cpp type cola (line 32) | namespace cola { function Rectangle (line 49) | Rectangle* Component::getBoundingBox() type ccomponents (line 59) | namespace ccomponents { type Node (line 60) | struct Node { function dfs (line 68) | void dfs(Node* v, function connectedComponents (line 89) | void connectedComponents( function separateComponents (line 142) | void separateComponents(const vector &components) { FILE: cola/libcola/connected_components.h function namespace (line 26) | namespace cola { FILE: cola/libcola/convex_hull.cpp type hull (line 29) | namespace hull { function crossProduct (line 36) | inline double crossProduct( type CounterClockwiseOrder (line 42) | struct CounterClockwiseOrder { method CounterClockwiseOrder (line 43) | CounterClockwiseOrder( function convex (line 68) | void convex(const unsigned n, const double* X, const double* Y, vector... function convex (line 78) | void convex(valarray const & X, valarray const & Y, ve... FILE: cola/libcola/convex_hull.h function namespace (line 26) | namespace hull { FILE: cola/libcola/exceptions.h function namespace (line 26) | namespace cola { FILE: cola/libcola/gradient_projection.cpp type cola (line 46) | namespace cola { function dotProd (line 124) | static inline double dotProd(valarray const & a, valarray const & v, std::valarray & edges) { function pathLength (line 775) | double pathLength(Edge const * e, vector const & nodes) { function computeStressFromRoutes (line 786) | double computeStressFromRoutes(double strength, vector & edges) { FILE: cola/libcola/straightener.h function namespace (line 32) | namespace cola { function namespace (line 37) | namespace straightener { type DebugPoint (line 77) | struct DebugPoint { type DebugLine (line 80) | struct DebugLine { function class (line 86) | class ScanObject { function class (line 99) | class Edge : public ScanObject { function isEnd (line 142) | bool isEnd(unsigned n) const { function xpos (line 148) | void xpos(double y, std::vector& xs) const { function ypos (line 159) | void ypos(double x, std::vector& ys) const { function Route (line 170) | Route const * getRoute() const { function setRoute (line 173) | void setRoute(Route * r) { function class (line 184) | class Straightener { function class (line 234) | class Cluster { function class (line 242) | class Node : public ScanObject { function euclidean_distance (line 278) | double euclidean_distance(Node const * v) const { function if (line 301) | struct CmpNodePos { type std (line 324) | typedef std::set NodeSet; function else (line 328) | struct LinearConstraint { type std (line 372) | typedef std::vector LinearConstraints; FILE: cola/libcola/tests/FixedRelativeConstraint01.cpp function main (line 4) | int main(void) { FILE: cola/libcola/tests/StillOverlap01.cpp function main (line 4) | int main(void) { FILE: cola/libcola/tests/StillOverlap02.cpp function main (line 4) | int main(void) { FILE: cola/libcola/tests/boundary.cpp function Node (line 48) | Node* addNode( Nodes& vs, vpsc::Rectangle* r) { function addToPath (line 53) | void addToPath(EdgePoints& ps, Node *v, EdgePoint::RectIntersect i) { type SetDesiredPos (line 56) | struct SetDesiredPos : public PreIteration { method SetDesiredPos (line 57) | SetDesiredPos(Locks& locks) : PreIteration(locks) {} type Test (line 59) | struct Test : TestConvergence { method Test (line 60) | Test(const double d,const unsigned i,topology::Nodes& vs, topology::Ed... function clusterBoundary (line 77) | void clusterBoundary() { function main (line 117) | int main() { FILE: cola/libcola/tests/connected_components.cpp function main (line 37) | int main() { FILE: cola/libcola/tests/constrained.cpp function getRand (line 42) | inline double getRand(double range) { function main (line 52) | int main() { FILE: cola/libcola/tests/containment.cpp function main (line 53) | int main() { FILE: cola/libcola/tests/containment2.cpp function main (line 54) | int main() { FILE: cola/libcola/tests/convex_hull.cpp function randTest (line 53) | void randTest(unsigned n, valarray& X, valarray& Y) { function tworects (line 68) | void tworects(valarray& X, valarray& Y, Hull& expectedHu... function main (line 90) | int main(int argc, char** argv) { function dot (line 111) | void dot(Cairo::RefPtr & cr, double x, double y) { function xcoord (line 117) | double xcoord(double x) { function ycoord (line 120) | double ycoord(double y) { function drawCairo (line 123) | int drawCairo(const string& fname, FILE: cola/libcola/tests/cycle_detector.cpp function main (line 38) | int main() { FILE: cola/libcola/tests/gml_graph.cpp function Edge (line 39) | Edge readEdge(ifstream &f) { function readNode (line 69) | unsigned readNode(ifstream &f, NodeIdMap &nodeIdMap, type PostIteration (line 103) | struct PostIteration : TestConvergence { method PostIteration (line 104) | PostIteration(vector &rs, vector > &p... function main (line 148) | int main() { FILE: cola/libcola/tests/graphlayouttest.h function getRand (line 34) | inline double getRand(double range) { function namespace (line 38) | namespace DFS { type Graph (line 80) | struct Graph { function TestConvergence (line 112) | struct CheckProgress : TestConvergence { type SolverType (line 120) | enum SolverType { CG, UGP, SGP, IP } function run_test (line 121) | void run_test( function writeFile (line 183) | void writeFile(const topology::Nodes& vs, const topology::Edges& es, con... function writeDunnartFile (line 215) | void writeDunnartFile(const topology::Nodes& vs, const vector& es) { function main (line 74) | int main() { FILE: cola/libcola/tests/makefeasible.cpp function makeEdge (line 80) | void makeEdge(unsigned u, unsigned v, function random_dag (line 85) | vector random_dag(unsigned depth, unsigned maxbranch, unsigned &V, function removeoverlaps (line 130) | void removeoverlaps(vpsc::Rectangles &rs, bool bothaxes) { function makeFeasible (line 202) | void makeFeasible(vpsc::Rectangles& rs, vector& edges, function main (line 283) | int main() { FILE: cola/libcola/tests/makefeasible02.cpp function main (line 4) | int main(void) { FILE: cola/libcola/tests/max_acyclic_subgraph.cpp function main (line 37) | int main() { FILE: cola/libcola/tests/overlappingClusters01.cpp function main (line 7) | int main(void) { FILE: cola/libcola/tests/overlappingClusters02.cpp function main (line 20) | int main(void) { FILE: cola/libcola/tests/overlappingClusters04.cpp function main (line 8) | int main(void) { FILE: cola/libcola/tests/page_bounds.cpp function random_graph (line 39) | vector random_graph(unsigned n) { function main (line 55) | int main() { FILE: cola/libcola/tests/planar.cpp type TestCase (line 53) | struct TestCase { method addNode (line 59) | void addNode(double minX, double minY, double w, double h) { method addToPath (line 65) | void addToPath(unsigned vID, topology::EdgePoint::RectIntersect i) { method addEdge (line 68) | void addEdge(double l) { function writeFile (line 79) | void writeFile(const topology::Nodes& vs, const topology::Edges& es, con... type Test (line 110) | struct Test : TestConvergence { method Test (line 111) | Test(const double d,const unsigned i,topology::Nodes& vs, topology::Ed... function test (line 127) | void test() { function main (line 283) | int main() { FILE: cola/libcola/tests/random_graph.cpp function random_graph (line 34) | vector random_graph(unsigned n) { function main (line 50) | int main() { FILE: cola/libcola/tests/rectangularClusters01.cpp function main (line 5) | int main(void) { FILE: cola/libcola/tests/rectclustershapecontainment.cpp function main (line 4) | int main(void) { FILE: cola/libcola/tests/resize.cpp function addToPath (line 59) | void addToPath(topology::EdgePoints& ps, topology::Node *v, topology::Ed... type Test (line 62) | struct Test : TestConvergence { method Test (line 63) | Test(const double d,const unsigned i,topology::Nodes& vs, topology::Ed... function resize (line 80) | void resize() { function main (line 127) | int main() { FILE: cola/libcola/tests/scale_free.cpp function scale_free (line 42) | void scale_free(const unsigned n = 50) { function main (line 129) | int main() { FILE: cola/libcola/tests/shortest_paths.cpp function random_graph (line 45) | vector random_graph(unsigned n) { function resetClock (line 59) | static void resetClock() { function getRunTime (line 62) | static double getRunTime() { function main (line 67) | int FILE: cola/libcola/tests/small_graph.cpp type CheckProgress (line 48) | struct CheckProgress : TestConvergence { method CheckProgress (line 49) | CheckProgress(const double d,const unsigned i) : TestConvergence(d,i) {} function main (line 55) | int main() { FILE: cola/libcola/tests/sparse_matrix.cpp function sparse_test (line 36) | int sparse_test(const unsigned n, cola::SparseMatrix::SparseMap& cm, map... function dense_test (line 50) | int dense_test(const unsigned n, cola::SparseMatrix::SparseMap& cm, mapp... function test (line 60) | void test(int (*generate)(const unsigned, cola::SparseMatrix::SparseMap&... function main (line 82) | int main() { FILE: cola/libcola/tests/test_cg.cpp function outer_prod (line 33) | static valarray function uniform (line 44) | static double function matrix_times_vector (line 49) | static void function Linfty (line 66) | static double function main (line 71) | int FILE: cola/libcola/tests/topology.cpp function addToPath (line 59) | void addToPath(topology::EdgePoints& ps, topology::Node *v, topology::Ed... type SetDesiredPos (line 62) | struct SetDesiredPos : public PreIteration { method SetDesiredPos (line 63) | SetDesiredPos(Locks& locks) : PreIteration(locks) {} function writeFile (line 68) | void writeFile(const topology::Nodes& vs, const topology::Edges& es, con... type Test (line 99) | struct Test : TestConvergence { method Test (line 100) | Test(const double d,const unsigned i,topology::Nodes& vs, topology::Ed... function randomMove (line 116) | void randomMove(int i) { function main (line 170) | int main() { FILE: cola/libcola/tests/trees.cpp function makeEdge (line 37) | void makeEdge(unsigned u, unsigned v, function random_tree (line 42) | vector random_tree(unsigned depth, unsigned maxbranch, unsigned &V, function main (line 77) | int main() { FILE: cola/libcola/tests/unconstrained.cpp function main (line 46) | int main() { FILE: cola/libcola/tests/unsatisfiable.cpp function main (line 45) | int main() { FILE: cola/libdialect/aca.cpp type dialect (line 86) | namespace dialect { function ACASepFlag (line 99) | ACASepFlag negateSepFlag(ACASepFlag sf) function ACAFlag (line 117) | ACAFlag sepToAlignFlag(ACASepFlag sf) function ACAFlag (line 126) | ACAFlag perpAlignFlag(ACAFlag af) function ACASepFlag (line 134) | ACASepFlag vectorToSepFlag(double dx, double dy) function propsedSepConflictsWithExistingPosition (line 142) | bool propsedSepConflictsWithExistingPosition(ACASepFlag pro, ACASepFla... function sortOrdAlignsByPenalty (line 151) | bool sortOrdAlignsByPenalty(const OrderedAlignment *lhs, const Ordered... function OrderedAlignment (line 1141) | OrderedAlignment *ACALayout::chooseOA(void) function OrderedAlignment (line 1226) | OrderedAlignment *ACALayout::initOrdAlign(int j, ACASepFlag sf) const function OrderedAlignment (line 1240) | OrderedAlignment *ACALayout::initOrdAlign(int s, int t, ACASepFlag sf,... function OrderedAlignment (line 1324) | OrderedAlignment *ACALayout::mostRecentOA(void) function EdgeOffset (line 1655) | EdgeOffset ACALayout::getEdgeOffsetForCompassDirection(int j, ACASepFl... function reduceRange (line 1672) | static void reduceRange(double& val) FILE: cola/libdialect/aca.h function namespace (line 41) | namespace dialect { type std (line 111) | typedef std::vector OrderedAlignments; type std (line 112) | typedef std::pair EdgeOffset; type std (line 113) | typedef std::vector EdgeOffsets; type std (line 114) | typedef std::vector ACASepFlags; function class (line 124) | class ACALayout { FILE: cola/libdialect/chains.cpp function LinkShapes (line 63) | LinkShapes dialect::bentLinkShapeCwFromStartingPt(LinkShape start) { function CardinalDirs (line 104) | CardinalDirs dialect::possibleCardinalDirections(Node_SP node1, Node_SP ... function LinkShape (line 117) | LinkShape dialect::shapeOfLink(Node_SP link) { function Node_SP (line 247) | Node_SP Chain::getNode(int i) const { function Edge_SP (line 260) | Edge_SP Chain::getEdge(int i) const { function BendSequences (line 404) | BendSequences Chain::computePossibleBendSequences(void) const { function ChainConfigSeq (line 485) | ChainConfigSeq Chain::writeConfigSeq(BendSequence_SP bendSeq) const { function Chains (line 624) | Chains dialect::buildAllChainsInGraph(std::shared_ptr graph) { FILE: cola/libdialect/chains.h function namespace (line 40) | namespace dialect { type std (line 145) | typedef std::shared_ptr BendSequence_SP; type std (line 146) | typedef std::vector BendSequences; type AestheticBend (line 149) | struct AestheticBend { type std (line 164) | typedef std::shared_ptr AestheticBend_SP; type std (line 165) | typedef std::vector AestheticBends; type std (line 167) | typedef std::vector> ChainConfigSeq; function class (line 173) | class Chain { type std (line 320) | typedef std::shared_ptr Chain_SP; type std (line 321) | typedef std::vector Chains; FILE: cola/libdialect/commontypes.h function namespace (line 36) | namespace dialect { FILE: cola/libdialect/constraints.cpp function SepDir (line 57) | SepDir dialect::negateSepDir(SepDir sd) { function CardinalDir (line 92) | CardinalDir dialect::sepDirToCardinalDir(SepDir sd) { function SepDir (line 107) | SepDir dialect::cardinalDirToSepDir(CardinalDir dir) { function SepDir (line 122) | SepDir dialect::lateralWeakening(SepDir sd) { function SepDir (line 137) | SepDir dialect::cardinalStrengthening(SepDir sd) { function CardinalDir (line 297) | CardinalDir SepPair::getCardinalDir(void) const { function string (line 309) | string SepPair::writeTglf(std::map id2ext, const SepM... function CardinalDir (line 519) | CardinalDir SepMatrix::getCardinalDir(id_type id1, id_type id2) const { function string (line 855) | string SepMatrix::writeTglf(std::map id2ext) const { function SepPair_SP (line 867) | SepPair_SP &SepMatrix::getSepPair(id_type id1, id_type id2) { function SepPair_SP (line 891) | SepPair_SP SepMatrix::checkSepPair(id_type id1, id_type id2) const { function string (line 953) | string SepMatrix::toString(void) const { function CardinalDir (line 1015) | CardinalDir SepCo::getDirecRelativeToNode(Node_SP baseNode) const { function Projection_SP (line 1054) | Projection_SP ProjSeq::nextProjection(void) { function ProjSeq (line 1062) | ProjSeq &ProjSeq::operator+=(const ProjSeq &rhs) { function ProjSeq (line 1069) | ProjSeq operator+(const ProjSeq &lhs, const ProjSeq &rhs) { function SepCoSet (line 1075) | SepCoSet ProjSeq::getAllConstraints(void) const { function string (line 1089) | string SepCo::toString(void) const { function string (line 1102) | string Projection::toString(void) const { function string (line 1112) | string ProjSeq::toString(void) const { FILE: cola/libdialect/constraints.h type class (line 48) | enum class function SepDir (line 55) | enum class SepDir { FILE: cola/libdialect/edges.cpp function Edge_SP (line 49) | Edge_SP Edge::allocate(const Node_SP &src, const Node_SP &tgt) { function Node_SP (line 60) | Node_SP Edge::getOtherEnd(const Node &end1) const { function BoundingBox (line 81) | BoundingBox Edge::getBoundingBox(void) const { function string (line 105) | string Edge::writeRouteTglf(void) const { function string (line 131) | string Edge::writeSvg(void) const { function string (line 154) | string Edge::writePolylineConnectorData(void) const { function string (line 167) | string Edge::writeRoundedOrthoConnectorData(void) const { FILE: cola/libdialect/expansion.cpp function ExpansionGoal_SP (line 70) | ExpansionGoal_SP ExpansionManager::addGoalInDirec(CardinalDir dir) { function ProjSeq_SP (line 186) | ProjSeq_SP ExpansionManager::extendProjSeq(ProjSeq_SP ps0) { function ContainedSegment_SP (line 231) | ContainedSegment_SP ExpansionGoal::computeContainedSegment(bool ignoreCo... function ProjSeq_SP (line 292) | ProjSeq_SP ExpansionGoal::tryExpansionRec(ProjSeq_SP ps0, std::deque PotentialAlignments; FILE: cola/libdialect/nodeconfig.cpp function Assignments (line 108) | Assignments OrthoHubLayout::getAssignmentsForNode(const Node_SP &node) c... FILE: cola/libdialect/nodeconfig.h function namespace (line 35) | namespace dialect { FILE: cola/libdialect/nodes.cpp function Node_SP (line 43) | Node_SP Node::allocate(void) { function Node_SP (line 48) | Node_SP Node::allocate(double w, double h) { function Node_SP (line 52) | Node_SP Node::allocate(double cx, double cy, double w, double h) { function GhostNode_SP (line 56) | GhostNode_SP Node::makeGhost(void) const { function dimensions (line 127) | dimensions Node::getHalfDimensions(void) const { function dimensions (line 131) | dimensions Node::getDimensions(void) const { function BoundingBox (line 139) | BoundingBox Node::getBoundingBox(void) const { function Nodes (line 160) | Nodes Node::getNeighbours(void) const { function Nodes (line 169) | Nodes Node::getNeighboursCwCyclic(void) const { function Nodes (line 181) | Nodes Node::getChildren(void) const { function Nodes (line 195) | Nodes GhostNode::getChildren(void) const { function string (line 212) | string Node::writeSvg(bool useExternalId) const { function Polygon (line 230) | Polygon Node::makeLibavoidPolygon(void) const { function Point (line 248) | Point Node::getBoundaryCompassPt(CompassDir dir) const { FILE: cola/libdialect/opts.h type class (line 32) | enum class type class (line 50) | enum class function ExpansionEstimateMethod (line 62) | enum class ExpansionEstimateMethod { FILE: cola/libdialect/ortho.cpp function CompassDir (line 52) | CompassDir Compass::compassDirection(Avoid::Point p0, Avoid::Point p1) { function CompassDir (line 69) | CompassDir Compass::compassDirection(std::shared_ptr u0, std::shar... function CardinalDir (line 75) | CardinalDir Compass::cardinalDirection(Avoid::Point p0, Avoid::Point p1) { function CardinalDir (line 85) | CardinalDir Compass::cardinalDirection(std::shared_ptr u0, std::sh... function CardinalDirs (line 91) | CardinalDirs Compass::cardinalComponents(CompassDir d) { function PlaneMap (line 104) | PlaneMap Compass::getRotationFunction(CardinalDir fromDir, CardinalDir t... function InplacePlaneMap (line 124) | InplacePlaneMap Compass::getInplaceRotationFunction(CardinalDir fromDir,... function Point (line 144) | Point Compass::vectorSigns(CompassDir d) { function CardinalDir (line 232) | CardinalDir Compass::cardRotateCw90(CardinalDir d) { function CardinalDir (line 236) | CardinalDir Compass::cardRotateAcw90(CardinalDir d) { function CardinalDir (line 240) | CardinalDir Compass::cardFlip(CardinalDir d) { function interval (line 288) | interval LineSegment::closedIntervalIntersection(double a, double b) con... function interval (line 295) | interval LineSegment::openIntervalIntersection(double a, double b) const { FILE: cola/libdialect/ortho.h function namespace (line 42) | namespace dialect { FILE: cola/libdialect/peeling.cpp function PeeledNode_SP (line 92) | PeeledNode_SP dialect::identifyRootNode(const Graph &graph) { function NodesById (line 128) | NodesById NodeBuckets::takeLeaves(void) { function Trees (line 168) | Trees dialect::peel(Graph &G) { FILE: cola/libdialect/peeling.h function namespace (line 34) | namespace dialect { type Stem (line 87) | struct Stem { type NodeBuckets (line 101) | struct NodeBuckets { FILE: cola/libdialect/planarise.cpp function NodeGroups (line 223) | NodeGroups OrthoPlanariser::computeNodeGroups(EdgeSegments segs) { function Nodes (line 285) | Nodes OrthoPlanariser::computeCrossings(void) { FILE: cola/libdialect/planarise.h function namespace (line 36) | namespace dialect { FILE: cola/libdialect/quadaction.cpp function Assignment (line 80) | Assignment Assignment::makeUnion(const Assignment &other) const { function string (line 95) | string Assignment::toString() const { function Assignment (line 134) | Assignment Quad::constructAssignmentForAction(char action) const { function Assignment_SP (line 203) | Assignment_SP Arrangement::getBasicAssignment() const { function Assignment_SP (line 209) | Assignment_SP Arrangement::getAssignmentForQuadAction(std::string quadAc... function Assignments (line 222) | Assignments Arrangement::computeNAssignments(unsigned N) const { function Assignments (line 287) | Assignments Arrangement::computeAllAssignments() const { FILE: cola/libdialect/quadaction.h function namespace (line 33) | namespace dialect { type Arrangement (line 181) | struct Arrangement { FILE: cola/libdialect/routing.cpp function CardinalDir (line 218) | CardinalDir LeaflessOrthoRouter::departureDir(const Edge_SP &e, const No... FILE: cola/libdialect/routing.h function namespace (line 40) | namespace dialect { FILE: cola/libdialect/sides.cpp function CardinalDir (line 69) | CardinalDir Side::getForwardDirec(void) const { function Node_SP (line 73) | Node_SP Side::firstNode(void) const { function Node_SP (line 78) | Node_SP Side::lastNode(void) const { function ProjSeq_SP (line 104) | ProjSeq_SP Side::computeCollateralProjSeq(TreePlacement_SP tp, double pa... function interval (line 214) | interval Side::closedInterval(void) const { function interval (line 224) | interval Side::getIntervalOppositeSegment(LineSegment &seg, bool openInt... FILE: cola/libdialect/tests/aca.cpp function main (line 50) | int main(void) { FILE: cola/libdialect/tests/assignments.cpp function main (line 41) | int main(void) { FILE: cola/libdialect/tests/bbox.cpp function main (line 38) | int main(void) { FILE: cola/libdialect/tests/bendcosts.cpp function main (line 44) | int main(void) { FILE: cola/libdialect/tests/chainconfig01.cpp function main (line 47) | int main(void) { FILE: cola/libdialect/tests/chainconfig02.cpp function main (line 46) | int main(void) { FILE: cola/libdialect/tests/chainconfig03.cpp function main (line 51) | int main(void) { FILE: cola/libdialect/tests/chainsandcycles.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/cmplayout01.cpp function main (line 34) | int main(void) { FILE: cola/libdialect/tests/collateralexpand01.cpp function nodes2ids (line 49) | vector nodes2ids(Nodes nodes) { function main (line 55) | int main(void) { FILE: cola/libdialect/tests/collateralexpand02.cpp function nodes2ids (line 49) | vector nodes2ids(Nodes nodes) { function main (line 55) | int main(void) { FILE: cola/libdialect/tests/conncomps.cpp function main (line 36) | int main(void) { FILE: cola/libdialect/tests/containedsegment01.cpp function nodes2ids (line 52) | vector nodes2ids(Nodes nodes) { function main (line 58) | int main(void) { FILE: cola/libdialect/tests/destress.cpp function main (line 36) | int main(void) { FILE: cola/libdialect/tests/destress02.cpp function main (line 36) | int main(void) { FILE: cola/libdialect/tests/destress_aca.cpp function main (line 50) | int main(void) { FILE: cola/libdialect/tests/expand01.cpp function nodes2ids (line 49) | vector nodes2ids(Nodes nodes) { function main (line 55) | int main(void) { FILE: cola/libdialect/tests/expand02.cpp function nodes2ids (line 49) | vector nodes2ids(Nodes nodes) { function main (line 55) | int main(void) { FILE: cola/libdialect/tests/expand03.cpp function main (line 50) | int main(void) { FILE: cola/libdialect/tests/expand04.cpp function main (line 51) | int main(void) { FILE: cola/libdialect/tests/expand05.cpp function main (line 51) | int main(void) { FILE: cola/libdialect/tests/expand06.cpp function main (line 52) | int main(void) { FILE: cola/libdialect/tests/expand07.cpp function main (line 52) | int main(void) { FILE: cola/libdialect/tests/expand08.cpp function main (line 51) | int main(void) { FILE: cola/libdialect/tests/expand09.cpp function main (line 51) | int main(void) { FILE: cola/libdialect/tests/extrabdrygap.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/faceset01.cpp function nodes2ids (line 45) | vector nodes2ids(Nodes nodes) { function main (line 51) | int main(void) { FILE: cola/libdialect/tests/faceset02.cpp function nodes2ids (line 48) | vector nodes2ids(Nodes nodes) { function main (line 54) | int main(void) { FILE: cola/libdialect/tests/graphs/random/makeCorpus.py function genNM (line 5) | def genNM(): FILE: cola/libdialect/tests/hola10.cpp function main (line 37) | int main(void) { FILE: cola/libdialect/tests/hola11.cpp function main (line 37) | int main(void) { FILE: cola/libdialect/tests/hola12.cpp function main (line 37) | int main(void) { FILE: cola/libdialect/tests/holaRand.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/hola_arpa.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_belnet.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_cernet.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_claranet.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_garr.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_janetlense.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_slovakia.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/hola_tree.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/holalonenode.cpp function main (line 41) | int main(void) { FILE: cola/libdialect/tests/holametro01.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/holasbgn01.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/holasbgn02.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/holasbgn03.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/holasbgn04.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/inserttrees01.cpp function main (line 50) | int main(void) { FILE: cola/libdialect/tests/leaflessroute01.cpp function main (line 42) | int main(void) { FILE: cola/libdialect/tests/leaflessroute02.cpp function addBendsToGraph (line 42) | void addBendsToGraph(NodesById bends, Graph_SP G) { function main (line 49) | int main(void) { FILE: cola/libdialect/tests/lookupqas.cpp function main (line 37) | int main(void) { FILE: cola/libdialect/tests/nbroctal.cpp function main (line 30) | int main(void) { FILE: cola/libdialect/tests/nearalign01.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/nearalign02.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/nearby.cpp function main (line 42) | int main(void) { FILE: cola/libdialect/tests/negativesepco.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/negativezero.cpp function test (line 34) | void test(string msg, bool test) { function main (line 43) | int main(void) { FILE: cola/libdialect/tests/nodeconfig01.cpp function main (line 40) | int main(void) { FILE: cola/libdialect/tests/nudgeopt.cpp function checkCoords (line 54) | vector checkCoords(Graph_SP graph) { function main (line 89) | int main(void) { FILE: cola/libdialect/tests/partition01.cpp function main (line 39) | int main() { FILE: cola/libdialect/tests/peel.cpp function main (line 44) | int main(void) { FILE: cola/libdialect/tests/planarise01.cpp function main (line 39) | int main(void) { FILE: cola/libdialect/tests/planarise02.cpp function main (line 39) | int main(void) { FILE: cola/libdialect/tests/projseq01.cpp function main (line 42) | int main(void) { FILE: cola/libdialect/tests/readconstraints.cpp function main (line 33) | int main(void) { FILE: cola/libdialect/tests/rotate01.cpp function main (line 40) | int main(void) { FILE: cola/libdialect/tests/rotate02.cpp function main (line 40) | int main(void) { FILE: cola/libdialect/tests/rotate03.cpp function main (line 40) | int main(void) { FILE: cola/libdialect/tests/rotate04.cpp function main (line 42) | int main(void) { FILE: cola/libdialect/tests/routing01.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/tests/sep_matrix_iter.cpp function main (line 100) | int main(void) { FILE: cola/libdialect/tests/solidify.cpp function main (line 43) | int main(void) { FILE: cola/libdialect/tests/symmtree.cpp function main (line 41) | int main(void) { FILE: cola/libdialect/tests/tglf01.cpp function main (line 30) | int main(void) { FILE: cola/libdialect/tests/treeboxes01.cpp function nodes2ids (line 48) | vector nodes2ids(Nodes nodes) { function main (line 54) | int main(void) { FILE: cola/libdialect/tests/treeplacement01.cpp function nodes2ids (line 48) | vector nodes2ids(Nodes nodes) { function main (line 54) | int main(void) { FILE: cola/libdialect/tests/treeplacement02.cpp function nodes2ids (line 48) | vector nodes2ids(Nodes nodes) { function main (line 54) | int main(void) { FILE: cola/libdialect/tests/treeplacement03.cpp function nodes2ids (line 48) | vector nodes2ids(Nodes nodes) { function main (line 54) | int main(void) { FILE: cola/libdialect/tests/trees.cpp function main (line 41) | int main(void) { FILE: cola/libdialect/tests/trees2.cpp function main (line 41) | int main(void) { FILE: cola/libdialect/tests/vpsc01.cpp function main (line 35) | int main(void) { FILE: cola/libdialect/treeplacement.cpp function FaceSet_SP (line 54) | FaceSet_SP dialect::reattachTrees(Graph_SP core, Trees trees, HolaOpts o... function TreePlacement_SP (line 112) | TreePlacement_SP dialect::chooseBestPlacement(TreePlacements tps, HolaOp... function Node_SP (line 218) | Node_SP TreePlacement::buildTreeBox(double padding) const { FILE: cola/libdialect/treeplacement.h function namespace (line 44) | namespace dialect { function recordBoxNode (line 132) | void recordBoxNode(Node_SP &boxNode) { m_boxNode = boxNode; } function hasBoxNode (line 135) | bool hasBoxNode(void) { return m_boxNode != nullptr; } function Node_SP (line 138) | Node_SP getBoxNode(void) { return m_boxNode; } function size (line 178) | size_t size(void) const { return m_tree->size(); } function setRootAligns (line 183) | void setRootAligns(vpsc::Dim dim, std::set &idSet) { m_rootAlig... FILE: cola/libdialect/trees.cpp function Trees (line 427) | Trees Tree::getCTrees(void) const { function Node_SP (line 581) | Node_SP Tree::buildRootlessBox(CardinalDir growthDir) const { FILE: cola/libdialect/trees.h function namespace (line 42) | namespace dialect { FILE: cola/libdialect/util.h function namespace (line 43) | namespace dialect { function string (line 64) | string string_format( const std::string& format, Args ... args ) function addObject (line 144) | void addObject(double x, double y, T obj) { function T (line 159) | T findObject(double x, double y) { FILE: cola/libproject/project.cpp type project (line 68) | namespace project { function solve (line 75) | bool solve(Variables& vs, Constraints& cs) { function compute_dfdv (line 126) | double compute_dfdv(Variable const* v, Constraint const* last) { type MaxSafeMove (line 237) | struct MaxSafeMove : unary_function { method MaxSafeMove (line 238) | MaxSafeMove(Constraint *&c, double &alpha) : c(c), alpha(alpha) { } function ostream (line 296) | ostream& operator <<(ostream &os, const Variable* &v) { function ostream (line 303) | ostream& operator <<(ostream &os, const Block &b) { function cmpLagrangians (line 349) | bool cmpLagrangians(Constraint* a,Constraint* b) { return a->lm < b->l... function ostream (line 350) | ostream& operator <<(ostream &os, const Constraints &cs) { FILE: cola/libproject/project.h function namespace (line 37) | namespace project { type vector (line 134) | typedef vector Variables; function class (line 138) | class Constraint { type list (line 178) | typedef list Blocks; function class (line 182) | class Block { type ExternalAlphaCheck (line 228) | struct ExternalAlphaCheck { type MaxSafeMove (line 233) | struct MaxSafeMove function class (line 239) | class Project : private Uncopyable { FILE: cola/libproject/project_log.h function namespace (line 38) | namespace project { function class (line 119) | class Output2FILE function FILE (line 126) | inline FILE*& Output2FILE::Stream() function Output (line 132) | inline void Output2FILE::Output(const std::string& msg) function std (line 169) | inline std::string NowTime() function std (line 187) | inline std::string NowTime() FILE: cola/libproject/tests/quadprogpp/QuadProg++.cc function solve_quadprog (line 74) | double solve_quadprog(double *G[], double g0[], int n, function compute_d (line 439) | void compute_d(double d[], double *J[], double np[], int n) function update_z (line 454) | void update_z(double z[], double *J[], double d[], int n, int iq) function update_r (line 467) | void update_r(double *R[], double r[], double d[], int n, int iq) function add_constraint (line 482) | bool add_constraint(double *R[], double *J[], double d[], int n, int& iq... function delete_constraint (line 547) | void delete_constraint(double *R[], double *J[], int A[], double u[], in... function distance (line 625) | double distance(double a, double b) function scalar_product (line 645) | double scalar_product(double *x, double *y, int n) function cholesky_decomposition (line 656) | void cholesky_decomposition(double *A[], int n) function cholesky_solve (line 686) | void cholesky_solve(double *L[], double x[], double b[], int n) function forward_elimination (line 697) | void forward_elimination(double *L[], double y[], double b[], int n) function backward_elimination (line 711) | void backward_elimination(double *U[], double x[], double y[], int n) function print_matrix (line 725) | void print_matrix(char* name, double *A[], int n) function print_rmatrix (line 743) | void print_rmatrix(char* name, double *A[], int n, int m) function print_vector (line 762) | void print_vector(char* name, double v[], int n) function print_ivector (line 778) | void print_ivector(char* name, int v[], int n) FILE: cola/libproject/tests/quadprogpp/QuadProg++.h function MatrixStorage (line 86) | struct MatrixStorage { function v (line 104) | v(v) { FILE: cola/libproject/tests/quadprogpp/main.cc function main (line 54) | int main (int argc, char *const argv[]) { FILE: cola/libproject/tests/random.cpp function randomProblem (line 52) | void randomProblem(string& name, Variables &vs, Constraints &cs) { function main (line 83) | int main() { FILE: cola/libproject/tests/simple.cpp function simple1 (line 47) | void simple1() { function simple2 (line 78) | void simple2() { function main (line 100) | int main() { FILE: cola/libproject/tests/static.cpp function t1 (line 42) | void t1(string& name, Variables &vs, Constraints &cs) { function t2 (line 54) | void t2(string& name, Variables &vs, Constraints &cs) { function t3 (line 66) | void t3(string& name, Variables& vs, Constraints &cs) { function t4 (line 81) | void t4(string& name, Variables& vs, Constraints &cs) { function t5 (line 91) | void t5(string& name, Variables& vs, Constraints &cs) { function main (line 118) | int main() { FILE: cola/libproject/tests/testutil.cpp function qps (line 61) | void qps(Variables &vs, Constraints &cs, vector &result) { function feasible (line 101) | bool feasible(Constraints &cs) { function printProblem (line 116) | void printProblem(Variables &vs, function getRand (line 145) | double getRand(const double max) { function approxEquals (line 153) | bool approxEquals(double a, double b) { function test (line 161) | void test(void (*t)(string&, Variables&, Constraints&), bool silentPass) { FILE: cola/libproject/tests/testutil.h type std (line 58) | typedef std::map VMap; FILE: cola/libproject/tests/treeqp.cpp function treeQPSolve (line 45) | void treeQPSolve(Terms &ts, EqualityConstraints &ecs, InequalityConstrai... FILE: cola/libproject/tests/treeqptest.cpp function main (line 32) | int main() { FILE: cola/libproject/util.cpp type project (line 25) | namespace project { function approx_equals (line 27) | bool approx_equals(double a, double b) { FILE: cola/libproject/util.h function namespace (line 51) | namespace project { FILE: cola/libproject/variable.h function namespace (line 22) | namespace project { FILE: cola/libtopology/cola_topology_addon.cpp type topology (line 39) | namespace topology { function reduceRange (line 130) | static void reduceRange(double& val) FILE: cola/libtopology/cola_topology_addon.h function namespace (line 34) | namespace topology { FILE: cola/libtopology/compute_forces.cpp type topology (line 37) | namespace topology { function len (line 47) | static double len(const EdgePoint* u, const EdgePoint* v, function gRule1 (line 56) | static double gRule1(vpsc::Dim dim, const EdgePoint* a, const EdgePoin... function gRule2 (line 64) | static double gRule2(vpsc::Dim dim, const EdgePoint* a, const EdgePoin... function hRuleD1 (line 79) | static double hRuleD1(vpsc::Dim dim, const EdgePoint* u, const EdgePoi... function hRuleD2 (line 89) | static double hRuleD2(vpsc::Dim dim, const EdgePoint* u, const EdgePoi... function hRule2 (line 106) | static double hRule2(vpsc::Dim dim, const EdgePoint* u, const EdgePoin... function hRule3 (line 124) | static double hRule3(vpsc::Dim dim, const EdgePoint* u, const EdgePoin... function hRule4 (line 142) | static double hRule4(vpsc::Dim dim, const EdgePoint* a, const EdgePoin... function hRule56 (line 157) | static double hRule56(vpsc::Dim dim, const EdgePoint* u, const EdgePoi... function hRule7 (line 177) | static double hRule7(vpsc::Dim dim, const EdgePoint* a, const EdgePoin... function hRule8 (line 198) | static double hRule8(vpsc::Dim dim, const EdgePoint* u, const EdgePoin... type SparseMapMap (line 227) | struct SparseMapMap { method SparseMapMap (line 229) | SparseMapMap(cola::SparseMap &H) : H(H) {} type ArrayMap (line 238) | struct ArrayMap { method ArrayMap (line 240) | ArrayMap(valarray& a) : a(a) {} FILE: cola/libtopology/orthogonal_topology.cpp type topology (line 57) | namespace topology { class CmpIndexes (line 65) | class CmpIndexes method CmpIndexes (line 68) | CmpIndexes(ConnRef *conn, size_t dim) class LayoutEdgeSegmentSeparation (line 84) | class LayoutEdgeSegmentSeparation class LayoutEdgeSegment (line 104) | class LayoutEdgeSegment : public ShiftSegment method LayoutEdgeSegment (line 108) | LayoutEdgeSegment(ConnRef *conn, const size_t low, const size_t high, method LayoutEdgeSegment (line 126) | LayoutEdgeSegment(ConnRef *conn, const size_t low, const size_t high, method Point (line 146) | Point& lowPoint(void) method Point (line 150) | Point& highPoint(void) method Point (line 154) | const Point& lowPoint(void) const method Point (line 158) | const Point& highPoint(void) const method nudgeDistance (line 162) | double nudgeDistance(void) const method immovable (line 166) | bool immovable(void) const method createSolverVariable (line 170) | void createSolverVariable(void) method overlapsWith (line 181) | bool overlapsWith(const ShiftSegment *rhs, const size_t dim) const method updatePositionsFromSolver (line 188) | void updatePositionsFromSolver(void) method fixedOrder (line 201) | int fixedOrder(bool& isFixed) const method order (line 223) | int order(void) const method zigzag (line 235) | bool zigzag(void) const method lowC (line 250) | bool lowC(void) const method highC (line 261) | bool highC(void) const class LayoutObstacle (line 275) | class LayoutObstacle method LayoutObstacle (line 278) | LayoutObstacle() method LayoutObstacle (line 284) | LayoutObstacle(ShapeRef *shape, const size_t dim) method LayoutObstacle (line 294) | LayoutObstacle(JunctionRef *junction, const size_t dim) method ShapeRef (line 306) | ShapeRef *shape(void) const method JunctionRef (line 310) | JunctionRef *junction(void) const method halfSizeInDim (line 314) | double halfSizeInDim(const size_t dim) method centreX (line 318) | double centreX(void) const method centreY (line 322) | double centreY(void) const method Point (line 326) | Point centre(void) const method Point (line 330) | Point shapeCentre(void) const method createSolverVariable (line 335) | void createSolverVariable(void) method updatePositionsFromSolver (line 345) | void updatePositionsFromSolver(void) class LayoutNode (line 374) | class LayoutNode : public Node method LayoutNode (line 377) | LayoutNode(LayoutObstacle *layObstacle, const double position) type ScanVisDirFlag (line 390) | enum ScanVisDirFlag { type PosVertInf (line 398) | struct PosVertInf method PosVertInf (line 400) | PosVertInf(double p, VertInf *vI, ScanVisDirFlags d = VisDirNone) class LineSegment (line 441) | class LineSegment method LineSegment (line 444) | LineSegment(const double& b, const double& f, const double& p, method LineSegment (line 455) | LineSegment(const double& bf, const double& p, VertInf *bfvi = nullptr) method overlaps (line 483) | bool overlaps(const LineSegment& rhs) const function insideLayoutObstacleBounds (line 522) | static bool insideLayoutObstacleBounds(const Point& point, type LayoutScanlineCmpNodePos (line 551) | struct LayoutScanlineCmpNodePos function processLayoutConstraintEvent (line 590) | static void processLayoutConstraintEvent(LayoutScanlineNodeSet& scanline, class EndpointAnchorInMoveDir (line 942) | class EndpointAnchorInMoveDir method EndpointAnchorInMoveDir (line 945) | EndpointAnchorInMoveDir(size_t dimension, ConnRef *connRef, method updatePosition (line 956) | void updatePosition(const LayoutObstacleVector& obstacleVector) function buildOrthogonalLayoutSegments (line 972) | static void buildOrthogonalLayoutSegments(Router *router, function setupOrthogonalLayoutConstraints (line 1223) | static void setupOrthogonalLayoutConstraints(Router *router, function simplifyOrthogonalRoutes (line 1576) | static void simplifyOrthogonalRoutes(Router *router) class CmpLineOrder (line 1593) | class CmpLineOrder method CmpLineOrder (line 1596) | CmpLineOrder(PtOrderMap& ord, const size_t dim) FILE: cola/libtopology/orthogonal_topology.h function namespace (line 27) | namespace topology { FILE: cola/libtopology/resize.cpp type topology (line 27) | namespace topology { function feach (line 37) | void feach(Container& c, Op op) { type TransformNode (line 49) | struct TransformNode { method TransformNode (line 50) | TransformNode(vpsc::Dim dim, const Rectangles& targets, method Node (line 58) | Node* operator() (Node* u) { type CreateLeftRightDummyNodes (line 82) | struct CreateLeftRightDummyNodes method CreateLeftRightDummyNodes (line 84) | CreateLeftRightDummyNodes(vpsc::Dim dim, const Rectangles& targets, type SubstituteNodes (line 132) | struct SubstituteNodes method SubstituteNodes (line 134) | SubstituteNodes(vpsc::Dim dim, ResizeMap& resizes, const Nodes& tn) type Pos (line 146) | enum Pos {LHS, RHS, CEN} type RevertNodes (line 183) | struct RevertNodes { method RevertNodes (line 184) | RevertNodes(Nodes& orig) type CopyPositions (line 194) | struct CopyPositions { method CopyPositions (line 195) | CopyPositions(vpsc::Dim dim, const Nodes& tn, const ResizeMap& rm) type DeleteTempNode (line 215) | struct DeleteTempNode { function approx_equals (line 222) | bool approx_equals(double a, double b) { function checkDesired (line 225) | static bool checkDesired(vpsc::Dim dim, const Nodes& nodes, function checkFinal (line 257) | static bool checkFinal(vpsc::Dim dim, const Nodes& nodes, function resizeAxis (line 297) | static void resizeAxis(vpsc::Dim dim, const Rectangles& targets, type CreateTargetRect (line 355) | struct CreateTargetRect { method CreateTargetRect (line 356) | CreateTargetRect(ResizeMap& resizes, set& fixed) : resizes... method Rectangle (line 357) | Rectangle* operator() (Node* v) { function applyResizes (line 385) | void applyResizes(Nodes& nodes, Edges& edges, RootCluster *clusters, FILE: cola/libtopology/tests/beautify.cpp function makeEdge (line 81) | void makeEdge(unsigned u, unsigned v, function random_dag (line 86) | vector random_dag(unsigned depth, unsigned maxbranch, unsigned &V, function removeoverlaps (line 132) | void removeoverlaps(vpsc::Rectangles &rs, bool bothaxes) { function makeFeasible (line 204) | void makeFeasible(vpsc::Rectangles& rs, vector& edges, function main (line 283) | int main() { FILE: cola/libtopology/tests/kamada.cpp function makeEdge (line 62) | void makeEdge(Edges& es,EdgePoints& eps) { function split (line 66) | void split() { function main (line 220) | int main() { FILE: cola/libtopology/tests/nodedragging.cpp function addToPath (line 57) | void addToPath(topology::EdgePoints& ps, topology::Node *v, topology::Ed... type Test (line 60) | struct Test : TestConvergence { method Test (line 61) | Test(const double d,const unsigned i,topology::Nodes& vs, topology::Ed... function nodeDragging (line 78) | void nodeDragging() { function main (line 129) | int main() { FILE: cola/libtopology/tests/nooverlap.cpp type Create (line 53) | struct Create { method Create (line 54) | Create() : ctr(0) {} method Node (line 55) | Node* operator() (vpsc::Rectangle* r) { function testRectangles (line 61) | void testRectangles(vpsc::Rectangles& rs) { function testCase (line 73) | void testCase() { function randomTest (line 109) | void randomTest(vpsc::Dim dim) { function main (line 157) | int main() { FILE: cola/libtopology/tests/orthogonalOpt.cpp function main (line 6) | int main(void) { FILE: cola/libtopology/tests/simple_bend.cpp function test1 (line 47) | void test1(Nodes& vs, EdgePoints& ps, cola::DesiredPositionsInDim& d, st... function test2 (line 56) | void test2(Nodes& vs, EdgePoints& ps, cola::DesiredPositionsInDim& d, st... function test3 (line 65) | void test3(Nodes& vs, EdgePoints& ps, cola::DesiredPositionsInDim& d, st... function test4 (line 74) | void test4(Nodes& vs, EdgePoints& ps, cola::DesiredPositionsInDim& d, st... function test5 (line 108) | void test5(Nodes& vs, EdgePoints& ps, cola::DesiredPositionsInDim& d, st... function simple (line 125) | void simple(void test(Nodes&, EdgePoints&, cola::DesiredPositionsInDim&,... function main (line 177) | int main() { FILE: cola/libtopology/tests/split.cpp function split (line 62) | void split() { function main (line 117) | int main() { FILE: cola/libtopology/tests/test.h function generateRandomRects (line 35) | void generateRandomRects(unsigned n, vpsc::Rectangles &rs) { type delete_node (line 60) | struct delete_node { function addToPath (line 66) | void addToPath(EdgePoints& ps, topology::Node *v, topology::EdgePoint::R... function noRectOverlaps (line 70) | void noRectOverlaps(const vpsc::Rectangles& rs) { function writeFile (line 83) | void writeFile(const topology::Nodes& vs, const Edges& es, const string&... function check (line 114) | void check(const TopologyConstraints& t, valarray& g, cola::Spar... function setVariableDesiredPositions (line 127) | void setVariableDesiredPositions(vpsc::Variables& vs, const cola::Desire... function dotProd (line 143) | inline double dotProd(valarray x, valarray y) { function computeStepSize (line 151) | double computeStepSize( FILE: cola/libtopology/tests/triangle.cpp type TestCase (line 62) | struct TestCase { method TestCase (line 71) | TestCase() : dim(vpsc::HORIZONTAL), iterations(10) { } method run (line 73) | void run() { method setGradient (line 108) | void setGradient(double* gradient) { method Node (line 115) | Node* addNode(double x, double y, double w, double h) { method addEdge (line 122) | void addEdge(double idealLength) { method addDesired (line 127) | void addDesired(unsigned vid, double pos) { method addToPath (line 130) | void addToPath(unsigned vid, topology::EdgePoint::RectIntersect i) { function case1 (line 134) | void case1(TestCase& t) { function case2 (line 150) | void case2(TestCase& t) { function case3 (line 167) | void case3(TestCase& t) { function case4 (line 184) | void case4(TestCase& t) { function case5 (line 203) | void case5(TestCase& t) { function triangle (line 224) | void triangle(void tcase(TestCase&)) { function main (line 231) | int main() { FILE: cola/libtopology/topology_constraints.cpp type topology (line 30) | namespace topology { function ostream (line 91) | ostream& operator<< (ostream& os, const TriConstraint& c) { function string (line 127) | string BendConstraint::toString() const { type transferStraightConstraintChoose (line 146) | struct transferStraightConstraintChoose { method transferStraightConstraintChoose (line 154) | transferStraightConstraintChoose(Segment* target1, Segment* target2, function sameCorner (line 206) | bool sameCorner(const EdgePoint* a, const EdgePoint* b) { function zigzag (line 213) | bool zigzag(const EdgePoint* a, const Segment* s) { function zagzig (line 220) | bool zagzig(const EdgePoint* a, const Segment* s) { function string (line 280) | string StraightConstraint:: type buildRoute (line 286) | struct buildRoute { method buildRoute (line 287) | buildRoute(straightener::Route* r, unsigned& n) : r(r), n(n) {} type PrintEdgePoint (line 302) | struct PrintEdgePoint { type ComputeStress (line 394) | struct ComputeStress { function computeStress (line 411) | double computeStress(const Edges& es) { FILE: cola/libtopology/topology_constraints.h function namespace (line 36) | namespace vpsc { function namespace (line 42) | namespace cola { function class (line 60) | class TriConstraint { function class (line 124) | class BendConstraint : public TopologyConstraint { function class (line 142) | class StraightConstraint : public TopologyConstraint { type ResizeInfo (line 220) | struct ResizeInfo { FILE: cola/libtopology/topology_constraints_constructor.cpp type topology (line 42) | namespace topology { type SegmentOpen (line 43) | struct SegmentOpen method SegmentOpen (line 210) | SegmentOpen(vpsc::Dim dim, Segment *s) method process (line 216) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 222) | string toString() { type NodeOpen (line 44) | struct NodeOpen method NodeOpen (line 93) | NodeOpen(vpsc::Dim dim, Node *node) method process (line 98) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 125) | string toString() { type Event (line 52) | struct Event { method Event (line 58) | Event(bool open, double pos) : open(open), pos(pos), scanDim(vpsc::U... type NodeEvent (line 71) | struct NodeEvent : Event { method NodeEvent (line 73) | NodeEvent(bool open, double pos, Node *v) type NodeOpen (line 90) | struct NodeOpen : NodeEvent { method NodeOpen (line 93) | NodeOpen(vpsc::Dim dim, Node *node) method process (line 98) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 125) | string toString() { type NodeClose (line 137) | struct NodeClose : NodeEvent { method NodeClose (line 143) | NodeClose(vpsc::Dim dim, Node* node, NodeOpen* o, vpsc::Constraints&... method createNonOverlapConstraint (line 151) | void createNonOverlapConstraint(const Node* left, const Node* right) method process (line 169) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 190) | string toString() { type SegmentEvent (line 199) | struct SegmentEvent : Event { method SegmentEvent (line 201) | SegmentEvent(vpsc::Dim dim, bool open, EdgePoint* v, Segment *s) type SegmentOpen (line 207) | struct SegmentOpen : SegmentEvent { method SegmentOpen (line 210) | SegmentOpen(vpsc::Dim dim, Segment *s) method process (line 216) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 222) | string toString() { type SegmentClose (line 231) | struct SegmentClose : SegmentEvent { method SegmentClose (line 234) | SegmentClose(vpsc::Dim dim, Segment *s, SegmentOpen* so) method process (line 240) | void process(OpenNodes& openNodes, OpenSegments& openSegments) method string (line 248) | string toString() { type CompareEvents (line 288) | struct CompareEvents { type CreateBendConstraints (line 492) | struct CreateBendConstraints method CreateBendConstraints (line 494) | CreateBendConstraints(vpsc::Dim dim) type CreateSegmentEvents (line 503) | struct CreateSegmentEvents method CreateSegmentEvents (line 505) | CreateSegmentEvents(vector& events, vpsc::Dim dim) type GetVariable (line 545) | struct GetVariable { function getVariables (line 550) | void getVariables(Nodes& ns, vpsc::Variables& vs) { function validTurn (line 555) | inline bool validTurn(EdgePoint* u, EdgePoint* v, EdgePoint* w) { type PruneDegenerate (line 571) | struct PruneDegenerate { method PruneDegenerate (line 572) | PruneDegenerate(vpsc::Dim dim, list& pruneList) function recCreateTopologyClusterNodes (line 605) | static void recCreateTopologyClusterNodes(cola::Cluster *cluster, FILE: cola/libtopology/topology_graph.cpp type topology (line 38) | namespace topology { function setNodeVariables (line 40) | void setNodeVariables(Nodes& ns, std::vector& vs) { function Segment (line 83) | Segment* EdgePoint::prune(vpsc::Dim scanDim) { function normalise (line 190) | inline void normalise(double& x, double& y) { type copyEdgePointsToRoute (line 357) | struct copyEdgePointsToRoute { method copyEdgePointsToRoute (line 358) | copyEdgePointsToRoute(straightener::Route* r) : x(r->xs), y(r->ys) {} type accumulateLength (line 370) | struct accumulateLength { method accumulateLength (line 371) | accumulateLength(double& a) : a(a) {} type PointToString (line 386) | struct PointToString { method PointToString (line 387) | PointToString(stringstream& ss) : ss(ss) {} type SegmentToString (line 393) | struct SegmentToString { method SegmentToString (line 394) | SegmentToString(stringstream& ss) : ss(ss) {} function string (line 400) | string Segment::toString() const { function string (line 406) | string Edge::toString() const { type buildPath (line 413) | struct buildPath { method buildPath (line 414) | buildPath(ConstEdgePoints& vs) : vs(vs) {} function assertConvexBends (line 428) | bool assertConvexBends(const Edges& es) { type NoIntersection (line 433) | struct NoIntersection { method NoIntersection (line 434) | NoIntersection(const Nodes& vs) : vs(vs) {} function assertNoSegmentRectIntersection (line 476) | bool assertNoSegmentRectIntersection( function assertNoZeroLengthEdgeSegments (line 483) | bool assertNoZeroLengthEdgeSegments(const Edges& es) { function printEdges (line 489) | void printEdges(const Edges& es) { FILE: cola/libtopology/topology_graph.h function namespace (line 36) | namespace vpsc { function namespace (line 39) | namespace straightener { function namespace (line 42) | namespace topology { function pathLength (line 504) | double pathLength() const; type std (line 531) | typedef std::vector Edges; function crossProduct (line 539) | inline double crossProduct( FILE: cola/libtopology/topology_log.h function namespace (line 36) | namespace topology { function class (line 123) | class Output2FILE function FILE (line 130) | inline FILE*& Output2FILE::Stream() function Output (line 136) | inline void Output2FILE::Output(const std::string& msg) function std (line 178) | inline std::string NowTime() function std (line 196) | inline std::string NowTime() FILE: cola/libtopology/util.h function namespace (line 22) | namespace topology { FILE: cola/libvpsc/assertions.h function namespace (line 61) | namespace vpsc { FILE: cola/libvpsc/block.cpp type vpsc (line 46) | namespace vpsc { function Block (line 140) | Block* Block::merge(Block* b, Constraint* c) { function Constraint (line 215) | Constraint *Block::findMinInConstraint() { function Constraint (line 264) | Constraint *Block::findMinOutConstraint() { function Constraint (line 486) | Constraint *Block::findMinLM() { function Constraint (line 497) | Constraint *Block::findMinLMBetween(Variable* const lv, Variable* cons... function Constraint (line 590) | Constraint* Block::splitBetween(Variable* const vl, Variable* const vr, FILE: cola/libvpsc/block.h function namespace (line 36) | namespace vpsc { FILE: cola/libvpsc/blocks.cpp type vpsc (line 49) | namespace vpsc { FILE: cola/libvpsc/blocks.h function class (line 54) | class Blocks FILE: cola/libvpsc/cbuffer.cpp type vpsc (line 29) | namespace vpsc { function Constraint (line 66) | Constraint* CBuffer::mostViolated() { FILE: cola/libvpsc/cbuffer.h function namespace (line 27) | namespace vpsc { FILE: cola/libvpsc/constraint.cpp type vpsc (line 34) | namespace vpsc { class EqualityConstraintSet (line 117) | class EqualityConstraintSet method EqualityConstraintSet (line 120) | EqualityConstraintSet(Variables vs) method isRedundant (line 129) | bool isRedundant(Variable *lhs, Variable *rhs, double sep) method mergeSets (line 146) | void mergeSets(Variable *lhs, Variable *rhs, double sep) method setForVar (line 172) | VarOffsetMapList::iterator setForVar(Variable *var) function Constraints (line 188) | Constraints constraintsRemovingRedundantEqualities(const Variables& vars, FILE: cola/libvpsc/constraint.h function namespace (line 36) | namespace vpsc { FILE: cola/libvpsc/exceptions.h function namespace (line 25) | namespace vpsc { FILE: cola/libvpsc/linesegment.h function namespace (line 34) | namespace linesegment { FILE: cola/libvpsc/pairing_heap.h function class (line 42) | class Underflow { } function T (line 97) | const T & findMin( ) const; function makeEmpty (line 104) | void makeEmpty() { FILE: cola/libvpsc/rectangle.cpp type vpsc (line 43) | namespace vpsc { function Rectangle (line 81) | Rectangle Rectangle::unionWith(const Rectangle& rhs) const type Node (line 110) | struct Node method Node (line 121) | Node(Variable *v, Rectangle *r, double p) method addLeftNeighbour (line 133) | void addLeftNeighbour(Node *u) { method addRightNeighbour (line 137) | void addRightNeighbour(Node *u) { method setNeighbours (line 141) | void setNeighbours(NodeSet *left, NodeSet *right) { type CmpNodePos (line 111) | struct CmpNodePos { bool operator()(const Node* u, const Node* v) cons... type Node (line 115) | struct Node { method Node (line 121) | Node(Variable *v, Rectangle *r, double p) method addLeftNeighbour (line 133) | void addLeftNeighbour(Node *u) { method addRightNeighbour (line 137) | void addRightNeighbour(Node *u) { method setNeighbours (line 141) | void setNeighbours(NodeSet *left, NodeSet *right) { function NodeSet (line 166) | NodeSet* getLeftNeighbours(NodeSet &scanline,Node *v) { function NodeSet (line 181) | NodeSet* getRightNeighbours(NodeSet &scanline,Node *v) { type Event (line 198) | struct Event { method Event (line 202) | Event(EventType t, Node *v, double p) : type(t),v(v),pos(p) {} function compare_events (line 204) | int compare_events(const void *a, const void *b) { function generateXConstraints (line 232) | void generateXConstraints(const Rectangles& rs, const Variables& vars, function generateYConstraints (line 322) | void generateYConstraints(const Rectangles& rs, const Variables& vars, function checkIntersection (line 392) | inline bool checkIntersection( function eq (line 442) | inline bool eq(double a, double b) { function removeoverlaps (line 563) | void removeoverlaps(Rectangles& rs) { function removeoverlaps (line 582) | void removeoverlaps(Rectangles& rs, const set& fixed, bool t... function noRectangleOverlaps (line 665) | bool noRectangleOverlaps(const Rectangles& rs) FILE: cola/libvpsc/rectangle.h function namespace (line 38) | namespace vpsc { type std (line 248) | typedef std::vector Rectangles; type std (line 253) | typedef std::vector Variables; type std (line 255) | typedef std::vector Constraints; type delete_object (line 297) | struct delete_object FILE: cola/libvpsc/solve_VPSC.cpp type vpsc (line 44) | namespace vpsc { function Constraint (line 400) | Constraint* IncSolver::mostViolated(Constraints &l) type node (line 451) | struct node { FILE: cola/libvpsc/solve_VPSC.h function namespace (line 42) | namespace vpsc { FILE: cola/libvpsc/tests/block.cpp function test1 (line 37) | void test1() { function test2 (line 63) | void test2() { function main (line 101) | int main() { FILE: cola/libvpsc/tests/cycle.cpp function approxEquals (line 36) | inline bool approxEquals(const double a, const double b) { function test1 (line 39) | void test1() { function test2 (line 71) | void test2() { function main (line 103) | int main() { FILE: cola/libvpsc/tests/rectangleoverlap.cpp function getRand (line 38) | inline double getRand(double range) { function printRects (line 41) | void printRects(vector &rs) { function generateRandomRects (line 47) | void generateRandomRects(unsigned n, vector &rs) { function test (line 73) | void test(vector &rs, double &cost, double &duration) { function main (line 615) | int main() { FILE: cola/libvpsc/tests/satisfy_inc.cpp function getRand (line 39) | static inline double getRand(const int range) { function approxEquals (line 42) | inline bool approxEquals(const double a, const double b) { function checkResult (line 47) | bool checkResult(unsigned n, Variable *a[], unsigned m, Constraint *c[],... function dumpMatlabProblem (line 81) | void dumpMatlabProblem(unsigned n, Variable *a[], unsigned m, Constraint... function test1 (line 105) | void test1() { function test1a (line 125) | void test1a() { function test1b (line 145) | void test1b() { function test1c (line 165) | void test1c() { function test2 (line 193) | void test2() { function test3 (line 216) | void test3() { function test4 (line 251) | void test4() { function test5 (line 287) | void test5() { function test6 (line 311) | void test6() { function test7 (line 334) | void test7() { function test8 (line 357) | void test8() { function test9 (line 399) | void test9() { function test10 (line 438) | void test10() { function test11 (line 469) | void test11() { function test12 (line 499) | void test12() { function test13 (line 529) | void test13() { function rand_test (line 564) | void rand_test(unsigned n, unsigned m) { function main (line 642) | int main() { FILE: cola/libvpsc/variable.cpp type vpsc (line 23) | namespace vpsc { FILE: cola/libvpsc/variable.h function namespace (line 31) | namespace vpsc { type std (line 92) | typedef std::vector Variables; FILE: experimental/RectangleOverlapSolver/placement/ActiveSetPlacement.java class ActiveSetPlacement (line 9) | public class ActiveSetPlacement extends Observable implements Placement { method addConstraint (line 30) | public Constraint addConstraint(String u, String v, double sep) { method satisfyConstraints (line 46) | void satisfyConstraints() { method ActiveSetPlacement (line 57) | public ActiveSetPlacement(Variable[] vs) { method refine (line 69) | protected double refine() { method solve (line 94) | public double solve() { method animate (line 112) | void animate() { method getConstraints (line 125) | public Constraints getConstraints() { method getVariables (line 129) | public Variables getVariables() { FILE: experimental/RectangleOverlapSolver/placement/Block.java class Block (line 20) | public class Block { method Block (line 46) | Block() { method Block (line 55) | Block(Variable v) { method merge (line 73) | void merge(Block b, Constraint c, double distance) { method findMinLM (line 91) | Constraint findMinLM() { method canFollowLeft (line 101) | private boolean canFollowLeft(Constraint c, Variable last) { method canFollowRight (line 105) | private boolean canFollowRight(Constraint c, Variable last) { method resetActiveLM (line 112) | private void resetActiveLM(Variable v, Variable u) { method compute_dfdv (line 132) | private double compute_dfdv(Variable v, Variable u) { method desiredPosition (line 162) | double desiredPosition() { method split (line 178) | void split(Constraint splitConstraint, Block l, Block r) { method populateSplitBlock (line 189) | private void populateSplitBlock(Block b, Variable v, Variable u) { method addVariable (line 203) | private void addVariable(Variable v) { method setUpInConstraints (line 211) | public void setUpInConstraints() { method setUpOutConstraints (line 223) | public void setUpOutConstraints() { method toString (line 234) | public String toString() { method cost (line 242) | public double cost() { method findMaxInConstraint (line 251) | Constraint findMaxInConstraint() { method findMaxOutConstraint (line 284) | Constraint findMaxOutConstraint() { method mergeInConstraints (line 293) | public void mergeInConstraints(Block b) { method mergeOutConstraints (line 301) | public void mergeOutConstraints(Block b) { FILE: experimental/RectangleOverlapSolver/placement/Blocks.java class Blocks (line 21) | class Blocks extends HashSet { method splitOnce (line 34) | Constraint splitOnce(ActiveSetPlacement debug) { method mergeLeft (line 70) | synchronized void mergeLeft(Block b, ActiveSetPlacement debug) { method mergeRight (line 108) | synchronized void mergeRight(Block b, ActiveSetPlacement debug) { method Blocks (line 139) | Blocks(Variable[] vars) { method cost (line 146) | double cost() { method getAllVariables (line 154) | Variables getAllVariables() { method toString (line 162) | public String toString() { method dfsVisit (line 179) | private void dfsVisit(Variable v, LinkedList order) { method totalOrder (line 192) | public LinkedList totalOrder() { method totalOrderDFS (line 200) | private LinkedList totalOrderDFS() { method totalOrderBFS (line 216) | private LinkedList totalOrderBFS() { FILE: experimental/RectangleOverlapSolver/placement/Constraint.java class Constraint (line 22) | public class Constraint implements Comparable { method Constraint (line 36) | Constraint(Variable left, Variable right, double separation) { method isViolated (line 44) | boolean isViolated() { method violatedAmount (line 51) | double violatedAmount() { method slack (line 55) | double slack() { method toString (line 59) | public String toString() { method neighbour (line 69) | public Variable neighbour(Variable v) { method sameContainers (line 81) | public boolean sameContainers(Constraint c) { method delete (line 94) | public void delete() { method isTight (line 99) | public boolean isTight() { method compareTo (line 118) | public int compareTo(Constraint c) { FILE: experimental/RectangleOverlapSolver/placement/ConstraintGenerator.java class ConstraintGenerator (line 9) | public class ConstraintGenerator { method initVarsAndConstraints (line 18) | void initVarsAndConstraints(Chunk[] chunks, boolean allOverlaps) { method initVarsAndConstraintsComplete (line 38) | void initVarsAndConstraintsComplete() { method getLeftNeighbours (line 67) | ArrayList getLeftNeighbours(TreeSet scanLine, Chunk v) { method getRightNeighbours (line 84) | ArrayList getRightNeighbours(TreeSet scanLine, Chunk v) { method initVarsAndConstraintsMinimal (line 101) | void initVarsAndConstraintsMinimal() { method initVarsAndConstraintsMinimalOld (line 160) | void initVarsAndConstraintsMinimalOld() { method addOrthogonalOrderingConstraints (line 227) | void addOrthogonalOrderingConstraints() { method needConstraint (line 249) | boolean needConstraint(Chunk l, Chunk r, boolean all) { method ConstraintGenerator (line 263) | public ConstraintGenerator(boolean completeConstraints, boolean neighb... method getConstraints (line 269) | public Constraints getConstraints() { method getChunks (line 273) | public Chunk[] getChunks() { class Chunk (line 279) | abstract class Chunk { method getMax (line 295) | abstract double getMax(); method getMin (line 297) | abstract double getMin(); method setMin (line 299) | abstract void setMin(double d); method setCentre (line 300) | void setCentre(double d) { method getCentre (line 303) | double getCentre() { method getLength (line 306) | abstract double getLength(); method Chunk (line 308) | Chunk(RectangleView r) { method Chunk (line 312) | Chunk(RectangleView r, T conjugate) { method addLeftNeighbour (line 317) | void addLeftNeighbour(Chunk n) { method addRightNeighbour (line 323) | void addRightNeighbour(Chunk n) { method setNeighbours (line 329) | void setNeighbours(ArrayList leftv, ArrayList rightv) { method overlap (line 340) | double overlap(Chunk b) { method conjugateOverlap (line 349) | double conjugateOverlap(Chunk c) { method compare (line 361) | public int compare(Chunk a, Chunk b) { method compare (line 383) | public int compare(Chunk a, Chunk b) { method toString (line 404) | public String toString() { class YChunk (line 409) | class YChunk extends Chunk { method YChunk (line 412) | YChunk(RectangleView r, XChunk conjugate) { method YChunk (line 416) | YChunk(RectangleView r) { method getMax (line 420) | public double getMax() { method getMin (line 424) | public double getMin() { method getLength (line 428) | public double getLength() { method setMin (line 432) | void setMin(double min) { class XChunk (line 437) | class XChunk extends Chunk { method XChunk (line 440) | XChunk(RectangleView r, YChunk conjugate) { method XChunk (line 444) | XChunk(RectangleView r) { method getMax (line 448) | public double getMax() { method getMin (line 452) | public double getMin() { method getLength (line 456) | public double getLength() { method setMin (line 460) | void setMin(double min) { class ChunkEdge (line 466) | class ChunkEdge implements Comparable { method ChunkEdge (line 473) | ChunkEdge(Chunk c, boolean s, double p) { method compareTo (line 479) | public int compareTo(ChunkEdge arg) { FILE: experimental/RectangleOverlapSolver/placement/Constraints.java class Constraints (line 20) | class Constraints extends ArrayList { method Constraints (line 21) | public Constraints(Constraints inConstraints) { method Constraints (line 24) | public Constraints() { method getActive (line 28) | Constraints getActive(Variable a, Variable b) { method removeViolated (line 43) | Constraints removeViolated() { method getActive (line 62) | Constraints getActive(Block a, Block b) { method max (line 72) | Constraint max() { method violated (line 85) | Constraints violated() { method getActive (line 99) | public Constraints getActive() { FILE: experimental/RectangleOverlapSolver/placement/DebugFrame.java class DebugFrame (line 5) | public class DebugFrame extends JFrame { method DebugFrame (line 12) | DebugFrame(Blocks blocks, Constraints constraints) { method animate (line 28) | void animate() { FILE: experimental/RectangleOverlapSolver/placement/DebugPanel.java class DebugPanel (line 18) | public class DebugPanel extends JPanel { type Direction (line 21) | public enum Direction { method DebugPanel (line 29) | public DebugPanel(Blocks blocks, Constraints constraints) { method paintComponent (line 37) | public void paintComponent(Graphics g) { method createBackBuffer (line 73) | private void createBackBuffer() { method render (line 78) | public void render(Graphics gOld) { method hRender (line 97) | private void hRender(Graphics2D g, Variables allVars) { method vRender (line 145) | private void vRender(Graphics2D g, Variables allVars) { method drawArrow (line 209) | private void drawArrow(Graphics2D g, int x, int y, int X, int Y, int s... method updateDrawing (line 239) | public void updateDrawing() { FILE: experimental/RectangleOverlapSolver/placement/DrawingDimensions.java class DrawingDimensions (line 9) | class DrawingDimensions { method DrawingDimensions (line 17) | public DrawingDimensions(double scale, double xmin, double ymin) { method toScreen (line 23) | Point toScreen(double x, double y) { method toScreen (line 31) | public Point toScreen(Point2D p) { FILE: experimental/RectangleOverlapSolver/placement/FSA.java class FSA (line 8) | public class FSA implements RectanglePlacement { class Vec (line 9) | class Vec { method FSA (line 15) | FSA(double xgap, double ygap) { method force (line 22) | Vec force(Rectangle2D vi, Rectangle2D vj) { method force2 (line 44) | Vec force2(Rectangle2D vi, Rectangle2D vj) { method compare (line 65) | public int compare(Rectangle2D u, Rectangle2D v) { method horizontal (line 76) | void horizontal() { method horizontalImproved (line 112) | double horizontalImproved() { method compare (line 185) | public int compare(Rectangle2D u, Rectangle2D v) { method vertical (line 197) | void vertical() { method verticalImproved (line 233) | double verticalImproved() { method place (line 306) | public void place(ArrayList rs) { FILE: experimental/RectangleOverlapSolver/placement/GUITest.java class GUITest (line 12) | public class GUITest extends TestCase { method makeRect (line 26) | RectangleView makeRect(String label, int x, int X, int y, int Y) { method makeRect (line 32) | RectangleView makeRect(String label, double x, double X, double y, dou... method setUp (line 40) | protected void setUp() { method suite (line 43) | public static Test suite() { method testCase1 (line 47) | public void testCase1() { method testCase2 (line 60) | public void testCase2() { method testCase3 (line 74) | public void testCase3() { method testCase4 (line 88) | public void testCase4() { method testCase5 (line 109) | public void testCase5() { method testCase6 (line 122) | public void testCase6() { method testCase7 (line 136) | public void testCase7() { method testCase8 (line 157) | public void testCase8() { method testRandom (line 269) | public void testRandom() { method runOverlapRemover (line 274) | private void runOverlapRemover() { method main (line 308) | public static void main(String[] args) { FILE: experimental/RectangleOverlapSolver/placement/Graph.java class Edge (line 10) | class Edge { method Edge (line 15) | Edge(Node start, Node end) { class Node (line 21) | class Node { method Node (line 28) | Node(String id, int x, int y, int w, int h) { method addEdge (line 34) | void addEdge(Edge e) { method getPos (line 38) | public Point2D.Double getPos() { class Graph (line 45) | public class Graph { method getRectangles (line 52) | public ArrayList getRectangles() { method restoreRectangles (line 61) | public void restoreRectangles(ArrayList rs) { method getRectangleLabel (line 71) | public String getRectangleLabel(Rectangle2D r) { method getLines (line 80) | public ArrayList getLines() { method addNode (line 88) | public void addNode(String id, int x, int y, int w, int h) { method addEdge (line 92) | public void addEdge(String id1, String id2) { FILE: experimental/RectangleOverlapSolver/placement/GraphParser.java class GraphParser (line 15) | public class GraphParser { method GraphParser (line 18) | GraphParser(String fileName) { method match (line 67) | private String match(Pattern p, String s) { method match (line 71) | private String match(Pattern p, String s, int group) { method getGraph (line 80) | public Graph getGraph() { FILE: experimental/RectangleOverlapSolver/placement/GraphParserTest.java class GraphParserTest (line 5) | public class GraphParserTest extends TestCase { method testGraph1 (line 6) | public void testGraph1(){ FILE: experimental/RectangleOverlapSolver/placement/MaxPairingHeap.java class MaxPairingHeap (line 14) | public class MaxPairingHeap implements method MaxPairingHeap (line 21) | public MaxPairingHeap() { method MaxPairingHeap (line 28) | public MaxPairingHeap(MaxPairingHeap h1, MaxPairingHeap h2) { method add (line 45) | public void add(T x) { method add (line 50) | public void add(PNode p) { method findMax (line 63) | public T findMax() { method deleteMax (line 74) | public T deleteMax() { method increaseKey (line 98) | public void increaseKey(PNode p, T newVal) { method isEmpty (line 120) | public boolean isEmpty() { method makeEmpty (line 127) | public void makeEmpty() { method compareAndLink (line 145) | private PNode compareAndLink(PNode first, PNode second) { method doubleIfFull (line 174) | private PNode[] doubleIfFull(PNode[] array, int index) { method combineSiblings (line 191) | private PNode combineSiblings(PNode firstSibling) { method getAll (line 227) | public ArrayList getAll() { method toString (line 247) | public String toString() { method main (line 271) | public static void main(String args[]) { method merge (line 297) | public void merge(MaxPriorityQueue b) { method size (line 307) | public int size() { FILE: experimental/RectangleOverlapSolver/placement/MaxPriorityQueue.java type MaxPriorityQueue (line 5) | public interface MaxPriorityQueue { method add (line 6) | public void add(T e); method findMax (line 7) | public T findMax(); method deleteMax (line 8) | public T deleteMax(); method merge (line 9) | public void merge(MaxPriorityQueue other); method getAll (line 10) | public ArrayList getAll(); method size (line 11) | public int size(); FILE: experimental/RectangleOverlapSolver/placement/MinPairingHeap.java class MinPairingHeap (line 10) | public class MinPairingHeap { method MinPairingHeap (line 15) | public MinPairingHeap() { method insert (line 27) | public PNode insert(T x) { method findMin (line 42) | public T findMin() { method deleteMin (line 53) | public T deleteMin() { method decreaseKey (line 76) | public void decreaseKey(PNode p, T newVal) { method isEmpty (line 98) | public boolean isEmpty() { method makeEmpty (line 105) | public void makeEmpty() { method compareAndLink (line 122) | private PNode compareAndLink(PNode first, PNode second) { method doubleIfFull (line 149) | private PNode[] doubleIfFull(PNode[] array, int index) { method combineSiblings (line 166) | private PNode combineSiblings(PNode firstSibling) { method main (line 201) | public static void main(String args[]) { FILE: experimental/RectangleOverlapSolver/placement/MosekPlacement.java class msgclass (line 9) | class msgclass extends mosek.Stream { method msgclass (line 10) | public msgclass() { method print (line 14) | public void print(String msg) { class MosekPlacement (line 19) | public class MosekPlacement implements Placement { method addConstraint (line 31) | public Constraint addConstraint(String u, String v, double sep) { method MosekPlacement (line 39) | public MosekPlacement(Variable[] vs) { method MosekPlacement (line 47) | public MosekPlacement(Variables vs, Constraints cs) { method solve (line 57) | public double solve() throws Exception { method getCost (line 116) | public double getCost() { method getConstraints (line 125) | public Constraints getConstraints() { method getVariables (line 129) | public Variables getVariables() { FILE: experimental/RectangleOverlapSolver/placement/NativeFSA.java class NativeFSA (line 6) | public class NativeFSA implements RectanglePlacement { method NativeFSA (line 9) | NativeFSA(double xgap, double ygap) { method place (line 13) | public native double place(double x[], method place (line 20) | public void place(ArrayList rs) { FILE: experimental/RectangleOverlapSolver/placement/PNode.java class PNode (line 3) | public class PNode { method PNode (line 10) | PNode(S theElement) { FILE: experimental/RectangleOverlapSolver/placement/PerformanceTest.java class Result (line 19) | class Result { method writeToFile (line 26) | void writeToFile() { method toString (line 39) | public String toString() { method writeHeader (line 47) | public void writeHeader() { class Cost (line 65) | class Cost { method hdr (line 72) | public String hdr() { method toString (line 75) | public String toString() { class PerformanceTest (line 81) | public class PerformanceTest { method PerformanceTest (line 83) | PerformanceTest() { method main (line 139) | public static void main(String[] args) { method copyRects (line 143) | private ArrayList copyRects(ArrayList orig) { method run (line 152) | private Cost run(RectanglePlacement p, ArrayList orig, St... method finalize (line 176) | @Override method run (line 182) | private Cost run(RectanglePlacement p, ArrayList orig, Ar... method generateRandom (line 209) | static ArrayList generateRandom(Result result, double w, FILE: experimental/RectangleOverlapSolver/placement/Placement.java type Placement (line 3) | public interface Placement { method addConstraint (line 5) | public abstract Constraint addConstraint(String u, String v, double sep); method solve (line 7) | public abstract double solve() throws Exception; method getConstraints (line 9) | public abstract Constraints getConstraints(); method getVariables (line 10) | public abstract Variables getVariables(); FILE: experimental/RectangleOverlapSolver/placement/PlacementTest.java class PlacementTest (line 16) | public class PlacementTest extends TestCase { method PlacementTest (line 32) | public PlacementTest(String arg0) { method run (line 36) | private void run(Placement p, double expected) throws Exception { method acceptableCost (line 46) | boolean acceptableCost(double cost, double expected) { method testPairingHeap (line 53) | public void testPairingHeap() throws Exception { class HeapNode (line 136) | class HeapNode implements Comparable { method HeapNode (line 141) | HeapNode(int k) { method toString (line 144) | public String toString() { method compareTo (line 147) | public int compareTo(HeapNode o) { method testPairingHeap2 (line 163) | public void testPairingHeap2() throws Exception { method testPairingHeap3 (line 213) | public void testPairingHeap3() throws Exception { method testPlacement1 (line 249) | public void testPlacement1() throws Exception { method testPlacement1a (line 262) | public void testPlacement1a() throws Exception { method testPlacement2 (line 275) | public void testPlacement2() throws Exception { method testPlacement3 (line 297) | public void testPlacement3() throws Exception { method testPlacement4 (line 314) | public void testPlacement4() throws Exception { method testPlacement5 (line 327) | public void testPlacement5() throws Exception { method testPlacement6 (line 343) | public void testPlacement6() throws Exception { method testPlacement7 (line 353) | public void testPlacement7() throws Exception { method testPlacement8 (line 379) | public void testPlacement8() throws Exception { method testPlacement9 (line 398) | public void testPlacement9() throws Exception { method testPlacement10 (line 413) | public void testPlacement10() throws Exception { FILE: experimental/RectangleOverlapSolver/placement/QPRectanglePlacement.java class QPRectanglePlacement (line 8) | public class QPRectanglePlacement extends Observable implements type Algorithm (line 15) | enum Algorithm { method QPRectanglePlacement (line 31) | public QPRectanglePlacement(boolean split, boolean completeConstraints, method placeX (line 43) | void placeX(ArrayList rectangles) { method replaceX (line 65) | void replaceX(ArrayList rectangles) { method place (line 86) | public void place(ArrayList rectangles) { method placeNative (line 106) | void placeNative(ArrayList rectangles) { method placeY (line 113) | void placeY(ArrayList rectangles) { method placement (line 133) | double placement() { method addObserver (line 180) | public void addObserver(Observer o) { method update (line 184) | public void update(Observable arg0, Object arg1) { FILE: experimental/RectangleOverlapSolver/placement/RectangleDrawerFrame.java class RectangleDrawerFrame (line 36) | public class RectangleDrawerFrame extends JFrame { type Algorithm (line 38) | enum Algorithm { method RectangleDrawerFrame (line 42) | public RectangleDrawerFrame(String title) { method main (line 62) | public static void main(String args[]) { method init (line 73) | public void init() { method cleanup (line 317) | public void cleanup(int xGap, int yGap) { FILE: experimental/RectangleOverlapSolver/placement/RectangleDrawerPanel.java class BlocksFileFilter (line 40) | class BlocksFileFilter extends FileFilter { method accept (line 43) | public boolean accept(File file) { method getDescription (line 48) | public String getDescription() { class RectangleDrawerPanel (line 53) | public class RectangleDrawerPanel extends JPanel implements Printable, type InteractionMode (line 55) | enum InteractionMode { method generateRandom (line 79) | public void generateRandom(int n) { method generateRandom (line 88) | protected void generateRandom(int n, Random rand, double w, double h) { method fitToScreen (line 113) | DrawingDimensions fitToScreen() { method load (line 134) | protected void load(File f) { method save (line 169) | protected File save(String path) { method backup (line 200) | protected void backup() { method undo (line 208) | protected void undo() { method getFileFilter (line 218) | protected BlocksFileFilter getFileFilter() { method RectangleDrawerPanel (line 225) | public RectangleDrawerPanel() { method clear (line 231) | public void clear() { method paintComponent (line 240) | public void paintComponent(Graphics g) { method createBackBuffer (line 278) | private void createBackBuffer() { method render (line 283) | public void render(int width, int height, Graphics2D g) { method setUpDrawingGraphics (line 304) | private void setUpDrawingGraphics() { method mousePressed (line 313) | public void mousePressed(MouseEvent evt) { method drawConstraints (line 344) | public void drawConstraints(Graphics2D g) { method mouseReleased (line 371) | public void mouseReleased(MouseEvent evt) { method mouseDragged (line 393) | public void mouseDragged(MouseEvent evt) { method mouseEntered (line 419) | public void mouseEntered(MouseEvent evt) { method mouseExited (line 422) | public void mouseExited(MouseEvent evt) { method mouseClicked (line 425) | public void mouseClicked(MouseEvent evt) { method mouseMoved (line 428) | public void mouseMoved(MouseEvent evt) { method update (line 436) | public void update(Observable p, Object arg1) { method print (line 442) | public int print(Graphics g, PageFormat pf, int pi) throws PrinterExce... method saveAsJPEG (line 465) | public void saveAsJPEG(String filename) { method setInteractionMode (line 481) | public void setInteractionMode(InteractionMode interactionMode) { method getInteractionMode (line 485) | public InteractionMode getInteractionMode() { FILE: experimental/RectangleOverlapSolver/placement/RectanglePlacement.java type RectanglePlacement (line 5) | public interface RectanglePlacement { method place (line 6) | void place(ArrayList rectangles); FILE: experimental/RectangleOverlapSolver/placement/RectangleView.java class RectangleView (line 11) | public class RectangleView implements Serializable { method RectangleView (line 22) | RectangleView(String label, double x, double y, double w, double h) { method RectangleView (line 30) | public RectangleView(RectangleView r) { method draw (line 35) | public void draw(Graphics2D g, DrawingDimensions dim) { method draw (line 42) | public void draw(Graphics2D g, int x, int y, int w, int h) { method draw (line 46) | private void draw(Graphics2D g, Point p, double w, double h) { method moveTo (line 66) | public void moveTo(double x, double y) { method getMaxY (line 71) | public double getMaxY() { method getMaxX (line 75) | public double getMaxX() { FILE: experimental/RectangleOverlapSolver/placement/ScanListPriorityQueue.java class ScanListPriorityQueue (line 6) | public class ScanListPriorityQueue implements method add (line 12) | public void add(T e) { method findMax (line 17) | public T findMax() { method deleteMax (line 33) | public T deleteMax() { method merge (line 40) | public void merge(MaxPriorityQueue other) { method toString (line 46) | public String toString() { method getAll (line 54) | public ArrayList getAll() { method size (line 58) | public int size() { FILE: experimental/RectangleOverlapSolver/placement/SimpleTest.java class SimpleTest (line 7) | public class SimpleTest { method main (line 12) | public static void main(String[] args) { FILE: experimental/RectangleOverlapSolver/placement/SlowPriorityQueue.java class SlowPriorityQueue (line 7) | public class SlowPriorityQueue implements MaxPrior... method compare (line 10) | public int compare(T a, T b) { method add (line 16) | public void add(T e) { method findMax (line 20) | public T findMax() { method deleteMax (line 24) | public T deleteMax() { method merge (line 28) | public void merge(MaxPriorityQueue other) { method toString (line 32) | public String toString() { method getAll (line 40) | public ArrayList getAll() { method size (line 48) | public int size() { FILE: experimental/RectangleOverlapSolver/placement/SolveVPSC.java class SolveVPSC (line 6) | public class SolveVPSC implements Placement { method solve (line 7) | public native double solve(String vName[], double vWeight[], method generateXConstraints (line 10) | public native int generateXConstraints( method generateYConstraints (line 14) | public native int generateYConstraints( method getConstraints (line 18) | public native void getConstraints(int cLeft[], int cRight[], double cG... method removeOverlaps (line 19) | public native void removeOverlaps( method addConstraint (line 42) | public Constraint addConstraint(String u, String v, double sep) { method SolveVPSC (line 50) | public SolveVPSC(ArrayList rectangles) { method SolveVPSC (line 53) | public SolveVPSC(Variable[] vs) { method SolveVPSC (line 64) | public SolveVPSC(Variables vars, Constraints constraints) { method solve (line 73) | public double solve() throws Exception { method generateXConstraints (line 106) | public void generateXConstraints(double weights[]) { method generateYConstraints (line 129) | public void generateYConstraints(double weights[]) { method getConstraints (line 153) | public Constraints getConstraints() { method getVariables (line 157) | public Variables getVariables() { method removeOverlaps (line 160) | public void removeOverlaps() { FILE: experimental/RectangleOverlapSolver/placement/Variable.java class Variable (line 19) | public class Variable { method Variable (line 36) | Variable(String name, double desiredPosition, double weight) { method getPosition (line 44) | double getPosition() { method toString (line 51) | public String toString() { method addInConstraint (line 56) | public void addInConstraint(Constraint c) { method addOutConstraint (line 60) | public void addOutConstraint(Constraint c) { method getInConstraints (line 65) | public Constraints getInConstraints() { method getOutConstraints (line 69) | public Constraints getOutConstraints() { FILE: experimental/RectangleOverlapSolver/placement/Variables.java class Variables (line 17) | public class Variables extends ArrayList { method Variables (line 18) | Variables() { method Variables (line 22) | Variables(Variable[] vs) { method getSources (line 28) | Variables getSources() { method getMaxPos (line 39) | double getMaxPos() { method getMinPos (line 48) | double getMinPos() { method contains (line 57) | boolean contains(String label) { method sortOnConstraintDepth (line 69) | void sortOnConstraintDepth() { method max (line 82) | public Variable max() { method min (line 96) | public Variable min() { FILE: experimental/draw-bn/asia.cpp function parse_numbers (line 13) | bool function construct_graph (line 28) | void FILE: experimental/draw-bn/draw-bn.cpp function streq (line 30) | inline bool class Node (line 36) | class Node{ method draw (line 46) | void draw(cairo_t* cr, vpsc::Rectangle* r) { method set_minimum_bounds (line 73) | void set_minimum_bounds(cairo_t* cr) { method Node (line 94) | Node(char const* name) : title(name) { method Node (line 99) | Node(vpsc::Rectangle* r) : position(r) {} function cairo_surface_t (line 104) | static cairo_surface_t * function main (line 132) | int main(int argc, char** argv) { FILE: experimental/draw-bn/graphlayouttest.cpp function output_svg (line 16) | void output_svg(vector& rs, vector& es, char *fname, b... function output_svg (line 33) | void output_svg(vector& rs, vector& es,... function output_svg (line 90) | void output_svg(vector& rs, vector& es, char *fname, b... function output_svg (line 202) | void output_svg(vector& rs, vector& es, char *fname, b... FILE: experimental/draw-bn/graphlayouttest.h function getRand (line 7) | inline double getRand(double range) { FILE: experimental/neatogen/adjust.c function setBoundBox (line 49) | static void setBoundBox(Point * ll, Point * ur) function freeNodes (line 64) | static void freeNodes(void) function chkBoundBox (line 86) | static void chkBoundBox(Agraph_t * graph) function makeInfo (line 143) | static void makeInfo(Agraph_t * graph) function scomp (line 174) | static int scomp(const void *S1, const void *S2) function sortSites (line 194) | static void sortSites(void) function geomUpdate (line 222) | static void geomUpdate(int doSort) function Site (line 245) | static Site *nextOne(void) function rmEquality (line 260) | static void rmEquality(void) function countOverlap (line 316) | static int countOverlap(int iter) function increaseBoundBox (line 345) | static void increaseBoundBox(void) function areaOf (line 369) | static double areaOf(Point a, Point b, Point c) function centroidOf (line 384) | static void centroidOf(Point a, Point b, Point c, double *x, double *y) function newpos (line 396) | static void newpos(Info_t * ip) function addCorners (line 427) | static void addCorners(void) function newPos (line 480) | static void newPos(void) function cleanup (line 501) | static void cleanup(void) function vAdjust (line 509) | static int vAdjust(void) function rePos (line 570) | static double rePos(Point c) function sAdjust (line 586) | static int sAdjust(void) function updateGraph (line 624) | static void updateGraph(Agraph_t * graph) function normalize (line 644) | void normalize(graph_t * g) type adjust_data (line 681) | typedef struct { function adjust_data (line 710) | static adjust_data *getAdjustMode(char *s) function removeOverlapAs (line 729) | int function removeOverlap (line 810) | int function adjustNodes (line 820) | int adjustNodes(graph_t * G) function expFactor (line 831) | double FILE: experimental/neatogen/adjust.h type adjust_mode (line 26) | typedef enum { FILE: experimental/neatogen/bfs.c function bfs (line 30) | void bfs(int vertex, vtx_data * graph, int n, DistType * dist, Queue * Q) function bfs_bounded (line 76) | int function mkQueue (line 125) | void mkQueue(Queue * qp, int size) function Queue (line 132) | Queue *newQueue(int size) function freeQueue (line 139) | void freeQueue(Queue * qp) function delQueue (line 144) | void delQueue(Queue * qp) function initQueue (line 150) | void initQueue(Queue * qp, int startVertex) function deQueue (line 157) | bool deQueue(Queue * qp, int *vertex) function enQueue (line 165) | bool enQueue(Queue * qp, int vertex) FILE: experimental/neatogen/bfs.h function class (line 27) | class Queue { function initQueue (line 41) | void initQueue(int startVertex) { function dequeue (line 47) | bool dequeue(int &vertex) { function enqueue (line 57) | bool enqueue(int vertex) { type Queue (line 72) | typedef struct { FILE: experimental/neatogen/circuit.c function solveCircuit (line 25) | int solveCircuit(int nG, double **Gm, double **Gm_inv) function circuit_model (line 44) | int circuit_model(graph_t * g, int nG) FILE: experimental/neatogen/closest.c type Pair (line 29) | typedef struct { type PairStack (line 48) | typedef struct { function initStack (line 54) | static void initStack(PairStack * s, int n) function freeStack (line 61) | static void freeStack(PairStack * s) type PairHeap (line 83) | typedef struct { function heapify (line 103) | static void heapify(PairHeap * h, int i) function mkHeap (line 124) | static void mkHeap(PairHeap * h, int size) function freeHeap (line 132) | static void freeHeap(PairHeap * h) function initHeap (line 137) | static void initHeap(PairHeap * h, double *place, int *ordering, int n) function extractMax (line 165) | static bool extractMax(PairHeap * h, Pair * max) function insert (line 177) | static void insert(PairHeap * h, Pair edge) function find_closest_pairs (line 208) | static void function add_edge (line 287) | static void add_edge(vtx_data * graph, int u, int v) function construct_graph (line 305) | static void function closest_pairs2graph (line 356) | void FILE: experimental/neatogen/compute_hierarchy.c function compute_hierarchy (line 49) | double FILE: experimental/neatogen/conjgrad.c function conjugate_gradient (line 28) | void conjugate_gradient function conjugate_gradient_f (line 96) | void conjugate_gradient_f function conjugate_gradient_mkernel (line 161) | void FILE: experimental/neatogen/constrained_majorization.c function stress_majorization_with_hierarchy (line 38) | int FILE: experimental/neatogen/constrained_majorization_vsep.c function stress_majorization_vsep (line 36) | int FILE: experimental/neatogen/constraint.c type nitem (line 29) | typedef struct nitem { function cmpitem (line 42) | static int cmpitem(Dt_t * d, int *p1, int *p2, Dtdisc_t * disc) function distY (line 62) | static int distY(box * b1, box * b2) function distX (line 67) | static int distX(box * b1, box * b2) function intersectX0 (line 78) | static int intersectX0(nitem * p, nitem * q) function intersectY0 (line 100) | static int intersectY0(nitem * p, nitem * q) function intersectY (line 116) | static int intersectY(nitem * p, nitem * q) function intersectX (line 121) | static int intersectX(nitem * p, nitem * q) function mapGraphs (line 128) | static void mapGraphs(graph_t * g, graph_t * cg, distfn dist) function indegree (line 160) | static int function outdegree (line 169) | static int function validate (line 178) | static void function node_t (line 205) | static node_t *newNode(graph_t * g) function graph_t (line 223) | static graph_t *mkNConstraintG(graph_t * g, Dt_t * list, function graph_t (line 296) | static graph_t *mkConstraintG(graph_t * g, Dt_t * list, function closeGraph (line 441) | static void closeGraph(graph_t * cg) function constrainX (line 456) | static void constrainX(graph_t* g, nitem* nlist, int nnodes, intersectfn... function constrainY (line 494) | static void constrainY(graph_t* g, nitem* nlist, int nnodes, intersectfn... function overlaps (line 552) | static int overlaps(nitem * p, int cnt) function initItem (line 572) | static void initItem(node_t * n, nitem * p, double margin) function cAdjust (line 624) | int cAdjust(graph_t * g, int mode) type info (line 690) | typedef struct { function sortf (line 700) | static int sortf(pointf * p, pointf * q) function compress (line 714) | static double compress(info * nl, int nn) function pointf (line 750) | static pointf *mkOverlapSet(info * nl, int nn, int *cntp) function pointf (line 794) | static pointf computeScaleXY(pointf * aarr, int m) function computeScale (line 832) | static double computeScale(pointf * aarr, int m) function scAdjust (line 859) | int scAdjust(graph_t * g, int equal) FILE: experimental/neatogen/defs.h type Style (line 27) | enum Style { regular, invisible } type vtx_data (line 28) | struct vtx_data { type cluster_data (line 36) | struct cluster_data { type DistType (line 46) | typedef int DistType; function max (line 48) | inline double max(double x, double y) { function min (line 53) | inline double min(double x, double y) { function max (line 60) | inline int max(int x, int y) { function min (line 67) | inline int min(int x, int y) { type Point (line 74) | struct Point { type Style (line 90) | typedef enum { regular, invisible } Style; type vtx_data (line 92) | typedef struct { type cluster_data (line 106) | typedef struct cluster_data { type DistType (line 117) | typedef int DistType; type Point (line 120) | typedef struct { FILE: experimental/neatogen/digcola.h type vsep_options (line 29) | typedef struct vsep_options { FILE: experimental/neatogen/dijkstra.c type DistType (line 35) | typedef DistType Word; type heap (line 57) | typedef struct { function heapify (line 62) | static void heapify(heap * h, int i, int index[], Word dist[]) function mkHeap (line 88) | static void mkHeap(heap * h, int size) function freeHeap (line 95) | static void freeHeap(heap * h) function initHeap (line 100) | static void function extractMax (line 121) | static bool extractMax(heap * h, int *max, int index[], Word dist[]) function increaseKey (line 135) | static void function dijkstra (line 158) | void dijkstra(int vertex, vtx_data * graph, int n, DistType * dist) function dijkstra_bounded (line 202) | int function heapify_f (line 282) | static void heapify_f(heap * h, int i, int index[], float dist[]) function initHeap_f (line 303) | static void function extractMax_f (line 322) | static bool extractMax_f(heap * h, int *max, int index[], float dist[]) function increaseKey_f (line 336) | static void function dijkstra_f (line 363) | void dijkstra_f(int vertex, vtx_data * graph, int n, float *dist) FILE: experimental/neatogen/edges.c function edgeinit (line 29) | void edgeinit() function Edge (line 35) | Edge *bisect(Site * s1, Site * s2) function doSeg (line 74) | static void doSeg(Edge * e, double x1, double y1, double x2, double y2) function clip_line (line 82) | void clip_line(Edge * e) function endpoint (line 202) | void endpoint(Edge * e, int lr, Site * s) FILE: experimental/neatogen/edges.h type Edge (line 28) | typedef struct Edge { FILE: experimental/neatogen/embed_graph.c function embed_graph (line 35) | void embed_graph(vtx_data * graph, int n, int dim, DistType *** Coords, function center_coordinate (line 113) | void center_coordinate(DistType ** coords, int n, int dim) FILE: experimental/neatogen/find_ints.c type vertex (line 23) | struct vertex type vertex (line 24) | struct vertex type intersection (line 25) | struct intersection type data (line 25) | struct data type vertex (line 26) | struct vertex type vertex (line 26) | struct vertex function find_ints (line 28) | void function gt (line 113) | static int gt(struct vertex **i, struct vertex **j) FILE: experimental/neatogen/geometry.c function geominit (line 30) | void geominit() function dist_2 (line 40) | double dist_2(Point * pp, Point * qp) function subPt (line 48) | void subPt(Point * a, Point b, Point c) function addPt (line 54) | void addPt(Point * c, Point a, Point b) function area_2 (line 60) | double area_2(Point a, Point b, Point c) function leftOf (line 65) | int leftOf(Point a, Point b, Point c) function intersection (line 70) | int intersection(Point a, Point b, Point c, Point d, Point * p) FILE: experimental/neatogen/geometry.h type Point (line 26) | typedef struct Point { FILE: experimental/neatogen/heap.c function PQbucket (line 31) | static int PQbucket(Halfedge * he) function PQinsert (line 48) | void PQinsert(Halfedge * he, Site * v, double offset) function PQdelete (line 67) | void PQdelete(Halfedge * he) function PQempty (line 83) | int PQempty(void) function Point (line 89) | Point PQ_min(void) function Halfedge (line 101) | Halfedge *PQextractmin(void) function PQcleanup (line 111) | void PQcleanup(void) function PQinitialize (line 117) | void PQinitialize(void) function PQdumphe (line 130) | static void PQdumphe(Halfedge * p) function PQdump (line 138) | void PQdump(void) FILE: experimental/neatogen/hedges.c function ELcleanup (line 31) | void ELcleanup() function ELinitialize (line 38) | void ELinitialize() function Site (line 59) | Site *hintersect(Halfedge * el1, Halfedge * el2) function right_of (line 103) | int right_of(Halfedge * el, Point * p) function Halfedge (line 150) | Halfedge *HEcreate(Edge * e, char pm) function ELinsert (line 163) | void ELinsert(Halfedge * lb, Halfedge * new) function Halfedge (line 172) | static Halfedge *ELgethash(int b) function Halfedge (line 189) | Halfedge *ELleftbnd(Point * p) function ELdelete (line 235) | void ELdelete(Halfedge * he) function Halfedge (line 243) | Halfedge *ELright(Halfedge * he) function Halfedge (line 248) | Halfedge *ELleft(Halfedge * he) function Site (line 254) | Site *leftreg(Halfedge * he) function Site (line 261) | Site *rightreg(Halfedge * he) FILE: experimental/neatogen/hedges.h type Halfedge (line 29) | typedef struct Halfedge { FILE: experimental/neatogen/info.c function infoinit (line 26) | void infoinit() function compare (line 40) | static int compare(Point * o, PtItem * p, PtItem * q) function printV (line 117) | static void printV(PtItem * vp) function error (line 130) | static void error(Info_t * ip, Site * s, double x, double y) function sorted (line 140) | static int sorted(Point * origin, PtItem * vp) function addVertex (line 164) | void addVertex(Site * s, double x, double y) FILE: experimental/neatogen/info.h type PtItem (line 30) | typedef struct ptitem { /* Point list */ type Info_t (line 35) | typedef struct { /* Info concerning site */ FILE: experimental/neatogen/intersect.c function sgnarea (line 23) | static void sgnarea(struct vertex *l, struct vertex *m, int i[]) function between (line 42) | static int between(double f, double g, double h) function online (line 50) | static int online(struct vertex *l, struct vertex *m, int i) function intpoint (line 64) | static int intpoint(struct vertex *l, struct vertex *m, double *x, doubl... function find_intersection (line 131) | void find_intersection(struct vertex *l, FILE: experimental/neatogen/kkutils.c function common_neighbors (line 24) | int common_neighbors(vtx_data * graph, int v, int u, int *v_vector) function fill_neighbors_vec_unweighted (line 39) | void fill_neighbors_vec_unweighted(vtx_data * graph, int vtx, int *vtx_vec) function empty_neighbors_vec (line 49) | void empty_neighbors_vec(vtx_data * graph, int vtx, int *vtx_vec) function DistType (line 62) | static DistType **compute_apsp_dijkstra(vtx_data * graph, int n) function DistType (line 79) | static DistType **compute_apsp_simple(vtx_data * graph, int n) function DistType (line 100) | DistType **compute_apsp(vtx_data * graph, int n) function DistType (line 108) | DistType **compute_apsp_artifical_weights(vtx_data * graph, int n) function split_by_place (line 129) | static void function distance_kD (line 168) | double distance_kD(double **coords, int dim, int i, int j) function fcmpf (line 181) | static int function quicksort_placef (line 191) | void quicksort_placef(float *place, int *ordering, int first, int last) function quicksort_place (line 204) | void quicksort_place(double *place, int *ordering, int first, int last) function compute_new_weights (line 218) | void compute_new_weights(vtx_data * graph, int n) function restore_old_weights (line 255) | void restore_old_weights(vtx_data * graph, int n, float *old_weights) FILE: experimental/neatogen/kkutils.h function distance_kD (line 30) | inline double distance_kD(double **coords, int dim, int i, int j) { FILE: experimental/neatogen/legal.c type vertex (line 22) | struct vertex type polygon (line 23) | struct polygon type data (line 24) | struct data type intersection (line 24) | struct intersection function Plegal_arrangement (line 25) | int Plegal_arrangement(Ppoly_t ** polys, int n_polys) FILE: experimental/neatogen/lu.c function lu_decompose (line 70) | int lu_decompose(double **a, int n) function lu_solve (line 145) | void lu_solve(double *x, double *b, int n) FILE: experimental/neatogen/matinv.c function matinv (line 49) | int matinv(double **A, double **Ainv, int n) FILE: experimental/neatogen/matrix_ops.c function power_iteration (line 25) | bool function mult_dense_mat (line 143) | void function mult_dense_mat_d (line 179) | void function mult_sparse_dense_mat_transpose (line 215) | void function cpvec (line 260) | void cpvec(double *copy, int beg, int end, double *vec) function dot (line 272) | double dot(double *vec1, int beg, int end, double *vec2) function scadd (line 288) | void scadd(double *vec1, int beg, int end, double fac, double *vec2) function vecscale (line 300) | void vecscale(double *vec1, int beg, int end, double alpha, double *vec2) function norm (line 312) | double norm(double *vec, int beg, int end) function orthog1 (line 321) | void orthog1(int n, double *vec /* vector to be orthogonalized against 1 */ function init_vec_orth1 (line 343) | void init_vec_orth1(int n, double *vec) function right_mult_with_vector (line 355) | void function right_mult_with_vector_f (line 372) | void function vectors_subtraction (line 389) | void function vectors_addition (line 400) | void function vectors_mult_addition (line 411) | void function vectors_scalar_mult (line 423) | void function copy_vector (line 433) | void copy_vector(int n, double *source, double *dest) function vectors_inner_product (line 441) | double vectors_inner_product(int n, double *vector1, double *vector2) function max_abs (line 453) | double max_abs(int n, double *vector) function orthogvec (line 466) | void orthogvec(int n, double *vec1, /* vector to be orthogonalized */ function mat_mult_vec (line 483) | void mat_mult_vec(vtx_data * L, int n, double *vec, double *result) function right_mult_with_vector_transpose (line 504) | void function right_mult_with_vector_d (line 522) | void function orthog1f (line 546) | void orthog1f(int n, float *vec) function right_mult_with_vectorf (line 566) | void right_mult_with_vectorf function right_mult_with_vector_fd (line 580) | void right_mult_with_vector_fd function right_mult_with_vector_ff (line 595) | void right_mult_with_vector_ff function vectors_substractionf (line 620) | void function vectors_additionf (line 630) | void function vectors_mult_additionf (line 640) | void function vectors_scalar_multf (line 650) | void vectors_scalar_multf(int n, float *vector, float alpha, float *result) function copy_vectorf (line 659) | void copy_vectorf(int n, float *source, float *dest) function vectors_inner_productf (line 667) | double vectors_inner_productf(int n, float *vector1, float *vector2) function set_vector_val (line 679) | void set_vector_val(int n, double val, double *result) function set_vector_valf (line 687) | void set_vector_valf(int n, float val, float * result) { function max_absf (line 694) | double max_absf(int n, float *vector) function square_vec (line 706) | void square_vec(int n, float *vec) function invert_vec (line 715) | void invert_vec(int n, float *vec) function sqrt_vec (line 726) | void sqrt_vec(int n, float *vec) function sqrt_vecf (line 735) | void sqrt_vecf(int n, float *source, float *target) function invert_sqrt_vec (line 746) | void invert_sqrt_vec(int n, float *vec) function init_vec_orth1f (line 758) | void init_vec_orth1f(int n, float *vec) function mat_mult_vecf (line 773) | void mat_mult_vecf(vtx_data * L, int n, float *vec, float *result) FILE: experimental/neatogen/mem.h type Freelist (line 32) | typedef struct freelist { FILE: experimental/neatogen/memory.c type Freenode (line 20) | typedef struct freenode { type Freeblock (line 24) | typedef struct freeblock { function gcd (line 33) | static int gcd(int y, int x) function freeinit (line 46) | void freeinit(Freelist * fl, int size) function makefree (line 89) | void makefree(void *curr, Freelist * fl) FILE: experimental/neatogen/mosek_quad_solve.c function printstr (line 14) | static void MSKAPI printstr(void *handle, char str[]) function MosekEnv (line 33) | MosekEnv* mosek_init_hier( function mosek_quad_solve_hier (line 251) | void mosek_quad_solve_hier(MosekEnv *mskEnv, float *b,int n,float* coord... function MosekEnv (line 306) | MosekEnv* mosek_init_sep( function mosek_quad_solve_sep (line 432) | void mosek_quad_solve_sep(MosekEnv *mskEnv,int n, float *b,float* coords) { function mosek_delete (line 466) | void mosek_delete(MosekEnv *mskEnv) { FILE: experimental/neatogen/mosek_quad_solve.h type MosekEnv (line 9) | typedef struct { FILE: experimental/neatogen/neatoinit.c function neato_nodesize (line 46) | void neato_nodesize(node_t * n, bool flip) function neato_init_node (line 55) | void neato_init_node(node_t * n) function neato_init_edge (line 62) | void neato_init_edge(edge_t * e) function user_pos (line 69) | int user_pos(attrsym_t * posptr, attrsym_t * pinptr, node_t * np, int nG) function neato_init_node_edge (line 127) | void neato_init_node_edge(graph_t * g) function neato_cleanup_node (line 147) | void neato_cleanup_node(node_t * n) function neato_free_splines (line 157) | void neato_free_splines(edge_t * e) function neato_cleanup_edge (line 169) | void neato_cleanup_edge(edge_t * e) function neato_cleanup_graph (line 176) | void neato_cleanup_graph(graph_t * g) function neato_cleanup (line 183) | void neato_cleanup(graph_t * g) function numFields (line 197) | static int numFields(unsigned char *pos) function set_elabel (line 214) | static void set_elabel(edge_t * e, textlabel_t * l, char *name) function cluster_data (line 228) | static cluster_data* cluster_map(graph_t *mastergraph, graph_t *g) { function freeClusterData (line 290) | static void freeClusterData(cluster_data *c) { function user_spline (line 305) | static int user_spline(attrsym_t * E_pos, edge_t * e) type pos_edge (line 404) | typedef enum { NoEdges, SomeEdges, AllEdges } pos_edge; function pos_edge (line 411) | static pos_edge nop_init_edges(Agraph_t * g) function chkBB (line 443) | static int chkBB(Agraph_t * g, attrsym_t * G_bb) function add_cluster (line 456) | static void add_cluster(Agraph_t * g, Agraph_t * subg) function dfs (line 470) | static void function nop_init_graphs (line 493) | static void function translateE (line 521) | static void translateE(edge_t * e, point offset) function translateG (line 562) | static void translateG(Agraph_t * g, point offset) function translate (line 582) | static void translate(Agraph_t * g, pos_edge posEdges) function init_nop (line 611) | int init_nop(Agraph_t * g, int adjust) function neato_init_graphn (line 664) | void neato_init_graphn(Agraph_t * g, int dfltdim) function neato_init_graph (line 671) | void neato_init_graph(Agraph_t * g) function neatoModel (line 676) | static int neatoModel(graph_t * g) function neatoMode (line 699) | static int neatoMode(graph_t * g) function checkEdge (line 728) | static int checkEdge(PointMap * pm, edge_t * ep, int idx) function dfsCycle (line 746) | static void function acyclic (line 776) | static void function vtx_data (line 815) | static vtx_data *makeGraphData(graph_t * g, int nv, int *nedges, int mod... function freeGraphData (line 964) | static void freeGraphData(vtx_data * graph) function initRegular (line 983) | static void initRegular(graph_t * G, int nG) function checkStart (line 1017) | int checkStart(graph_t * G, int nG, int dflt) function dumpData (line 1065) | void dumpData(graph_t * g, vtx_data * gp, int nv, int ne) function majorization (line 1096) | static void function subset_model (line 1222) | static void subset_model(Agraph_t * G, int nG) function kkNeato (line 1243) | static void kkNeato(Agraph_t * g, int nG, int model) function neatoLayout (line 1274) | void neatoLayout(Agraph_t * mg, Agraph_t * g, int layoutMode, int layout... function addZ (line 1300) | static void function neato_layout (line 1316) | void neato_layout(Agraph_t * g) FILE: experimental/neatogen/neatosplines.c function spline_merge (line 36) | static bool spline_merge(node_t * n) function swap_ends_p (line 41) | static bool swap_ends_p(edge_t * e) function make_barriers (line 48) | static void function Ppoint_t (line 86) | static Ppoint_t recPt(double x, double y, point c, double sep) function makePortLabels (line 95) | static void makePortLabels(edge_t * e) function endPoints (line 111) | static void endPoints(splines * spl, point * p, point * q) function addEdgeLabels (line 140) | static void addEdgeLabels(edge_t * e, point rp, point rq) type edgeinfo (line 195) | typedef struct { type edgeitem (line 201) | typedef struct { function freeitem (line 220) | static void freeitem(Dt_t * d, edgeitem * obj, Dtdisc_t * disc) function cmpitems (line 225) | static int function edge_t (line 267) | static edge_t *equivEdge(Dt_t * map, edge_t * e) function makeSelfArcs (line 316) | void makeSelfArcs(path * P, edge_t * e, int stepx) function makeStraightEdge (line 345) | static void makeStraightEdge(graph_t * g, edge_t * e) function Ppoly_t (line 427) | Ppoly_t *makeObstacle(node_t * n, double SEP) function Ppolyline_t (line 495) | Ppolyline_t function makeSpline (line 537) | void makeSpline(edge_t * e, Ppoly_t ** obs, int npoly, bool chkPts) function _spline_edges (line 591) | static int _spline_edges(graph_t * g, double SEP, int splines) function splineEdges (line 687) | int function spline_edges1 (line 728) | int spline_edges1(graph_t * g, int splines) function spline_edges0 (line 747) | void spline_edges0(graph_t * g) function spline_edges (line 762) | void spline_edges(graph_t * g) function scaleEdge (line 784) | static void scaleEdge(edge_t * e, double xf, double yf) function scaleBB (line 826) | static void scaleBB(graph_t * g, double xf, double yf) function _neato_set_aspect (line 848) | static void _neato_set_aspect(graph_t * g) function neato_set_aspect (line 932) | void neato_set_aspect(graph_t * g) FILE: experimental/neatogen/opt_arrangement.c function construct_b (line 19) | static void function compute_y_coords (line 46) | void FILE: experimental/neatogen/pca.c function PCA_alloc (line 27) | void function iterativePCA_1D (line 81) | bool function dist (line 111) | double dist(double **coords, int dim, int p1, int p2) function weight_laplacian (line 125) | void weight_laplacian(double **X, int n, int dim, vtx_data * laplacian) FILE: experimental/neatogen/poly.c function polyFree (line 38) | void polyFree() function breakPoly (line 49) | void breakPoly(Poly * pp) function bbox (line 54) | static void bbox(Point * verts, int cnt, Point * o, Point * c) function inflate (line 79) | static void inflate(Point * prev, Point * cur, Point * next, double margin) function inflatePts (line 92) | static void inflatePts(Point * verts, int cnt, double margin) function inflatePts (line 118) | static void inflatePts(Point * verts, int cnt, double margin) function isBox (line 132) | static int isBox(Point * verts, int cnt) function Point (line 148) | static Point makeScaledPoint(int x, int y) function Point (line 156) | static Point *genRound(Agnode_t * n, int *sidep) function makePoly (line 180) | void makePoly(Poly * pp, Agnode_t * n, double margin) function pintersect (line 260) | static int function edgesIntersect (line 273) | static int edgesIntersect(Point * P, Point * Q, int n, int m) function inPoly (line 328) | static int inPoly(Point vertex[], int n, Point q) function inBox (line 385) | static int inBox(Point p, Point origin, Point corner) function transCopy (line 392) | static void transCopy(Point * inp, int cnt, Point off, Point * outp) function polyOverlap (line 404) | int polyOverlap(Point p, Poly * pp, Point q, Poly * qp) FILE: experimental/neatogen/poly.h type Poly (line 28) | typedef struct { FILE: experimental/neatogen/printvis.c type Ppoint_t (line 19) | typedef Ppoint_t point; function printvis (line 22) | void printvis(vconfig_t * cp) FILE: experimental/neatogen/quad_prog_solve.c function ensureMonotonicOrdering (line 49) | static void function ensureMonotonicOrderingWithGaps (line 65) | static void function computeHierarchyBoundaries (line 100) | static void function constrained_majorization_new (line 111) | int function compare_incr (line 393) | static int compare_incr(const void *a, const void *b) { function constrained_majorization_gradient_projection (line 405) | int constrained_majorization_gradient_projection(CMajEnv *e, function constrained_majorization_new_with_gaps (line 566) | int function deleteCMajEnv (line 906) | void function CMajEnv (line 923) | CMajEnv* FILE: experimental/neatogen/quad_prog_solver.h type CMajEnv (line 23) | typedef struct { FILE: experimental/neatogen/quad_prog_vpsc.c function constrained_majorization_vpsc (line 31) | int function CMajEnvVPSC (line 154) | CMajEnvVPSC* function deleteCMajEnvVPSC (line 282) | void function generateNonoverlapConstraints (line 320) | void generateNonoverlapConstraints( function removeoverlaps (line 502) | void removeoverlaps(int n,float** coords, vsep_options* opt) { function DigColaLevel (line 521) | DigColaLevel* assign_digcola_levels(int *ordering, int n, int *level_ind... function delete_digcola_levels (line 548) | void delete_digcola_levels(DigColaLevel *l, int num_levels) { function print_digcola_levels (line 555) | void print_digcola_levels(FILE *logfile, DigColaLevel *levels, int num_l... function get_num_digcola_constraints (line 570) | int get_num_digcola_constraints(DigColaLevel *levels, int num_levels) { FILE: experimental/neatogen/quad_prog_vpsc.h type CMajEnvVPSC (line 22) | typedef struct CMajEnvVPSC { type DigColaLevel (line 59) | typedef struct { FILE: experimental/neatogen/simple.h type position (line 34) | struct position { type vertex (line 39) | struct vertex { type polygon (line 45) | struct polygon { type intersection (line 49) | struct intersection { type active_edge (line 55) | struct active_edge { type active_edge_list (line 59) | struct active_edge_list { type data (line 63) | struct data { FILE: experimental/neatogen/site.c function siteinit (line 28) | void siteinit() function Site (line 39) | Site *getsite() function dist (line 44) | double dist(Site * s, Site * t) function makevertex (line 56) | void makevertex(Site * v) function deref (line 66) | void deref(Site * v) function ref (line 73) | void ref(Site * v) FILE: experimental/neatogen/site.h type Site (line 29) | typedef struct Site { FILE: experimental/neatogen/smart_ini_x.c function standardize (line 20) | static void function mat_mult_vec_orthog (line 38) | static void function power_iteration_orthog (line 59) | static void function CMDS_orthog (line 223) | static void function IMDS_given_dim (line 252) | void IMDS_given_dim(vtx_data* graph, int n, double* given_coords, FILE: experimental/neatogen/solve.c function solve (line 26) | void solve(double *a, double *b, double *c, int n) FILE: experimental/neatogen/stress.c type dist_data (line 98) | typedef struct { function compute_stressf (line 105) | static double compute_stressf(float **coords, float *lap, int dim, int n) function compute_stress (line 138) | static double compute_stress(double **coords, int **Dij, int dim, int n) function compute_stress1 (line 168) | static double function initLayout (line 206) | int function stress_majorization_kD (line 301) | int stress_majorization_kD(vtx_data * graph, /* Input graph in sparse re... function local_beautify_kD (line 443) | static void function sparse_stress_majorization_kD (line 550) | int sparse_stress_majorization_kD(vtx_data * graph, /* Input graph in sp... function sparse_stress_subspace_majorization_kD (line 899) | static int sparse_stress_subspace_majorization_kD(vtx_data * graph, /* I... function stress_majorization_kD_mkernel (line 1469) | int stress_majorization_kD_mkernel(vtx_data * graph, /* Input graph in s... FILE: experimental/neatogen/stuff.c function drand48 (line 31) | double drand48(void) function fpow32 (line 40) | double fpow32(double x) function distvec (line 46) | double distvec(double *p0, double *p1, double *vec) function free_array (line 76) | void free_array(double **rv) function free_3array (line 104) | static void free_3array(double ***rv) function doubleattr (line 118) | double doubleattr(void *obj, int index, double defval) function degreeKind (line 133) | static int degreeKind(graph_t * g, node_t * n, node_t ** op) function node_t (line 169) | static node_t *prune(graph_t * G, node_t * np, node_t * next) function setEdgeLen (line 193) | static double setEdgeLen(graph_t * G, node_t * np, int lenx) function scan_graph_mode (line 216) | int scan_graph_mode(graph_t * G, int mode) function scan_graph (line 283) | int scan_graph(graph_t * g) function free_scan_graph (line 288) | void free_scan_graph(graph_t * g) function jitter_d (line 302) | void jitter_d(node_t * np, int nG, int n) function jitter3d (line 309) | void jitter3d(node_t * np, int nG) function randompos (line 314) | void randompos(node_t * np, int nG) function initial_positions (line 322) | void initial_positions(graph_t * G, int nG) function diffeq_model (line 346) | void diffeq_model(graph_t * G, int nG) function total_e (line 399) | static double total_e(graph_t * G, int nG) function solve_model (line 423) | void solve_model(graph_t * G, int nG) function update_arrays (line 443) | void update_arrays(graph_t * G, int nG, int i) function D2E (line 471) | void D2E(graph_t * G, int nG, int n, double *M) function final_energy (line 505) | void final_energy(graph_t * G, int nG) function node_t (line 511) | node_t *choose_node(graph_t * G, int nG) function move_node (line 562) | void move_node(graph_t * G, int nG, node_t * n) function heapup (line 593) | void heapup(node_t * v) function heapdown (line 610) | void heapdown(node_t * v) function neato_enqueue (line 634) | void neato_enqueue(node_t * v) function node_t (line 646) | node_t *neato_dequeue(void) function shortest_path (line 664) | void shortest_path(graph_t * G, int nG) function s1 (line 681) | void s1(graph_t * G, node_t * node) function make_spring (line 715) | void make_spring(graph_t * G, node_t * u, node_t * v, double f) function allow_edits (line 724) | int allow_edits(int nsec) FILE: experimental/neatogen/voronoi.c function voronoi (line 25) | void voronoi(int triangulate, Site * (*nextsite) (void)) FILE: experimental/solve_VPSC/libvpsc/block.cpp function Constraint (line 140) | Constraint *Block::findMinInConstraint() { function Constraint (line 189) | Constraint *Block::findMinOutConstraint() { function Constraint (line 323) | Constraint *Block::findMinLM() { function Constraint (line 329) | Constraint *Block::findMinLMBetween(Variable* const lv, Variable* const ... function Constraint (line 355) | Constraint* Block::splitBetween(Variable* const vl, Variable* const vr, function ostream (line 394) | ostream& operator <<(ostream &os, const Block& b) FILE: experimental/solve_VPSC/libvpsc/block.h function class (line 24) | class Block FILE: experimental/solve_VPSC/libvpsc/blocks.h function class (line 34) | class Blocks : public std::set FILE: experimental/solve_VPSC/libvpsc/constraint.h function class (line 19) | class Constraint function compareConstraints (line 37) | static inline bool compareConstraints(Constraint *const &l, Constraint *... FILE: experimental/solve_VPSC/libvpsc/csolve_VPSC.cpp function Variable (line 19) | Variable* newVariable(int id, double desiredPos, double weight) { function Constraint (line 22) | Constraint* newConstraint(Variable* left, Variable* right, double gap) { function VPSC (line 25) | VPSC* newVPSC(int n, Variable* vs[], int m, Constraint* cs[]) { function VPSC (line 28) | VPSC* newIncVPSC(int n, Variable* vs[], int m, Constraint* cs[]) { function genXConstraints (line 32) | int genXConstraints(int n, boxf* bb, Variable** vs, Constraint*** cs,int... function genYConstraints (line 43) | int genYConstraints(int n, boxf* bb, Variable** vs, Constraint*** cs) { function Constraint (line 55) | Constraint** newConstraints(int m) { function deleteConstraints (line 58) | void deleteConstraints(int m, Constraint **cs) { function deleteConstraint (line 64) | void deleteConstraint(Constraint* c) { function deleteVariable (line 67) | void deleteVariable(Variable* v) { function satisfyVPSC (line 70) | void satisfyVPSC(VPSC* vpsc) { function getSplitCnt (line 78) | int getSplitCnt(IncVPSC *vpsc) { function deleteVPSC (line 81) | void deleteVPSC(VPSC *vpsc) { function solveVPSC (line 85) | void solveVPSC(VPSC* vpsc) { function splitIncVPSC (line 88) | void splitIncVPSC(IncVPSC* vpsc) { function setVariableDesiredPos (line 91) | void setVariableDesiredPos(Variable *v, double desiredPos) { function getVariablePos (line 94) | double getVariablePos(Variable *v) { function remapInConstraints (line 97) | void remapInConstraints(Variable *u, Variable *v, double dgap) { function remapOutConstraints (line 106) | void remapOutConstraints(Variable *u, Variable *v, double dgap) { function getLeftVarID (line 115) | int getLeftVarID(Constraint *c) { function getRightVarID (line 118) | int getRightVarID(Constraint *c){ function getSeparation (line 121) | double getSeparation(Constraint *c){ FILE: experimental/solve_VPSC/libvpsc/csolve_VPSC.h type Variable (line 16) | typedef struct Variable Variable; type Constraint (line 21) | typedef struct Constraint Constraint; type VPSC (line 24) | typedef struct VPSC VPSC; type pointf (line 38) | typedef struct pointf_s { double x, y; } pointf; type boxf (line 39) | typedef struct { pointf LL, UR; } boxf; type IncVPSC (line 47) | typedef struct IncVPSC IncVPSC; FILE: experimental/solve_VPSC/libvpsc/generate-constraints.cpp type Node (line 32) | struct Node method Node (line 43) | Node(Variable *v, Rectangle *r, double p) : v(v),r(r),pos(p) { method addLeftNeighbour (line 52) | void addLeftNeighbour(Node *u) { method addRightNeighbour (line 55) | void addRightNeighbour(Node *u) { method setNeighbours (line 58) | void setNeighbours(NodeSet *left, NodeSet *right) { type CmpNodePos (line 33) | struct CmpNodePos { bool operator()(const Node* u, const Node* v) const; } type Node (line 37) | struct Node { method Node (line 43) | Node(Variable *v, Rectangle *r, double p) : v(v),r(r),pos(p) { method addLeftNeighbour (line 52) | void addLeftNeighbour(Node *u) { method addRightNeighbour (line 55) | void addRightNeighbour(Node *u) { method setNeighbours (line 58) | void setNeighbours(NodeSet *left, NodeSet *right) { function NodeSet (line 101) | NodeSet* getLeftNeighbours(NodeSet &scanline,Node *v) { function NodeSet (line 116) | NodeSet* getRightNeighbours(NodeSet &scanline,Node *v) { type Event (line 133) | struct Event { method Event (line 137) | Event(EventType t, Node *v, double p) : type(t),v(v),pos(p) {} function compare_events (line 140) | int compare_events(const void *a, const void *b) { function generateXConstraints (line 166) | int generateXConstraints(const int n, Rectangle** rs, Variable** vars, C... function generateYConstraints (line 251) | int generateYConstraints(const int n, Rectangle** rs, Variable** vars, C... FILE: experimental/solve_VPSC/libvpsc/generate-constraints.h function class (line 16) | class Rectangle { FILE: experimental/solve_VPSC/libvpsc/pairingheap/PairingHeap.cpp function T (line 88) | const T & PairingHeap::findMin( ) const function ostream (line 313) | ostream& operator <<(ostream &os, const PairingHeap &b) FILE: experimental/solve_VPSC/libvpsc/pairingheap/PairingHeap.h function isEmpty (line 79) | bool isEmpty( ) const; function merge (line 93) | void merge( PairingHeap *rhs ) FILE: experimental/solve_VPSC/libvpsc/pairingheap/dsexceptions.h function class (line 4) | class Underflow { } function class (line 5) | class Overflow { } function class (line 6) | class OutOfMemory { } function class (line 7) | class BadIterator { } FILE: experimental/solve_VPSC/libvpsc/placement_SolveVPSC.cpp function JNIEXPORT (line 13) | JNIEXPORT jdouble JNICALL Java_placement_SolveVPSC_solve function JNIEXPORT (line 66) | JNIEXPORT jint JNICALL Java_placement_SolveVPSC_generateXConstraints function JNIEXPORT (line 80) | JNIEXPORT jint JNICALL Java_placement_SolveVPSC_generateYConstraints function JNIEXPORT (line 94) | JNIEXPORT void JNICALL Java_placement_SolveVPSC_getConstraints function JNIEXPORT (line 110) | JNIEXPORT void JNICALL Java_placement_SolveVPSC_removeOverlaps FILE: experimental/solve_VPSC/libvpsc/remove_rectangle_overlap-test.cpp function possibly_eq (line 13) | static bool function possibly_le (line 19) | static bool function show_rects (line 25) | static void function sgn0 (line 41) | static int function test_case (line 53) | static void function main (line 116) | int main() FILE: experimental/solve_VPSC/libvpsc/remove_rectangle_overlap.cpp function removeRectangleOverlap (line 42) | void removeRectangleOverlap(int n, Rectangle *rs[], double xBorder, doub... FILE: experimental/solve_VPSC/libvpsc/removeoverlap.cpp function removeoverlap (line 23) | void removeoverlap(GSList const *const items, double const xGap, double ... FILE: experimental/solve_VPSC/libvpsc/solve_VPSC.cpp function Constraint (line 274) | Constraint* IncVPSC::mostViolated(ConstraintList &l) { type node (line 310) | struct node { FILE: experimental/solve_VPSC/libvpsc/solve_VPSC.h function class (line 31) | class VPSC { function class (line 53) | class IncVPSC : public VPSC { FILE: experimental/solve_VPSC/libvpsc/variable.h type std (line 19) | typedef std::vector Constraints; function class (line 20) | class Variable FILE: experimental/solve_VPSC/tests/block.cpp function test1 (line 7) | void test1() { function test2 (line 30) | void test2() { function main (line 63) | int main() { FILE: experimental/solve_VPSC/tests/csolve_VPSC.c function main (line 5) | int main(int argc, char **argv) { FILE: experimental/solve_VPSC/tests/rectangleoverlap.cpp function removeoverlaps (line 11) | void removeoverlaps(int n, Rectangle **rs) { function countOverlaps (line 72) | unsigned countOverlaps(Rectangle **rs, unsigned n) { function getRand (line 88) | inline double getRand(double range) { function Rectangle (line 91) | Rectangle **generateRandomRects(unsigned n) { function Rectangle (line 111) | Rectangle **generateRects(double coords[][4], unsigned n) { function test (line 118) | void test(Rectangle **rs, unsigned n, double &cost, double &duration) { function main (line 659) | int main() { FILE: experimental/solve_VPSC/tests/satisfy_inc.cpp function getRand (line 10) | inline int getRand(const int range) { function approxEquals (line 13) | inline bool approxEquals(const double a, const double b) { function test1 (line 19) | void test1() { function test2 (line 34) | void test2() { function test3 (line 61) | void test3() { function test4 (line 86) | void test4() { function test5 (line 119) | void test5() { function rand_test (line 156) | void rand_test(int n, int m) { function main (line 197) | int main() {