@fluidframework/matrix 2.0.0-internal.4.2.0 → 2.0.0-internal.4.3.0

package/dist/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/matrix";
-export declare const pkgVersion = "2.0.0-internal.4.2.0";
+export declare const pkgVersion = "2.0.0-internal.4.3.0";
 //# sourceMappingURL=packageVersion.d.ts.map

package/dist/packageVersion.js

@@ -8,5 +8,5 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.pkgVersion = exports.pkgName = void 0;
 exports.pkgName = "@fluidframework/matrix";
-exports.pkgVersion = "2.0.0-internal.4.2.0";
+exports.pkgVersion = "2.0.0-internal.4.3.0";
 //# sourceMappingURL=packageVersion.js.map

package/dist/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,wBAAwB,CAAC;AACnC,QAAA,UAAU,GAAG,sBAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"2.0.0-internal.4.2.0\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,wBAAwB,CAAC;AACnC,QAAA,UAAU,GAAG,sBAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"2.0.0-internal.4.3.0\";\n"]}

package/lib/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/matrix";
-export declare const pkgVersion = "2.0.0-internal.4.2.0";
+export declare const pkgVersion = "2.0.0-internal.4.3.0";
 //# sourceMappingURL=packageVersion.d.ts.map

package/lib/packageVersion.js

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export const pkgName = "@fluidframework/matrix";
-export const pkgVersion = "2.0.0-internal.4.2.0";
+export const pkgVersion = "2.0.0-internal.4.3.0";
 //# sourceMappingURL=packageVersion.js.map

