JavaTypedScript
diff --git a/‎lib/node_modules/@stdlib/iter/intersection-by-hash/lib/main.js‎
Lines changed: 0 additions & 19 deletions b/‎lib/node_modules/@stdlib/iter/intersection-by-hash/lib/main.js‎
Lines changed: 0 additions & 19 deletions
@@ -23,7 +23,6 @@
 var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
 var isFunction = require( '@stdlib/assert/is-function' );
 var isIteratorLike = require( '@stdlib/assert/is-iterator-like' );
-var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 var iteratorSymbol = require( '@stdlib/symbol/iterator' );
 var LinkedList = require( '@stdlib/utils/linked-list' );
 
@@ -94,16 +93,6 @@ function intersection( iterators, hashFcn, thisArg ) {
 	while ( true ) {
 		v = it.next();
 		if ( v.done ) {
-			if ( hasOwnProp( v, 'value' ) ) {
-				hv = hashFcn.call( thisArg, v.value );
-
-				// Determine if we have seen this hash before...
-				n = getNode( hash, hv );
-				if ( n === null ) {
-					// First time we have seen this hash, so add to our set of hashes:
-					hash.push( [ hv, v.value, 1 ] );
-				}
-			}
 			break;
 		}
 		hv = hashFcn.call( thisArg, v.value );
@@ -125,14 +114,6 @@ function intersection( iterators, hashFcn, thisArg ) {
 		while ( true ) {
 			v = it.next();
 			if ( v.done ) {
-				if ( hasOwnProp( v, 'value' ) ) {
-					hv = hashFcn.call( thisArg, v.value );
-					n = getNode( hash, hv );
-					if ( n && n.value[ 2 ] === j ) {
-						// Only increment a hash's counter the first time we see the hash per iterator...
-						n.value[ 2 ] += 1;
-					}
-				}
 				break;
 			}
 			hv = hashFcn.call( thisArg, v.value );