Merge pull request #1124 from robintown/grid-interactions
Improved large grid interactions
This commit is contained in:
commit
50718e47ca
7 changed files with 640 additions and 98 deletions
38
src/array-utils.ts
Normal file
38
src/array-utils.ts
Normal file
|
@ -0,0 +1,38 @@
|
||||||
|
/*
|
||||||
|
Copyright 2023 New Vector Ltd
|
||||||
|
|
||||||
|
Licensed 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 CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Gets the index of the last element in the array to satsify the given
|
||||||
|
* predicate.
|
||||||
|
*/
|
||||||
|
// TODO: remove this once TypeScript recognizes the existence of
|
||||||
|
// Array.prototype.findLastIndex
|
||||||
|
export function 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;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Counts the number of elements in an array that satsify the given predicate.
|
||||||
|
*/
|
||||||
|
export const count = <T>(array: T[], predicate: (item: T) => boolean): number =>
|
||||||
|
array.reduce((acc, item) => (predicate(item) ? acc + 1 : acc), 0);
|
|
@ -216,6 +216,8 @@ export function InCallView({
|
||||||
focused: screenshareFeeds.length === 0 && callFeed === activeSpeaker,
|
focused: screenshareFeeds.length === 0 && callFeed === activeSpeaker,
|
||||||
isLocal: member.userId === localUserId && deviceId === localDeviceId,
|
isLocal: member.userId === localUserId && deviceId === localDeviceId,
|
||||||
presenter,
|
presenter,
|
||||||
|
isSpeaker: callFeed === activeSpeaker,
|
||||||
|
largeBaseSize: false,
|
||||||
connectionState,
|
connectionState,
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
@ -228,6 +230,7 @@ export function InCallView({
|
||||||
// Add the screenshares too
|
// Add the screenshares too
|
||||||
for (const screenshareFeed of screenshareFeeds) {
|
for (const screenshareFeed of screenshareFeeds) {
|
||||||
const member = screenshareFeed.getMember()!;
|
const member = screenshareFeed.getMember()!;
|
||||||
|
const deviceId = screenshareFeed.deviceId!;
|
||||||
const connectionState = participants
|
const connectionState = participants
|
||||||
.get(member)
|
.get(member)
|
||||||
?.get(screenshareFeed.deviceId!)?.connectionState;
|
?.get(screenshareFeed.deviceId!)?.connectionState;
|
||||||
|
@ -242,6 +245,9 @@ export function InCallView({
|
||||||
focused: true,
|
focused: true,
|
||||||
isLocal: screenshareFeed.isLocal(),
|
isLocal: screenshareFeed.isLocal(),
|
||||||
presenter: false,
|
presenter: false,
|
||||||
|
isSpeaker: screenshareFeed === activeSpeaker,
|
||||||
|
largeBaseSize: true,
|
||||||
|
placeNear: `${member.userId} ${deviceId}`,
|
||||||
connectionState,
|
connectionState,
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
|
@ -18,7 +18,7 @@ limitations under the License.
|
||||||
contain: strict;
|
contain: strict;
|
||||||
position: relative;
|
position: relative;
|
||||||
flex-grow: 1;
|
flex-grow: 1;
|
||||||
padding: 0 20px;
|
padding: 0 20px var(--footerHeight);
|
||||||
overflow-y: auto;
|
overflow-y: auto;
|
||||||
overflow-x: hidden;
|
overflow-x: hidden;
|
||||||
}
|
}
|
||||||
|
@ -28,7 +28,6 @@ limitations under the License.
|
||||||
display: grid;
|
display: grid;
|
||||||
grid-auto-rows: 163px;
|
grid-auto-rows: 163px;
|
||||||
gap: 8px;
|
gap: 8px;
|
||||||
padding-bottom: var(--footerHeight);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
.slot {
|
.slot {
|
||||||
|
@ -37,7 +36,7 @@ limitations under the License.
|
||||||
|
|
||||||
@media (min-width: 800px) {
|
@media (min-width: 800px) {
|
||||||
.grid {
|
.grid {
|
||||||
padding: 0 22px;
|
padding: 0 22px var(--footerHeight);
|
||||||
}
|
}
|
||||||
|
|
||||||
.slotGrid {
|
.slotGrid {
|
||||||
|
|
|
@ -43,7 +43,10 @@ import {
|
||||||
fillGaps,
|
fillGaps,
|
||||||
forEachCellInArea,
|
forEachCellInArea,
|
||||||
cycleTileSize,
|
cycleTileSize,
|
||||||
appendItems,
|
addItems,
|
||||||
|
tryMoveTile,
|
||||||
|
resize,
|
||||||
|
promoteSpeakers,
|
||||||
} from "./model";
|
} from "./model";
|
||||||
import { TileWrapper } from "./TileWrapper";
|
import { TileWrapper } from "./TileWrapper";
|
||||||
|
|
||||||
|
@ -81,15 +84,21 @@ const useGridState = (
|
||||||
}),
|
}),
|
||||||
};
|
};
|
||||||
|
|
||||||
// Step 2: Backfill gaps left behind by removed tiles
|
// Step 2: Resize the grid if necessary and backfill gaps left behind by
|
||||||
const grid2 = fillGaps(grid1);
|
// removed tiles
|
||||||
|
// Resizing already takes care of backfilling gaps
|
||||||
|
const grid2 =
|
||||||
|
columns !== grid1.columns ? resize(grid1, columns!) : fillGaps(grid1);
|
||||||
|
|
||||||
// Step 3: Add new tiles to the end of the grid
|
// Step 3: Add new tiles to the end of the grid
|
||||||
const existingItemIds = new Set(
|
const existingItemIds = new Set(
|
||||||
grid2.cells.filter((c) => c !== undefined).map((c) => c!.item.id)
|
grid2.cells.filter((c) => c !== undefined).map((c) => c!.item.id)
|
||||||
);
|
);
|
||||||
const newItems = items.filter((i) => !existingItemIds.has(i.id));
|
const newItems = items.filter((i) => !existingItemIds.has(i.id));
|
||||||
const grid3 = appendItems(newItems, grid2);
|
const grid3 = addItems(newItems, grid2);
|
||||||
|
|
||||||
|
// Step 4: Promote speakers to the top
|
||||||
|
promoteSpeakers(grid3);
|
||||||
|
|
||||||
return { ...grid3, generation: prevGrid.generation + 1 };
|
return { ...grid3, generation: prevGrid.generation + 1 };
|
||||||
},
|
},
|
||||||
|
@ -204,14 +213,10 @@ export const NewVideoGrid: FC<Props> = ({
|
||||||
// eslint-disable-next-line react-hooks/exhaustive-deps
|
// eslint-disable-next-line react-hooks/exhaustive-deps
|
||||||
}, [slotGrid, slotGridGeneration, gridBounds]);
|
}, [slotGrid, slotGridGeneration, gridBounds]);
|
||||||
|
|
||||||
const [columns] = useReactiveState<number | null>(
|
const columns = useMemo(
|
||||||
// Since grid resizing isn't implemented yet, pick a column count on mount
|
() =>
|
||||||
// and stick to it
|
// The grid bounds might not be known yet
|
||||||
(prevColumns) =>
|
gridBounds.width === 0
|
||||||
prevColumns !== undefined && prevColumns !== null
|
|
||||||
? prevColumns
|
|
||||||
: // The grid bounds might not be known yet
|
|
||||||
gridBounds.width === 0
|
|
||||||
? null
|
? null
|
||||||
: Math.max(2, Math.floor(gridBounds.width * 0.0045)),
|
: Math.max(2, Math.floor(gridBounds.width * 0.0045)),
|
||||||
[gridBounds]
|
[gridBounds]
|
||||||
|
@ -280,6 +285,8 @@ export const NewVideoGrid: FC<Props> = ({
|
||||||
const animateDraggedTile = (endOfGesture: boolean) => {
|
const animateDraggedTile = (endOfGesture: boolean) => {
|
||||||
const { tileId, tileX, tileY, cursorX, cursorY } = dragState.current!;
|
const { tileId, tileX, tileY, cursorX, cursorY } = dragState.current!;
|
||||||
const tile = tiles.find((t) => t.item.id === tileId)!;
|
const tile = tiles.find((t) => t.item.id === tileId)!;
|
||||||
|
const originIndex = grid!.cells.findIndex((c) => c?.item.id === tileId);
|
||||||
|
const originCell = grid!.cells[originIndex]!;
|
||||||
|
|
||||||
springRef.current
|
springRef.current
|
||||||
.find((c) => (c.item as Tile).item.id === tileId)
|
.find((c) => (c.item as Tile).item.id === tileId)
|
||||||
|
@ -310,23 +317,36 @@ export const NewVideoGrid: FC<Props> = ({
|
||||||
}
|
}
|
||||||
);
|
);
|
||||||
|
|
||||||
const overTile = tiles.find(
|
const columns = grid!.columns;
|
||||||
(t) =>
|
const rows = row(grid!.cells.length - 1, grid!) + 1;
|
||||||
cursorX >= t.x &&
|
|
||||||
cursorX < t.x + t.width &&
|
const cursorColumn = Math.floor(
|
||||||
cursorY >= t.y &&
|
(cursorX / slotGrid!.clientWidth) * columns
|
||||||
cursorY < t.y + t.height
|
|
||||||
);
|
);
|
||||||
if (overTile !== undefined && overTile.item.id !== tileId) {
|
const cursorRow = Math.floor((cursorY / slotGrid!.clientHeight) * rows);
|
||||||
setGrid((g) => ({
|
|
||||||
...g!,
|
const cursorColumnOnTile = Math.floor(
|
||||||
cells: g!.cells.map((c) => {
|
((cursorX - tileX) / tile.width) * originCell.columns
|
||||||
if (c?.item === overTile.item) return { ...c, item: tile.item };
|
);
|
||||||
if (c?.item === tile.item) return { ...c, item: overTile.item };
|
const cursorRowOnTile = Math.floor(
|
||||||
return c;
|
((cursorY - tileY) / tile.height) * originCell.rows
|
||||||
}),
|
);
|
||||||
}));
|
|
||||||
}
|
const dest =
|
||||||
|
Math.max(
|
||||||
|
0,
|
||||||
|
Math.min(
|
||||||
|
columns - originCell.columns,
|
||||||
|
cursorColumn - cursorColumnOnTile
|
||||||
|
)
|
||||||
|
) +
|
||||||
|
grid!.columns *
|
||||||
|
Math.max(
|
||||||
|
0,
|
||||||
|
Math.min(rows - originCell.rows, cursorRow - cursorRowOnTile)
|
||||||
|
);
|
||||||
|
|
||||||
|
if (dest !== originIndex) setGrid((g) => tryMoveTile(g, originIndex, dest));
|
||||||
};
|
};
|
||||||
|
|
||||||
// Callback for useDrag. We could call useDrag here, but the default
|
// Callback for useDrag. We could call useDrag here, but the default
|
||||||
|
|
|
@ -26,7 +26,10 @@ export interface TileDescriptor {
|
||||||
member: RoomMember;
|
member: RoomMember;
|
||||||
focused: boolean;
|
focused: boolean;
|
||||||
presenter: boolean;
|
presenter: boolean;
|
||||||
|
isSpeaker: boolean;
|
||||||
callFeed?: CallFeed;
|
callFeed?: CallFeed;
|
||||||
isLocal?: boolean;
|
isLocal?: boolean;
|
||||||
|
largeBaseSize: boolean;
|
||||||
|
placeNear?: string;
|
||||||
connectionState: ConnectionState;
|
connectionState: ConnectionState;
|
||||||
}
|
}
|
||||||
|
|
|
@ -17,6 +17,7 @@ limitations under the License.
|
||||||
import TinyQueue from "tinyqueue";
|
import TinyQueue from "tinyqueue";
|
||||||
|
|
||||||
import { TileDescriptor } from "./TileDescriptor";
|
import { TileDescriptor } from "./TileDescriptor";
|
||||||
|
import { count, findLastIndex } from "../array-utils";
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* A 1×1 cell in a grid which belongs to a tile.
|
* A 1×1 cell in a grid which belongs to a tile.
|
||||||
|
@ -105,17 +106,6 @@ export function getPaths(dest: number, g: Grid): (number | null)[] {
|
||||||
return edges as (number | null)[];
|
return edges as (number | null)[];
|
||||||
}
|
}
|
||||||
|
|
||||||
function 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 =>
|
const findLast1By1Index = (g: Grid): number | null =>
|
||||||
findLastIndex(g.cells, (c) => c?.rows === 1 && c?.columns === 1);
|
findLastIndex(g.cells, (c) => c?.rows === 1 && c?.columns === 1);
|
||||||
|
|
||||||
|
@ -185,6 +175,8 @@ const areaEnd = (
|
||||||
g: Grid
|
g: Grid
|
||||||
): number => start + columns - 1 + g.columns * (rows - 1);
|
): number => start + columns - 1 + g.columns * (rows - 1);
|
||||||
|
|
||||||
|
const cloneGrid = (g: Grid): Grid => ({ ...g, cells: [...g.cells] });
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Gets the index of the next gap in the grid that should be backfilled by 1×1
|
* Gets the index of the next gap in the grid that should be backfilled by 1×1
|
||||||
* tiles.
|
* tiles.
|
||||||
|
@ -209,11 +201,150 @@ function getNextGap(g: Grid): number | null {
|
||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Gets the index of the origin of the tile to which the given cell belongs.
|
||||||
|
*/
|
||||||
|
function getOrigin(g: Grid, index: number): number {
|
||||||
|
const initialColumn = column(index, g);
|
||||||
|
|
||||||
|
for (
|
||||||
|
let i = index;
|
||||||
|
i >= 0;
|
||||||
|
i = column(i, g) === 0 ? i - g.columns + initialColumn : i - 1
|
||||||
|
) {
|
||||||
|
const cell = g.cells[i];
|
||||||
|
if (
|
||||||
|
cell !== undefined &&
|
||||||
|
cell.origin &&
|
||||||
|
inArea(index, i, areaEnd(i, cell.columns, cell.rows, g), g)
|
||||||
|
)
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
|
||||||
|
throw new Error("Tile is broken");
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Moves the tile at index "from" over to index "to", displacing other tiles
|
||||||
|
* along the way.
|
||||||
|
* Precondition: the destination area must consist of only 1×1 tiles.
|
||||||
|
*/
|
||||||
|
function moveTile(g: Grid, from: number, to: number) {
|
||||||
|
const tile = g.cells[from]!;
|
||||||
|
const fromEnd = areaEnd(from, tile.columns, tile.rows, g);
|
||||||
|
const toEnd = areaEnd(to, tile.columns, tile.rows, g);
|
||||||
|
|
||||||
|
const displacedTiles: Cell[] = [];
|
||||||
|
forEachCellInArea(to, toEnd, g, (c, i) => {
|
||||||
|
if (c !== undefined && !inArea(i, from, fromEnd, g)) displacedTiles.push(c);
|
||||||
|
});
|
||||||
|
|
||||||
|
const movingCells: Cell[] = [];
|
||||||
|
forEachCellInArea(from, fromEnd, g, (c, i) => {
|
||||||
|
movingCells.push(c!);
|
||||||
|
g.cells[i] = undefined;
|
||||||
|
});
|
||||||
|
|
||||||
|
forEachCellInArea(
|
||||||
|
to,
|
||||||
|
toEnd,
|
||||||
|
g,
|
||||||
|
(_c, i) => (g.cells[i] = movingCells.shift())
|
||||||
|
);
|
||||||
|
forEachCellInArea(
|
||||||
|
from,
|
||||||
|
fromEnd,
|
||||||
|
g,
|
||||||
|
(_c, i) => (g.cells[i] ??= displacedTiles.shift())
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Moves the tile at index "from" over to index "to", if there is space.
|
||||||
|
*/
|
||||||
|
export function tryMoveTile(g: Grid, from: number, to: number): Grid {
|
||||||
|
const tile = g.cells[from]!;
|
||||||
|
|
||||||
|
if (
|
||||||
|
to >= 0 &&
|
||||||
|
to < g.cells.length &&
|
||||||
|
column(to, g) <= g.columns - tile.columns
|
||||||
|
) {
|
||||||
|
const fromEnd = areaEnd(from, tile.columns, tile.rows, g);
|
||||||
|
const toEnd = areaEnd(to, tile.columns, tile.rows, g);
|
||||||
|
|
||||||
|
// The contents of a given cell are 'displaceable' if it's empty, holds a
|
||||||
|
// 1×1 tile, or is part of the original tile we're trying to reposition
|
||||||
|
const displaceable = (c: Cell | undefined, i: number): boolean =>
|
||||||
|
c === undefined ||
|
||||||
|
(c.columns === 1 && c.rows === 1) ||
|
||||||
|
inArea(i, from, fromEnd, g);
|
||||||
|
|
||||||
|
if (allCellsInArea(to, toEnd, g, displaceable)) {
|
||||||
|
// The target space is free; move
|
||||||
|
const gClone = cloneGrid(g);
|
||||||
|
moveTile(gClone, from, to);
|
||||||
|
return gClone;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The target space isn't free; don't move
|
||||||
|
return g;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Attempts to push a tile upwards by one row, displacing 1×1 tiles and shifting
|
||||||
|
* enlarged tiles around when necessary.
|
||||||
|
* @returns Whether the tile was actually pushed
|
||||||
|
*/
|
||||||
|
function pushTileUp(g: Grid, from: number): boolean {
|
||||||
|
const tile = g.cells[from]!;
|
||||||
|
|
||||||
|
// TODO: pushing large tiles sideways might be more successful in some
|
||||||
|
// situations
|
||||||
|
const cellsAboveAreDisplacable =
|
||||||
|
from - g.columns >= 0 &&
|
||||||
|
allCellsInArea(
|
||||||
|
from - g.columns,
|
||||||
|
from - g.columns + tile.columns - 1,
|
||||||
|
g,
|
||||||
|
(c, i) =>
|
||||||
|
c === undefined ||
|
||||||
|
(c.columns === 1 && c.rows === 1) ||
|
||||||
|
pushTileUp(g, getOrigin(g, i))
|
||||||
|
);
|
||||||
|
|
||||||
|
if (cellsAboveAreDisplacable) {
|
||||||
|
moveTile(g, from, from - g.columns);
|
||||||
|
return true;
|
||||||
|
} else {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Backfill any gaps in the grid.
|
* Backfill any gaps in the grid.
|
||||||
*/
|
*/
|
||||||
export function fillGaps(g: Grid): Grid {
|
export function fillGaps(g: Grid): Grid {
|
||||||
const result: Grid = { ...g, cells: [...g.cells] };
|
const result = cloneGrid(g);
|
||||||
|
|
||||||
|
// This will hopefully be the size of the grid after we're done here, assuming
|
||||||
|
// that we can pack the large tiles tightly enough
|
||||||
|
const idealLength = count(result.cells, (c) => c !== undefined);
|
||||||
|
|
||||||
|
// Step 1: Take any large tiles hanging off the bottom of the grid, and push
|
||||||
|
// them upwards
|
||||||
|
for (let i = result.cells.length - 1; i >= idealLength; i--) {
|
||||||
|
const cell = result.cells[i];
|
||||||
|
if (cell !== undefined && (cell.columns > 1 || cell.rows > 1)) {
|
||||||
|
const originIndex =
|
||||||
|
i - (cell.columns - 1) - result.columns * (cell.rows - 1);
|
||||||
|
// If it's not possible to pack the large tiles any tighter, give up
|
||||||
|
if (!pushTileUp(result, originIndex)) break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Step 2: Fill all 1×1 gaps
|
||||||
let gap = getNextGap(result);
|
let gap = getNextGap(result);
|
||||||
|
|
||||||
if (gap !== null) {
|
if (gap !== null) {
|
||||||
|
@ -263,9 +394,6 @@ export function fillGaps(g: Grid): Grid {
|
||||||
} while (gap !== null);
|
} 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
|
// Shrink the array to remove trailing gaps
|
||||||
const finalLength =
|
const finalLength =
|
||||||
(findLastIndex(result.cells, (c) => c !== undefined) ?? -1) + 1;
|
(findLastIndex(result.cells, (c) => c !== undefined) ?? -1) + 1;
|
||||||
|
@ -275,21 +403,104 @@ export function fillGaps(g: Grid): Grid {
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
export function appendItems(items: TileDescriptor[], g: Grid): Grid {
|
function createRows(g: Grid, count: number, atRow: number): Grid {
|
||||||
return {
|
const result = {
|
||||||
...g,
|
columns: g.columns,
|
||||||
cells: [
|
cells: new Array(g.cells.length + g.columns * count),
|
||||||
...g.cells,
|
|
||||||
...items.map((i) => ({
|
|
||||||
item: i,
|
|
||||||
origin: true,
|
|
||||||
columns: 1,
|
|
||||||
rows: 1,
|
|
||||||
})),
|
|
||||||
],
|
|
||||||
};
|
};
|
||||||
|
const offsetAfterNewRows = g.columns * count;
|
||||||
|
|
||||||
|
// Copy tiles from the original grid to the new one, with the new rows
|
||||||
|
// inserted at the target location
|
||||||
|
g.cells.forEach((c, from) => {
|
||||||
|
if (c?.origin) {
|
||||||
|
const offset = row(from, g) >= atRow ? offsetAfterNewRows : 0;
|
||||||
|
forEachCellInArea(
|
||||||
|
from,
|
||||||
|
areaEnd(from, c.columns, c.rows, g),
|
||||||
|
g,
|
||||||
|
(c, i) => {
|
||||||
|
result.cells[i + offset] = c;
|
||||||
|
}
|
||||||
|
);
|
||||||
|
}
|
||||||
|
});
|
||||||
|
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Adds a set of new items into the grid.
|
||||||
|
*/
|
||||||
|
export function addItems(items: TileDescriptor[], g: Grid): Grid {
|
||||||
|
let result = cloneGrid(g);
|
||||||
|
|
||||||
|
for (const item of items) {
|
||||||
|
const cell = {
|
||||||
|
item,
|
||||||
|
origin: true,
|
||||||
|
columns: 1,
|
||||||
|
rows: 1,
|
||||||
|
};
|
||||||
|
|
||||||
|
let placeAt: number;
|
||||||
|
let hasGaps: boolean;
|
||||||
|
|
||||||
|
if (item.placeNear === undefined) {
|
||||||
|
// This item has no special placement requests, so let's put it
|
||||||
|
// uneventfully at the end of the grid
|
||||||
|
placeAt = result.cells.length;
|
||||||
|
hasGaps = false;
|
||||||
|
} else {
|
||||||
|
// This item wants to be placed near another; let's put it on a row
|
||||||
|
// directly below the related tile
|
||||||
|
const placeNear = result.cells.findIndex(
|
||||||
|
(c) => c?.item.id === item.placeNear
|
||||||
|
);
|
||||||
|
if (placeNear === -1) {
|
||||||
|
// Can't find the related tile, so let's give up and place it at the end
|
||||||
|
placeAt = result.cells.length;
|
||||||
|
hasGaps = false;
|
||||||
|
} else {
|
||||||
|
const placeNearCell = result.cells[placeNear]!;
|
||||||
|
const placeNearEnd = areaEnd(
|
||||||
|
placeNear,
|
||||||
|
placeNearCell.columns,
|
||||||
|
placeNearCell.rows,
|
||||||
|
result
|
||||||
|
);
|
||||||
|
|
||||||
|
result = createRows(result, 1, row(placeNearEnd, result) + 1);
|
||||||
|
placeAt =
|
||||||
|
placeNear +
|
||||||
|
Math.floor(placeNearCell.columns / 2) +
|
||||||
|
result.columns * placeNearCell.rows;
|
||||||
|
hasGaps = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
result.cells[placeAt] = cell;
|
||||||
|
|
||||||
|
if (item.largeBaseSize) {
|
||||||
|
// Cycle the tile size once to set up the tile with its larger base size
|
||||||
|
// This also fills any gaps in the grid, hence no extra call to fillGaps
|
||||||
|
result = cycleTileSize(item.id, result);
|
||||||
|
} else if (hasGaps) {
|
||||||
|
result = fillGaps(result);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
const largeTileDimensions = (g: Grid): [number, number] => [
|
||||||
|
Math.min(3, Math.max(2, g.columns - 1)),
|
||||||
|
2,
|
||||||
|
];
|
||||||
|
|
||||||
|
const extraLargeTileDimensions = (g: Grid): [number, number] =>
|
||||||
|
g.columns > 3 ? [4, 3] : [g.columns, 2];
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Changes the size of a tile, rearranging the grid to make space.
|
* Changes the size of a tile, rearranging the grid to make space.
|
||||||
* @param tileId The ID of the tile to modify.
|
* @param tileId The ID of the tile to modify.
|
||||||
|
@ -299,15 +510,19 @@ export function appendItems(items: TileDescriptor[], g: Grid): Grid {
|
||||||
export function cycleTileSize(tileId: string, g: Grid): Grid {
|
export function cycleTileSize(tileId: string, g: Grid): Grid {
|
||||||
const from = g.cells.findIndex((c) => c?.item.id === tileId);
|
const from = g.cells.findIndex((c) => c?.item.id === tileId);
|
||||||
if (from === -1) return g; // Tile removed, no change
|
if (from === -1) return g; // Tile removed, no change
|
||||||
const fromWidth = g.cells[from]!.columns;
|
const fromCell = g.cells[from]!;
|
||||||
const fromHeight = g.cells[from]!.rows;
|
const fromWidth = fromCell.columns;
|
||||||
|
const fromHeight = fromCell.rows;
|
||||||
const fromEnd = areaEnd(from, fromWidth, fromHeight, g);
|
const fromEnd = areaEnd(from, fromWidth, fromHeight, g);
|
||||||
|
|
||||||
// The target dimensions, which toggle between 1×1 and larger than 1×1
|
const [baseDimensions, enlargedDimensions] = fromCell.item.largeBaseSize
|
||||||
|
? [largeTileDimensions(g), extraLargeTileDimensions(g)]
|
||||||
|
: [[1, 1], largeTileDimensions(g)];
|
||||||
|
// The target dimensions, which toggle between the base and enlarged sizes
|
||||||
const [toWidth, toHeight] =
|
const [toWidth, toHeight] =
|
||||||
fromWidth === 1 && fromHeight === 1
|
fromWidth === baseDimensions[0] && fromHeight === baseDimensions[1]
|
||||||
? [Math.min(3, Math.max(2, g.columns - 1)), 2]
|
? enlargedDimensions
|
||||||
: [1, 1];
|
: baseDimensions;
|
||||||
|
|
||||||
// If we're expanding the tile, we want to create enough new rows at the
|
// If we're expanding the tile, we want to create enough new rows at the
|
||||||
// tile's target position such that every new unit of grid area created during
|
// tile's target position such that every new unit of grid area created during
|
||||||
|
@ -319,12 +534,6 @@ export function cycleTileSize(tileId: string, g: Grid): Grid {
|
||||||
Math.ceil((toWidth * toHeight - fromWidth * fromHeight) / g.columns)
|
Math.ceil((toWidth * toHeight - fromWidth * fromHeight) / g.columns)
|
||||||
);
|
);
|
||||||
|
|
||||||
// This is the grid with the new rows added
|
|
||||||
const gappyGrid: Grid = {
|
|
||||||
...g,
|
|
||||||
cells: new Array(g.cells.length + newRows * g.columns),
|
|
||||||
};
|
|
||||||
|
|
||||||
// The next task is to scan for a spot to place the modified tile. Since we
|
// The next task is to scan for a spot to place the modified tile. Since we
|
||||||
// might be creating new rows at the target position, this spot can be shorter
|
// might be creating new rows at the target position, this spot can be shorter
|
||||||
// than the target height.
|
// than the target height.
|
||||||
|
@ -334,8 +543,8 @@ export function cycleTileSize(tileId: string, g: Grid): Grid {
|
||||||
// To make the tile appear to expand outwards from its center, we're actually
|
// To make the tile appear to expand outwards from its center, we're actually
|
||||||
// scanning for locations to put the *center* of the tile. These numbers are
|
// scanning for locations to put the *center* of the tile. These numbers are
|
||||||
// the offsets between the tile's origin and its center.
|
// the offsets between the tile's origin and its center.
|
||||||
const scanColumnOffset = Math.floor((toWidth - 1) / 2);
|
const scanColumnOffset = Math.floor((toWidth - fromWidth) / 2);
|
||||||
const scanRowOffset = Math.floor((toHeight - 1) / 2);
|
const scanRowOffset = Math.floor((toHeight - fromHeight) / 2);
|
||||||
|
|
||||||
const nextScanLocations = new Set<number>([from]);
|
const nextScanLocations = new Set<number>([from]);
|
||||||
const rows = row(g.cells.length - 1, g) + 1;
|
const rows = row(g.cells.length - 1, g) + 1;
|
||||||
|
@ -379,17 +588,19 @@ export function cycleTileSize(tileId: string, g: Grid): Grid {
|
||||||
|
|
||||||
const toRow = row(to, g);
|
const toRow = row(to, g);
|
||||||
|
|
||||||
// Copy tiles from the original grid to the new one, with the new rows
|
// This is the grid with the new rows added
|
||||||
// inserted at the target location
|
const gappyGrid = createRows(g, newRows, toRow + candidateHeight);
|
||||||
g.cells.forEach((c, src) => {
|
|
||||||
if (c?.origin && c.item.id !== tileId) {
|
// Remove the original tile
|
||||||
const offset =
|
const fromInGappyGrid =
|
||||||
row(src, g) > toRow + candidateHeight - 1 ? g.columns * newRows : 0;
|
from + (row(from, g) >= toRow + candidateHeight ? g.columns * newRows : 0);
|
||||||
forEachCellInArea(src, areaEnd(src, c.columns, c.rows, g), g, (c, i) => {
|
const fromEndInGappyGrid = fromInGappyGrid - from + fromEnd;
|
||||||
gappyGrid.cells[i + offset] = c;
|
forEachCellInArea(
|
||||||
});
|
fromInGappyGrid,
|
||||||
}
|
fromEndInGappyGrid,
|
||||||
});
|
gappyGrid,
|
||||||
|
(_c, i) => (gappyGrid.cells[i] = undefined)
|
||||||
|
);
|
||||||
|
|
||||||
// Place the tile in its target position, making a note of the tiles being
|
// Place the tile in its target position, making a note of the tiles being
|
||||||
// overwritten
|
// overwritten
|
||||||
|
@ -414,3 +625,79 @@ export function cycleTileSize(tileId: string, g: Grid): Grid {
|
||||||
// Fill any gaps that remain
|
// Fill any gaps that remain
|
||||||
return fillGaps(gappyGrid);
|
return fillGaps(gappyGrid);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Resizes the grid to a new column width.
|
||||||
|
*/
|
||||||
|
export function resize(g: Grid, columns: number): Grid {
|
||||||
|
const result: Grid = { columns, cells: [] };
|
||||||
|
const [largeColumns, largeRows] = largeTileDimensions(result);
|
||||||
|
|
||||||
|
// Copy each tile from the old grid to the resized one in the same order
|
||||||
|
|
||||||
|
// The next index in the result grid to copy a tile to
|
||||||
|
let next = 0;
|
||||||
|
|
||||||
|
for (const cell of g.cells) {
|
||||||
|
if (cell?.origin) {
|
||||||
|
const [nextColumns, nextRows] =
|
||||||
|
cell.columns > 1 || cell.rows > 1 ? [largeColumns, largeRows] : [1, 1];
|
||||||
|
|
||||||
|
// If there isn't enough space left on this row, jump to the next row
|
||||||
|
if (columns - column(next, result) < nextColumns)
|
||||||
|
next = columns * (Math.floor(next / columns) + 1);
|
||||||
|
const nextEnd = areaEnd(next, nextColumns, nextRows, result);
|
||||||
|
|
||||||
|
// Expand the cells array as necessary
|
||||||
|
if (result.cells.length <= nextEnd)
|
||||||
|
result.cells.push(...new Array(nextEnd + 1 - result.cells.length));
|
||||||
|
|
||||||
|
// Copy the tile into place
|
||||||
|
forEachCellInArea(next, nextEnd, result, (_c, i) => {
|
||||||
|
result.cells[i] = {
|
||||||
|
item: cell.item,
|
||||||
|
origin: i === next,
|
||||||
|
columns: nextColumns,
|
||||||
|
rows: nextRows,
|
||||||
|
};
|
||||||
|
});
|
||||||
|
|
||||||
|
next = nextEnd + 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return fillGaps(result);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Promotes speakers to the first page of the grid.
|
||||||
|
*/
|
||||||
|
export function promoteSpeakers(g: Grid) {
|
||||||
|
// This is all a bit of a hack right now, because we don't know if the designs
|
||||||
|
// will stick with this approach in the long run
|
||||||
|
// We assume that 4 rows are probably about 1 page
|
||||||
|
const firstPageEnd = g.columns * 4;
|
||||||
|
|
||||||
|
for (let from = firstPageEnd; from < g.cells.length; from++) {
|
||||||
|
const fromCell = g.cells[from];
|
||||||
|
// Don't bother trying to promote enlarged tiles
|
||||||
|
if (
|
||||||
|
fromCell?.item.isSpeaker &&
|
||||||
|
fromCell.columns === 1 &&
|
||||||
|
fromCell.rows === 1
|
||||||
|
) {
|
||||||
|
// Promote this tile by making 10 attempts to place it on the first page
|
||||||
|
for (let j = 0; j < 10; j++) {
|
||||||
|
const to = Math.floor(Math.random() * firstPageEnd);
|
||||||
|
const toCell = g.cells[to];
|
||||||
|
if (
|
||||||
|
toCell === undefined ||
|
||||||
|
(toCell.columns === 1 && toCell.rows === 1)
|
||||||
|
) {
|
||||||
|
moveTile(g, from, to);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
|
@ -15,13 +15,15 @@ limitations under the License.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
import {
|
import {
|
||||||
appendItems,
|
addItems,
|
||||||
column,
|
column,
|
||||||
cycleTileSize,
|
cycleTileSize,
|
||||||
fillGaps,
|
fillGaps,
|
||||||
forEachCellInArea,
|
forEachCellInArea,
|
||||||
Grid,
|
Grid,
|
||||||
|
resize,
|
||||||
row,
|
row,
|
||||||
|
tryMoveTile,
|
||||||
} from "../../src/video-grid/model";
|
} from "../../src/video-grid/model";
|
||||||
import { TileDescriptor } from "../../src/video-grid/TileDescriptor";
|
import { TileDescriptor } from "../../src/video-grid/TileDescriptor";
|
||||||
|
|
||||||
|
@ -31,7 +33,7 @@ import { TileDescriptor } from "../../src/video-grid/TileDescriptor";
|
||||||
function mkGrid(spec: string): Grid {
|
function mkGrid(spec: string): Grid {
|
||||||
const secondNewline = spec.indexOf("\n", 1);
|
const secondNewline = spec.indexOf("\n", 1);
|
||||||
const columns = secondNewline === -1 ? spec.length : secondNewline - 1;
|
const columns = secondNewline === -1 ? spec.length : secondNewline - 1;
|
||||||
const cells = spec.match(/[a-z ]/g) ?? [];
|
const cells = spec.match(/[a-z ]/g) ?? ([] as string[]);
|
||||||
const areas = new Set(cells);
|
const areas = new Set(cells);
|
||||||
areas.delete(" "); // Space represents an empty cell, not an area
|
areas.delete(" "); // Space represents an empty cell, not an area
|
||||||
const grid: Grid = { columns, cells: new Array(cells.length) };
|
const grid: Grid = { columns, cells: new Array(cells.length) };
|
||||||
|
@ -169,6 +171,50 @@ dddd
|
||||||
iegh`
|
iegh`
|
||||||
);
|
);
|
||||||
|
|
||||||
|
testFillGaps(
|
||||||
|
"keeps a large tile from hanging off the bottom",
|
||||||
|
`
|
||||||
|
abcd
|
||||||
|
efgh
|
||||||
|
|
||||||
|
ii
|
||||||
|
ii`,
|
||||||
|
`
|
||||||
|
abcd
|
||||||
|
iigh
|
||||||
|
iief`
|
||||||
|
);
|
||||||
|
|
||||||
|
testFillGaps(
|
||||||
|
"pushes a chain of large tiles upwards",
|
||||||
|
`
|
||||||
|
abcd
|
||||||
|
e fg
|
||||||
|
hh
|
||||||
|
hh
|
||||||
|
ii
|
||||||
|
ii`,
|
||||||
|
`
|
||||||
|
hhcd
|
||||||
|
hhfg
|
||||||
|
aiib
|
||||||
|
eii`
|
||||||
|
);
|
||||||
|
|
||||||
|
testFillGaps(
|
||||||
|
"gives up on pushing large tiles upwards when not possible",
|
||||||
|
`
|
||||||
|
aabb
|
||||||
|
aabb
|
||||||
|
cc
|
||||||
|
cc`,
|
||||||
|
`
|
||||||
|
aabb
|
||||||
|
aabb
|
||||||
|
cc
|
||||||
|
cc`
|
||||||
|
);
|
||||||
|
|
||||||
function testCycleTileSize(
|
function testCycleTileSize(
|
||||||
title: string,
|
title: string,
|
||||||
tileId: string,
|
tileId: string,
|
||||||
|
@ -227,9 +273,9 @@ dbbe
|
||||||
fghi
|
fghi
|
||||||
jk`,
|
jk`,
|
||||||
`
|
`
|
||||||
abhc
|
akbc
|
||||||
djge
|
djhe
|
||||||
fik`
|
fig`
|
||||||
);
|
);
|
||||||
|
|
||||||
testCycleTileSize(
|
testCycleTileSize(
|
||||||
|
@ -267,17 +313,160 @@ dde
|
||||||
ddf`
|
ddf`
|
||||||
);
|
);
|
||||||
|
|
||||||
test("appendItems appends 1×1 tiles", () => {
|
function testAddItems(
|
||||||
const grid1 = `
|
title: string,
|
||||||
|
items: TileDescriptor[],
|
||||||
|
input: string,
|
||||||
|
output: string
|
||||||
|
): void {
|
||||||
|
test(`addItems ${title}`, () => {
|
||||||
|
expect(showGrid(addItems(items, mkGrid(input)))).toBe(output);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
testAddItems(
|
||||||
|
"appends 1×1 tiles",
|
||||||
|
["e", "f"].map((i) => ({ id: i } as unknown as TileDescriptor)),
|
||||||
|
`
|
||||||
aab
|
aab
|
||||||
aac
|
aac
|
||||||
d`;
|
d`,
|
||||||
const grid2 = `
|
`
|
||||||
aab
|
aab
|
||||||
aac
|
aac
|
||||||
def`;
|
def`
|
||||||
const newItems = ["e", "f"].map(
|
);
|
||||||
(i) => ({ id: i } as unknown as TileDescriptor)
|
|
||||||
);
|
testAddItems(
|
||||||
expect(showGrid(appendItems(newItems, mkGrid(grid1)))).toBe(grid2);
|
"places one tile near another on request",
|
||||||
});
|
[{ id: "g", placeNear: "b" } as unknown as TileDescriptor],
|
||||||
|
`
|
||||||
|
abc
|
||||||
|
def`,
|
||||||
|
`
|
||||||
|
abc
|
||||||
|
gfe
|
||||||
|
d`
|
||||||
|
);
|
||||||
|
|
||||||
|
testAddItems(
|
||||||
|
"places items with a large base size",
|
||||||
|
[{ id: "g", largeBaseSize: true } as unknown as TileDescriptor],
|
||||||
|
`
|
||||||
|
abc
|
||||||
|
def`,
|
||||||
|
`
|
||||||
|
abc
|
||||||
|
ggf
|
||||||
|
gge
|
||||||
|
d`
|
||||||
|
);
|
||||||
|
|
||||||
|
function testTryMoveTile(
|
||||||
|
title: string,
|
||||||
|
from: number,
|
||||||
|
to: number,
|
||||||
|
input: string,
|
||||||
|
output: string
|
||||||
|
): void {
|
||||||
|
test(`tryMoveTile ${title}`, () => {
|
||||||
|
expect(showGrid(tryMoveTile(mkGrid(input), from, to))).toBe(output);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
testTryMoveTile(
|
||||||
|
"refuses to move a tile too far to the left",
|
||||||
|
1,
|
||||||
|
-1,
|
||||||
|
`
|
||||||
|
abc`,
|
||||||
|
`
|
||||||
|
abc`
|
||||||
|
);
|
||||||
|
|
||||||
|
testTryMoveTile(
|
||||||
|
"refuses to move a tile too far to the right",
|
||||||
|
1,
|
||||||
|
3,
|
||||||
|
`
|
||||||
|
abc`,
|
||||||
|
`
|
||||||
|
abc`
|
||||||
|
);
|
||||||
|
|
||||||
|
testTryMoveTile(
|
||||||
|
"moves a large tile to an unoccupied space",
|
||||||
|
3,
|
||||||
|
1,
|
||||||
|
`
|
||||||
|
a b
|
||||||
|
ccd
|
||||||
|
cce`,
|
||||||
|
`
|
||||||
|
acc
|
||||||
|
bcc
|
||||||
|
d e`
|
||||||
|
);
|
||||||
|
|
||||||
|
testTryMoveTile(
|
||||||
|
"refuses to move a large tile to an occupied space",
|
||||||
|
3,
|
||||||
|
1,
|
||||||
|
`
|
||||||
|
abb
|
||||||
|
ccd
|
||||||
|
cce`,
|
||||||
|
`
|
||||||
|
abb
|
||||||
|
ccd
|
||||||
|
cce`
|
||||||
|
);
|
||||||
|
|
||||||
|
function testResize(
|
||||||
|
title: string,
|
||||||
|
columns: number,
|
||||||
|
input: string,
|
||||||
|
output: string
|
||||||
|
): void {
|
||||||
|
test(`resize ${title}`, () => {
|
||||||
|
expect(showGrid(resize(mkGrid(input), columns))).toBe(output);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
testResize(
|
||||||
|
"contracts the grid",
|
||||||
|
2,
|
||||||
|
`
|
||||||
|
abbb
|
||||||
|
cbbb
|
||||||
|
ddde
|
||||||
|
dddf
|
||||||
|
gh`,
|
||||||
|
`
|
||||||
|
af
|
||||||
|
bb
|
||||||
|
bb
|
||||||
|
ch
|
||||||
|
dd
|
||||||
|
dd
|
||||||
|
eg`
|
||||||
|
);
|
||||||
|
|
||||||
|
testResize(
|
||||||
|
"expands the grid",
|
||||||
|
4,
|
||||||
|
`
|
||||||
|
af
|
||||||
|
bb
|
||||||
|
bb
|
||||||
|
ch
|
||||||
|
dd
|
||||||
|
dd
|
||||||
|
eg`,
|
||||||
|
`
|
||||||
|
bbbc
|
||||||
|
bbbf
|
||||||
|
addd
|
||||||
|
hddd
|
||||||
|
ge`
|
||||||
|
);
|
||||||
|
|
Loading…
Reference in a new issue