Skip to content

Instantly share code, notes, and snippets.

@pfgithub
Created February 10, 2022 00:36
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save pfgithub/84eccc6d7b4e0a0e51a37bee18d0bb53 to your computer and use it in GitHub Desktop.
Save pfgithub/84eccc6d7b4e0a0e51a37bee18d0bb53 to your computer and use it in GitHub Desktop.
solid js keyed for loop
import {
createRoot,
createSignal,
createMemo,
onCleanup,
untrack,
JSX,
Accessor
} from "solid-js";
export function Key<T, U>(props: {
each: T[],
by: (item: T) => U,
children: (item: Accessor<T>, i: Accessor<number>, key: U) => JSX.Element,
}) {
const key = props.by;
const mapFn = props.children;
const disposers = new Map();
let prev = new Map();
onCleanup(() => {
for (const disposer of disposers.values()) disposer();
});
return createMemo(() => {
const list = props.each || [];
const mapped = [];
const newNodes = new Map();
return untrack(() => {
for (let i = 0; i < list.length; i++) {
const listItem = list[i];
const keyValue = key(listItem);
const lookup = prev.get(keyValue);
if (!lookup) {
mapped[i] = createRoot((dispose) => {
disposers.set(keyValue, dispose);
const index = createSignal(i);
const item = createSignal(listItem);
const result = mapFn(item[0], index[0], keyValue);
newNodes.set(keyValue, { index, item, result });
return result;
});
} else {
lookup.index[1](i);
lookup.item[1](listItem);
mapped[i] = lookup.result;
newNodes.set(keyValue, lookup);
}
}
for (const old of prev.keys()) {
if (!newNodes.has(old)) {
const disposer = disposers.get(old);
disposers.delete(old);
disposer();
}
}
prev = newNodes;
return mapped;
});
});
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment