@adobe/data 0.2.1 → 0.2.3

package/dist/typed-buffer/typed-buffer.d.ts

@@ -0,0 +1,16 @@
+import { TypedArray } from "../internal/typed-array/index.js";
+export interface ReadonlyTypedBuffer<T> {
+    readonly size: number;
+    get(index: number): T;
+    [Symbol.iterator](): IterableIterator<T>;
+}
+export interface TypedBuffer<T> extends ReadonlyTypedBuffer<T> {
+    size: number;
+    set(index: number, value: T): void;
+    copyWithin(target: number, start: number, end: number): void;
+    /**
+     * Returns the typed array of the buffer.
+     * @throws If the buffer is not backed by a typed array.
+     */
+    getTypedArray(): TypedArray;
+}

package/dist/typed-buffer/typed-buffer.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=typed-buffer.js.map

package/dist/typed-buffer/typed-buffer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typed-buffer.js","sourceRoot":"","sources":["../../src/typed-buffer/typed-buffer.ts"],"names":[],"mappings":""}

package/dist/typed-buffer/typed-buffer.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/typed-buffer/typed-buffer.test.js

@@ -0,0 +1,223 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+import { describe, it, expect } from 'vitest';
+import { createTypedBuffer } from './create-typed-buffer.js';
+import { createNumberBuffer } from './create-number-buffer.js';
+import { createArrayBuffer } from './create-array-buffer.js';
+import { createStructBuffer } from './create-struct-buffer.js';
+describe('TypedBuffer copyWithin', () => {
+    describe('NumberBuffer', () => {
+        it('should copy elements within the same buffer', () => {
+            const buffer = createNumberBuffer({
+                schema: { type: 'number', precision: 1 },
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, i + 1);
+            }
+            // Copy elements 0-2 to position 2
+            buffer.copyWithin(2, 0, 3);
+            expect(buffer.get(0)).toBe(1);
+            expect(buffer.get(1)).toBe(2);
+            expect(buffer.get(2)).toBe(1);
+            expect(buffer.get(3)).toBe(2);
+            expect(buffer.get(4)).toBe(3);
+        });
+        it('should handle negative indices', () => {
+            const buffer = createNumberBuffer({
+                schema: { type: 'number', precision: 1 },
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, i + 1);
+            }
+            // Copy last 2 elements to start (from index -2 to end of array)
+            buffer.copyWithin(0, -2, buffer.size);
+            expect(buffer.get(0)).toBe(4);
+            expect(buffer.get(1)).toBe(5);
+            expect(buffer.get(2)).toBe(3);
+            expect(buffer.get(3)).toBe(4);
+            expect(buffer.get(4)).toBe(5);
+        });
+        it('should handle out of bounds indices', () => {
+            const buffer = createNumberBuffer({
+                schema: { type: 'number', precision: 1 },
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, i + 1);
+            }
+            // Copy with out of bounds target
+            buffer.copyWithin(10, 0, 2);
+            expect(buffer.get(0)).toBe(1);
+            expect(buffer.get(1)).toBe(2);
+            expect(buffer.get(2)).toBe(3);
+            expect(buffer.get(3)).toBe(4);
+            expect(buffer.get(4)).toBe(5);
+        });
+    });
+    describe('ArrayBuffer', () => {
+        it('should copy elements within the same buffer', () => {
+            const buffer = createArrayBuffer({ length: 5 });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, `value${i + 1}`);
+            }
+            // Copy elements 0-2 to position 2
+            buffer.copyWithin(2, 0, 3);
+            expect(buffer.get(0)).toBe('value1');
+            expect(buffer.get(1)).toBe('value2');
+            expect(buffer.get(2)).toBe('value1');
+            expect(buffer.get(3)).toBe('value2');
+            expect(buffer.get(4)).toBe('value3');
+        });
+        it('should handle negative indices', () => {
+            const buffer = createArrayBuffer({ length: 5 });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, `value${i + 1}`);
+            }
+            // Copy last 2 elements to start (from index -2 to end of array)
+            buffer.copyWithin(0, -2, buffer.size);
+            expect(buffer.get(0)).toBe('value4');
+            expect(buffer.get(1)).toBe('value5');
+            expect(buffer.get(2)).toBe('value3');
+            expect(buffer.get(3)).toBe('value4');
+            expect(buffer.get(4)).toBe('value5');
+        });
+        it('should handle out of bounds indices', () => {
+            const buffer = createArrayBuffer({ length: 5 });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, `value${i + 1}`);
+            }
+            // Copy with out of bounds target
+            buffer.copyWithin(10, 0, 2);
+            expect(buffer.get(0)).toBe('value1');
+            expect(buffer.get(1)).toBe('value2');
+            expect(buffer.get(2)).toBe('value3');
+            expect(buffer.get(3)).toBe('value4');
+            expect(buffer.get(4)).toBe('value5');
+        });
+    });
+    describe('StructBuffer', () => {
+        const vec2Schema = {
+            type: 'object',
+            properties: {
+                x: { type: 'number', precision: 1 },
+                y: { type: 'number', precision: 1 }
+            }
+        };
+        it('should copy elements within the same buffer', () => {
+            const buffer = createStructBuffer({
+                schema: vec2Schema,
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, { x: i + 1, y: i + 2 });
+            }
+            // Copy elements 0-2 to position 2
+            buffer.copyWithin(2, 0, 3);
+            expect(buffer.get(0)).toEqual({ x: 1, y: 2 });
+            expect(buffer.get(1)).toEqual({ x: 2, y: 3 });
+            expect(buffer.get(2)).toEqual({ x: 1, y: 2 });
+            expect(buffer.get(3)).toEqual({ x: 2, y: 3 });
+            expect(buffer.get(4)).toEqual({ x: 3, y: 4 });
+        });
+        it('should handle negative indices', () => {
+            const buffer = createStructBuffer({
+                schema: vec2Schema,
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, { x: i + 1, y: i + 2 });
+            }
+            // Copy last 2 elements to start (from index -2 to end of array)
+            buffer.copyWithin(0, -2, buffer.size);
+            expect(buffer.get(0)).toEqual({ x: 4, y: 5 });
+            expect(buffer.get(1)).toEqual({ x: 5, y: 6 });
+            expect(buffer.get(2)).toEqual({ x: 3, y: 4 });
+            expect(buffer.get(3)).toEqual({ x: 4, y: 5 });
+            expect(buffer.get(4)).toEqual({ x: 5, y: 6 });
+        });
+        it('should handle out of bounds indices', () => {
+            const buffer = createStructBuffer({
+                schema: vec2Schema,
+                length: 5
+            });
+            // Initialize with values
+            for (let i = 0; i < 5; i++) {
+                buffer.set(i, { x: i + 1, y: i + 2 });
+            }
+            // Copy with out of bounds target
+            buffer.copyWithin(10, 0, 2);
+            expect(buffer.get(0)).toEqual({ x: 1, y: 2 });
+            expect(buffer.get(1)).toEqual({ x: 2, y: 3 });
+            expect(buffer.get(2)).toEqual({ x: 3, y: 4 });
+            expect(buffer.get(3)).toEqual({ x: 4, y: 5 });
+            expect(buffer.get(4)).toEqual({ x: 5, y: 6 });
+        });
+    });
+    describe('createTypedBuffer', () => {
+        it('should create appropriate buffer type and handle copyWithin', () => {
+            // Test number buffer
+            const numberBuffer = createTypedBuffer({
+                schema: { type: 'number', precision: 1 }
+            });
+            numberBuffer.set(0, 1);
+            numberBuffer.set(1, 2);
+            numberBuffer.copyWithin(2, 0, 2);
+            expect(numberBuffer.get(2)).toBe(1);
+            expect(numberBuffer.get(3)).toBe(2);
+            // Test array buffer
+            const arrayBuffer = createTypedBuffer({
+                schema: { type: 'array', items: { type: 'string' }, minItems: 2, maxItems: 2 }
+            });
+            arrayBuffer.set(0, ['a', 'b']);
+            arrayBuffer.set(1, ['c', 'd']);
+            arrayBuffer.copyWithin(2, 0, 2);
+            expect(arrayBuffer.get(2)).toEqual(['a', 'b']);
+            expect(arrayBuffer.get(3)).toEqual(['c', 'd']);
+            // Test struct buffer
+            const structBuffer = createTypedBuffer({
+                schema: {
+                    type: 'object',
+                    properties: {
+                        x: { type: 'number', precision: 1 },
+                        y: { type: 'number', precision: 1 }
+                    }
+                }
+            });
+            structBuffer.set(0, { x: 1, y: 2 });
+            structBuffer.set(1, { x: 3, y: 4 });
+            structBuffer.copyWithin(2, 0, 2);
+            expect(structBuffer.get(2)).toEqual({ x: 1, y: 2 });
+            expect(structBuffer.get(3)).toEqual({ x: 3, y: 4 });
+        });
+    });
+});
+//# sourceMappingURL=typed-buffer.test.js.map

