2023-01-25 23:51:36 -05:00
|
|
|
|
import { SpringRef, TransitionFn, useTransition } from "@react-spring/web";
|
2023-01-25 02:30:52 -05:00
|
|
|
|
import { useDrag } from "@use-gesture/react";
|
2023-01-29 21:56:07 -05:00
|
|
|
|
import React, { FC, ReactNode, useEffect, useMemo, useState } from "react";
|
2023-01-18 10:52:12 -05:00
|
|
|
|
import useMeasure from "react-use-measure";
|
|
|
|
|
import styles from "./NewVideoGrid.module.css";
|
|
|
|
|
import { TileDescriptor } from "./TileDescriptor";
|
|
|
|
|
import { VideoGridProps as Props } from "./VideoGrid";
|
2023-01-25 02:30:52 -05:00
|
|
|
|
import { useReactiveState } from "../useReactiveState";
|
|
|
|
|
import TinyQueue from "tinyqueue";
|
|
|
|
|
import { zipWith } from "lodash";
|
2023-01-18 10:52:12 -05:00
|
|
|
|
|
|
|
|
|
interface Cell {
|
|
|
|
|
/**
|
|
|
|
|
* The item held by the slot containing this cell.
|
|
|
|
|
*/
|
2023-01-18 11:33:40 -05:00
|
|
|
|
item: TileDescriptor;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
/**
|
|
|
|
|
* Whether this cell is the first cell of the containing slot.
|
|
|
|
|
*/
|
2023-01-25 23:51:36 -05:00
|
|
|
|
// TODO: Rename to 'start'?
|
2023-01-18 11:33:40 -05:00
|
|
|
|
slot: boolean;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
/**
|
|
|
|
|
* The width, in columns, of the containing slot.
|
|
|
|
|
*/
|
2023-01-18 11:33:40 -05:00
|
|
|
|
columns: number;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
/**
|
|
|
|
|
* The height, in rows, of the containing slot.
|
|
|
|
|
*/
|
2023-01-18 11:33:40 -05:00
|
|
|
|
rows: number;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
}
|
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
interface Grid {
|
|
|
|
|
generation: number;
|
|
|
|
|
columns: number;
|
|
|
|
|
cells: (Cell | undefined)[];
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-18 10:52:12 -05:00
|
|
|
|
interface Rect {
|
2023-01-18 11:33:40 -05:00
|
|
|
|
x: number;
|
|
|
|
|
y: number;
|
|
|
|
|
width: number;
|
|
|
|
|
height: number;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
interface Tile extends Rect {
|
2023-01-18 11:33:40 -05:00
|
|
|
|
item: TileDescriptor;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
}
|
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
interface TileSpring {
|
|
|
|
|
opacity: number;
|
|
|
|
|
scale: number;
|
|
|
|
|
shadow: number;
|
|
|
|
|
x: number;
|
|
|
|
|
y: number;
|
|
|
|
|
width: number;
|
|
|
|
|
height: number;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const dijkstra = (g: Grid): number[] => {
|
|
|
|
|
const end = findLast1By1Index(g) ?? 0;
|
|
|
|
|
const endRow = row(end, g);
|
|
|
|
|
const endColumn = column(end, g);
|
|
|
|
|
|
|
|
|
|
const distances = new Array<number>(end + 1).fill(Infinity);
|
|
|
|
|
distances[end] = 0;
|
|
|
|
|
const edges = new Array<number | undefined>(end).fill(undefined);
|
|
|
|
|
const heap = new TinyQueue([end], (i) => distances[i]);
|
|
|
|
|
|
|
|
|
|
const visit = (curr: number, via: number) => {
|
|
|
|
|
const viaCell = g.cells[via];
|
|
|
|
|
const viaLargeSlot =
|
|
|
|
|
viaCell !== undefined && (viaCell.rows > 1 || viaCell.columns > 1);
|
|
|
|
|
const distanceVia = distances[via] + (viaLargeSlot ? 4 : 1);
|
|
|
|
|
|
|
|
|
|
if (distanceVia < distances[curr]) {
|
|
|
|
|
distances[curr] = distanceVia;
|
|
|
|
|
edges[curr] = via;
|
|
|
|
|
heap.push(curr);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
while (heap.length > 0) {
|
|
|
|
|
const via = heap.pop()!;
|
|
|
|
|
const viaRow = row(via, g);
|
|
|
|
|
const viaColumn = column(via, g);
|
|
|
|
|
|
|
|
|
|
if (viaRow > 0) visit(via - g.columns, via);
|
|
|
|
|
if (viaColumn > 0) visit(via - 1, via);
|
|
|
|
|
if (viaColumn < (viaRow === endRow ? endColumn : g.columns - 1))
|
|
|
|
|
visit(via + 1, via);
|
|
|
|
|
if (
|
|
|
|
|
viaRow < endRow - 1 ||
|
|
|
|
|
(viaRow === endRow - 1 && viaColumn <= endColumn)
|
|
|
|
|
)
|
|
|
|
|
visit(via + g.columns, via);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return edges as number[];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const findLastIndex = <T,>(
|
|
|
|
|
array: T[],
|
|
|
|
|
predicate: (item: T) => boolean
|
|
|
|
|
): number | null => {
|
|
|
|
|
for (let i = array.length - 1; i > 0; i--) {
|
|
|
|
|
if (predicate(array[i])) return i;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return null;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const findLast1By1Index = (g: Grid): number | null =>
|
|
|
|
|
findLastIndex(g.cells, (c) => c?.rows === 1 && c?.columns === 1);
|
|
|
|
|
|
|
|
|
|
const row = (index: number, g: Grid): number => Math.floor(index / g.columns);
|
|
|
|
|
const column = (index: number, g: Grid): number => index % g.columns;
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const inArea = (
|
|
|
|
|
index: number,
|
|
|
|
|
start: number,
|
|
|
|
|
end: number,
|
|
|
|
|
g: Grid
|
|
|
|
|
): boolean => {
|
|
|
|
|
const indexColumn = column(index, g);
|
2023-01-30 23:32:00 -05:00
|
|
|
|
const indexRow = row(index, g);
|
2023-01-29 21:56:07 -05:00
|
|
|
|
return (
|
|
|
|
|
indexRow >= row(start, g) &&
|
|
|
|
|
indexRow <= row(end, g) &&
|
|
|
|
|
indexColumn >= column(start, g) &&
|
|
|
|
|
indexColumn <= column(end, g)
|
|
|
|
|
);
|
|
|
|
|
};
|
2023-01-29 21:45:10 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
function* cellsInArea(
|
|
|
|
|
start: number,
|
|
|
|
|
end: number,
|
|
|
|
|
g: Grid
|
|
|
|
|
): Generator<number, void, unknown> {
|
|
|
|
|
const startColumn = column(start, g);
|
|
|
|
|
const endColumn = column(end, g);
|
|
|
|
|
for (
|
|
|
|
|
let i = start;
|
|
|
|
|
i <= end;
|
|
|
|
|
i =
|
|
|
|
|
column(i, g) === endColumn
|
|
|
|
|
? i + g.columns + startColumn - endColumn
|
|
|
|
|
: i + 1
|
|
|
|
|
)
|
|
|
|
|
yield i;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const forEachCellInArea = (
|
|
|
|
|
start: number,
|
|
|
|
|
end: number,
|
|
|
|
|
g: Grid,
|
|
|
|
|
fn: (c: Cell | undefined, i: number) => void
|
|
|
|
|
) => {
|
|
|
|
|
for (const i of cellsInArea(start, end, g)) fn(g.cells[i], i);
|
|
|
|
|
};
|
2023-01-25 23:51:36 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const allCellsInArea = (
|
|
|
|
|
start: number,
|
|
|
|
|
end: number,
|
|
|
|
|
g: Grid,
|
|
|
|
|
fn: (c: Cell | undefined, i: number) => boolean
|
|
|
|
|
) => {
|
2023-01-25 23:51:36 -05:00
|
|
|
|
for (const i of cellsInArea(start, end, g)) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (!fn(g.cells[i], i)) return false;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
return true;
|
|
|
|
|
};
|
2023-01-25 23:51:36 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const areaEnd = (
|
|
|
|
|
start: number,
|
|
|
|
|
columns: number,
|
|
|
|
|
rows: number,
|
|
|
|
|
g: Grid
|
|
|
|
|
): number => start + columns - 1 + g.columns * (rows - 1);
|
2023-01-29 21:45:10 -05:00
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
/**
|
|
|
|
|
* Gets the index of the next gap in the grid that should be backfilled by 1×1
|
|
|
|
|
* tiles.
|
|
|
|
|
*/
|
|
|
|
|
const getNextGap = (g: Grid): number | null => {
|
|
|
|
|
const last1By1Index = findLast1By1Index(g);
|
|
|
|
|
if (last1By1Index === null) return null;
|
|
|
|
|
|
|
|
|
|
for (let i = 0; i < last1By1Index; i++) {
|
|
|
|
|
// To make the backfilling process look natural when there are multiple
|
|
|
|
|
// gaps, we actually scan each row from right to left
|
|
|
|
|
const j =
|
|
|
|
|
(row(i, g) === row(last1By1Index, g)
|
|
|
|
|
? last1By1Index
|
|
|
|
|
: (row(i, g) + 1) * g.columns) -
|
|
|
|
|
1 -
|
|
|
|
|
column(i, g);
|
|
|
|
|
|
|
|
|
|
if (g.cells[j] === undefined) return j;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return null;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const fillGaps = (g: Grid): Grid => {
|
|
|
|
|
const result: Grid = { ...g, cells: [...g.cells] };
|
|
|
|
|
let gap = getNextGap(result);
|
|
|
|
|
|
|
|
|
|
if (gap !== null) {
|
|
|
|
|
const pathToEnd = dijkstra(result);
|
|
|
|
|
|
|
|
|
|
do {
|
|
|
|
|
let filled = false;
|
|
|
|
|
let to = gap;
|
|
|
|
|
let from: number | undefined = pathToEnd[gap];
|
|
|
|
|
|
|
|
|
|
// First, attempt to fill the gap by moving 1×1 tiles backwards from the
|
|
|
|
|
// end of the grid along a set path
|
|
|
|
|
while (from !== undefined) {
|
|
|
|
|
const toCell = result.cells[to];
|
|
|
|
|
const fromCell = result.cells[from];
|
|
|
|
|
|
|
|
|
|
// Skip over large tiles
|
|
|
|
|
if (toCell !== undefined) {
|
|
|
|
|
to = pathToEnd[to];
|
|
|
|
|
// Skip over large tiles. Also, we might run into gaps along the path
|
|
|
|
|
// created during the filling of previous gaps. Skip over those too;
|
|
|
|
|
// they'll be picked up on the next iteration of the outer loop.
|
|
|
|
|
} else if (
|
|
|
|
|
fromCell === undefined ||
|
|
|
|
|
fromCell.rows > 1 ||
|
|
|
|
|
fromCell.columns > 1
|
|
|
|
|
) {
|
|
|
|
|
from = pathToEnd[from];
|
|
|
|
|
} else {
|
|
|
|
|
result.cells[to] = result.cells[from];
|
|
|
|
|
result.cells[from] = undefined;
|
|
|
|
|
filled = true;
|
|
|
|
|
to = pathToEnd[to];
|
|
|
|
|
from = pathToEnd[from];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// In case the path approach failed, fall back to taking the very last 1×1
|
|
|
|
|
// tile, and just dropping it into place
|
|
|
|
|
if (!filled) {
|
|
|
|
|
const last1By1Index = findLast1By1Index(result)!;
|
|
|
|
|
result.cells[gap] = result.cells[last1By1Index];
|
|
|
|
|
result.cells[last1By1Index] = undefined;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
gap = getNextGap(result);
|
|
|
|
|
} while (gap !== null);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// TODO: If there are any large tiles on the last row, shuffle them back
|
|
|
|
|
// upwards into a full row
|
|
|
|
|
|
|
|
|
|
// Shrink the array to remove trailing gaps
|
|
|
|
|
const finalLength =
|
|
|
|
|
(findLastIndex(result.cells, (c) => c !== undefined) ?? -1) + 1;
|
|
|
|
|
if (finalLength < result.cells.length)
|
|
|
|
|
result.cells = result.cells.slice(0, finalLength);
|
|
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
};
|
|
|
|
|
|
2023-01-29 21:54:53 -05:00
|
|
|
|
const cycleTileSize = (tileId: string, g: Grid): Grid => {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const from = g.cells.findIndex((c) => c?.item.id === tileId);
|
|
|
|
|
if (from === -1) return g; // Tile removed, no change
|
|
|
|
|
const fromWidth = g.cells[from]!.columns;
|
|
|
|
|
const fromHeight = g.cells[from]!.rows;
|
|
|
|
|
const fromEnd = areaEnd(from, fromWidth, fromHeight, g);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const [toWidth, toHeight] =
|
|
|
|
|
fromWidth === 1 && fromHeight === 1 ? [3, 2] : [1, 1];
|
2023-01-30 23:32:00 -05:00
|
|
|
|
const newRows = Math.max(
|
|
|
|
|
0,
|
|
|
|
|
Math.ceil((toWidth * toHeight - fromWidth * fromHeight) / g.columns)
|
2023-01-29 21:56:07 -05:00
|
|
|
|
);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const candidateWidth = toWidth;
|
|
|
|
|
const candidateHeight = toHeight - newRows;
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-30 23:32:00 -05:00
|
|
|
|
const gappyGrid: Grid = {
|
|
|
|
|
...g,
|
|
|
|
|
generation: g.generation + 1,
|
|
|
|
|
cells: new Array(g.cells.length + newRows * g.columns),
|
|
|
|
|
};
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const nextScanLocations = new Set<number>([from]);
|
|
|
|
|
const scanColumnOffset = Math.floor((toWidth - 1) / 2);
|
|
|
|
|
const scanRowOffset = Math.floor((toHeight - 1) / 2);
|
|
|
|
|
let to: number | null = null;
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const displaceable = (c: Cell | undefined, i: number): boolean =>
|
|
|
|
|
c === undefined ||
|
|
|
|
|
(c.columns === 1 && c.rows === 1) ||
|
|
|
|
|
inArea(i, from, fromEnd, g);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
|
|
|
|
for (const scanLocation of nextScanLocations) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const start = scanLocation - scanColumnOffset - g.columns * scanRowOffset;
|
|
|
|
|
const end = areaEnd(start, candidateWidth, candidateHeight, g);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
const startColumn = column(start, g);
|
|
|
|
|
const endColumn = column(end, g);
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (
|
|
|
|
|
start >= 0 &&
|
2023-01-30 23:32:00 -05:00
|
|
|
|
end < gappyGrid.cells.length &&
|
2023-01-29 21:56:07 -05:00
|
|
|
|
endColumn - startColumn + 1 === candidateWidth
|
|
|
|
|
) {
|
2023-01-29 21:54:53 -05:00
|
|
|
|
if (allCellsInArea(start, end, g, displaceable)) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
to = start;
|
|
|
|
|
break;
|
2023-01-29 21:54:53 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (startColumn > 0) nextScanLocations.add(scanLocation - 1);
|
|
|
|
|
if (endColumn < g.columns - 1) nextScanLocations.add(scanLocation + 1);
|
|
|
|
|
nextScanLocations.add(scanLocation - g.columns);
|
|
|
|
|
nextScanLocations.add(scanLocation + g.columns);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// TODO: Don't give up on placing the tile yet
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (to === null) return g;
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const toRow = row(to, g);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-30 17:04:43 -05:00
|
|
|
|
g.cells.forEach((c, src) => {
|
|
|
|
|
if (c?.slot && c.item.id !== tileId) {
|
|
|
|
|
const offset =
|
|
|
|
|
row(src, g) > toRow + candidateHeight - 1 ? g.columns * newRows : 0;
|
|
|
|
|
forEachCellInArea(src, areaEnd(src, c.columns, c.rows, g), g, (c, i) => {
|
2023-01-30 23:32:00 -05:00
|
|
|
|
gappyGrid.cells[i + offset] = c;
|
|
|
|
|
});
|
2023-01-29 21:54:53 -05:00
|
|
|
|
}
|
2023-01-30 23:32:00 -05:00
|
|
|
|
});
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const displacedTiles: Cell[] = [];
|
|
|
|
|
const toEnd = areaEnd(to, toWidth, toHeight, g);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
forEachCellInArea(to, toEnd, gappyGrid, (c, i) => {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (c !== undefined) displacedTiles.push(c);
|
2023-01-29 21:54:53 -05:00
|
|
|
|
gappyGrid.cells[i] = {
|
|
|
|
|
item: g.cells[from]!.item,
|
|
|
|
|
slot: i === to,
|
|
|
|
|
columns: toWidth,
|
|
|
|
|
rows: toHeight,
|
2023-01-29 21:56:07 -05:00
|
|
|
|
};
|
|
|
|
|
});
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
|
|
|
|
for (let i = 0; displacedTiles.length > 0; i++) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
if (gappyGrid.cells[i] === undefined)
|
|
|
|
|
gappyGrid.cells[i] = displacedTiles.shift();
|
2023-01-29 21:54:53 -05:00
|
|
|
|
}
|
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
return fillGaps(gappyGrid);
|
|
|
|
|
};
|
2023-01-29 21:54:53 -05:00
|
|
|
|
|
2023-01-18 13:38:29 -05:00
|
|
|
|
export const NewVideoGrid: FC<Props> = ({
|
|
|
|
|
items,
|
|
|
|
|
disableAnimations,
|
|
|
|
|
children,
|
|
|
|
|
}) => {
|
|
|
|
|
const [slotGrid, setSlotGrid] = useState<HTMLDivElement | null>(null);
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const [slotGridGeneration, setSlotGridGeneration] = useState(0);
|
2023-01-18 10:52:12 -05:00
|
|
|
|
const [gridRef, gridBounds] = useMeasure();
|
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
useEffect(() => {
|
|
|
|
|
if (slotGrid !== null) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
setSlotGridGeneration(
|
|
|
|
|
parseInt(slotGrid.getAttribute("data-generation")!)
|
|
|
|
|
);
|
2023-01-25 02:30:52 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const observer = new MutationObserver((mutations) => {
|
|
|
|
|
if (mutations.some((m) => m.type === "attributes")) {
|
|
|
|
|
setSlotGridGeneration(
|
|
|
|
|
parseInt(slotGrid.getAttribute("data-generation")!)
|
|
|
|
|
);
|
2023-01-25 02:30:52 -05:00
|
|
|
|
}
|
2023-01-29 21:56:07 -05:00
|
|
|
|
});
|
2023-01-25 02:30:52 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
observer.observe(slotGrid, { attributes: true });
|
|
|
|
|
return () => observer.disconnect();
|
2023-01-25 02:30:52 -05:00
|
|
|
|
}
|
2023-01-29 21:56:07 -05:00
|
|
|
|
}, [slotGrid, setSlotGridGeneration]);
|
2023-01-25 02:30:52 -05:00
|
|
|
|
|
2023-01-18 10:52:12 -05:00
|
|
|
|
const slotRects = useMemo(() => {
|
2023-01-18 13:38:29 -05:00
|
|
|
|
if (slotGrid === null) return [];
|
2023-01-18 10:52:12 -05:00
|
|
|
|
|
2023-01-18 13:38:29 -05:00
|
|
|
|
const slots = slotGrid.getElementsByClassName(styles.slot);
|
2023-01-18 11:33:40 -05:00
|
|
|
|
const rects = new Array<Rect>(slots.length);
|
2023-01-18 10:52:12 -05:00
|
|
|
|
for (let i = 0; i < slots.length; i++) {
|
2023-01-18 11:33:40 -05:00
|
|
|
|
const slot = slots[i] as HTMLElement;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
rects[i] = {
|
|
|
|
|
x: slot.offsetLeft,
|
|
|
|
|
y: slot.offsetTop,
|
|
|
|
|
width: slot.offsetWidth,
|
|
|
|
|
height: slot.offsetHeight,
|
2023-01-18 11:33:40 -05:00
|
|
|
|
};
|
2023-01-18 10:52:12 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return rects;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}, [items, slotGridGeneration, slotGrid, gridBounds]);
|
2023-01-25 02:30:52 -05:00
|
|
|
|
|
|
|
|
|
const [grid, setGrid] = useReactiveState<Grid>(
|
|
|
|
|
(prevGrid = { generation: 0, columns: 6, cells: [] }) => {
|
|
|
|
|
// Step 1: Update tiles that still exist, and remove tiles that have left
|
|
|
|
|
// the grid
|
|
|
|
|
const itemsById = new Map(items.map((i) => [i.id, i]));
|
|
|
|
|
const grid1: Grid = {
|
|
|
|
|
...prevGrid,
|
|
|
|
|
generation: prevGrid.generation + 1,
|
|
|
|
|
cells: prevGrid.cells.map((c) => {
|
|
|
|
|
if (c === undefined) return undefined;
|
|
|
|
|
const item = itemsById.get(c.item.id);
|
|
|
|
|
return item === undefined ? undefined : { ...c, item };
|
|
|
|
|
}),
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// Step 2: Backfill gaps left behind by removed tiles
|
|
|
|
|
const grid2 = fillGaps(grid1);
|
|
|
|
|
|
|
|
|
|
// Step 3: Add new tiles to the end of the grid
|
|
|
|
|
const existingItemIds = new Set(
|
|
|
|
|
grid2.cells.filter((c) => c !== undefined).map((c) => c!.item.id)
|
|
|
|
|
);
|
|
|
|
|
const newItems = items.filter((i) => !existingItemIds.has(i.id));
|
|
|
|
|
const grid3: Grid = {
|
|
|
|
|
...grid2,
|
|
|
|
|
cells: [
|
|
|
|
|
...grid2.cells,
|
|
|
|
|
...newItems.map((i) => ({
|
|
|
|
|
item: i,
|
|
|
|
|
slot: true,
|
|
|
|
|
columns: 1,
|
|
|
|
|
rows: 1,
|
|
|
|
|
})),
|
|
|
|
|
],
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
return grid3;
|
|
|
|
|
},
|
2023-01-18 11:33:40 -05:00
|
|
|
|
[items]
|
|
|
|
|
);
|
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
const [tiles] = useReactiveState<Tile[]>(
|
|
|
|
|
(prevTiles) => {
|
|
|
|
|
// If React hasn't yet rendered the current generation of the layout, skip
|
|
|
|
|
// the update, because grid and slotRects will be out of sync
|
|
|
|
|
if (slotGridGeneration !== grid.generation) return prevTiles ?? [];
|
|
|
|
|
|
|
|
|
|
const slotCells = grid.cells.filter((c) => c?.slot) as Cell[];
|
|
|
|
|
return zipWith(slotCells, slotRects, (cell, rect) => ({
|
|
|
|
|
item: cell.item,
|
|
|
|
|
x: rect.x,
|
|
|
|
|
y: rect.y,
|
|
|
|
|
width: rect.width,
|
|
|
|
|
height: rect.height,
|
|
|
|
|
}));
|
|
|
|
|
},
|
|
|
|
|
[slotRects, grid, slotGridGeneration]
|
2023-01-18 11:33:40 -05:00
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
const [tileTransitions] = useTransition(
|
|
|
|
|
tiles,
|
|
|
|
|
() => ({
|
|
|
|
|
key: ({ item }: Tile) => item.id,
|
2023-01-25 23:51:36 -05:00
|
|
|
|
from: ({ x, y, width, height }: Tile) => ({
|
2023-01-18 13:38:29 -05:00
|
|
|
|
opacity: 0,
|
|
|
|
|
scale: 0,
|
|
|
|
|
shadow: 1,
|
2023-01-18 11:33:40 -05:00
|
|
|
|
x,
|
|
|
|
|
y,
|
|
|
|
|
width,
|
|
|
|
|
height,
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}),
|
2023-01-18 13:38:29 -05:00
|
|
|
|
enter: { opacity: 1, scale: 1 },
|
2023-01-18 11:33:40 -05:00
|
|
|
|
update: ({ x, y, width, height }: Tile) => ({ x, y, width, height }),
|
2023-01-18 13:38:29 -05:00
|
|
|
|
leave: { opacity: 0, scale: 0 },
|
2023-01-30 23:32:26 -05:00
|
|
|
|
config: { mass: 0.7, tension: 252, friction: 25 },
|
2023-01-18 13:38:29 -05:00
|
|
|
|
immediate: (key: string) =>
|
|
|
|
|
disableAnimations || key === "zIndex" || key === "shadow",
|
|
|
|
|
// If we just stopped dragging a tile, give it time for the
|
|
|
|
|
// animation to settle before pushing its z-index back down
|
|
|
|
|
delay: (key: string) => (key === "zIndex" ? 500 : 0),
|
2023-01-18 11:33:40 -05:00
|
|
|
|
}),
|
2023-01-18 13:38:29 -05:00
|
|
|
|
[tiles, disableAnimations]
|
2023-01-25 23:51:36 -05:00
|
|
|
|
// react-spring's types are bugged and can't infer the spring type
|
|
|
|
|
) as unknown as [TransitionFn<Tile, TileSpring>, SpringRef<TileSpring>];
|
2023-01-18 10:52:12 -05:00
|
|
|
|
|
|
|
|
|
const slotGridStyle = useMemo(() => {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const columnCount = 6;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const areas = new Array<(number | null)[]>(
|
|
|
|
|
Math.ceil(grid.cells.length / grid.columns)
|
|
|
|
|
);
|
|
|
|
|
for (let i = 0; i < areas.length; i++)
|
|
|
|
|
areas[i] = new Array<number | null>(grid.columns).fill(null);
|
2023-01-25 23:51:36 -05:00
|
|
|
|
|
2023-01-29 21:56:07 -05:00
|
|
|
|
let slotId = 0;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
for (let i = 0; i < grid.cells.length; i++) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const cell = grid.cells[i];
|
2023-01-25 23:51:36 -05:00
|
|
|
|
if (cell?.slot) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const slotEnd = i + cell.columns - 1 + grid.columns * (cell.rows - 1);
|
|
|
|
|
forEachCellInArea(
|
|
|
|
|
i,
|
|
|
|
|
slotEnd,
|
|
|
|
|
grid,
|
|
|
|
|
(_c, j) => (areas[row(j, grid)][column(j, grid)] = slotId)
|
|
|
|
|
);
|
|
|
|
|
slotId++;
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-18 10:52:12 -05:00
|
|
|
|
return {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
gridTemplateAreas: areas
|
|
|
|
|
.map(
|
|
|
|
|
(row) =>
|
|
|
|
|
`'${row
|
|
|
|
|
.map((slotId) => (slotId === null ? "." : `s${slotId}`))
|
|
|
|
|
.join(" ")}'`
|
|
|
|
|
)
|
|
|
|
|
.join(" "),
|
2023-01-18 10:52:12 -05:00
|
|
|
|
gridTemplateColumns: `repeat(${columnCount}, 1fr)`,
|
|
|
|
|
};
|
2023-01-25 23:51:36 -05:00
|
|
|
|
}, [grid]);
|
2023-01-18 10:52:12 -05:00
|
|
|
|
|
2023-01-25 02:30:52 -05:00
|
|
|
|
const bindTile = useDrag(
|
2023-01-25 23:51:36 -05:00
|
|
|
|
({ event, tap, args }) => {
|
2023-01-25 02:30:52 -05:00
|
|
|
|
event.preventDefault();
|
2023-01-29 21:56:07 -05:00
|
|
|
|
const tileId = args[0] as string;
|
2023-01-25 02:30:52 -05:00
|
|
|
|
|
|
|
|
|
if (tap) {
|
2023-01-29 21:56:07 -05:00
|
|
|
|
setGrid((g) => cycleTileSize(tileId, g));
|
2023-01-29 21:54:53 -05:00
|
|
|
|
} else {
|
|
|
|
|
// TODO
|
2023-01-25 02:30:52 -05:00
|
|
|
|
}
|
2023-01-25 23:51:36 -05:00
|
|
|
|
},
|
2023-01-25 02:30:52 -05:00
|
|
|
|
{ filterTaps: true, pointer: { buttons: [1] } }
|
|
|
|
|
);
|
|
|
|
|
|
2023-01-25 23:51:36 -05:00
|
|
|
|
const slots = useMemo(() => {
|
|
|
|
|
const slots = new Array<ReactNode>(items.length);
|
|
|
|
|
for (let i = 0; i < items.length; i++)
|
2023-01-29 21:56:07 -05:00
|
|
|
|
slots[i] = (
|
|
|
|
|
<div className={styles.slot} key={i} style={{ gridArea: `s${i}` }} />
|
|
|
|
|
);
|
|
|
|
|
return slots;
|
|
|
|
|
}, [items.length]);
|
2023-01-25 23:51:36 -05:00
|
|
|
|
|
2023-01-18 10:52:12 -05:00
|
|
|
|
// Render nothing if the bounds are not yet known
|
|
|
|
|
if (gridBounds.width === 0) {
|
2023-01-18 13:38:29 -05:00
|
|
|
|
return <div ref={gridRef} className={styles.grid} />;
|
2023-01-18 10:52:12 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return (
|
2023-01-18 11:33:40 -05:00
|
|
|
|
<div ref={gridRef} className={styles.grid}>
|
2023-01-25 02:30:52 -05:00
|
|
|
|
<div
|
|
|
|
|
style={slotGridStyle}
|
|
|
|
|
ref={setSlotGrid}
|
|
|
|
|
className={styles.slotGrid}
|
|
|
|
|
data-generation={grid.generation}
|
|
|
|
|
>
|
2023-01-25 23:51:36 -05:00
|
|
|
|
{slots}
|
2023-01-18 10:52:12 -05:00
|
|
|
|
</div>
|
2023-01-30 23:43:45 -05:00
|
|
|
|
{tileTransitions(({ shadow, width, height, ...style }, tile) =>
|
2023-01-18 11:33:40 -05:00
|
|
|
|
children({
|
2023-01-25 02:30:52 -05:00
|
|
|
|
...bindTile(tile.item.id),
|
2023-01-18 11:33:40 -05:00
|
|
|
|
key: tile.item.id,
|
2023-01-18 13:38:29 -05:00
|
|
|
|
style: {
|
|
|
|
|
boxShadow: shadow.to(
|
|
|
|
|
(s) => `rgba(0, 0, 0, 0.5) 0px ${s}px ${2 * s}px 0px`
|
|
|
|
|
),
|
2023-01-30 23:43:45 -05:00
|
|
|
|
"--tileWidth": width.to((w) => `${w}px`),
|
|
|
|
|
"--tileHeight": height.to((h) => `${h}px`),
|
2023-01-18 13:38:29 -05:00
|
|
|
|
...style,
|
|
|
|
|
},
|
2023-01-18 11:33:40 -05:00
|
|
|
|
width: tile.width,
|
|
|
|
|
height: tile.height,
|
|
|
|
|
item: tile.item,
|
|
|
|
|
})
|
|
|
|
|
)}
|
2023-01-18 10:52:12 -05:00
|
|
|
|
</div>
|
|
|
|
|
);
|
|
|
|
|
};
|