Skip to content

Commit 23d7759

Browse files
committed
Fix code style
1 parent 7dadf65 commit 23d7759

File tree

7 files changed

+16
-16
lines changed

7 files changed

+16
-16
lines changed

JavaScript/1-simple.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
'use strict';
22

3-
const pool = item => {
3+
const pool = (item) => {
44
pool.items = pool.items || new Array(10).fill(new Array(1000).fill(0));
55

66
if (item) {

JavaScript/2-drain.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
'use strict';
22

3-
const pool = item => {
3+
const pool = (item) => {
44
pool.items = pool.items || new Array(10).fill(new Array(1000).fill(0));
55

66
if (item) {

JavaScript/3-poolify.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
const poolify = (factory, size) => {
44
const items = new Array(size).fill(null).map(() => factory());
55

6-
return item => {
6+
return (item) => {
77
if (item) {
88
items.push(item);
99
console.log('Recycle item, count =', items.length);

JavaScript/4-improved.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
'use strict';
22

33
const poolify = (factory, min, norm, max) => {
4-
const duplicate = n => new Array(n).fill().map(() => factory());
4+
const duplicate = (n) => new Array(n).fill().map(() => factory());
55
const items = duplicate(norm);
66

7-
return item => {
7+
return (item) => {
88
if (item) {
99
if (items.length < max) {
1010
items.push(item);

JavaScript/5-async.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ const poolify = (factory, min, norm, max) => {
99
const items = duplicate(factory, norm);
1010
const delayed = [];
1111

12-
return par => {
12+
return (par) => {
1313
if (typeof par !== 'function') {
1414
if (items.length < max) {
1515
const request = delayed.shift();
@@ -56,7 +56,7 @@ const pool = poolify(buffer, 3, 5, 7);
5656
let i = 0;
5757

5858
const next = () => {
59-
pool(item => {
59+
pool((item) => {
6060
i++;
6161
if (i < 20) {
6262
setTimeout(next, i * 10);

JavaScript/6-poolify.js

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ const duplicate = (factory, n) => (
1111
})
1212
);
1313

14-
const provide = callback => item => {
14+
const provide = (callback) => (item) => {
1515
setImmediate(() => {
1616
callback(item);
1717
});
@@ -21,7 +21,7 @@ const poolify = (factory, min, norm, max) => {
2121
let allocated = norm;
2222
const items = duplicate(factory, norm);
2323
const delayed = [];
24-
return par => {
24+
return (par) => {
2525
if (par[poolified]) {
2626
const request = delayed.shift();
2727
if (request) request(par);
@@ -43,26 +43,26 @@ const poolify = (factory, min, norm, max) => {
4343

4444
// Usage
4545

46-
const adder = a => b => adder(a + b);
46+
const adder = (a) => (b) => adder(a + b);
4747

4848
const pool = poolify(adder, 1, 2, 3);
4949

5050
console.log('request Item1');
51-
pool(item1 => {
51+
pool((item1) => {
5252
console.log('get Item1');
5353
console.log('request Item2');
54-
pool(item2 => {
54+
pool((item2) => {
5555
console.log('get Item2');
5656
console.log('request Item3');
57-
pool(item3 => {
57+
pool((item3) => {
5858
console.log('get Item3');
5959
setTimeout(() => {
6060
pool(item3);
6161
console.log('recycle Item3');
6262
}, 50);
6363
});
6464
console.log('request Item4');
65-
pool(item4 => {
65+
pool((item4) => {
6666
console.log('get Item4');
6767
setTimeout(() => {
6868
pool(item4);

JavaScript/7-buffer.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
'use strict';
22

33
const poolify = (factory, min, norm, max) => {
4-
const duplicate = n => new Array(n).fill().map(() => factory());
4+
const duplicate = (n) => new Array(n).fill().map(() => factory());
55

6-
const pool = item => {
6+
const pool = (item) => {
77
if (item) {
88
if (pool.allocated <= max) {
99
pool.items.push(item);

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy