molstar 3.0.0 → 3.0.1

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

@@ -1,84 +0,0 @@
-"use strict";
-/**
- * Copyright (c) 2017-2019 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @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;
-var 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) { var 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) {
-    var sa = (0, exports.size)(a), sb = (0, exports.size)(b);
-    if (sa === 0 && sb === 0)
-        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;
-    if (!(0, exports.size)(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) {
-    var s = (0, exports.start)(int);
-    if (v <= s)
-        return 0;
-    var e = (0, exports.end)(int);
-    if (v >= e)
-        return e - s;
-    return v - s;
-}
-exports.findPredecessorIndex = findPredecessorIndex;
-function findPredecessorIndexInInterval(int, v, bounds) {
-    var bS = (0, exports.start)(bounds);
-    var s = (0, exports.start)(int);
-    if (v <= bS + s)
-        return bS;
-    var bE = (0, exports.end)(bounds);
-    if (v >= bE + s)
-        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;
-//# sourceMappingURL=interval.js.map

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

@@ -1,40 +0,0 @@
-/**
- * Copyright (c) 2017-2019 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author David Sehnal <david.sehnal@gmail.com>
- */
-import { SortedArray as S } from '../sorted-array';
-import { Interval as I } from '../interval';
-declare type OrderedSetImpl = I | S;
-declare type Nums = ArrayLike<number>;
-export declare const Empty: OrderedSetImpl;
-export declare const ofSingleton: <T extends number = number>(value: T) => I<T>;
-export declare const ofRange: <T extends number = number>(min: T, max: T) => I<T>;
-export declare const ofBounds: <T extends number = number>(start: T, end: T) => I<T>;
-export declare function ofSortedArray(xs: Nums): OrderedSetImpl;
-export declare function size(set: OrderedSetImpl): number;
-export declare function has(set: OrderedSetImpl, x: number): boolean;
-/** Returns the index of `x` in `set` or -1 if not found. */
-export declare function indexOf(set: OrderedSetImpl, x: number): number;
-export declare function getAt(set: OrderedSetImpl, i: number): number;
-export declare function min(set: OrderedSetImpl): number;
-export declare function max(set: OrderedSetImpl): number;
-export declare function start(set: OrderedSetImpl): number;
-export declare function end(set: OrderedSetImpl): number;
-export declare function hashCode(set: OrderedSetImpl): number;
-export declare function toString(set: OrderedSetImpl): string;
-export declare function areEqual(a: OrderedSetImpl, b: OrderedSetImpl): boolean;
-export declare function areIntersecting(a: OrderedSetImpl, b: OrderedSetImpl): boolean;
-/** Check if the 2nd argument is a subset of the 1st */
-export declare function isSubset(a: OrderedSetImpl, b: OrderedSetImpl): boolean;
-export declare function findPredecessorIndex(set: OrderedSetImpl, x: number): number;
-export declare function findPredecessorIndexInInterval(set: OrderedSetImpl, x: number, bounds: I): number;
-export declare function findRange(set: OrderedSetImpl, min: number, max: number): I<number>;
-export declare function intersectionSize(a: OrderedSetImpl, b: OrderedSetImpl): number;
-export declare function union(a: OrderedSetImpl, b: OrderedSetImpl): I<number> | S<number>;
-export declare function intersect(a: OrderedSetImpl, b: OrderedSetImpl): I<number> | S<number>;
-export declare function subtract(a: OrderedSetImpl, b: OrderedSetImpl): I<number> | S<number>;
-export declare function forEach(set: OrderedSetImpl, f: (value: number, i: number, ctx: any) => void, ctx: any): any;
-export declare function forEachSegment(set: OrderedSetImpl, segment: (v: number) => number, f: (value: number, segIndex: number, ctx: any) => void, ctx: any): any;
-export declare function indexedIntersect(idxA: OrderedSetImpl, a: S, b: S): OrderedSetImpl;
-export {};

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

