Temporarily obfuscate comments

Author: jgonggrijp

modules/_flatten.js

@@ -3,7 +3,7 @@ import isArrayLike from './_isArrayLike.js';
 import isArray from './isArray.js';
 import isArguments from './isArguments.js';
 
-// Internal implementation of a `flatten` function.
+// Internal implementation of a recursive `flatten` function.
 export default function flatten(input, depth, strict) {
   if (!depth && depth !== 0) depth = Infinity;
   var output = [], idx = 0, i = 0, length = getLength(input) || 0, stack = [];

modules/isEqual.js

@@ -14,17 +14,12 @@ var tagDataView = '[object DataView]';
 
 // Perform a deep comparison to check if two objects are equal.
 export default function isEqual(a, b) {
-  // Keep track of which pairs of values need to be compared. We will be
-  // trampolining on this stack instead of using function recursion.
   var todo = [{a: a, b: b}];
   // Initializing stacks of traversed objects for cycle detection.
   var aStack = [], bStack = [];
 
-  // Keep traversing pairs until there is nothing left to compare.
   while (todo.length) {
     var frame = todo.pop();
-    // As a special case, a single `true` on the todo means that we can
-    // unwind the cycle detection stacks.
     if (frame === true) {
       // Remove the first object from the stack of traversed objects.
       aStack.pop();
@@ -51,6 +46,7 @@ export default function isEqual(a, b) {
     var type = typeof a;
     if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
 
+// Internal recursive comparison function for `_.isEqual`.
     // Unwrap any wrapped objects.
     if (a instanceof _) a = a._wrapped;
     if (b instanceof _) b = b._wrapped;
@@ -119,19 +115,15 @@ export default function isEqual(a, b) {
       // Linear search. Performance is inversely proportional to the number of
       // unique nested structures.
       if (aStack[length] === a) {
-        // Cycle detected. Break out of the inner loop and continue the outer
-        // loop. Step 1:
         if (bStack[length] === b) break;
         return false;
       }
     }
-    // Step 2, use `length` to verify whether we detected a cycle:
     if (length >= 0) continue;
 
     // Add the first object to the stack of traversed objects.
     aStack.push(a);
     bStack.push(b);
-    // Remember to remove them again after the recursion below.
     todo.push(true);
 
     // Recursively compare objects and arrays.
@@ -157,6 +149,5 @@ export default function isEqual(a, b) {
       }
     }
   }
-  // We made it to the end and found no differences.
   return true;
 }

underscore-esm.js

@@ -352,17 +352,12 @@ var tagDataView = '[object DataView]';
 
 // Perform a deep comparison to check if two objects are equal.
 function isEqual(a, b) {
-  // Keep track of which pairs of values need to be compared. We will be
-  // trampolining on this stack instead of using function recursion.
   var todo = [{a: a, b: b}];
   // Initializing stacks of traversed objects for cycle detection.
   var aStack = [], bStack = [];
 
-  // Keep traversing pairs until there is nothing left to compare.
   while (todo.length) {
     var frame = todo.pop();
-    // As a special case, a single `true` on the todo means that we can
-    // unwind the cycle detection stacks.
     if (frame === true) {
       // Remove the first object from the stack of traversed objects.
       aStack.pop();
@@ -389,6 +384,7 @@ function isEqual(a, b) {
     var type = typeof a;
     if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
 
+// Internal recursive comparison function for `_.isEqual`.
     // Unwrap any wrapped objects.
     if (a instanceof _$1) a = a._wrapped;
     if (b instanceof _$1) b = b._wrapped;
@@ -457,19 +453,15 @@ function isEqual(a, b) {
       // Linear search. Performance is inversely proportional to the number of
       // unique nested structures.
       if (aStack[length] === a) {
-        // Cycle detected. Break out of the inner loop and continue the outer
-        // loop. Step 1:
         if (bStack[length] === b) break;
         return false;
       }
     }
-    // Step 2, use `length` to verify whether we detected a cycle:
     if (length >= 0) continue;
 
     // Add the first object to the stack of traversed objects.
     aStack.push(a);
     bStack.push(b);
-    // Remember to remove them again after the recursion below.
     todo.push(true);
 
     // Recursively compare objects and arrays.
@@ -495,7 +487,6 @@ function isEqual(a, b) {
       }
     }
   }
-  // We made it to the end and found no differences.
   return true;
 }
 
@@ -1048,7 +1039,7 @@ var bind = restArguments(function(func, context, args) {
 // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
 var isArrayLike = createSizePropertyCheck(getLength);
 
-// Internal implementation of a `flatten` function.
+// Internal implementation of a recursive `flatten` function.
 function flatten$1(input, depth, strict) {
   if (!depth && depth !== 0) depth = Infinity;
   var output = [], idx = 0, i = 0, length = getLength(input) || 0, stack = [];