pdf-creator-node 2.3.5 → 2.5.0

package/example/node_modules/pdf-creator-node/example/node_modules/pdf-creator-node/example/node_modules/uglify-js/lib/sourcemap.js

@@ -1,193 +0,0 @@
-/***********************************************************************
-
-  A JavaScript tokenizer / parser / beautifier / compressor.
-  https://github.com/mishoo/UglifyJS
-
-  -------------------------------- (C) ---------------------------------
-
-                           Author: Mihai Bazon
-                         <mihai.bazon@gmail.com>
-                       http://mihai.bazon.net/blog
-
-  Distributed under the BSD license:
-
-    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
-
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions
-    are met:
-
-        * Redistributions of source code must retain the above
-          copyright notice, this list of conditions and the following
-          disclaimer.
-
-        * Redistributions in binary form must reproduce the above
-          copyright notice, this list of conditions and the following
-          disclaimer in the documentation and/or other materials
-          provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
-    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
-    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
-    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
-    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
-    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-    SUCH DAMAGE.
-
- ***********************************************************************/
-
-"use strict";
-
-var vlq_char = characters("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/");
-var vlq_bits = vlq_char.reduce(function(map, ch, bits) {
-    map[ch] = bits;
-    return map;
-}, Object.create(null));
-
-function vlq_decode(indices, str) {
-    var value = 0;
-    var shift = 0;
-    for (var i = 0, j = 0; i < str.length; i++) {
-        var bits = vlq_bits[str[i]];
-        value += (bits & 31) << shift;
-        if (bits & 32) {
-            shift += 5;
-        } else {
-            indices[j++] += value & 1 ? 0x80000000 | -(value >> 1) : value >> 1;
-            value = shift = 0;
-        }
-    }
-    return j;
-}
-
-function vlq_encode(num) {
-    var result = "";
-    num = Math.abs(num) << 1 | num >>> 31;
-    do {
-        var bits = num & 31;
-        if (num >>>= 5) bits |= 32;
-        result += vlq_char[bits];
-    } while (num);
-    return result;
-}
-
-function create_array_map() {
-    var map = Object.create(null);
-    var array = [];
-    array.index = function(name) {
-        if (!HOP(map, name)) {
-            map[name] = array.length;
-            array.push(name);
-        }
-        return map[name];
-    };
-    return array;
-}
-
-function SourceMap(options) {
-    var sources = create_array_map();
-    var sources_content = options.includeSources && Object.create(null);
-    var names = create_array_map();
-    var mappings = "";
-    if (options.orig) Object.keys(options.orig).forEach(function(name) {
-        var map = options.orig[name];
-        var indices = [ 0, 0, 1, 0, 0 ];
-        options.orig[name] = {
-            names: map.names,
-            mappings: map.mappings.split(/;/).map(function(line) {
-                indices[0] = 0;
-                return line.split(/,/).map(function(segment) {
-                    return indices.slice(0, vlq_decode(indices, segment));
-                });
-            }),
-            sources: map.sources,
-        };
-        if (!sources_content || !map.sourcesContent) return;
-        for (var i = 0; i < map.sources.length; i++) {
-            var content = map.sourcesContent[i];
-            if (content) sources_content[map.sources[i]] = content;
-        }
-    });
-    var prev_source;
-    var generated_line = 1;
-    var generated_column = 0;
-    var source_index = 0;
-    var original_line = 1;
-    var original_column = 0;
-    var name_index = 0;
-    return {
-        add: options.orig ? function(source, gen_line, gen_col, orig_line, orig_col, name) {
-            var map = options.orig[source];
-            if (map) {
-                var segments = map.mappings[orig_line - 1];
-                if (!segments) return;
-                var indices;
-                for (var i = 0; i < segments.length; i++) {
-                    var col = segments[i][0];
-                    if (orig_col >= col) indices = segments[i];
-                    if (orig_col <= col) break;
-                }
-                if (!indices || indices.length < 4) {
-                    source = null;
-                } else {
-                    source = map.sources[indices[1]];
-                    orig_line = indices[2];
-                    orig_col = indices[3];
-                    if (indices.length > 4) name = map.names[indices[4]];
-                }
-            }
-            add(source, gen_line, gen_col, orig_line, orig_col, name);
-        } : add,
-        setSourceContent: sources_content ? function(source, content) {
-            if (!(source in sources_content)) {
-                sources_content[source] = content;
-            }
-        } : noop,
-        toString: function() {
-            return JSON.stringify({
-                version: 3,
-                file: options.filename || undefined,
-                sourceRoot: options.root || undefined,
-                sources: sources,
-                sourcesContent: sources_content ? sources.map(function(source) {
-                    return sources_content[source] || null;
-                }) : undefined,
-                names: names,
-                mappings: mappings,
-            });
-        }
-    };
-
-    function add(source, gen_line, gen_col, orig_line, orig_col, name) {
-        if (prev_source == null && source == null) return;
-        prev_source = source;
-        if (generated_line < gen_line) {
-            generated_column = 0;
-            do {
-                mappings += ";";
-            } while (++generated_line < gen_line);
-        } else if (mappings) {
-            mappings += ",";
-        }
-        mappings += vlq_encode(gen_col - generated_column);
-        generated_column = gen_col;
-        if (source == null) return;
-        var src_idx = sources.index(source);
-        mappings += vlq_encode(src_idx - source_index);
-        source_index = src_idx;
-        mappings += vlq_encode(orig_line - original_line);
-        original_line = orig_line;
-        mappings += vlq_encode(orig_col - original_column);
-        original_column = orig_col;
-        if (options.names && name != null) {
-            var name_idx = names.index(name);
-            mappings += vlq_encode(name_idx - name_index);
-            name_index = name_idx;
-        }
-    }
-}

