Functions — github.com/Ohohcakester/Any-Angle-Pathfinding

hub / github.com/Ohohcakester/Any-Angle-Pathfinding / functions

Functions1,502 in github.com/Ohohcakester/Any-Angle-Pathfinding

⨍ Functions 1,502◇ Types & classes 152

↓ 1 callersMethodgenerateSeededGraphOnly

(long seed, int sizeX, int sizeY, int corridorWidth, float connectednessRatio)

src/main/graphgeneration/MazeMapGenerator.java:34

↓ 1 callersMethodgenerateStartingStates

()

src/algorithms/Anya.java:68

↓ 1 callersMethodgenerateSuccessors

(AnyaState currState)

src/algorithms/Anya.java:204

↓ 1 callersMethodgenerateTwoWayTautStartingStates

Assumption: We are at an outer corner. One of six cases: BR BL TR TL TRBL TLBR XXX| |XXX : :

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:568

↓ 1 callersMethodgenerateTwoWayTautStartingStates

Assumption: We are at an outer corner. One of six cases: BR BL TR TL TRBL TLBR XXX| |XXX : :

src/algorithms/sparsevgs/LineOfSightScanner.java:538

↓ 1 callersMethodgenerateUnseeded

Does not remove the block at 0,0

src/main/graphgeneration/DefaultGenerator.java:48

↓ 1 callersMethodgenerateUpwardsObservable

(Fraction leftBound, Fraction rightBound, AnyaState source)

src/algorithms/Anya.java:649

↓ 1 callersMethodgenerateUpwardsStart

(Fraction leftBound, Fraction rightBound, Point start)

src/algorithms/Anya.java:657

↓ 1 callersMethodgenerate_observable_cone__

(IntervalProjection projection, int rootx, int rooty, AnyaNode parent, ArrayList<AnyaNode> retval)

src/algorithms/anya16/AnyaExpansionPolicy.java:371

↓ 1 callersMethodgenerate_start_successors

(AnyaNode node, ArrayList<AnyaNode> retval)

src/algorithms/anya16/AnyaExpansionPolicy.java:162

↓ 1 callersMethodgenerate_successors

( AnyaNode node, ArrayList<AnyaNode> retval)

src/algorithms/anya16/AnyaExpansionPolicy.java:142

↓ 1 callersMethodgetConvexHullHeuristic

()

src/algorithms/sg16/SG16VisibilityGraph.java:97

↓ 1 callersMethodgetCurrentSearchSnapshot

()

src/algorithms/PathFindingAlgorithm.java:122

↓ 1 callersMethodgetEdgeTile

(int index, int[] return_edgeTile)

src/main/graphgeneration/MazeMapGenerator.java:239

↓ 1 callersMethodgetEndpoints

(int index, int[] return_coords)

src/main/graphgeneration/MazeMapGenerator.java:214

↓ 1 callersMethodgetFractionLineList

()

src/draw/GridLineSet.java:64

↓ 1 callersMethodgetLineList

()

src/draw/GridLineSet.java:60

↓ 1 callersMethodgetMazePool

(int mazePoolIndex)

src/main/mazes/StoredTestMazes.java:211

↓ 1 callersFunctiongetMean

(args)

pyscripts/mazes.py:249

↓ 1 callersMethodgetMinIndex

()

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:179

↓ 1 callersMethodgetMinValue

()

src/algorithms/priorityqueue/IndirectHeap.java:175

↓ 1 callersMethodgetNextData

@return Get the data for the next test case.

src/main/testgen/TestDataLibrary.java:174

↓ 1 callersFunctiongetPath

(mazeName)

pyscripts/mazes.py:69

↓ 1 callersMethodgetPath

()

src/algorithms/VisibilityGraphAlgorithm.java:179

↓ 1 callersMethodgetPath

@return retrieve the path computed by the algorithm

src/algorithms/anya16/Anya16.java:67

↓ 1 callersMethodgetPointList

()

src/draw/GridPointSet.java:39

↓ 1 callersMethodgetPrintString

()

src/main/utility/TimeCounter.java:123

↓ 1 callersMethodgetSetNames

()

