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

↓ 5 callersMethodbottomLeftOfLabelledTile

(int x, int y, int label)

src/algorithms/sg16/ConvexHullSplitGenerator.java:568

↓ 5 callersMethodchangeSet

(GridLineSet gridLineSet, GridPointSet gridPointSet)

src/draw/DrawCanvas.java:99

↓ 5 callersMethodcomputeOptimalPathOnline

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

src/main/utility/Utility.java:51

↓ 5 callersMethodconditionalRotate

(AVLNode<E> current)

src/algorithms/bst/AVLTree.java:130

↓ 5 callersMethodcontains

(Object o)

src/algorithms/anya16/ArrayListSet.java:35

↓ 5 callersMethodcreate

Convert a snapshot of an algorithm into a GridObjects instance.

src/draw/GridObjects.java:38

↓ 5 callersMethodgetAlgo

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

src/main/AlgoFunction.java:7

↓ 5 callersMethodgetNext

()

src/algorithms/bst/Node.java:63

↓ 5 callersMethodgetPrev

()

src/algorithms/bst/Node.java:67

↓ 5 callersMethodgetSecondaryKey

()

src/algorithms/jgrapht/FibonacciHeapNode.java:96

↓ 5 callersMethodgoLeft

(int amount, boolean stopAtEnd)

src/draw/KeyToggler.java:31

↓ 5 callersMethodhasNext

()

src/algorithms/anya16/ExpansionPolicy.java:30

↓ 5 callersMethodintToStr

(int i)

src/main/testgen/Stringifier.java:73

↓ 5 callersMethodisUnblockedCoordinate

(int x, int y)

src/grid/GridGraph.java:68

↓ 5 callersMethodisValidCoordinate

(int x, int y)

src/grid/GridGraph.java:46

↓ 5 callersMethodloadMaze

Choose a maze. (a gridGraph setting)

src/main/AnyAnglePathfinding.java:86

↓ 5 callersMethodnext

()

src/algorithms/anya16/ExpansionPolicy.java:27

↓ 5 callersMethodparent

(int index)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:565

↓ 5 callersMethodper

(int value)

src/main/utility/TimeCounter.java:107

↓ 5 callersMethodpopMinIndex

Runtime: O(lgn) @return index of min element

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:187

↓ 5 callersMethodreset

()

src/main/utility/TimeCounter.java:39

↓ 5 callersMethodsetDefaultAlgoFunction

Choose an algorithm.

src/main/AnyAnglePathfinding.java:320

↓ 5 callersMethodsetSaveSnapshotFunction

(Runnable saveSnapshot)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:41

↓ 5 callersMethodsize

()

src/algorithms/anya16/ArrayListSet.java:25

↓ 5 callersMethodtestOnStoredMaze

(MazeAndTestCases mazeAndTestCases, AlgoFunction algoFunction, TestFunctionData test)

src/main/AlgoTest.java:513

↓ 5 callersMethodtoFloat

()

src/algorithms/anya/Fraction.java:124

↓ 5 callersMethodtoSecs

(long value)

src/main/utility/TimeCounter.java:99

↓ 5 callersMethodtoSecsPer

(long value)

src/main/utility/TimeCounter.java:103

↓ 5 callersMethodtoString

()

src/algorithms/bst/BinaryTree.java:185

↓ 5 callersMethodtopRightOfLabelledTile

(int x, int y, int label)

src/algorithms/sg16/ConvexHullSplitGenerator.java:556

↓ 5 callersMethodwriteRow

(String...strings)

src/uiandio/FileIO.java:40

↓ 5 callersMethodx

(int x, int y)

src/main/graphgeneration/AffineTransform.java:95

↓ 5 callersMethody

(int x, int y)

src/main/graphgeneration/AffineTransform.java:99

↓ 4 callersMethodaddAll

(Collection<? extends E> c)

src/algorithms/anya16/ArrayListSet.java:70

↓ 4 callersMethodaddEdge

(int fromI, int toI, float weight)

src/algorithms/visibilitygraph/VisibilityGraph.java:167

↓ 4 callersMethodaddToQueue

Returns true iff finish is found.

src/algorithms/BreadthFirstSearch.java:83

↓ 4 callersMethodassertFloatEquals

