@solid2-aria/stately 0.0.0-stage → 0.0.1

package/dist/data/create-list-data.js

@@ -0,0 +1,250 @@
+/*
+ * Copyright 2020 Adobe. All rights reserved.
+ * This file is licensed to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may obtain a copy
+ * of the License at http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software distributed under
+ * the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS
+ * OF ANY KIND, either express or implied. See the License for the specific language
+ * governing permissions and limitations under the License.
+ */
+/*
+ * Derived from Adobe React Spectrum: packages/react-stately/src/data/useListData.ts.
+ * Modified for Solid Aria: adapted reactive state, getters, imports, and APIs for Solid 2.
+ * Licensed under Apache-2.0. See LICENSES/Apache-2.0.txt and NOTICE.txt at the repository root.
+ */
+import { getItemKey } from "../utils/get-item-key.js";
+import { createMemo, createSignal, merge, untrack } from "solid-js";
+// src/data/create-list-data.ts
+/**
+* Manages state for an immutable list data structure, and provides convenience methods to
+* update the data over time.
+*/
+function createListData(options) {
+	const initialItems = createMemo(() => options.initialItems ?? []);
+	const initialSelectedKeys = createMemo(() => options.initialSelectedKeys);
+	const getKey = createMemo(() => options.getKey ?? getItemKey);
+	const filter = createMemo(() => options.filter);
+	const initialFilterText = createMemo(() => options.initialFilterText ?? "");
+	const [state, setState] = createSignal(untrack(() => {
+		const currentInitialItems = initialItems();
+		const currentInitialSelectedKeys = initialSelectedKeys();
+		return {
+			filterText: initialFilterText(),
+			items: currentInitialItems,
+			selectedKeys: currentInitialSelectedKeys === "all" ? "all" : new Set(currentInitialSelectedKeys)
+		};
+	}), { ownedWrite: true });
+	const filteredItems = createMemo(() => {
+		const currentFilter = filter();
+		const currentState = state();
+		return currentFilter ? currentState.items.filter((item) => currentFilter(item, currentState.filterText)) : currentState.items;
+	});
+	return merge({
+		get filterText() {
+			return state().filterText;
+		},
+		get selectedKeys() {
+			return state().selectedKeys;
+		}
+	}, { get items() {
+		return filteredItems();
+	} }, createListActions({ get getKey() {
+		return getKey();
+	} }, (update) => {
+		setState(update);
+	}), { getItem(key) {
+		return state().items.find((item) => {
+			return getKey()(item) === key;
+		});
+	} });
+}
+function createListActions(opts, dispatch) {
+	const getKey = (item) => (opts.getKey ?? getItemKey)(item);
+	return {
+		addKeysToSelection(selectedKeys) {
+			dispatch((state) => {
+				if (state.selectedKeys === "all") return state;
+				if (selectedKeys === "all") return {
+					...state,
+					selectedKeys: "all"
+				};
+				return {
+					...state,
+					selectedKeys: /* @__PURE__ */ new Set([...state.selectedKeys, ...selectedKeys])
+				};
+			});
+		},
+		append(...values) {
+			dispatch((state) => insert(state, state.items.length, ...values));
+		},
+		insert(index, ...values) {
+			dispatch((state) => insert(state, index, ...values));
+		},
+		insertAfter(key, ...values) {
+			dispatch((state) => {
+				let index = state.items.findIndex((item) => getKey?.(item) === key);
+				if (index === -1) {
+					if (state.items.length === 0) index = 0;
+					else return state;
+				}
+				return insert(state, index + 1, ...values);
+			});
+		},
+		insertBefore(key, ...values) {
+			dispatch((state) => {
+				let index = state.items.findIndex((item) => getKey?.(item) === key);
+				if (index === -1) {
+					if (state.items.length === 0) index = 0;
+					else return state;
+				}
+				return insert(state, index, ...values);
+			});
+		},
+		move(key, toIndex) {
+			dispatch((state) => {
+				const index = state.items.findIndex((item) => getKey(item) === key);
+				if (index === -1) return state;
+				const copy = [...state.items];
+				const removed = copy.splice(index, 1);
+				copy.splice(toIndex, 0, ...removed);
+				return {
+					...state,
+					items: copy
+				};
+			});
+		},
+		moveAfter(key, keys) {
+			dispatch((state) => {
+				const toIndex = state.items.findIndex((item) => getKey(item) === key);
+				if (toIndex === -1) return state;
+				return move(state, [...keys].map((localKey) => state.items.findIndex((item) => getKey(item) === localKey)).toSorted((a, b) => a - b), toIndex + 1);
+			});
+		},
+		moveBefore(key, keys) {
+			dispatch((state) => {
+				const toIndex = state.items.findIndex((item) => getKey(item) === key);
+				if (toIndex === -1) return state;
+				return move(state, [...keys].map((localKey) => state.items.findIndex((item) => getKey(item) === localKey)).toSorted((a, b) => a - b), toIndex);
+			});
+		},
+		prepend(...values) {
+			dispatch((state) => insert(state, 0, ...values));
+		},
+		remove(...keys) {
+			dispatch((state) => {
+				const keySet = new Set(keys);
+				const items = state.items.filter((item) => !keySet.has(getKey(item)));
+				let selection = "all";
+				if (state.selectedKeys !== "all") {
+					selection = new Set(state.selectedKeys);
+					for (const key of keys) selection.delete(key);
+				}
+				if ((opts.cursor === null || opts.cursor === void 0) && items.length === 0) selection = /* @__PURE__ */ new Set();
+				return {
+					...state,
+					items,
+					selectedKeys: selection
+				};
+			});
+		},
+		removeKeysFromSelection(selectedKeys) {
+			dispatch((state) => {
+				if (selectedKeys === "all") return {
+					...state,
+					selectedKeys: /* @__PURE__ */ new Set()
+				};
+				const selection = state.selectedKeys === "all" ? new Set(state.items.map(getKey)) : new Set(state.selectedKeys);
+				for (const key of selectedKeys) selection.delete(key);
+				return {
+					...state,
+					selectedKeys: selection
+				};
+			});
+		},
+		removeSelectedItems() {
+			dispatch((state) => {
+				if (state.selectedKeys === "all") return {
+					...state,
+					items: [],
+					selectedKeys: /* @__PURE__ */ new Set()
+				};
+				const { selectedKeys } = state;
+				const items = state.items.filter((item) => !selectedKeys.has(getKey(item)));
+				return {
+					...state,
+					items,
+					selectedKeys: /* @__PURE__ */ new Set()
+				};
+			});
+		},
+		setFilterText(filterText) {
+			dispatch((state) => ({
+				...state,
+				filterText
+			}));
+		},
+		setSelectedKeys(selectedKeys) {
+			dispatch((state) => ({
+				...state,
+				selectedKeys
+			}));
+		},
+		update(key, newValue) {
+			dispatch((state) => {
+				const index = state.items.findIndex((item) => getKey(item) === key);
+				if (index === -1) return state;
+				const items = state.items.map((item, itemIndex) => {
+					if (itemIndex !== index) return item;
+					if (typeof newValue === "function") return newValue(item);
+					return newValue;
+				});
+				return {
+					...state,
+					items
+				};
+			});
+		}
+	};
+}
+function insert(state, index, ...values) {
+	return {
+		...state,
+		items: [
+			...state.items.slice(0, index),
+			...values,
+			...state.items.slice(index)
+		]
+	};
+}
+function move(state, indices, initialToIndex) {
+	let toIndex = initialToIndex;
+	toIndex -= indices.filter((index) => index < toIndex).length;
+	const moves = indices.map((from) => {
+		const localMove = {
+			from,
+			to: toIndex
+		};
+		toIndex += 1;
+		return localMove;
+	});
+	for (const [i, currentMove] of moves.entries()) {
+		const a = currentMove.from;
+		for (const laterMove of moves.slice(i)) if (laterMove.from > a) laterMove.from -= 1;
+	}
+	for (const [i, a] of moves.entries()) for (const b of moves.slice(i + 1).toReversed()) if (b.from < a.to) a.to += 1;
+	else b.from += 1;
+	const copy = [...state.items];
+	for (const localMove of moves) {
+		const removed = copy.splice(localMove.from, 1);
+		copy.splice(localMove.to, 0, ...removed);
+	}
+	return {
+		...state,
+		items: copy
+	};
+}
+export { createListActions, createListData };
+
+//# sourceMappingURL=create-list-data.js.map

