motss

/**
 * See {@link http://99-bottles-of-beer.net|99 Bottles of Beer}
 */

function bottles(i) {
  return i === 0 ? 'no more bottles' : `${i} bottle${i > 1 ? 's' : ''}`;
}

function beer(i) {
  const str = bottles(i);

motss

function splitFetch(data, chunk = 50) {
  return Promise.all(Array.from(Array(Math.ceil(data.length / chunk)), (_, i) => {
    return Promise.all(data.slice(i * chunk, (chunk * (i + 1))).map(() => fetch('https://example.com')));
  }));
}

(async () => {
console.time('split');
await splitFetch(Array.from(Array(1e3))).then(console.log).catch(console.error);
console.timeEnd('split');

motss

function main() {
  console.log('a');

  const a = new Promise((resolve) => {
    resolve('b');
    console.log('c');
  }).then(console.log);

  setTimeout(async () => {
    b();

motss

Kill with PID that hogging a TCP port

# lsof -t -i tcp:<PORT_TO_KILL> -s tcp:listen | sudo xargs kill
$ lsof -t -i tcp:80 -s tcp:listen | sudo xargs kill

motss

Usage

// @ts-check

import logger from '<PATH_TO>/logger';

// logger.error(...);
// logger.warn(...);
// logger.debug(...);

motss

Explanation

The basic idea of such implementation is that user can allow to supply either from or to, both or neither.

from	to	R
0	0	v
0	1	v
1	0	v
1	1	v

motss

/**
 *
 * Given an array of integers,
 * return indices of the two numbers such that they add up to a specific target.
 *
 * You may assume that each input would have exactly one solution,
 * and you may not use the same element twice.
 *
 * Example:
 *

motss

// From https://developers.google.com/public-data/docs/canonical/countries_csv

motss

const rdc = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';
const rdi = '1234567890';
const rdl = 'abcdefghijklmnopqrstuvwxyz';

const ipt = '6';
const rd = [
 ...rdi
];

Array.from(Array(ipt.length)).reduce((p, n) => p + rd[Math.floor(Math.random() * rd.length)], '');

motss

// function isANumber(n) {
//   return !Number.isNaN(+n)
//     && /^\-?\d*(\.\d*)?(e(\+|\-)?\d+)?$/i.test(
//       Array.isArray(n) || (typeof n === 'string' && !n.length)
//         ? NaN
//         : n
//     );
// }

/** NOTE: A better version to detect Symbol */