src/uiandio/BenchmarkGraphSets.java:6

↓ 1 callersMethodgetStoredGraph

(GridGraph graph, int sx, int sy, int ex, int ey)

src/algorithms/visibilitygraph/VisibilityGraph.java:270

↓ 1 callersMethodgetStoredGraph

(GridGraph graph)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:278

↓ 1 callersMethodgetVisibilityGraph

()

src/algorithms/VisibilityGraphAlgorithm.java:51

↓ 1 callersMethodget_padded_height

()

src/algorithms/anya16/BitpackedGrid.java:646

↓ 1 callersMethodget_point_is_visible

(int x, int y)

src/algorithms/anya16/BitpackedGrid.java:107

↓ 1 callersMethodgoalParentIndex

()

src/algorithms/PathFindingAlgorithm.java:145

↓ 1 callersMethodgraphReuse

(GridGraph graph, int sx, int sy, int ex, int ey)

src/algorithms/VisibilityGraphAlgorithm.java:38

↓ 1 callersMethodgraphReuse

(GridGraph graph, int sx, int sy, int ex, int ey)

src/algorithms/visibilitygraph/BFSVisibilityGraph.java:20

↓ 1 callersMethodgraphReuse

(GridGraph graph, int sx, int sy, int ex, int ey)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:25

↓ 1 callersMethodhasBlockedTileOnPerimeter

___________ |X|X|X|X|X|X| size = 3 |X|_|_|_|_|X| |X|_|_|_|_|X| <-- checks the nodes in the perimeter of size = size |X|_|_|_|_|X| returns true iff

src/algorithms/AcceleratedAStar.java:216

↓ 1 callersMethodhasNextData

@return true iff there are still remaining test cases.

src/main/testgen/TestDataLibrary.java:167

↓ 1 callersMethodhasSolution

Returns true iff there is a path from the start to the end. Uses the current algorithm to check.<br> Use setDefaultAlgoFunction to choose the algorith

src/main/Experiment.java:122

↓ 1 callersMethodheadNext

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:164

↓ 1 callersMethodheuristic

(int x, int y)

src/algorithms/AStarStaticMemory.java:107

↓ 1 callersMethodheuristic

(AnyaState currState)

src/algorithms/Anya.java:735

↓ 1 callersMethodheuristic

(int x, int y)

src/algorithms/AStar.java:105

↓ 1 callersMethodheuristic

(int nx, int ny)

src/algorithms/sg16/SG16Algorithm.java:123

↓ 1 callersMethodheuristic

(int x, int y)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:107

↓ 1 callersMethodheuristic

(int x, int y)

src/algorithms/strictthetastar/StrictThetaStar.java:87

↓ 1 callersMethodidentity

()

src/main/graphgeneration/AffineTransform.java:27

↓ 1 callersMethodinit

()

src/algorithms/anya16/AnyaSearch.java:88

↓ 1 callersFunctioninitCommands

()

pyscripts/mazes.py:411

↓ 1 callersMethodinitialise

(int s)

src/algorithms/AStarStaticMemory.java:131

↓ 1 callersMethodinitialise

(int sx, int sy, int ex, int ey)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:40

↓ 1 callersMethodinitialise

(int s)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:50

↓ 1 callersMethodinitialise

(GridGraph graph)

src/algorithms/anya16/Anya16.java:23

↓ 1 callersMethodinitialiseConvexHulls

(int sx, int sy, int ex, int ey)

src/algorithms/sg16/SG16VisibilityGraph.java:58

↓ 1 callersMethodinitialiseFunctions

()

src/draw/VisualiserKeyboardControls.java:25

↓ 1 callersMethodinitialiseLabels

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:279

↓ 1 callersMethodinitialiseNodes

()

src/algorithms/sg16/SG16VisibilityGraph.java:62

↓ 1 callersMethodinitialiseObstacleIndexes

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:288

↓ 1 callersMethodinitialiseScan

(int sx, int sy)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:266

↓ 1 callersMethodinitialiseStack

()

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:73

↓ 1 callersMethodinitialiseStack

()

src/algorithms/sparsevgs/LineOfSightScanner.java:47

