assert: optimize partial comparison of two Sets

PR-URL: #55970
Reviewed-By: Michaël Zasso <targos@protonmail.com>
Reviewed-By: Chemi Atlow <chemi@atlow.co.il>
Reviewed-By: Luigi Pinca <luigipinca@gmail.com>

lib/assert.js

@@ -414,33 +414,25 @@ function compareBranch(
   }
 
   // Check for Set object equality
-  // TODO(aduh95): switch to `SetPrototypeIsSubsetOf` when it's available
   if (isSet(actual) && isSet(expected)) {
     if (expected.size > actual.size) {
       return false; // `expected` can't be a subset if it has more elements
     }
 
     if (isDeepEqual === undefined) lazyLoadComparison();
 
-    const actualArray = ArrayFrom(actual);
-    const expectedArray = ArrayFrom(expected);
+    const actualArray = ArrayFrom(FunctionPrototypeCall(SafeSet.prototype[SymbolIterator], actual));
+    const expectedIterator = FunctionPrototypeCall(SafeSet.prototype[SymbolIterator], expected);
     const usedIndices = new SafeSet();
 
-    for (let expectedIdx = 0; expectedIdx < expectedArray.length; expectedIdx++) {
-      const expectedItem = expectedArray[expectedIdx];
-      let found = false;
-
+    expectedIteration: for (const expectedItem of expectedIterator) {
       for (let actualIdx = 0; actualIdx < actualArray.length; actualIdx++) {
         if (!usedIndices.has(actualIdx) && isDeepStrictEqual(actualArray[actualIdx], expectedItem)) {
           usedIndices.add(actualIdx);
-          found = true;
-          break;
+          continue expectedIteration;
         }
       }
-
-      if (!found) {
-        return false;
-      }
+      return false;
     }
 
     return true;