package/lib/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,wBAAwB,CAAC;AAChD,MAAM,CAAC,MAAM,UAAU,GAAG,sBAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"2.0.0-internal.4.2.0\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,wBAAwB,CAAC;AAChD,MAAM,CAAC,MAAM,UAAU,GAAG,sBAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/matrix\";\nexport const pkgVersion = \"2.0.0-internal.4.3.0\";\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fluidframework/matrix",
-  "version": "2.0.0-internal.4.2.0",
+  "version": "2.0.0-internal.4.3.0",
   "description": "Distributed matrix",
   "homepage": "https://fluidframework.com",
   "repository": {
@@ -33,29 +33,29 @@
   "dependencies": {
     "@fluidframework/common-definitions": "^0.20.1",
     "@fluidframework/common-utils": "^1.1.1",
-    "@fluidframework/core-interfaces": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/datastore-definitions": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/merge-tree": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
+    "@fluidframework/core-interfaces": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/datastore-definitions": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/merge-tree": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
     "@fluidframework/protocol-base": "^0.1039.1000",
     "@fluidframework/protocol-definitions": "^1.1.0",
-    "@fluidframework/runtime-definitions": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/runtime-utils": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/shared-object-base": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/telemetry-utils": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
+    "@fluidframework/runtime-definitions": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/runtime-utils": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/shared-object-base": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/telemetry-utils": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
     "@tiny-calc/nano": "0.0.0-alpha.5",
     "events": "^3.1.0",
     "tslib": "^1.10.0"
   },
   "devDependencies": {
-    "@fluid-internal/test-dds-utils": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
+    "@fluid-internal/test-dds-utils": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
     "@fluid-tools/benchmark": "^0.47.0",
     "@fluid-tools/build-cli": "^0.17.0",
     "@fluidframework/build-common": "^1.1.0",
     "@fluidframework/build-tools": "^0.17.0",
     "@fluidframework/eslint-config-fluid": "^2.0.0",
     "@fluidframework/matrix-previous": "npm:@fluidframework/matrix@2.0.0-internal.4.1.0",
-    "@fluidframework/mocha-test-setup": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
-    "@fluidframework/test-runtime-utils": ">=2.0.0-internal.4.2.0 <2.0.0-internal.4.3.0",
+    "@fluidframework/mocha-test-setup": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
+    "@fluidframework/test-runtime-utils": ">=2.0.0-internal.4.3.0 <2.0.0-internal.4.4.0",
     "@microsoft/api-extractor": "^7.34.4",
     "@tiny-calc/micro": "0.0.0-alpha.5",
     "@types/mocha": "^9.1.1",

package/src/packageVersion.ts

@@ -6,4 +6,4 @@
  */
 
 export const pkgName = "@fluidframework/matrix";
-export const pkgVersion = "2.0.0-internal.4.2.0";
+export const pkgVersion = "2.0.0-internal.4.3.0";

package/bench/bsp-set-optimizations.md

@@ -1,84 +0,0 @@
-# BSP optimization
-
-The BSP set represents its data as a tree. But crucially, it carries
-no payload whatsoever. Instead, the whole information is encoded entirely
-in the structure of the tree.
-
-This allows us to potentially make the representation a lot more efficient.
-Let's consider exactly what information is stored in the tree:
-
-Each node can only have a few states. So we can give them a bit pattern:
-
-```fsharp
-type Node<'Key> =
-| Empty                              // 00
-| Dense                              // 01
-| Left of Node<'Key>                 // 100
-| Right of Node<'Key>                // 101
-| Both of Node<'Key> * Node<'Key>    // 110
-| Exact of 'Key                      // 111
-```
-
-But this lets us encode the BSP set very differently:
-
-```fsharp
-type BspSet<'Key> =
-{
-    Structure : BitVector
-    Keys : 'Key list
-}
-```
-
-## Example
-
-![Graph](./graphviz.svg "Graph")
-
-Currently, we encode the tree directly as an in-memory tree on the heap, i.e.:
-
-```fsharp
-let tree =
-    Both (
-        Empty,
-        Both (
-            Dense,
-            Right (
-                Exact(1, 2))))
-```
-
-But the new encoding would be a bit different:
-
-```fsharp
-let newTree =
-{
-    Structure = BitVector("110|00|110|01|101|111")
-    Keys = [1, 2]
-}
-```
-
-This encoding has very different properties w.r.t. to memory footprint and layout. The structure
-becomes a dense bit vector. In JavaScript, we would probably encode it as array of `number`s and
-use double-words from it. This way we'd get very good CPU cache behavoir, because in the vast
-majority of cases, the whole BSP set structure would fit into L1 cache and most likely be pre-loaded.
-
-Even though, we lose the possibility to do reference sharing, it may well be more efficient. We still
-can do reference sharing of the whole BSP set, because it remains immutable, but we can't share parts
-of the BSP set anymore.
-
-That said, the BSP set is only used to encode 1-dimensional sets in the product set, so you would expect
-the BSP sets in general to be fairly simple.
-
-Now the memory footprint of the BSP set is thus:
-
--   Some general overhead for the whole BSP set, i.e. object cost
--   Linear in the number of keys used for the exact representation.
-    Usually tiny, because they replace whole subtrees and occur infrequently.
--   About 2.5 bits per node. I.e. **tiny**.
-
-All the algorithms recurse over the structure of the tree, so they should be able to run over this
-bit encoding as well. Chances are it would be a lot faster, but definitely consuming a lot less
-memory than before.
-
-## Application
-
-If we did this change, we might be able to use raw product sets as messages inside say a shared dictionary
-because the payload of the messages might be small enough for that.

package/bench/graphviz.svg

@@ -1,73 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?><!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"><!-- Generated by graphviz version 2.40.1 (20161225.0304)
- --><!-- Title: G Pages: 1 --><svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" width="217pt" height="260pt" viewBox="0.00 0.00 217.31 260.00">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 256)">
-<title>G</title>
-<polygon fill="#ffffff" stroke="transparent" points="-4,4 -4,-256 213.3119,-256 213.3119,4 -4,4"/>
-<!-- root -->
-<g id="node1" class="node">
-<title>root</title>
-<ellipse fill="none" stroke="#000000" cx="75.176" cy="-234" rx="28.4127" ry="18"/>
-<text text-anchor="middle" x="75.176" y="-229.8" font-family="Times,serif" font-size="14.00" fill="#000000">both</text>
-</g>
-<!-- l -->
-<g id="node2" class="node">
-<title>l</title>
-<ellipse fill="none" stroke="#000000" cx="35.176" cy="-162" rx="35.3528" ry="18"/>
-<text text-anchor="middle" x="35.176" y="-157.8" font-family="Times,serif" font-size="14.00" fill="#000000">empty</text>
-</g>
-<!-- root&#45;&gt;l -->
-<g id="edge1" class="edge">
-<title>root-&gt;l</title>
-<path fill="none" stroke="#000000" d="M65.6965,-216.937C60.9345,-208.3654 55.0601,-197.7914 49.7407,-188.2165"/>
-<polygon fill="#000000" stroke="#000000" points="52.7813,-186.4825 44.8652,-179.4407 46.6622,-189.882 52.7813,-186.4825"/>
-</g>
-<!-- r -->
-<g id="node3" class="node">
-<title>r</title>
-<ellipse fill="none" stroke="#000000" cx="116.176" cy="-162" rx="28.4127" ry="18"/>
-<text text-anchor="middle" x="116.176" y="-157.8" font-family="Times,serif" font-size="14.00" fill="#000000">both</text>
-</g>
-<!-- root&#45;&gt;r -->
-<g id="edge2" class="edge">
-<title>root-&gt;r</title>
-<path fill="none" stroke="#000000" d="M84.8924,-216.937C89.8453,-208.2393 95.9721,-197.4799 101.4873,-187.7948"/>
-<polygon fill="#000000" stroke="#000000" points="104.6223,-189.3623 106.5293,-178.9405 98.5394,-185.8984 104.6223,-189.3623"/>
-</g>
-<!-- rl -->
-<g id="node4" class="node">
-<title>rl</title>
-<ellipse fill="none" stroke="#000000" cx="76.176" cy="-90" rx="33.045" ry="18"/>
-<text text-anchor="middle" x="76.176" y="-85.8" font-family="Times,serif" font-size="14.00" fill="#000000">dense</text>
-</g>
-<!-- r&#45;&gt;rl -->
-<g id="edge3" class="edge">
-<title>r-&gt;rl</title>
-<path fill="none" stroke="#000000" d="M106.6965,-144.937C101.9345,-136.3654 96.0601,-125.7914 90.7407,-116.2165"/>
-<polygon fill="#000000" stroke="#000000" points="93.7813,-114.4825 85.8652,-107.4407 87.6622,-117.882 93.7813,-114.4825"/>
-</g>
-<!-- rr -->
-<g id="node5" class="node">
-<title>rr</title>
-<ellipse fill="none" stroke="#000000" cx="156.176" cy="-90" rx="29.0529" ry="18"/>
-<text text-anchor="middle" x="156.176" y="-85.8" font-family="Times,serif" font-size="14.00" fill="#000000">right</text>
-</g>
-<!-- r&#45;&gt;rr -->
-<g id="edge4" class="edge">
-<title>r-&gt;rr</title>
-<path fill="none" stroke="#000000" d="M125.6554,-144.937C130.4174,-136.3654 136.2919,-125.7914 141.6112,-116.2165"/>
-<polygon fill="#000000" stroke="#000000" points="144.6898,-117.882 146.4867,-107.4407 138.5707,-114.4825 144.6898,-117.882"/>
-</g>
-<!-- rrr -->
-<g id="node6" class="node">
-<title>rrr</title>
-<ellipse fill="none" stroke="#000000" cx="156.176" cy="-18" rx="53.2723" ry="18"/>
-<text text-anchor="middle" x="156.176" y="-13.8" font-family="Times,serif" font-size="14.00" fill="#000000">Key: [1, 2]</text>
-</g>
-<!-- rr&#45;&gt;rrr -->
-<g id="edge5" class="edge">
-<title>rr-&gt;rrr</title>
-<path fill="none" stroke="#000000" d="M156.176,-71.8314C156.176,-64.131 156.176,-54.9743 156.176,-46.4166"/>
-<polygon fill="#000000" stroke="#000000" points="159.6761,-46.4132 156.176,-36.4133 152.6761,-46.4133 159.6761,-46.4132"/>
-</g>
-</g>
-</svg>

package/bench/src/imports.ts

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-export { SharedMatrix, SharedMatrixFactory } from "../../src";
-export { SparseArray2D } from "../../src/sparsearray2d";
-export { fill, IMatrix } from "../../test/utils";

package/bench/src/index.ts

@@ -1,48 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { run } from "hotloop";
-
-(async () => {
-	console.group("Populated");
-	await run([
-		// { path: "./src/read/nativearray", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true } },
-		// { path: "./src/read/map", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true } },
-		{
-			path: "./src/read/sparsearray2d",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true },
-		},
-		{
-			path: "./src/read/matrix/contiguous",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true },
-		},
-		{
-			path: "./src/read/matrix/fragmented",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true },
-		},
-		// { path: "./src/read/tiled", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: true } }
-	]);
-	console.groupEnd();
-
-	console.group("Empty");
-	await run([
-		// { path: "./src/read/nativearray", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false } },
-		// { path: "./src/read/map", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false } },
-		{
-			path: "./src/read/sparsearray2d",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false },
-		},
-		{
-			path: "./src/read/matrix/contiguous",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false },
-		},
-		{
-			path: "./src/read/matrix/fragmented",
-			args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false },
-		},
-		// { path: "./src/read/tiled", args: { row: 0, col: 0, rowCount: 256, colCount: 256, fill: false } }
-	]);
-	console.groupEnd();
-})();

