molstar 4.3.0 → 4.4.1

package/lib/commonjs/mol-data/generic/linked-list.js

@@ -5,11 +5,10 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.LinkedList = void 0;
+exports.LinkedList = LinkedList;
 function LinkedList() {
     return new LinkedListImpl();
 }
-exports.LinkedList = LinkedList;
 function createListNode(value) {
     return { previous: null, next: null, inList: true, value };
 }

package/lib/commonjs/mol-data/int/impl/interval.js

@@ -5,31 +5,38 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.intersectionSize = exports.intersect = exports.findRange = exports.findPredecessorIndexInInterval = exports.findPredecessorIndex = exports.isSubInterval = exports.areIntersecting = exports.areEqual = exports.getAt = exports.indexOf = exports.has = exports.toString = exports.hashCode = exports.size = exports.max = exports.min = exports.end = exports.start = exports.is = exports.ofLength = exports.ofBounds = exports.ofRange = exports.Empty = void 0;
+exports.areEqual = exports.toString = exports.hashCode = exports.size = exports.min = exports.end = exports.start = exports.is = exports.Empty = void 0;
+exports.ofRange = ofRange;
+exports.ofBounds = ofBounds;
+exports.ofLength = ofLength;
+exports.max = max;
+exports.has = has;
+exports.indexOf = indexOf;
+exports.getAt = getAt;
+exports.areIntersecting = areIntersecting;
+exports.isSubInterval = isSubInterval;
+exports.findPredecessorIndex = findPredecessorIndex;
+exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
+exports.findRange = findRange;
+exports.intersect = intersect;
+exports.intersectionSize = intersectionSize;
 const tuple_1 = require("../tuple");
 exports.Empty = tuple_1.IntTuple.Zero;
 function ofRange(min, max) { return max < min ? tuple_1.IntTuple.create(min, min) : tuple_1.IntTuple.create(min, max + 1); }
-exports.ofRange = ofRange;
 function ofBounds(start, end) { return end <= start ? tuple_1.IntTuple.create(start, start) : tuple_1.IntTuple.create(start, end); }
-exports.ofBounds = ofBounds;
 function ofLength(length) { return length < 0 ? tuple_1.IntTuple.create(0, 0) : tuple_1.IntTuple.create(0, length); }
-exports.ofLength = ofLength;
 exports.is = tuple_1.IntTuple.is;
 exports.start = tuple_1.IntTuple.fst;
 exports.end = tuple_1.IntTuple.snd;
 exports.min = tuple_1.IntTuple.fst;
 function max(i) { return tuple_1.IntTuple.snd(i) - 1; }
-exports.max = max;
 exports.size = tuple_1.IntTuple.diff;
 exports.hashCode = tuple_1.IntTuple.hashCode;
 exports.toString = tuple_1.IntTuple.toString;
 function has(int, v) { return tuple_1.IntTuple.fst(int) <= v && v < tuple_1.IntTuple.snd(int); }
-exports.has = has;
 /** Returns the index of `x` in `set` or -1 if not found. */
 function indexOf(int, x) { const m = (0, exports.start)(int); return x >= m && x < (0, exports.end)(int) ? x - m : -1; }
-exports.indexOf = indexOf;
 function getAt(int, i) { return tuple_1.IntTuple.fst(int) + i; }
