forked from mrdavidlaing/javascript-koans
-
Notifications
You must be signed in to change notification settings - Fork 482
Expand file tree
/
Copy pathAboutApplyingWhatWeHaveLearnt.js
More file actions
129 lines (94 loc) · 4.19 KB
/
AboutApplyingWhatWeHaveLearnt.js
File metadata and controls
129 lines (94 loc) · 4.19 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
var _; //globals
describe("About Applying What We Have Learnt", function() {
var products;
beforeEach(function () {
products = [
{ name: "Sonoma", ingredients: ["artichoke", "sundried tomatoes", "mushrooms"], containsNuts: false },
{ name: "Pizza Primavera", ingredients: ["roma", "sundried tomatoes", "goats cheese", "rosemary"], containsNuts: false },
{ name: "South Of The Border", ingredients: ["black beans", "jalapenos", "mushrooms"], containsNuts: false },
{ name: "Blue Moon", ingredients: ["blue cheese", "garlic", "walnuts"], containsNuts: true },
{ name: "Taste Of Athens", ingredients: ["spinach", "kalamata olives", "sesame seeds"], containsNuts: true }
];
});
/*********************************************************************************/
it("given I'm allergic to nuts and hate mushrooms, it should find a pizza I can eat (imperative)", function () {
var i,j,hasMushrooms, productsICanEat = [];
for (i = 0; i < products.length; i+=1) {
if (products[i].containsNuts === false) {
hasMushrooms = false;
for (j = 0; j < products[i].ingredients.length; j+=1) {
if (products[i].ingredients[j] === "mushrooms") {
hasMushrooms = true;
}
}
if (!hasMushrooms) productsICanEat.push(products[i]);
}
}
expect(productsICanEat.length).toBe(1);
});
it("given I'm allergic to nuts and hate mushrooms, it should find a pizza I can eat (functional)", function () {
var productsICanEat = [];
/* solve using filter() & all() / any() */
productsICanEat = _(products).chain()
.filter(function(arr){ return !arr.containsNuts;})
.filter(function(arr){
return _(arr.ingredients).all(function(ingredient){return ingredient !== "mushrooms";});
})
.value();
expect(productsICanEat.length).toBe(1);
});
/*********************************************************************************/
it("should add all the natural numbers below 1000 that are multiples of 3 or 5 (imperative)", function () {
var sum = 0;
for(var i=1; i<1000; i+=1) {
if (i % 3 === 0 || i % 5 === 0) {
sum += i;
}
}
expect(sum).toBe(233168);
});
it("should add all the natural numbers below 1000 that are multiples of 3 or 5 (functional)", function () {
var sum = _(_.range(1,1000)).chain()
.filter(function(number){return !(number%3) || !(number%5);})
.reduce(function(a, b){return a+b;})
.value(); /* try chaining range() and reduce() */
expect(233168).toBe(sum);
});
/*********************************************************************************/
it("should count the ingredient occurrence (imperative)", function () {
var ingredientCount = { "{ingredient name}": 0 };
for (i = 0; i < products.length; i+=1) {
for (j = 0; j < products[i].ingredients.length; j+=1) {
ingredientCount[products[i].ingredients[j]] = (ingredientCount[products[i].ingredients[j]] || 0) + 1;
}
}
expect(ingredientCount['mushrooms']).toBe(2);
});
it("should count the ingredient occurrence (functional)", function () {
var ingredientCount = { "{ingredient name}": 0 };
/* chain() together map(), flatten() and reduce() */
ingredientCount = _(products).chain()
.map(function(arr){return arr.ingredients;})
.flatten()
.reduce(function(count, item){
count[item] = (count[item] || 0) + 1;
return count;
}, {})
.value();
expect(ingredientCount['mushrooms']).toBe(2);
});
/*********************************************************************************/
/* UNCOMMENT FOR EXTRA CREDIT */
/*
it("should find the largest prime factor of a composite number", function () {
});
it("should find the largest palindrome made from the product of two 3 digit numbers", function () {
});
it("should find the smallest number divisible by each of the numbers 1 to 20", function () {
});
it("should find the difference between the sum of the squares and the square of the sums", function () {
});
it("should find the 10001st prime", function () {
});
*/
});