Add comparator function to ordinal domain sort

CHANGELOG.md

@@ -1,6 +1,15 @@
 Changelog
 ===
 
+# 8.0.1
+
+> 2023-10-14
+
+Corrects the change in 8.0.0 for sorting a domain by adding a comparator function to better sort strings and dates. Also fixes an oversight where domains that were dates would not be calculated uniquely. Also some security upgrades. [Closes #151](https://github.com/mhkeller/layercake/issues/151)
+
+* [PR#149](https://github.com/mhkeller/layercake/pull/149)
+* [PR#151](https://github.com/mhkeller/layercake/pull/151)
+
 # 8.0.0
 
 > 2023-09-19

src/lib/lib/calcUniques.js

@@ -10,6 +10,8 @@
 	@param {{x?: Function, y?: Function, z?: Function, r?: Function}} fields An object containing `x`, `y`, `r` or `z` keys that equal an accessor function. If an accessor function returns an array of values, each value will also be evaluated..
 	@returns {{x?: [min: Number, max: Number]|[min: String, max: String], y?: [min: Number, max: Number]|[min: String, max: String], z?: [min: Number, max: Number]|[min: String, max: String], r?: [min: Number, max: Number]|[min: String, max: String]}} An object with the same structure as `fields` but instead of an accessor, each key contains an array of unique items.
 */
+import { ascending, InternSet } from 'd3-array';
+
 export default function calcUniques (data, fields, { sort = false } = {}) {
 	if (!Array.isArray(data)) {
 		throw new TypeError(`The first argument of calcUniques() must be an array. You passed in a ${typeof data}. If you got this error using the <LayerCake> component, consider passing a flat array to the \`flatData\` prop. More info: https://layercake.graphics/guide/#flatdata`);
@@ -38,7 +40,7 @@ export default function calcUniques (data, fields, { sort = false } = {}) {
 
 	const dl = data.length;
 	for (i = 0; i < kl; i += 1) {
-		set = new Set();
+		set = new InternSet();
 		s = keys[i];
 		acc = fields[s];
 		for (j = 0; j < dl; j += 1) {
@@ -48,13 +50,13 @@ export default function calcUniques (data, fields, { sort = false } = {}) {
 				for (k = 0; k < vl; k += 1) {
 					set.add(val[k]);
 				}
-			} else{
+			} else {
 				set.add(val);
 			}
 		}
 		const results = Array.from(set);
 		if (sort === true) {
-			results.sort();
+			results.sort(ascending);
 		}
 		uniques[s] = results;
 	}