package/example/node_modules/pdf-creator-node/example/node_modules/pdf-creator-node/example/node_modules/uglify-js/lib/transform.js

@@ -1,250 +0,0 @@
-/***********************************************************************
-
-  A JavaScript tokenizer / parser / beautifier / compressor.
-  https://github.com/mishoo/UglifyJS
-
-  -------------------------------- (C) ---------------------------------
-
-                           Author: Mihai Bazon
-                         <mihai.bazon@gmail.com>
-                       http://mihai.bazon.net/blog
-
-  Distributed under the BSD license:
-
-    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
-
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions
-    are met:
-
-        * Redistributions of source code must retain the above
-          copyright notice, this list of conditions and the following
-          disclaimer.
-
-        * Redistributions in binary form must reproduce the above
-          copyright notice, this list of conditions and the following
-          disclaimer in the documentation and/or other materials
-          provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
-    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
-    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
-    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
-    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
-    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-    SUCH DAMAGE.
-
- ***********************************************************************/
-
-"use strict";
-
-function TreeTransformer(before, after) {
-    TreeWalker.call(this);
-    this.before = before;
-    this.after = after;
-}
-TreeTransformer.prototype = new TreeWalker;
-
-(function(DEF) {
-    function do_list(list, tw) {
-        return List(list, function(node) {
-            return node.transform(tw, true);
-        });
-    }
-
-    DEF(AST_Node, noop);
-    DEF(AST_LabeledStatement, function(self, tw) {
-        self.label = self.label.transform(tw);
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_SimpleStatement, function(self, tw) {
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_Block, function(self, tw) {
-        self.body = do_list(self.body, tw);
-    });
-    DEF(AST_Do, function(self, tw) {
-        self.body = self.body.transform(tw);
-        self.condition = self.condition.transform(tw);
-    });
-    DEF(AST_While, function(self, tw) {
-        self.condition = self.condition.transform(tw);
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_For, function(self, tw) {
-        if (self.init) self.init = self.init.transform(tw);
-        if (self.condition) self.condition = self.condition.transform(tw);
-        if (self.step) self.step = self.step.transform(tw);
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_ForEnumeration, function(self, tw) {
-        self.init = self.init.transform(tw);
-        self.object = self.object.transform(tw);
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_With, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_Exit, function(self, tw) {
-        if (self.value) self.value = self.value.transform(tw);
-    });
-    DEF(AST_LoopControl, function(self, tw) {
-        if (self.label) self.label = self.label.transform(tw);
-    });
-    DEF(AST_If, function(self, tw) {
-        self.condition = self.condition.transform(tw);
-        self.body = self.body.transform(tw);
-        if (self.alternative) self.alternative = self.alternative.transform(tw);
-    });
-    DEF(AST_Switch, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-        self.body = do_list(self.body, tw);
-    });
-    DEF(AST_Case, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-        self.body = do_list(self.body, tw);
-    });
-    DEF(AST_Try, function(self, tw) {
-        self.body = do_list(self.body, tw);
-        if (self.bcatch) self.bcatch = self.bcatch.transform(tw);
-        if (self.bfinally) self.bfinally = self.bfinally.transform(tw);
-    });
-    DEF(AST_Catch, function(self, tw) {
-        if (self.argname) self.argname = self.argname.transform(tw);
-        self.body = do_list(self.body, tw);
-    });
-    DEF(AST_Definitions, function(self, tw) {
-        self.definitions = do_list(self.definitions, tw);
-    });
-    DEF(AST_VarDef, function(self, tw) {
-        self.name = self.name.transform(tw);
-        if (self.value) self.value = self.value.transform(tw);
-    });
-    DEF(AST_DefaultValue, function(self, tw) {
-        self.name = self.name.transform(tw);
-        self.value = self.value.transform(tw);
-    });
-    DEF(AST_Lambda, function(self, tw) {
-        if (self.name) self.name = self.name.transform(tw);
-        self.argnames = do_list(self.argnames, tw);
-        if (self.rest) self.rest = self.rest.transform(tw);
-        self.body = do_list(self.body, tw);
-    });
-    function transform_arrow(self, tw) {
-        self.argnames = do_list(self.argnames, tw);
-        if (self.rest) self.rest = self.rest.transform(tw);
-        if (self.value) {
-            self.value = self.value.transform(tw);
-        } else {
-            self.body = do_list(self.body, tw);
-        }
-    }
-    DEF(AST_Arrow, transform_arrow);
-    DEF(AST_AsyncArrow, transform_arrow);
-    DEF(AST_Class, function(self, tw) {
-        if (self.name) self.name = self.name.transform(tw);
-        if (self.extends) self.extends = self.extends.transform(tw);
-        self.properties = do_list(self.properties, tw);
-    });
-    DEF(AST_ClassProperty, function(self, tw) {
-        if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
-        if (self.value) self.value = self.value.transform(tw);
-    });
-    DEF(AST_Call, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-        self.args = do_list(self.args, tw);
-    });
-    DEF(AST_Sequence, function(self, tw) {
-        self.expressions = do_list(self.expressions, tw);
-    });
-    DEF(AST_Await, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-    });
-    DEF(AST_Yield, function(self, tw) {
-        if (self.expression) self.expression = self.expression.transform(tw);
-    });
-    DEF(AST_Dot, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-    });
-    DEF(AST_Sub, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-        self.property = self.property.transform(tw);
-    });
-    DEF(AST_Spread, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-    });
-    DEF(AST_Unary, function(self, tw) {
-        self.expression = self.expression.transform(tw);
-    });
-    DEF(AST_Binary, function(self, tw) {
-        self.left = self.left.transform(tw);
-        self.right = self.right.transform(tw);
-    });
-    DEF(AST_Conditional, function(self, tw) {
-        self.condition = self.condition.transform(tw);
-        self.consequent = self.consequent.transform(tw);
-        self.alternative = self.alternative.transform(tw);
-    });
-    DEF(AST_Array, function(self, tw) {
-        self.elements = do_list(self.elements, tw);
-    });
-    DEF(AST_DestructuredArray, function(self, tw) {
-        self.elements = do_list(self.elements, tw);
-        if (self.rest) self.rest = self.rest.transform(tw);
-    });
-    DEF(AST_DestructuredKeyVal, function(self, tw) {
-        if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
-        self.value = self.value.transform(tw);
-    });
-    DEF(AST_DestructuredObject, function(self, tw) {
-        self.properties = do_list(self.properties, tw);
-        if (self.rest) self.rest = self.rest.transform(tw);
-    });
-    DEF(AST_Object, function(self, tw) {
-        self.properties = do_list(self.properties, tw);
-    });
-    DEF(AST_ObjectProperty, function(self, tw) {
-        if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
-        self.value = self.value.transform(tw);
-    });
-    DEF(AST_ExportDeclaration, function(self, tw) {
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_ExportDefault, function(self, tw) {
-        self.body = self.body.transform(tw);
-    });
-    DEF(AST_ExportReferences, function(self, tw) {
-        self.properties = do_list(self.properties, tw);
-    });
-    DEF(AST_Import, function(self, tw) {
-        if (self.all) self.all = self.all.transform(tw);
-        if (self.default) self.default = self.default.transform(tw);
-        if (self.properties) self.properties = do_list(self.properties, tw);
-    });
-    DEF(AST_Template, function(self, tw) {
-        if (self.tag) self.tag = self.tag.transform(tw);
-        self.expressions = do_list(self.expressions, tw);
-    });
-})(function(node, descend) {
-    node.DEFMETHOD("transform", function(tw, in_list) {
-        var x, y;
-        tw.push(this);
-        if (tw.before) x = tw.before(this, descend, in_list);
-        if (typeof x === "undefined") {
-            x = this;
-            descend(x, tw);
-            if (tw.after) {
-                y = tw.after(x, in_list);
-                if (typeof y !== "undefined") x = y;
-            }
-        }
-        tw.pop();
-        return x;
-    });
-});

