@thi.ng/pointfree 3.1.54 → 3.1.55

package/stack.js

@@ -2,363 +2,187 @@ import { $, $n } from "./safe.js";
 const __xsp = (id) => (ctx) => (ctx[0].push(ctx[id].length), ctx);
 const __dup = (id) => __copy(id, id);
 const __dup2 = (id) => (ctx) => {
-    const stack = ctx[id];
-    let n = stack.length - 2;
-    $n(n, 0);
-    stack.push(stack[n], stack[n + 1]);
-    return ctx;
+  const stack = ctx[id];
+  let n = stack.length - 2;
+  $n(n, 0);
+  stack.push(stack[n], stack[n + 1]);
+  return ctx;
 };
 const __dup3 = (id) => (ctx) => {
-    const stack = ctx[id];
-    let n = stack.length - 3;
-    $n(n, 0);
-    stack.push(stack[n], stack[n + 1], stack[n + 2]);
-    return ctx;
+  const stack = ctx[id];
+  let n = stack.length - 3;
+  $n(n, 0);
+  stack.push(stack[n], stack[n + 1], stack[n + 2]);
+  return ctx;
 };
-const __drop = (id, n = 1) => (ctx) => ($(ctx[id], 1), (ctx[id].length -= n), ctx);
+const __drop = (id, n = 1) => (ctx) => ($(ctx[id], 1), ctx[id].length -= n, ctx);
 const __swap = (i) => (ctx) => {
-    const stack = ctx[i];
-    const n = stack.length - 2;
-    $n(n, 0);
-    const a = stack[n];
-    stack[n] = stack[n + 1];
-    stack[n + 1] = a;
-    return ctx;
+  const stack = ctx[i];
+  const n = stack.length - 2;
+  $n(n, 0);
+  const a = stack[n];
+  stack[n] = stack[n + 1];
+  stack[n + 1] = a;
+  return ctx;
 };
 const __swap2 = (i) => (ctx) => {
-    const stack = ctx[i];
-    let n = stack.length - 1;
-    $n(n, 3);
-    let a = stack[n];
-    stack[n] = stack[n - 2];
-    stack[n - 2] = a;
-    n--;
-    a = stack[n];
-    stack[n] = stack[n - 2];
-    stack[n - 2] = a;
-    return ctx;
+  const stack = ctx[i];
+  let n = stack.length - 1;
+  $n(n, 3);
+  let a = stack[n];
+  stack[n] = stack[n - 2];
+  stack[n - 2] = a;
+  n--;
+  a = stack[n];
+  stack[n] = stack[n - 2];
+  stack[n - 2] = a;
+  return ctx;
 };
 const __over = (id) => (ctx) => {
-    const stack = ctx[id];
-    const n = stack.length - 2;
-    $n(n, 0);
-    stack.push(stack[n]);
-    return ctx;
+  const stack = ctx[id];
+  const n = stack.length - 2;
+  $n(n, 0);
+  stack.push(stack[n]);
+  return ctx;
 };
 const __move = (src, dest) => (ctx) => ($(ctx[src], 1), ctx[dest].push(ctx[src].pop()), ctx);
 const __move2 = (a, b) => (ctx) => {
-    const src = ctx[a];
-    $(src, 2);
-    const v = src.pop();
-    ctx[b].push(src.pop(), v);
-    return ctx;
+  const src = ctx[a];
+  $(src, 2);
+  const v = src.pop();
+  ctx[b].push(src.pop(), v);
+  return ctx;
 };
 const __copy = (src, dest) => (ctx) => ($(ctx[src], 1), ctx[dest].push(tos(ctx[src])), ctx);
 const __copy2 = (a, b) => (ctx) => {
-    const src = ctx[a];
-    const n = src.length - 2;
-    $n(n, 0);
-    ctx[b].push(src[n], src[n + 1]);
-    return ctx;
+  const src = ctx[a];
+  const n = src.length - 2;
+  $n(n, 0);
+  ctx[b].push(src[n], src[n + 1]);
+  return ctx;
 };
