replaced erroneous 1-tuples with proper arrays where relevant

dist/screeps.d.ts

@@ -926,7 +926,7 @@ interface FindPathOpts {
     ignoreCreeps?: boolean;
     ignoreDestructibleStructures?: boolean;
     ignoreRoads?: boolean;
-    ignore?: [any | RoomPosition];
+    ignore?: any[] | RoomPosition[];
     avoid?: any[] | RoomPosition[];
     maxOps?: number;
     heuristicWeight?: number;
@@ -992,10 +992,10 @@ declare class GameMap {
      * @param toRoom Finish room name or room object.
      * @returns the route array or ERR_NO_PATH code
      */
-    findRoute(fromRoom: string | Room, toRoom: string | Room): [{
+    findRoute(fromRoom: string | Room, toRoom: string | Room): {
         exit: string;
         room: string;
-    }] | number;
+    }[] | number;
     /**
      * Get the linear distance (in rooms) between two rooms. You can use this function to estimate the energy cost of
      * sending resources through terminals, or using observers and nukes.
@@ -1277,7 +1277,7 @@ declare class RoomPosition {
      * @param objects An array of room's objects or RoomPosition objects that the search should be executed against.
      * @param opts An object containing pathfinding options (see Room.findPath), or one of the following: filter, algorithm
      */
-    findClosestByPath<T>(objects: [T | RoomPosition], opts?: {
+    findClosestByPath<T>(objects: T[] | RoomPosition[], opts?: {
         filter?: any | string;
         algorithm?: string;
     }): T;
@@ -1294,7 +1294,7 @@ declare class RoomPosition {
      * @param objects An array of room's objects or RoomPosition objects that the search should be executed against.
      * @param opts An object containing one of the following options: filter
      */
-    findClosestByRange<T>(objects: [T | RoomPosition], opts?: {
+    findClosestByRange<T>(objects: T[] | RoomPosition[], opts?: {
         filter: any | string;
     }): T;
     /**
@@ -1313,7 +1313,7 @@ declare class RoomPosition {
      * @param range The range distance.
      * @param opts See Room.find.
      */
-    findInRange<T>(objects: [T | RoomPosition], range: number, opts?: {
+    findInRange<T>(objects: T[] | RoomPosition[], range: number, opts?: {
         filter?: any | string;
         algorithm?: string;
     }): T[];

src/helpers.ts

@@ -73,7 +73,7 @@ interface FindPathOpts {
     ignoreCreeps?: boolean;
     ignoreDestructibleStructures?: boolean;
     ignoreRoads?: boolean;
-    ignore?: [any|RoomPosition];
+    ignore?: any[]|RoomPosition[];
     avoid?: any[]|RoomPosition[];
     maxOps?: number;
     heuristicWeight?: number;

src/map.ts

@@ -25,7 +25,7 @@ declare class GameMap {
      * @param toRoom Finish room name or room object.
      * @returns the route array or ERR_NO_PATH code
      */
-    findRoute(fromRoom: string|Room, toRoom: string|Room): [{exit: string, room: string}]|number;
+    findRoute(fromRoom: string|Room, toRoom: string|Room): {exit: string, room: string}[]|number;
     /**
      * Get the linear distance (in rooms) between two rooms. You can use this function to estimate the energy cost of
      * sending resources through terminals, or using observers and nukes.

src/room-position.ts

@@ -46,7 +46,7 @@ declare class RoomPosition {
      * @param objects An array of room's objects or RoomPosition objects that the search should be executed against.
      * @param opts An object containing pathfinding options (see Room.findPath), or one of the following: filter, algorithm
      */
-    findClosestByPath<T>(objects: [T|RoomPosition], opts?: {filter?: any|string, algorithm?: string}): T;
+    findClosestByPath<T>(objects: T[]|RoomPosition[], opts?: {filter?: any|string, algorithm?: string}): T;
     /**
      * Find an object with the shortest linear distance from the given position.
      * @param type See Room.find.
@@ -58,7 +58,7 @@ declare class RoomPosition {
      * @param objects An array of room's objects or RoomPosition objects that the search should be executed against.
      * @param opts An object containing one of the following options: filter
      */
-    findClosestByRange<T>(objects: [T|RoomPosition], opts?: {filter: any|string }): T;
+    findClosestByRange<T>(objects: T[]|RoomPosition[], opts?: {filter: any|string }): T;
     /**
      * Find all objects in the specified linear range.
      * @param type See Room.find.
@@ -72,7 +72,7 @@ declare class RoomPosition {
      * @param range The range distance.
      * @param opts See Room.find.
      */
-    findInRange<T>(objects: [T|RoomPosition], range: number, opts?: {filter?: any|string, algorithm?: string}): T[];
+    findInRange<T>(objects: T[]|RoomPosition[], range: number, opts?: {filter?: any|string, algorithm?: string}): T[];
     /**
      * Find an optimal path to the specified position using A* search algorithm. This method is a shorthand for Room.findPath. If the target is in another room, then the corresponding exit will be used as a target.
      * @param x X position in the room.