(float expected, float actual)

src/algorithms/priorityqueue/IndirectHeapTest.java:87

↓ 4 callersMethodclear

()

src/algorithms/rotationalplanesweep/RPSEdgeHeap.java:20

↓ 4 callersMethodclearStack

()

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:121

↓ 4 callersMethodclearStack

()

src/algorithms/sparsevgs/LineOfSightScanner.java:91

↓ 4 callersMethodclearSuccessors

()

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:86

↓ 4 callersMethodclearSuccessors

()

src/algorithms/sparsevgs/LineOfSightScanner.java:60

↓ 4 callersMethodcomputeAllVisibleTautSuccessors

Stores results in successorsX, successorsY and nSuccessors.

src/algorithms/sparsevgs/LineOfSightScanner.java:157

↓ 4 callersMethodcomputeAverageBlockedIslandSize

(GridGraph gridGraph, boolean acceptBorderIslands)

src/main/analysis/MazeAnalysis.java:192

↓ 4 callersMethodcomputeSumDegrees

()

src/algorithms/sparsevgs/SparseVisibilityGraph.java:236

↓ 4 callersMethoddecreaseKey

(int index, float newCost, boolean isNewItem)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:146

↓ 4 callersMethoddraw

(Graphics g)

src/draw/Drawer.java:7

↓ 4 callersMethodedgeIterator

(int source)

src/algorithms/visibilitygraph/VisibilityGraph.java:224

↓ 4 callersMethodexplore

(ArrayList<Point> list, boolean[] visited, int px, int py)

src/grid/ReachableNodesFast.java:42

↓ 4 callersMethodgenerate

