// Range: -1 Access: 0 Flags: ( 0, 4, 255 ) public static dynamic AStar( dynamic start = null, dynamic end = null, Mob_Living_SimpleAnimal atom = null, System.Reflection.MethodInfo dist = null, dynamic maxnodes = null, dynamic maxnodedepth = null, dynamic mintargetdist = null, System.Reflection.MethodInfo adjacent = null, Ent_Item_Weapon_Card_Id id = null, dynamic exclude = null, bool? simulated_only = null ) { Heap open = null; ByTable closed = null; ByTable path = null; dynamic cur = null; bool? closeenough = null; dynamic L = null; dynamic T = null; dynamic newg = null; PathNode PN = null; dynamic T2 = null; double? i = null; if ( maxnodedepth == null ) { maxnodedepth = 30; } if ( adjacent == null ) { adjacent = typeof(Tile).GetMethod( "reachableAdjacentTurfs" ); } if ( id == null ) { id = null; } if ( exclude == null ) { exclude = null; } if ( simulated_only == null ) { simulated_only = true; } if ( Lang13.Bool( maxnodes ) ) { if ( Lang13.Double( Lang13.call( Lang13.bindf( start, dist ), end ) ) > Lang13.Double( maxnodes ) ) { return 0; } maxnodedepth = maxnodes; } open = new Heap( typeof(GlobalFuncs).GetMethod( "HeapPathWeightCompare" ) ); closed = new ByTable(); path = null; start = GlobalFuncs.get_turf( start ); if ( !Lang13.Bool( start ) ) { return 0; } open.Insert( new PathNode( start, null, false, Lang13.call( Lang13.bindf( start, dist ), end ), false ) ); while (!open.IsEmpty() && !( path != null )) { cur = open.Pop(); closed.Add( cur.source ); closeenough = null; if ( Lang13.Bool( mintargetdist ) ) { closeenough = Lang13.Double( Lang13.call( Lang13.bindf( cur.source, dist ), end ) ) <= Lang13.Double( mintargetdist ); } if ( Lang13.Bool( maxnodedepth ) && Lang13.Double( cur.nt ) > Lang13.Double( maxnodedepth ) ) { continue; } if ( cur.source == end || closeenough == true ) { path = new ByTable(); path.Add( cur.source ); while (Lang13.Bool( cur.prevNode )) { cur = cur.prevNode; path.Add( cur.source ); } break; } L = Lang13.call( Lang13.bindf( cur.source, adjacent ), atom, id, simulated_only ); T = null; foreach (dynamic _a in L ) { T = _a; if ( T == exclude || closed.contains( T ) ) { continue; } newg = cur.g + Lang13.call( Lang13.bindf( cur.source, dist ), T ); if ( !Lang13.Bool( T.PNode ) ) { open.Insert( new PathNode( T, cur, Lang13.Bool( newg ), Lang13.call( Lang13.bindf( T, dist ), end ), Lang13.Bool( cur.nt + 1 ) ) ); } else if ( Lang13.Double( newg ) < Lang13.Double( T.PNode.g ) ) { T.PNode.prevNode = cur; T.PNode.g = newg; ((dynamic)T.PNode).calc_f(); T.PNode.nt = cur.nt + 1; open.ReSort( T.PNode ); } }; } PN = null; foreach (dynamic _b in open.L ) { if ( !( _b is PathNode ) ) { continue; } PN = _b; PN.source.PNode = null; }; T2 = null; foreach (dynamic _c in closed ) { T2 = _c; T2.PNode = null; }; if ( path != null ) { i = null; i = 1; while (( i ??0) <= path.len / 2) { path.Swap( ((int)( i )), ((int)( path.len - ( i ??0) + 1 )) ); i++; } } return path; }