@fluid-experimental/property-changeset 0.59.2000 → 0.59.3000-67119

package/dist/changeset_operations/array.js

@@ -85,7 +85,7 @@ const getRangeForCurrentStateOperation = function (io_operation, in_aOffset, io_
             throw new Error(`getRangeForCurrentStateOperation: ${MSG.UNKNOWN_OPERATION}`);
     }
 };
-const getOpLength = (op) => isNumber_1.default(op[1]) ? op[1] : op[1].length;
+const getOpLength = (op) => (0, isNumber_1.default)(op[1]) ? op[1] : op[1].length;
 /**
  * computes the impact range for a given operation of the applied change set
  * @param in_operation the op
@@ -163,13 +163,13 @@ const getRangeForAppliedOperation = function (in_operation, io_resultingRange, i
  */
 const _splitArrayParameter = function (in_firstResult, in_secondResult, in_data, in_start) {
     let firstTmp;
-    if (isString_1.default(in_data[1])) {
+    if ((0, isString_1.default)(in_data[1])) {
         firstTmp = in_data[1].substr(0, in_start);
         in_secondResult[1] = in_data[1].substr(in_start);
         if (in_firstResult) {
             in_firstResult[1] = firstTmp;
         }
-        if (in_data[2] !== undefined && isString_1.default(in_data[2])) {
+        if (in_data[2] !== undefined && (0, isString_1.default)(in_data[2])) {
             firstTmp = in_data[2].substr(0, in_start);
             in_secondResult[2] = in_data[2].substr(in_start);
             if (in_firstResult) {
@@ -334,7 +334,7 @@ const splitOverlapping = function (io_rangeA, io_rangeB, io_resultingSegment, in
                         operationMetaInfo.currentInsertOffset;
                     rangeLength = operationMetaInfo.rebasedRemoveInsertRanges[i].rangeLength;
                     if (io_rangeA.op.operation[1].length - startOffset >= rangeLength &&
-                        isEqual_1.default(io_rangeA.op.operation[1].slice(startOffset, startOffset + rangeLength), io_rangeB.op.operation[1].slice(rangeStart, rangeStart + rangeLength))) {
+                        (0, isEqual_1.default)(io_rangeA.op.operation[1].slice(startOffset, startOffset + rangeLength), io_rangeB.op.operation[1].slice(rangeStart, rangeStart + rangeLength))) {
                         matchFound = true;
                         // If we have an remove / insert operation in the range A we have to make sure,
                         // the insert happens at the correct position within the remove range after canceling
@@ -357,7 +357,7 @@ const splitOverlapping = function (io_rangeA, io_rangeB, io_resultingSegment, in
         }
         else {
             if (io_rangeA.op.operation[1].length === rangeLength &&
-                isEqual_1.default(io_rangeA.op.operation[1], io_rangeB.op.operation[1])) {
+                (0, isEqual_1.default)(io_rangeA.op.operation[1], io_rangeB.op.operation[1])) {
                 matchFound = true;
             }
         }
@@ -445,7 +445,7 @@ const splitOverlapping = function (io_rangeA, io_rangeB, io_resultingSegment, in
             io_rangeA.end === io_rangeB.begin) {
             if (in_options && in_options.applyAfterMetaInformation) {
                 let length = io_rangeB.op.operation[1];
-                if (!isNumber_1.default(length)) {
+                if (!(0, isNumber_1.default)(length)) {
                     length = length.length;
                 }
                 in_options.applyAfterMetaInformation.set(io_rangeB.op.operation[1], {
@@ -594,7 +594,7 @@ const mergeWithLastIfPossible = function (in_op, io_changeset, in_targetIndex, i
                     }
                 }
                 // merge with last insert
-                if (isString_1.default(in_op.operation[1])) {
+                if ((0, isString_1.default)(in_op.operation[1])) {
                     for (let i = 0; i < in_op.operation[1].length; i++) {
                         lastOp[1] += in_op.operation[1][i];
                     }
@@ -678,7 +678,7 @@ const pushOp = function (in_op, io_changeset, in_indexOffset, in_options, in_las
     }
     switch (in_op.type) {
         case arrayChangesetIterator_1.ArrayChangeSetIterator.types.INSERT: {
-            if (in_options && in_options.applyAfterMetaInformation && !isNumber_1.default(in_op.operation[1])) {
+            if (in_options && in_options.applyAfterMetaInformation && !(0, isNumber_1.default)(in_op.operation[1])) {
                 // If we don't have any meta information yet, we add an entry with the correct offset applied
                 const metaInfo = in_options.applyAfterMetaInformation.get(in_op.operation[1]);
                 if (!metaInfo) {
@@ -747,7 +747,7 @@ const handleCombinations = function (in_segment, in_isPrimitiveType) {
                 case arrayChangesetIterator_1.ArrayChangeSetIterator.types.REMOVE: {
                     // Attention: B removes A completely, kill A to avoid zero inserts
                     let opBLen;
-                    if (isNumber_1.default(opB.operation[1])) {
+                    if ((0, isNumber_1.default)(opB.operation[1])) {
                         opBLen = opB.operation[1];
                     }
                     else {
@@ -908,7 +908,7 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
         if (in_options && in_options.applyAfterMetaInformation) {
             let length;
             const insertEntries = opB.operation[1];
-            if (!isNumber_1.default(insertEntries)) {
+            if (!(0, isNumber_1.default)(insertEntries)) {
                 length = insertEntries.length;
                 in_options.applyAfterMetaInformation.set(insertEntries, {
                     rebasedRemoveInsertRanges: [{
@@ -927,7 +927,7 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
         const conflict = {
             path: in_basePath,
             type: changesetConflictTypes_1.ConflictType.INSERTED_ENTRY_WITH_SAME_KEY,
-            conflictingChange: fastest_json_copy_1.copy(baseOp),
+            conflictingChange: (0, fastest_json_copy_1.copy)(baseOp),
         };
         out_conflicts.push(conflict);
         // move to the right side of the insert
@@ -976,13 +976,13 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
                     // Remove already in A, no need to add the same again -> write nop
                     let opBLen;
                     let opALen;
-                    if (isNumber_1.default(opB.operation[1])) {
+                    if ((0, isNumber_1.default)(opB.operation[1])) {
                         opBLen = opB.operation[1];
                     }
                     else {
                         opBLen = opB.operation[1].length;
                     }
-                    if (isNumber_1.default(opA.operation[1])) {
+                    if ((0, isNumber_1.default)(opA.operation[1])) {
                         opALen = opA.operation[1];
                     }
                     else {
@@ -1005,7 +1005,7 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
                         let conflict = {
                             path: in_basePath,
                             type: changesetConflictTypes_1.ConflictType.ENTRY_MODIFIED_AFTER_REMOVE,
-                            conflictingChange: fastest_json_copy_1.copy(opB),
+                            conflictingChange: (0, fastest_json_copy_1.copy)(opB),
                         };
                         out_conflicts.push(conflict);
                     }
@@ -1027,7 +1027,7 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
                     let conflict = {
                         path: in_basePath,
                         type: changesetConflictTypes_1.ConflictType.COLLIDING_SET,
-                        conflictingChange: fastest_json_copy_1.copy(opB),
+                        conflictingChange: (0, fastest_json_copy_1.copy)(opB),
                     };
                     out_conflicts.push(conflict);
                     // If opB new value is same as opA new value, replace the modify with a NOP
@@ -1051,7 +1051,7 @@ const handleRebaseCombinations = function (in_segment, out_conflicts, in_basePat
                     let conflict = {
                         path: in_basePath,
                         type: changesetConflictTypes_1.ConflictType.REMOVE_AFTER_MODIFY,
-                        conflictingChange: fastest_json_copy_1.copy(opB),
+                        conflictingChange: (0, fastest_json_copy_1.copy)(opB),
                     };
                     out_conflicts.push(conflict);
                 }
@@ -1142,8 +1142,8 @@ var ChangeSetArrayFunctions;
      */
     function _performApplyAfterOnPropertyArray(io_basePropertyChanges, in_appliedPropertyChanges, in_typeid, in_options) {
         property_common_1.ConsoleUtils.assert(in_typeid, "_performApplyAfterOnPropertyArray: typeid missing");
-        property_common_1.ConsoleUtils.assert(!isString_1.default(io_basePropertyChanges), io_basePropertyChanges);
-        property_common_1.ConsoleUtils.assert(!isString_1.default(in_appliedPropertyChanges), in_appliedPropertyChanges);
+        property_common_1.ConsoleUtils.assert(!(0, isString_1.default)(io_basePropertyChanges), io_basePropertyChanges);
+        property_common_1.ConsoleUtils.assert(!(0, isString_1.default)(in_appliedPropertyChanges), in_appliedPropertyChanges);
         const isPrimitiveTypeid = isPrimitiveType(in_typeid);
         // Iterator to process the changes in the ChangeSet in the correct order
         const iteratorA = new arrayChangesetIterator_1.ArrayChangeSetIterator((io_basePropertyChanges));
@@ -1435,13 +1435,13 @@ var ChangeSetArrayFunctions;
      * @param out_conflicts - A list of paths that resulted in conflicts together with the type of the conflict
      */
     function _rebaseChangeSetForString(in_ownPropertyChangeSet, io_rebasePropertyChangeSetParent, in_key, in_basePath, out_conflicts, in_options) {
-        if (isString_1.default(io_rebasePropertyChangeSetParent[in_key]) || (io_rebasePropertyChangeSetParent[in_key] &&
+        if ((0, isString_1.default)(io_rebasePropertyChangeSetParent[in_key]) || (io_rebasePropertyChangeSetParent[in_key] &&
             io_rebasePropertyChangeSetParent[in_key].hasOwnProperty("value"))) {
             // other overwrites any old changes, we ignore them and report the conflict
             let conflict = {
                 path: in_basePath,
                 type: changesetConflictTypes_1.ConflictType.COLLIDING_SET,
-                conflictingChange: fastest_json_copy_1.copy(in_ownPropertyChangeSet),
+                conflictingChange: (0, fastest_json_copy_1.copy)(in_ownPropertyChangeSet),
             };
             out_conflicts.push(conflict);
             // If value is the same, delete the entry
@@ -1457,14 +1457,14 @@ var ChangeSetArrayFunctions;
                 delete io_rebasePropertyChangeSetParent[in_key];
             }
         }
-        else if (isString_1.default(in_ownPropertyChangeSet) || (in_ownPropertyChangeSet &&
+        else if ((0, isString_1.default)(in_ownPropertyChangeSet) || (in_ownPropertyChangeSet &&
             in_ownPropertyChangeSet.hasOwnProperty("value"))) {
             // we have a conflict since we cannot allow insert/remove/modify on an unknown state
             // we just ignore other's modifications and take own's set
             let conflict = {
                 path: in_basePath,
                 type: changesetConflictTypes_1.ConflictType.COLLIDING_SET,
-                conflictingChange: fastest_json_copy_1.copy(io_rebasePropertyChangeSetParent[in_key]),
+                conflictingChange: (0, fastest_json_copy_1.copy)(io_rebasePropertyChangeSetParent[in_key]),
             };
             out_conflicts.push(conflict);
             io_rebasePropertyChangeSetParent[in_key] = in_ownPropertyChangeSet;