- a -

• addInitialNodeToOpen() : OpenClosedList< state_t, action_t >
• addNewNodeToOpen() : OpenClosedList< state_t, action_t >
• addNewSearchNode() : NodeTable< node_t >
• applyAction() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• applyActionSequence() : TransitionSystem< state_t, action_t >
• AStar() : AStar< state_t, action_t >

- b -

• BestFirstSearch() : BestFirstSearch< state_t, action_t >
• BFSNode() : BFSNode< state_t, action_t >

- c -

• canEast() : MapPathfindingTransitions
• canNorth() : MapPathfindingTransitions
• canSouth() : MapPathfindingTransitions
• canWest() : MapPathfindingTransitions
• clear() : NodeTable< node_t > , OpenClosedList< state_t, action_t >
• clearMap() : MapPathfindingTransitions
• closedListSize() : OpenClosedList< state_t, action_t >
• computeHValue() : Heuristic< state_t > , MapManhattanDistance , MapOctileDistance , NonGoalHeuristic< state_t > , TileManhattanDistance

- e -

• extractSolutionPath() : BestFirstSearch< state_t, action_t >

- f -

• foundSolution() : SearchEngine< state_t, action_t >

- g -

• getActionCost() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• getActionGenCount() : SearchEngine< state_t, action_t >
• getActions() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• getBestNodeAndClose() : OpenClosedList< state_t, action_t >
• getCurrentGoal() : SingleGoalTest< state_t >
• getDummyAction() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• getGoalTestCount() : SearchEngine< state_t, action_t >
• getHCompCount() : SearchEngine< state_t, action_t >
• getHValue() : Heuristic< state_t >
• getInverse() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• getLastHValue() : Heuristic< state_t >
• getLastPlan() : SearchEngine< state_t, action_t >
• getLastPlanCost() : SearchEngine< state_t, action_t >
• getMapHeight() : MapPathfindingTransitions
• getMapWidth() : MapPathfindingTransitions
• getMovingTile() : TilePuzzleTransitions
• getNode() : NodeTable< node_t > , OpenClosedList< state_t, action_t >
• getPlan() : SearchEngine< state_t, action_t >
• getStateGenCount() : SearchEngine< state_t, action_t >
• getStateHash() : MapLocHashFunction , PermutationHashFunction< state_t > , StateHashFunction< state_t >
• getStateLocation() : OpenClosedList< state_t, action_t >
• getStatus() : SearchEngine< state_t, action_t >
• getStorageCount() : SearchEngine< state_t, action_t >
• getSuccessors() : TransitionSystem< state_t, action_t >
• getSuccFuncCount() : SearchEngine< state_t, action_t >
• getTileMoveCost() : TilePuzzleTransitions
• getUniqueGoalTests() : BestFirstSearch< state_t, action_t >
• GoalTestFunction() : GoalTestFunction< state_t >

- h -

• heapifyDown() : OpenClosedList< state_t, action_t >
• heapifyUp() : OpenClosedList< state_t, action_t >
• Heuristic() : Heuristic< state_t >
• hitGoalTestLimit() : SearchEngine< state_t, action_t >
• hitHCompLimit() : SearchEngine< state_t, action_t >
• hitStorageLimit() : SearchEngine< state_t, action_t >
• hitSuccFuncLimit() : SearchEngine< state_t, action_t >

- i -

• increaseActionGenCount() : SearchEngine< state_t, action_t >
• incrementGoalTestCount() : SearchEngine< state_t, action_t >
• incrementHCompCount() : SearchEngine< state_t, action_t >
• incrementStateGenCount() : SearchEngine< state_t, action_t >
• incrementSuccFuccCalls() : SearchEngine< state_t, action_t >
• is4Connected() : MapPathfindingTransitions
• is8Connected() : MapPathfindingTransitions
• isApplicable() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• isApplicableInLocation() : TilePuzzleTransitions
• isApplicableSequence() : TransitionSystem< state_t, action_t >
• isChildState() : TransitionSystem< state_t, action_t >
• isConfigured() : BestFirstSearch< state_t, action_t > , SearchEngine< state_t, action_t >
• isDummyAction() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• isGoal() : GoalTestFunction< state_t > , SingleGoalTest< state_t >
• isHValueStored() : Heuristic< state_t >
• isInvertible() : MapPathfindingTransitions , TilePuzzleTransitions , TransitionSystem< state_t, action_t >
• isNEEmpty() : MapPathfindingTransitions
• isNodeStored() : NodeTable< node_t >
• isNWEmpty() : MapPathfindingTransitions
• isOpenEmpty() : OpenClosedList< state_t, action_t >
• isSEEmpty() : MapPathfindingTransitions
• isSWEmpty() : MapPathfindingTransitions

- l -

