99 lines
2.4 KiB
Markdown
99 lines
2.4 KiB
Markdown
|
---
|
||
|
|
id: 587d8253367417b2b2512c6d
|
||
|
|
title: Perform an Intersection on Two Sets of Data
|
||
|
|
challengeType: 1
|
||
|
|
videoUrl: ''
|
||
|
|
localeTitle: ''
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
undefined
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
undefined
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: ''
|
||
|
|
testString: 'assert(function(){var test = new Set(); return (typeof test.intersection === "function")}, "Your <code>Set</code> class should have a <code>intersection</code> method.");'
|
||
|
|
- text: ''
|
||
|
|
testString: 'assert(function(){ var setA = new Set(); var setB = new Set(); setA.add("a"); setA.add("b"); setA.add("c"); setB.add("c"); setB.add("d"); var intersectionSetAB = setA.intersection(setB); return (intersectionSetAB.size() === 1 && intersectionSetAB.values()[0] === "c")}, "The proper collection was returned");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function Set() {
|
||
|
|
// the var collection will hold the set
|
||
|
|
var collection = [];
|
||
|
|
// this method will check for the presence of an element and return true or false
|
||
|
|
this.has = function(element) {
|
||
|
|
return (collection.indexOf(element) !== -1);
|
||
|
|
};
|
||
|
|
// this method will return all the values in the set
|
||
|
|
this.values = function() {
|
||
|
|
return collection;
|
||
|
|
};
|
||
|
|
// this method will add an element to the set
|
||
|
|
this.add = function(element) {
|
||
|
|
if(!this.has(element)){
|
||
|
|
collection.push(element);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
};
|
||
|
|
// this method will remove an element from a set
|
||
|
|
this.remove = function(element) {
|
||
|
|
if(this.has(element)){
|
||
|
|
var index = collection.indexOf(element);
|
||
|
|
collection.splice(index,1);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
};
|
||
|
|
// this method will return the size of the collection
|
||
|
|
this.size = function() {
|
||
|
|
return collection.length;
|
||
|
|
};
|
||
|
|
// this method will return the union of two sets
|
||
|
|
this.union = function(otherSet) {
|
||
|
|
var unionSet = new Set();
|
||
|
|
var firstSet = this.values();
|
||
|
|
var secondSet = otherSet.values();
|
||
|
|
firstSet.forEach(function(e){
|
||
|
|
unionSet.add(e);
|
||
|
|
});
|
||
|
|
secondSet.forEach(function(e){
|
||
|
|
unionSet.add(e);
|
||
|
|
});
|
||
|
|
return unionSet;
|
||
|
|
};
|
||
|
|
// change code below this line
|
||
|
|
// change code above this line
|
||
|
|
}
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|