check if a node is in the open list concode_field_sep Node parent concode_elem_sep float cost concode_elem_sep SortedList open concode_elem_sep float heuristic concode_elem_sep ArrayList closed concode_elem_sep int maxSearchDistance concode_elem_sep Node[][] nodes concode_elem_sep boolean allowDiagMovement concode_elem_sep int depth concode_elem_sep ArrayList list concode_elem_sep int x concode_elem_sep int y concode_elem_sep TileBasedMap map concode_field_sep void add concode_elem_sep Node getFirstInOpen concode_elem_sep void clear concode_elem_sep boolean inClosedList concode_elem_sep void removeFromClosed concode_elem_sep int compareTo concode_elem_sep void addToClosed concode_elem_sep void addToOpen concode_elem_sep void remove concode_elem_sep boolean contains concode_elem_sep boolean isValidLocation concode_elem_sep float getMovementCost concode_elem_sep int size concode_elem_sep float getHeuristicCost concode_elem_sep int setParent concode_elem_sep Path findPath concode_elem_sep void removeFromOpen concode_elem_sep Object first
boolean function ( Node arg0 ) { return open . contains ( arg0 ) ; }