@@ -1,423 +0,0 @@
-"use strict";
-/**
- * Copyright (c) 2017-2019 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @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;
-var sorted_array_1 = require("../sorted-array");
-var interval_1 = require("../interval");
-exports.Empty = interval_1.Interval.Empty;
-exports.ofSingleton = interval_1.Interval.ofSingleton;
-exports.ofRange = interval_1.Interval.ofRange;
-exports.ofBounds = interval_1.Interval.ofBounds;
-function ofSortedArray(xs) {
-    if (!xs.length)
-        return exports.Empty;
-    // check if the array is just a range
-    if (sorted_array_1.SortedArray.isRange(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))
-            return interval_1.Interval.areEqual(a, b);
-        return areEqualIS(a, b);
-    }
-    else if (interval_1.Interval.is(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))
-            return interval_1.Interval.areIntersecting(a, b);
-        return areIntersectingSI(b, a);
-    }
-    else if (interval_1.Interval.is(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)) {
-        if (interval_1.Interval.is(b))
-            return interval_1.Interval.isSubInterval(a, b);
-        return isSubsetIS(a, b);
-    }
-    else if (interval_1.Interval.is(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))
-            return interval_1.Interval.intersectionSize(a, b);
-        return intersectionSizeSI(b, a);
-    }
-    else if (interval_1.Interval.is(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))
-            return unionII(a, b);
-        return unionSI(b, a);
-    }
-    else if (interval_1.Interval.is(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))
-            return interval_1.Interval.intersect(a, b);
-        return intersectSI(b, a);
-    }
-    else if (interval_1.Interval.is(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))
-            return subtractII(a, b);
-        return subtractIS(a, b);
-    }
-    else if (interval_1.Interval.is(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;
-}
-function isSubsetSI(a, b) {
-    var minB = interval_1.Interval.min(b), maxB = interval_1.Interval.max(b);
-    if (maxB - minB + 1 === 0)
-        return true;
-    var minA = sorted_array_1.SortedArray.min(a), maxA = sorted_array_1.SortedArray.max(a);
-    if (minB < minA || maxB > maxA)
-        return false;
-    var r = sorted_array_1.SortedArray.findRange(a, minB, maxB);
-    return interval_1.Interval.size(r) === interval_1.Interval.size(b);
-}
-function isSubsetIS(a, b) {
-    var minA = interval_1.Interval.min(a), maxA = interval_1.Interval.max(a);
-    if (maxA - minA + 1 === 0)
-        return false;
-    var minB = sorted_array_1.SortedArray.min(b), maxB = sorted_array_1.SortedArray.max(b);
-    return minB >= minA && maxB <= maxA;
-}
-function areRangesIntersecting(a, b) {
-    var sa = size(a), sb = size(b);
-    if (sa === 0 && sb === 0)
-        return true;
-    return sa > 0 && sb > 0 && max(a) >= min(b) && min(a) <= max(b);
-}
-function isRangeSubset(a, b) {
-    if (!size(a))
-        return size(b) === 0;
-    if (!size(b))
-        return true;
-    return min(a) <= min(b) && max(a) >= max(b);
-}
-function unionII(a, b) {
-    if (interval_1.Interval.areEqual(a, b))
-        return a;
-    var sizeA = interval_1.Interval.size(a), sizeB = interval_1.Interval.size(b);
-    if (!sizeB)
-        return a;
-    if (!sizeA)
-        return b;
-    var minA = interval_1.Interval.min(a), minB = interval_1.Interval.min(b);
-    if (areRangesIntersecting(a, b))
-        return interval_1.Interval.ofRange(Math.min(minA, minB), Math.max(interval_1.Interval.max(a), interval_1.Interval.max(b)));
-    var lSize, lMin, rSize, rMin;
-    if (minA < minB) {
-        lSize = sizeA;
-        lMin = minA;
-        rSize = sizeB;
-        rMin = minB;
-    }
-    else {
-        lSize = sizeB;
-        lMin = minB;
-        rSize = sizeA;
-        rMin = minA;
-    }
-    var arr = new Int32Array(sizeA + sizeB);
-    for (var i = 0; i < lSize; i++)
-        arr[i] = i + lMin;
-    for (var i = 0; i < rSize; i++)
-        arr[i + lSize] = i + rMin;
-    return ofSortedArray(arr);
-}
-function unionSI(a, b) {
-    var bSize = interval_1.Interval.size(b);
-    if (!bSize)
-        return a;
-    // is the array fully contained in the range?
-    if (isRangeSubset(b, a))
-        return b;
-    var min = interval_1.Interval.min(b), max = interval_1.Interval.max(b);
-    var r = sorted_array_1.SortedArray.findRange(a, min, max);
-    var start = interval_1.Interval.start(r), end = interval_1.Interval.end(r);
-    var indices = new Int32Array(start + (a.length - end) + bSize);
-    var offset = 0;
-    for (var i = 0; i < start; i++)
-        indices[offset++] = a[i];
-    for (var i = min; i <= max; i++)
-        indices[offset++] = i;
-    for (var i = end, _i = a.length; i < _i; i++)
-        indices[offset++] = a[i];
-    return ofSortedArray(indices);
-}
-function intersectionSizeSI(a, b) {
-    if (!interval_1.Interval.size(b))
-        return 0;
-    var r = sorted_array_1.SortedArray.findRange(a, interval_1.Interval.min(b), interval_1.Interval.max(b));
-    return interval_1.Interval.end(r) - interval_1.Interval.start(r);
-}
-function intersectSI(a, b) {
-    if (!interval_1.Interval.size(b))
-        return exports.Empty;
-    var r = sorted_array_1.SortedArray.findRange(a, interval_1.Interval.min(b), interval_1.Interval.max(b));
-    var start = interval_1.Interval.start(r), end = interval_1.Interval.end(r);
-    var resultSize = end - start;
-    if (!resultSize)
-        return exports.Empty;
-    if (resultSize === a.length)
-        return a;
-    var indices = new Int32Array(resultSize);
-    var offset = 0;
-    for (var i = start; i < end; i++) {
-        indices[offset++] = a[i];
-    }
-    return ofSortedArray(indices);
-}
-function subtractII(a, b) {
-    if (interval_1.Interval.areEqual(a, b))
-        return exports.Empty;
-    if (!interval_1.Interval.areIntersecting(a, b))
-        return a;
-    var minA = interval_1.Interval.min(a), maxA = interval_1.Interval.max(a);
-    var minB = interval_1.Interval.min(b), maxB = interval_1.Interval.max(b);
-    if (maxA < minA || maxB < minB)
-        return a;
-    // is A subset of B? ==> Empty
-    if (interval_1.Interval.isSubInterval(b, a))
-        return exports.Empty;
-    if (interval_1.Interval.isSubInterval(a, b)) {
-        // this splits the interval into two, gotta represent it as a set.
-        var l = minB - minA, r = maxA - maxB;
-        if (l <= 0)
-            return interval_1.Interval.ofRange(maxB + 1, maxB + r);
-        if (r <= 0)
-            return interval_1.Interval.ofRange(minA, minA + l - 1);
-        var ret = new Int32Array(l + r);
-        var offset = 0;
-        for (var i = 0; i < l; i++)
-            ret[offset++] = minA + i;
-        for (var i = 1; i <= r; i++)
-            ret[offset++] = maxB + i;
-        return ofSortedArray(ret);
-    }
-    if (minA < minB)
-        return interval_1.Interval.ofRange(minA, minB - 1);
-    return interval_1.Interval.ofRange(maxB + 1, maxA);
-}
-function subtractSI(a, b) {
-    var min = interval_1.Interval.min(b), max = interval_1.Interval.max(b);
-    // is empty?
-    if (max < min)
-        return a;
-    var r = sorted_array_1.SortedArray.findRange(a, min, max);
-    var start = interval_1.Interval.start(r), end = interval_1.Interval.end(r);
-    var resultSize = a.length - (end - start);
-    // A is subset of B
-    if (resultSize <= 0)
-        return exports.Empty;
-    // No common elements
-    if (resultSize === a.length)
-        return a;
-    var ret = new Int32Array(resultSize);
-    var offset = 0;
-    for (var i = 0; i < start; i++)
-        ret[offset++] = a[i];
-    for (var i = end, _i = a.length; i < _i; i++)
-        ret[offset++] = a[i];
-    return ofSortedArray(ret);
-}
-function subtractIS(a, b) {
-    var min = interval_1.Interval.min(a), max = interval_1.Interval.max(a);
-    // is empty?
-    if (max < min)
-        return a;
-    var rSize = max - min + 1;
-    var interval = sorted_array_1.SortedArray.findRange(b, min, max);
-    var start = interval_1.Interval.start(interval), end = interval_1.Interval.end(interval);
-    var commonCount = end - start;
-    // No common elements.
-    if (commonCount === 0)
-        return a;
-    var resultSize = rSize - commonCount;
-    // A is subset of B
-    if (resultSize <= 0)
-        return exports.Empty;
-    var ret = new Int32Array(resultSize);
-    var li = b.length - 1;
-    var fst = b[Math.min(start, li)], last = b[Math.min(end, li)];
-    var offset = 0;
-    for (var i = min; i < fst; i++)
-        ret[offset++] = i;
-    for (var i = fst; i <= last; i++) {
-        if (sorted_array_1.SortedArray.indexOfInInterval(b, i, interval) < 0)
-            ret[offset++] = i;
-    }
-    for (var i = last + 1; i <= max; i++)
-        ret[offset++] = i;
-    return ofSortedArray(ret);
-}
-function forEach(set, f, ctx) {
-    if (interval_1.Interval.is(set)) {
-        var start_1 = interval_1.Interval.min(set);
-        for (var i = start_1, _i = interval_1.Interval.max(set); i <= _i; i++) {
-            f(i, i - start_1, ctx);
-        }
-    }
-    else {
-        for (var i = 0, _i = set.length; i < _i; i++) {
-            f(set[i], i, ctx);
-        }
-    }
-    return ctx;
-}
-exports.forEach = forEach;
-function forEachSegment(set, segment, f, ctx) {
-    if (interval_1.Interval.is(set)) {
-        var sI = 0;
-        for (var i = interval_1.Interval.min(set), _i = interval_1.Interval.max(set); i <= _i; i++) {
-            var s = segment(i);
-            var endI = i + 1;
-            while (endI < _i && segment(endI) === s)
-                endI++;
-            i = endI - 1;
-            f(s, sI, ctx);
-            sI++;
-        }
-    }
-    else {
-        var sI = 0;
-        for (var i = 0, _i = set.length; i < _i; i++) {
-            var s = segment(set[i]);
-            var endI = i + 1;
-            while (endI < _i && segment(set[endI]) === s)
-                endI++;
-            i = endI - 1;
-            f(s, sI, ctx);
-            sI++;
-        }
-    }
-    return ctx;
-}
-exports.forEachSegment = forEachSegment;
-function indexedIntersect(idxA, a, b) {
-    if (a === b)
-        return idxA;
-    var lenI = size(idxA), lenA = a.length, lenB = b.length;
-    if (lenI === 0 || lenA === 0 || lenB === 0)
-        return exports.Empty;
-    var startJ = sorted_array_1.SortedArray.findPredecessorIndex(b, a[min(idxA)]);
-    var endJ = sorted_array_1.SortedArray.findPredecessorIndex(b, a[max(idxA)] + 1);
-    var commonCount = 0;
-    var offset = 0;
-    var O = 0;
-    var j = startJ;
-    while (O < lenI && j < endJ) {
-        var x = a[getAt(idxA, O)], y = b[j];
-        if (x < y) {
-            O++;
-        }
-        else if (x > y) {
-            j++;
-        }
-        else {
-            commonCount++;
-            O++;
-            j++;
-        }
-    }
-    // no common elements
-    if (commonCount === 0)
-        return exports.Empty;
-    // A === B
-    if (commonCount === lenA && commonCount === lenB)
-        return idxA;
-    var indices = new Int32Array(commonCount);
-    offset = 0;
-    O = 0;
-    j = startJ;
-    while (O < lenI && j < endJ) {
-        var x = a[getAt(idxA, O)], y = b[j];
-        if (x < y) {
-            O++;
-        }
-        else if (x > y) {
-            j++;
-        }
-        else {
-            indices[offset++] = j;
-            O++;
-            j++;
-        }
-    }
-    return ofSortedArray(indices);
-}
-exports.indexedIntersect = indexedIntersect;
-//# sourceMappingURL=ordered-set.js.map

package/lib/commonjs/mol-data/int/impl/segmentation.d.ts

@@ -1,41 +0,0 @@
-/**
- * Copyright (c) 2017 mol* contributors, licensed under MIT, See LICENSE file for more info.
- *
- * @author David Sehnal <david.sehnal@gmail.com>
- */
-import { Iterator } from '../../iterator';
-import { OrderedSet } from '../ordered-set';
-import { Interval } from '../interval';
-import { SortedArray } from '../sorted-array';
-import { Segmentation as Segs } from '../segmentation';
-interface Segmentation {
-    /** Segments stored as a sorted array */
-    offsets: SortedArray;
-    /** Mapping of values to segments */
-    index: Int32Array;
-    /** Number of segments */
-    count: number;
-}
-export declare function create(values: ArrayLike<number>): Segmentation;
-export declare function ofOffsets(offsets: ArrayLike<number>, bounds: Interval): Segmentation;
-/** Get number of segments in a segmentation */
-export declare function count({ count }: Segmentation): number;
-export declare function getSegment({ index }: Segmentation, value: number): number;
-export declare function projectValue({ offsets }: Segmentation, set: OrderedSet, value: number): Interval;
-export declare class SegmentIterator<I extends number = number> implements Iterator<Segs.Segment<I>> {
-    private segments;
-    private segmentMap;
-    private set;
-    private segmentMin;
-    private segmentMax;
-    private setRange;
-    private value;
-    hasNext: boolean;
-    move(): Segs.Segment<I>;
-    private updateValue;
-    private updateSegmentRange;
-    setSegment(segment: Segs.Segment<number>): void;
-    constructor(segments: SortedArray, segmentMap: Int32Array, set: OrderedSet, inputRange: Interval);
-}
-export declare function segments(segs: Segmentation, set: OrderedSet, segment?: Segs.Segment): SegmentIterator<number>;
-export {};