package/dist/data/create-list-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-list-data.js","names":[],"sources":["../../src/data/create-list-data.ts"],"sourcesContent":["/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n/*\n * Derived from Adobe React Spectrum: packages/react-stately/src/data/useListData.ts.\n * Modified for Solid Aria: adapted reactive state, getters, imports, and APIs for Solid 2.\n * Licensed under Apache-2.0. See LICENSES/Apache-2.0.txt and NOTICE.txt at the repository root.\n */\n\nimport type { Key, Selection } from \"@solid2-aria/types-shared\";\nimport { createMemo, createSignal, untrack, merge } from \"solid-js\";\n\nimport { getItemKey } from \"../utils/get-item-key\";\n\nexport interface ListOptions<T> {\n  /** Initial items in the list. */\n  initialItems?: T[];\n  /** The keys for the initially selected items. */\n  initialSelectedKeys?: \"all\" | Iterable<Key>;\n  /** The initial text to filter the list by. */\n  initialFilterText?: string;\n  /** A function that returns a unique key for an item object. */\n  getKey?: (item: T) => Key;\n  /** A function that returns whether a item matches the current filter text. */\n  filter?: (item: T, filterText: string) => boolean;\n}\n\nexport interface ListData<T> {\n  /** The items in the list. */\n  items: T[];\n  /** The keys of the currently selected items in the list. */\n  selectedKeys: Selection;\n  /** Sets the selected keys. */\n  setSelectedKeys: (keys: Selection) => void;\n  /** Adds the given keys to the current selected keys. */\n  addKeysToSelection: (keys: Selection) => void;\n  /** Removes the given keys from the current selected keys. */\n  removeKeysFromSelection: (keys: Selection) => void;\n  /** The current filter text. */\n  filterText: string;\n  /** Sets the filter text. */\n  setFilterText: (filterText: string) => void;\n  /**\n   * Gets an item from the list by key.\n   *\n   * @param key - The key of the item to retrieve.\n   */\n  getItem: (key: Key) => T | undefined;\n  /**\n   * Inserts items into the list at the given index.\n   *\n   * @param index - The index to insert into.\n   * @param values - The values to insert.\n   */\n  insert: (index: number, ...values: T[]) => void;\n  /**\n   * Inserts items into the list before the item at the given key.\n   *\n   * @param key - The key of the item to insert before.\n   * @param values - The values to insert.\n   */\n  insertBefore: (key: Key, ...values: T[]) => void;\n  /**\n   * Inserts items into the list after the item at the given key.\n   *\n   * @param key - The key of the item to insert after.\n   * @param values - The values to insert.\n   */\n  insertAfter: (key: Key, ...values: T[]) => void;\n  /**\n   * Appends items to the list.\n   *\n   * @param values - The values to insert.\n   */\n  append: (...values: T[]) => void;\n  /**\n   * Prepends items to the list.\n   *\n   * @param value - The value to insert.\n   */\n  prepend: (...values: T[]) => void;\n  /**\n   * Removes items from the list by their keys.\n   *\n   * @param keys - The keys of the item to remove.\n   */\n  remove: (...keys: Key[]) => void;\n  /**\n   * Removes all items from the list that are currently\n   * in the set of selected items.\n   */\n  removeSelectedItems: () => void;\n  /**\n   * Moves an item within the list.\n   *\n   * @param key - The key of the item to move.\n   * @param toIndex - The index to move the item to.\n   */\n  move: (key: Key, toIndex: number) => void;\n  /**\n   * Moves one or more items before a given key.\n   *\n   * @param key - The key of the item to move the items before.\n   * @param keys - The keys of the items to move.\n   */\n  moveBefore: (key: Key, keys: Iterable<Key>) => void;\n  /**\n   * Moves one or more items after a given key.\n   *\n   * @param key - The key of the item to move the items after.\n   * @param keys - The keys of the items to move.\n   */\n  moveAfter: (key: Key, keys: Iterable<Key>) => void;\n  /**\n   * Updates an item in the list.\n   *\n   * @param key - The key of the item to update.\n   * @param newValue - The new value for the item, or a function that returns the new value based on\n   *   the previous value.\n   */\n  update: (key: Key, newValue: T | ((prev: T) => T)) => void;\n}\n\nexport interface ListState<T> {\n  items: T[];\n  selectedKeys: Selection;\n  filterText: string;\n}\n\ninterface CreateListOptions<T, C> extends ListOptions<T> {\n  cursor?: C;\n}\n\n/**\n * Manages state for an immutable list data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function createListData<T>(options: ListOptions<T>): ListData<T> {\n  const initialItems = createMemo(() => options.initialItems ?? []);\n  const initialSelectedKeys = createMemo(() => options.initialSelectedKeys);\n  const getKey = createMemo(() => options.getKey ?? getItemKey);\n  const filter = createMemo(() => options.filter);\n  const initialFilterText = createMemo(() => options.initialFilterText ?? \"\");\n\n  // Store both items and filteredItems in state so we can go back to the unfiltered list\n  const [state, setState] = createSignal<ListState<T>>(\n    untrack(() => {\n      const currentInitialItems = initialItems();\n      const currentInitialSelectedKeys = initialSelectedKeys();\n      const currentInitialFilterText = initialFilterText();\n\n      return {\n        filterText: currentInitialFilterText,\n        items: currentInitialItems,\n        selectedKeys:\n          currentInitialSelectedKeys === \"all\"\n            ? \"all\"\n            : new Set(currentInitialSelectedKeys),\n      };\n    }),\n    { ownedWrite: true }\n  );\n\n  const filteredItems = createMemo(() => {\n    const currentFilter = filter();\n    const currentState = state();\n\n    return currentFilter\n      ? currentState.items.filter((item) =>\n          currentFilter(item, currentState.filterText)\n        )\n      : currentState.items;\n  });\n\n  return merge(\n    {\n      get filterText() {\n        return state().filterText;\n      },\n      get selectedKeys() {\n        return state().selectedKeys;\n      },\n    },\n    {\n      get items() {\n        return filteredItems();\n      },\n    } satisfies Partial<ListData<T>>,\n    createListActions(\n      {\n        get getKey() {\n          return getKey();\n        },\n      },\n      (update) => {\n        setState(update);\n      }\n    ),\n    {\n      getItem(key: Key) {\n        const currentState = state();\n\n        return currentState.items.find((item) => {\n          const currentGetKey = getKey();\n\n          return currentGetKey(item) === key;\n        });\n      },\n    } satisfies Partial<ListData<T>>\n  );\n}\n\nexport function createListActions<T, C>(\n  opts: CreateListOptions<T, C>,\n  dispatch: (updater: (state: ListState<T>) => ListState<T>) => void\n): Omit<ListData<T>, \"items\" | \"selectedKeys\" | \"getItem\" | \"filterText\"> {\n  const getKey = (item: T) => (opts.getKey ?? getItemKey)(item);\n\n  return {\n    addKeysToSelection(selectedKeys: Selection) {\n      dispatch((state) => {\n        if (state.selectedKeys === \"all\") {\n          return state;\n        }\n\n        if (selectedKeys === \"all\") {\n          return {\n            ...state,\n            selectedKeys: \"all\",\n          };\n        }\n\n        return {\n          ...state,\n          selectedKeys: new Set([...state.selectedKeys, ...selectedKeys]),\n        };\n      });\n    },\n    append(...values: T[]) {\n      dispatch((state) => insert(state, state.items.length, ...values));\n    },\n    insert(index: number, ...values: T[]) {\n      dispatch((state) => insert(state, index, ...values));\n    },\n    insertAfter(key: Key, ...values: T[]) {\n      dispatch((state) => {\n        let index = state.items.findIndex((item) => getKey?.(item) === key);\n\n        if (index === -1) {\n          if (state.items.length === 0) {\n            index = 0;\n          } else {\n            return state;\n          }\n        }\n\n        return insert(state, index + 1, ...values);\n      });\n    },\n    insertBefore(key: Key, ...values: T[]) {\n      dispatch((state) => {\n        let index = state.items.findIndex((item) => getKey?.(item) === key);\n\n        if (index === -1) {\n          if (state.items.length === 0) {\n            index = 0;\n          } else {\n            return state;\n          }\n        }\n\n        return insert(state, index, ...values);\n      });\n    },\n    move(key: Key, toIndex: number) {\n      dispatch((state) => {\n        const index = state.items.findIndex((item) => getKey(item) === key);\n\n        if (index === -1) {\n          return state;\n        }\n\n        const copy = [...state.items];\n        const removed = copy.splice(index, 1);\n        copy.splice(toIndex, 0, ...removed);\n\n        return {\n          ...state,\n          items: copy,\n        };\n      });\n    },\n    moveAfter(key: Key, keys: Iterable<Key>) {\n      dispatch((state) => {\n        const toIndex = state.items.findIndex((item) => getKey(item) === key);\n\n        if (toIndex === -1) {\n          return state;\n        }\n\n        const keyArray = [...keys];\n\n        const indices = keyArray\n          .map((localKey) =>\n            state.items.findIndex((item) => getKey(item) === localKey)\n          )\n          .toSorted((a, b) => a - b);\n\n        return move(state, indices, toIndex + 1);\n      });\n    },\n    moveBefore(key: Key, keys: Iterable<Key>) {\n      dispatch((state) => {\n        const toIndex = state.items.findIndex((item) => getKey(item) === key);\n\n        if (toIndex === -1) {\n          return state;\n        }\n\n        // Find indices of keys to move. Sort them so that the order in the list is retained.\n        const keyArray = [...keys];\n\n        const indices = keyArray\n          .map((localKey) =>\n            state.items.findIndex((item) => getKey(item) === localKey)\n          )\n          .toSorted((a, b) => a - b);\n\n        return move(state, indices, toIndex);\n      });\n    },\n    prepend(...values: T[]) {\n      dispatch((state) => insert(state, 0, ...values));\n    },\n    remove(...keys: Key[]) {\n      dispatch((state) => {\n        const keySet = new Set(keys);\n        const items = state.items.filter((item) => !keySet.has(getKey(item)));\n        let selection: Selection = \"all\";\n\n        if (state.selectedKeys !== \"all\") {\n          selection = new Set(state.selectedKeys);\n\n          for (const key of keys) {\n            selection.delete(key);\n          }\n        }\n\n        if (\n          (opts.cursor === null || opts.cursor === undefined) &&\n          items.length === 0\n        ) {\n          selection = new Set();\n        }\n\n        return {\n          ...state,\n          items,\n          selectedKeys: selection,\n        };\n      });\n    },\n    removeKeysFromSelection(selectedKeys: Selection) {\n      dispatch((state) => {\n        if (selectedKeys === \"all\") {\n          return {\n            ...state,\n            selectedKeys: new Set(),\n          };\n        }\n\n        const selection: Selection =\n          state.selectedKeys === \"all\"\n            ? new Set(state.items.map(getKey))\n            : new Set(state.selectedKeys);\n\n        for (const key of selectedKeys) {\n          selection.delete(key);\n        }\n\n        return {\n          ...state,\n          selectedKeys: selection,\n        };\n      });\n    },\n    removeSelectedItems() {\n      dispatch((state) => {\n        if (state.selectedKeys === \"all\") {\n          return {\n            ...state,\n            items: [],\n            selectedKeys: new Set(),\n          };\n        }\n\n        const { selectedKeys } = state;\n\n        const items = state.items.filter(\n          (item) => !selectedKeys.has(getKey(item))\n        );\n\n        return {\n          ...state,\n          items,\n          selectedKeys: new Set(),\n        };\n      });\n    },\n    setFilterText(filterText: string) {\n      dispatch((state) => ({\n        ...state,\n        filterText,\n      }));\n    },\n    setSelectedKeys(selectedKeys: Selection) {\n      dispatch((state) => ({\n        ...state,\n        selectedKeys,\n      }));\n    },\n    update(key: Key, newValue: T | ((prev: T) => T)) {\n      dispatch((state) => {\n        const index = state.items.findIndex((item) => getKey(item) === key);\n\n        if (index === -1) {\n          return state;\n        }\n\n        const items = state.items.map((item, itemIndex) => {\n          if (itemIndex !== index) {\n            return item;\n          }\n\n          if (typeof newValue === \"function\") {\n            // SAFETY: the public update contract treats functions as updaters, including when T is callable.\n            // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n            return (newValue as (prev: T) => T)(item);\n          }\n\n          return newValue;\n        });\n\n        return {\n          ...state,\n          items,\n        };\n      });\n    },\n  };\n}\n\nfunction insert<T>(\n  state: ListState<T>,\n  index: number,\n  ...values: T[]\n): ListState<T> {\n  return {\n    ...state,\n    items: [\n      ...state.items.slice(0, index),\n      ...values,\n      ...state.items.slice(index),\n    ],\n  };\n}\n\nfunction move<T>(\n  state: ListState<T>,\n  indices: number[],\n  initialToIndex: number\n): ListState<T> {\n  let toIndex = initialToIndex;\n\n  // Shift the target down by the number of items being moved from before the target\n  toIndex -= indices.filter((index) => index < toIndex).length;\n\n  const moves = indices.map((from) => {\n    const localMove = { from, to: toIndex };\n    toIndex += 1;\n\n    return localMove;\n  });\n\n  // Shift later from indices down if they have a larger index\n  for (const [i, currentMove] of moves.entries()) {\n    const a = currentMove.from;\n\n    for (const laterMove of moves.slice(i)) {\n      if (laterMove.from > a) {\n        laterMove.from -= 1;\n      }\n    }\n  }\n\n  // Interleave the moves so they can be applied one by one rather than all at once\n  for (const [i, a] of moves.entries()) {\n    for (const b of moves.slice(i + 1).toReversed()) {\n      if (b.from < a.to) {\n        a.to += 1;\n      } else {\n        b.from += 1;\n      }\n    }\n  }\n\n  const copy = [...state.items];\n\n  for (const localMove of moves) {\n    const removed = copy.splice(localMove.from, 1);\n    copy.splice(localMove.to, 0, ...removed);\n  }\n\n  return {\n    ...state,\n    items: copy,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAiJA,SAAgB,eAAkB,SAAsC;CACtE,MAAM,eAAe,iBAAiB,QAAQ,gBAAgB,CAAC,CAAC;CAChE,MAAM,sBAAsB,iBAAiB,QAAQ,mBAAmB;CACxE,MAAM,SAAS,iBAAiB,QAAQ,UAAU,UAAU;CAC5D,MAAM,SAAS,iBAAiB,QAAQ,MAAM;CAC9C,MAAM,oBAAoB,iBAAiB,QAAQ,qBAAqB,EAAE;CAG1E,MAAM,CAAC,OAAO,YAAY,aACxB,cAAc;EACZ,MAAM,sBAAsB,aAAa;EACzC,MAAM,6BAA6B,oBAAoB;EAGvD,OAAO;GACL,YAH+B,kBAGI;GACnC,OAAO;GACP,cACE,+BAA+B,QAC3B,QACA,IAAI,IAAI,0BAA0B;EAC1C;CACF,CAAC,GACD,EAAE,YAAY,KAAK,CACrB;CAEA,MAAM,gBAAgB,iBAAiB;EACrC,MAAM,gBAAgB,OAAO;EAC7B,MAAM,eAAe,MAAM;EAE3B,OAAO,gBACH,aAAa,MAAM,QAAQ,SACzB,cAAc,MAAM,aAAa,UAAU,CAC7C,IACA,aAAa;CACnB,CAAC;CAED,OAAO,MACL;EACE,IAAI,aAAa;GACf,OAAO,MAAM,CAAC,CAAC;EACjB;EACA,IAAI,eAAe;GACjB,OAAO,MAAM,CAAC,CAAC;EACjB;CACF,GACA,EACE,IAAI,QAAQ;EACV,OAAO,cAAc;CACvB,EACF,GACA,kBACE,EACE,IAAI,SAAS;EACX,OAAO,OAAO;CAChB,EACF,IACC,WAAW;EACV,SAAS,MAAM;CACjB,CACF,GACA,EACE,QAAQ,KAAU;EAGhB,OAFqB,MAEH,CAAC,CAAC,MAAM,MAAM,SAAS;GAGvC,OAFsB,OAEH,CAAC,CAAC,IAAI,MAAM;EACjC,CAAC;CACH,EACF,CACF;AACF;AAEA,SAAgB,kBACd,MACA,UACwE;CACxE,MAAM,UAAU,UAAa,KAAK,UAAU,WAAA,CAAY,IAAI;CAE5D,OAAO;EACL,mBAAmB,cAAyB;GAC1C,UAAU,UAAU;IAClB,IAAI,MAAM,iBAAiB,OACzB,OAAO;IAGT,IAAI,iBAAiB,OACnB,OAAO;KACL,GAAG;KACH,cAAc;IAChB;IAGF,OAAO;KACL,GAAG;KACH,8BAAc,IAAI,IAAI,CAAC,GAAG,MAAM,cAAc,GAAG,YAAY,CAAC;IAChE;GACF,CAAC;EACH;EACA,OAAO,GAAG,QAAa;GACrB,UAAU,UAAU,OAAO,OAAO,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;EAClE;EACA,OAAO,OAAe,GAAG,QAAa;GACpC,UAAU,UAAU,OAAO,OAAO,OAAO,GAAG,MAAM,CAAC;EACrD;EACA,YAAY,KAAU,GAAG,QAAa;GACpC,UAAU,UAAU;IAClB,IAAI,QAAQ,MAAM,MAAM,WAAW,SAAS,SAAS,IAAI,MAAM,GAAG;IAElE,IAAI,UAAU,IAAI;KAChB,IAAI,MAAM,MAAM,WAAW,GACzB,QAAQ;UAER,OAAO;IAEX;IAEA,OAAO,OAAO,OAAO,QAAQ,GAAG,GAAG,MAAM;GAC3C,CAAC;EACH;EACA,aAAa,KAAU,GAAG,QAAa;GACrC,UAAU,UAAU;IAClB,IAAI,QAAQ,MAAM,MAAM,WAAW,SAAS,SAAS,IAAI,MAAM,GAAG;IAElE,IAAI,UAAU,IAAI;KAChB,IAAI,MAAM,MAAM,WAAW,GACzB,QAAQ;UAER,OAAO;IAEX;IAEA,OAAO,OAAO,OAAO,OAAO,GAAG,MAAM;GACvC,CAAC;EACH;EACA,KAAK,KAAU,SAAiB;GAC9B,UAAU,UAAU;IAClB,MAAM,QAAQ,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,GAAG;IAElE,IAAI,UAAU,IACZ,OAAO;IAGT,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK;IAC5B,MAAM,UAAU,KAAK,OAAO,OAAO,CAAC;IACpC,KAAK,OAAO,SAAS,GAAG,GAAG,OAAO;IAElC,OAAO;KACL,GAAG;KACH,OAAO;IACT;GACF,CAAC;EACH;EACA,UAAU,KAAU,MAAqB;GACvC,UAAU,UAAU;IAClB,MAAM,UAAU,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,GAAG;IAEpE,IAAI,YAAY,IACd,OAAO;IAWT,OAAO,KAAK,OANI,CAFE,GAAG,IAEE,CAAC,CACrB,KAAK,aACJ,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,QAAQ,CAC3D,CAAC,CACA,UAAU,GAAG,MAAM,IAAI,CAED,GAAG,UAAU,CAAC;GACzC,CAAC;EACH;EACA,WAAW,KAAU,MAAqB;GACxC,UAAU,UAAU;IAClB,MAAM,UAAU,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,GAAG;IAEpE,IAAI,YAAY,IACd,OAAO;IAYT,OAAO,KAAK,OANI,CAFE,GAAG,IAEE,CAAC,CACrB,KAAK,aACJ,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,QAAQ,CAC3D,CAAC,CACA,UAAU,GAAG,MAAM,IAAI,CAED,GAAG,OAAO;GACrC,CAAC;EACH;EACA,QAAQ,GAAG,QAAa;GACtB,UAAU,UAAU,OAAO,OAAO,GAAG,GAAG,MAAM,CAAC;EACjD;EACA,OAAO,GAAG,MAAa;GACrB,UAAU,UAAU;IAClB,MAAM,SAAS,IAAI,IAAI,IAAI;IAC3B,MAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,CAAC,OAAO,IAAI,OAAO,IAAI,CAAC,CAAC;IACpE,IAAI,YAAuB;IAE3B,IAAI,MAAM,iBAAiB,OAAO;KAChC,YAAY,IAAI,IAAI,MAAM,YAAY;KAEtC,KAAK,MAAM,OAAO,MAChB,UAAU,OAAO,GAAG;IAExB;IAEA,KACG,KAAK,WAAW,QAAQ,KAAK,WAAW,KAAA,MACzC,MAAM,WAAW,GAEjB,4BAAY,IAAI,IAAI;IAGtB,OAAO;KACL,GAAG;KACH;KACA,cAAc;IAChB;GACF,CAAC;EACH;EACA,wBAAwB,cAAyB;GAC/C,UAAU,UAAU;IAClB,IAAI,iBAAiB,OACnB,OAAO;KACL,GAAG;KACH,8BAAc,IAAI,IAAI;IACxB;IAGF,MAAM,YACJ,MAAM,iBAAiB,QACnB,IAAI,IAAI,MAAM,MAAM,IAAI,MAAM,CAAC,IAC/B,IAAI,IAAI,MAAM,YAAY;IAEhC,KAAK,MAAM,OAAO,cAChB,UAAU,OAAO,GAAG;IAGtB,OAAO;KACL,GAAG;KACH,cAAc;IAChB;GACF,CAAC;EACH;EACA,sBAAsB;GACpB,UAAU,UAAU;IAClB,IAAI,MAAM,iBAAiB,OACzB,OAAO;KACL,GAAG;KACH,OAAO,CAAC;KACR,8BAAc,IAAI,IAAI;IACxB;IAGF,MAAM,EAAE,iBAAiB;IAEzB,MAAM,QAAQ,MAAM,MAAM,QACvB,SAAS,CAAC,aAAa,IAAI,OAAO,IAAI,CAAC,CAC1C;IAEA,OAAO;KACL,GAAG;KACH;KACA,8BAAc,IAAI,IAAI;IACxB;GACF,CAAC;EACH;EACA,cAAc,YAAoB;GAChC,UAAU,WAAW;IACnB,GAAG;IACH;GACF,EAAE;EACJ;EACA,gBAAgB,cAAyB;GACvC,UAAU,WAAW;IACnB,GAAG;IACH;GACF,EAAE;EACJ;EACA,OAAO,KAAU,UAAgC;GAC/C,UAAU,UAAU;IAClB,MAAM,QAAQ,MAAM,MAAM,WAAW,SAAS,OAAO,IAAI,MAAM,GAAG;IAElE,IAAI,UAAU,IACZ,OAAO;IAGT,MAAM,QAAQ,MAAM,MAAM,KAAK,MAAM,cAAc;KACjD,IAAI,cAAc,OAChB,OAAO;KAGT,IAAI,OAAO,aAAa,YAGtB,OAAQ,SAA4B,IAAI;KAG1C,OAAO;IACT,CAAC;IAED,OAAO;KACL,GAAG;KACH;IACF;GACF,CAAC;EACH;CACF;AACF;AAEA,SAAS,OACP,OACA,OACA,GAAG,QACW;CACd,OAAO;EACL,GAAG;EACH,OAAO;GACL,GAAG,MAAM,MAAM,MAAM,GAAG,KAAK;GAC7B,GAAG;GACH,GAAG,MAAM,MAAM,MAAM,KAAK;EAC5B;CACF;AACF;AAEA,SAAS,KACP,OACA,SACA,gBACc;CACd,IAAI,UAAU;CAGd,WAAW,QAAQ,QAAQ,UAAU,QAAQ,OAAO,CAAC,CAAC;CAEtD,MAAM,QAAQ,QAAQ,KAAK,SAAS;EAClC,MAAM,YAAY;GAAE;GAAM,IAAI;EAAQ;EACtC,WAAW;EAEX,OAAO;CACT,CAAC;CAGD,KAAK,MAAM,CAAC,GAAG,gBAAgB,MAAM,QAAQ,GAAG;EAC9C,MAAM,IAAI,YAAY;EAEtB,KAAK,MAAM,aAAa,MAAM,MAAM,CAAC,GACnC,IAAI,UAAU,OAAO,GACnB,UAAU,QAAQ;CAGxB;CAGA,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,QAAQ,GACjC,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,CAAC,WAAW,GAC5C,IAAI,EAAE,OAAO,EAAE,IACb,EAAE,MAAM;MAER,EAAE,QAAQ;CAKhB,MAAM,OAAO,CAAC,GAAG,MAAM,KAAK;CAE5B,KAAK,MAAM,aAAa,OAAO;EAC7B,MAAM,UAAU,KAAK,OAAO,UAAU,MAAM,CAAC;EAC7C,KAAK,OAAO,UAAU,IAAI,GAAG,GAAG,OAAO;CACzC;CAEA,OAAO;EACL,GAAG;EACH,OAAO;CACT;AACF"}

