motss

class Node {
    constructor(value) {
        this.prev = null;
        this.next = null;
        this.value = value;
    }
}

class MRU {
  constructor(size) {

motss

By default the memory limit in Node.js is 512MB.

This will cause FATAL ERROR- JS Allocation failed – process out of memory when processing large data files.

It can be avoided by increasing the memory limit.

See Command-line options for more details.

node --max-old-space-size=1024 server.js # increase to 1gb

motss

Config

.editorconfig

# EditorConfig helps developers define and maintain consistent
# coding styles between different editors and IDEs
# http://editorconfig.org

root = true

motss

// a = 1; b = a - 1; b = b - 100; b * a - 100

// split('; ');
// a=1
// b=a-1
// b=b-100
// b*a-100

// a=1
// a 1 =

motss

function tryParseUrl(url) {
  try {
    const u = new URL(url);

    return u;
  } catch (error) {
    console.error(error);
    return '';
  }
}

motss

import { html, LitElement } from 'https://unpkg.com/lit-element@latest/lit-element.js?module';
import { observable, action, autorun, reaction } from 'https://unpkg.com/mobx@latest/lib/mobx.es6.js?module';

const store = observable({
  title: 'Hello, World!',
  count: 0,
  
  incrementCount: action(() => {
    store.count += 1;
  }),

motss

/** See https://bit.ly/2gvCcqe to learn more about UUID v4 for browsers */
function uuidv4() {
  if (window.crypto && window.crypto.getRandomValues) {
    return ([1e7]+-1e3+-4e3+-8e3+-1e11).replace(/[018]/g, c =>
      (c ^ crypto.getRandomValues(new Uint8Array(1))[0] & 15 >> c / 4).toString(16));
  }

  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, (c) => {
    const r = Math.random() * 16 | 0;
    const v = c == 'x' ? r : (r & 0x3 | 0x8);

motss

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

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

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

motss

/** @see microsoft/WSL#1724 (comment) */

if test -t 1; then
  zsh
fi

motss

function findSmallestSum(arr) {
  const len = arr.length;
  
  if (!len) return 0;
  if (len === 1) return arr[0];
  if (len === 2) return arr[0] + arr[1];
  
  // f - first, s - second
  let [f, s] = arr;
  let sum = f + s;