-const __incdec = (id, n) => (ctx) => ($(ctx[id], 1), (ctx[id][ctx[id].length - 1] += n), ctx);
-//////////////////// Stack manipulation words ////////////////////
-/**
- * Returns top of stack value (always unsafe, no underflow checking).
- *
- * @param stack -
- */
-export const tos = (stack) => stack[stack.length - 1];
-/**
- * Utility word w/ no stack nor side effect.
- */
-export const nop = (ctx) => ctx;
-/**
- * Pushes current d-stack size on d-stack.
- *
- * ( -- n )
- * @param ctx -
- */
-export const dsp = __xsp(0);
-/**
- * Uses TOS as index to look up a deeper d-stack value, then places it
- * as new TOS. Throws error if stack depth is < `x`.
- *
- * ( ... x -- ... stack[x] )
- *
- * @param ctx -
- */
-export const pick = (ctx) => {
-    const stack = ctx[0];
-    let n = stack.length - 1;
-    $n(n, 0);
-    $n((n -= stack.pop() + 1), 0);
-    stack.push(stack[n]);
-    return ctx;
+const __incdec = (id, n) => (ctx) => ($(ctx[id], 1), ctx[id][ctx[id].length - 1] += n, ctx);
+const tos = (stack) => stack[stack.length - 1];
+const nop = (ctx) => ctx;
+const dsp = __xsp(0);
+const pick = (ctx) => {
+  const stack = ctx[0];
+  let n = stack.length - 1;
+  $n(n, 0);
+  $n(n -= stack.pop() + 1, 0);
+  stack.push(stack[n]);
+  return ctx;
 };
-/**
- * Removes TOS from d-stack.
- *
- * ( x -- )
- *
- * @param ctx -
- */
-export const drop = __drop(0);
-/**
- * Removes top 2 vals from d-stack.
- *
- * ( x y -- )
- *
- * @param ctx -
- */
-export const drop2 = __drop(0, 2);
-/**
- * If TOS is truthy then drop it:
- *
- * ( x -- )
- *
- * Else, no effect:
- *
- * ( x -- x )
- */
-export const dropif = (ctx) => ($(ctx[0], 1), tos(ctx[0]) && ctx[0].length--, ctx);
-/**
- * Higher order word. Pushes given args verbatim on d-stack.
- *
- * ( -- ...args )
- *
- * @param args -
- */
-export const defPush = (...args) => (ctx) => (ctx[0].push(...args), ctx);
-/**
- * Duplicates TOS on d-stack.
- *
- * ( x -- x x )
- *
- * @param ctx -
- */
-export const dup = __dup(0);
-/**
- * Duplicates top 2 vals on d-stack.
- *
- * ( x y -- x y x y )
- *
- * @param ctx -
- */
-export const dup2 = __dup2(0);
-/**
- * Duplicates top 3 vals on d-stack.
- *
- * ( x y -- x y x y )
- *
- * @param ctx -
- */
-export const dup3 = __dup3(0);
-/**
- * If TOS is truthy then push copy of it on d-stack:
- *
- * ( x -- x x )
- *
- * Else, no effect:
- *
- * ( x -- x )
- *
- * @param ctx -
- */
-export const dupif = (ctx) => {
-    $(ctx[0], 1);
-    const x = tos(ctx[0]);
-    x && ctx[0].push(x);
-    return ctx;
+const drop = __drop(0);
+const drop2 = __drop(0, 2);
+const dropif = (ctx) => ($(ctx[0], 1), tos(ctx[0]) && ctx[0].length--, ctx);
+const defPush = (...args) => (ctx) => (ctx[0].push(...args), ctx);
+const dup = __dup(0);
+const dup2 = __dup2(0);
+const dup3 = __dup3(0);
+const dupif = (ctx) => {
+  $(ctx[0], 1);
+  const x = tos(ctx[0]);
+  x && ctx[0].push(x);
+  return ctx;
 };
-/**
- * Swaps the two topmost d-stack items.
- *
- * ( x y -- y x )
- *
- * @param ctx -
- */
-export const swap = __swap(0);
-/**
- * Swaps the two topmost d-stack pairs.
- *
- * ( a b c d -- c d a b )
- *
- * @param ctx -
- */
-export const swap2 = __swap2(0);
-/**
- * Removes second topmost item from d-stack.
- *
- * ( x y -- y )
- *
- * @param ctx -
- */
-export const nip = (ctx) => {
-    const stack = ctx[0];
-    const n = stack.length - 2;
-    $n(n, 0);
-    stack[n] = stack.pop();
-    return ctx;
+const swap = __swap(0);
+const swap2 = __swap2(0);
+const nip = (ctx) => {
+  const stack = ctx[0];
+  const n = stack.length - 2;
+  $n(n, 0);
+  stack[n] = stack.pop();
+  return ctx;
 };
-/**
- * Inserts copy of TOS @ TOS-2 in d-stack.
- *
- * ( x y -- y x y )
- *
- * @param ctx -
- */
-export const tuck = (ctx) => {
-    $(ctx[0], 2);
-    const stack = ctx[0];
-    const a = stack.pop();
-    stack.push(a, stack.pop(), a);
-    return ctx;
+const tuck = (ctx) => {
+  $(ctx[0], 2);
+  const stack = ctx[0];
+  const a = stack.pop();
+  stack.push(a, stack.pop(), a);
+  return ctx;
 };
-/**
- * Rotates three topmost d-stack items downwards/to the left.
- *
- * ( x y z -- y z x )
- *
- * @param ctx -
- */
-export const rot = (ctx) => {
-    const stack = ctx[0];
-    const n = stack.length - 1;
-    $n(n, 2);
-    const c = stack[n - 2];
-    stack[n - 2] = stack[n - 1];
-    stack[n - 1] = stack[n];
-    stack[n] = c;
-    return ctx;
+const rot = (ctx) => {
+  const stack = ctx[0];
+  const n = stack.length - 1;
+  $n(n, 2);
+  const c = stack[n - 2];
+  stack[n - 2] = stack[n - 1];
+  stack[n - 1] = stack[n];
+  stack[n] = c;
+  return ctx;
 };
-/**
- * Rotates three topmost d-stack items upwards/to the right.
- *
- * ( x y z -- z x y )
- *
- * @param ctx -
- */
-export const invrot = (ctx) => {
-    const stack = ctx[0];
-    const n = stack.length - 1;
-    $n(n, 2);
-    const c = stack[n];
-    stack[n] = stack[n - 1];
-    stack[n - 1] = stack[n - 2];
-    stack[n - 2] = c;
-    return ctx;
+const invrot = (ctx) => {
+  const stack = ctx[0];
+  const n = stack.length - 1;
+  $n(n, 2);
+  const c = stack[n];
+  stack[n] = stack[n - 1];
+  stack[n - 1] = stack[n - 2];
+  stack[n - 2] = c;
+  return ctx;
+};
+const over = __over(0);
+const inc = __incdec(0, 1);
+const dec = __incdec(0, -1);
+const rsp = __xsp(1);
+const rdup = __dup(1);
+const rdup2 = __dup2(1);
+const rdup3 = __dup3(1);
+const rdrop = __drop(1);
+const rdrop2 = __drop(1, 2);
+const movdr = __move(0, 1);
+const movrd = __move(1, 0);
+const cpdr = __copy(0, 1);
+const cprd = __copy(1, 0);
+const movdr2 = __move2(0, 1);
+const movrd2 = __move2(1, 0);
+const cpdr2 = __copy2(0, 1);
+const cprd2 = __copy2(1, 0);
+const rswap = __swap(1);
+const rswap2 = __swap2(1);
+const rover = __over(1);
+const rinc = __incdec(1, 1);
+const rdec = __incdec(1, -1);
+export {
+  cpdr,
+  cpdr2,
+  cprd,
+  cprd2,
+  dec,
+  defPush,
+  drop,
+  drop2,
+  dropif,
+  dsp,
+  dup,
+  dup2,
+  dup3,
+  dupif,
+  inc,
+  invrot,
+  movdr,
+  movdr2,
+  movrd,
+  movrd2,
+  nip,
+  nop,
+  over,
+  pick,
+  rdec,
+  rdrop,
+  rdrop2,
+  rdup,
+  rdup2,
+  rdup3,
+  rinc,
+  rot,
+  rover,
+  rsp,
+  rswap,
+  rswap2,
+  swap,
+  swap2,
+  tos,
+  tuck
 };
-/**
- * Pushes copy of TOS-1 as new TOS on d-stack.
- *
- * ( x y -- x y x )
- *
- * @param ctx -
- */
-export const over = __over(0);
-/**
- * ( x -- x+1 )
- *
- * @param ctx -
- */
-export const inc = __incdec(0, 1);
-/**
- * ( x -- x-1 )
- *
- * @param ctx -
- */
-export const dec = __incdec(0, -1);
-//////////////////// R-Stack ops ////////////////////
-/**
- * Pushes current r-stack size on d-stack.
- *
- * ( -- n )
- *
- * @param ctx -
- */
-export const rsp = __xsp(1);
-/**
- * Duplicates TOS on r-stack.
- *
- * ( x -- x x )
- *
- * @param ctx -
- */
-export const rdup = __dup(1);
-/**
- * Duplicates top 2 vals on r-stack.
- *
- * ( x y -- x y x y )
- *
- * @param ctx -
- */
-export const rdup2 = __dup2(1);
-/**
- * Duplicates top 3 vals on r-stack.
- *
- * ( x y -- x y x y )
- *
- * @param ctx -
- */
-export const rdup3 = __dup3(1);
-/**
- * Removes TOS from r-stack.
- *
- * ( x -- )
- *
- * @param ctx -
- */
-export const rdrop = __drop(1);
-/**
- * Removes top 2 vals from r-stack.
- *
- * ( x y -- )
- *
- * @param ctx -
- */
-export const rdrop2 = __drop(1, 2);
-export const movdr = __move(0, 1);
-export const movrd = __move(1, 0);
-export const cpdr = __copy(0, 1);
-export const cprd = __copy(1, 0);
-export const movdr2 = __move2(0, 1);
-export const movrd2 = __move2(1, 0);
-export const cpdr2 = __copy2(0, 1);
-export const cprd2 = __copy2(1, 0);
-/**
- * Swaps the two topmost r-stack items.
- *
- * ( x y -- y x )
- *
- * @param ctx -
- */
-export const rswap = __swap(1);
-/**
- * Swaps the two topmost d-stack pairs.
- *
- * ( a b c d -- c d a b )
- *
- * @param ctx -
- */
-export const rswap2 = __swap2(1);
-/**
- * Pushes copy of TOS-1 as new TOS on r-stack.
- *
- * ( x y -- x y x )
- *
- * @param ctx -
- */
-export const rover = __over(1);
-/**
- * Like {@link inc}, but applies to r-stack TOS.
- *
- * @param ctx -
- */
-export const rinc = __incdec(1, 1);
-/**
- * Like {@link dec}, but applies to r-stack TOS.
- *
- * @param ctx -
- */
-export const rdec = __incdec(1, -1);

package/string.js

@@ -1,39 +1,26 @@
 import { $n, $ } from "./safe.js";
-/**
- * Takes a string and stringified regexp (w/o flags), returns true if
- * regexp matches the string.
- *
- * ( str re -- bool )
- *
- * @param ctx -
- */
-export const ismatch = (ctx) => {
-    const stack = ctx[0];
-    const n = stack.length - 2;
-    $n(n, 0);
-    stack[n] = new RegExp(stack[n + 1]).test(stack[n]);
-    stack.length--;
-    return ctx;
+const ismatch = (ctx) => {
+  const stack = ctx[0];
+  const n = stack.length - 2;
+  $n(n, 0);
+  stack[n] = new RegExp(stack[n + 1]).test(stack[n]);
+  stack.length--;
+  return ctx;
 };
-/**
- * ( str -- obj )
- *
- * @param ctx -
- */
-export const fromjson = (ctx) => {
-    const stack = ctx[0];
-    $(stack, 1);
-    stack.push(JSON.parse(stack.pop()));
-    return ctx;
+const fromjson = (ctx) => {
+  const stack = ctx[0];
+  $(stack, 1);
+  stack.push(JSON.parse(stack.pop()));
+  return ctx;
 };
-/**
- * ( x -- str )
- *
- * @param ctx -
- */
-export const tojson = (ctx) => {
-    const stack = ctx[0];
-    $(stack, 1);
-    stack.push(JSON.stringify(stack.pop(), null, 4));
-    return ctx;
+const tojson = (ctx) => {
+  const stack = ctx[0];
+  $(stack, 1);
+  stack.push(JSON.stringify(stack.pop(), null, 4));
+  return ctx;
+};
+export {
+  fromjson,
+  ismatch,
+  tojson
 };