@rbxts/types 1.0.546 → 1.0.547

package/include/lua.d.ts

@@ -671,7 +671,20 @@ declare namespace bit32 {
 }
 
 declare namespace table {
-	/** Sorts list elements in a given order, in-place, from `list[1]` to `list[#list]`. Comp is a function that receives two list elements and returns true when the first element must come before the second in the final order (so that `not comp(list[i+1],list[i])` will be true after the sort). */
+	/**
+	 * Sets the value for all keys within the given table to nil. This causes the # operator to return 0 for the given
+	 * table. The allocated capacity of the table’s array portion is maintained, which allows for efficient re-use of
+	 * the space.
+	 *
+	 * This function does not delete/destroy the table provided to it. This function is meant to be used specifically
+	 * for tables that are to be re-used.
+	 */
+	function clear(t: object): void;
+	/**
+	 * Sorts list elements in a given order, in-place, from `list[1]` to `list[#list]`. Comp is a function that
+	 * receives two list elements and returns true when the first element must come before the second in the final order
+	 * (so that `not comp(list[i+1],list[i])` will be true after the sort).
+	 */
 	function sort<T>(t: Array<T>, comp?: (a: T, b: T) => boolean): void;
 	/** Makes the table read-only and prohibits all further modifications */
 	function freeze(t: object): void;
@@ -759,7 +772,7 @@ declare function pairs<K, V>(
 ): IterableFunction<LuaTuple<[Exclude<K, undefined>, Exclude<V, undefined>]>>;
 declare function pairs<T extends object>(
 	object: T,
-): object extends Required<T>
+): keyof T extends never
 	? IterableFunction<LuaTuple<[unknown, defined]>>
 	: IterableFunction<LuaTuple<[keyof T, Exclude<T[keyof T], undefined>]>>;
 

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@rbxts/types",
-	"version": "1.0.546",
+	"version": "1.0.547",
 	"publishConfig": {
 		"access": "public"
 	},