Package com.prineside.luaj.mapping.parts

Class LJ_GDX_ai.PathFinder_CG.LIP

java.lang.Object
com.prineside.luaj.mapping.InterfaceProxy
com.prineside.luaj.mapping.parts.LJ_GDX_ai.PathFinder_CG.LIP
All Implemented Interfaces:
com.badlogic.gdx.ai.pfa.PathFinder, com.esotericsoftware.kryo.KryoSerializable
Enclosing class:
LJ_GDX_ai.PathFinder_CG
public static class LJ_GDX_ai.PathFinder_CG.LIP extends InterfaceProxy implements com.badlogic.gdx.ai.pfa.PathFinder

  • Field Summary

    Fields inherited from class com.prineside.luaj.mapping.InterfaceProxy

    luaObj

  • Method Summary

    Modifier and Type
    Method
    Description
    boolean
    search(com.badlogic.gdx.ai.pfa.PathFinderRequest p1, long p2)
    Performs an interruptible search, trying to find a path made up of nodes from the start node to the goal node attempting to honor costs provided by the graph.
    boolean
    searchConnectionPath(Object p1, Object p2, com.badlogic.gdx.ai.pfa.Heuristic p3, com.badlogic.gdx.ai.pfa.GraphPath p4)
    Performs a non-interruptible search, trying to find a path made up of connections from the start node to the goal node attempting to honor costs provided by the graph.
    boolean
    searchNodePath(Object p1, Object p2, com.badlogic.gdx.ai.pfa.Heuristic p3, com.badlogic.gdx.ai.pfa.GraphPath p4)
    Performs a non-interruptible search, trying to find a path made up of nodes from the start node to the goal node attempting to honor costs provided by the graph.

    Methods inherited from class com.prineside.luaj.mapping.InterfaceProxy

    getLuaObj, read, write

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Method Details

    • search

      public boolean search(com.badlogic.gdx.ai.pfa.PathFinderRequest p1, long p2)
      Description copied from interface: com.badlogic.gdx.ai.pfa.PathFinder
      Performs an interruptible search, trying to find a path made up of nodes from the start node to the goal node attempting to honor costs provided by the graph.
      Specified by:
      search in interface com.badlogic.gdx.ai.pfa.PathFinder
      Parameters:
      p1 - the pathfinding request
      p2 - the time in nanoseconds that can be used to advance the search
      Returns:
      true if the search has finished; false otherwise.

    • searchConnectionPath

      public boolean searchConnectionPath(Object p1, Object p2, com.badlogic.gdx.ai.pfa.Heuristic p3, com.badlogic.gdx.ai.pfa.GraphPath p4)
      Description copied from interface: com.badlogic.gdx.ai.pfa.PathFinder
      Performs a non-interruptible search, trying to find a path made up of connections from the start node to the goal node attempting to honor costs provided by the graph.
      Specified by:
      searchConnectionPath in interface com.badlogic.gdx.ai.pfa.PathFinder
      Parameters:
      p1 - the start node
      p2 - the end node
      p3 - the heuristic function
      p4 - the output path that will only be filled if a path is found, otherwise it won't get touched.
      Returns:
      true if a path was found; false otherwise.

    • searchNodePath

      public boolean searchNodePath(Object p1, Object p2, com.badlogic.gdx.ai.pfa.Heuristic p3, com.badlogic.gdx.ai.pfa.GraphPath p4)
      Description copied from interface: com.badlogic.gdx.ai.pfa.PathFinder
      Performs a non-interruptible search, trying to find a path made up of nodes from the start node to the goal node attempting to honor costs provided by the graph.
      Specified by:
      searchNodePath in interface com.badlogic.gdx.ai.pfa.PathFinder
      Parameters:
      p1 - the start node
      p2 - the end node
      p3 - the heuristic function
      p4 - the output path that will only be filled if a path is found, otherwise it won't get touched.
      Returns:
      true if a path was found; false otherwise.