molstar 4.2.0 → 4.4.0

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;

package/lib/commonjs/mol-data/util/hash-functions.js

@@ -6,7 +6,15 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.hashFnv32a = exports.invertCantorPairing = exports.sortedCantorPairing = exports.cantorPairing = exports.hashString = exports.hash4 = exports.hash3 = exports.hash2 = exports.hash1 = void 0;
+exports.hash1 = hash1;
+exports.hash2 = hash2;
+exports.hash3 = hash3;
+exports.hash4 = hash4;
+exports.hashString = hashString;
+exports.cantorPairing = cantorPairing;
+exports.sortedCantorPairing = sortedCantorPairing;
+exports.invertCantorPairing = invertCantorPairing;
+exports.hashFnv32a = hashFnv32a;
 // from http://burtleburtle.net/bob/hash/integer.html
 function hash1(i) {
     let a = i ^ (i >> 4);
@@ -14,7 +22,6 @@ function hash1(i) {
     a = a ^ (a >> 11);
     return a;
 }
-exports.hash1 = hash1;
 function hash2(i, j) {
     let a = 23;
     a = (31 * a + i) | 0;
@@ -24,7 +31,6 @@ function hash2(i, j) {
     a = a ^ (a >> 11);
     return a;
 }
-exports.hash2 = hash2;
 function hash3(i, j, k) {
     let a = 23;
     a = (31 * a + i) | 0;
@@ -35,7 +41,6 @@ function hash3(i, j, k) {
     a = a ^ (a >> 11);
     return a;
 }
-exports.hash3 = hash3;
 function hash4(i, j, k, l) {
     let a = 23;
     a = (31 * a + i) | 0;
@@ -47,7 +52,6 @@ function hash4(i, j, k, l) {
     a = a ^ (a >> 11);
     return a;
 }
-exports.hash4 = hash4;
 function hashString(s) {
     let h = 0;
     for (let i = 0, l = s.length; i < l; i++) {
@@ -55,7 +59,6 @@ function hashString(s) {
     }
     return h;
 }
-exports.hashString = hashString;
 /**
  * A unique number for each pair of integers
  * Biggest representable pair is (67108863, 67108863) (limit imposed by Number.MAX_SAFE_INTEGER)
@@ -63,7 +66,6 @@ exports.hashString = hashString;
 function cantorPairing(a, b) {
     return (a + b) * (a + b + 1) / 2 + b;
 }
-exports.cantorPairing = cantorPairing;
 /**
  * A unique number for each sorted pair of integers
  * Biggest representable pair is (67108863, 67108863) (limit imposed by Number.MAX_SAFE_INTEGER)
@@ -71,7 +73,6 @@ exports.cantorPairing = cantorPairing;
 function sortedCantorPairing(a, b) {
     return a < b ? cantorPairing(a, b) : cantorPairing(b, a);
 }
-exports.sortedCantorPairing = sortedCantorPairing;
 function invertCantorPairing(out, z) {
     const w = Math.floor((Math.sqrt(8 * z + 1) - 1) / 2);
     const t = (w * w + w) / 2;
@@ -80,7 +81,6 @@ function invertCantorPairing(out, z) {
     out[1] = y;
     return out;
 }
-exports.invertCantorPairing = invertCantorPairing;
 /**
  * 32 bit FNV-1a hash, see http://isthe.com/chongo/tech/comp/fnv/
  */
@@ -92,4 +92,3 @@ function hashFnv32a(array) {
     }
     return hval >>> 0;
 }
-exports.hashFnv32a = hashFnv32a;

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

@@ -5,17 +5,19 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.sort = exports.sortArrayRange = exports.sortArray = exports.arraySwap = exports.arrayLess = void 0;
+exports.arrayLess = arrayLess;
+exports.arraySwap = arraySwap;
+exports.sortArray = sortArray;
+exports.sortArrayRange = sortArrayRange;
+exports.sort = sort;
 function arrayLess(arr, i, j) {
     return arr[i] - arr[j];
 }
-exports.arrayLess = arrayLess;
 function arraySwap(arr, i, j) {
     const temp = arr[i];
     arr[i] = arr[j];
     arr[j] = temp;
 }
-exports.arraySwap = arraySwap;
 function medianPivotIndex(data, cmp, l, r) {
     const m = (l + r) >> 1;
     if (cmp(data, l, r) > 0)
@@ -143,7 +145,6 @@ function quickSortArrayAsc(data, parts, low, high) {
 function sortArray(data, cmp = arrayLess) {
     return sortArrayRange(data, 0, data.length, cmp);
 }
-exports.sortArray = sortArray;
 function sortArrayRange(data, start, end, cmp = arrayLess) {
     if (cmp === arrayLess)
         quickSortArrayAsc(data, [0, 0], start, end - 1);
@@ -151,10 +152,8 @@ function sortArrayRange(data, start, end, cmp = arrayLess) {
         quickSort({ data, cmp, swap: arraySwap, parts: [0, 0] }, start, end - 1);
     return data;
 }
-exports.sortArrayRange = sortArrayRange;
 function sort(data, start, end, cmp, swap) {
     const ctx = { data, cmp, swap, parts: [0, 0] };
     quickSort(ctx, start, end - 1);
     return data;
 }
-exports.sort = sort;

package/lib/commonjs/mol-geo/geometry/base.d.ts

@@ -24,7 +24,7 @@ export declare const VisualQualityInfo: {
     lowest: {};
 };
 export type VisualQuality = keyof typeof VisualQualityInfo;
-export declare const VisualQualityNames: ("auto" | "medium" | "high" | "low" | "custom" | "highest" | "higher" | "lower" | "lowest")[];
+export declare const VisualQualityNames: VisualQuality[];
 export declare const VisualQualityOptions: ["auto" | "medium" | "high" | "low" | "custom" | "highest" | "higher" | "lower" | "lowest", string][];
 export declare const ColorSmoothingParams: {
     smoothColors: PD.Mapped<PD.NamedParams<PD.Normalize<unknown>, "auto"> | PD.NamedParams<PD.Normalize<{

package/lib/commonjs/mol-geo/geometry/base.js

@@ -5,7 +5,9 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.BaseGeometry = exports.getColorSmoothingProps = exports.hasColorSmoothingProp = exports.ColorSmoothingParams = exports.VisualQualityOptions = exports.VisualQualityNames = exports.VisualQualityInfo = void 0;
+exports.BaseGeometry = exports.ColorSmoothingParams = exports.VisualQualityOptions = exports.VisualQualityNames = exports.VisualQualityInfo = void 0;
+exports.hasColorSmoothingProp = hasColorSmoothingProp;
+exports.getColorSmoothingProps = getColorSmoothingProps;
 const mol_util_1 = require("../../mol-util");
 const location_iterator_1 = require("../util/location-iterator");
 const param_definition_1 = require("../../mol-util/param-definition");
@@ -46,7 +48,6 @@ exports.ColorSmoothingParams = {
 function hasColorSmoothingProp(props) {
     return !!props.smoothColors;
 }
-exports.hasColorSmoothingProp = hasColorSmoothingProp;
 function getColorSmoothingProps(smoothColors, preferSmoothing, resolution) {
     if ((smoothColors.name === 'on' || (smoothColors.name === 'auto' && preferSmoothing)) && resolution && resolution < 3) {
         let stride = 3;
@@ -65,7 +66,6 @@ function getColorSmoothingProps(smoothColors, preferSmoothing, resolution) {
     }
     ;
 }
-exports.getColorSmoothingProps = getColorSmoothingProps;
 //
 var BaseGeometry;
 (function (BaseGeometry) {

package/lib/commonjs/mol-geo/geometry/clipping-data.js

@@ -5,7 +5,10 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.createEmptyClipping = exports.createClipping = exports.clearClipping = exports.applyClippingGroups = void 0;
+exports.applyClippingGroups = applyClippingGroups;
+exports.clearClipping = clearClipping;
+exports.createClipping = createClipping;
+exports.createEmptyClipping = createEmptyClipping;
 const value_cell_1 = require("../../mol-util/value-cell");
 const linear_algebra_1 = require("../../mol-math/linear-algebra");
 const util_1 = require("../../mol-gl/renderable/util");
@@ -13,11 +16,9 @@ function applyClippingGroups(array, start, end, groups) {
     array.fill(groups, start, end);
     return true;
 }
-exports.applyClippingGroups = applyClippingGroups;
 function clearClipping(array, start, end) {
     array.fill(0, start, end);
 }
-exports.clearClipping = clearClipping;
 function createClipping(count, type, clippingData) {
     const clipping = (0, util_1.createTextureImage)(Math.max(1, count), 1, Uint8Array, clippingData && clippingData.tClipping.ref.value.array);
     if (clippingData) {
@@ -36,7 +37,6 @@ function createClipping(count, type, clippingData) {
         };
     }
 }
-exports.createClipping = createClipping;
 const emptyClippingTexture = { array: new Uint8Array(1), width: 1, height: 1 };
 function createEmptyClipping(clippingData) {
     if (clippingData) {
@@ -54,4 +54,3 @@ function createEmptyClipping(clippingData) {
         };
     }
 }
-exports.createEmptyClipping = createEmptyClipping;

package/lib/commonjs/mol-geo/geometry/color-data.js

@@ -7,7 +7,10 @@
  * @author Gianluca Tomasello <giagitom@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.createGridColor = exports.createTextureColor = exports.createValueColor = exports.createColors = void 0;
+exports.createColors = createColors;
+exports.createValueColor = createValueColor;
+exports.createTextureColor = createTextureColor;
+exports.createGridColor = createGridColor;
 const mol_util_1 = require("../../mol-util");
 const util_1 = require("../../mol-gl/renderable/util");
 const color_1 = require("../../mol-util/color");
@@ -25,7 +28,6 @@ function createColors(locationIt, positionIt, colorTheme, colorData) {
     }
     return data;
 }
-exports.createColors = createColors;
 function _createColors(locationIt, positionIt, colorTheme, colorData) {
     switch (colorTheme.granularity) {
         case 'uniform': return createUniformColor(locationIt, colorTheme.color, colorData);
@@ -92,7 +94,6 @@ function createValueColor(value, colorData) {
         };
     }
 }
-exports.createValueColor = createValueColor;
 /** Creates color uniform */
 function createUniformColor(locationIt, color, colorData) {
     return createValueColor(color(location_1.NullLocation, false), colorData);
@@ -119,7 +120,6 @@ function createTextureColor(colors, type, colorData) {
         };
     }
 }
-exports.createTextureColor = createTextureColor;
 /** Creates color texture with color for each instance */
 function createInstanceColor(locationIt, color, colorData) {
     const { instanceCount } = locationIt;
@@ -218,7 +218,6 @@ function createGridColor(grid, type, colorData) {
         };
     }
 }
-exports.createGridColor = createGridColor;
 //
 /** Creates direct color */
 function createDirectColor(colorData) {

package/lib/commonjs/mol-geo/geometry/cylinders/cylinders.d.ts

@@ -50,6 +50,7 @@ export declare namespace Cylinders {
         sizeAspectRatio: PD.Numeric;
         doubleSided: PD.BooleanParam;
         ignoreLight: PD.BooleanParam;
+        celShaded: PD.BooleanParam;
         xrayShaded: PD.Select<boolean | "inverted">;
         transparentBackfaces: PD.Select<"on" | "off" | "opaque">;
         solidInterior: PD.BooleanParam;

package/lib/commonjs/mol-geo/geometry/cylinders/cylinders.js

@@ -120,6 +120,7 @@ var Cylinders;
         sizeAspectRatio: param_definition_1.ParamDefinition.Numeric(1, { min: 0, max: 3, step: 0.01 }),
         doubleSided: param_definition_1.ParamDefinition.Boolean(false, base_1.BaseGeometry.CustomQualityParamInfo),
         ignoreLight: param_definition_1.ParamDefinition.Boolean(false, base_1.BaseGeometry.ShadingCategory),
+        celShaded: param_definition_1.ParamDefinition.Boolean(false, base_1.BaseGeometry.ShadingCategory),
         xrayShaded: param_definition_1.ParamDefinition.Select(false, [[false, 'Off'], [true, 'On'], ['inverted', 'Inverted']], base_1.BaseGeometry.ShadingCategory),
         transparentBackfaces: param_definition_1.ParamDefinition.Select('off', param_definition_1.ParamDefinition.arrayToOptions(['off', 'on', 'opaque']), base_1.BaseGeometry.ShadingCategory),
         solidInterior: param_definition_1.ParamDefinition.Boolean(true, base_1.BaseGeometry.ShadingCategory),
@@ -202,6 +203,7 @@ var Cylinders;
             uSizeFactor: mol_util_1.ValueCell.create(props.sizeFactor * props.sizeAspectRatio),
             uDoubleSided: mol_util_1.ValueCell.create(props.doubleSided),
             dIgnoreLight: mol_util_1.ValueCell.create(props.ignoreLight),
+            dCelShaded: mol_util_1.ValueCell.create(props.celShaded),
             dXrayShaded: mol_util_1.ValueCell.create(props.xrayShaded === 'inverted' ? 'inverted' : props.xrayShaded === true ? 'on' : 'off'),
             dTransparentBackfaces: mol_util_1.ValueCell.create(props.transparentBackfaces),
             dSolidInterior: mol_util_1.ValueCell.create(props.solidInterior),
@@ -220,6 +222,7 @@ var Cylinders;
         mol_util_1.ValueCell.updateIfChanged(values.uSizeFactor, props.sizeFactor * props.sizeAspectRatio);
         mol_util_1.ValueCell.updateIfChanged(values.uDoubleSided, props.doubleSided);
         mol_util_1.ValueCell.updateIfChanged(values.dIgnoreLight, props.ignoreLight);
+        mol_util_1.ValueCell.updateIfChanged(values.dCelShaded, props.celShaded);
         mol_util_1.ValueCell.updateIfChanged(values.dXrayShaded, props.xrayShaded === 'inverted' ? 'inverted' : props.xrayShaded === true ? 'on' : 'off');
         mol_util_1.ValueCell.updateIfChanged(values.dTransparentBackfaces, props.transparentBackfaces);
         mol_util_1.ValueCell.updateIfChanged(values.dSolidInterior, props.solidInterior);

package/lib/commonjs/mol-geo/geometry/direct-volume/direct-volume.d.ts

@@ -34,6 +34,7 @@ export declare namespace DirectVolume {
     function createEmpty(directVolume?: DirectVolume): DirectVolume;
     const Params: {
         ignoreLight: PD.BooleanParam;
+        celShaded: PD.BooleanParam;
         xrayShaded: PD.Select<boolean | "inverted">;
         controlPoints: PD.LineGraph;
         stepsPerCell: PD.Numeric;