package/dist/typed-buffer/typed-buffer.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typed-buffer.test.js","sourceRoot":"","sources":["../../src/typed-buffer/typed-buffer.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/D,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACpC,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;gBACxC,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,CAAC;YAED,kCAAkC;YAClC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;gBACxC,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,CAAC;YAED,gEAAgE;YAChE,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;gBACxC,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,CAAC;YAED,iCAAiC;YACjC,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,MAAM,GAAG,iBAAiB,CAAS,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAExD,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;YAED,kCAAkC;YAClC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,iBAAiB,CAAS,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAExD,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;YAED,gEAAgE;YAChE,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,iBAAiB,CAAS,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAExD,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;YAED,iCAAiC;YACjC,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC1B,MAAM,UAAU,GAAG;YACf,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACR,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;gBACnC,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;aACtC;SACK,CAAC;QAEX,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,CAAC;YAED,kCAAkC;YAClC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,CAAC;YAED,gEAAgE;YAChE,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,kBAAkB,CAAC;gBAC9B,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,yBAAyB;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,CAAC;YAED,iCAAiC;YACjC,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC/B,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACnE,qBAAqB;YACrB,MAAM,YAAY,GAAG,iBAAiB,CAAC;gBACnC,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;aAC3C,CAAC,CAAC;YACH,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvB,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvB,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEpC,oBAAoB;YACpB,MAAM,WAAW,GAAG,iBAAiB,CAAC;gBAClC,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAW;aAC1F,CAAC,CAAC;YACH,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/B,WAAW,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE/C,qBAAqB;YACrB,MAAM,YAAY,GAAG,iBAAiB,CAAC;gBACnC,MAAM,EAAE;oBACJ,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;wBACnC,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE;qBACtC;iBACJ;aACJ,CAAC,CAAC;YACH,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/types/assert.d.ts

