From 6abf126c2a7a451cded8c6b5e6ddf1b69c84055d Mon Sep 17 00:00:00 2001
From: Casper Beyer <caspervonb@pm.me>
Date: Tue, 2 Feb 2021 19:05:46 +0800
Subject: chore: remove std directory (#9361)

This removes the std folder from the tree.

Various parts of the tests are pretty tightly dependent
on std (47 direct imports and 75 indirect imports, not
counting the cli tests that use them as fixtures) so I've
added std as a submodule for now.
---
 std/node/tests/node_modules/left-pad/index.js | 52 ---------------------------
 1 file changed, 52 deletions(-)
 delete mode 100644 std/node/tests/node_modules/left-pad/index.js

(limited to 'std/node/tests/node_modules/left-pad/index.js')

diff --git a/std/node/tests/node_modules/left-pad/index.js b/std/node/tests/node_modules/left-pad/index.js
deleted file mode 100644
index 8501bca1b..000000000
--- a/std/node/tests/node_modules/left-pad/index.js
+++ /dev/null
@@ -1,52 +0,0 @@
-/* This program is free software. It comes without any warranty, to
-     * the extent permitted by applicable law. You can redistribute it
-     * and/or modify it under the terms of the Do What The Fuck You Want
-     * To Public License, Version 2, as published by Sam Hocevar. See
-     * http://www.wtfpl.net/ for more details. */
-"use strict";
-module.exports = leftPad;
-
-var cache = [
-  "",
-  " ",
-  "  ",
-  "   ",
-  "    ",
-  "     ",
-  "      ",
-  "       ",
-  "        ",
-  "         "
-];
-
-function leftPad(str, len, ch) {
-  // convert `str` to a `string`
-  str = str + "";
-  // `len` is the `pad`'s length now
-  len = len - str.length;
-  // doesn't need to pad
-  if (len <= 0) return str;
-  // `ch` defaults to `' '`
-  if (!ch && ch !== 0) ch = " ";
-  // convert `ch` to a `string` cuz it could be a number
-  ch = ch + "";
-  // cache common use cases
-  if (ch === " " && len < 10) return cache[len] + str;
-  // `pad` starts with an empty string
-  var pad = "";
-  // loop
-  while (true) {
-    // add `ch` to `pad` if `len` is odd
-    if (len & 1) pad += ch;
-    // divide `len` by 2, ditch the remainder
-    len >>= 1;
-    // "double" the `ch` so this operation count grows logarithmically on `len`
-    // each time `ch` is "doubled", the `len` would need to be "doubled" too
-    // similar to finding a value in binary search tree, hence O(log(n))
-    if (len) ch += ch;
-    // `len` is 0, exit the loop
-    else break;
-  }
-  // pad `str`!
-  return pad + str;
-}
-- 
cgit v1.2.3