rem: result[k] = second[k]; 
add: result[k] = first[k]; 
context: 	merge: function(first, second) {		var result = [];				// Move b over to the new array (this helps to avoid		// StaticNodeList instances)		for ( var k = 0; k < first.length; k++ )			result[k] = second[k];			// Now check for duplicates between a and b and only		// add the unique items		for ( var i = 0; i < second.length; i++ ) {			var noCollision = true;						// The collision-checking process			for ( var j = 0; j < first.length; j++ )				if ( second[i] == first[j] )					noCollision = false;							// If the item is unique, add it			if ( noCollision )				result.push( second[i] );		}			return result;	},
meta: 3217	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/3217/8a1adfcd2a0ea8fbb72ac53537cbfe6ebeba0cdf/jquery.js/clean/src/jquery/jquery.js