package/bench/src/read/map.ts

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "./test";
-
-export class Map256x256<T> {
-	private readonly cells = new Map<number, T>();
-
-	public get rowCount() {
-		return 256;
-	}
-	public get colCount() {
-		return 256;
-	}
-
-	public getCell(row: number, col: number) {
-		return this.cells.get((row << 8) + col);
-	}
-
-	public setCell(row: number, col: number, value: T) {
-		this.cells.set((row << 8) + col, value);
-	}
-
-	public get matrixProducer() {
-		return undefined as any;
-	}
-}
-
-pointwise(undefined, new Map256x256<number>());

package/bench/src/read/matrix/contiguous.ts

@@ -1,15 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "../test";
-import { createContiguousMatrix } from "../../util";
-import { getTestArgs } from "hotloop";
-
-const { row, col, rowCount, colCount } = getTestArgs();
-
-const rowSize = row + rowCount;
-const colSize = col + colCount;
-
-pointwise(`Contiguous Matrix ${rowSize}x${colSize}`, createContiguousMatrix(rowSize, colSize));

package/bench/src/read/matrix/fragmented.ts

@@ -1,12 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "../test";
-import { createFragmentedMatrix } from "../../util";
-import { getTestArgs } from "hotloop";
-
-const { row, col, rowCount, colCount } = getTestArgs();
-
-pointwise("Fragmented Matrix 256x256", createFragmentedMatrix(row + rowCount, col + colCount));