@@ -0,0 +1 @@
+export type Assert<T extends true> = T;

package/dist/types/assert.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=assert.js.map

package/dist/types/assert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assert.js","sourceRoot":"","sources":["../../src/types/assert.ts"],"names":[],"mappings":""}

package/dist/types/equal.d.ts

@@ -0,0 +1 @@
+export type Equal<X, Y> = (<T>() => T extends X ? 1 : 2) extends (<T>() => T extends Y ? 1 : 2) ? true : false;

package/dist/types/equal.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=equal.js.map

package/dist/types/equal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"equal.js","sourceRoot":"","sources":["../../src/types/equal.ts"],"names":[],"mappings":""}

package/dist/types/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./types.js";
+export * from "./assert.js";
+export * from "./equal.js";

package/dist/types/index.js

@@ -0,0 +1,25 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+export * from "./types.js";
+export * from "./assert.js";
+export * from "./equal.js";
+//# sourceMappingURL=index.js.map

package/dist/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC"}

package/dist/types/types.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Excludes all properties that have value type never.
+ */
+export type NoNever<T> = {
+    [K in keyof T as T[K] extends never ? never : K]: T[K];
+};
+/**
+ * Expands the type so when viewing in the editor, it shows all properties.
+ */
+export type Expand<T> = T extends {} ? T extends infer O ? {
+    [K in keyof O]: O[K];
+} : T : T;
+/**
+ * Extracts all function properties that return void.
+ */
+export type VoidFunctions<T> = NoNever<{
+    [K in keyof T]: T[K] extends (...args: any[]) => infer R ? IsVoid<R> extends true ? T[K] : never : never;
+}>;
+export type KeysWithValueType<T, U> = {
+    [K in keyof T]: T[K] extends U ? K : never;
+}[keyof T];
+export type StringKeyof<T> = Extract<keyof T, string>;
+export type IsVoid<T> = [void] extends [T] ? T extends void ? true : false : false;
+export type IsTrue<T> = [T] extends [true] ? [true] extends [T] ? true : false : false;
+export type Not<T> = [T] extends [false] ? true : [T] extends [true] ? false : boolean;
+export type False<A extends false> = A extends boolean ? true : true;
+export type True<A extends true> = A extends boolean ? true : true;
+export type Extends<A, B> = [A] extends [B] ? true : false;
+export type EquivalentTypes<A, B> = [A] extends [B] ? [B] extends [A] ? true : false : false;
+export type AnyFunction = (...args: unknown[]) => unknown;
+export type DeepReadonly<T> = T extends Function ? T : T extends Array<infer U> ? IsTuple<T> extends true ? {
+    readonly [K in keyof T]: DeepReadonly<T[K]>;
+} : ReadonlyArray<DeepReadonly<U>> : T extends object ? {
+    readonly [K in keyof T]: DeepReadonly<T[K]>;
+} : T;
+type IsTuple<T> = T extends readonly [...infer Elements] ? number extends T['length'] ? false : true : false;
+export type Simplify<T> = T extends object ? {
+    [K in keyof T]: T[K];
+} : T;
+export type IsNever<T> = [T] extends [never] ? true : false;
+export type RequiredKeys<T extends object> = {
+    [K in keyof T]-?: {} extends {
+        [P in K]: T[K];
+    } ? never : K;
+}[keyof T];
+export type OptionalKeys<T extends object> = Exclude<{
+    [K in keyof T]: T extends Record<K, T[K]> ? never : K;
+}[keyof T], undefined>;
+type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;
+export type NoUnion<Key> = [Key] extends [UnionToIntersection<Key>] ? Key : never;
+export {};