package/example/node_modules/pdf-creator-node/example/node_modules/pdf-creator-node/example/node_modules/uglify-js/lib/utils.js

@@ -1,267 +0,0 @@
-/***********************************************************************
-
-  A JavaScript tokenizer / parser / beautifier / compressor.
-  https://github.com/mishoo/UglifyJS
-
-  -------------------------------- (C) ---------------------------------
-
-                           Author: Mihai Bazon
-                         <mihai.bazon@gmail.com>
-                       http://mihai.bazon.net/blog
-
-  Distributed under the BSD license:
-
-    Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
-
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions
-    are met:
-
-        * Redistributions of source code must retain the above
-          copyright notice, this list of conditions and the following
-          disclaimer.
-
-        * Redistributions in binary form must reproduce the above
-          copyright notice, this list of conditions and the following
-          disclaimer in the documentation and/or other materials
-          provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
-    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-    PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
-    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
-    OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
-    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
-    THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-    SUCH DAMAGE.
-
- ***********************************************************************/
-
-"use strict";
-
-function characters(str) {
-    return str.split("");
-}
-
-function member(name, array) {
-    return array.indexOf(name) >= 0;
-}
-
-function find_if(func, array) {
-    for (var i = array.length; --i >= 0;) if (func(array[i])) return array[i];
-}
-
-function repeat_string(str, i) {
-    if (i <= 0) return "";
-    if (i == 1) return str;
-    var d = repeat_string(str, i >> 1);
-    d += d;
-    return i & 1 ? d + str : d;
-}
-
-function configure_error_stack(fn) {
-    Object.defineProperty(fn.prototype, "stack", {
-        get: function() {
-            var err = new Error(this.message);
-            err.name = this.name;
-            try {
-                throw err;
-            } catch (e) {
-                return e.stack;
-            }
-        }
-    });
-}
-
-function DefaultsError(msg, defs) {
-    this.message = msg;
-    this.defs = defs;
-}
-DefaultsError.prototype = Object.create(Error.prototype);
-DefaultsError.prototype.constructor = DefaultsError;
-DefaultsError.prototype.name = "DefaultsError";
-configure_error_stack(DefaultsError);
-
-function defaults(args, defs, croak) {
-    if (croak) for (var i in args) {
-        if (HOP(args, i) && !HOP(defs, i)) throw new DefaultsError("`" + i + "` is not a supported option", defs);
-    }
-    for (var i in args) {
-        if (HOP(args, i)) defs[i] = args[i];
-    }
-    return defs;
-}
-
-function merge(obj, ext) {
-    var count = 0;
-    for (var i in ext) if (HOP(ext, i)) {
-        obj[i] = ext[i];
-        count++;
-    }
-    return count;
-}
-
-function noop() {}
-function return_false() { return false; }
-function return_true() { return true; }
-function return_this() { return this; }
-function return_null() { return null; }
-
-var List = (function() {
-    function List(a, f) {
-        var ret = [];
-        for (var i = 0; i < a.length; i++) {
-            var val = f(a[i], i);
-            if (val === skip) continue;
-            if (val instanceof Splice) {
-                ret.push.apply(ret, val.v);
-            } else {
-                ret.push(val);
-            }
-        }
-        return ret;
-    }
-    List.is_op = function(val) {
-        return val === skip || val instanceof Splice;
-    };
-    List.splice = function(val) {
-        return new Splice(val);
-    };
-    var skip = List.skip = {};
-    function Splice(val) {
-        this.v = val;
-    }
-    return List;
-})();
-
-function push_uniq(array, el) {
-    if (array.indexOf(el) < 0) return array.push(el);
-}
-
-function string_template(text, props) {
-    return text.replace(/\{([^}]+)\}/g, function(str, p) {
-        var value = props[p];
-        return value instanceof AST_Node ? value.print_to_string() : value;
-    });
-}
-
-function remove(array, el) {
-    var index = array.indexOf(el);
-    if (index >= 0) array.splice(index, 1);
-}
-
-function makePredicate(words) {
-    if (!Array.isArray(words)) words = words.split(" ");
-    var map = Object.create(null);
-    words.forEach(function(word) {
-        map[word] = true;
-    });
-    return map;
-}
-
-function all(array, predicate) {
-    for (var i = array.length; --i >= 0;)
-        if (!predicate(array[i], i))
-            return false;
-    return true;
-}
-
-function Dictionary() {
-    this._values = Object.create(null);
-    this._size = 0;
-}
-Dictionary.prototype = {
-    set: function(key, val) {
-        if (!this.has(key)) ++this._size;
-        this._values["$" + key] = val;
-        return this;
-    },
-    add: function(key, val) {
-        if (this.has(key)) {
-            this.get(key).push(val);
-        } else {
-            this.set(key, [ val ]);
-        }
-        return this;
-    },
-    get: function(key) { return this._values["$" + key] },
-    del: function(key) {
-        if (this.has(key)) {
-            --this._size;
-            delete this._values["$" + key];
-        }
-        return this;
-    },
-    has: function(key) { return ("$" + key) in this._values },
-    all: function(predicate) {
-        for (var i in this._values)
-            if (!predicate(this._values[i], i.substr(1)))
-                return false;
-        return true;
-    },
-    each: function(f) {
-        for (var i in this._values)
-            f(this._values[i], i.substr(1));
-    },
-    size: function() {
-        return this._size;
-    },
-    map: function(f) {
-        var ret = [];
-        for (var i in this._values)
-            ret.push(f(this._values[i], i.substr(1)));
-        return ret;
-    },
-    clone: function() {
-        var ret = new Dictionary();
-        for (var i in this._values)
-            ret._values[i] = this._values[i];
-        ret._size = this._size;
-        return ret;
-    },
-    toObject: function() { return this._values }
-};
-Dictionary.fromObject = function(obj) {
-    var dict = new Dictionary();
-    dict._size = merge(dict._values, obj);
-    return dict;
-};
-
-function HOP(obj, prop) {
-    return Object.prototype.hasOwnProperty.call(obj, prop);
-}
-
-// return true if the node at the top of the stack (that means the
-// innermost node in the current output) is lexically the first in
-// a statement.
-function first_in_statement(stack, arrow, export_default) {
-    var node = stack.parent(-1);
-    for (var i = 0, p; p = stack.parent(i++); node = p) {
-        if (is_arrow(p)) {
-            return arrow && p.value === node;
-        } else if (p instanceof AST_Binary) {
-            if (p.left === node) continue;
-        } else if (p.TYPE == "Call") {
-            if (p.expression === node) continue;
-        } else if (p instanceof AST_Conditional) {
-            if (p.condition === node) continue;
-        } else if (p instanceof AST_ExportDefault) {
-            return export_default;
-        } else if (p instanceof AST_PropAccess) {
-            if (p.expression === node) continue;
-        } else if (p instanceof AST_Sequence) {
-            if (p.expressions[0] === node) continue;
-        } else if (p instanceof AST_SimpleStatement) {
-            return true;
-        } else if (p instanceof AST_Template) {
-            if (p.tag === node) continue;
-        } else if (p instanceof AST_UnaryPostfix) {
-            if (p.expression === node) continue;
-        }
-        return false;
-    }
-}