• loadMap() : MapPathfindingTransitions

- m -

• MapLocation() : MapLocation
• MapLocHashFunction() : MapLocHashFunction
• MapManhattanDistance() : MapManhattanDistance
• MapOctileDistance() : MapOctileDistance
• MapPathfindingTransitions() : MapPathfindingTransitions

- n -

• nodeEval() : AStar< state_t, action_t > , BestFirstSearch< state_t, action_t >
• nodeExpansion() : BestFirstSearch< state_t, action_t >
• nodeNoWorse() : OpenClosedList< state_t, action_t >
• NodeTable() : NodeTable< node_t >
• NonGoalHeuristic() : NonGoalHeuristic< state_t >

- o -

• OpenClosedList() : OpenClosedList< state_t, action_t >
• openListSize() : OpenClosedList< state_t, action_t >
• openNodeEvalChanged() : OpenClosedList< state_t, action_t >
• operator()() : NodeKeyHash
• operator[]() : NodeTable< node_t >

- p -

• PermutationHashFunction() : PermutationHashFunction< state_t >
• prepareToCompute() : Heuristic< state_t >
• printOpen() : OpenClosedList< state_t, action_t >

- r -

• reopenNode() : OpenClosedList< state_t, action_t >
• resetEngine() : BestFirstSearch< state_t, action_t > , SearchEngine< state_t, action_t >
• resetStatistics() : BestFirstSearch< state_t, action_t > , SearchEngine< state_t, action_t >

- s -

• SearchEngine() : SearchEngine< state_t, action_t >
• searchForPlan() : BestFirstSearch< state_t, action_t > , SearchEngine< state_t, action_t >
• set4Connected() : MapPathfindingTransitions
• set8Connected() : MapPathfindingTransitions
• setActionList() : TilePuzzleTransitions
• setCustomTileCostType() : TilePuzzleTransitions
• setDiagonalCost() : MapOctileDistance , MapPathfindingTransitions
• setGoal() : MapManhattanDistance , MapOctileDistance , SingleGoalTest< state_t > , TileManhattanDistance
• setGoalTest() : SearchEngine< state_t, action_t >
• setGoalTestFunction() : NonGoalHeuristic< state_t >
• setGoalTestLimit() : SearchEngine< state_t, action_t >
• setHashFunction() : BestFirstSearch< state_t, action_t >
• setHComputeLimit() : SearchEngine< state_t, action_t >
• setHeuristic() : BestFirstSearch< state_t, action_t >
• setMapDimensions() : MapLocHashFunction
• setMinimumActionCost() : NonGoalHeuristic< state_t >
• setProperties() : TilePuzzleTransitions
• setStandardTileCostType() : TilePuzzleTransitions
• setStorageLimit() : SearchEngine< state_t, action_t >
• setSuccCallLimit() : SearchEngine< state_t, action_t >
• setTransitionSystem() : SearchEngine< state_t, action_t >
• SingleGoalTest() : SingleGoalTest< state_t >
• size() : NodeTable< node_t > , OpenClosedList< state_t, action_t >
• StateHashFunction() : StateHashFunction< state_t >
• swapOpenLocations() : OpenClosedList< state_t, action_t >

- t -

• TileManhattanDistance() : TileManhattanDistance
• TilePuzzleState() : TilePuzzleState
• TilePuzzleTransitions() : TilePuzzleTransitions
• TransitionSystem() : TransitionSystem< state_t, action_t >

- ~ -

• ~AStar() : AStar< state_t, action_t >
• ~BestFirstSearch() : BestFirstSearch< state_t, action_t >
• ~BFSNode() : BFSNode< state_t, action_t >
• ~GoalTestFunction() : GoalTestFunction< state_t >
• ~Heuristic() : Heuristic< state_t >
• ~MapLocation() : MapLocation
• ~MapLocHashFunction() : MapLocHashFunction
• ~MapManhattanDistance() : MapManhattanDistance
• ~MapOctileDistance() : MapOctileDistance
• ~MapPathfindingTransitions() : MapPathfindingTransitions
• ~NodeTable() : NodeTable< node_t >
• ~NonGoalHeuristic() : NonGoalHeuristic< state_t >
• ~OpenClosedList() : OpenClosedList< state_t, action_t >
• ~PermutationHashFunction() : PermutationHashFunction< state_t >
• ~SearchEngine() : SearchEngine< state_t, action_t >
• ~SingleGoalTest() : SingleGoalTest< state_t >
• ~StateHashFunction() : StateHashFunction< state_t >
• ~TileManhattanDistance() : TileManhattanDistance
• ~TilePuzzleState() : TilePuzzleState
• ~TilePuzzleTransitions() : TilePuzzleTransitions
• ~TransitionSystem() : TransitionSystem< state_t, action_t >