Lines Matching refs:set
122 // Notes: Type tags are historical [[Class]] properties that can be set by
270 // b) The same set of keys/indexes (although not necessarily the same order)
350 memos.val1.set(val1, memos.position);
351 memos.val2.set(val2, memos.position);
361 function setHasEqualElement(set, val1, strict, memo) {
363 for (const val2 of set) {
366 set.delete(val2);
423 let set = null;
429 if (set === null) {
430 set = new SafeSet();
432 // If the specified value doesn't exist in the second set it's a non-null
435 // O(n log n) complexity we have to copy these values in a new set first.
436 set.add(val);
446 if (set === null) {
447 set = new SafeSet();
449 set.add(val);
453 if (set !== null) {
458 if (!setHasEqualElement(set, val, strict, memo))
462 !setHasEqualElement(set, val, strict, memo)) {
466 return set.size === 0;
472 function mapHasEqualEntry(set, map, key1, item1, strict, memo) {
476 for (const key2 of set) {
479 set.delete(key2);
488 let set = null;
492 if (set === null) {
493 set = new SafeSet();
495 set.add(key);
508 if (set === null) {
509 set = new SafeSet();
511 set.add(key);
516 if (set !== null) {
519 if (!mapHasEqualEntry(set, a, key, item, strict, memo))
524 !mapHasEqualEntry(set, a, key, item, false, memo)) {
528 return set.size === 0;