Skip to content

Commit 0f1455d

Browse files
iliakaniliakan
committed
2 parents 973810d + b67884c commit 0f1455d

34 files changed

Lines changed: 132 additions & 132 deletions

File tree

‎1-js/01-getting-started/1-intro/article.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -108,7 +108,7 @@ Modern tools make the transpilation very fast and transparent, actually allowing
108108

109109
Examples of such languages:
110110

111-
- [CoffeeScript](http://coffeescript.org/) is a "syntax sugar" for JavaScript, it introduces shorter syntax, allowing to write more precise and clear code. Usually Ruby devs like it.
111+
- [CoffeeScript](http://coffeescript.org/) is a "syntactic sugar" for JavaScript, it introduces shorter syntax, allowing to write more precise and clear code. Usually Ruby devs like it.
112112
- [TypeScript](http://www.typescriptlang.org/) is concentrated on adding "strict data typing", to simplify development and support of complex systems. It is developed by Microsoft.
113113
- [Dart](https://www.dartlang.org/) is a standalone language that has its own engine that runs in non-browser environments (like mobile apps). It was initially offered by Google as a replacement for JavaScript, but as of now, browsers require it to be transpiled to JavaScript just like the ones above.
114114

‎1-js/05-data-types/05-array-methods/10-average-age/solution.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,9 +3,9 @@ function getAverageAge(users) {
33
return users.reduce((prev, user) => prev + user.age, 0) / users.length;
44
}
55

6-
let john = { name: "John", age: 25 }
7-
let pete = { name: "Pete", age: 30 }
8-
let mary = { name: "Mary", age: 29 }
6+
let john = { name: "John", age: 25 };
7+
let pete = { name: "Pete", age: 30 };
8+
let mary = { name: "Mary", age: 29 };
99

1010
let arr = [ john, pete, mary ];
1111

‎1-js/05-data-types/05-array-methods/10-average-age/task.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -11,12 +11,12 @@ The formula for the average is `(age1 + age2 + ... + ageN) / N`.
1111
For instance:
1212

1313
```js no-beautify
14-
let john = { name: "John", age: 25 }
15-
let pete = { name: "Pete", age: 30 }
16-
let mary = { name: "Mary", age: 29 }
14+
let john = { name: "John", age: 25 };
15+
let pete = { name: "Pete", age: 30 };
16+
let mary = { name: "Mary", age: 29 };
1717

1818
let arr = [ john, pete, mary ];
1919

20-
alert( getAverageAge(arr) ); // (25+30+29)/3 = 28
20+
alert( getAverageAge(arr) ); // (25 + 30 + 29) / 3 = 28
2121
```
2222

‎1-js/05-data-types/05-array-methods/2-filter-range/task.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ importance: 4
22

33
---
44

5-
# Filter "in place"
5+
# Filter range
66

77
Write a function `filterRange(arr, a, b)` that gets an array `arr`, looks for elements between `a` and `b` in it and returns an array of them.
88

‎1-js/05-data-types/05-array-methods/4-sort-back/solution.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
```js run
44
let arr = [5, 2, 1, -10, 8];
55

6-
arr.sort((a,b) => b - a);
6+
arr.sort((a, b) => b - a);
77

88
alert( arr );
99
```

‎1-js/05-data-types/05-array-methods/7-map-objects/solution.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -21,8 +21,8 @@ usersMapped = [
2121
]
2222
*/
2323

24-
alert( usersMapped[0].id ) // 1
25-
alert( usersMapped[0].fullName ) // John Smith
24+
alert( usersMapped[0].id ); // 1
25+
alert( usersMapped[0].fullName ); // John Smith
2626
```
2727

2828
Please note that in for the arrow functions we need to use additional brackets.

‎1-js/05-data-types/05-array-methods/8-sort-objects/solution.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,6 +12,6 @@ let arr = [ john, pete, mary ];
1212
sortByName(arr);
1313

1414
// now sorted is: [john, mary, pete]
15-
alert(arr[1].name) // Mary
15+
alert(arr[1].name); // Mary
1616
```
1717

‎1-js/05-data-types/05-array-methods/8-sort-objects/task.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -9,15 +9,15 @@ Write the function `sortByName(users)` that gets an array of objects with proper
99
For instance:
1010

1111
```js no-beautify
12-
let john = { name: "John", age: 25 }
13-
let pete = { name: "Pete", age: 30 }
14-
let mary = { name: "Mary", age: 28 }
12+
let john = { name: "John", age: 25 };
13+
let pete = { name: "Pete", age: 30 };
14+
let mary = { name: "Mary", age: 28 };
1515

1616
let arr = [ john, pete, mary ];
1717

1818
sortByName(arr);
1919

2020
// now: [john, mary, pete]
21-
alert(arr[1].name) // Mary
21+
alert(arr[1].name); // Mary
2222
```
2323

‎1-js/05-data-types/05-array-methods/9-shuffle/solution.md‎

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ shuffle(arr);
1212
alert(arr);
1313
```
1414

15-
That somewhat works, because `Math.random()-0.5` is a random number that may be positive or negative, so the sorting function reorders elements randomly.
15+
That somewhat works, because `Math.random() - 0.5` is a random number that may be positive or negative, so the sorting function reorders elements randomly.
1616

1717
But because the sorting function is not meant to be used this way, not all permutations have the same probability.
1818

@@ -33,14 +33,14 @@ let count = {
3333
'312': 0
3434
};
3535

36-
for(let i = 0; i < 1000000; i++) {
36+
for (let i = 0; i < 1000000; i++) {
3737
let array = [1, 2, 3];
3838
shuffle(array);
3939
count[array.join('')]++;
4040
}
4141

4242
// show counts of all possible permutations
43-
for(let key in count) {
43+
for (let key in count) {
4444
alert(`${key}: ${count[key]}`);
4545
}
4646
```
@@ -66,8 +66,8 @@ There are other good ways to do the task. For instance, there's a great algorith
6666

6767
```js
6868
function shuffle(array) {
69-
for(let i = array.length - 1; i > 0; i--) {
70-
let j = Math.floor(Math.random() * (i+1)); // random index from 0 to i
69+
for (let i = array.length - 1; i > 0; i--) {
70+
let j = Math.floor(Math.random() * (i + 1)); // random index from 0 to i
7171
[array[i], array[j]] = [array[j], array[i]]; // swap elements
7272
}
7373
}
@@ -77,8 +77,8 @@ Let's test it the same way:
7777

7878
```js run
7979
function shuffle(array) {
80-
for(let i = array.length - 1; i > 0; i--) {
81-
let j = Math.floor(Math.random() * (i+1));
80+
for (let i = array.length - 1; i > 0; i--) {
81+
let j = Math.floor(Math.random() * (i + 1));
8282
[array[i], array[j]] = [array[j], array[i]];
8383
}
8484
}
@@ -93,14 +93,14 @@ let count = {
9393
'312': 0
9494
};
9595

96-
for(let i = 0; i < 1000000; i++) {
96+
for (let i = 0; i < 1000000; i++) {
9797
let array = [1, 2, 3];
9898
shuffle(array);
9999
count[array.join('')]++;
100100
}
101101

102102
// show counts of all possible permutations
103-
for(let key in count) {
103+
for (let key in count) {
104104
alert(`${key}: ${count[key]}`);
105105
}
106106
```

‎1-js/05-data-types/06-iterable/article.md‎

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -121,7 +121,7 @@ Arrays and strings are most widely used built-in iterables.
121121
For a string, `for..of` loops over its characters:
122122

123123
```js run
124-
for(let char of "test") {
124+
for (let char of "test") {
125125
alert( char ); // t, then e, then s, then t
126126
}
127127
```
@@ -130,16 +130,16 @@ And it works right with surrogate pairs!
130130

131131
```js run
132132
let str = '𝒳😂';
133-
for(let char of str) {
134-
alert(char); // 𝒳, and then 😂
133+
for (let char of str) {
134+
alert( char ); // 𝒳, and then 😂
135135
}
136136
```
137137

138138
## Calling an iterator explicitly
139139

140140
Normally, internals of iterables are hidden from the external code. There's a `for..of` loop, that works, that's all it needs to know.
141141

142-
But to understand things a little bit more deeper let's see how to create an iterator explicitly.
142+
But to understand things a little bit deeper let's see how to create an iterator explicitly.
143143

144144
We'll iterate over a string the same way as `for..of`, but with direct calls. This code gets a string iterator and calls it "manually":
145145

@@ -151,7 +151,7 @@ let str = "Hello";
151151

152152
let iterator = str[Symbol.iterator]();
153153

154-
while(true) {
154+
while (true) {
155155
let result = iterator.next();
156156
if (result.done) break;
157157
alert(result.value); // outputs characters one by one
@@ -184,7 +184,7 @@ let arrayLike = { // has indexes and length => array-like
184184

185185
*!*
186186
// Error (no Symbol.iterator)
187-
for(let item of arrayLike) {}
187+
for (let item of arrayLike) {}
188188
*/!*
189189
```
190190

@@ -258,7 +258,7 @@ Technically here it does the same as:
258258
let str = '𝒳😂';
259259

260260
let chars = []; // Array.from internally does the same loop
261-
for(let char of str) {
261+
for (let char of str) {
262262
chars.push(char);
263263
}
264264

0 commit comments

Comments
 (0)