@graffy/common 0.19.1-alpha.2 → 0.19.1-alpha.3

package/coding/struct.d.ts

@@ -1,11 +1,3 @@
-export declare const END = 0;
-export declare const NULL = 1;
-export declare const FALSE = 2;
-export declare const TRUE = 3;
-export declare const NUM = 4;
 export declare const STR = 5;
-export declare const ARR = 6;
-export declare const OBJ = 7;
-export declare const EOK = 127;
 export declare function encode(value: any): Uint8Array<any>;
 export declare function decode(buffer: any): any;

package/coding/struct.js

@@ -7,15 +7,15 @@ import { decode as decodeString, encode as encodeString } from "./string.js";
   The constraints are:
   - Sorting a byte stream should
 */
-export const END = 0;
-export const NULL = 1;
-export const FALSE = 2;
-export const TRUE = 3;
-export const NUM = 4;
+const END = 0;
+const NULL = 1;
+const FALSE = 2;
+const TRUE = 3;
+const NUM = 4;
 export const STR = 5;
-export const ARR = 6;
-export const OBJ = 7;
-export const EOK = 127; // end-of-key
+const ARR = 6;
+const OBJ = 7;
+const EOK = 127; // end-of-key
 function encodeArray(array) {
     return [ARR, ...array.flatMap((value) => encodeParts(value)), END];
 }

package/ops/merge.d.ts

@@ -1,3 +1 @@
 export default function merge(current: any, changes: any): any;
-export declare function insertRange(current: any, change: any, start?: number): number;
-export declare function insertNode(current: any, change: any, start?: number): any;

package/ops/merge.js

@@ -12,7 +12,7 @@ export default function merge(current, changes) {
     }
     return current;
 }
-export function insertRange(current, change, start = 0) {
+function insertRange(current, change, start = 0) {
     const { key, end } = change;
     const keyIx = findFirst(current, key, start);
     const endIx = findLast(current, end, keyIx);
@@ -41,7 +41,7 @@ function mergeRanges(base, node) {
         cmp(base.end, node.end) > 0 && { ...base, key: keyAfter(node.end) },
     ].filter(Boolean);
 }
-export function insertNode(current, change, start = 0) {
+function insertNode(current, change, start = 0) {
     if (!current)
         throw new Error(`merge.insertNode: ${current}`);
     const key = change.key;

package/ops/sieve.d.ts

@@ -1,3 +1 @@
 export default function sieve(current: any, changes: any, result?: any[]): any[];
-export declare function insertRange(current: any, change: any, result: any, start?: number): number;
-export declare function insertNode(current: any, change: any, result: any, start?: number): any;

package/ops/sieve.js

@@ -10,7 +10,7 @@ export default function sieve(current, changes, result = []) {
     }
     return result;
 }
-export function insertRange(current, change, result, start = 0) {
+function insertRange(current, change, result, start = 0) {
     const { key, end } = change;
     const keyIx = findFirst(current, key, start);
     const endIx = findLast(current, end, keyIx);
@@ -89,7 +89,7 @@ function mergeRanges(base, node) {
         cmp(base.end, node.end) > 0 && { ...base, key: keyAfter(node.end) },
     ].filter(Boolean);
 }
-export function insertNode(current, change, result, start = 0) {
+function insertNode(current, change, result, start = 0) {
     const key = change.key;
     const index = findFirst(current, key, start);
     const node = current[index];

package/ops/slice.d.ts

@@ -9,5 +9,4 @@ declare class Result {
     addLinked(children: any): any;
 }
 export default function slice(graph: any, query: any, root?: any): Result;
-export declare function sliceRange(graph: any, query: any, result: any): void;
 export {};

package/ops/slice.js

@@ -93,7 +93,7 @@ function sliceNode(graph, query, result) {
         result.addKnown(graph);
     }
 }
-export function sliceRange(graph, query, result) {
+function sliceRange(graph, query, result) {
     let { key, end, limit = Number.POSITIVE_INFINITY, version } = query;
     const step = cmp(key, end) < 0 ? 1 : -1;
     // Prefixes are used to combine filtering and pagination. In schemas where

package/package.json

@@ -2,18 +2,9 @@
   "name": "@graffy/common",
   "description": "Common libraries that used by various Graffy modules.",
   "author": "aravind (https://github.com/aravindet)",
-  "version": "0.19.1-alpha.2",
-  "main": "./cjs/index.js",
-  "exports": {
-    ".": {
-      "import": "./index.js",
-      "types": "./index.d.ts"
-    },
-    "./*": {
-      "import": "./*.js",
-      "types": "./*.d.ts"
-    }
-  },
+  "version": "0.19.1-alpha.3",
+  "type": "module",
+  "main": "./index.js",
   "types": "./index.d.ts",
   "repository": {
     "type": "git",
@@ -24,7 +15,7 @@
     "debug": "^4.4.3",
     "lodash": "^4.18.1",
     "nanoid": "^5.1.11",
-    "@graffy/stream": "0.19.1-alpha.2",
+    "@graffy/stream": "0.19.1-alpha.3",
     "merge-async-iterators": "^0.2.1"
   }
 }