@zipify/wysiwyg 1.2.1-0 → 1.2.1

package/node_modules_lambda/acorn-globals/node_modules/acorn/dist/bin.js

@@ -1,64 +0,0 @@
-'use strict';
-
-var path = require('path');
-var fs = require('fs');
-var acorn = require('./acorn.js');
-
-var infile, forceFile, silent = false, compact = false, tokenize = false;
-var options = {};
-
-function help(status) {
-  var print = (status === 0) ? console.log : console.error;
-  print("usage: " + path.basename(process.argv[1]) + " [--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|...|--ecma2015|--ecma2016|--ecma2017|--ecma2018|...]");
-  print("        [--tokenize] [--locations] [---allow-hash-bang] [--compact] [--silent] [--module] [--help] [--] [infile]");
-  process.exit(status);
-}
-
-for (var i = 2; i < process.argv.length; ++i) {
-  var arg = process.argv[i];
-  if ((arg === "-" || arg[0] !== "-") && !infile) { infile = arg; }
-  else if (arg === "--" && !infile && i + 2 === process.argv.length) { forceFile = infile = process.argv[++i]; }
-  else if (arg === "--locations") { options.locations = true; }
-  else if (arg === "--allow-hash-bang") { options.allowHashBang = true; }
-  else if (arg === "--silent") { silent = true; }
-  else if (arg === "--compact") { compact = true; }
-  else if (arg === "--help") { help(0); }
-  else if (arg === "--tokenize") { tokenize = true; }
-  else if (arg === "--module") { options.sourceType = "module"; }
-  else {
-    var match = arg.match(/^--ecma(\d+)$/);
-    if (match)
-      { options.ecmaVersion = +match[1]; }
-    else
-      { help(1); }
-  }
-}
-
-function run(code) {
-  var result;
-  try {
-    if (!tokenize) {
-      result = acorn.parse(code, options);
-    } else {
-      result = [];
-      var tokenizer = acorn.tokenizer(code, options), token;
-      do {
-        token = tokenizer.getToken();
-        result.push(token);
-      } while (token.type !== acorn.tokTypes.eof)
-    }
-  } catch (e) {
-    console.error(infile && infile !== "-" ? e.message.replace(/\(\d+:\d+\)$/, function (m) { return m.slice(0, 1) + infile + " " + m.slice(1); }) : e.message);
-    process.exit(1);
-  }
-  if (!silent) { console.log(JSON.stringify(result, null, compact ? null : 2)); }
-}
-
-if (forceFile || infile && infile !== "-") {
-  run(fs.readFileSync(infile, "utf8"));
-} else {
-  var code = "";
-  process.stdin.resume();
-  process.stdin.on("data", function (chunk) { return code += chunk; });
-  process.stdin.on("end", function () { return run(code); });
-}

package/node_modules_lambda/acorn-globals/node_modules/acorn/package.json

@@ -1,35 +0,0 @@
-{
-  "name": "acorn",
-  "description": "ECMAScript parser",
-  "homepage": "https://github.com/acornjs/acorn",
-  "main": "dist/acorn.js",
-  "types": "dist/acorn.d.ts",
-  "module": "dist/acorn.mjs",
-  "version": "7.4.1",
-  "engines": {"node": ">=0.4.0"},
-  "maintainers": [
-    {
-      "name": "Marijn Haverbeke",
-      "email": "marijnh@gmail.com",
-      "web": "https://marijnhaverbeke.nl"
-    },
-    {
-      "name": "Ingvar Stepanyan",
-      "email": "me@rreverser.com",
-      "web": "https://rreverser.com/"
-    },
-    {
-      "name": "Adrian Heine",
-      "web": "http://adrianheine.de"
-    }
-  ],
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/acornjs/acorn.git"
-  },
-  "license": "MIT",
-  "scripts": {
-    "prepare": "cd ..; npm run build:main && npm run build:bin"
-  },
-  "bin": {"acorn": "./bin/acorn"}
-}