package/dist/types/types.js

@@ -0,0 +1,27 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+{
+}
+{
+}
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/types/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAqDX,CAAC;AAID,CAAC;AAOD,CAAC;AAID,CAAC"}

package/package.json

@@ -1,10 +1,52 @@
 {
   "name": "@adobe/data",
-  "version": "0.2.1",
+  "version": "0.2.3",
   "description": "Adobe data oriented programming library",
   "type": "module",
   "sideEffects": true,
   "private": false,
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "typesVersions": {
+    "*": {
+      "*": [
+        "./dist/index.d.ts"
+      ],
+      "observe": [
+        "./dist/observe/index.d.ts"
+      ],
+      "cache": [
+        "./dist/cache/index.d.ts"
+      ],
+      "schema": [
+        "./dist/schema/index.d.ts"
+      ],
+      "types": [
+        "./dist/types/index.d.ts"
+      ],
+      "ecs": [
+        "./dist/ecs/index.d.ts"
+      ],
+      "old-ecs": [
+        "./dist/old-ecs/index.d.ts"
+      ],
+      "lit": [
+        "./dist/lit/index.d.ts"
+      ],
+      "service": [
+        "./dist/service/index.d.ts"
+      ],
+      "table": [
+        "./dist/table/index.d.ts"
+      ],
+      "typed-buffer": [
+        "./dist/typed-buffer/index.d.ts"
+      ]
+    }
+  },
   "exports": {
     ".": {
       "import": "./dist/index.js",

package/.cursorrules

@@ -1,28 +0,0 @@
-# Stack
-
-pnpm
-vite
-typescript
-
-# Paradigm
-
-- separation of concerns
-- Functional programming
-- Data oriented
-- Prefer Immutable data, but mutation allowed for high performance
-- No classes, enums or inheritance
-
-# Linting
-
-- Use modern Typescript.
-- End statements with semicolons.
-- Use `const` and `let` instead of `var`.
-- Use `??` instead of `||` for nullish coalescing.
-
-# Testing
-
-- Use pnpm test [filename]
-- BEFORE FIXING, pause and verify test and implementation and describe which one is in error.
-- Focus on concise code coverage and edge cases.
-- Unit tests live adjacent to files they test as <my-file>.test.ts
-

package/.eslintrc.cjs

@@ -1,48 +0,0 @@
-const fs = require('fs');
-const path = require('path');
-
-// Define a concise header format
-const headerLines = [
-  'MIT License',
-  '',
-  '© Copyright 2025 Adobe. All rights reserved.',
-  '',
-  'Permission is hereby granted, free of charge, to any person obtaining a copy',
-  'of this software and associated documentation files (the "Software"), to deal',
-  'in the Software without restriction, including without limitation the rights',
-  'to use, copy, modify, merge, publish, distribute, sublicense, and/or sell',
-  'copies of the Software, and to permit persons to whom the Software is',
-  'furnished to do so, subject to the following conditions:',
-  '',
-  'The above copyright notice and this permission notice shall be included in all',
-  'copies or substantial portions of the Software.',
-  '',
-  'THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR',
-  'IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,',
-  'FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE',
-  'AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER',
-  'LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,',
-  'OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE',
-  'SOFTWARE.',
-];
-
-module.exports = {
-  extends: [
-    'eslint:recommended',
-    'plugin:@typescript-eslint/recommended',
-  ],
-  plugins: ['header'],
-  rules: {
-    'header/header': [
-      'warn',
-      'block',
-      headerLines,
-    ],
-    '@typescript-eslint/no-explicit-any': 'off',  // Allow 'any' type
-    '@typescript-eslint/no-non-null-assertion': 'off',  // Allow non-null assertions
-    '@typescript-eslint/ban-types': 'off', // Disable banning of certain types
-    '@typescript-eslint/no-empty-function': 'off', // Allow empty functions
-    '@typescript-eslint/no-unused-vars': 'off', // Allow unused variables
-  },
-  ignorePatterns: ['.eslintrc.cjs', 'docs', 'dist', 'tests', 'vite.config.js'],  // Updated ignore patterns
-};

package/.github/CONTRIBUTING.md

@@ -1,47 +0,0 @@
-# Contributing
-
-Thanks for choosing to contribute!
-
-The following are a set of guidelines to follow when contributing to this project.
-
-## Code Of Conduct
-
-This project adheres to the Adobe [code of conduct](../CODE_OF_CONDUCT.md). By participating,
-you are expected to uphold this code. Please report unacceptable behavior to
-[Grp-opensourceoffice@adobe.com](mailto:Grp-opensourceoffice@adobe.com).
-
-## Have A Question?
-
-Start by filing an issue. The existing committers on this project work to reach
-consensus around project direction and issue solutions within issue threads
-(when appropriate).
-
-## Contributor License Agreement
-
-All third-party contributions to this project must be accompanied by a signed contributor
-license agreement. This gives Adobe permission to redistribute your contributions
-as part of the project. [Sign our CLA](https://opensource.adobe.com/cla.html). You
-only need to submit an Adobe CLA one time, so if you have submitted one previously,
-you are good to go!
-
-## Code Reviews
-
-All submissions should come in the form of pull requests and need to be reviewed
-by project committers. Read [GitHub's pull request documentation](https://help.github.com/articles/about-pull-requests/)
-for more information on sending pull requests.
-
-Lastly, please follow the [pull request template](PULL_REQUEST_TEMPLATE.md) when
-submitting a pull request!
-
-## From Contributor To Committer
-
-We love contributions from our community! If you'd like to go a step beyond contributor
-and become a committer with full write access and a say in the project, you must
-be invited to the project. The existing committers employ an internal nomination
-process that must reach lazy consensus (silence is approval) before invitations
-are issued. If you feel you are qualified and want to get more deeply involved,
-feel free to reach out to existing committers to have a conversation about that.
-
-## Security Issues
-
-Security issues shouldn't be reported on this issue tracker. Instead, [file an issue to our security experts](https://helpx.adobe.com/security/alertus.html).