↓ 1 callersMethodinitialiseSuccessorList

()

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:79

↓ 1 callersMethodinitialiseSuccessorList

()

src/algorithms/sparsevgs/LineOfSightScanner.java:53

↓ 1 callersMethodinitialiseUpExtents

(GridGraph graph)

src/algorithms/Anya.java:25

↓ 1 callersMethodintermediate

(AnyaInterval interval, int rootx, int rooty)

src/algorithms/anya16/AnyaExpansionPolicy.java:306

↓ 1 callersMethodintersectsPositiveXAxis

(int sx, int sy, Edge edge)

src/algorithms/rotationalplanesweep/RPSScanner.java:539

↓ 1 callersMethodintersectsPositiveXAxis

(int sx, int sy, RPSScanner.Edge edge)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:419

↓ 1 callersMethodinverse

()

src/main/graphgeneration/AffineTransform.java:80

↓ 1 callersMethodisAntiClockwise

__. /| / (2) (1) / Anticlockwise: (1)x(2) > 0 o-------->o

src/algorithms/sg16/ConvexHullSplitGenerator.java:106

↓ 1 callersMethodisClockwise

(int index1, int index2, int x3, int y3)

src/algorithms/sg16/ConvexHullSplitGenerator.java:120

↓ 1 callersMethodisCollinear

(int x1, int y1, int x2, int y2, int x3, int y3)

src/main/utility/Utility.java:108

↓ 1 callersMethodisCollinear

(int x1, int y1, int x2, int y2, int x3, int y3)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:220

↓ 1 callersMethodisCorner

(int x, int y)

src/algorithms/visibilitygraph/VisibilityGraph.java:182

↓ 1 callersMethodisEmpty

()

src/algorithms/anya16/ArrayListSet.java:30

↓ 1 callersMethodisEmpty

()

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:247

↓ 1 callersMethodisMergeableWithParent

(int u, int v)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:186

↓ 1 callersMethodisTaut

Checks whether the path (x1,y1),(x2,y2),(x3,y3) is taut.

src/grid/GridGraph.java:438

↓ 1 callersMethodisTautFromBottom

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:553

↓ 1 callersMethodisTautFromBottomLeft

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:467

↓ 1 callersMethodisTautFromBottomRight

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:496

↓ 1 callersMethodisTautFromLeft

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:525

↓ 1 callersMethodisTautFromRight

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:539

↓ 1 callersMethodisTautFromTop

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:567

↓ 1 callersMethodisTautFromTopLeft

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:482

↓ 1 callersMethodisTautFromTopRight

(int x1, int y1, int x2, int y2, int x3, int y3)

src/grid/GridGraph.java:510

↓ 1 callersMethodisVisited

(int x, int y)

src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:267

↓ 1 callersMethoditerator

()

src/algorithms/bst/BinaryTree.java:82

↓ 1 callersMethodjoinMaps

(GridGraph[] gridGraphs, boolean[][] grid, int graphSizeX, int graphSizeY, int nCols, int nRows)

src/main/graphgeneration/TiledMapGenerator.java:66

↓ 1 callersMethodjump

(int x, int y, int dx, int dy)

src/algorithms/JumpPointSearch.java:73

↓ 1 callersMethodjumpDL

(int x, int y)

src/algorithms/JumpPointSearch.java:100

↓ 1 callersMethodjumpDR

(int x, int y)

src/algorithms/JumpPointSearch.java:112

↓ 1 callersMethodjumpUL

(int x, int y)

src/algorithms/JumpPointSearch.java:124

↓ 1 callersMethodjumpUR

(int x, int y)

src/algorithms/JumpPointSearch.java:136

↓ 1 callersMethodleftCenterRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:71

↓ 1 callersMethodleftChild

(int index)

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:239

↓ 1 callersMethodleftChild

(int index)

src/algorithms/priorityqueue/IndirectHeap.java:279

↓ 1 callersMethodleftLeftRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:37

↓ 1 callersMethodleftRightRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:88

↓ 1 callersMethodlength

(Fraction width, int height)

src/algorithms/anya/Fraction.java:190

← previous next →701–800 of 1,502, ranked by callers