package/dist/data/create-tree-data.d.ts

@@ -0,0 +1,134 @@
+/*
+ * Copyright 2020 Adobe. All rights reserved.
+ * This file is licensed to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may obtain a copy
+ * of the License at http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software distributed under
+ * the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS
+ * OF ANY KIND, either express or implied. See the License for the specific language
+ * governing permissions and limitations under the License.
+ */
+/*
+ * Derived from Adobe React Spectrum: packages/react-stately/src/data/useTreeData.ts.
+ * Modified for Solid Aria: adapted reactive state, getters, imports, and APIs for Solid 2.
+ * Licensed under Apache-2.0. See LICENSES/Apache-2.0.txt and NOTICE.txt at the repository root.
+ */
+import { Key } from "@solid2-aria/types-shared";
+export interface TreeOptions<T extends object> {
+  /** Initial root items in the tree. */
+  initialItems?: T[];
+  /** The keys for the initially selected items. */
+  initialSelectedKeys?: Iterable<Key>;
+  /** A function that returns a unique key for an item object. */
+  getKey?: (item: T) => Key;
+  /** A function that returns the children for an item object. */
+  getChildren?: (item: T) => T[];
+}
+interface TreeNode<T extends object> {
+  /** A unique key for the tree node. */
+  key: Key;
+  /** The key of the parent node. */
+  parentKey?: Key | null;
+  /** The value object for the tree node. */
+  value: T;
+  /** Children of the tree node. */
+  children: TreeNode<T>[] | null;
+}
+export interface TreeData<T extends object> {
+  /** The root nodes in the tree. */
+  items: TreeNode<T>[];
+  /** The keys of the currently selected items in the tree. */
+  selectedKeys: Set<Key>;
+  /** Sets the selected keys. */
+  setSelectedKeys: (keys: Set<Key>) => void;
+  /**
+   * Gets a node from the tree by key.
+   *
+   * @param key - The key of the item to retrieve.
+   */
+  getItem: (key: Key) => TreeNode<T> | undefined;
+  /**
+   * Inserts an item into a parent node as a child.
+   *
+   * @param parentKey - The key of the parent item to insert into. `null` for the root.
+   * @param index - The index within the parent to insert into.
+   * @param value - The value to insert.
+   */
+  insert: (parentKey: Key | null, index: number, ...values: T[]) => void;
+  /**
+   * Inserts items into the list before the item at the given key.
+   *
+   * @param key - The key of the item to insert before.
+   * @param values - The values to insert.
+   */
+  insertBefore: (key: Key, ...values: T[]) => void;
+  /**
+   * Inserts items into the list after the item at the given key.
+   *
+   * @param key - The key of the item to insert after.
+   * @param values - The values to insert.
+   */
+  insertAfter: (key: Key, ...values: T[]) => void;
+  /**
+   * Appends an item into a parent node as a child.
+   *
+   * @param parentKey - The key of the parent item to insert into. `null` for the root.
+   * @param value - The value to insert.
+   */
+  append: (parentKey: Key | null, ...values: T[]) => void;
+  /**
+   * Prepends an item into a parent node as a child.
+   *
+   * @param parentKey - The key of the parent item to insert into. `null` for the root.
+   * @param value - The value to insert.
+   */
+  prepend: (parentKey: Key | null, ...value: T[]) => void;
+  /**
+   * Removes an item from the tree by its key.
+   *
+   * @param key - The key of the item to remove.
+   */
+  remove: (...keys: Key[]) => void;
+  /**
+   * Removes all items from the tree that are currently
+   * in the set of selected items.
+   */
+  removeSelectedItems: () => void;
+  /**
+   * Moves an item within the tree.
+   *
+   * @param key - The key of the item to move.
+   * @param toParentKey - The key of the new parent to insert into. `null` for the root.
+   * @param index - The index within the new parent to insert at.
+   */
+  move: (key: Key, toParentKey: Key | null, index: number) => void;
+  /**
+   * Moves one or more items before a given key.
+   *
+   * @param key - The key of the item to move the items before.
+   * @param keys - The keys of the items to move.
+   */
+  moveBefore: (key: Key, keys: Iterable<Key>) => void;
+  /**
+   * Moves one or more items after a given key.
+   *
+   * @param key - The key of the item to move the items after.
+   * @param keys - The keys of the items to move.
+   */
+  moveAfter: (key: Key, keys: Iterable<Key>) => void;
+  /**
+   * Updates an item in the tree.
+   *
+   * @param key - The key of the item to update.
+   * @param newValue - The new value for the item.
+   */
+  update: (key: Key, newValue: T) => void;
+}
+/**
+ * Manages state for an immutable tree data structure, and provides convenience methods to
+ * update the data over time.
+ */
+export declare function createTreeData<T extends object>(options: TreeOptions<T>): TreeData<T>;
+export {};
+//# sourceMappingURL=create-tree-data.d.ts.map