package/bench/src/read/nativearray.ts

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "./test";
-
-export class Array256x256<T> {
-	private readonly cells: T[] = new Array(256 * 256).fill(0);
-
-	public get rowCount() {
-		return 256;
-	}
-	public get colCount() {
-		return 256;
-	}
-
-	public getCell(row: number, col: number) {
-		return this.cells[(row << 8) + col];
-	}
-
-	public setCell(row: number, col: number, value: T) {
-		this.cells[(row << 8) + col] = value;
-	}
-
-	public get matrixProducer() {
-		return undefined as any;
-	}
-}
-
-pointwise(undefined, new Array256x256<number>());

package/bench/src/read/sparsearray2d.ts

@@ -1,9 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "./test";
-import { SparseArray2D } from "../imports";
-
-pointwise(undefined, new SparseArray2D());

package/bench/src/read/test.ts

@@ -1,30 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { benchmark, getTestArgs } from "hotloop";
-import { fill, IMatrix } from "../imports";
-
-const { row, col, rowCount, colCount, fill: shouldFill } = getTestArgs();
-
-export function pointwise<T>(name: string | undefined, matrix: IMatrix<T>) {
-	if (shouldFill) {
-		fill(matrix, row, col, rowCount, colCount);
-	}
-
-	benchmark(
-		`SUM ${name !== undefined ? name : matrix.constructor.name} (${
-			shouldFill ? "full" : "empty"
-		}) Pointwise Read ${rowCount}x${colCount} @${row},${col}`,
-		() => {
-			let sum = 0;
-			for (let r = row; r < rowCount; r++) {
-				for (let c = col; c < colCount; c++) {
-					sum += matrix.getCell(r, c) as any | 0;
-				}
-			}
-			return sum;
-		},
-	);
-}