-exports.getAt = getAt;
 exports.areEqual = tuple_1.IntTuple.areEqual;
 function areIntersecting(a, b) {
     const sa = (0, exports.size)(a), sb = (0, exports.size)(b);
@@ -37,7 +44,6 @@ function areIntersecting(a, b) {
         return true;
     return sa > 0 && sb > 0 && max(a) >= (0, exports.min)(b) && (0, exports.min)(a) <= max(b);
 }
-exports.areIntersecting = areIntersecting;
 function isSubInterval(a, b) {
     if (!(0, exports.size)(a))
         return (0, exports.size)(b) === 0;
@@ -45,7 +51,6 @@ function isSubInterval(a, b) {
         return true;
     return (0, exports.start)(a) <= (0, exports.start)(b) && (0, exports.end)(a) >= (0, exports.end)(b);
 }
-exports.isSubInterval = isSubInterval;
 function findPredecessorIndex(int, v) {
     const s = (0, exports.start)(int);
     if (v <= s)
@@ -55,7 +60,6 @@ function findPredecessorIndex(int, v) {
         return e - s;
     return v - s;
 }
-exports.findPredecessorIndex = findPredecessorIndex;
 function findPredecessorIndexInInterval(int, v, bounds) {
     const bS = (0, exports.start)(bounds);
     const s = (0, exports.start)(int);
@@ -66,18 +70,14 @@ function findPredecessorIndexInInterval(int, v, bounds) {
         return bE;
     return v - s;
 }
-exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
 function findRange(int, min, max) {
     return ofBounds(findPredecessorIndex(int, min), findPredecessorIndex(int, max + 1));
 }
-exports.findRange = findRange;
 function intersect(a, b) {
     if (!areIntersecting(a, b))
         return exports.Empty;
     return ofBounds(Math.max((0, exports.start)(a), (0, exports.start)(b)), Math.min((0, exports.end)(a), (0, exports.end)(b)));
 }
-exports.intersect = intersect;
 function intersectionSize(a, b) {
     return (0, exports.size)(findRange(a, (0, exports.min)(b), max(b)));
 }
-exports.intersectionSize = intersectionSize;

package/lib/commonjs/mol-data/int/impl/ordered-set.js

@@ -5,7 +5,31 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.indexedIntersect = exports.forEachSegment = exports.forEach = exports.subtract = exports.intersect = exports.union = exports.intersectionSize = exports.findRange = exports.findPredecessorIndexInInterval = exports.findPredecessorIndex = exports.isSubset = exports.areIntersecting = exports.areEqual = exports.toString = exports.hashCode = exports.end = exports.start = exports.max = exports.min = exports.getAt = exports.indexOf = exports.has = exports.size = exports.ofSortedArray = exports.ofBounds = exports.ofRange = exports.ofSingleton = exports.Empty = void 0;
+exports.ofBounds = exports.ofRange = exports.ofSingleton = exports.Empty = void 0;
+exports.ofSortedArray = ofSortedArray;
+exports.size = size;
+exports.has = has;
+exports.indexOf = indexOf;
+exports.getAt = getAt;
+exports.min = min;
+exports.max = max;
+exports.start = start;
+exports.end = end;
+exports.hashCode = hashCode;
+exports.toString = toString;
+exports.areEqual = areEqual;
+exports.areIntersecting = areIntersecting;
+exports.isSubset = isSubset;
+exports.findPredecessorIndex = findPredecessorIndex;
+exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
+exports.findRange = findRange;
+exports.intersectionSize = intersectionSize;
+exports.union = union;
+exports.intersect = intersect;
+exports.subtract = subtract;
+exports.forEach = forEach;
+exports.forEachSegment = forEachSegment;
+exports.indexedIntersect = indexedIntersect;
 const sorted_array_1 = require("../sorted-array");
 const interval_1 = require("../interval");
 exports.Empty = interval_1.Interval.Empty;
@@ -20,29 +44,18 @@ function ofSortedArray(xs) {
         return interval_1.Interval.ofRange(xs[0], xs[xs.length - 1]);
     return xs;
 }
-exports.ofSortedArray = ofSortedArray;
 function size(set) { return interval_1.Interval.is(set) ? interval_1.Interval.size(set) : sorted_array_1.SortedArray.size(set); }
-exports.size = size;
 function has(set, x) { return interval_1.Interval.is(set) ? interval_1.Interval.has(set, x) : sorted_array_1.SortedArray.has(set, x); }
-exports.has = has;
 /** Returns the index of `x` in `set` or -1 if not found. */
 function indexOf(set, x) { return interval_1.Interval.is(set) ? interval_1.Interval.indexOf(set, x) : sorted_array_1.SortedArray.indexOf(set, x); }
-exports.indexOf = indexOf;
 function getAt(set, i) { return interval_1.Interval.is(set) ? interval_1.Interval.getAt(set, i) : set[i]; }
-exports.getAt = getAt;
 function min(set) { return interval_1.Interval.is(set) ? interval_1.Interval.min(set) : sorted_array_1.SortedArray.min(set); }
-exports.min = min;
 function max(set) { return interval_1.Interval.is(set) ? interval_1.Interval.max(set) : sorted_array_1.SortedArray.max(set); }
-exports.max = max;
 function start(set) { return interval_1.Interval.is(set) ? interval_1.Interval.start(set) : sorted_array_1.SortedArray.start(set); }
-exports.start = start;
 function end(set) { return interval_1.Interval.is(set) ? interval_1.Interval.end(set) : sorted_array_1.SortedArray.end(set); }
-exports.end = end;
 function hashCode(set) { return interval_1.Interval.is(set) ? interval_1.Interval.hashCode(set) : sorted_array_1.SortedArray.hashCode(set); }
-exports.hashCode = hashCode;
 // TODO: possibly add more hash functions to allow for multilevel hashing.
 function toString(set) { return interval_1.Interval.is(set) ? interval_1.Interval.toString(set) : sorted_array_1.SortedArray.toString(set); }
-exports.toString = toString;
 function areEqual(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -53,7 +66,6 @@ function areEqual(a, b) {
         return areEqualIS(b, a);
     return sorted_array_1.SortedArray.areEqual(a, b);
 }
-exports.areEqual = areEqual;
 function areIntersecting(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -64,7 +76,6 @@ function areIntersecting(a, b) {
         return areIntersectingSI(a, b);
     return sorted_array_1.SortedArray.areIntersecting(a, b);
 }
-exports.areIntersecting = areIntersecting;
 /** Check if the 2nd argument is a subset of the 1st */
 function isSubset(a, b) {
     if (interval_1.Interval.is(a)) {
@@ -76,19 +87,15 @@ function isSubset(a, b) {
         return isSubsetSI(a, b);
     return sorted_array_1.SortedArray.isSubset(a, b);
 }
-exports.isSubset = isSubset;
 function findPredecessorIndex(set, x) {
     return interval_1.Interval.is(set) ? interval_1.Interval.findPredecessorIndex(set, x) : sorted_array_1.SortedArray.findPredecessorIndex(set, x);
 }
-exports.findPredecessorIndex = findPredecessorIndex;
 function findPredecessorIndexInInterval(set, x, bounds) {
     return interval_1.Interval.is(set) ? interval_1.Interval.findPredecessorIndexInInterval(set, x, bounds) : sorted_array_1.SortedArray.findPredecessorIndexInInterval(set, x, bounds);
 }
-exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
 function findRange(set, min, max) {
     return interval_1.Interval.is(set) ? interval_1.Interval.findRange(set, min, max) : sorted_array_1.SortedArray.findRange(set, min, max);
 }
-exports.findRange = findRange;
 function intersectionSize(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -99,7 +106,6 @@ function intersectionSize(a, b) {
         return intersectionSizeSI(a, b);
     return sorted_array_1.SortedArray.intersectionSize(a, b);
 }
-exports.intersectionSize = intersectionSize;
 function union(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -110,7 +116,6 @@ function union(a, b) {
         return unionSI(a, b);
     return ofSortedArray(sorted_array_1.SortedArray.union(a, b));
 }
-exports.union = union;
 function intersect(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -121,7 +126,6 @@ function intersect(a, b) {
         return intersectSI(a, b);
     return ofSortedArray(sorted_array_1.SortedArray.intersect(a, b));
 }
-exports.intersect = intersect;
 function subtract(a, b) {
     if (interval_1.Interval.is(a)) {
         if (interval_1.Interval.is(b))
@@ -132,7 +136,6 @@ function subtract(a, b) {
         return subtractSI(a, b);
     return ofSortedArray(sorted_array_1.SortedArray.subtract(a, b));
 }
-exports.subtract = subtract;
 function areEqualIS(a, b) { return interval_1.Interval.size(a) === sorted_array_1.SortedArray.size(b) && interval_1.Interval.start(a) === sorted_array_1.SortedArray.start(b) && interval_1.Interval.end(a) === sorted_array_1.SortedArray.end(b); }
 function areIntersectingSI(a, b) {
     return a.length !== 0 && interval_1.Interval.size(sorted_array_1.SortedArray.findRange(a, interval_1.Interval.min(b), interval_1.Interval.max(b))) !== 0;
@@ -338,7 +341,6 @@ function forEach(set, f, ctx) {
     }
     return ctx;
 }
-exports.forEach = forEach;
 function forEachSegment(set, segment, f, ctx) {
     if (interval_1.Interval.is(set)) {
         let sI = 0;
@@ -366,7 +368,6 @@ function forEachSegment(set, segment, f, ctx) {
     }
     return ctx;
 }
-exports.forEachSegment = forEachSegment;
 function indexedIntersect(idxA, a, b) {
     if (a === b)
         return idxA;
@@ -419,4 +420,3 @@ function indexedIntersect(idxA, a, b) {
     }
     return ofSortedArray(indices);
 }
-exports.indexedIntersect = indexedIntersect;

package/lib/commonjs/mol-data/int/impl/segmentation.js

@@ -5,7 +5,13 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.segments = exports.SegmentIterator = exports.projectValue = exports.getSegment = exports.count = exports.ofOffsets = exports.create = void 0;
+exports.SegmentIterator = void 0;
+exports.create = create;
+exports.ofOffsets = ofOffsets;
+exports.count = count;
+exports.getSegment = getSegment;
+exports.projectValue = projectValue;
+exports.segments = segments;
 const ordered_set_1 = require("../ordered-set");
 const interval_1 = require("../interval");
 const sorted_array_1 = require("../sorted-array");
@@ -20,7 +26,6 @@ function create(values) {
     }
     return { offsets, index, count: values.length - 1 };
 }
-exports.create = create;
 function ofOffsets(offsets, bounds) {
     const s = interval_1.Interval.start(bounds);
     const segments = new Int32Array(offsets.length + 1);
@@ -30,18 +35,14 @@ function ofOffsets(offsets, bounds) {
     segments[offsets.length] = interval_1.Interval.end(bounds) - s;
     return create(segments);
 }
-exports.ofOffsets = ofOffsets;
 /** Get number of segments in a segmentation */
 function count({ count }) { return count; }
-exports.count = count;
 function getSegment({ index }, value) { return index[value]; }
-exports.getSegment = getSegment;
 function projectValue({ offsets }, set, value) {
     const last = ordered_set_1.OrderedSet.max(offsets);
     const idx = value >= last ? -1 : ordered_set_1.OrderedSet.findPredecessorIndex(offsets, value - 1);
     return ordered_set_1.OrderedSet.findRange(set, ordered_set_1.OrderedSet.getAt(offsets, idx), ordered_set_1.OrderedSet.getAt(offsets, idx + 1) - 1);
 }
-exports.projectValue = projectValue;
 class SegmentIterator {
     move() {
         while (this.hasNext) {
@@ -97,4 +98,3 @@ function segments(segs, set, segment) {
     const int = typeof segment !== 'undefined' ? interval_1.Interval.ofBounds(segment.start, segment.end) : interval_1.Interval.ofBounds(0, ordered_set_1.OrderedSet.size(set));
     return new SegmentIterator(segs.offsets, segs.index, set, int);
 }
-exports.segments = segments;

package/lib/commonjs/mol-data/int/impl/sorted-array.js

@@ -5,16 +5,43 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.indicesOf = exports.deduplicate = exports.subtract = exports.intersect = exports.intersectionSize = exports.union = exports.isSubset = exports.areIntersecting = exports.findRange = exports.findPredecessorIndexInInterval = exports.findPredecessorIndex = exports.areEqual = exports.getAt = exports.has = exports.indexOfInRange = exports.indexOfInInterval = exports.indexOf = exports.toString = exports.hashCode = exports.size = exports.max = exports.min = exports.end = exports.start = exports.isRange = exports.is = exports.ofRange = exports.ofUnsortedArray = exports.ofSortedArray = exports.ofSingleton = exports.Empty = void 0;
+exports.Empty = void 0;
+exports.ofSingleton = ofSingleton;
+exports.ofSortedArray = ofSortedArray;
+exports.ofUnsortedArray = ofUnsortedArray;
+exports.ofRange = ofRange;
+exports.is = is;
+exports.isRange = isRange;
+exports.start = start;
+exports.end = end;
+exports.min = min;
+exports.max = max;
+exports.size = size;
+exports.hashCode = hashCode;
+exports.toString = toString;
+exports.indexOf = indexOf;
+exports.indexOfInInterval = indexOfInInterval;
+exports.indexOfInRange = indexOfInRange;
+exports.has = has;
+exports.getAt = getAt;
+exports.areEqual = areEqual;
+exports.findPredecessorIndex = findPredecessorIndex;
+exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
+exports.findRange = findRange;
+exports.areIntersecting = areIntersecting;
+exports.isSubset = isSubset;
+exports.union = union;
+exports.intersectionSize = intersectionSize;
+exports.intersect = intersect;
+exports.subtract = subtract;
+exports.deduplicate = deduplicate;
+exports.indicesOf = indicesOf;
 const util_1 = require("../../util");
 const interval_1 = require("../interval");
 exports.Empty = [];
 function ofSingleton(v) { return [v]; }
-exports.ofSingleton = ofSingleton;
 function ofSortedArray(xs) { return xs; }
-exports.ofSortedArray = ofSortedArray;
 function ofUnsortedArray(xs) { (0, util_1.sortArray)(xs); return xs; }
-exports.ofUnsortedArray = ofUnsortedArray;
 function ofRange(min, max) {
     if (max < min)
         return [];
@@ -23,21 +50,13 @@ function ofRange(min, max) {
         ret[i - min] = i;
     return ret;
 }
-exports.ofRange = ofRange;
 function is(xs) { return xs && (Array.isArray(xs) || !!xs.buffer); }
-exports.is = is;
 function isRange(xs) { return xs[xs.length - 1] - xs[0] + 1 === xs.length; }
-exports.isRange = isRange;
 function start(xs) { return xs[0]; }
-exports.start = start;
 function end(xs) { return xs[xs.length - 1] + 1; }
-exports.end = end;
 function min(xs) { return xs[0]; }
-exports.min = min;
 function max(xs) { return xs[xs.length - 1]; }
-exports.max = max;
 function size(xs) { return xs.length; }
-exports.size = size;
 function hashCode(xs) {
     // hash of tuple (size, min, max, mid)
     const s = xs.length;
@@ -47,33 +66,26 @@ function hashCode(xs) {
         return (0, util_1.hash4)(s, xs[0], xs[s - 1], xs[s >> 1]);
     return (0, util_1.hash3)(s, xs[0], xs[s - 1]);
 }
-exports.hashCode = hashCode;
 function toString(xs) {
     const s = xs.length;
     if (s > 5)
         return `[${xs[0]}, ${xs[1]}, ..., ${xs[s - 1]}], length ${s}`;
     return `[${xs.join(', ')}]`;
 }
-exports.toString = toString;
 /** Returns the index of `x` in `set` or -1 if not found. */
 function indexOf(xs, v) {
     const l = xs.length;
     return l === 0 ? -1 : xs[0] <= v && v <= xs[l - 1] ? binarySearchRange(xs, v, 0, l) : -1;
 }
-exports.indexOf = indexOf;
 function indexOfInInterval(xs, v, bounds) {
     return indexOfInRange(xs, v, interval_1.Interval.start(bounds), interval_1.Interval.end(bounds));
 }
-exports.indexOfInInterval = indexOfInInterval;
 function indexOfInRange(xs, v, s, e) {
     const l = xs.length;
     return l === 0 || e <= s ? -1 : xs[s] <= v && v <= xs[e - 1] ? binarySearchRange(xs, v, s, e) : -1;
 }
-exports.indexOfInRange = indexOfInRange;
 function has(xs, v) { return indexOf(xs, v) >= 0; }
-exports.has = has;
 function getAt(xs, i) { return xs[i]; }
-exports.getAt = getAt;
 function areEqual(a, b) {
     if (a === b)
         return true;
@@ -89,7 +101,6 @@ function areEqual(a, b) {
     }
     return true;
 }
-exports.areEqual = areEqual;
 /**
  * Returns 0 if `v` is smaller or equal the first element of `xs`
  * Returns length of `xs` if `v` is bigger than the last element of `xs`
@@ -103,7 +114,6 @@ function findPredecessorIndex(xs, v) {
         return len;
     return binarySearchPredIndexRange(xs, v, 0, len);
 }
-exports.findPredecessorIndex = findPredecessorIndex;
 function findPredecessorIndexInInterval(xs, v, bounds) {
     const s = interval_1.Interval.start(bounds), e = interval_1.Interval.end(bounds);
     const sv = xs[s];
@@ -116,11 +126,9 @@ function findPredecessorIndexInInterval(xs, v, bounds) {
         return linearSearchPredInRange(xs, v, s + 1, e);
     return binarySearchPredIndexRange(xs, v, s, e);
 }
-exports.findPredecessorIndexInInterval = findPredecessorIndexInInterval;
 function findRange(xs, min, max) {
     return interval_1.Interval.ofBounds(findPredecessorIndex(xs, min), findPredecessorIndex(xs, max + 1));
 }
-exports.findRange = findRange;
 function binarySearchRange(xs, value, start, end) {
     let min = start, max = end - 1;
     while (min <= max) {
@@ -189,7 +197,6 @@ function areIntersecting(a, b) {
     }
     return false;
 }
-exports.areIntersecting = areIntersecting;
 function isSubset(a, b) {
     if (a === b)
         return true;
@@ -215,7 +222,6 @@ function isSubset(a, b) {
     }
     return equal === lenB;
 }
-exports.isSubset = isSubset;
 function union(a, b) {
     if (a === b)
         return a;
@@ -270,14 +276,12 @@ function union(a, b) {
         indices[offset++] = b[j];
     return ofSortedArray(indices);
 }
-exports.union = union;
 function intersectionSize(a, b) {
     if (a === b)
         return size(a);
     const { startI, startJ, endI, endJ } = getSuitableIntersectionRange(a, b);
     return getCommonCount(a, b, startI, startJ, endI, endJ);
 }
-exports.intersectionSize = intersectionSize;
 function getCommonCount(a, b, startI, startJ, endI, endJ) {
     let i = startI, j = startJ;
     let commonCount = 0;
@@ -332,7 +336,6 @@ function intersect(a, b) {
     }
     return ofSortedArray(indices);
 }
-exports.intersect = intersect;
 function subtract(a, b) {
     if (a === b)
         return exports.Empty;
@@ -386,7 +389,6 @@ function subtract(a, b) {
         indices[offset++] = a[i];
     return ofSortedArray(indices);
 }
-exports.subtract = subtract;
 function deduplicate(xs) {
     if (xs.length < 2)
         return xs;
@@ -406,7 +408,6 @@ function deduplicate(xs) {
     ret[o] = xs[xs.length - 1];
     return ret;
 }
-exports.deduplicate = deduplicate;
 function indicesOf(a, b) {
     if (areEqual(a, b))
         return ofSortedArray((0, util_1.createRangeArray)(0, a.length - 1));
@@ -454,7 +455,6 @@ function indicesOf(a, b) {
     }
     return ofSortedArray(indices);
 }
-exports.indicesOf = indicesOf;
 const _maxIntRangeRet = { startI: 0, startJ: 0, endI: 0, endJ: 0 };
 // for small sets, just gets the whole range, for large sets does a bunch of binary searches
 function getSuitableIntersectionRange(a, b) {

package/lib/commonjs/mol-data/int/linked-index.js

@@ -5,11 +5,10 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.LinkedIndex = void 0;
+exports.LinkedIndex = LinkedIndex;
 function LinkedIndex(size) {
     return new LinkedIndexImpl(size);
 }
-exports.LinkedIndex = LinkedIndex;
 class LinkedIndexImpl {
     remove(i) {
         const { prev, next } = this;

package/lib/commonjs/mol-data/util/array.js

@@ -6,7 +6,11 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayGetCtor = exports.arrayPickIndices = exports.createRangeArray = exports.iterableToArray = exports.arrayFind = void 0;
+exports.arrayFind = arrayFind;
+exports.iterableToArray = iterableToArray;
+exports.createRangeArray = createRangeArray;
+exports.arrayPickIndices = arrayPickIndices;
+exports.arrayGetCtor = arrayGetCtor;
 function arrayFind(array, f) {
     for (let i = 0, _i = array.length; i < _i; i++) {
         if (f(array[i]))
@@ -14,7 +18,6 @@ function arrayFind(array, f) {
     }
     return void 0;
 }
-exports.arrayFind = arrayFind;
 function iterableToArray(it) {
     if (Array.from)
         return Array.from(it);
@@ -27,7 +30,6 @@ function iterableToArray(it) {
     }
     return ret;
 }
-exports.iterableToArray = iterableToArray;
 /** Fills the array so that array[0] = start and array[array.length - 1] = end */
 function createRangeArray(start, end, ctor) {
     const len = end - start + 1;
@@ -37,7 +39,6 @@ function createRangeArray(start, end, ctor) {
     }
     return array;
 }
-exports.createRangeArray = createRangeArray;
 function arrayPickIndices(array, indices) {
     const ret = new (arrayGetCtor(array))(indices.length);
     for (let i = 0, _i = indices.length; i < _i; i++) {
@@ -45,11 +46,9 @@ function arrayPickIndices(array, indices) {
     }
     return ret;
 }
-exports.arrayPickIndices = arrayPickIndices;
 function arrayGetCtor(data) {
     const ret = data.constructor;
     if (!ret)
         throw new Error('data does not define a constructor and it should');
     return ret;
 }
-exports.arrayGetCtor = arrayGetCtor;

package/lib/commonjs/mol-data/util/buckets.js

@@ -5,7 +5,7 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.makeBuckets = void 0;
+exports.makeBuckets = makeBuckets;
 const sort_1 = require("./sort");
 function sortAsc(bs, i, j) { return bs[i].key < bs[j].key ? -1 : 1; }
 function _makeBuckets(indices, getKey, sortBuckets, start, end) {
@@ -77,4 +77,3 @@ function makeBuckets(indices, getKey, options) {
         throw new Error('Can only bucket non-empty collections.');
     return _makeBuckets(indices, getKey, !!(options && options.sort), s, e);
 }
-exports.makeBuckets = makeBuckets;

package/lib/commonjs/mol-data/util/combination.js

@@ -5,7 +5,8 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.combinations = exports.CombinationIterator = void 0;
+exports.CombinationIterator = void 0;
+exports.combinations = combinations;
 function P(m, n) {
     let p = 1;
     while (n--)
@@ -56,4 +57,3 @@ function combinations(array, count) {
         out.push(combinationIt.move().slice());
     return out;
 }
-exports.combinations = combinations;

package/lib/commonjs/mol-data/util/equivalence-classes.js

@@ -5,7 +5,8 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.EquivalenceClasses = exports.EquivalenceClassesImpl = void 0;
+exports.EquivalenceClassesImpl = void 0;
+exports.EquivalenceClasses = EquivalenceClasses;
 class EquivalenceClassesImpl {
     createGroup(key, value) {
         const id = this.id++;
@@ -47,4 +48,3 @@ exports.EquivalenceClassesImpl = EquivalenceClassesImpl;
 function EquivalenceClasses(getHash, areEqual) {
     return new EquivalenceClassesImpl(getHash, areEqual);
 }
-exports.EquivalenceClasses = EquivalenceClasses;

package/lib/commonjs/mol-data/util/grouping.js

@@ -5,7 +5,8 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.groupBy = exports.Grouper = void 0;
+exports.Grouper = Grouper;
+exports.groupBy = groupBy;
 const db_1 = require("../db");
 class GroupingImpl {
     add(a) {
@@ -34,7 +35,6 @@ class GroupingImpl {
 function Grouper(getKey) {
     return new GroupingImpl(getKey);
 }
-exports.Grouper = Grouper;
 function groupBy(values, getKey) {
     const gs = Grouper(getKey);
     if (db_1.Column.is(values)) {
@@ -48,4 +48,3 @@ function groupBy(values, getKey) {
     }
     return gs.getGrouping();
 }
-exports.groupBy = groupBy;