shelving 1.47.1 → 1.47.2

package/package.json

@@ -11,7 +11,7 @@
 		"state-management",
 		"query-builder"
 	],
-	"version": "1.47.1",
+	"version": "1.47.2",
 	"repository": "https://github.com/dhoulb/shelving",
 	"author": "Dave Houlbrooke <dave@shax.com>",
 	"license": "0BSD",

package/util/sort.d.ts

@@ -32,13 +32,13 @@ export declare function rankAsc(left: unknown, right: unknown): number;
 /** Rank two values in descending order. */
 export declare const rankDesc: (left: unknown, right: unknown) => number;
 /** Rank the keys of two entries in ascending order. */
-export declare const rankEntryKeyAsc: ([l]: Entry<unknown>, [r]: Entry<unknown>) => number;
+export declare const rankKeyAsc: ([l]: Entry<unknown>, [r]: Entry<unknown>) => number;
 /** Rank the keys of two entries in descending order. */
-export declare const rankEntryKeyDesc: ([l]: Entry<unknown>, [r]: Entry<unknown>) => number;
+export declare const rankKeyDesc: ([l]: Entry<unknown>, [r]: Entry<unknown>) => number;
 /** Rank the values of two entries in ascending order. */
-export declare const rankEntryValueAsc: ([, l]: Entry<unknown>, [, r]: Entry<unknown>) => number;
+export declare const rankValueAsc: ([, l]: Entry<unknown>, [, r]: Entry<unknown>) => number;
 /** Rank the values of two entries in descending order. */
-export declare const rankEntryValueDesc: ([, l]: Entry<unknown>, [, r]: Entry<unknown>) => number;
+export declare const rankValueDesc: ([, l]: Entry<unknown>, [, r]: Entry<unknown>) => number;
 /** Sort an iterable set of items using a ranker (defaults to sorting in ascending order). */
 export declare function sortItems<T>(input: Iterable<T>, ranker?: Ranker<T>): ImmutableArray<T>;
 /** Sort an array using a ranker (defaults to sorting in ascending order) */

package/util/sort.js

@@ -75,13 +75,13 @@ export function rankAsc(left, right) {
 /** Rank two values in descending order. */
 export const rankDesc = (left, right) => 0 - rankAsc(left, right);
 /** Rank the keys of two entries in ascending order. */
-export const rankEntryKeyAsc = ([l], [r]) => rankAsc(l, r);
+export const rankKeyAsc = ([l], [r]) => rankAsc(l, r);
 /** Rank the keys of two entries in descending order. */
-export const rankEntryKeyDesc = ([l], [r]) => rankDesc(l, r);
+export const rankKeyDesc = ([l], [r]) => rankDesc(l, r);
 /** Rank the values of two entries in ascending order. */
-export const rankEntryValueAsc = ([, l], [, r]) => rankAsc(l, r);
+export const rankValueAsc = ([, l], [, r]) => rankAsc(l, r);
 /** Rank the values of two entries in descending order. */
-export const rankEntryValueDesc = ([, l], [, r]) => rankDesc(l, r);
+export const rankValueDesc = ([, l], [, r]) => rankDesc(l, r);
 /**
  * Quick sort algorithm.
  * DH: We implement our own sorting algorithm so that:
@@ -144,18 +144,18 @@ export function sortArray(input, ranker = rankAsc) {
  * Sort an iterable set of entries (defaults to sorting by key in ascending order).
  * - Always returns an array
  */
-export function sortEntries(input, ranker = rankEntryKeyAsc) {
+export function sortEntries(input, ranker = rankKeyAsc) {
     const array = Array.from(input);
     _quicksort(array, ranker);
     return array;
 }
 /** Sort a map-like object using a ranker (defaults to sorting by key in ascending order). */
-export function sortObject(input, ranker = rankEntryKeyAsc) {
+export function sortObject(input, ranker = rankKeyAsc) {
     const array = Object.entries(input);
     return _quicksort(array, ranker) ? Object.fromEntries(array) : input;
 }
 /** Sort a map using a ranker (defaults to sorting by key in ascending order). */
-export function sortMap(input, ranker = rankEntryKeyAsc) {
+export function sortMap(input, ranker = rankKeyAsc) {
     const array = Array.from(input);
     return _quicksort(array, ranker) ? new Map(array) : input;
 }