package/node_modules_lambda/acorn-globals/package.json

@@ -1,35 +0,0 @@
-{
-  "name": "acorn-globals",
-  "version": "6.0.0",
-  "description": "Detect global variables in JavaScript using acorn",
-  "keywords": [
-    "ast",
-    "variable",
-    "name",
-    "lexical",
-    "scope",
-    "local",
-    "global",
-    "implicit"
-  ],
-  "files": [
-    "index.js",
-    "LICENSE"
-  ],
-  "dependencies": {
-    "acorn": "^7.1.1",
-    "acorn-walk": "^7.1.1"
-  },
-  "devDependencies": {
-    "testit": "^3.1.0"
-  },
-  "scripts": {
-    "test": "node test"
-  },
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/ForbesLindesay/acorn-globals.git"
-  },
-  "author": "ForbesLindesay",
-  "license": "MIT"
-}

package/node_modules_lambda/acorn-walk/CHANGELOG.md

@@ -1,131 +0,0 @@
-## 7.2.0 (2020-06-17)
-
-### New features
-
-Support optional chaining and nullish coalescing.
-
-Support `import.meta`.
-
-Add support for `export * as ns from "source"`.
-
-## 7.1.1 (2020-02-13)
-
-### Bug fixes
-
-Clean up the type definitions to actually work well with the main parser.
-
-## 7.1.0 (2020-02-11)
-
-### New features
-
-Add a TypeScript definition file for the library.
-
-## 7.0.0 (2017-08-12)
-
-### New features
-
-Support walking `ImportExpression` nodes.
-
-## 6.2.0 (2017-07-04)
-
-### New features
-
-Add support for `Import` nodes.
-
-## 6.1.0 (2018-09-28)
-
-### New features
-
-The walker now walks `TemplateElement` nodes.
-
-## 6.0.1 (2018-09-14)
-
-### Bug fixes
-
-Fix bad "main" field in package.json.
-
-## 6.0.0 (2018-09-14)
-
-### Breaking changes
-
-This is now a separate package, `acorn-walk`, rather than part of the main `acorn` package.
-
-The `ScopeBody` and `ScopeExpression` meta-node-types are no longer supported.
-
-## 5.7.1 (2018-06-15)
-
-### Bug fixes
-
-Make sure the walker and bin files are rebuilt on release (the previous release didn't get the up-to-date versions).
-
-## 5.7.0 (2018-06-15)
-
-### Bug fixes
-
-Fix crash in walker when walking a binding-less catch node.
-
-## 5.6.2 (2018-06-05)
-
-### Bug fixes
-
-In the walker, go back to allowing the `baseVisitor` argument to be null to default to the default base everywhere.
-
-## 5.6.1 (2018-06-01)
-
-### Bug fixes
-
-Fix regression when passing `null` as fourth argument to `walk.recursive`.
-
-## 5.6.0 (2018-05-31)
-
-### Bug fixes
-
-Fix a bug in the walker that caused a crash when walking an object pattern spread.
-
-## 5.5.1 (2018-03-06)
-
-### Bug fixes
-
-Fix regression in walker causing property values in object patterns to be walked as expressions.
-
-## 5.5.0 (2018-02-27)
-
-### Bug fixes
-
-Support object spread in the AST walker.
-
-## 5.4.1 (2018-02-02)
-
-### Bug fixes
-
-5.4.0 somehow accidentally included an old version of walk.js.
-
-## 5.2.0 (2017-10-30)
-
-### Bug fixes
-
-The `full` and `fullAncestor` walkers no longer visit nodes multiple times.
-
-## 5.1.0 (2017-07-05)
-
-### New features
-
-New walker functions `full` and `fullAncestor`.
-
-## 3.2.0 (2016-06-07)
-
-### New features
-
-Make it possible to use `visit.ancestor` with a walk state.
-
-## 3.1.0 (2016-04-18)
-
-### New features
-
-The walker now allows defining handlers for `CatchClause` nodes.
-
-## 2.5.2 (2015-10-27)
-
-### Fixes
-
-Fix bug where the walker walked an exported `let` statement as an expression.

package/node_modules_lambda/acorn-walk/LICENSE

@@ -1,19 +0,0 @@
-Copyright (C) 2012-2018 by various contributors (see AUTHORS)
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.

package/node_modules_lambda/acorn-walk/README.md

@@ -1,126 +0,0 @@
-# Acorn AST walker
-
-An abstract syntax tree walker for the
-[ESTree](https://github.com/estree/estree) format.
-
-## Community
-
-Acorn is open source software released under an
-[MIT license](https://github.com/acornjs/acorn/blob/master/acorn-walk/LICENSE).
-
-You are welcome to
-[report bugs](https://github.com/acornjs/acorn/issues) or create pull
-requests on [github](https://github.com/acornjs/acorn). For questions
-and discussion, please use the
-[Tern discussion forum](https://discuss.ternjs.net).
-
-## Installation
-
-The easiest way to install acorn is from [`npm`](https://www.npmjs.com/):
-
-```sh
-npm install acorn-walk
-```
-
-Alternately, you can download the source and build acorn yourself:
-
-```sh
-git clone https://github.com/acornjs/acorn.git
-cd acorn
-npm install
-```
-
-## Interface
-
-An algorithm for recursing through a syntax tree is stored as an
-object, with a property for each tree node type holding a function
-that will recurse through such a node. There are several ways to run
-such a walker.
-
-**simple**`(node, visitors, base, state)` does a 'simple' walk over a
-tree. `node` should be the AST node to walk, and `visitors` an object
-with properties whose names correspond to node types in the [ESTree
-spec](https://github.com/estree/estree). The properties should contain
-functions that will be called with the node object and, if applicable
-the state at that point. The last two arguments are optional. `base`
-is a walker algorithm, and `state` is a start state. The default
-walker will simply visit all statements and expressions and not
-produce a meaningful state. (An example of a use of state is to track
-scope at each point in the tree.)
-
-```js
-const acorn = require("acorn")
-const walk = require("acorn-walk")
-
-walk.simple(acorn.parse("let x = 10"), {
-  Literal(node) {
-    console.log(`Found a literal: ${node.value}`)
-  }
-})
-```
-
-**ancestor**`(node, visitors, base, state)` does a 'simple' walk over
-a tree, building up an array of ancestor nodes (including the current node)
-and passing the array to the callbacks as a third parameter.
-
-```js
-const acorn = require("acorn")
-const walk = require("acorn-walk")
-
-walk.ancestor(acorn.parse("foo('hi')"), {
-  Literal(_, ancestors) {
-    console.log("This literal's ancestors are:", ancestors.map(n => n.type))
-  }
-})
-```
-
-**recursive**`(node, state, functions, base)` does a 'recursive'
-walk, where the walker functions are responsible for continuing the
-walk on the child nodes of their target node. `state` is the start
-state, and `functions` should contain an object that maps node types
-to walker functions. Such functions are called with `(node, state, c)`
-arguments, and can cause the walk to continue on a sub-node by calling
-the `c` argument on it with `(node, state)` arguments. The optional
-`base` argument provides the fallback walker functions for node types
-that aren't handled in the `functions` object. If not given, the
-default walkers will be used.
-
-**make**`(functions, base)` builds a new walker object by using the
-walker functions in `functions` and filling in the missing ones by
-taking defaults from `base`.
-
-**full**`(node, callback, base, state)` does a 'full' walk over a
-tree, calling the callback with the arguments (node, state, type) for
-each node
-
-**fullAncestor**`(node, callback, base, state)` does a 'full' walk
-over a tree, building up an array of ancestor nodes (including the
-current node) and passing the array to the callbacks as a third
-parameter.
-
-```js
-const acorn = require("acorn")
-const walk = require("acorn-walk")
-
-walk.full(acorn.parse("1 + 1"), node => {
-  console.log(`There's a ${node.type} node at ${node.ch}`)
-})
-```
-
-**findNodeAt**`(node, start, end, test, base, state)` tries to locate
-a node in a tree at the given start and/or end offsets, which
-satisfies the predicate `test`. `start` and `end` can be either `null`
-(as wildcard) or a number. `test` may be a string (indicating a node
-type) or a function that takes `(nodeType, node)` arguments and
-returns a boolean indicating whether this node is interesting. `base`
-and `state` are optional, and can be used to specify a custom walker.
-Nodes are tested from inner to outer, so if two nodes match the
-boundaries, the inner one will be preferred.
-
-**findNodeAround**`(node, pos, test, base, state)` is a lot like
-`findNodeAt`, but will match any node that exists 'around' (spanning)
-the given position.
-
-**findNodeAfter**`(node, pos, test, base, state)` is similar to
-`findNodeAround`, but will match all nodes *after* the given position
-(testing outer nodes before inner nodes).

package/node_modules_lambda/acorn-walk/dist/walk.d.ts

@@ -1,112 +0,0 @@
-import {Node} from 'acorn';
-
-declare module "acorn-walk" {
-  type FullWalkerCallback<TState> = (
-    node: Node,
-    state: TState,
-    type: string
-  ) => void;
-
-  type FullAncestorWalkerCallback<TState> = (
-    node: Node,
-    state: TState | Node[],
-    ancestors: Node[],
-    type: string
-  ) => void;
-  type WalkerCallback<TState> = (node: Node, state: TState) => void;
-
-  type SimpleWalkerFn<TState> = (
-    node: Node,
-    state: TState
-  ) => void;
-  
-  type AncestorWalkerFn<TState> = (
-    node: Node,
-    state: TState| Node[],
-    ancestors: Node[]
-  ) => void;
-
-  type RecursiveWalkerFn<TState> = (
-    node: Node,
-    state: TState,
-    callback: WalkerCallback<TState>
-  ) => void;
-  
-  type SimpleVisitors<TState> = {
-    [type: string]: SimpleWalkerFn<TState>
-  };
-
-  type AncestorVisitors<TState> = {
-    [type: string]: AncestorWalkerFn<TState>
-  };
-  
-  type RecursiveVisitors<TState> = {
-    [type: string]: RecursiveWalkerFn<TState>
-  };
-
-  type FindPredicate = (type: string, node: Node) => boolean;
-
-  interface Found<TState> {
-    node: Node,
-    state: TState
-  }
-
-  export function simple<TState>(
-    node: Node,
-    visitors: SimpleVisitors<TState>,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): void;
-
-  export function ancestor<TState>(
-    node: Node,
-    visitors: AncestorVisitors<TState>,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): void;
-
-  export function recursive<TState>(
-    node: Node,
-    state: TState,
-    functions: RecursiveVisitors<TState>,
-    base?: RecursiveVisitors<TState>
-  ): void;
-
-  export function full<TState>(
-    node: Node,
-    callback: FullWalkerCallback<TState>,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): void;
-
-  export function fullAncestor<TState>(
-    node: Node,
-    callback: FullAncestorWalkerCallback<TState>,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): void;
-
-  export function make<TState>(
-    functions: RecursiveVisitors<TState>,
-    base?: RecursiveVisitors<TState>
-  ): RecursiveVisitors<TState>;
-
-  export function findNodeAt<TState>(
-    node: Node,
-    start: number | undefined,
-    end?: number | undefined,
-    type?: FindPredicate | string,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): Found<TState> | undefined;
-
-  export function findNodeAround<TState>(
-    node: Node,
-    start: number | undefined,
-    type?: FindPredicate | string,
-    base?: RecursiveVisitors<TState>,
-    state?: TState
-  ): Found<TState> | undefined;
-
-  export const findNodeAfter: typeof findNodeAround;
-}