(boolean seededRandom, long seed, int sizeX, int sizeY, int corridorWidth, float connectednessRati

src/main/graphgeneration/MazeMapGenerator.java:40

↓ 4 callersMethodgenerateSameLevelUnobservable

Can be used for exploreLeftwards or exploreRightwards. This function will not split intervals.

src/algorithms/Anya.java:627

↓ 4 callersMethodgenerateTestData

(GridGraph gridGraph, ArrayList<TwoPoint> problemList, String mazeName, boolean analyseMaze)

src/main/testgen/TestDataGenerator.java:168

↓ 4 callersMethodgetFirst

()

src/algorithms/bst/AVLTree.java:416

↓ 4 callersMethodgetIn

(int index)

src/algorithms/priorityqueue/ReusableIndirectHeap.java:67

↓ 4 callersMethodgetInterval

()

src/algorithms/anya16/AnyaNode.java:92

↓ 4 callersMethodgetLargestSet

(ArrayList<ArrayList<Point>> sets)

src/main/analysis/MazeAnalysis.java:82

↓ 4 callersMethodgetLast

()

src/algorithms/bst/AVLTree.java:412

↓ 4 callersMethodgetMin

()

src/algorithms/rotationalplanesweep/RPSEdgeHeap.java:32

↓ 4 callersMethodgetParent

(int index)

src/algorithms/PathFindingAlgorithm.java:149

↓ 4 callersMethodget_bit_value

(int x, int y, int[] elts)

src/algorithms/anya16/BitpackedGrid.java:198

↓ 4 callersMethodheuristic

()

src/algorithms/anya16/ExpansionPolicy.java:37

↓ 4 callersMethodimportGraphFromFilePath

Import a graph from a file in the AnyAnglePathfinding directory.

src/uiandio/GraphImporter.java:121

↓ 4 callersMethodinitialiseNew

(GridGraph graph, int levelLimit)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:82

↓ 4 callersMethodisEqualTo

(double a, double b)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:48

↓ 4 callersMethodisPathTaut

(GridGraph gridGraph, int[][] path)

src/main/utility/Utility.java:125

↓ 4 callersMethodisSameAngle

(int sx, int sy, Vertex u, Vertex v)

src/algorithms/rotationalplanesweep/RPSScanner.java:476

↓ 4 callersMethodisValidBlock

(int x, int y)

src/grid/GridGraph.java:51

↓ 4 callersMethodleftAnyExtent

(int xL, int y)

src/algorithms/Anya.java:598

↓ 4 callersMethodloadMazesFromNames

(String[] mazeNames)

src/main/mazes/StoredTestMazes.java:246

↓ 4 callersMethodmakeAnalysisFile

(MazeAnalysis analysis, String filePath)

src/main/testgen/TestDataGenerator.java:248

↓ 4 callersMethodmarkEdgesFrom

Mark all edges reachable with a path of edges of increasing level from the source.

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:845

↓ 4 callersMethodmarkVisited

(int x, int y)

src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:263

↓ 4 callersMethodnextLine

@return the next line in the string. Throws an exception if there are no more lines.

src/uiandio/GraphExporter.java:31

↓ 4 callersMethodrefreshPoints

()

src/draw/EditorUI.java:100

↓ 4 callersMethodremoveMin

Removes the smallest element from the heap. This will cause the trees in the heap to be consolidated, if necessary. <p>Running time: O(log n) amortiz

src/algorithms/jgrapht/FibonacciHeap.java:221

↓ 4 callersMethodrightAnyExtent

(int xR, int y)

src/algorithms/Anya.java:610

↓ 4 callersMethodrotateLeft

(Node<E> pivot)

src/algorithms/bst/BinarySearchTree.java:15

↓ 4 callersMethodrotateRight

(Node<E> pivot)

src/algorithms/bst/BinarySearchTree.java:22

↓ 4 callersMethodrunAutomataIterationUnblockedBorders

(int sizeX, int sizeY, int resolution, boolean[][] grid, int[][] count)

src/main/graphgeneration/AutomataGenerator.java:201

↓ 4 callersMethodsaveVisibilityGraphSnapshot

(boolean showMarked)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:384

↓ 4 callersMethodsaveVisibilityGraphSnapshot

(boolean showMarked)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:347

↓ 4 callersMethodscan_cells_left

(int x,int y)

src/algorithms/anya16/BitpackedGrid.java:318

↓ 4 callersMethodscan_cells_right

(int x, int y)

src/algorithms/anya16/BitpackedGrid.java:282

↓ 4 callersMethodsetPathComputeMode

(PathComputeMode mode)

src/draw/EditorUI.java:117

↓ 4 callersMethodsetVisited

(int index, boolean value)

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:281

↓ 4 callersMethodsetVisited

(int index, boolean value)

src/algorithms/sg16/SG16Algorithm.java:202

↓ 4 callersMethodset_bit_value

(int x, int y, boolean value, int[] elts)

src/algorithms/anya16/BitpackedGrid.java:188

↓ 4 callersMethodsetupMainFrame

Spawns the visualisation window for the algorithm.

src/main/Visualisation.java:112

↓ 4 callersMethodsetupMainFrame

Spawns the editor visualisation window. @param startGoalPoints

src/main/GridGraphVisualiser.java:71

↓ 4 callersMethodsize

()

src/algorithms/rotationalplanesweep/RPSEdgeHeap.java:24

↓ 4 callersMethodswap

(int i, int j)

src/algorithms/rotationalplanesweep/RPSEdgeHeap.java:93

↓ 4 callersMethodswapData

(int a, int b)

src/algorithms/priorityqueue/ReusableIndirectHeap.java:145

↓ 4 callersMethodtestAlgorithm

(GridGraph gridGraph, AlgoFunction algoFunction, TwoPoint tp, int sampleSize, int nTrials)

src/main/AlgoTest.java:789

↓ 4 callersMethodtopLeftOfLabelledTile

(int x, int y, int label)

src/algorithms/sg16/ConvexHullSplitGenerator.java:560

↓ 4 callersMethodtryExplore

(boolean[] visited, int px, int py)

src/grid/BlockedIslandSearch.java:45

↓ 4 callersMethodupdate_point

(int px, int py)

src/algorithms/anya16/BitpackedGrid.java:164

↓ 4 callersMethodweight

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

src/algorithms/AStar.java:111

↓ 4 callersMethodwithLevelLimit

(int levelLimit)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:31

↓ 3 callersMethodaddToMarkedEdges

(int current, int outgoingIndex)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:925

↓ 3 callersMethodanglesIntersectPositiveXAxis

(int sx, int sy, Vertex edgeU, Vertex edgeV)

src/algorithms/rotationalplanesweep/RPSScanner.java:574

← previous next →201–300 of 1,502, ranked by callers