package/bench/src/read/tiled.ts

@@ -1,292 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { pointwise } from "./test";
-
-const enum Consts {
-	logW = 4,
-	logH = 5,
-	w = 1 << logW,
-	h = 1 << logH,
-	mw = w - 1,
-	mh = h - 1,
-	sizeW = 1 << (4 * logW),
-	sizeH = 1 << (4 * logH),
-}
-
-type CellTile<T> = T[];
-
-type SparseGrid<T> = CellTile<T>[][][];
-
-function getCell<T>(r: number, c: number, grid: SparseGrid<T>): T | undefined {
-	if (r < 0 || c < 0 || r >= Consts.sizeH || c >= Consts.sizeW) {
-		return undefined;
-	}
-	const t2 =
-		grid[
-			(((c >> (3 * Consts.logW)) & Consts.mw) << Consts.logH) |
-				((r >> (3 * Consts.logH)) & Consts.mh)
-		];
-	if (t2) {
-		const t3 =
-			t2[
-				(((c >> (2 * Consts.logW)) & Consts.mw) << Consts.logH) |
-					((r >> (2 * Consts.logH)) & Consts.mh)
-			];
-		if (t3) {
-			const t4 =
-				t3[
-					(((c >> Consts.logW) & Consts.mw) << Consts.logH) |
-						((r >> Consts.logH) & Consts.mh)
-				];
-			if (t4) {
-				return t4[((c & Consts.mw) << Consts.logH) | (r & Consts.mh)];
-			}
-		}
-	}
-	return undefined;
-}
-
-function setCell<T>(r: number, c: number, grid: SparseGrid<T>, value: T) {
-	if (r < 0 || c < 0 || r >= Consts.sizeH || c >= Consts.sizeW) {
-		return;
-	}
-
-	const i2 =
-		(((c >> (3 * Consts.logW)) & Consts.mw) << Consts.logH) |
-		((r >> (3 * Consts.logH)) & Consts.mh);
-	let t2 = grid[i2];
-	if (t2 === undefined) {
-		t2 = grid[i2] = [];
-	}
-
-	const i3 =
-		(((c >> (2 * Consts.logW)) & Consts.mw) << Consts.logH) |
-		((r >> (2 * Consts.logH)) & Consts.mh);
-	let t3 = t2[i3];
-	if (t3 === undefined) {
-		t3 = t2[i3] = [];
-	}
-
-	const i4 = (((c >> Consts.logW) & Consts.mw) << Consts.logH) | ((r >> Consts.logH) & Consts.mh);
-	let t4 = t3[i4];
-	if (t4 === undefined) {
-		t4 = t3[i4] = [];
-	}
-	t4[((c & Consts.mw) << Consts.logH) | (r & Consts.mh)] = value;
-}
-
-function clearCell<T>(r: number, c: number, grid: SparseGrid<T>) {
-	if (r < 0 || c < 0 || r >= Consts.sizeH || c >= Consts.sizeW) {
-		return;
-	}
-
-	const i2 =
-		(((c >> (3 * Consts.logW)) & Consts.mw) << Consts.logH) |
-		((r >> (3 * Consts.logH)) & Consts.mh);
-	const t2 = grid[i2];
-	if (t2 === undefined) {
-		return;
-	}
-
-	const i3 =
-		(((c >> (2 * Consts.logW)) & Consts.mw) << Consts.logH) |
-		((r >> (2 * Consts.logH)) & Consts.mh);
-	const t3 = t2[i3];
-	if (t3 === undefined) {
-		return;
-	}
-
-	const i4 = (((c >> Consts.logW) & Consts.mw) << Consts.logH) | ((r >> Consts.logH) & Consts.mh);
-	const t4 = t3[i4];
-	if (t4 === undefined) {
-		return;
-	}
-	delete t4[((c & Consts.mw) << Consts.logH) | (r & Consts.mh)];
-}
-
-function forEachCell<T>(grid: SparseGrid<T>, cb: (r: number, c: number, value: T) => void): void {
-	let i1 = 0;
-	for (const t1 of grid) {
-		if (t1 !== undefined) {
-			let i2 = 0;
-			const c1 = (i1 >> Consts.logH) << (3 * Consts.logW);
-			const r1 = (i1 & Consts.mh) << (3 * Consts.logH);
-			for (const t2 of t1) {
-				if (t2 !== undefined) {
-					let i3 = 0;
-					const c2 = (i2 >> Consts.logH) << (2 * Consts.logW);
-					const r2 = (i2 & Consts.mh) << (2 * Consts.logH);
-					for (const t3 of t2) {
-						if (t3 !== undefined) {
-							let i4 = 0;
-							const c3 = (i3 >> Consts.logH) << Consts.logW;
-							const r3 = (i3 & Consts.mh) << Consts.logH;
-							for (const value of t3) {
-								if (value !== undefined) {
-									cb(
-										r1 | r2 | r3 | (i4 & Consts.mh),
-										c1 | c2 | c3 | (i4 >> Consts.logH),
-										value,
-									);
-								}
-								i4++;
-							}
-						}
-						i3++;
-					}
-				}
-				i2++;
-			}
-		}
-		i1++;
-	}
-}
-
-function forEachCellInColumn<T>(
-	grid: SparseGrid<T>,
-	column: number,
-	cb: (r: number, c: number, value: T) => void,
-): void {
-	const colIdx1 = colIdx(column, 3);
-	const colIdx2 = colIdx(column, 2);
-	const colIdx3 = colIdx(column, 1);
-	const colIdx4 = colIdx(column, 0);
-	for (let r1 = 0; r1 < Consts.h; r1++) {
-		const t1 = grid[colIdx1 | r1];
-		if (t1 === undefined) {
-			continue;
-		}
-		for (let r2 = 0; r2 < Consts.h; r2++) {
-			const t2 = t1[colIdx2 | r2];
-			if (t2 === undefined) {
-				continue;
-			}
-			for (let r3 = 0; r3 < Consts.h; r3++) {
-				const t3 = t2[colIdx3 | r3];
-				if (t3 === undefined) {
-					continue;
-				}
-				for (let r4 = 0; r4 < Consts.h; r4++) {
-					const cell = t3[colIdx4 | r4];
-					if (cell === undefined) {
-						continue;
-					}
-					cb(
-						((r1 & Consts.mh) << (3 * Consts.logH)) |
-							((r2 & Consts.mh) << (2 * Consts.logH)) |
-							((r3 & Consts.mh) << Consts.logH) |
-							(r4 & Consts.mh),
-						column,
-						cell as any,
-					);
-				}
-			}
-		}
-	}
-}
-
-function colIdx(col: number, level: 0 | 1 | 2 | 3): number {
-	return ((col >> (level * Consts.logW)) & Consts.mw) << Consts.logH;
-}
-
-function colIdxUnshifted(col: number, level: 0 | 1 | 2 | 3): number {
-	return (col >> (level * Consts.logW)) & Consts.mw;
-}
-
-function forEachCellInColumns<T>(
-	grid: SparseGrid<T>,
-	columnStart: number,
-	numCols: number,
-	cb: (r: number, c: number, value: T) => void,
-): void {
-	const colEnd = columnStart + numCols - 1;
-	for (let r1 = 0; r1 < Consts.h; r1++) {
-		const cStart1 = colIdxUnshifted(columnStart, 3);
-		const cEnd1 = colIdxUnshifted(colEnd, 3);
-		for (let c1 = cStart1; c1 <= cEnd1; c1++) {
-			const t1 = grid[(c1 << Consts.logH) | r1];
-			if (t1 === undefined) {
-				continue;
-			}
-			for (let r2 = 0; r2 < Consts.h; r2++) {
-				const cStart2 = colIdxUnshifted(columnStart, 2);
-				const cEnd2 = colIdxUnshifted(colEnd, 2);
-				for (let c2 = cStart2; c2 <= cEnd2; c2++) {
-					const t2 = t1[(c2 << Consts.logH) | r2];
-					if (t2 === undefined) {
-						continue;
-					}
-					for (let r3 = 0; r3 < Consts.h; r3++) {
-						const cStart3 = colIdxUnshifted(columnStart, 1);
-						const cEnd3 = colIdxUnshifted(colEnd, 1);
-						for (let c3 = cStart3; c3 <= cEnd3; c3++) {
-							const t3 = t2[(c3 << Consts.logH) | r3];
-							if (t3 === undefined) {
-								continue;
-							}
-							for (let r4 = 0; r4 < Consts.h; r4++) {
-								const cStart4 = colIdxUnshifted(columnStart, 0);
-								const cEnd4 = colIdxUnshifted(colEnd, 0);
-								for (let c4 = cStart4; c4 <= cEnd4; c4++) {
-									const cell = t3[(c4 << Consts.logH) | r4];
-									if (cell === undefined) {
-										continue;
-									}
-									cb(
-										((r1 & Consts.mh) << (3 * Consts.logH)) |
-											((r2 & Consts.mh) << (2 * Consts.logH)) |
-											((r3 & Consts.mh) << Consts.logH) |
-											(r4 & Consts.mh),
-										(c1 << (3 * Consts.logW)) |
-											(c2 << (2 * Consts.logW)) |
-											(c3 << Consts.logW) |
-											c4,
-										cell,
-									);
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-}
-
-// Remove unused warnings
-forEachCell;
-clearCell;
-forEachCellInColumn;
-forEachCellInColumns;
-
-function initGrid<T>(): SparseGrid<T> {
-	return [];
-}
-
-export class TiledGrid<T> {
-	private readonly cells: SparseGrid<T> = initGrid();
-
-	public get rowCount() {
-		return Consts.sizeH;
-	}
-	public get colCount() {
-		return Consts.sizeW;
-	}
-
-	public getCell(row: number, col: number) {
-		return getCell(row, col, this.cells);
-	}
-
-	public setCell(row: number, col: number, value: T) {
-		setCell(row, col, this.cells, value);
-	}
-
-	public get matrixProducer() {
-		return undefined as any;
-	}
-}
-
-pointwise("TiledGrid", new TiledGrid<number>());

package/bench/src/util.ts

@@ -1,53 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { SharedMatrix, SharedMatrixFactory } from "./imports";
-import { insertFragmented } from "../../test/utils";
-import process from "process";
-
-let count = 1;
-let cached: any;
-
-/**
- * Paranoid defense against dead code elimination.
- */
-export function consume(value: any) {
-	count++;
-	if (count >>> 0 === 0) {
-		cached = value;
-	}
-}
-
-// Prevent v8"s optimizer from identifying "cached" as an unused value.
-process.on("exit", () => {
-	if (count >>> 0 === 0) {
-		console.log(`Ignore this: ${cached}`);
-	}
-});
-
-export function randomId() {
-	return Math.random().toString(36).slice(2);
-}
-
-export function createMatrix() {
-	return new SharedMatrixFactory().create(
-		new MockFluidDataStoreRuntime(),
-		randomId(),
-	) as SharedMatrix;
-}
-
-export function createContiguousMatrix(rowCount: number, colCount: number) {
-	const matrix = createMatrix();
-	matrix.insertRows(0, rowCount);
-	matrix.insertCols(0, colCount);
-	return matrix;
-}
-
-export function createFragmentedMatrix(rowCount: number, colCount: number) {
-	const matrix = createMatrix();
-	insertFragmented(matrix, rowCount, colCount);
-	return matrix;
-}

package/bench/tsconfig.json

@@ -1,10 +0,0 @@
-{
-	"extends": "../tsconfig.json",
-	"exclude": ["dist", "node_modules"],
-	"compilerOptions": {
-		"rootDir": "..",
-		"outDir": "./dist",
-		"types": ["node"],
-	},
-	"include": ["./src/**/*"],
-}