');\r\n\t\t\t\t\tvarLabel.attr('onSelectStart','return false');\r\n\t\t\t\t\tblock.append(varLabel);\r\n\t\t\t\t\tblock[0].varname = varprocname;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(arg != undefined){\r\n\t\t\t\t\tblock.append(arg);\r\n\t\t\t\t\targ.keydown(function() {\r\n\t\t\t\t\t\tlayoutArg($(this));\r\n\t\t\t\t\t\tlayoutStack($(this).parents('.stack'));\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t}else if(p.charAt(0) == '@'){\r\n\t\t\t\t// ICON\r\n\t\t\t\tvar icon = getIcon(p.substring(1,p.length));\r\n\t\t\t\tif(icon!= null){\r\n\t\t\t\t\ticon.css('z-index', 5);\r\n\t\t\t\t\tblock.append(icon);\r\n\t\t\t\t\ticon.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\r\n\t\t\t\t\ticon.attr('onDragStart','return false'); //avoid image drag\r\n\t\t\t\t}else{\r\n\t\t\t\t\tvar label = $('
'+p+'
');\r\n\t\t\t\t\tlabel.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\r\n\t\t\t\t\tblock.append(label);\r\n\t\t\t\t}\r\n\t\t\t}else{\r\n\t\t\t\t// LABEL\r\n\t\t\t\tvar label = $('
'+p+'
');\r\n\t\t\t\tlabel.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\r\n\t\t\t\tblock.append(label);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\treturn block;\r\n}","clear()\n {\n this.context.setTransform(1, 0, 0, 1, 0, 0);\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\n }","apply() {\n // Get the source image and create the result image buffer\n const source = new ImageDataPixelWrapper(this.source.getImageData(0, 0, 400, 300));\n const resultImageData = this.result.createImageData(400, 300)\n const result = new ImageDataPixelWrapper(resultImageData);\n\n // Update the alpha values of the newly created image\n result.map((pixel) => pixel.alpha = 255)\n\n if (this.operation) {\n if (this.operation.params) var params = this.getParams();\n this.operation.apply(source, result, params);\n }\n\n // Put the result image in the canvas\n this.result.putImageData(resultImageData, 0, 0);\n }","function CompositeDisposable() {\n var disposable, _i, _len;\n this.disposables = [];\n for (_i = 0, _len = arguments.length; _i < _len; _i++) {\n disposable = arguments[_i];\n this.add(disposable);\n }\n }","render() {\n let finalVisual;\n var cont = this.getContentById();\n\n switch (this.props.onlyContent){\n case \"true\" : \n finalVisual = ( );\n break;\n\n case \"false\" : \n finalVisual = ();\n break;\n }\n return (\n
\n {finalVisual}\n
\n );\n }","function Transformable(x, y, width, height){\n\t\tContainable.call(this);\n\n\t\tthis.set({\n\t\t\tx: x,\n\t\t\ty: y,\n\t\t\twidth: width,\n\t\t\theight: height,\n\t\t\ttransform: {\n\t\t\t\torigin: {x: 0, y: 0},\n\t\t\t\tproperties: {\n\t\t\t\t\trotate: 0,\n\t\t\t\t\ttranslate: {dx: 0, dy: 0},\n\t\t\t\t\tscale: {x: 1, y: 1}\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t}","function confineInContainer(position, width, height, api) {\n\t var viewWidth = api.getWidth();\n\t var viewHeight = api.getHeight();\n\t position[0] = Math.min(position[0] + width, viewWidth) - width;\n\t position[1] = Math.min(position[1] + height, viewHeight) - height;\n\t position[0] = Math.max(position[0], 0);\n\t position[1] = Math.max(position[1], 0);\n\t}","function constructCanvas(){\n\t\t\tcanvasWidth = target.getWidth();\n\t\t\tcanvasHeight = target.getHeight();\n\t\t\ttarget.innerHTML = '';\n\t\t\t\n\t\t\t/**\n\t\t\t * For positioning labels and overlay.\n\t\t\t */\n\t\t\ttarget.setStyle({'position': 'relative'});\n\t\t\t\n\t\t\tif(canvasWidth <= 0 || canvasHeight <= 0){\n\t\t\t\tthrow 'Invalid dimensions for plot, width = ' + canvasWidth + ', height = ' + canvasHeight;\n\t\t\t}\n\t\n\t\t\t/**\n\t\t\t * Insert main canvas.\n\t\t\t */\n\t\t\tcanvas = $(document.createElement('canvas')).writeAttribute({\n\t\t\t\t'width': canvasWidth,\n\t\t\t\t'height': canvasHeight\t\n\t\t\t});\n\t\t\ttarget.appendChild(canvas);\n\t\t\tif(Prototype.Browser.IE){\n\t\t\t\tcanvas = $(window.G_vmlCanvasManager.initElement(canvas));\n\t\t\t} \n\t\t\tctx = canvas.getContext('2d');\n\t\n\t\t\t/**\n\t\t\t * Insert overlay canvas for interactive features.\n\t\t\t */\n\t\t\toverlay = $(document.createElement('canvas')).writeAttribute({\n\t\t\t\t'width': canvasWidth,\n\t\t\t\t'height': canvasHeight\n\t\t\t}).setStyle({\n\t\t\t\t'position': 'absolute',\n\t\t\t\t'left': '0px',\n\t\t\t\t'top': '0px'\n\t\t\t});\n\t\t\ttarget.setStyle({cursor:'default'}).appendChild(overlay);\n\t\t\tif(Prototype.Browser.IE){\n\t\t\t\toverlay = $(window.G_vmlCanvasManager.initElement(overlay));\n\t\t\t}\t\t\t\n\t\t\toctx = overlay.getContext('2d');\n\t\t}","updateTransform() {\n if (this.sortableChildren && this.sortDirty) {\n this.sortChildren();\n }\n this._boundsID++;\n this.transform.updateTransform(this.parent.transform);\n // TODO: check render flags, how to process stuff here\n this.worldAlpha = this.alpha * this.parent.worldAlpha;\n for (var i = 0, j = this.children.length; i < j; ++i) {\n var child = this.children[i];\n if (child.visible) {\n child.updateTransform();\n }\n }\n }","function DisplayObject()\n{\n EventEmitter.call(this);\n\n /**\n * The coordinate of the object relative to the local coordinates of the parent.\n *\n * @member {PIXI.Point}\n */\n this.position = new math.Point();\n\n /**\n * The scale factor of the object.\n *\n * @member {PIXI.Point}\n */\n this.scale = new math.Point(1, 1);\n\n /**\n * The pivot point of the displayObject that it rotates around\n *\n * @member {PIXI.Point}\n */\n this.pivot = new math.Point(0, 0);\n\n\n /**\n * The skew factor for the object in radians.\n *\n * @member {PIXI.Point}\n */\n this.skew = new math.Point(0, 0);\n\n /**\n * The rotation of the object in radians.\n *\n * @member {number}\n */\n this.rotation = 0;\n\n /**\n * The opacity of the object.\n *\n * @member {number}\n */\n this.alpha = 1;\n\n /**\n * The visibility of the object. If false the object will not be drawn, and\n * the updateTransform function will not be called.\n *\n * @member {boolean}\n */\n this.visible = true;\n\n /**\n * Can this object be rendered, if false the object will not be drawn but the updateTransform\n * methods will still be called.\n *\n * @member {boolean}\n */\n this.renderable = true;\n\n /**\n * The display object container that contains this display object.\n *\n * @member {PIXI.Container}\n * @readOnly\n */\n this.parent = null;\n\n /**\n * The multiplied alpha of the displayObject\n *\n * @member {number}\n * @readOnly\n */\n this.worldAlpha = 1;\n\n /**\n * Current transform of the object based on world (parent) factors\n *\n * @member {PIXI.Matrix}\n * @readOnly\n */\n this.worldTransform = new math.Matrix();\n\n /**\n * The area the filter is applied to. This is used as more of an optimisation\n * rather than figuring out the dimensions of the displayObject each frame you can set this rectangle\n *\n * @member {PIXI.Rectangle}\n */\n this.filterArea = null;\n\n /**\n * cached sin rotation\n *\n * @member {number}\n * @private\n */\n this._sr = 0;\n\n /**\n * cached cos rotation\n *\n * @member {number}\n * @private\n */\n this._cr = 1;\n\n /**\n * The original, cached bounds of the object\n *\n * @member {PIXI.Rectangle}\n * @private\n */\n this._bounds = new math.Rectangle(0, 0, 1, 1);\n\n /**\n * The most up-to-date bounds of the object\n *\n * @member {PIXI.Rectangle}\n * @private\n */\n this._currentBounds = null;\n\n /**\n * The original, cached mask of the object\n *\n * @member {PIXI.Rectangle}\n * @private\n */\n this._mask = null;\n}","transformed(transform){\n let result = new AffineTransform();\n\n result.position = this.position.copy();\n result.position.mult(transform.scale);\n\n let rotated = new p5.Vector(result.position.x, result.position.y).rotate(transform.rotation);\n\n result.position.x = rotated.x;\n result.position.y = rotated.y;\n result.position.add(transform.position);\n\n result.scale = this.scale.copy();\n result.scale.mult(transform.scale);\n\n result.rotation = this.rotation + transform.rotation;\n\n return result;\n }","function CameraCommand_Scroll_TransformToParent(parent, bClip)\n{\n\t//copy the target area\n\tvar newArea = new Position_Rect(this.ScrollArea.left, this.ScrollArea.top, this.ScrollArea.width, this.ScrollArea.height);\n\t//transform it to the parent\n\tnewArea.TransformToParent(this.ScrollTarget, parent);\n\t//want to clip?\n\tif (bClip)\n\t{\n\t\t//do we have a scroll target?\n\t\tif (this.ScrollTarget)\n\t\t{\n\t\t\t//get the html parent\n\t\t\tvar htmlParent = Get_HTMLObject(this.ScrollTarget);\n\t\t\t//still valid?\n\t\t\tif (htmlParent)\n\t\t\t{\n\t\t\t\t//fit to parent\n\t\t\t\tnewArea.FitToParent(this.ScrollTarget, htmlParent);\n\t\t\t}\n\t\t}\n\t}\n\t//return it\n\treturn newArea;\n}","clear() {\n this.context.setTransform(1, 0, 0, 1, 0, 0);\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\n }","clear() {\n this.context.setTransform(1, 0, 0, 1, 0, 0);\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\n }","display() {\n push();\n // Filter goes from transparent to more opaque\n this.fill.alpha += this.fill.alphaChangeRate;\n this.fill.alpha = constrain(this.fill.alpha, 0, this.fill.finalAlpha);\n // Draw a rectangle\n rectMode(CORNER);\n fill(this.fill.r, this.fill.g, this.fill.b, this.fill.alpha);\n rect(this.x, this.y, this.length, this.height);\n pop();\n }","function Transform() {}","function Transform() {}","function Transform() {}","function Transform() {}","function Transform() {}","function confineInContainer(position, width, height, api) {\n var viewWidth = api.getWidth();\n var viewHeight = api.getHeight();\n position[0] = Math.min(position[0] + width, viewWidth) - width;\n position[1] = Math.min(position[1] + height, viewHeight) - height;\n position[0] = Math.max(position[0], 0);\n position[1] = Math.max(position[1], 0);\n}","function factory() {\n\n var Atomic = require('atomic'),\n $ = require('jquery'),\n CarouselWithButtons;\n\n /**\n * The carousel with buttons is a mashery of carousel and buttons, and is\n * a great example of how you can put smaller pieces together to make a\n * reusable \"larger piece\". In the class description, you should also explain\n * the contract expected by this object.\n *\n * CarouselWithButtons expects the following nodes to exist within the\n * top level element:\n * - .carousel will be turned into a carousel Component\n * - .next all references will be turned into buttons that advance the carousel\n * - .prev all references will be turned into buttons that rewind the carousel\n *\n * @class CarouselWithButtons\n * @extends AbstractComposite\n */\n CarouselWithButtons = Atomic.OOP.extend(Atomic.AbstractComposite, function (base) {\n return {\n /**\n * Declares dependencies used within this Composite\n * @requires components/carousel\n * @requires components/button\n */\n has: {\n Carousel: 'components/carousel',\n Button: 'components/button'\n },\n\n /**\n * Declares \"actors\", additional HTML Elements required\n * usually all actors need to be fulfilled for a\n * Composite to work correctly.\n */\n actors: ['Carousel', 'Next', 'Previous'],\n\n // this Composite has no events unique to itself\n events: {},\n\n /**\n * method ran in response to an external load() call\n * @see AbstractComposite#load\n */\n modify: function (done, resolved, actors) {\n var $el = $(this.ELEMENT),\n Carousel = resolved.Carousel,\n Button = resolved.Button,\n carousel = new Carousel(actors.Carousel),\n self = this;\n\n // expose a jQuery wrapped object\n // While not required, this is a good practice if\n // you want to reuse the jQuery object\n this.$el = $el;\n\n // We are comfortable as the composite maintainer\n // with people maniuplaing the carousel directly\n // via its public APIs and listening to its methods\n // As a developer, you should ensure carousel has\n // all the necessary events so that CarouselWithButtons\n // can tell when its carousel changes.\n this.carousel = carousel;\n\n // Private members can help lend insights into\n // the object's inner workings\n // External groups shouldn't call these, but they may\n // wish to console.log them\n this._nextButtons = [];\n this._prevButtons = [];\n\n // maybe we want to store the resolved object\n // for other methods in CarouselWithButtons\n this._Carousel = Carousel;\n\n // gotta bind them all\n // In order to improve debugging, remember to add\n // these objects to the _nextButtons and _prevButtons\n $.each(actors.Next, function (idx, nextEl) {\n var btn = new Button(nextEl);\n self._nextButtons.push(btn);\n carousel.bind(btn, btn.events.USE, 'next');\n btn.load();\n });\n $.each(actors.Previous, function (idx, prevEl) {\n var btn = new Button(prevEl);\n self._prevButtons.push(btn);\n carousel.bind(btn, btn.events.USE, 'previous');\n btn.load();\n });\n\n carousel.load(function () {\n done();\n });\n }\n };\n });\n\n return CarouselWithButtons;\n}","applyCurrentTransform () {\n this.tempPosition.set(this.position);\n this.tempOrientation = this.orientation;\n this.tempScale.set(this.scale);\n }","apply(){\n var transform = mat4.create();\n mat4.identity(transform);\n\n mat4.translate(transform, transform, [this.x_center,this.y_center,this.z_center]);\n mat4.rotate(transform, transform, this.elapsedAngle, [0, 1, 0]);\n\n mat4.translate(transform,transform,[this.radius,0,0]);\n\n if(this.direction == 1){\n mat4.rotate(transform,transform,Math.PI,[0,1,0]);\n }\n return transform;\n }","function DisplayObject()\n{\n this.last = this;\n this.first = this;\n /**\n * The coordinate of the object relative to the local coordinates of the parent.\n *\n * @property position\n * @type Point\n */\n this.position = new Point();\n\n /**\n * The scale factor of the object.\n *\n * @property scale\n * @type Point\n */\n this.scale = new Point(1,1);//{x:1, y:1};\n\n /**\n * The pivot point of the displayObject that it rotates around\n *\n * @property pivot\n * @type Point\n */\n this.pivot = new Point(0,0);\n\n /**\n * The rotation of the object in radians.\n *\n * @property rotation\n * @type Number\n */\n this.rotation = 0;\n\n /**\n * The opacity of the object.\n *\n * @property alpha\n * @type Number\n */\n this.alpha = 1;\n\n /**\n * The visibility of the object.\n *\n * @property visible\n * @type Boolean\n */\n this.visible = true;\n\n /**\n * This is the defined area that will pick up mouse / touch events. It is null by default.\n * Setting it is a neat way of optimising the hitTest function that the interactionManager will use (as it will not need to hit test all the children)\n *\n * @property hitArea\n * @type Rectangle|Circle|Ellipse|Polygon\n */\n this.hitArea = null;\n\n /**\n * This is used to indicate if the displayObject should display a mouse hand cursor on rollover\n *\n * @property buttonMode\n * @type Boolean\n */\n this.buttonMode = false;\n\n /**\n * Can this object be rendered\n *\n * @property renderable\n * @type Boolean\n */\n this.renderable = false;\n\n /**\n * [read-only] The display object container that contains this display object.\n *\n * @property parent\n * @type DisplayObjectContainer\n * @readOnly\n */\n this.parent = null;\n\n /**\n * [read-only] The stage the display object is connected to, or undefined if it is not connected to the stage.\n *\n * @property stage\n * @type Stage\n * @readOnly\n */\n this.stage = null;\n\n /**\n * [read-only] The multiplied alpha of the displayobject\n *\n * @property worldAlpha\n * @type Number\n * @readOnly\n */\n this.worldAlpha = 1;\n\n /**\n * [read-only] Whether or not the object is interactive, do not toggle directly! use the `interactive` property\n *\n * @property _interactive\n * @type Boolean\n * @readOnly\n * @private\n */\n this._interactive = false;\n\n this.defaultCursor = 'pointer';\n\n /**\n * [read-only] Current transform of the object based on world (parent) factors\n *\n * @property worldTransform\n * @type Mat3\n * @readOnly\n * @private\n */\n this.worldTransform = mat3.create();//mat3.identity();\n\n /**\n * [read-only] Current transform of the object locally\n *\n * @property localTransform\n * @type Mat3\n * @readOnly\n * @private\n */\n this.localTransform = mat3.create();//mat3.identity();\n\n /**\n * [NYI] Unkown\n *\n * @property color\n * @type Array<>\n * @private\n */\n this.color = [];\n\n /**\n * [NYI] Holds whether or not this object is dynamic, for rendering optimization\n *\n * @property dynamic\n * @type Boolean\n * @private\n */\n this.dynamic = true;\n\n // chach that puppy!\n this._sr = 0;\n this._cr = 1;\n\n\n this.filterArea = new Rectangle(0,0,1,1);\n\n /*\n * MOUSE Callbacks\n */\n\n /**\n * A callback that is used when the users clicks on the displayObject with their mouse\n * @method click\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user clicks the mouse down over the sprite\n * @method mousedown\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user releases the mouse that was over the displayObject\n * for this callback to be fired the mouse must have been pressed down over the displayObject\n * @method mouseup\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user releases the mouse that was over the displayObject but is no longer over the displayObject\n * for this callback to be fired, The touch must have started over the displayObject\n * @method mouseupoutside\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the users mouse rolls over the displayObject\n * @method mouseover\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the users mouse leaves the displayObject\n * @method mouseout\n * @param interactionData {InteractionData}\n */\n\n\n /*\n * TOUCH Callbacks\n */\n\n /**\n * A callback that is used when the users taps on the sprite with their finger\n * basically a touch version of click\n * @method tap\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user touch's over the displayObject\n * @method touchstart\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user releases a touch over the displayObject\n * @method touchend\n * @param interactionData {InteractionData}\n */\n\n /**\n * A callback that is used when the user releases the touch that was over the displayObject\n * for this callback to be fired, The touch must have started over the sprite\n * @method touchendoutside\n * @param interactionData {InteractionData}\n */\n}","compileImpl(cache)\n {\n // small helper to format info and error messages\n var _ = (c) => {\n return 'id=' + (c.id || '') + '|name=' + (c.name || '');\n };\n\n // the common implementation for all components\n var impl = (comp, cache, ids, names, kind) => {\n // at least one of ID and name mandatory\n if ( ! comp.name && ! comp.id ) {\n throw new Error('No ID and no name on ' + kind.kind + ' in ' + cache.href);\n }\n // default value for compose\n if ( ! comp.compose ) {\n comp.compose = 'merge';\n }\n // does it exist yet?\n var derived =\n ( comp.id && ids[comp.id] )\n || ( comp.name && names[comp.name] );\n // if it does, perform the \"compose\" action..\n if ( derived ) {\n if ( derived.compose !== comp.compose ) {\n throw new Error('Different compose actions for ' + kind.kind + 's: derived:'\n + _(derived) + '|compose=' + derived.compose + ' and base:'\n + _(comp) + '|compose=' + comp.compose);\n }\n else if ( derived.compose === 'merge' ) {\n this.ctxt.display.info('Merge ' + kind.kind + 's derived:' + _(derived) + ' and base:' + _(comp));\n var overriden = Object.keys(derived);\n for ( var p in comp ) {\n if ( overriden.indexOf(p) === -1 ) {\n derived[p] = comp[p];\n if ( p === 'id' ) {\n ids[derived.id] = derived;\n }\n else if ( p === 'name' ) {\n names[derived.name] = derived;\n }\n }\n else {\n derived[p] = kind.merge(p, derived[p], comp[p]);\n }\n }\n }\n else if ( derived.compose === 'hide' ) {\n this.ctxt.platform.info('Hide ' + kind.kind + ' base:' + _(comp) + ' by derived:' + _(derived));\n }\n else {\n throw new Error('Unknown compose on ' + kind.kind + ': ' + _(derived) + '|compose=' + derived.compose);\n }\n }\n // ...if it does not, just add it\n else {\n cache.push(comp);\n if ( comp.id ) {\n ids[comp.id] = comp;\n }\n if ( comp.name ) {\n names[comp.name] = comp;\n }\n }\n };\n\n // compile hosts\n if ( this.json.hosts ) {\n this.json.hosts.forEach(host => {\n impl(host, cache.hosts, null, cache.hostNames, cmp.Host);\n });\n }\n // compile databases\n if ( this.json.databases ) {\n this.json.databases.forEach(db => {\n impl(db, cache.dbs, cache.dbIds, cache.dbNames, cmp.Database);\n });\n }\n // compile servers\n if ( this.json.servers ) {\n this.json.servers.forEach(srv => {\n impl(srv, cache.srvs, cache.srvIds, cache.srvNames, cmp.Server);\n });\n }\n // compile sources\n if ( this.json.sources ) {\n this.json.sources.forEach(src => {\n impl(src, cache.srcs, null, cache.srcNames, cmp.SourceSet);\n });\n }\n // compile mime types\n if ( this.json['mime-types'] ) {\n this.json['mime-types'].forEach(mime => {\n impl(mime, cache.mimes, null, cache.mimeNames, cmp.MimeType);\n });\n }\n // compile privileges\n if ( this.json.privileges ) {\n const each = (privs, cache, names) => {\n if ( privs ) {\n privs.forEach(priv => {\n impl(priv, cache, null, names, cmp.Privilege);\n });\n }\n };\n each(this.json.privileges.execute, cache.execPrivs, cache.execPrivNames);\n each(this.json.privileges.uri, cache.uriPrivs, cache.uriPrivNames);\n }\n // compile roles\n if ( this.json.roles ) {\n this.json.roles.forEach(role => {\n impl(role, cache.roles, null, cache.roleNames, cmp.Role);\n });\n }\n // compile users\n if ( this.json.users ) {\n this.json.users.forEach(user => {\n impl(user, cache.users, null, cache.userNames, cmp.User);\n });\n }\n // recurse on imports\n this.imports.forEach(i => {\n cache.href = i.path;\n i.compileImpl(cache);\n });\n }","isAllBlend() {\n if (this.__transparentPrimitives.length > 0 && this.__opaquePrimitives.length === 0) {\n return true;\n }\n else {\n return false;\n }\n }","constructor() {\n super(\"position\", \"normal\", \"texture_coord\");\n // Loop 3 times (for each axis), and inside loop twice (for opposing cube sides):\n for (var i = 0; i < 3; i++)\n for (var j = 0; j < 2; j++) {\n var square_transform = Mat4.rotation(\n i == 0 ? Math.PI / 2 : 0,\n Vec.of(1, 0, 0)\n )\n .times(\n Mat4.rotation(\n Math.PI * j - (i == 1 ? Math.PI / 2 : 0),\n Vec.of(0, 1, 0)\n )\n )\n .times(Mat4.translation([0, 0, 1]));\n // Calling this function of a Square (or any Shape) copies it into the specified\n // Shape (this one) at the specified matrix offset (square_transform):\n Square.insert_transformed_copy_into(this, [], square_transform);\n }\n }","isCombined() {\n return this.content & Content.IS_COMBINED_MASK;\n }","function cardComp (headline, authorPhoto, authorName) {\n const card= document.createElement('div')\n card.classList.add('card')\n\n card.appendChild(headlineComp(headline))\n card.appendChild(authorComp(authorPhoto, authorName))\n \n return card\n}","function CanvasProjectionOverlay(){}"],"string":"[\n \"function composite(src, ops) {\\n console.log('composite operations');\\n console.log(ops);\\n\\n var mat = Matrix3x3.identity();\\n for(var i=0;i\\n ) : (\\n \\n );\\n}\",\n \"function NeactCompositeComponent(element) {\\n this.key = element.key;\\n this.type = element.type;\\n this.props = element.props;\\n this._currentElement = element;\\n this._context = null;\\n var instance = this._getInstance();\\n this._instance = instance;\\n //this.elm = instance;\\n //this.dom = instance;\\n //Component.call(this, element);\\n //this.elm = null;\\n this.dom = null;\\n this._instance._instanceCompositeComponent = this;\\n}\",\n \"recompositeCanvases() {\\n const mainctx = this.mainCanvas.getContext('2d');\\n\\n for (let i = 0; i < this.canvas.length; i++) {\\n const tempctx = this.canvas[i].temp.getContext('2d');\\n const drawctxNext = this.canvas[i + 1] !== undefined ? this.canvas[i + 1].draw.getContext('2d') : null;\\n\\n if (drawctxNext !== null) {\\n // Clear [i + 1].draw\\n this.canvas[i + 1].draw.width = this.canvas[i + 1].draw.width;\\n\\n // Stamp [i].temp to [i + 1].draw\\n drawctxNext.globalCompositeOperation = 'source-over';\\n drawctxNext.drawImage(this.canvas[i].temp, 0, 0);\\n }\\n\\n // Stamp [i].draw to [i].temp\\n tempctx.globalCompositeOperation = 'source-over';\\n tempctx.drawImage(this.canvas[i].draw, 0, 0);\\n\\n if (drawctxNext !== null) {\\n // Stamp [i].draw to [i + 1].draw (destination-in)\\n drawctxNext.globalCompositeOperation = 'destination-in';\\n drawctxNext.drawImage(this.canvas[i].draw, 0, 0);\\n }\\n\\n // The image\\n const img = this.images[i].img;\\n\\n // Calculate ratio to scale image to canvas\\n let widthRatio, heightRatio, ratio = 1;\\n\\n if (img.width > this.mainCanvas.width || img.height > this.mainCanvas.height) {\\n widthRatio = this.mainCanvas.width / img.width;\\n heightRatio = this.mainCanvas.height / img.height;\\n ratio = Math.min(widthRatio, heightRatio);\\n }\\n\\n // Calculate centered image position\\n const centerX = ( this.mainCanvas.width - img.width * ratio ) / 2;\\n const centerY = ( this.mainCanvas.height - img.height * ratio ) / 2;\\n\\n // Stamp image[i] to [i].temp (source-atop)\\n tempctx.globalCompositeOperation = 'source-atop';\\n tempctx.drawImage(img, 0, 0, img.width, img.height, centerX, centerY, img.width * ratio, img.height * ratio);\\n\\n // Stamp [i].temp to mainCanvas\\n mainctx.drawImage(this.canvas[i].temp, 0, 0);\\n }\\n\\n }\",\n \"compose(o) {\\n if (o.origin) {\\n o.originX = o.origin[0];\\n o.originY = o.origin[1];\\n } // Get the parameters\\n\\n\\n var ox = o.originX || 0;\\n var oy = o.originY || 0;\\n var sx = o.scaleX || 1;\\n var sy = o.scaleY || 1;\\n var lam = o.shear || 0;\\n var theta = o.rotate || 0;\\n var tx = o.translateX || 0;\\n var ty = o.translateY || 0; // Apply the standard matrix\\n\\n var result = new Matrix_Matrix().translateO(-ox, -oy).scaleO(sx, sy).shearO(lam).rotateO(theta).translateO(tx, ty).lmultiplyO(this).translateO(ox, oy);\\n return result;\\n }\",\n \"function PdfCompositeField(font,brush,text){var list=[];for(var _i=3;_i {\\n // Memoization should be helpful when parts of the tree are the same.\\n let subTree = Object.entries(obj).map(([i, v], index) => {\\n // i, v are key and value.\\n if ((hideTypes && i === \\\"type\\\") || (hideLocation && i === \\\"loc\\\")) {\\n return [v, null];\\n }\\n return [\\n v,\\n \\n {typeof v === \\\"object\\\" && v !== null ? (\\n \\n ) : (\\n \\n )}\\n ,\\n ];\\n });\\n subTree = sortTree\\n ? subTree.sort((former, latter) => {\\n return sortByCompositeness(former[0], latter[0]);\\n })\\n : subTree;\\n return subTree.map(v => v[1]);\\n }, [obj, cursor, setPos, hideTypes, hideLocation, sortTree]);\\n\\n const { type, loc, value, name } = obj;\\n const label = type ? type : k;\\n const keys = Object.keys(obj);\\n const { toggled } = other;\\n const defaultActiveIndex = toggled ?? (label === \\\"Program\\\" ? 0 : null);\\n const [active, setActive] = useState(!!defaultActiveIndex);\\n const highlight = useMemo(() => {\\n return (\\n (value !== undefined || name !== undefined || !active) &&\\n isBound(cursor, loc)\\n );\\n }, [active, cursor, loc, value, name]);\\n\\n const popup = lookUpNodeType(type);\\n const title = `${label} : ${active ? \\\"\\\" : `{ ${keys.join(\\\", \\\")} }`}`;\\n const panels = [\\n {\\n key: 0,\\n title: (\\n }\\n on=\\\"hover\\\"\\n trigger={{title}}\\n />\\n ) : (\\n title\\n )\\n }\\n />\\n ),\\n content,\\n },\\n ];\\n\\n const props = {\\n onTitleClick: () => {\\n loc && setPos(fixLoc(loc));\\n setActive(active => !active);\\n },\\n panels,\\n defaultActiveIndex,\\n };\\n\\n return keys.length ? (\\n \\n ) : hideEmpty ? null : (\\n \\n );\\n}\",\n \"function CompositeFilter(operator, filters){\\n this.operator = operator;\\n this.filters = filters;\\n\\n this.getFilterType = function(){\\n return 'compositeFilter';\\n };\\n\\n this.getFilter = function(){\\n return this;\\n };\\n\\n }\",\n \"function isComposite(p){\\n return p.expression().count() > 1;\\n }\",\n \"function CompositeArr({ k, arr, cursor, setPos }) {\\n const { hideEmpty } = useContext(SettingsContext);\\n // setPos is memoized so dependency is just to placate warnings.\\n const components = useMemo(() => {\\n // Memoization should be helpful when parts of the tree are the same.\\n return arr.map((value, index) => {\\n return (\\n \\n {typeof value === \\\"object\\\" && value !== null ? (\\n \\n ) : (\\n \\n )}\\n \\n );\\n });\\n }, [k, arr, cursor, setPos]);\\n\\n // Arrays are toggled by default as well as single elements within.\\n const [active, setActive] = useState(true);\\n const highlight = useMemo(() => {\\n return !active && arr.some(x => x && isBound(cursor, x.loc));\\n }, [active, arr, cursor]);\\n const panels = [\\n {\\n key: 0,\\n title: (\\n \\n ),\\n content: components,\\n },\\n ];\\n\\n const props = {\\n highlight: highlight ? 1 : 0,\\n onTitleClick: () => {\\n setActive(active => !active);\\n },\\n panels,\\n defaultActiveIndex: 0,\\n };\\n\\n return arr.length ? (\\n \\n ) : hideEmpty ? null : (\\n \\n );\\n}\",\n \"function CompositePropertyView(options) {\\n this.initialize.apply(this, [options]);\\n }\",\n \"function editOnCompositionStart(){this.setRenderGuard();this.setMode('composite');this.update(EditorState.set(this.props.editorState,{inCompositionMode:true}));}\",\n \"function editOnCompositionStart() {\\n\\t this.setRenderGuard();\\n\\t this.setMode('composite');\\n\\t this.update(EditorState.set(this.props.editorState, { inCompositionMode: true }));\\n\\t}\",\n \"process(\\n painter,\\n helper,\\n input0 = null,\\n input1 = null,\\n input2 = null,\\n input3 = null\\n ) {\\n this.compositeEffect.texture = input0\\n this.compositeEffect.getLayerAt(1).texture = input1\\n this.compositeEffect.getLayerAt(2).texture = input2\\n this.compositeEffect.getLayerAt(3).texture = input3\\n\\n if (input1)\\n input1.setupTextureCoordinates(this.vertexData, 0, 'texCoords1', true)\\n if (input2)\\n input2.setupTextureCoordinates(this.vertexData, 0, 'texCoords2', true)\\n if (input3)\\n input3.setupTextureCoordinates(this.vertexData, 0, 'texCoords3', true)\\n\\n return super.process(painter, helper, input0, input1, input2, input3)\\n }\",\n \"function CompositeComponent(component) {\\r\\n this._currentElement = component;\\r\\n\\r\\n // returns instances of DomComponent or CompositeComponent\\r\\n\\r\\n this._compositeMount = instance => {\\r\\n let el = instance.render();\\r\\n\\r\\n if (typeof el.type === \\\"string\\\") {\\r\\n return new DomComponent(el);\\r\\n }\\r\\n\\r\\n return new CompositeComponent(el);\\r\\n };\\r\\n\\r\\n this.mount = container => {\\r\\n this._instance = new this._currentElement.type(this._currentElement.props);\\r\\n\\r\\n if (this._instance.componentWillMount) {\\r\\n this._instance.componentWillMount();\\r\\n }\\r\\n this.renderedElement = this._compositeMount(this._instance);\\r\\n\\r\\n React.Reconciler.mount(this.renderedElement, container);\\r\\n\\r\\n if (this._instance.componentDidMount) {\\r\\n this._instance.componentDidMount();\\r\\n }\\r\\n };\\r\\n\\r\\n this.update = newElement => {\\r\\n const nextProps = newElement.props;\\r\\n\\r\\n this._currentElement = newElement;\\r\\n\\r\\n if (this._instance.willComponentReceiveProps) {\\r\\n this._instance.willComponentReceiveProps(nextProps);\\r\\n }\\r\\n\\r\\n let shouldUpdate = true;\\r\\n\\r\\n if (this._instance.shouldComponentUpdate) {\\r\\n shouldUpdate = this._instance.shouldComponentUpdate(nextProps);\\r\\n }\\r\\n\\r\\n this._instance.props = nextProps;\\r\\n\\r\\n if (shouldUpdate) {\\r\\n let newRendredElement = this._instance.render();\\r\\n\\r\\n React.Reconciler.update(this.renderedElement, newRendredElement);\\r\\n }\\r\\n };\\r\\n}\",\n \"function Composition() {}\",\n \"function Composition() {}\",\n \"function Composition() {}\",\n \"function Composition() {}\",\n \"function exportCompositeCollection(){\\r\\n \\r\\n \\r\\n var defaultArgs = {\\r\\n 'exportPathRoot':null,\\r\\n 'outputName':null,\\r\\n 'studyArea':null, \\r\\n 'crs':null,\\r\\n 'transform':null,\\r\\n 'scale':null,\\r\\n 'collection':null,\\r\\n 'startYear':null,\\r\\n 'endYear':null,\\r\\n 'startJulian':null,\\r\\n 'endJulian':null,\\r\\n 'compositingMethod':null,\\r\\n 'timebuffer':null,\\r\\n 'exportBands':null,\\r\\n 'toaOrSR':null,\\r\\n 'weights':null,\\r\\n 'applyCloudScore':null, \\r\\n 'applyFmaskCloudMask':null,\\r\\n 'applyTDOM':null,\\r\\n 'applyFmaskCloudShadowMask':null,\\r\\n 'applyFmaskSnowMask':null,\\r\\n 'includeSLCOffL7':null,\\r\\n 'correctIllumination':null,\\r\\n 'nonDivideBands':['temp'],\\r\\n 'resampleMethod':'near',\\r\\n 'origin':'Landsat',\\r\\n 'applyCloudProbability':null\\r\\n };\\r\\n \\r\\n var args = prepArgumentsObject(arguments,defaultArgs);\\r\\n \\r\\n args.pyramidingPolicy = 'mean';\\r\\n \\r\\n args.collection = args.collection.select(args.exportBands);\\r\\n print('Export bands:',args.exportBands);\\r\\n print('Non divide bands:',args.nonDivideBands);\\r\\n //Take care of date wrapping\\r\\n args.dateWrapping = wrapDates(args.startJulian,args.endJulian);\\r\\n args.wrapOffset = args.dateWrapping[0];\\r\\n args.yearWithMajority = args.dateWrapping[1];\\r\\n \\r\\n //Clean up output name\\r\\n args.outputName = args.outputName.replace(/\\\\s+/g,'-');\\r\\n args.outputName = args.outputName.replace(/\\\\//g,'-');\\r\\n \\r\\n \\r\\n var years = ee.List.sequence(args.startYear+args.timebuffer,args.endYear-args.timebuffer).getInfo()\\r\\n .map(function(year){\\r\\n \\r\\n // Set up dates\\r\\n var startYearT = year-args.timebuffer;\\r\\n var endYearT = year+args.timebuffer+args.yearWithMajority;\\r\\n \\r\\n // Get yearly composite\\r\\n var composite = args.collection.filter(ee.Filter.calendarRange(year+args.yearWithMajority,year+args.yearWithMajority,'year'));\\r\\n composite = ee.Image(composite.first());\\r\\n \\r\\n \\r\\n \\r\\n // Reformat data for export\\r\\n var compositeBands = composite.bandNames();\\r\\n if(args.nonDivideBands !== null){\\r\\n var composite10k = composite.select(compositeBands.removeAll(args.nonDivideBands))\\r\\n .multiply(10000);\\r\\n composite = composite10k.addBands(composite.select(args.nonDivideBands))\\r\\n .select(compositeBands).int16();\\r\\n }\\r\\n else{\\r\\n composite = composite.multiply(10000).int16();\\r\\n }\\r\\n \\r\\n \\r\\n args.startYearComposite = startYearT;\\r\\n args.endYearComposite = endYearT;\\r\\n args.systemTimeStartYear = year+args.yearWithMajority;\\r\\n args.yearOriginal = year;\\r\\n args.yearUsed = args.systemTimeStartYear;\\r\\n args['system:time_start'] = ee.Date.fromYMD(args.systemTimeStartYear,6,1).millis();\\r\\n \\r\\n \\r\\n // Export the composite \\r\\n // Set up export name and path\\r\\n args.exportName = args.outputName + '_' + args.toaOrSR + '_' + args.compositingMethod + \\r\\n '_' + startYearT + '_' + endYearT+'_' + \\r\\n args.startJulian + '_' + args.endJulian ;\\r\\n \\r\\n args.exportPath = args.exportPathRoot + '/' + args.exportName;\\r\\n \\r\\n // Add metadata, cast to integer, and export composite\\r\\n composite = composite.set(args);\\r\\n \\r\\n // Display the Landsat composite\\r\\n Map.addLayer(composite, vizParamsTrue10k, args.yearUsed.toString() + ' True Color ' + \\r\\n args.toaOrSR, false);\\r\\n Map.addLayer(composite, vizParamsFalse10k, args.yearUsed.toString() + ' False Color ' + \\r\\n args.toaOrSR, false);\\r\\n \\r\\n \\r\\n print('Exporting:',composite);\\r\\n exportToAssetWrapper(composite,args.exportName,args.exportPath,args.pyramidingPolicy,\\r\\n args.studyArea,args.scale,args.crs,args.transform);\\r\\n });\\r\\n}\",\n \"function Ci(a,b,c){if(c){var d=document.createDocumentFragment(),e=!b.hasAttribute(\\\"viewBox\\\")&&c.getAttribute(\\\"viewBox\\\");e&&b.setAttribute(\\\"viewBox\\\",e);for(b=c.cloneNode(!0);b.childNodes.length;)d.appendChild(b.firstChild);a.appendChild(d)}}\",\n \"render(context, object, elapsedTime, clipping, player) {\\n if (!this.image.complete) return;\\n let center = player.center;\\n // if (clipping.offset.y === 0) {\\n // this.renderToOverlay(context, object, elapsedTime, clipping, center);\\n // }\\n\\n if (clipping) {\\n if (clipping.offset.y === 0) {\\n this.renderToTempCanvas(context, object, elapsedTime, clipping, center);\\n }\\n clipping.offset.y = clipping.offset.y - (this.ul.y - object.position.y);\\n\\n // TRICKY: subtract 1 since clipping adds 1 to height by default to avoid artifacts on most other images\\n let height = Math.min(clipping.dimensions.height, this.canvas.height - clipping.offset.y) - 1;\\n // if (window.debug) {\\n // context.lineWidth = 1;\\n // context.strokeStyle = \\\"red\\\";\\n // context.strokeRect(this.ul.x + clipping.offset.x, this.ul.y + clipping.offset.y, this.canvas.width, height);\\n // }\\n\\n context.drawImage(this.canvas, clipping.offset.x, clipping.offset.y, this.canvas.width, height,\\n this.ul.x + clipping.offset.x, this.ul.y + clipping.offset.y, this.canvas.width, height);\\n } else {\\n this.renderToTempCanvas(context, object, elapsedTime, clipping, center);\\n context.drawImage(this.canvas, 0, 0, this.canvas.width, this.canvas.height,\\n this.ul.x, this.ul.y, context.canvas.width, context.canvas.height);\\n }\\n }\",\n \"enterNewCompositeDefinition(ctx) {\\n\\t}\",\n \"function ClipBox(args){\\n\\tthis.element = null;\\n\\tthis.container = null;\\n\\tthis.angle = 90;\\n\\tthis.constrainParent = true;\\n\\tthis._determineInnerWidth = null;\\n\\tthis._determineInnerHeight = null;\\n\\tthis._determineOuterWidth = null;\\n\\tthis._determineOuterHeight = null;\\n\\tthis.outer = { 'width' : 0, 'height' : 0 };\\n\\tthis.inner = { 'width' : 0, 'height' : 0 };\\n\\tthis.working = new CoordinatesBox();\\n\\tvar isGood = this.init(args);\\n\\tif(isGood){\\n\\t\\t$(this.element).css('visibility', 'visible');\\n\\t\\treturn this;\\n\\t} else {\\n\\t\\t(new IMDebugger()).pass(\\\"Unable to initialise ClipBox\\\");\\n\\t\\treturn false; }}\",\n \"function draw(ctx, objeto, trans, composite){\\n\\n var img = new Image();\\n img.src = objeto.rutaImagen;\\n img.onload = function() {\\n ctx.beginPath();\\n ctx.globalCompositeOperation = composite;\\n ctx.globalAlpha = trans;\\n ctx.drawImage(img,objeto.x, objeto.y,objeto.w,objeto.h); //Deberia ser height y weight???\\n };\\n}\",\n \"_compute() {\\n\\n // build the css layer depending on the properties\\n this._style = this._props.opacity !== defaults.opacity ? `opacity(${this._props.opacity}) ` : '';\\n this._style += this._props.brightness !== defaults.brightness ? `brightness(${this._props.brightness}) ` : '';\\n this._style += this._props.contrast !== defaults.contrast ? `contrast(${this._props.contrast}) ` : '';\\n this._style += this._props.saturation !== defaults.saturation ? `saturate(${this._props.saturation}) ` : '';\\n this._style += this._props.hue !== defaults.hue ? `hue-rotate(${this._props.hue}deg) ` : '';\\n this._style += this._props.invert !== defaults.invert ? `invert(${this._props.invert}) ` : '';\\n this._style += this._props.grayscale !== defaults.grayscale ? `grayscale(${this._props.grayscale}) ` : '';\\n this._style += this._props.sepia !== defaults.sepia ? `sepia(${this._props.sepia}) ` : '';\\n this._style += this._props.blur !== defaults.blur ? `blur(${this._props.blur}px) ` : '';\\n this._style += this._props.url !== defaults.url ? `url(${this._props.url}) ` : '';\\n\\n // apply the css filter effects to the viewport\\n this.viewport.style.filter = this._style;\\n\\n // build the blend layer depending on the properties\\n if (Object.keys(this._props.blend).length !== 0) {\\n\\n // create the blending element\\n if (typeof this._blend === 'undefined') {\\n this._blend = document.createElement('div');\\n\\n // prepend the blending element to the viewport\\n this.viewport.parentNode.insertBefore(this._blend, this.viewport);\\n }\\n\\n // get the viewport bounds\\n const bounds = this.viewport.getBoundingClientRect();\\n\\n // set the blending styles\\n this._blend.style = `position:absolute;z-index:1;width:${bounds.width}px;height:${bounds.height}px;mix-blend-mode:${this._props.blend.mode};background:${this._props.blend.color};pointer-events:none;`;\\n } else if (typeof this._blend !== 'undefined') {\\n\\n // remove the blend layer from the DOM if there is no blending applied\\n this._blend.parentNode.removeChild(this._blend);\\n delete this._blend;\\n }\\n }\",\n \"complicate() {\\n this.offset = { x: 0, y: 0 }\\n this.scale = { x: 1, y: 1 }\\n return this\\n }\",\n \"_updateTransform(parentTransform = new Matrix4()) {\\n const computedTransform = parentTransform.clone().multiplyRight(this.transform);\\n const didTransformChange = !computedTransform.equals(this.computedTransform);\\n\\n if (!didTransformChange) {\\n return;\\n }\\n\\n this.computedTransform = computedTransform;\\n\\n // Matrix4.clone(computedTransform, this.computedTransform);\\n\\n // Update the bounding volumes\\n const header = this._header;\\n\\n const content = this._header.content;\\n this._boundingVolume = createBoundingVolume(\\n header.boundingVolume,\\n this.computedTransform,\\n this._boundingVolume\\n );\\n if (this._contentBoundingVolume) {\\n this._contentBoundingVolume = createBoundingVolume(\\n content.boundingVolume,\\n this.computedTransform,\\n this._contentBoundingVolume\\n );\\n }\\n if (this._viewerRequestVolume) {\\n this._viewerRequestVolume = createBoundingVolume(\\n header.viewerRequestVolume,\\n this.computedTransform,\\n this._viewerRequestVolume\\n );\\n }\\n }\",\n \"function Canvas(canvas, image, baseline, boundingBox) {\\n var myCanvas = this;\\n\\n this.canvas = canvas;\\n this.width = canvas.width;\\n this.height = canvas.height;\\n this.ctx = canvas.getContext('2d');\\n\\n this.image = image;\\n\\n this.baseline = baseline;\\n this.boundingBox = boundingBox;\\n\\n this.dragging = false;\\n\\n this.scale = 1.0;\\n\\n this.panX = 0;\\n this.panY = 0;\\n\\n this.selectedCC = [];\\n\\n this.dragoffx = 0;\\n this.dragoffy = 0;\\n\\n this.image.img.onload = function(){\\n myCanvas.image.w = this.width;\\n myCanvas.image.h = this.height;\\n\\n\\n myCanvas.image.initialx = myCanvas.width/2 - this.width/2;\\n myCanvas.image.initialy = myCanvas.height/2 - this.height/2;\\n\\n myCanvas.image.x = myCanvas.image.initialx;\\n myCanvas.image.y = myCanvas.image.initialy;\\n\\n\\n if(this.width > this.height)\\n myCanvas.scale = myCanvas.width /this.width;\\n else\\n myCanvas.scale = myCanvas.height /this.height;\\n myCanvas.draw();\\n }\\n}\",\n \"function matrixMultiply() {\\n \\\"use strict\\\";\\n\\n var i;\\n var j;\\n var k;\\n\\n newComposite = new Array(composite.length);\\n\\n for (i = 0; i < newComposite.length; i += 1) {\\n newComposite[i] = new Array(newTransform[i].length);\\n for (j = 0; j < composite.length; j += 1) {\\n newComposite[i][j] = 0; // initialise to 0\\n for (k = 0; k < newTransform.length; k += 1) {\\n newComposite[i][j] += composite[i][k] * newTransform[k][j]; // multiply matrices together\\n }\\n }\\n }\\n composite = newComposite;\\n}\",\n \"function renderRec(container) {\\n\\t\\t\\t\\n\\t\\t\\tif (container.visible === false || container.alpha === 0) {\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (container.alpha < 1) {\\n\\t\\t\\t\\tctx.save();\\n\\t\\t\\t\\tctx.globalAlpha = container.alpha;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tcontainer.children.forEach(child => {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// (0) Check if visible.\\n\\t\\t\\t\\tif (child.visible == false) {\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// (1) Draw child.\\n\\t\\t\\t\\tctx.save();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (child.pos) {\\n\\t\\t\\t\\t\\tctx.translate(Math.round(child.pos.x), Math.round(child.pos.y));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (child.rotation) {\\n\\t\\t\\t\\t\\tctx.translate(child.pivot.x, child.pivot.y);\\n\\t\\t\\t\\t\\tctx.rotate(child.rotation * Math.PI / 180);\\n\\t\\t\\t\\t\\tctx.translate(- child.pivot.x, - child.pivot.y);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (child.scale) {\\n\\t\\t\\t\\t\\tctx.translate(child.pivot.x, child.pivot.y);\\n\\t\\t\\t\\t\\tctx.scale(child.scale.x, child.scale.y);\\n\\t\\t\\t\\t\\tctx.translate(- child.pivot.x, - child.pivot.y);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// TEXT.\\n\\t\\t\\t\\tif (child.text) {\\n\\t\\t\\t\\t\\tconst {font, fill, align} = child.style;\\n\\t\\t\\t\\t\\tconst {strokeStyle, strokeWidth} = child.stroke;\\n\\t\\t\\t\\t\\tif (font) ctx.font = font;\\n\\t\\t\\t\\t\\tif (fill) ctx.fillStyle = fill;\\n\\t\\t\\t\\t\\tif (align) ctx.textAlign = align;\\n\\t\\t\\t\\t\\tctx.fillText(child.text, 0, 0);\\n\\t\\t\\t\\t\\tif (strokeWidth !== 0) {\\n\\t\\t\\t\\t\\t\\tctx.strokeStyle = strokeStyle;\\n\\t\\t\\t\\t\\t\\tctx.lineWidth = strokeWidth;\\n\\t\\t\\t\\t\\t\\tctx.strokeText(child.text, 0, 0);\\n\\t\\t\\t\\t\\t\\tctx.stroke();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// TEXTURE.\\n\\t\\t\\t\\telse if (child.texture) {\\n\\t\\t\\t\\t\\tconst img = child.texture.img;\\n\\t\\t\\t\\t\\tif (child.tileW) {\\n\\t\\t\\t\\t\\t\\tctx.drawImage(\\n\\t\\t\\t\\t\\t\\t\\timg,\\n\\t\\t\\t\\t\\t\\t\\tchild.frame.x*child.tileW, // Source x.\\n\\t\\t\\t\\t\\t\\t\\tchild.frame.y*child.tileH, // Source y.\\n\\t\\t\\t\\t\\t\\t\\tchild.tileW, child.tileH, // Width and height.\\n\\t\\t\\t\\t\\t\\t\\t0, 0, // Destination x and y.\\n\\t\\t\\t\\t\\t\\t\\tchild.tileW, child.tileH // Destination w and h.\\n\\t\\t\\t\\t\\t\\t);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tctx.drawImage(img, 0, 0);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// RECTANGLE.\\n\\t\\t\\t\\telse if (child.fillRectangle) {\\n\\t\\t\\t\\t\\tconst {w, h} = child;\\n\\t\\t\\t\\t\\tctx.fillStyle = child.fillRectangle;\\n\\t\\t\\t\\t\\tctx.fillRect(0, 0, w, h);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// (2) Apply renderRec if child has children.\\n\\t\\t\\t\\tif (child.children) {\\n\\t\\t\\t\\t\\trenderRec(child);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tctx.restore();\\n\\t\\t\\t\\t\\n\\t\\t\\t});\\n\\t\\t\\t\\n\\t\\t\\tif (container.alpha < 1) {\\n\\t\\t\\t\\tctx.restore();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\",\n \"function Renderable() {\\n\\tthis.mPos = new Vec2(0, 0);\\n\\tthis.mSize = new Vec2(0, 0);\\n\\tthis.mOrigin = new Vec2(0, 0);\\n\\tthis.mAbsolute = false;\\n\\t\\n\\tthis.mDepth = 0;\\n\\t\\n\\tthis.mTransformation = new Matrix3();\\n\\tthis.mScale = new Vec2(1.0, 1.0);\\n\\tthis.mRotation = 0;\\n\\tthis.mSkew = new Vec2();\\n\\tthis.mAlpha = 1.0;\\n\\tthis.mCompositeOp = \\\"source-over\\\";\\n\\t\\n\\tthis.mLocalBoundingBox = new Polygon(); // the local bounding box is in object coordinates (no transformations applied)\\n\\tthis.mGlobalBoundingBox = new Polygon(); // the global bounding box is in world coordinates (transformations applied)\\n\\t\\n\\tthis.mLocalMask = new Polygon();\\n\\tthis.mGlobalMask = new Polygon();\\n}\",\n \"render() {\\n return \\n }\",\n \"function composeAll() {\\n for (var _len = arguments.length, composers = Array(_len), _key = 0; _key < _len; _key++) {\\n composers[_key] = arguments[_key];\\n }\\n\\n return function (BaseComponent) {\\n if ((0, _.getDisableMode)()) {\\n return _common_components.DummyComponent;\\n }\\n\\n if (BaseComponent === null || BaseComponent === undefined) {\\n throw new Error('Curry function of composeAll needs an input.');\\n }\\n\\n var FinalComponent = BaseComponent;\\n composers.forEach(function (composer) {\\n if (typeof composer !== 'function') {\\n throw new Error('Composer should be a function.');\\n }\\n\\n FinalComponent = composer(FinalComponent);\\n\\n if (FinalComponent === null || FinalComponent === undefined) {\\n throw new Error('Composer function should return a value.');\\n }\\n });\\n\\n FinalComponent.__OriginalBaseComponent = BaseComponent.__OriginalBaseComponent || BaseComponent;\\n\\n var stubbingMode = (0, _.getStubbingMode)();\\n\\n if (!stubbingMode) {\\n return FinalComponent;\\n }\\n\\n // return the stubbing mode.\\n var ResultContainer = function ResultContainer(props) {\\n // If there's an stub use it.\\n if (ResultContainer.__composerStub) {\\n var data = ResultContainer.__composerStub(props);\\n var finalProps = (0, _extends3.default)({}, props, data);\\n\\n return _react2.default.createElement(FinalComponent.__OriginalBaseComponent, finalProps);\\n }\\n\\n // if there's no stub, just use the FinalComponent.\\n var displayName = FinalComponent.displayName || FinalComponent.name;\\n return _react2.default.createElement(\\n 'span',\\n null,\\n '<' + displayName + ' />'\\n );\\n };\\n\\n (0, _utils.inheritStatics)(ResultContainer, FinalComponent);\\n\\n return ResultContainer;\\n };\\n}\",\n \"Blend() {}\",\n \"function Compound(){}\",\n \"processSurface(v,j) {\\n\\n let c = v.position;\\n let vtemp, vtemp1;\\n // console.log(c);\\n // c = new THREE.Vector3(0,0,0);\\n // geometry changes\\n vtemp = v.children[0].geometry.clone();\\n // vtemp = vtemp.applyMatrix( new THREE.Matrix4().makeRotationY(Math.PI/2) );\\n vtemp = vtemp.applyMatrix( new THREE.Matrix4().makeTranslation(c.x, c.y, c.z ));\\n // let vtemp = v.children[0].geometry;\\n vtemp1 = v.children[1].geometry;\\n // vtemp1 = vtemp1.applyMatrix( new THREE.Matrix4().makeRotationY(Math.PI/2) );\\n vtemp1 = vtemp1.clone().applyMatrix( new THREE.Matrix4().makeTranslation(c.x, c.y, c.z ));\\n // debug\\n // let mesh = new THREE.Mesh(vtemp1, new THREE.MeshBasicMaterial( {color:0xff0000,side: THREE.DoubleSide, wireframe: true}));\\n // v.children[0].material = new THREE.MeshBasicMaterial( {wireframe:true,color:0xff0000,side: THREE.DoubleSide});\\n // v.children[1].material = new THREE.MeshBasicMaterial( {wireframe:true,color:0x00ff00,side: THREE.DoubleSide});\\n // console.log({v});\\n // let test = v.clone();\\n // let nn = v.children[1].clone();\\n // nn.geometry = v.children[1].geometry.clone();\\n // nn.material = new THREE.MeshBasicMaterial( {color:0x00ff00,side: THREE.DoubleSide, wireframe: true});\\n // nn.position.copy(v.position);\\n \\n // nn.rotation.copy(v.rotation);\\n // nn.rotateX(Math.PI);\\n // nn.geometry.applyMatrix( new THREE.Matrix4().makeRotationX(Math.PI) );\\n\\n // console.log(v.rotation,'rot');\\n // nn.position.copy(v.position);\\n // nn.geometry.applyMatrix( new THREE.Matrix4().makeTranslation(v.position.x, v.position.y, v.position.z ) );\\n\\n // nn.geometry.applyMatrix( new THREE.Matrix4().makeTranslation(-v.position.x, -v.position.y, -v.position.z ) );\\n // nn.geometry.applyMatrix( new THREE.Matrix4().makeRotationX(Math.PI) );\\n // nn.geometry.applyMatrix( new THREE.Matrix4().makeTranslation(v.position.x, v.position.y, v.position.z ) );\\n\\n // console.log({v},{nn},{test});\\n // this.scene.add(test);\\n // if(j===1) {\\n // this.scene.add(test);\\n // this.scene.add(nn);\\n // this.scene.add( new THREE.AxesHelper( 20 ) );\\n // }\\n \\n // \\n // console.log({nn});\\n \\n\\n\\n let len = v.children[0].geometry.attributes.position.array.length/3;\\n let len1 = v.children[1].geometry.attributes.position.array.length/3;\\n // console.log(len,len1);\\n // fragment id\\n let offset = new Array(len).fill(j/100);\\n vtemp.addAttribute( 'offset', new THREE.BufferAttribute( new Float32Array(offset), 1 ) );\\n\\n let offset1 = new Array(len1).fill(j/100);\\n vtemp1.addAttribute( 'offset', new THREE.BufferAttribute( new Float32Array(offset1), 1 ) );\\n\\n // axis\\n let axis = getRandomAxis();\\n let axes = new Array(len*3).fill(0);\\n let axes1 = new Array(len1*3).fill(0);\\n for (let i = 0; i < len*3; i=i+3) {\\n axes[i] = axis.x;\\n axes[i+1] = axis.y;\\n axes[i+2] = axis.z;\\n }\\n vtemp.addAttribute( 'axis', new THREE.BufferAttribute( new Float32Array(axes), 3 ) );\\n // volume axes\\n for (let i = 0; i < len1*3; i=i+3) {\\n axes1[i] = axis.x;\\n axes1[i+1] = axis.y;\\n axes1[i+2] = axis.z;\\n }\\n vtemp1.addAttribute( 'axis', new THREE.BufferAttribute( new Float32Array(axes1), 3 ) );\\n\\n\\n // centroid\\n let centroidVector = getCentroid(vtemp);\\n let centroid = new Array(len*3).fill(0);\\n let centroid1 = new Array(len1*3).fill(0);\\n for (let i = 0; i < len*3; i=i+3) {\\n centroid[i] = centroidVector.x;\\n centroid[i+1] = centroidVector.y;\\n centroid[i+2] = centroidVector.z;\\n }\\n for (let i = 0; i < len1*3; i=i+3) {\\n centroid1[i] = centroidVector.x;\\n centroid1[i+1] = centroidVector.y;\\n centroid1[i+2] = centroidVector.z;\\n }\\n vtemp.addAttribute( 'centroid', new THREE.BufferAttribute( new Float32Array(centroid), 3 ) );\\n vtemp1.addAttribute( 'centroid', new THREE.BufferAttribute( new Float32Array(centroid1), 3 ) );\\n \\n\\n return {surface: vtemp, volume: vtemp1};\\n }\",\n \"rotateRender() { \\n push();\\n imageMode(CENTER);\\n translate(this.x + this.width / 2, this.y + this.height / 2);\\n angleMode(DEGREES);\\n rotate(this.angle);\\n image(this.images[this.index], 0, 0, this.width, this.height);\\n pop();\\n }\",\n \"isBlendPartially() {\\n if (this.__transparentPrimitives.length > 0 && this.__opaquePrimitives.length > 0) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n }\",\n \"render() {\\n return \\n }\",\n \"updateImage_() {\\n const {width: frameW, height: frameH} = this.frameSize_;\\n const {width: rawImageW, height: rawImageH} = this.imageOriginalSize_;\\n const style = this.image_.attributeStyleMap;\\n\\n let rotatedW = rawImageW;\\n let rotatedH = rawImageH;\\n if (ROTATIONS[this.rotation_] === Rotation.ANGLE_90 ||\\n ROTATIONS[this.rotation_] === Rotation.ANGLE_270) {\\n [rotatedW, rotatedH] = [rotatedH, rotatedW];\\n }\\n const scale = Math.min(1, frameW / rotatedW, frameH / rotatedH);\\n const newImageW = scale * rawImageW;\\n const newImageH = scale * rawImageH;\\n style.set('width', CSS.px(newImageW));\\n style.set('height', CSS.px(newImageH));\\n this.cropAreaContainer_.setAttribute(\\n 'viewBox', `0 0 ${newImageW} ${newImageH}`);\\n\\n // Update corner space.\\n if (this.cornerSpaceSize_ === null) {\\n this.initialCorners_.forEach(({x, y}, idx) => {\\n this.corners_[idx].pt = new Point(x * newImageW, y * newImageH);\\n });\\n this.initialCorners_ = null;\\n } else {\\n const oldImageW = this.cornerSpaceSize_?.width || newImageW;\\n const oldImageH = this.cornerSpaceSize_?.height || newImageH;\\n this.corners_.forEach((corn) => {\\n corn.pt = new Point(\\n corn.pt.x / oldImageW * newImageW,\\n corn.pt.y / oldImageH * newImageH);\\n });\\n }\\n this.cornerSpaceSize_ = new Size(newImageW, newImageH);\\n\\n const originX =\\n frameW / 2 + rotatedW * scale / 2 * [-1, 1, 1, -1][this.rotation_];\\n const originY =\\n frameH / 2 + rotatedH * scale / 2 * [-1, -1, 1, 1][this.rotation_];\\n style.set('left', CSS.px(originX));\\n style.set('top', CSS.px(originY));\\n\\n const deg = ROTATIONS[this.rotation_];\\n style.set(\\n 'transform', new CSSTransformValue([new CSSRotate(CSS.deg(deg))]));\\n\\n this.updateCornerEl_();\\n }\",\n \"function copyObj2() {\\n\\n\\t\\t\\tvar obj = canvas.getActiveObject();\\n\\t\\t\\tif (!obj) return;\\n\\t\\t\\tif (fabric.util.getKlass(obj.type).async) {\\n\\t\\t\\t\\tobj.clone(function (clone) {\\n\\t\\t\\t\\tclone.set({left: 100, top: 100});\\n\\t\\t\\t\\tcanvas.add(clone);\\n\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcanvas.add(obj.clone().set({left: 100, top: 100}));\\n\\t\\t\\t\\t}\\n\\t\\t\\tcanvas.discardActiveObject();\\n\\t\\t\\tcanvas.renderAll();\\t\\n\\n\\t\\t}\",\n \"function CompositeConstraint(cids) {\\n // Mapping from composite-method id to ids of primitive methods that compose it\\n this.compmids = {};\\n this.cids = cids;\\n this.id = newCompositeConstraintId(this.cids);\\n }\",\n \"decompose() {\\n let cx = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;\\n let cy = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\\n // Get the parameters from the matrix\\n var a = this.a;\\n var b = this.b;\\n var c = this.c;\\n var d = this.d;\\n var e = this.e;\\n var f = this.f; // Figure out if the winding direction is clockwise or counterclockwise\\n\\n var determinant = a * d - b * c;\\n var ccw = determinant > 0 ? 1 : -1; // Since we only shear in x, we can use the x basis to get the x scale\\n // and the rotation of the resulting matrix\\n\\n var sx = ccw * Math.sqrt(a * a + b * b);\\n var thetaRad = Math.atan2(ccw * b, ccw * a);\\n var theta = 180 / Math.PI * thetaRad;\\n var ct = Math.cos(thetaRad);\\n var st = Math.sin(thetaRad); // We can then solve the y basis vector simultaneously to get the other\\n // two affine parameters directly from these parameters\\n\\n var lam = (a * c + b * d) / determinant;\\n var sy = c * sx / (lam * a - b) || d * sx / (lam * b + a); // Use the translations\\n\\n let tx = e - cx + cx * ct * sx + cy * (lam * ct * sx - st * sy);\\n let ty = f - cy + cx * st * sx + cy * (lam * st * sx + ct * sy); // Construct the decomposition and return it\\n\\n return {\\n // Return the affine parameters\\n scaleX: sx,\\n scaleY: sy,\\n shear: lam,\\n rotate: theta,\\n translateX: tx,\\n translateY: ty,\\n originX: cx,\\n originY: cy,\\n // Return the matrix parameters\\n a: this.a,\\n b: this.b,\\n c: this.c,\\n d: this.d,\\n e: this.e,\\n f: this.f\\n };\\n }\",\n \"_updateTransform(parentTransform = new math_gl__WEBPACK_IMPORTED_MODULE_0__[\\\"Matrix4\\\"]()) {\\n const computedTransform = parentTransform.clone().multiplyRight(this.transform);\\n const didTransformChange = !computedTransform.equals(this.computedTransform);\\n\\n if (!didTransformChange) {\\n return;\\n }\\n\\n this.computedTransform = computedTransform;\\n\\n // Matrix4.clone(computedTransform, this.computedTransform);\\n\\n // Update the bounding volumes\\n const header = this._header;\\n\\n const content = this._header.content;\\n this._boundingVolume = Object(_helpers_bounding_volume__WEBPACK_IMPORTED_MODULE_7__[\\\"createBoundingVolume\\\"])(\\n header.boundingVolume,\\n this.computedTransform,\\n this._boundingVolume\\n );\\n if (this._contentBoundingVolume) {\\n this._contentBoundingVolume = Object(_helpers_bounding_volume__WEBPACK_IMPORTED_MODULE_7__[\\\"createBoundingVolume\\\"])(\\n content.boundingVolume,\\n this.computedTransform,\\n this._contentBoundingVolume\\n );\\n }\\n if (this._viewerRequestVolume) {\\n this._viewerRequestVolume = Object(_helpers_bounding_volume__WEBPACK_IMPORTED_MODULE_7__[\\\"createBoundingVolume\\\"])(\\n header.viewerRequestVolume,\\n this.computedTransform,\\n this._viewerRequestVolume\\n );\\n }\\n }\",\n \"function getConstructor() {\\n /**\\n * Construct the component and return exposed functions and objects\\n * @param {String} id that identifies instance of constructed component\\n * @return {Object} THREE.js Group, Draw fn, id\\n */\\n function construct(id, debug) {\\n\\n const _debug = (debug === true);\\n const selectedColor = '#ff0000';\\n const unselectedColor = '#eeeeee';\\n\\n // Array of element names to update on each frame\\n let toUpdate = [];\\n let toUpdateTypes = ['video'];\\n let drawPerType = {\\n image: applyMaterialImage,\\n text: applyMaterialText,\\n video: applyMaterialVideo\\n };\\n let elements = {\\n main: { \\n name: 'main',\\n position: new THREE.Vector3(0, 0, 1),\\n type: 'drawable',\\n object: createDrawable('main')\\n },\\n leftSide: { \\n name: 'leftSide',\\n position: new THREE.Vector3(-1, .5, 1.2),\\n type: 'drawable',\\n object: createDrawable('leftSide')\\n },\\n rightSide: { \\n name: 'rightSide',\\n position: new THREE.Vector3(.8, .8, -1),\\n type: 'drawable',\\n object: createDrawable('rightSide')\\n },\\n frame: {\\n name: 'frame',\\n position: new THREE.Vector3(0, 0, 0),\\n type: 'helper',\\n object: createFrame(elementOptions.frame, debug) \\n }\\n };\\n\\n let component = new THREE.Group();\\n let elementNames = Object.keys(elements);\\n\\n component.name = 'componentGroup';\\n\\n elementNames.forEach(elementName => {\\n let element = elements[elementName];\\n\\n component.add(element.object);\\n element.object.position.copy(element.position);\\n });\\n // mainObject.position.set(0,0,opt.radius/opt.vCutOff);\\n draw(sampleData);\\n\\n /**\\n * Draw data point value onto drawable.\\n * @param {Object} value: '', drawableId: String, draw_type: String\\n * @return {void}\\n */\\n function draw(data) {\\n if (data instanceof Array) {\\n data.forEach(renderDrawable);\\n } else renderDrawable(data);\\n }\\n\\n function renderDrawable(data) {\\n let element = elements[data.drawableId] || {};\\n let object = element.object;\\n let drawFn = drawPerType[data.type];\\n\\n if (\\n data.drawableId && object && element.type === 'drawable' &&\\n typeof(drawFn) === 'function'\\n ) {\\n drawFn(data, object);\\n object.visible = true;\\n\\n if (~toUpdateTypes.indexOf(data.type) && !~toUpdate.indexOf(element.name)) {\\n toUpdate.push(element.name);\\n }\\n }\\n }\\n\\n function deactivate() {\\n draw(sampleData);\\n elements.leftSide.object.visible = false;\\n }\\n\\n function highlight(inView) {\\n if (_debug && elements.frame.object.material) {\\n elements.frame.material.color.set(\\n inView ? selectedColor : unselectedColor\\n );\\n }\\n }\\n\\n /**\\n * Update data on any element that is marked for keeping updated.\\n * @param {Object} value: '', drawableId: String, draw_type: String\\n * @return {void}\\n */\\n\\n function update() {\\n toUpdate.forEach(elementName => {\\n let element = elements[elementName];\\n\\n if (\\n element && element.object && element.object.userData && \\n typeof(element.object.userData.update) === 'function'\\n ) element.object.userData.update();\\n });\\n }\\n\\n return {\\n draw,\\n update,\\n highlight,\\n deactivate,\\n component,\\n id,\\n frame: elements.frame.object,\\n timeStamp: Date.now(),\\n };\\n }\\n\\n console.log('timeStamp:', Date.now());\\n\\n return construct;\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function isCompositeType(type) {\\n return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function editOnCompositionStart(editor, e) {\\n editor.setMode('composite');\\n editor.update(EditorState.set(editor._latestEditorState, { inCompositionMode: true }));\\n // Allow composition handler to interpret the compositionstart event\\n editor._onCompositionStart(e);\\n}\",\n \"function Transform()\\n{\\n TransformBase.call(this);\\n\\n /**\\n * The coordinate of the object relative to the local coordinates of the parent.\\n *\\n * @member {PIXI.Point}\\n */\\n this.position = new math.Point(0,0);\\n\\n /**\\n * The scale factor of the object.\\n *\\n * @member {PIXI.Point}\\n */\\n this.scale = new math.Point(1,1);\\n\\n /**\\n * The skew amount, on the x and y axis.\\n *\\n * @member {PIXI.ObservablePoint}\\n */\\n this.skew = new math.ObservablePoint(this.updateSkew, this, 0,0);\\n\\n /**\\n * The pivot point of the displayObject that it rotates around\\n *\\n * @member {PIXI.Point}\\n */\\n this.pivot = new math.Point(0,0);\\n\\n /**\\n * The rotation value of the object, in radians\\n *\\n * @member {Number}\\n * @private\\n */\\n this._rotation = 0;\\n\\n this._sr = Math.sin(0);\\n this._cr = Math.cos(0);\\n this._cy = Math.cos(0);//skewY);\\n this._sy = Math.sin(0);//skewY);\\n this._nsx = Math.sin(0);//skewX);\\n this._cx = Math.cos(0);//skewX);\\n}\",\n \"get compositeScoring () {\\n\\t\\treturn this._compositeScoring;\\n\\t}\",\n \"updateCompositionElements(dontRecurse) {\\n if (!this._isComposing) {\\n return;\\n }\\n if (this._bufferService.buffer.isCursorInViewport) {\\n const cellHeight = Math.ceil(this._charSizeService.height * this._optionsService.options.lineHeight);\\n const cursorTop = this._bufferService.buffer.y * cellHeight;\\n const cursorLeft = this._bufferService.buffer.x * this._charSizeService.width;\\n this._compositionView.style.left = cursorLeft + 'px';\\n this._compositionView.style.top = cursorTop + 'px';\\n this._compositionView.style.height = cellHeight + 'px';\\n this._compositionView.style.lineHeight = cellHeight + 'px';\\n this._compositionView.style.fontFamily = this._optionsService.options.fontFamily;\\n this._compositionView.style.fontSize = this._optionsService.options.fontSize + 'px';\\n // Sync the textarea to the exact position of the composition view so the IME knows where the\\n // text is.\\n const compositionViewBounds = this._compositionView.getBoundingClientRect();\\n this._textarea.style.left = cursorLeft + 'px';\\n this._textarea.style.top = cursorTop + 'px';\\n this._textarea.style.width = compositionViewBounds.width + 'px';\\n this._textarea.style.height = compositionViewBounds.height + 'px';\\n this._textarea.style.lineHeight = compositionViewBounds.height + 'px';\\n }\\n if (!dontRecurse) {\\n setTimeout(() => this.updateCompositionElements(true), 0);\\n }\\n }\",\n \"function HFlowLayout() {\\n this.base = new BaseObj(this);\\n this.tpos = new Rect(0, 0, 0, 0);\\n\\n var children = [];\\n\\n this.clear = function () {\\n children = [];\\n this.base.removeAllChildren();\\n }\\n\\n this.add = function (ui) {\\n children.push(ui);\\n this.base.addChild(ui);\\n }\\n\\n this.insert = function (index, ui) {\\n children.splice(index, 0, ui);\\n this.base.addChild(ui);\\n }\\n\\n this.resize = function (rect) {\\n var height = rect.h;\\n var widths = [];\\n var totalWidth = 0;\\n for (var i = 0; i < children.length; i++) {\\n var child = children[i];\\n var width = child.optimalWidth(height);\\n totalWidth += width;\\n widths.push(width);\\n }\\n\\n // Make sure we can fit.\\n if (totalWidth > rect.w) {\\n for (var i = 0; i < widths.length; i++) {\\n widths[i] *= rect.w / totalWidth;\\n widths[i] = Math.max(Math.round(widths[i]), 1);\\n }\\n }\\n\\n var curX = rect.x;\\n for (var i = 0; i < children.length; i++) {\\n var width = widths[i];\\n var childRect = new Rect(curX, rect.y, width, height);\\n children[i].resize(childRect);\\n curX += width;\\n }\\n }\\n\\n this.optimalWidth = function (height) {\\n var totalWidth = 0;\\n for (var i = 0; i < children.length; i++) {\\n totalWidth += children[i].optimalWidth(height);\\n }\\n return totalWidth;\\n }\\n}\",\n \"updateTransform()\\n {\\n\\n this._boundsID++;\\n \\n this.transform.updateTransform(this.parent.transform);\\n // TODO: check render flags, how to process stuff here\\n this.worldAlpha = this.alpha * this.parent.worldAlpha;\\n \\n for (let i = 0, j = this.children.length; i < j; ++i)\\n {\\n const child = this.children[i];\\n\\n if (child.visible)\\n {\\n \\n child.updateTransform();\\n \\n\\n \\n }\\n }\\n\\n if(this._filters){\\n // this._filters.forEach(filter=>filter.worldTransform =this.transform.worldTransform)\\n const bounds = this._bounds;\\n const width = this.width || this.style.width || bounds.maxX - bounds.minX;\\n const height = this.height || this.style.height || bounds.maxY - bounds.minY;\\n /**\\n * if check on cliip bug on scroll after setState from App.js scrollHeight !!!!!!\\n */\\n // if(this._clip){\\n\\n // console.log(this.transform.worldTransform.ty)\\n this.filterArea = new PIXI.Rectangle(\\n this.transform.worldTransform.tx,\\n this.transform.worldTransform.ty,\\n width,\\n height\\n )\\n // / }\\n \\n }\\n \\n }\",\n \"function makeCompositeBlock(prim, spec, type, color, varprocname){\\r\\n\\r\\n\\t// COLOR HACK\\r\\n\\tif((prim == \\\"LOUDNESS\\\") ||\\r\\n\\t (prim == \\\"CAMERAIMAGE\\\") ||\\r\\n\\t (prim == \\\"CAMERAMOTION\\\") ||\\r\\n\\t (prim == \\\"FLICKR\\\") ||\\r\\n\\t (prim == \\\"prim_flickr\\\")){\\r\\n\\t\\tcolor = \\\"#A00000\\\";\\r\\n\\t}\\r\\n\\r\\n\\tvar block = $('');\\r\\n\\tblock[0].prim = prim;\\r\\n\\tblock[0].spec = spec;\\r\\n\\tblock[0].type = type;\\r\\n\\tblock[0].color = color;\\r\\n\\tblock[0].fcn = window[prim];\\r\\n\\tblock.attr('onSelectStart','return false');\\r\\n\\tvar shape = $(''); // for iPhone: onclick = \\\"void(0)\\\"\\r\\n\\tblock.append(shape);\\r\\n\\tshape.css('z-index', 0);\\r\\n\\t\\r\\n\\t// PARSE PROCEDURE\\r\\n\\tif((block[0].prim == 'prim_procedure') || (block[0].prim == 'prim_proceduredef')){\\r\\n\\t\\tvar label = $('
');\\r\\n\\t\\t\\t\\t\\tvarLabel.attr('onSelectStart','return false');\\r\\n\\t\\t\\t\\t\\tblock.append(varLabel);\\r\\n\\t\\t\\t\\t\\tblock[0].varname = varprocname;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(arg != undefined){\\r\\n\\t\\t\\t\\t\\tblock.append(arg);\\r\\n\\t\\t\\t\\t\\targ.keydown(function() {\\r\\n\\t\\t\\t\\t\\t\\tlayoutArg($(this));\\r\\n\\t\\t\\t\\t\\t\\tlayoutStack($(this).parents('.stack'));\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}else if(p.charAt(0) == '@'){\\r\\n\\t\\t\\t\\t// ICON\\r\\n\\t\\t\\t\\tvar icon = getIcon(p.substring(1,p.length));\\r\\n\\t\\t\\t\\tif(icon!= null){\\r\\n\\t\\t\\t\\t\\ticon.css('z-index', 5);\\r\\n\\t\\t\\t\\t\\tblock.append(icon);\\r\\n\\t\\t\\t\\t\\ticon.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\\r\\n\\t\\t\\t\\t\\ticon.attr('onDragStart','return false'); //avoid image drag\\r\\n\\t\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\tvar label = $('
'+p+'
');\\r\\n\\t\\t\\t\\t\\tlabel.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\\r\\n\\t\\t\\t\\t\\tblock.append(label);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t// LABEL\\r\\n\\t\\t\\t\\tvar label = $('
'+p+'
');\\r\\n\\t\\t\\t\\tlabel.attr('onSelectStart','return false'); //avoid text selection on browser other then Mozilla\\r\\n\\t\\t\\t\\tblock.append(label);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\t\\r\\n\\treturn block;\\r\\n}\",\n \"clear()\\n {\\n this.context.setTransform(1, 0, 0, 1, 0, 0);\\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\\n }\",\n \"apply() {\\n // Get the source image and create the result image buffer\\n const source = new ImageDataPixelWrapper(this.source.getImageData(0, 0, 400, 300));\\n const resultImageData = this.result.createImageData(400, 300)\\n const result = new ImageDataPixelWrapper(resultImageData);\\n\\n // Update the alpha values of the newly created image\\n result.map((pixel) => pixel.alpha = 255)\\n\\n if (this.operation) {\\n if (this.operation.params) var params = this.getParams();\\n this.operation.apply(source, result, params);\\n }\\n\\n // Put the result image in the canvas\\n this.result.putImageData(resultImageData, 0, 0);\\n }\",\n \"function CompositeDisposable() {\\n var disposable, _i, _len;\\n this.disposables = [];\\n for (_i = 0, _len = arguments.length; _i < _len; _i++) {\\n disposable = arguments[_i];\\n this.add(disposable);\\n }\\n }\",\n \"render() {\\n let finalVisual;\\n var cont = this.getContentById();\\n\\n switch (this.props.onlyContent){\\n case \\\"true\\\" : \\n finalVisual = ( );\\n break;\\n\\n case \\\"false\\\" : \\n finalVisual = ();\\n break;\\n }\\n return (\\n
\\n {finalVisual}\\n
\\n );\\n }\",\n \"function Transformable(x, y, width, height){\\n\\t\\tContainable.call(this);\\n\\n\\t\\tthis.set({\\n\\t\\t\\tx: x,\\n\\t\\t\\ty: y,\\n\\t\\t\\twidth: width,\\n\\t\\t\\theight: height,\\n\\t\\t\\ttransform: {\\n\\t\\t\\t\\torigin: {x: 0, y: 0},\\n\\t\\t\\t\\tproperties: {\\n\\t\\t\\t\\t\\trotate: 0,\\n\\t\\t\\t\\t\\ttranslate: {dx: 0, dy: 0},\\n\\t\\t\\t\\t\\tscale: {x: 1, y: 1}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"function confineInContainer(position, width, height, api) {\\n\\t var viewWidth = api.getWidth();\\n\\t var viewHeight = api.getHeight();\\n\\t position[0] = Math.min(position[0] + width, viewWidth) - width;\\n\\t position[1] = Math.min(position[1] + height, viewHeight) - height;\\n\\t position[0] = Math.max(position[0], 0);\\n\\t position[1] = Math.max(position[1], 0);\\n\\t}\",\n \"function constructCanvas(){\\n\\t\\t\\tcanvasWidth = target.getWidth();\\n\\t\\t\\tcanvasHeight = target.getHeight();\\n\\t\\t\\ttarget.innerHTML = '';\\n\\t\\t\\t\\n\\t\\t\\t/**\\n\\t\\t\\t * For positioning labels and overlay.\\n\\t\\t\\t */\\n\\t\\t\\ttarget.setStyle({'position': 'relative'});\\n\\t\\t\\t\\n\\t\\t\\tif(canvasWidth <= 0 || canvasHeight <= 0){\\n\\t\\t\\t\\tthrow 'Invalid dimensions for plot, width = ' + canvasWidth + ', height = ' + canvasHeight;\\n\\t\\t\\t}\\n\\t\\n\\t\\t\\t/**\\n\\t\\t\\t * Insert main canvas.\\n\\t\\t\\t */\\n\\t\\t\\tcanvas = $(document.createElement('canvas')).writeAttribute({\\n\\t\\t\\t\\t'width': canvasWidth,\\n\\t\\t\\t\\t'height': canvasHeight\\t\\n\\t\\t\\t});\\n\\t\\t\\ttarget.appendChild(canvas);\\n\\t\\t\\tif(Prototype.Browser.IE){\\n\\t\\t\\t\\tcanvas = $(window.G_vmlCanvasManager.initElement(canvas));\\n\\t\\t\\t} \\n\\t\\t\\tctx = canvas.getContext('2d');\\n\\t\\n\\t\\t\\t/**\\n\\t\\t\\t * Insert overlay canvas for interactive features.\\n\\t\\t\\t */\\n\\t\\t\\toverlay = $(document.createElement('canvas')).writeAttribute({\\n\\t\\t\\t\\t'width': canvasWidth,\\n\\t\\t\\t\\t'height': canvasHeight\\n\\t\\t\\t}).setStyle({\\n\\t\\t\\t\\t'position': 'absolute',\\n\\t\\t\\t\\t'left': '0px',\\n\\t\\t\\t\\t'top': '0px'\\n\\t\\t\\t});\\n\\t\\t\\ttarget.setStyle({cursor:'default'}).appendChild(overlay);\\n\\t\\t\\tif(Prototype.Browser.IE){\\n\\t\\t\\t\\toverlay = $(window.G_vmlCanvasManager.initElement(overlay));\\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t\\toctx = overlay.getContext('2d');\\n\\t\\t}\",\n \"updateTransform() {\\n if (this.sortableChildren && this.sortDirty) {\\n this.sortChildren();\\n }\\n this._boundsID++;\\n this.transform.updateTransform(this.parent.transform);\\n // TODO: check render flags, how to process stuff here\\n this.worldAlpha = this.alpha * this.parent.worldAlpha;\\n for (var i = 0, j = this.children.length; i < j; ++i) {\\n var child = this.children[i];\\n if (child.visible) {\\n child.updateTransform();\\n }\\n }\\n }\",\n \"function DisplayObject()\\n{\\n EventEmitter.call(this);\\n\\n /**\\n * The coordinate of the object relative to the local coordinates of the parent.\\n *\\n * @member {PIXI.Point}\\n */\\n this.position = new math.Point();\\n\\n /**\\n * The scale factor of the object.\\n *\\n * @member {PIXI.Point}\\n */\\n this.scale = new math.Point(1, 1);\\n\\n /**\\n * The pivot point of the displayObject that it rotates around\\n *\\n * @member {PIXI.Point}\\n */\\n this.pivot = new math.Point(0, 0);\\n\\n\\n /**\\n * The skew factor for the object in radians.\\n *\\n * @member {PIXI.Point}\\n */\\n this.skew = new math.Point(0, 0);\\n\\n /**\\n * The rotation of the object in radians.\\n *\\n * @member {number}\\n */\\n this.rotation = 0;\\n\\n /**\\n * The opacity of the object.\\n *\\n * @member {number}\\n */\\n this.alpha = 1;\\n\\n /**\\n * The visibility of the object. If false the object will not be drawn, and\\n * the updateTransform function will not be called.\\n *\\n * @member {boolean}\\n */\\n this.visible = true;\\n\\n /**\\n * Can this object be rendered, if false the object will not be drawn but the updateTransform\\n * methods will still be called.\\n *\\n * @member {boolean}\\n */\\n this.renderable = true;\\n\\n /**\\n * The display object container that contains this display object.\\n *\\n * @member {PIXI.Container}\\n * @readOnly\\n */\\n this.parent = null;\\n\\n /**\\n * The multiplied alpha of the displayObject\\n *\\n * @member {number}\\n * @readOnly\\n */\\n this.worldAlpha = 1;\\n\\n /**\\n * Current transform of the object based on world (parent) factors\\n *\\n * @member {PIXI.Matrix}\\n * @readOnly\\n */\\n this.worldTransform = new math.Matrix();\\n\\n /**\\n * The area the filter is applied to. This is used as more of an optimisation\\n * rather than figuring out the dimensions of the displayObject each frame you can set this rectangle\\n *\\n * @member {PIXI.Rectangle}\\n */\\n this.filterArea = null;\\n\\n /**\\n * cached sin rotation\\n *\\n * @member {number}\\n * @private\\n */\\n this._sr = 0;\\n\\n /**\\n * cached cos rotation\\n *\\n * @member {number}\\n * @private\\n */\\n this._cr = 1;\\n\\n /**\\n * The original, cached bounds of the object\\n *\\n * @member {PIXI.Rectangle}\\n * @private\\n */\\n this._bounds = new math.Rectangle(0, 0, 1, 1);\\n\\n /**\\n * The most up-to-date bounds of the object\\n *\\n * @member {PIXI.Rectangle}\\n * @private\\n */\\n this._currentBounds = null;\\n\\n /**\\n * The original, cached mask of the object\\n *\\n * @member {PIXI.Rectangle}\\n * @private\\n */\\n this._mask = null;\\n}\",\n \"transformed(transform){\\n let result = new AffineTransform();\\n\\n result.position = this.position.copy();\\n result.position.mult(transform.scale);\\n\\n let rotated = new p5.Vector(result.position.x, result.position.y).rotate(transform.rotation);\\n\\n result.position.x = rotated.x;\\n result.position.y = rotated.y;\\n result.position.add(transform.position);\\n\\n result.scale = this.scale.copy();\\n result.scale.mult(transform.scale);\\n\\n result.rotation = this.rotation + transform.rotation;\\n\\n return result;\\n }\",\n \"function CameraCommand_Scroll_TransformToParent(parent, bClip)\\n{\\n\\t//copy the target area\\n\\tvar newArea = new Position_Rect(this.ScrollArea.left, this.ScrollArea.top, this.ScrollArea.width, this.ScrollArea.height);\\n\\t//transform it to the parent\\n\\tnewArea.TransformToParent(this.ScrollTarget, parent);\\n\\t//want to clip?\\n\\tif (bClip)\\n\\t{\\n\\t\\t//do we have a scroll target?\\n\\t\\tif (this.ScrollTarget)\\n\\t\\t{\\n\\t\\t\\t//get the html parent\\n\\t\\t\\tvar htmlParent = Get_HTMLObject(this.ScrollTarget);\\n\\t\\t\\t//still valid?\\n\\t\\t\\tif (htmlParent)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//fit to parent\\n\\t\\t\\t\\tnewArea.FitToParent(this.ScrollTarget, htmlParent);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//return it\\n\\treturn newArea;\\n}\",\n \"clear() {\\n this.context.setTransform(1, 0, 0, 1, 0, 0);\\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\\n }\",\n \"clear() {\\n this.context.setTransform(1, 0, 0, 1, 0, 0);\\n this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);\\n }\",\n \"display() {\\n push();\\n // Filter goes from transparent to more opaque\\n this.fill.alpha += this.fill.alphaChangeRate;\\n this.fill.alpha = constrain(this.fill.alpha, 0, this.fill.finalAlpha);\\n // Draw a rectangle\\n rectMode(CORNER);\\n fill(this.fill.r, this.fill.g, this.fill.b, this.fill.alpha);\\n rect(this.x, this.y, this.length, this.height);\\n pop();\\n }\",\n \"function Transform() {}\",\n \"function Transform() {}\",\n \"function Transform() {}\",\n \"function Transform() {}\",\n \"function Transform() {}\",\n \"function confineInContainer(position, width, height, api) {\\n var viewWidth = api.getWidth();\\n var viewHeight = api.getHeight();\\n position[0] = Math.min(position[0] + width, viewWidth) - width;\\n position[1] = Math.min(position[1] + height, viewHeight) - height;\\n position[0] = Math.max(position[0], 0);\\n position[1] = Math.max(position[1], 0);\\n}\",\n \"function factory() {\\n\\n var Atomic = require('atomic'),\\n $ = require('jquery'),\\n CarouselWithButtons;\\n\\n /**\\n * The carousel with buttons is a mashery of carousel and buttons, and is\\n * a great example of how you can put smaller pieces together to make a\\n * reusable \\\"larger piece\\\". In the class description, you should also explain\\n * the contract expected by this object.\\n *\\n * CarouselWithButtons expects the following nodes to exist within the\\n * top level element:\\n * - .carousel will be turned into a carousel Component\\n * - .next all references will be turned into buttons that advance the carousel\\n * - .prev all references will be turned into buttons that rewind the carousel\\n *\\n * @class CarouselWithButtons\\n * @extends AbstractComposite\\n */\\n CarouselWithButtons = Atomic.OOP.extend(Atomic.AbstractComposite, function (base) {\\n return {\\n /**\\n * Declares dependencies used within this Composite\\n * @requires components/carousel\\n * @requires components/button\\n */\\n has: {\\n Carousel: 'components/carousel',\\n Button: 'components/button'\\n },\\n\\n /**\\n * Declares \\\"actors\\\", additional HTML Elements required\\n * usually all actors need to be fulfilled for a\\n * Composite to work correctly.\\n */\\n actors: ['Carousel', 'Next', 'Previous'],\\n\\n // this Composite has no events unique to itself\\n events: {},\\n\\n /**\\n * method ran in response to an external load() call\\n * @see AbstractComposite#load\\n */\\n modify: function (done, resolved, actors) {\\n var $el = $(this.ELEMENT),\\n Carousel = resolved.Carousel,\\n Button = resolved.Button,\\n carousel = new Carousel(actors.Carousel),\\n self = this;\\n\\n // expose a jQuery wrapped object\\n // While not required, this is a good practice if\\n // you want to reuse the jQuery object\\n this.$el = $el;\\n\\n // We are comfortable as the composite maintainer\\n // with people maniuplaing the carousel directly\\n // via its public APIs and listening to its methods\\n // As a developer, you should ensure carousel has\\n // all the necessary events so that CarouselWithButtons\\n // can tell when its carousel changes.\\n this.carousel = carousel;\\n\\n // Private members can help lend insights into\\n // the object's inner workings\\n // External groups shouldn't call these, but they may\\n // wish to console.log them\\n this._nextButtons = [];\\n this._prevButtons = [];\\n\\n // maybe we want to store the resolved object\\n // for other methods in CarouselWithButtons\\n this._Carousel = Carousel;\\n\\n // gotta bind them all\\n // In order to improve debugging, remember to add\\n // these objects to the _nextButtons and _prevButtons\\n $.each(actors.Next, function (idx, nextEl) {\\n var btn = new Button(nextEl);\\n self._nextButtons.push(btn);\\n carousel.bind(btn, btn.events.USE, 'next');\\n btn.load();\\n });\\n $.each(actors.Previous, function (idx, prevEl) {\\n var btn = new Button(prevEl);\\n self._prevButtons.push(btn);\\n carousel.bind(btn, btn.events.USE, 'previous');\\n btn.load();\\n });\\n\\n carousel.load(function () {\\n done();\\n });\\n }\\n };\\n });\\n\\n return CarouselWithButtons;\\n}\",\n \"applyCurrentTransform () {\\n this.tempPosition.set(this.position);\\n this.tempOrientation = this.orientation;\\n this.tempScale.set(this.scale);\\n }\",\n \"apply(){\\n var transform = mat4.create();\\n mat4.identity(transform);\\n\\n mat4.translate(transform, transform, [this.x_center,this.y_center,this.z_center]);\\n mat4.rotate(transform, transform, this.elapsedAngle, [0, 1, 0]);\\n\\n mat4.translate(transform,transform,[this.radius,0,0]);\\n\\n if(this.direction == 1){\\n mat4.rotate(transform,transform,Math.PI,[0,1,0]);\\n }\\n return transform;\\n }\",\n \"function DisplayObject()\\n{\\n this.last = this;\\n this.first = this;\\n /**\\n * The coordinate of the object relative to the local coordinates of the parent.\\n *\\n * @property position\\n * @type Point\\n */\\n this.position = new Point();\\n\\n /**\\n * The scale factor of the object.\\n *\\n * @property scale\\n * @type Point\\n */\\n this.scale = new Point(1,1);//{x:1, y:1};\\n\\n /**\\n * The pivot point of the displayObject that it rotates around\\n *\\n * @property pivot\\n * @type Point\\n */\\n this.pivot = new Point(0,0);\\n\\n /**\\n * The rotation of the object in radians.\\n *\\n * @property rotation\\n * @type Number\\n */\\n this.rotation = 0;\\n\\n /**\\n * The opacity of the object.\\n *\\n * @property alpha\\n * @type Number\\n */\\n this.alpha = 1;\\n\\n /**\\n * The visibility of the object.\\n *\\n * @property visible\\n * @type Boolean\\n */\\n this.visible = true;\\n\\n /**\\n * This is the defined area that will pick up mouse / touch events. It is null by default.\\n * Setting it is a neat way of optimising the hitTest function that the interactionManager will use (as it will not need to hit test all the children)\\n *\\n * @property hitArea\\n * @type Rectangle|Circle|Ellipse|Polygon\\n */\\n this.hitArea = null;\\n\\n /**\\n * This is used to indicate if the displayObject should display a mouse hand cursor on rollover\\n *\\n * @property buttonMode\\n * @type Boolean\\n */\\n this.buttonMode = false;\\n\\n /**\\n * Can this object be rendered\\n *\\n * @property renderable\\n * @type Boolean\\n */\\n this.renderable = false;\\n\\n /**\\n * [read-only] The display object container that contains this display object.\\n *\\n * @property parent\\n * @type DisplayObjectContainer\\n * @readOnly\\n */\\n this.parent = null;\\n\\n /**\\n * [read-only] The stage the display object is connected to, or undefined if it is not connected to the stage.\\n *\\n * @property stage\\n * @type Stage\\n * @readOnly\\n */\\n this.stage = null;\\n\\n /**\\n * [read-only] The multiplied alpha of the displayobject\\n *\\n * @property worldAlpha\\n * @type Number\\n * @readOnly\\n */\\n this.worldAlpha = 1;\\n\\n /**\\n * [read-only] Whether or not the object is interactive, do not toggle directly! use the `interactive` property\\n *\\n * @property _interactive\\n * @type Boolean\\n * @readOnly\\n * @private\\n */\\n this._interactive = false;\\n\\n this.defaultCursor = 'pointer';\\n\\n /**\\n * [read-only] Current transform of the object based on world (parent) factors\\n *\\n * @property worldTransform\\n * @type Mat3\\n * @readOnly\\n * @private\\n */\\n this.worldTransform = mat3.create();//mat3.identity();\\n\\n /**\\n * [read-only] Current transform of the object locally\\n *\\n * @property localTransform\\n * @type Mat3\\n * @readOnly\\n * @private\\n */\\n this.localTransform = mat3.create();//mat3.identity();\\n\\n /**\\n * [NYI] Unkown\\n *\\n * @property color\\n * @type Array<>\\n * @private\\n */\\n this.color = [];\\n\\n /**\\n * [NYI] Holds whether or not this object is dynamic, for rendering optimization\\n *\\n * @property dynamic\\n * @type Boolean\\n * @private\\n */\\n this.dynamic = true;\\n\\n // chach that puppy!\\n this._sr = 0;\\n this._cr = 1;\\n\\n\\n this.filterArea = new Rectangle(0,0,1,1);\\n\\n /*\\n * MOUSE Callbacks\\n */\\n\\n /**\\n * A callback that is used when the users clicks on the displayObject with their mouse\\n * @method click\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user clicks the mouse down over the sprite\\n * @method mousedown\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user releases the mouse that was over the displayObject\\n * for this callback to be fired the mouse must have been pressed down over the displayObject\\n * @method mouseup\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user releases the mouse that was over the displayObject but is no longer over the displayObject\\n * for this callback to be fired, The touch must have started over the displayObject\\n * @method mouseupoutside\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the users mouse rolls over the displayObject\\n * @method mouseover\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the users mouse leaves the displayObject\\n * @method mouseout\\n * @param interactionData {InteractionData}\\n */\\n\\n\\n /*\\n * TOUCH Callbacks\\n */\\n\\n /**\\n * A callback that is used when the users taps on the sprite with their finger\\n * basically a touch version of click\\n * @method tap\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user touch's over the displayObject\\n * @method touchstart\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user releases a touch over the displayObject\\n * @method touchend\\n * @param interactionData {InteractionData}\\n */\\n\\n /**\\n * A callback that is used when the user releases the touch that was over the displayObject\\n * for this callback to be fired, The touch must have started over the sprite\\n * @method touchendoutside\\n * @param interactionData {InteractionData}\\n */\\n}\",\n \"compileImpl(cache)\\n {\\n // small helper to format info and error messages\\n var _ = (c) => {\\n return 'id=' + (c.id || '') + '|name=' + (c.name || '');\\n };\\n\\n // the common implementation for all components\\n var impl = (comp, cache, ids, names, kind) => {\\n // at least one of ID and name mandatory\\n if ( ! comp.name && ! comp.id ) {\\n throw new Error('No ID and no name on ' + kind.kind + ' in ' + cache.href);\\n }\\n // default value for compose\\n if ( ! comp.compose ) {\\n comp.compose = 'merge';\\n }\\n // does it exist yet?\\n var derived =\\n ( comp.id && ids[comp.id] )\\n || ( comp.name && names[comp.name] );\\n // if it does, perform the \\\"compose\\\" action..\\n if ( derived ) {\\n if ( derived.compose !== comp.compose ) {\\n throw new Error('Different compose actions for ' + kind.kind + 's: derived:'\\n + _(derived) + '|compose=' + derived.compose + ' and base:'\\n + _(comp) + '|compose=' + comp.compose);\\n }\\n else if ( derived.compose === 'merge' ) {\\n this.ctxt.display.info('Merge ' + kind.kind + 's derived:' + _(derived) + ' and base:' + _(comp));\\n var overriden = Object.keys(derived);\\n for ( var p in comp ) {\\n if ( overriden.indexOf(p) === -1 ) {\\n derived[p] = comp[p];\\n if ( p === 'id' ) {\\n ids[derived.id] = derived;\\n }\\n else if ( p === 'name' ) {\\n names[derived.name] = derived;\\n }\\n }\\n else {\\n derived[p] = kind.merge(p, derived[p], comp[p]);\\n }\\n }\\n }\\n else if ( derived.compose === 'hide' ) {\\n this.ctxt.platform.info('Hide ' + kind.kind + ' base:' + _(comp) + ' by derived:' + _(derived));\\n }\\n else {\\n throw new Error('Unknown compose on ' + kind.kind + ': ' + _(derived) + '|compose=' + derived.compose);\\n }\\n }\\n // ...if it does not, just add it\\n else {\\n cache.push(comp);\\n if ( comp.id ) {\\n ids[comp.id] = comp;\\n }\\n if ( comp.name ) {\\n names[comp.name] = comp;\\n }\\n }\\n };\\n\\n // compile hosts\\n if ( this.json.hosts ) {\\n this.json.hosts.forEach(host => {\\n impl(host, cache.hosts, null, cache.hostNames, cmp.Host);\\n });\\n }\\n // compile databases\\n if ( this.json.databases ) {\\n this.json.databases.forEach(db => {\\n impl(db, cache.dbs, cache.dbIds, cache.dbNames, cmp.Database);\\n });\\n }\\n // compile servers\\n if ( this.json.servers ) {\\n this.json.servers.forEach(srv => {\\n impl(srv, cache.srvs, cache.srvIds, cache.srvNames, cmp.Server);\\n });\\n }\\n // compile sources\\n if ( this.json.sources ) {\\n this.json.sources.forEach(src => {\\n impl(src, cache.srcs, null, cache.srcNames, cmp.SourceSet);\\n });\\n }\\n // compile mime types\\n if ( this.json['mime-types'] ) {\\n this.json['mime-types'].forEach(mime => {\\n impl(mime, cache.mimes, null, cache.mimeNames, cmp.MimeType);\\n });\\n }\\n // compile privileges\\n if ( this.json.privileges ) {\\n const each = (privs, cache, names) => {\\n if ( privs ) {\\n privs.forEach(priv => {\\n impl(priv, cache, null, names, cmp.Privilege);\\n });\\n }\\n };\\n each(this.json.privileges.execute, cache.execPrivs, cache.execPrivNames);\\n each(this.json.privileges.uri, cache.uriPrivs, cache.uriPrivNames);\\n }\\n // compile roles\\n if ( this.json.roles ) {\\n this.json.roles.forEach(role => {\\n impl(role, cache.roles, null, cache.roleNames, cmp.Role);\\n });\\n }\\n // compile users\\n if ( this.json.users ) {\\n this.json.users.forEach(user => {\\n impl(user, cache.users, null, cache.userNames, cmp.User);\\n });\\n }\\n // recurse on imports\\n this.imports.forEach(i => {\\n cache.href = i.path;\\n i.compileImpl(cache);\\n });\\n }\",\n \"isAllBlend() {\\n if (this.__transparentPrimitives.length > 0 && this.__opaquePrimitives.length === 0) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n }\",\n \"constructor() {\\n super(\\\"position\\\", \\\"normal\\\", \\\"texture_coord\\\");\\n // Loop 3 times (for each axis), and inside loop twice (for opposing cube sides):\\n for (var i = 0; i < 3; i++)\\n for (var j = 0; j < 2; j++) {\\n var square_transform = Mat4.rotation(\\n i == 0 ? Math.PI / 2 : 0,\\n Vec.of(1, 0, 0)\\n )\\n .times(\\n Mat4.rotation(\\n Math.PI * j - (i == 1 ? Math.PI / 2 : 0),\\n Vec.of(0, 1, 0)\\n )\\n )\\n .times(Mat4.translation([0, 0, 1]));\\n // Calling this function of a Square (or any Shape) copies it into the specified\\n // Shape (this one) at the specified matrix offset (square_transform):\\n Square.insert_transformed_copy_into(this, [], square_transform);\\n }\\n }\",\n \"isCombined() {\\n return this.content & Content.IS_COMBINED_MASK;\\n }\",\n \"function cardComp (headline, authorPhoto, authorName) {\\n const card= document.createElement('div')\\n card.classList.add('card')\\n\\n card.appendChild(headlineComp(headline))\\n card.appendChild(authorComp(authorPhoto, authorName))\\n \\n return card\\n}\",\n \"function CanvasProjectionOverlay(){}\"\n]"},"negative_scores":{"kind":"list like","value":["0.65486985","0.6166722","0.6166722","0.6010471","0.59579456","0.58461636","0.5741393","0.5688997","0.56546265","0.56008905","0.556109","0.5505642","0.5482712","0.5294749","0.5281335","0.52623343","0.5191511","0.50583845","0.5051368","0.50366163","0.50366163","0.50366163","0.50366163","0.5014128","0.49957877","0.49921286","0.49881536","0.49812925","0.49786606","0.4924811","0.4900701","0.488148","0.48774302","0.48651308","0.48502445","0.48002675","0.47497463","0.4734224","0.4724711","0.47042045","0.47041652","0.4696987","0.46964747","0.46833727","0.46817258","0.46801823","0.4674574","0.46635172","0.46548438","0.4653851","0.4649442","0.4649442","0.4649442","0.4649442","0.4649442","0.4649442","0.46462423","0.46462423","0.46462423","0.46462423","0.46462423","0.46462423","0.46462423","0.46462423","0.46462423","0.46408138","0.46394795","0.46338984","0.463227","0.4622776","0.46222973","0.46120197","0.46042922","0.45938283","0.45874935","0.45866176","0.4578035","0.4577256","0.45762604","0.45575842","0.45568198","0.45511726","0.45451495","0.45451495","0.45441586","0.45437598","0.45437598","0.45437598","0.45437598","0.45437598","0.45187992","0.45176515","0.4517394","0.4512672","0.45090646","0.450797","0.44963905","0.44907832","0.44856787","0.4485614","0.44843447"],"string":"[\n \"0.65486985\",\n \"0.6166722\",\n \"0.6166722\",\n \"0.6010471\",\n \"0.59579456\",\n \"0.58461636\",\n \"0.5741393\",\n \"0.5688997\",\n \"0.56546265\",\n \"0.56008905\",\n \"0.556109\",\n \"0.5505642\",\n \"0.5482712\",\n \"0.5294749\",\n \"0.5281335\",\n \"0.52623343\",\n \"0.5191511\",\n \"0.50583845\",\n \"0.5051368\",\n \"0.50366163\",\n \"0.50366163\",\n \"0.50366163\",\n \"0.50366163\",\n \"0.5014128\",\n \"0.49957877\",\n \"0.49921286\",\n \"0.49881536\",\n \"0.49812925\",\n \"0.49786606\",\n \"0.4924811\",\n \"0.4900701\",\n \"0.488148\",\n \"0.48774302\",\n \"0.48651308\",\n \"0.48502445\",\n \"0.48002675\",\n \"0.47497463\",\n \"0.4734224\",\n \"0.4724711\",\n \"0.47042045\",\n \"0.47041652\",\n \"0.4696987\",\n \"0.46964747\",\n \"0.46833727\",\n \"0.46817258\",\n \"0.46801823\",\n \"0.4674574\",\n \"0.46635172\",\n \"0.46548438\",\n \"0.4653851\",\n \"0.4649442\",\n \"0.4649442\",\n \"0.4649442\",\n \"0.4649442\",\n \"0.4649442\",\n \"0.4649442\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46462423\",\n \"0.46408138\",\n \"0.46394795\",\n \"0.46338984\",\n \"0.463227\",\n \"0.4622776\",\n \"0.46222973\",\n \"0.46120197\",\n \"0.46042922\",\n \"0.45938283\",\n \"0.45874935\",\n \"0.45866176\",\n \"0.4578035\",\n \"0.4577256\",\n \"0.45762604\",\n \"0.45575842\",\n \"0.45568198\",\n \"0.45511726\",\n \"0.45451495\",\n \"0.45451495\",\n \"0.45441586\",\n \"0.45437598\",\n \"0.45437598\",\n \"0.45437598\",\n \"0.45437598\",\n \"0.45437598\",\n \"0.45187992\",\n \"0.45176515\",\n \"0.4517394\",\n \"0.4512672\",\n \"0.45090646\",\n \"0.450797\",\n \"0.44963905\",\n \"0.44907832\",\n \"0.44856787\",\n \"0.4485614\",\n \"0.44843447\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82033,"cells":{"query":{"kind":"string","value":"On visiting object, check for its dependencies and visit them recursively"},"document":{"kind":"string","value":"function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function traverse(object, ancestors, visitor) {\n var key, child, tempList;\n\n visitor.call(null, object);\n for (key in object) {\n if (object.hasOwnProperty(key)) {\n child = object[key];\n if (typeof child === 'object' && child !== null) {\n tempList = ancestors.concat(object.type);\n traverse(child, tempList, visitor);\n // call checkStructure at every leaf\n } else {\n checkStructure(ancestors);\n }\n }\n }\n }","function detectCycleRecursive(inputObj) {\n if (visitedTypes[inputObj.name]) {\n return;\n }\n\n visitedTypes[inputObj.name] = true;\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n var fields = Object(_polyfills_objectValues_mjs__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(inputObj.getFields());\n\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\n var field = fields[_i30];\n\n if (Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_10__[\"isNonNullType\"])(field.type) && Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_10__[\"isInputObjectType\"])(field.type.ofType)) {\n var fieldType = field.type.ofType;\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n fieldPath.push(field);\n\n if (cycleIndex === undefined) {\n detectCycleRecursive(fieldType);\n } else {\n var cyclePath = fieldPath.slice(cycleIndex);\n var pathStr = cyclePath.map(function (fieldObj) {\n return fieldObj.name;\n }).join('.');\n context.reportError(\"Cannot reference Input Object \\\"\".concat(fieldType.name, \"\\\" within itself through a series of non-null fields: \\\"\").concat(pathStr, \"\\\".\"), cyclePath.map(function (fieldObj) {\n return fieldObj.astNode;\n }));\n }\n\n fieldPath.pop();\n }\n }\n\n fieldPathIndexByTypeName[inputObj.name] = undefined;\n }","function detectCycleRecursive(inputObj) {\n if (visitedTypes[inputObj.name]) {\n return;\n }\n\n visitedTypes[inputObj.name] = true;\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n var fields = Object(_polyfills_objectValues_mjs__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(inputObj.getFields());\n\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\n var field = fields[_i30];\n\n if (Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_11__[\"isNonNullType\"])(field.type) && Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_11__[\"isInputObjectType\"])(field.type.ofType)) {\n var fieldType = field.type.ofType;\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n fieldPath.push(field);\n\n if (cycleIndex === undefined) {\n detectCycleRecursive(fieldType);\n } else {\n var cyclePath = fieldPath.slice(cycleIndex);\n var pathStr = cyclePath.map(function (fieldObj) {\n return fieldObj.name;\n }).join('.');\n context.reportError(\"Cannot reference Input Object \\\"\".concat(fieldType.name, \"\\\" within itself through a series of non-null fields: \\\"\").concat(pathStr, \"\\\".\"), cyclePath.map(function (fieldObj) {\n return fieldObj.astNode;\n }));\n }\n\n fieldPath.pop();\n }\n }\n\n fieldPathIndexByTypeName[inputObj.name] = undefined;\n }","function detectCycleRecursive(inputObj) {\n if (visitedTypes[inputObj.name]) {\n return;\n }\n\n visitedTypes[inputObj.name] = true;\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n var fields = (0, _objectValues5.default)(inputObj.getFields());\n\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\n var field = fields[_i30];\n\n if ((0, _definition.isNonNullType)(field.type) && (0, _definition.isInputObjectType)(field.type.ofType)) {\n var fieldType = field.type.ofType;\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n fieldPath.push(field);\n\n if (cycleIndex === undefined) {\n detectCycleRecursive(fieldType);\n } else {\n var cyclePath = fieldPath.slice(cycleIndex);\n var pathStr = cyclePath.map(function (fieldObj) {\n return fieldObj.name;\n }).join('.');\n context.reportError(\"Cannot reference Input Object \\\"\".concat(fieldType.name, \"\\\" within itself through a series of non-null fields: \\\"\").concat(pathStr, \"\\\".\"), cyclePath.map(function (fieldObj) {\n return fieldObj.astNode;\n }));\n }\n\n fieldPath.pop();\n }\n }\n\n fieldPathIndexByTypeName[inputObj.name] = undefined;\n }","function detectCycleRecursive(inputObj) {\n if (visitedTypes[inputObj.name]) {\n return;\n }\n\n visitedTypes[inputObj.name] = true;\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n var fields = (0, _objectValues.default)(inputObj.getFields());\n\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\n var field = fields[_i30];\n\n if ((0, _definition.isNonNullType)(field.type) && (0, _definition.isInputObjectType)(field.type.ofType)) {\n var fieldType = field.type.ofType;\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n fieldPath.push(field);\n\n if (cycleIndex === undefined) {\n detectCycleRecursive(fieldType);\n } else {\n var cyclePath = fieldPath.slice(cycleIndex);\n var pathStr = cyclePath.map(function (fieldObj) {\n return fieldObj.name;\n }).join('.');\n context.reportError(\"Cannot reference Input Object \\\"\".concat(fieldType.name, \"\\\" within itself through a series of non-null fields: \\\"\").concat(pathStr, \"\\\".\"), cyclePath.map(function (fieldObj) {\n return fieldObj.astNode;\n }));\n }\n\n fieldPath.pop();\n }\n }\n\n fieldPathIndexByTypeName[inputObj.name] = undefined;\n }","async function walk(oid) {\n visited.add(oid);\n const { type, object } = await _readObject({ fs, cache, gitdir, oid });\n // Recursively resolve annotated tags\n if (type === 'tag') {\n const tag = GitAnnotatedTag.from(object);\n const commit = tag.headers().object;\n return walk(commit)\n }\n if (type !== 'commit') {\n throw new ObjectTypeError(oid, type, 'commit')\n }\n if (!shallows.has(oid)) {\n const commit = GitCommit.from(object);\n const parents = commit.headers().parent;\n for (oid of parents) {\n if (!finishingSet.has(oid) && !visited.has(oid)) {\n await walk(oid);\n }\n }\n }\n }","function traverse(object, visitor) {\n var key, child;\n\n if (visitor.call(null, object) === false) {\n return;\n }\n for (key in object) {\n if (object.hasOwnProperty(key)) {\n child = object[key];\n if (typeof child === 'object' && child !== null) {\n traverse(child, visitor);\n }\n }\n }\n}","function traverse(object, visitor) {\n var child;\n\n if (!object) {\n return;\n }\n\n if (visitor.call(null, object) === false) {\n return false;\n }\n for (var i = 0, keys = Object.keys(object); i < keys.length; i++) {\n child = object[keys[i]];\n if (typeof child === 'object' && child !== null) {\n if (traverse(child, visitor) === false) {\n return false;\n }\n }\n }\n }","function traverse(object, visitor, master) {\r\n var key, child, parent, path;\r\n\r\n parent = (typeof master === 'undefined') ? [] : master;\r\n\r\n if (visitor.call(null, object, parent) === false) {\r\n return;\r\n }\r\n for (key in object) {\r\n if (object.hasOwnProperty(key)) {\r\n child = object[key];\r\n path = [ object ];\r\n path.push(parent);\r\n if (typeof child === 'object' && child !== null) {\r\n traverse(child, visitor, path);\r\n }\r\n }\r\n }\r\n }","function traverseBroad(object, visitor) {\n var child;\n\n if (!object) {\n return;\n }\n\n if (visitor.call(null, object) === false) {\n return false;\n }\n for (var i = 0, keys = Object.keys(object); i < keys.length; i++) {\n child = object[key];\n if (typeof child === 'object' && child !== null) {\n traverseBroad(child, visitor);\n }\n }\n }","function getDepsRecursive(field, visited = []) {\n\tif (visited.indexOf(field) !== -1) return\n\n\tvisited.push(field)\n\tfor (let dep of field.directDependencies) getDepsRecursive(dep, visited)\n\n\treturn visited\n}","function circularReferenceCheck(shadows) {\n // if any of the current objects to process exist in the queue\n // then throw an error.\n shadows.forEach(function (item) {\n if (item instanceof Object && visited.indexOf(item) > -1) {\n throw new Error('Circular reference error');\n }\n });\n // if none of the current objects were in the queue\n // then add references to the queue.\n visited = visited.concat(shadows);\n }","function checkStructure(object, structure) {\n var key, child, tempList;\n \n visitor.call(null, object);\n for (key in object) {\n if (object.hasOwnProperty(key)) {\n child = object[key];\n if (typeof child === 'object' && child !== null) {\n tempList = ancestors.concat(object.type);\n traverse(child, tempList, visitor);\n // call checkStructure at every leaf\n } else {\n checkStructure(ancestors);\n }\n }\n }\n }","function traverse(config) {\n const tree = [];\n const stack = [config.filename];\n\n while (stack.length) {\n const dependency = stack.pop();\n debug(`traversing ${dependency}`);\n\n if (config.visited[dependency]) {\n populateFromCache(dependency);\n } else {\n traverseDependency(dependency);\n }\n }\n\n return tree;\n\n function traverseDependency(dependency) {\n const localConfig = config.clone();\n localConfig.filename = dependency;\n\n let dependencies = module.exports._getDependencies(localConfig);\n\n if (config.filter) {\n debug('using filter function to filter out dependencies');\n debug(`number of dependencies before filtering: ${dependencies.length}`);\n dependencies = dependencies.filter(function (filePath) {\n return localConfig.filter(filePath, localConfig.filename);\n });\n debug(`number of dependencies after filtering: ${dependencies.length}`);\n }\n\n debug('cabinet-resolved all dependencies: ', dependencies); // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n\n tree[dependency] = dependencies;\n const filePathMap = config.pathMap.find(pathMapEntry => pathMapEntry.file === dependency);\n if (!filePathMap) throw new Error(`file ${dependency} is missing from PathMap`);\n config.visited[dependency] = {\n pathMap: filePathMap,\n missing: config.nonExistent[dependency],\n error: config.errors[dependency]\n };\n stack.push(...dependencies);\n }\n\n function populateFromCache(dependency) {\n debug(`already visited ${dependency}. Will try to find it and its dependencies in the cache`);\n const dependenciesStack = [dependency];\n\n while (dependenciesStack.length) {\n findAllDependenciesInCache(dependenciesStack);\n }\n }\n\n function findAllDependenciesInCache(dependenciesStack) {\n const dependency = dependenciesStack.pop();\n\n if (!config.visited[dependency]) {\n debug(`unable to find ${dependency} in the cache, it was probably filtered before`);\n return;\n }\n\n debug(`found ${dependency} in the cache`);\n const dependencies = config.visited[dependency].pathMap.dependencies.map(d => d.resolvedDep); // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n\n tree[dependency] = dependencies;\n config.pathMap.push(config.visited[dependency].pathMap);\n\n if (config.visited[dependency].missing) {\n config.nonExistent[dependency] = config.visited[dependency].missing;\n }\n\n if (config.visited[dependency].error) {\n config.errors[dependency] = config.visited[dependency].error;\n }\n\n dependencies.forEach(d => {\n if (!tree[d]) dependenciesStack.push(d);\n });\n }\n}","function iterate(obj) {\n // watch for objects we've already iterated so we won't end in endless cycle\n // for cases like var foo = {}; foo.bar = foo; iterate(foo);\n var walked = [];\n var stack = [{obj: obj, stack: ''}];\n while (stack.length > 0) {\n var item = stack.pop();\n var obj = item.obj;\n for (var property in obj) {\n if (obj.hasOwnProperty(property)) {\n if (typeof obj[property] == \"object\") {\n // check if we haven't iterated through the reference yet\n var alreadyFound = false;\n for (var i = 0; i < walked.length; i++) {\n if (walked[i] === obj[property]) {\n alreadyFound = true;\n break;\n }\n }\n // new object reference\n if (!alreadyFound) {\n walked.push(obj[property]);\n stack.push({obj: obj[property], stack: item.stack + '.' + property});\n }\n }\n else {\n console.log(item.stack + '.' + property + \"=\" + obj[property]);\n }\n }\n }\n }\n }","detectCycles() {\n\t\t\tconst flatOrder = Array.from(this.orderedNodes);\n\n\t\t\tfor (let i = 0; i < flatOrder.length; i++) {\n\t\t\t\tconst node = flatOrder[i];\n\n\t\t\t\tfor (const imp of node.analyze.value.importFirstUsage) {\n\t\t\t\t\tconst subnode = node.getNodeFromRelativeDependency(imp.source);\n\t\t\t\t\tif (subnode === undefined) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tconst resolved = subnode.resolveImport(imp.imported, imp.loc);\n\t\t\t\t\tif (resolved.type !== \"FOUND\") {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Hoisted exports will always be accessible\n\t\t\t\t\tif (resolved.record.valueType === \"function\") {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tconst dep = resolved.node;\n\n\t\t\t\t\tconst isBefore = flatOrder.indexOf(dep) > i;\n\t\t\t\t\tif (isBefore) {\n\t\t\t\t\t\tthis.flagCycle(node, dep, imp);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}","function helper(node, visited, stack) {\n visited.add(node);\n if (deps[node] != undefined) {\n for (let i = 0; i < deps[node].length; i++) {\n let dep_node = deps[node][i];\n if (!visited.has(dep_node)) {\n helper(dep_node, visited, stack);\n }\n }\n }\n stack.push(node);\n}","async function walk (oid) {\n visited.add(oid);\n let { type, object } = await GitObjectManager.read({ fs, gitdir, oid });\n if (type !== 'commit') {\n throw new Error(`Expected type commit but type is ${type}`)\n }\n let commit = GitCommit.from(object);\n let parents = commit.headers().parent;\n for (oid of parents) {\n if (!finishingSet.has(oid) && !visited.has(oid)) {\n await walk(oid);\n }\n }\n }","function _dfs(obj, cb) { \n\t// Recursive fn\n\tfunction _walk(current) {\n\t\t// Run callback\n\t\tcb(current);\n\t\t// Destructure to get children\n\t\tconst {\n\t\t\tchildren\n\t\t} = current;\n\n\t\tif (children) {\n\t\t\tchildren.forEach(e => {\n\t\t\t\t_walk(e);\n\t\t\t});\n\t\t}\n\t};\n\n\twalk(obj);\n}","function walkObject()\n\t\t{\n\t\t\tfunction process(value, index, depth)\n\t\t\t{\n\t\t\t\ttrace(indent(depth) + '[' +index+ '] ' + value);\n\t\t\t}\n\n\t\t\tUtils.walk(arr, process);\n\t\t\tUtils.walk(obj, process);\n\t\t}","function visit(name) {\n var field = map[name];\n if (name in marked) {\n console.warn(\"Cyclic dependency among fields detected in %O\", fieldList);\n return fieldList;\n }\n if (!(name in visited)) {\n marked[name] = true;\n forEachDep(field, function(depName) {\n visit(depName);\n });\n delete marked[name];\n visited[name] = true;\n result.push(field);\n }\n }","async function walk(oid) {\n if (visited.has(oid)) return\n visited.add(oid);\n const { type, object } = await _readObject({ fs, cache, gitdir, oid });\n if (type === 'tag') {\n const tag = GitAnnotatedTag.from(object);\n const obj = tag.headers().object;\n await walk(obj);\n } else if (type === 'commit') {\n const commit = GitCommit.from(object);\n const tree = commit.headers().tree;\n await walk(tree);\n } else if (type === 'tree') {\n const tree = GitTree.from(object);\n for (const entry of tree) {\n // add blobs to the set\n // skip over submodules whose type is 'commit'\n if (entry.type === 'blob') {\n visited.add(entry.oid);\n }\n // recurse for trees\n if (entry.type === 'tree') {\n await walk(entry.oid);\n }\n }\n }\n }","function checkChildren(object) {\n let analyzedObject = {\n elements: [],\n };\n // go through every child and fetch component decorators\n if (typeof object.children != 'undefined') {\n object.children.forEach(val => {\n let componentInfo = getComponentInfo(val);\n let componentDecorators = getChildComponentDecorators(componentInfo);\n let componentInputs = getChildComponentInputs(componentInfo);\n\n // Create the element and put it in the array\n let element = {\n componentInfo: componentInfo,\n componentDecorators: componentDecorators,\n inputs: componentInputs,\n };\n analyzedObject.elements = [...analyzedObject.elements, element];\n //checkChildren(val);\n });\n }\n return analyzedObject;\n}","function traverse(config, dependencies, bindings, root, visit) {\n // a stack\n var stack = new Array();\n stack.push(root);\n\n while (stack.length > 0) {\n var plugin = stack.pop();\n\n visit(config[plugin]);\n\n // get all children\n if (!dependencies.hasOwnProperty(plugin)) {\n console.error('Could not find plugin', plugin);\n break;\n }\n var consumes = dependencies[plugin];\n\n for (var i = 0; i < consumes.length; i++) {\n if (!bindings.hasOwnProperty(consumes[i]) || bindings[consumes[i]].length == 0) {\n console.error('Could not find service implementation', consumes[i]);\n break;\n }\n\n stack.push(bindings[consumes[i]][0]);\n }\n }\n}","checkNodesForCircularDependencies(graph) {\n // for each node in the dependency graph, check for circular dependencies\n for (let nodeName in this.graph.nodes) {\n let dependencyPathTaken = []; // record of path when looking for cicular dependency; reset each time\n logger_1.default.system.debug(`BootDependencyGraph.checkNodesForCircularDependencies -- nodeName=${nodeName}`);\n let isCircular = this.testOneNodeForCircularPath(dependencyPathTaken, nodeName);\n if (isCircular) {\n this.errorDiag = new DGDiagnostics(`${this.context} circular dependency`, dependencyPathTaken);\n this.graphState = \"error\";\n throw this.errorDiag.description;\n }\n }\n }","function cycleCheck(node, path) {\n if (!node) {\n return;\n }\n const children = [...node.loadDependencyNames, ...node.lazyDependencyNames];\n for (const child of children) {\n if (path.indexOf(child) !== -1) {\n throw new Error(`Cyclic dependency detected! Module ${node.name} has a dependency ${child} that is also a parent!`);\n }\n cycleCheck(moduleDefinitions[child], [...path, child]);\n }\n }","function walkObjectProcess()\n\t\t{\n\t\t\t// the function to process the children\n\t\t\t\tfunction process(element, index, depth)\n\t\t\t\t{\n\t\t\t\t\ttrace (indent(depth) + '/' + element.name);\n\t\t\t\t}\n\n\t\t\t// the function to identify the children\n\t\t\t\tfunction getContents(element)\n\t\t\t\t{\n\t\t\t\t\treturn element instanceof Folder ? element.contents : null;\n\t\t\t\t}\n\n\t\t\t// start processing\n\t\t\t\tvar folder = new Folder('{user}');\n\t\t\t\tUtils.walk (folder, process, getContents)\n\t\t}","function traverse(node, func) {\n\tfunc(node);//1\n\tfor (var key in node) { //2\n\t\tif (node.hasOwnProperty(key)) { //3\n\t\t\tvar child = node[key];\n\t\t\tif (typeof child === 'object' && child !== null) { //4\n\n\t\t\t\tif (Array.isArray(child)) {\n\t\t\t\t\tchild.forEach(function (node) { //5\n\t\t\t\t\t\ttraverse(node, func);\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\ttraverse(child, func); //6\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","function walkImpl(root, traversalStrategy, beforeFunc, afterFunc, context, collectResults) {\n return (function _walk(stack, value, key, parent) {\n if (isObject(value) && stack.indexOf(value) >= 0)\n throw new TypeError('A cycle was detected at ' + value);\n\n if (beforeFunc) {\n var result = beforeFunc.call(context, value, key, parent);\n if (result === stopWalk) return stopWalk;\n if (result === stopRecursion) return; // eslint-disable-line consistent-return\n }\n\n var subResults;\n var target = traversalStrategy(value);\n\n if (isObject(target) && Object.keys(target).length > 0) {\n // Collect results from subtrees in the same shape as the target.\n if (collectResults) subResults = Array.isArray(target) ? [] : {};\n\n var ok = each(target, function(obj, key) {\n var result = _walk(copyAndPush(stack, value), obj, key, value);\n if (result === stopWalk) return false;\n if (subResults) subResults[key] = result;\n });\n if (!ok) return stopWalk;\n }\n if (afterFunc) return afterFunc.call(context, value, key, parent, subResults);\n })([], root);\n}","function iterDeps(method, obj, depKey, seen, meta) {\n\n var guid = guidFor(obj);\n if (!seen[guid]) seen[guid] = {};\n if (seen[guid][depKey]) return;\n seen[guid][depKey] = true;\n\n var deps = meta.deps;\n deps = deps && deps[depKey];\n if (deps) {\n for(var key in deps) {\n if (DEP_SKIP[key]) continue;\n method(obj, key);\n }\n }\n}","traverseDown (callback, object, property, parent) {\n\t\t\tif (Array.isArray(object)) {\n\t\t\t\tobject.forEach((item, i) => _.traverse(callback, item, i, object));\n\t\t\t}\n\t\t\telse if (Mavo.isPlainObject(object)) {\n\t\t\t\tfor (var prop in object) {\n\t\t\t\t\t_.traverse(callback, object[prop], prop, object);\n\t\t\t\t}\n\t\t\t}\n\t\t}","function traverse(val){_traverse(val,seenObjects);seenObjects.clear();}","function traverse(val){_traverse(val,seenObjects);seenObjects.clear();}","visit(node) {\n node.state = 1 /* IN_PROGRESS */;\n for (const edge of Object.values(node.dependencies)) {\n const target = this.nodes[edge.to];\n switch (target.state) {\n case 2 /* VISITED */: break; // Do nothing, since node was already visited\n case 1 /* IN_PROGRESS */:\n this.visitOpenNode(node, target, edge);\n break;\n case 0 /* NOT_VISITED */: this.visit(target);\n }\n }\n if (node.state !== 2 /* VISITED */) {\n node.state = 2 /* VISITED */;\n this.sortedNodeList.push(node.hash);\n }\n }","async function walk (oid) {\n visited.add(oid);\n let { type, object } = await GitObjectManager.read({ fs, gitdir, oid });\n if (type === 'commit') {\n let commit = GitCommit.from(object);\n let tree = commit.headers().tree;\n await walk(tree);\n } else if (type === 'tree') {\n let tree = GitTree.from(object);\n for (let entry of tree) {\n visited.add(entry.oid);\n // only recurse for trees\n if (entry.type === 'tree') {\n await walk(entry.oid);\n }\n }\n }\n }","function visit(node, visitFunction, parentsList) {\n\t\tvar parents = (typeof parentsList === 'undefined') ? [] : parentsList;\n\t\n\t\tvisitFunction = visitFunction || false;\n\t\tif (visitFunction && visitFunction(node,parentsList) == false) {\n\t\t\treturn;\n\t\t}\n\t\tfor (key in node) {\n\t\t\tif (node.hasOwnProperty(key)) {\n\t\t\t\tchild = node[key];\n\t\t\t\tpath = [ node ];\n\t\t\t\tpath.push(parents);\n\t\t\t\tif (typeof child === 'object' && child !== null) {\n\t\t\t\t\tvisit(child, visitFunction, path);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","function visitNodes(node, action, context)\r\n {\r\n for (var fieldname in node)\r\n {\r\n var childNode = node[fieldname];\r\n if (childNode == undefined)\r\n continue;\r\n\r\n action(node, fieldname, context);\r\n if (typeof(childNode) != 'object')\r\n continue;\r\n\r\n if (childNode instanceof Array)\r\n {\r\n for (var i = 0; i < childNode.length; i++)\r\n {\r\n if (typeof(childNode[i]) == 'object')\r\n visitNodes(childNode[i], action, context);\r\n }\r\n }\r\n else\r\n {\r\n visitNodes(childNode, action, context);\r\n }\r\n }\r\n }","function inOrderTraversal(node) {}","function traverse (obj, callback, trail) {\n trail = trail || [];\n\n Object.keys(obj).forEach(function (key) {\n let value = obj[key]\n , undef = typeof value === \"undefined\" || value === null\n ;\n\n if (!undef && Object.getPrototypeOf(value) === Object.prototype)\n traverse(value, callback, trail.concat(key));\n else\n callback.call(obj, key, value, trail);\n });\n}","static _coalesceConvert_doRecurse (obj, fn) {\n\t\tif (typeof obj !== \"object\") throw new TypeError(`Non-object ${obj} passed to object handler!`);\n\n\t\tif (obj instanceof Array) {\n\t\t\tfn(obj);\n\n\t\t\tobj.forEach(it => {\n\t\t\t\tif (typeof it !== \"object\") return;\n\t\t\t\tthis._coalesceConvert_doRecurse(it, fn)\n\t\t\t});\n\t\t} else {\n\t\t\tif (obj.type) {\n\t\t\t\tconst childMeta = Renderer.ENTRIES_WITH_CHILDREN.find(it => it.type === obj.type && obj[it.key]);\n\t\t\t\tif (childMeta) {\n\t\t\t\t\tthis._coalesceConvert_doRecurse(obj[childMeta.key], fn);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","traverse(fn, skipSelf = false) {\n const me = this;\n\n if (!skipSelf) {\n fn.call(me, me);\n }\n if (me.isLoaded) me.children.forEach((child) => child.traverse(fn));\n }","function iterateOverChildren(obj)\n\t\t{\n\t\t\tfor(var key in obj)\n\t\t\t{\n\t\t\t\tvar value = obj[key];\n\n\t\t\t\tif(value instanceof Object)\n\t\t\t\t{\n\t\t\t\t\titerateOverChildren(value);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttranslationList.push({\n\t\t\t\t\t\tobject: obj,\n\t\t\t\t\t\tproperty: key\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t}","function traverse(obj) {\n _lodash2.default.each(obj, function (val, indexOrProp) {\n // Move deeper into the object\n var next = obj[indexOrProp];\n\n // If we can go no further, then quit\n if (MongoObject.isBasicObject(next)) {\n traverse(next);\n } else if (Array.isArray(next)) {\n obj[indexOrProp] = _lodash2.default.without(next, REMOVED_MARKER);\n traverse(obj[indexOrProp]);\n }\n });\n }","function collectTransitiveDependencies(collected, depGraph, fromName) {\n\t var immediateDeps = depGraph[fromName];\n\t if (immediateDeps) {\n\t Object.keys(immediateDeps).forEach(function (toName) {\n\t if (!collected[toName]) {\n\t collected[toName] = true;\n\t collectTransitiveDependencies(collected, depGraph, toName);\n\t }\n\t });\n\t }\n\t}","function traverseObject(someObj) {\r\n \r\n console.log(someObj);\r\n}","function traverseDependencyGraph(graph, package, affectedPackages) {\n // Terminate early if the package has been visited.\n if (affectedPackages.has(package)) {\n return;\n }\n\n const consumingPackages = graph[package];\n\n if (!consumingPackages) {\n return;\n }\n\n consumingPackages.forEach(consumingPackage => {\n traverseDependencyGraph(graph, consumingPackage, affectedPackages);\n affectedPackages.add(consumingPackage);\n });\n}","function traverse(val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function walk(obj) {\n Object.getOwnPropertyNames(obj).forEach(function (name) {\n if (!whitelisted[name]) {\n if (!clobber(obj, name)) {\n // FIXME: this is lame\n failed.push('could not clobber \"' + name + '\": ' + e.message);\n }\n }\n });\n\n for (var name in blacklisted) {\n if (obj.hasOwnProperty(name) && !clobber(obj, name)) {\n // FIXME: this is lame\n failed.push('could not clobber \"' + name + '\": ' + e.message);\n }\n }\n\n var prototype = obj.constructor.prototype;\n if (prototype && prototype !== obj) {\n walk(prototype);\n }\n\n var proto = Object.getPrototypeOf(obj);\n if (proto && proto !== obj) {\n walk(proto);\n }\n }","function collectTransitiveDependencies(collected, depGraph, fromName) {\n var immediateDeps = depGraph[fromName];\n if (immediateDeps) {\n Object.keys(immediateDeps).forEach(function (toName) {\n if (!collected[toName]) {\n collected[toName] = true;\n collectTransitiveDependencies(collected, depGraph, toName);\n }\n });\n }\n}","function collectTransitiveDependencies(collected, depGraph, fromName) {\n var immediateDeps = depGraph[fromName];\n if (immediateDeps) {\n Object.keys(immediateDeps).forEach(function (toName) {\n if (!collected[toName]) {\n collected[toName] = true;\n collectTransitiveDependencies(collected, depGraph, toName);\n }\n });\n }\n}","function walkDeps(childs, path, tree) {\n for (var i = 0, size = childs.length; i < size; i++) {\n var cur = childs[i];\n // check if the path contains the child (a circular dependency)\n if (path.indexOf(cur) > -1) {\n path.push(cur);\n return true;\n }\n // walk the children of this child\n var curChilds = tree[cur];\n if (curChilds != null) {\n // push and pop the child before and after the sub-walk\n path.push(cur);\n // recursively walk children\n var res = walkDeps(curChilds, path, tree);\n if (res)\n return res;\n path.pop();\n }\n }\n return false;\n }","function object_traverse(callback, obj) {\n\n\t// If the callback returns false, return.\n\tvar cret = callback(obj);\n\tif (cret !== undefined) {\n\t\treturn cret;\n\t}\n\n\t// Traverse properties\n\t// TODO: Handle non-enumerable properties, etc\n\tvar p;\n\tfor (p in obj) {\n\t\tif (typeof obj[p] === 'object') {\n\t\t\tvar ret = object_traverse(callback, obj[p]);\n\t\t\tif (ret !== undefined) {\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Explicitly return nothing\n\treturn undefined;\n}","function traverse(val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function traverse(val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function scan(obj, parent) {\r\n var k;\r\n if (obj instanceof Object) {\r\n for (k in obj) {\r\n if (obj.hasOwnProperty(k)) {\r\n //recursive call to scan property\r\n scan(obj[k], parent + \"['\" + k + \"']\");\r\n }\r\n }\r\n } else {\r\n\r\n };\r\n arr.push({\r\n parent: parent,\r\n obj: obj\r\n });\r\n }","traverse(fn, skipSelf = false) {\n const {\n children\n } = this;\n\n if (!skipSelf) {\n fn.call(this, this);\n } // Simply testing whether there is non-zero children length\n // is 10x faster than using this.isLoaded\n\n for (let i = 0, l = children && children.length; i < l; i++) {\n children[i].traverse(fn);\n }\n }","function re_dependency(re){var i,l,r\n switch(re[0]){\n case 0:\n case 1:\n case 8:\n return\n case 2:\n case 3:\n for(i=0,l=re[1].length;i depth) {\n depth = depthTemp;\n }\n depthTemp = 0;\n });\n }\n depthTemp++;\n }","function detectCycles (rows) {\n var cyclicalModules = new Set()\n var checked = new Set()\n rows.forEach(function (module) {\n var visited = []\n\n check(module)\n\n function check (row) {\n var i = visited.indexOf(row)\n if (i !== -1) {\n checked.add(row)\n for (; i < visited.length; i++) {\n cyclicalModules.add(visited[i])\n }\n return\n }\n if (checked.has(row)) return\n visited.push(row)\n Object.keys(row.deps).forEach(function (k) {\n var dep = row.deps[k]\n var other = rows.byId[dep]\n if (other) check(other, visited)\n })\n visited.pop()\n }\n })\n\n // mark cyclical dependencies\n for (var i = 0; i < rows.length; i++) {\n rows[i][kEvaluateOnDemand] = cyclicalModules.has(rows[i])\n }\n return cyclicalModules.size > 0\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n }","function traverse (val) {\r\n _traverse(val, seenObjects);\r\n seenObjects.clear();\r\n}","function collectTransitiveDependencies(collected, depGraph, fromName) {\n var immediateDeps = depGraph[fromName];\n\n if (immediateDeps) {\n for (var _i4 = 0, _Object$keys2 = Object.keys(immediateDeps); _i4 < _Object$keys2.length; _i4++) {\n var toName = _Object$keys2[_i4];\n\n if (!collected[toName]) {\n collected[toName] = true;\n collectTransitiveDependencies(collected, depGraph, toName);\n }\n }\n }\n}","function collectTransitiveDependencies(collected, depGraph, fromName) {\n var immediateDeps = depGraph[fromName];\n\n if (immediateDeps) {\n for (var _i4 = 0, _Object$keys2 = Object.keys(immediateDeps); _i4 < _Object$keys2.length; _i4++) {\n var toName = _Object$keys2[_i4];\n\n if (!collected[toName]) {\n collected[toName] = true;\n collectTransitiveDependencies(collected, depGraph, toName);\n }\n }\n }\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}","function traverse (val) {\n _traverse(val, seenObjects);\n seenObjects.clear();\n}"],"string":"[\n \"function traverse(object, ancestors, visitor) {\\n var key, child, tempList;\\n\\n visitor.call(null, object);\\n for (key in object) {\\n if (object.hasOwnProperty(key)) {\\n child = object[key];\\n if (typeof child === 'object' && child !== null) {\\n tempList = ancestors.concat(object.type);\\n traverse(child, tempList, visitor);\\n // call checkStructure at every leaf\\n } else {\\n checkStructure(ancestors);\\n }\\n }\\n }\\n }\",\n \"function detectCycleRecursive(inputObj) {\\n if (visitedTypes[inputObj.name]) {\\n return;\\n }\\n\\n visitedTypes[inputObj.name] = true;\\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\\n var fields = Object(_polyfills_objectValues_mjs__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(inputObj.getFields());\\n\\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\\n var field = fields[_i30];\\n\\n if (Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_10__[\\\"isNonNullType\\\"])(field.type) && Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_10__[\\\"isInputObjectType\\\"])(field.type.ofType)) {\\n var fieldType = field.type.ofType;\\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\\n fieldPath.push(field);\\n\\n if (cycleIndex === undefined) {\\n detectCycleRecursive(fieldType);\\n } else {\\n var cyclePath = fieldPath.slice(cycleIndex);\\n var pathStr = cyclePath.map(function (fieldObj) {\\n return fieldObj.name;\\n }).join('.');\\n context.reportError(\\\"Cannot reference Input Object \\\\\\\"\\\".concat(fieldType.name, \\\"\\\\\\\" within itself through a series of non-null fields: \\\\\\\"\\\").concat(pathStr, \\\"\\\\\\\".\\\"), cyclePath.map(function (fieldObj) {\\n return fieldObj.astNode;\\n }));\\n }\\n\\n fieldPath.pop();\\n }\\n }\\n\\n fieldPathIndexByTypeName[inputObj.name] = undefined;\\n }\",\n \"function detectCycleRecursive(inputObj) {\\n if (visitedTypes[inputObj.name]) {\\n return;\\n }\\n\\n visitedTypes[inputObj.name] = true;\\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\\n var fields = Object(_polyfills_objectValues_mjs__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"])(inputObj.getFields());\\n\\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\\n var field = fields[_i30];\\n\\n if (Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_11__[\\\"isNonNullType\\\"])(field.type) && Object(_definition_mjs__WEBPACK_IMPORTED_MODULE_11__[\\\"isInputObjectType\\\"])(field.type.ofType)) {\\n var fieldType = field.type.ofType;\\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\\n fieldPath.push(field);\\n\\n if (cycleIndex === undefined) {\\n detectCycleRecursive(fieldType);\\n } else {\\n var cyclePath = fieldPath.slice(cycleIndex);\\n var pathStr = cyclePath.map(function (fieldObj) {\\n return fieldObj.name;\\n }).join('.');\\n context.reportError(\\\"Cannot reference Input Object \\\\\\\"\\\".concat(fieldType.name, \\\"\\\\\\\" within itself through a series of non-null fields: \\\\\\\"\\\").concat(pathStr, \\\"\\\\\\\".\\\"), cyclePath.map(function (fieldObj) {\\n return fieldObj.astNode;\\n }));\\n }\\n\\n fieldPath.pop();\\n }\\n }\\n\\n fieldPathIndexByTypeName[inputObj.name] = undefined;\\n }\",\n \"function detectCycleRecursive(inputObj) {\\n if (visitedTypes[inputObj.name]) {\\n return;\\n }\\n\\n visitedTypes[inputObj.name] = true;\\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\\n var fields = (0, _objectValues5.default)(inputObj.getFields());\\n\\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\\n var field = fields[_i30];\\n\\n if ((0, _definition.isNonNullType)(field.type) && (0, _definition.isInputObjectType)(field.type.ofType)) {\\n var fieldType = field.type.ofType;\\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\\n fieldPath.push(field);\\n\\n if (cycleIndex === undefined) {\\n detectCycleRecursive(fieldType);\\n } else {\\n var cyclePath = fieldPath.slice(cycleIndex);\\n var pathStr = cyclePath.map(function (fieldObj) {\\n return fieldObj.name;\\n }).join('.');\\n context.reportError(\\\"Cannot reference Input Object \\\\\\\"\\\".concat(fieldType.name, \\\"\\\\\\\" within itself through a series of non-null fields: \\\\\\\"\\\").concat(pathStr, \\\"\\\\\\\".\\\"), cyclePath.map(function (fieldObj) {\\n return fieldObj.astNode;\\n }));\\n }\\n\\n fieldPath.pop();\\n }\\n }\\n\\n fieldPathIndexByTypeName[inputObj.name] = undefined;\\n }\",\n \"function detectCycleRecursive(inputObj) {\\n if (visitedTypes[inputObj.name]) {\\n return;\\n }\\n\\n visitedTypes[inputObj.name] = true;\\n fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\\n var fields = (0, _objectValues.default)(inputObj.getFields());\\n\\n for (var _i30 = 0; _i30 < fields.length; _i30++) {\\n var field = fields[_i30];\\n\\n if ((0, _definition.isNonNullType)(field.type) && (0, _definition.isInputObjectType)(field.type.ofType)) {\\n var fieldType = field.type.ofType;\\n var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\\n fieldPath.push(field);\\n\\n if (cycleIndex === undefined) {\\n detectCycleRecursive(fieldType);\\n } else {\\n var cyclePath = fieldPath.slice(cycleIndex);\\n var pathStr = cyclePath.map(function (fieldObj) {\\n return fieldObj.name;\\n }).join('.');\\n context.reportError(\\\"Cannot reference Input Object \\\\\\\"\\\".concat(fieldType.name, \\\"\\\\\\\" within itself through a series of non-null fields: \\\\\\\"\\\").concat(pathStr, \\\"\\\\\\\".\\\"), cyclePath.map(function (fieldObj) {\\n return fieldObj.astNode;\\n }));\\n }\\n\\n fieldPath.pop();\\n }\\n }\\n\\n fieldPathIndexByTypeName[inputObj.name] = undefined;\\n }\",\n \"async function walk(oid) {\\n visited.add(oid);\\n const { type, object } = await _readObject({ fs, cache, gitdir, oid });\\n // Recursively resolve annotated tags\\n if (type === 'tag') {\\n const tag = GitAnnotatedTag.from(object);\\n const commit = tag.headers().object;\\n return walk(commit)\\n }\\n if (type !== 'commit') {\\n throw new ObjectTypeError(oid, type, 'commit')\\n }\\n if (!shallows.has(oid)) {\\n const commit = GitCommit.from(object);\\n const parents = commit.headers().parent;\\n for (oid of parents) {\\n if (!finishingSet.has(oid) && !visited.has(oid)) {\\n await walk(oid);\\n }\\n }\\n }\\n }\",\n \"function traverse(object, visitor) {\\n var key, child;\\n\\n if (visitor.call(null, object) === false) {\\n return;\\n }\\n for (key in object) {\\n if (object.hasOwnProperty(key)) {\\n child = object[key];\\n if (typeof child === 'object' && child !== null) {\\n traverse(child, visitor);\\n }\\n }\\n }\\n}\",\n \"function traverse(object, visitor) {\\n var child;\\n\\n if (!object) {\\n return;\\n }\\n\\n if (visitor.call(null, object) === false) {\\n return false;\\n }\\n for (var i = 0, keys = Object.keys(object); i < keys.length; i++) {\\n child = object[keys[i]];\\n if (typeof child === 'object' && child !== null) {\\n if (traverse(child, visitor) === false) {\\n return false;\\n }\\n }\\n }\\n }\",\n \"function traverse(object, visitor, master) {\\r\\n var key, child, parent, path;\\r\\n\\r\\n parent = (typeof master === 'undefined') ? [] : master;\\r\\n\\r\\n if (visitor.call(null, object, parent) === false) {\\r\\n return;\\r\\n }\\r\\n for (key in object) {\\r\\n if (object.hasOwnProperty(key)) {\\r\\n child = object[key];\\r\\n path = [ object ];\\r\\n path.push(parent);\\r\\n if (typeof child === 'object' && child !== null) {\\r\\n traverse(child, visitor, path);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"function traverseBroad(object, visitor) {\\n var child;\\n\\n if (!object) {\\n return;\\n }\\n\\n if (visitor.call(null, object) === false) {\\n return false;\\n }\\n for (var i = 0, keys = Object.keys(object); i < keys.length; i++) {\\n child = object[key];\\n if (typeof child === 'object' && child !== null) {\\n traverseBroad(child, visitor);\\n }\\n }\\n }\",\n \"function getDepsRecursive(field, visited = []) {\\n\\tif (visited.indexOf(field) !== -1) return\\n\\n\\tvisited.push(field)\\n\\tfor (let dep of field.directDependencies) getDepsRecursive(dep, visited)\\n\\n\\treturn visited\\n}\",\n \"function circularReferenceCheck(shadows) {\\n // if any of the current objects to process exist in the queue\\n // then throw an error.\\n shadows.forEach(function (item) {\\n if (item instanceof Object && visited.indexOf(item) > -1) {\\n throw new Error('Circular reference error');\\n }\\n });\\n // if none of the current objects were in the queue\\n // then add references to the queue.\\n visited = visited.concat(shadows);\\n }\",\n \"function checkStructure(object, structure) {\\n var key, child, tempList;\\n \\n visitor.call(null, object);\\n for (key in object) {\\n if (object.hasOwnProperty(key)) {\\n child = object[key];\\n if (typeof child === 'object' && child !== null) {\\n tempList = ancestors.concat(object.type);\\n traverse(child, tempList, visitor);\\n // call checkStructure at every leaf\\n } else {\\n checkStructure(ancestors);\\n }\\n }\\n }\\n }\",\n \"function traverse(config) {\\n const tree = [];\\n const stack = [config.filename];\\n\\n while (stack.length) {\\n const dependency = stack.pop();\\n debug(`traversing ${dependency}`);\\n\\n if (config.visited[dependency]) {\\n populateFromCache(dependency);\\n } else {\\n traverseDependency(dependency);\\n }\\n }\\n\\n return tree;\\n\\n function traverseDependency(dependency) {\\n const localConfig = config.clone();\\n localConfig.filename = dependency;\\n\\n let dependencies = module.exports._getDependencies(localConfig);\\n\\n if (config.filter) {\\n debug('using filter function to filter out dependencies');\\n debug(`number of dependencies before filtering: ${dependencies.length}`);\\n dependencies = dependencies.filter(function (filePath) {\\n return localConfig.filter(filePath, localConfig.filename);\\n });\\n debug(`number of dependencies after filtering: ${dependencies.length}`);\\n }\\n\\n debug('cabinet-resolved all dependencies: ', dependencies); // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\\n\\n tree[dependency] = dependencies;\\n const filePathMap = config.pathMap.find(pathMapEntry => pathMapEntry.file === dependency);\\n if (!filePathMap) throw new Error(`file ${dependency} is missing from PathMap`);\\n config.visited[dependency] = {\\n pathMap: filePathMap,\\n missing: config.nonExistent[dependency],\\n error: config.errors[dependency]\\n };\\n stack.push(...dependencies);\\n }\\n\\n function populateFromCache(dependency) {\\n debug(`already visited ${dependency}. Will try to find it and its dependencies in the cache`);\\n const dependenciesStack = [dependency];\\n\\n while (dependenciesStack.length) {\\n findAllDependenciesInCache(dependenciesStack);\\n }\\n }\\n\\n function findAllDependenciesInCache(dependenciesStack) {\\n const dependency = dependenciesStack.pop();\\n\\n if (!config.visited[dependency]) {\\n debug(`unable to find ${dependency} in the cache, it was probably filtered before`);\\n return;\\n }\\n\\n debug(`found ${dependency} in the cache`);\\n const dependencies = config.visited[dependency].pathMap.dependencies.map(d => d.resolvedDep); // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\\n\\n tree[dependency] = dependencies;\\n config.pathMap.push(config.visited[dependency].pathMap);\\n\\n if (config.visited[dependency].missing) {\\n config.nonExistent[dependency] = config.visited[dependency].missing;\\n }\\n\\n if (config.visited[dependency].error) {\\n config.errors[dependency] = config.visited[dependency].error;\\n }\\n\\n dependencies.forEach(d => {\\n if (!tree[d]) dependenciesStack.push(d);\\n });\\n }\\n}\",\n \"function iterate(obj) {\\n // watch for objects we've already iterated so we won't end in endless cycle\\n // for cases like var foo = {}; foo.bar = foo; iterate(foo);\\n var walked = [];\\n var stack = [{obj: obj, stack: ''}];\\n while (stack.length > 0) {\\n var item = stack.pop();\\n var obj = item.obj;\\n for (var property in obj) {\\n if (obj.hasOwnProperty(property)) {\\n if (typeof obj[property] == \\\"object\\\") {\\n // check if we haven't iterated through the reference yet\\n var alreadyFound = false;\\n for (var i = 0; i < walked.length; i++) {\\n if (walked[i] === obj[property]) {\\n alreadyFound = true;\\n break;\\n }\\n }\\n // new object reference\\n if (!alreadyFound) {\\n walked.push(obj[property]);\\n stack.push({obj: obj[property], stack: item.stack + '.' + property});\\n }\\n }\\n else {\\n console.log(item.stack + '.' + property + \\\"=\\\" + obj[property]);\\n }\\n }\\n }\\n }\\n }\",\n \"detectCycles() {\\n\\t\\t\\tconst flatOrder = Array.from(this.orderedNodes);\\n\\n\\t\\t\\tfor (let i = 0; i < flatOrder.length; i++) {\\n\\t\\t\\t\\tconst node = flatOrder[i];\\n\\n\\t\\t\\t\\tfor (const imp of node.analyze.value.importFirstUsage) {\\n\\t\\t\\t\\t\\tconst subnode = node.getNodeFromRelativeDependency(imp.source);\\n\\t\\t\\t\\t\\tif (subnode === undefined) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tconst resolved = subnode.resolveImport(imp.imported, imp.loc);\\n\\t\\t\\t\\t\\tif (resolved.type !== \\\"FOUND\\\") {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t// Hoisted exports will always be accessible\\n\\t\\t\\t\\t\\tif (resolved.record.valueType === \\\"function\\\") {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tconst dep = resolved.node;\\n\\n\\t\\t\\t\\t\\tconst isBefore = flatOrder.indexOf(dep) > i;\\n\\t\\t\\t\\t\\tif (isBefore) {\\n\\t\\t\\t\\t\\t\\tthis.flagCycle(node, dep, imp);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function helper(node, visited, stack) {\\n visited.add(node);\\n if (deps[node] != undefined) {\\n for (let i = 0; i < deps[node].length; i++) {\\n let dep_node = deps[node][i];\\n if (!visited.has(dep_node)) {\\n helper(dep_node, visited, stack);\\n }\\n }\\n }\\n stack.push(node);\\n}\",\n \"async function walk (oid) {\\n visited.add(oid);\\n let { type, object } = await GitObjectManager.read({ fs, gitdir, oid });\\n if (type !== 'commit') {\\n throw new Error(`Expected type commit but type is ${type}`)\\n }\\n let commit = GitCommit.from(object);\\n let parents = commit.headers().parent;\\n for (oid of parents) {\\n if (!finishingSet.has(oid) && !visited.has(oid)) {\\n await walk(oid);\\n }\\n }\\n }\",\n \"function _dfs(obj, cb) { \\n\\t// Recursive fn\\n\\tfunction _walk(current) {\\n\\t\\t// Run callback\\n\\t\\tcb(current);\\n\\t\\t// Destructure to get children\\n\\t\\tconst {\\n\\t\\t\\tchildren\\n\\t\\t} = current;\\n\\n\\t\\tif (children) {\\n\\t\\t\\tchildren.forEach(e => {\\n\\t\\t\\t\\t_walk(e);\\n\\t\\t\\t});\\n\\t\\t}\\n\\t};\\n\\n\\twalk(obj);\\n}\",\n \"function walkObject()\\n\\t\\t{\\n\\t\\t\\tfunction process(value, index, depth)\\n\\t\\t\\t{\\n\\t\\t\\t\\ttrace(indent(depth) + '[' +index+ '] ' + value);\\n\\t\\t\\t}\\n\\n\\t\\t\\tUtils.walk(arr, process);\\n\\t\\t\\tUtils.walk(obj, process);\\n\\t\\t}\",\n \"function visit(name) {\\n var field = map[name];\\n if (name in marked) {\\n console.warn(\\\"Cyclic dependency among fields detected in %O\\\", fieldList);\\n return fieldList;\\n }\\n if (!(name in visited)) {\\n marked[name] = true;\\n forEachDep(field, function(depName) {\\n visit(depName);\\n });\\n delete marked[name];\\n visited[name] = true;\\n result.push(field);\\n }\\n }\",\n \"async function walk(oid) {\\n if (visited.has(oid)) return\\n visited.add(oid);\\n const { type, object } = await _readObject({ fs, cache, gitdir, oid });\\n if (type === 'tag') {\\n const tag = GitAnnotatedTag.from(object);\\n const obj = tag.headers().object;\\n await walk(obj);\\n } else if (type === 'commit') {\\n const commit = GitCommit.from(object);\\n const tree = commit.headers().tree;\\n await walk(tree);\\n } else if (type === 'tree') {\\n const tree = GitTree.from(object);\\n for (const entry of tree) {\\n // add blobs to the set\\n // skip over submodules whose type is 'commit'\\n if (entry.type === 'blob') {\\n visited.add(entry.oid);\\n }\\n // recurse for trees\\n if (entry.type === 'tree') {\\n await walk(entry.oid);\\n }\\n }\\n }\\n }\",\n \"function checkChildren(object) {\\n let analyzedObject = {\\n elements: [],\\n };\\n // go through every child and fetch component decorators\\n if (typeof object.children != 'undefined') {\\n object.children.forEach(val => {\\n let componentInfo = getComponentInfo(val);\\n let componentDecorators = getChildComponentDecorators(componentInfo);\\n let componentInputs = getChildComponentInputs(componentInfo);\\n\\n // Create the element and put it in the array\\n let element = {\\n componentInfo: componentInfo,\\n componentDecorators: componentDecorators,\\n inputs: componentInputs,\\n };\\n analyzedObject.elements = [...analyzedObject.elements, element];\\n //checkChildren(val);\\n });\\n }\\n return analyzedObject;\\n}\",\n \"function traverse(config, dependencies, bindings, root, visit) {\\n // a stack\\n var stack = new Array();\\n stack.push(root);\\n\\n while (stack.length > 0) {\\n var plugin = stack.pop();\\n\\n visit(config[plugin]);\\n\\n // get all children\\n if (!dependencies.hasOwnProperty(plugin)) {\\n console.error('Could not find plugin', plugin);\\n break;\\n }\\n var consumes = dependencies[plugin];\\n\\n for (var i = 0; i < consumes.length; i++) {\\n if (!bindings.hasOwnProperty(consumes[i]) || bindings[consumes[i]].length == 0) {\\n console.error('Could not find service implementation', consumes[i]);\\n break;\\n }\\n\\n stack.push(bindings[consumes[i]][0]);\\n }\\n }\\n}\",\n \"checkNodesForCircularDependencies(graph) {\\n // for each node in the dependency graph, check for circular dependencies\\n for (let nodeName in this.graph.nodes) {\\n let dependencyPathTaken = []; // record of path when looking for cicular dependency; reset each time\\n logger_1.default.system.debug(`BootDependencyGraph.checkNodesForCircularDependencies -- nodeName=${nodeName}`);\\n let isCircular = this.testOneNodeForCircularPath(dependencyPathTaken, nodeName);\\n if (isCircular) {\\n this.errorDiag = new DGDiagnostics(`${this.context} circular dependency`, dependencyPathTaken);\\n this.graphState = \\\"error\\\";\\n throw this.errorDiag.description;\\n }\\n }\\n }\",\n \"function cycleCheck(node, path) {\\n if (!node) {\\n return;\\n }\\n const children = [...node.loadDependencyNames, ...node.lazyDependencyNames];\\n for (const child of children) {\\n if (path.indexOf(child) !== -1) {\\n throw new Error(`Cyclic dependency detected! Module ${node.name} has a dependency ${child} that is also a parent!`);\\n }\\n cycleCheck(moduleDefinitions[child], [...path, child]);\\n }\\n }\",\n \"function walkObjectProcess()\\n\\t\\t{\\n\\t\\t\\t// the function to process the children\\n\\t\\t\\t\\tfunction process(element, index, depth)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttrace (indent(depth) + '/' + element.name);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t// the function to identify the children\\n\\t\\t\\t\\tfunction getContents(element)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\treturn element instanceof Folder ? element.contents : null;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t// start processing\\n\\t\\t\\t\\tvar folder = new Folder('{user}');\\n\\t\\t\\t\\tUtils.walk (folder, process, getContents)\\n\\t\\t}\",\n \"function traverse(node, func) {\\n\\tfunc(node);//1\\n\\tfor (var key in node) { //2\\n\\t\\tif (node.hasOwnProperty(key)) { //3\\n\\t\\t\\tvar child = node[key];\\n\\t\\t\\tif (typeof child === 'object' && child !== null) { //4\\n\\n\\t\\t\\t\\tif (Array.isArray(child)) {\\n\\t\\t\\t\\t\\tchild.forEach(function (node) { //5\\n\\t\\t\\t\\t\\t\\ttraverse(node, func);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\ttraverse(child, func); //6\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"function walkImpl(root, traversalStrategy, beforeFunc, afterFunc, context, collectResults) {\\n return (function _walk(stack, value, key, parent) {\\n if (isObject(value) && stack.indexOf(value) >= 0)\\n throw new TypeError('A cycle was detected at ' + value);\\n\\n if (beforeFunc) {\\n var result = beforeFunc.call(context, value, key, parent);\\n if (result === stopWalk) return stopWalk;\\n if (result === stopRecursion) return; // eslint-disable-line consistent-return\\n }\\n\\n var subResults;\\n var target = traversalStrategy(value);\\n\\n if (isObject(target) && Object.keys(target).length > 0) {\\n // Collect results from subtrees in the same shape as the target.\\n if (collectResults) subResults = Array.isArray(target) ? [] : {};\\n\\n var ok = each(target, function(obj, key) {\\n var result = _walk(copyAndPush(stack, value), obj, key, value);\\n if (result === stopWalk) return false;\\n if (subResults) subResults[key] = result;\\n });\\n if (!ok) return stopWalk;\\n }\\n if (afterFunc) return afterFunc.call(context, value, key, parent, subResults);\\n })([], root);\\n}\",\n \"function iterDeps(method, obj, depKey, seen, meta) {\\n\\n var guid = guidFor(obj);\\n if (!seen[guid]) seen[guid] = {};\\n if (seen[guid][depKey]) return;\\n seen[guid][depKey] = true;\\n\\n var deps = meta.deps;\\n deps = deps && deps[depKey];\\n if (deps) {\\n for(var key in deps) {\\n if (DEP_SKIP[key]) continue;\\n method(obj, key);\\n }\\n }\\n}\",\n \"traverseDown (callback, object, property, parent) {\\n\\t\\t\\tif (Array.isArray(object)) {\\n\\t\\t\\t\\tobject.forEach((item, i) => _.traverse(callback, item, i, object));\\n\\t\\t\\t}\\n\\t\\t\\telse if (Mavo.isPlainObject(object)) {\\n\\t\\t\\t\\tfor (var prop in object) {\\n\\t\\t\\t\\t\\t_.traverse(callback, object[prop], prop, object);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function traverse(val){_traverse(val,seenObjects);seenObjects.clear();}\",\n \"function traverse(val){_traverse(val,seenObjects);seenObjects.clear();}\",\n \"visit(node) {\\n node.state = 1 /* IN_PROGRESS */;\\n for (const edge of Object.values(node.dependencies)) {\\n const target = this.nodes[edge.to];\\n switch (target.state) {\\n case 2 /* VISITED */: break; // Do nothing, since node was already visited\\n case 1 /* IN_PROGRESS */:\\n this.visitOpenNode(node, target, edge);\\n break;\\n case 0 /* NOT_VISITED */: this.visit(target);\\n }\\n }\\n if (node.state !== 2 /* VISITED */) {\\n node.state = 2 /* VISITED */;\\n this.sortedNodeList.push(node.hash);\\n }\\n }\",\n \"async function walk (oid) {\\n visited.add(oid);\\n let { type, object } = await GitObjectManager.read({ fs, gitdir, oid });\\n if (type === 'commit') {\\n let commit = GitCommit.from(object);\\n let tree = commit.headers().tree;\\n await walk(tree);\\n } else if (type === 'tree') {\\n let tree = GitTree.from(object);\\n for (let entry of tree) {\\n visited.add(entry.oid);\\n // only recurse for trees\\n if (entry.type === 'tree') {\\n await walk(entry.oid);\\n }\\n }\\n }\\n }\",\n \"function visit(node, visitFunction, parentsList) {\\n\\t\\tvar parents = (typeof parentsList === 'undefined') ? [] : parentsList;\\n\\t\\n\\t\\tvisitFunction = visitFunction || false;\\n\\t\\tif (visitFunction && visitFunction(node,parentsList) == false) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tfor (key in node) {\\n\\t\\t\\tif (node.hasOwnProperty(key)) {\\n\\t\\t\\t\\tchild = node[key];\\n\\t\\t\\t\\tpath = [ node ];\\n\\t\\t\\t\\tpath.push(parents);\\n\\t\\t\\t\\tif (typeof child === 'object' && child !== null) {\\n\\t\\t\\t\\t\\tvisit(child, visitFunction, path);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"function visitNodes(node, action, context)\\r\\n {\\r\\n for (var fieldname in node)\\r\\n {\\r\\n var childNode = node[fieldname];\\r\\n if (childNode == undefined)\\r\\n continue;\\r\\n\\r\\n action(node, fieldname, context);\\r\\n if (typeof(childNode) != 'object')\\r\\n continue;\\r\\n\\r\\n if (childNode instanceof Array)\\r\\n {\\r\\n for (var i = 0; i < childNode.length; i++)\\r\\n {\\r\\n if (typeof(childNode[i]) == 'object')\\r\\n visitNodes(childNode[i], action, context);\\r\\n }\\r\\n }\\r\\n else\\r\\n {\\r\\n visitNodes(childNode, action, context);\\r\\n }\\r\\n }\\r\\n }\",\n \"function inOrderTraversal(node) {}\",\n \"function traverse (obj, callback, trail) {\\n trail = trail || [];\\n\\n Object.keys(obj).forEach(function (key) {\\n let value = obj[key]\\n , undef = typeof value === \\\"undefined\\\" || value === null\\n ;\\n\\n if (!undef && Object.getPrototypeOf(value) === Object.prototype)\\n traverse(value, callback, trail.concat(key));\\n else\\n callback.call(obj, key, value, trail);\\n });\\n}\",\n \"static _coalesceConvert_doRecurse (obj, fn) {\\n\\t\\tif (typeof obj !== \\\"object\\\") throw new TypeError(`Non-object ${obj} passed to object handler!`);\\n\\n\\t\\tif (obj instanceof Array) {\\n\\t\\t\\tfn(obj);\\n\\n\\t\\t\\tobj.forEach(it => {\\n\\t\\t\\t\\tif (typeof it !== \\\"object\\\") return;\\n\\t\\t\\t\\tthis._coalesceConvert_doRecurse(it, fn)\\n\\t\\t\\t});\\n\\t\\t} else {\\n\\t\\t\\tif (obj.type) {\\n\\t\\t\\t\\tconst childMeta = Renderer.ENTRIES_WITH_CHILDREN.find(it => it.type === obj.type && obj[it.key]);\\n\\t\\t\\t\\tif (childMeta) {\\n\\t\\t\\t\\t\\tthis._coalesceConvert_doRecurse(obj[childMeta.key], fn);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"traverse(fn, skipSelf = false) {\\n const me = this;\\n\\n if (!skipSelf) {\\n fn.call(me, me);\\n }\\n if (me.isLoaded) me.children.forEach((child) => child.traverse(fn));\\n }\",\n \"function iterateOverChildren(obj)\\n\\t\\t{\\n\\t\\t\\tfor(var key in obj)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar value = obj[key];\\n\\n\\t\\t\\t\\tif(value instanceof Object)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\titerateOverChildren(value);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttranslationList.push({\\n\\t\\t\\t\\t\\t\\tobject: obj,\\n\\t\\t\\t\\t\\t\\tproperty: key\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function traverse(obj) {\\n _lodash2.default.each(obj, function (val, indexOrProp) {\\n // Move deeper into the object\\n var next = obj[indexOrProp];\\n\\n // If we can go no further, then quit\\n if (MongoObject.isBasicObject(next)) {\\n traverse(next);\\n } else if (Array.isArray(next)) {\\n obj[indexOrProp] = _lodash2.default.without(next, REMOVED_MARKER);\\n traverse(obj[indexOrProp]);\\n }\\n });\\n }\",\n \"function collectTransitiveDependencies(collected, depGraph, fromName) {\\n\\t var immediateDeps = depGraph[fromName];\\n\\t if (immediateDeps) {\\n\\t Object.keys(immediateDeps).forEach(function (toName) {\\n\\t if (!collected[toName]) {\\n\\t collected[toName] = true;\\n\\t collectTransitiveDependencies(collected, depGraph, toName);\\n\\t }\\n\\t });\\n\\t }\\n\\t}\",\n \"function traverseObject(someObj) {\\r\\n \\r\\n console.log(someObj);\\r\\n}\",\n \"function traverseDependencyGraph(graph, package, affectedPackages) {\\n // Terminate early if the package has been visited.\\n if (affectedPackages.has(package)) {\\n return;\\n }\\n\\n const consumingPackages = graph[package];\\n\\n if (!consumingPackages) {\\n return;\\n }\\n\\n consumingPackages.forEach(consumingPackage => {\\n traverseDependencyGraph(graph, consumingPackage, affectedPackages);\\n affectedPackages.add(consumingPackage);\\n });\\n}\",\n \"function traverse(val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function walk(obj) {\\n Object.getOwnPropertyNames(obj).forEach(function (name) {\\n if (!whitelisted[name]) {\\n if (!clobber(obj, name)) {\\n // FIXME: this is lame\\n failed.push('could not clobber \\\"' + name + '\\\": ' + e.message);\\n }\\n }\\n });\\n\\n for (var name in blacklisted) {\\n if (obj.hasOwnProperty(name) && !clobber(obj, name)) {\\n // FIXME: this is lame\\n failed.push('could not clobber \\\"' + name + '\\\": ' + e.message);\\n }\\n }\\n\\n var prototype = obj.constructor.prototype;\\n if (prototype && prototype !== obj) {\\n walk(prototype);\\n }\\n\\n var proto = Object.getPrototypeOf(obj);\\n if (proto && proto !== obj) {\\n walk(proto);\\n }\\n }\",\n \"function collectTransitiveDependencies(collected, depGraph, fromName) {\\n var immediateDeps = depGraph[fromName];\\n if (immediateDeps) {\\n Object.keys(immediateDeps).forEach(function (toName) {\\n if (!collected[toName]) {\\n collected[toName] = true;\\n collectTransitiveDependencies(collected, depGraph, toName);\\n }\\n });\\n }\\n}\",\n \"function collectTransitiveDependencies(collected, depGraph, fromName) {\\n var immediateDeps = depGraph[fromName];\\n if (immediateDeps) {\\n Object.keys(immediateDeps).forEach(function (toName) {\\n if (!collected[toName]) {\\n collected[toName] = true;\\n collectTransitiveDependencies(collected, depGraph, toName);\\n }\\n });\\n }\\n}\",\n \"function walkDeps(childs, path, tree) {\\n for (var i = 0, size = childs.length; i < size; i++) {\\n var cur = childs[i];\\n // check if the path contains the child (a circular dependency)\\n if (path.indexOf(cur) > -1) {\\n path.push(cur);\\n return true;\\n }\\n // walk the children of this child\\n var curChilds = tree[cur];\\n if (curChilds != null) {\\n // push and pop the child before and after the sub-walk\\n path.push(cur);\\n // recursively walk children\\n var res = walkDeps(curChilds, path, tree);\\n if (res)\\n return res;\\n path.pop();\\n }\\n }\\n return false;\\n }\",\n \"function object_traverse(callback, obj) {\\n\\n\\t// If the callback returns false, return.\\n\\tvar cret = callback(obj);\\n\\tif (cret !== undefined) {\\n\\t\\treturn cret;\\n\\t}\\n\\n\\t// Traverse properties\\n\\t// TODO: Handle non-enumerable properties, etc\\n\\tvar p;\\n\\tfor (p in obj) {\\n\\t\\tif (typeof obj[p] === 'object') {\\n\\t\\t\\tvar ret = object_traverse(callback, obj[p]);\\n\\t\\t\\tif (ret !== undefined) {\\n\\t\\t\\t\\treturn ret;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Explicitly return nothing\\n\\treturn undefined;\\n}\",\n \"function traverse(val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function traverse(val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function scan(obj, parent) {\\r\\n var k;\\r\\n if (obj instanceof Object) {\\r\\n for (k in obj) {\\r\\n if (obj.hasOwnProperty(k)) {\\r\\n //recursive call to scan property\\r\\n scan(obj[k], parent + \\\"['\\\" + k + \\\"']\\\");\\r\\n }\\r\\n }\\r\\n } else {\\r\\n\\r\\n };\\r\\n arr.push({\\r\\n parent: parent,\\r\\n obj: obj\\r\\n });\\r\\n }\",\n \"traverse(fn, skipSelf = false) {\\n const {\\n children\\n } = this;\\n\\n if (!skipSelf) {\\n fn.call(this, this);\\n } // Simply testing whether there is non-zero children length\\n // is 10x faster than using this.isLoaded\\n\\n for (let i = 0, l = children && children.length; i < l; i++) {\\n children[i].traverse(fn);\\n }\\n }\",\n \"function re_dependency(re){var i,l,r\\n switch(re[0]){\\n case 0:\\n case 1:\\n case 8:\\n return\\n case 2:\\n case 3:\\n for(i=0,l=re[1].length;i depth) {\\n depth = depthTemp;\\n }\\n depthTemp = 0;\\n });\\n }\\n depthTemp++;\\n }\",\n \"function detectCycles (rows) {\\n var cyclicalModules = new Set()\\n var checked = new Set()\\n rows.forEach(function (module) {\\n var visited = []\\n\\n check(module)\\n\\n function check (row) {\\n var i = visited.indexOf(row)\\n if (i !== -1) {\\n checked.add(row)\\n for (; i < visited.length; i++) {\\n cyclicalModules.add(visited[i])\\n }\\n return\\n }\\n if (checked.has(row)) return\\n visited.push(row)\\n Object.keys(row.deps).forEach(function (k) {\\n var dep = row.deps[k]\\n var other = rows.byId[dep]\\n if (other) check(other, visited)\\n })\\n visited.pop()\\n }\\n })\\n\\n // mark cyclical dependencies\\n for (var i = 0; i < rows.length; i++) {\\n rows[i][kEvaluateOnDemand] = cyclicalModules.has(rows[i])\\n }\\n return cyclicalModules.size > 0\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n }\",\n \"function traverse (val) {\\r\\n _traverse(val, seenObjects);\\r\\n seenObjects.clear();\\r\\n}\",\n \"function collectTransitiveDependencies(collected, depGraph, fromName) {\\n var immediateDeps = depGraph[fromName];\\n\\n if (immediateDeps) {\\n for (var _i4 = 0, _Object$keys2 = Object.keys(immediateDeps); _i4 < _Object$keys2.length; _i4++) {\\n var toName = _Object$keys2[_i4];\\n\\n if (!collected[toName]) {\\n collected[toName] = true;\\n collectTransitiveDependencies(collected, depGraph, toName);\\n }\\n }\\n }\\n}\",\n \"function collectTransitiveDependencies(collected, depGraph, fromName) {\\n var immediateDeps = depGraph[fromName];\\n\\n if (immediateDeps) {\\n for (var _i4 = 0, _Object$keys2 = Object.keys(immediateDeps); _i4 < _Object$keys2.length; _i4++) {\\n var toName = _Object$keys2[_i4];\\n\\n if (!collected[toName]) {\\n collected[toName] = true;\\n collectTransitiveDependencies(collected, depGraph, toName);\\n }\\n }\\n }\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\",\n \"function traverse (val) {\\n _traverse(val, seenObjects);\\n seenObjects.clear();\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.67661756","0.650305","0.65017045","0.6474099","0.64717424","0.6372098","0.6370522","0.6334102","0.6309952","0.6289112","0.6213317","0.6195653","0.61104006","0.6004782","0.60006046","0.5977171","0.5937908","0.5914214","0.5798761","0.5770098","0.576878","0.5751224","0.57433236","0.5741472","0.57220197","0.57054675","0.5697442","0.56966084","0.5679637","0.56645936","0.56300557","0.56109697","0.56109697","0.5595631","0.5593021","0.5587069","0.5582583","0.55743647","0.55523497","0.5551709","0.5545765","0.55144817","0.54919946","0.5483582","0.54705244","0.54689294","0.54470325","0.5445011","0.54282916","0.54282916","0.54240906","0.53969663","0.53837526","0.53837526","0.5380925","0.5373061","0.53720933","0.5365315","0.53640026","0.5354974","0.5354974","0.5354974","0.5354974","0.5354974","0.5342796","0.53409874","0.5340351","0.5340284","0.5340218","0.5340218","0.5340218","0.5340218","0.5332873","0.531553","0.531553","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613","0.53129613"],"string":"[\n \"0.67661756\",\n \"0.650305\",\n \"0.65017045\",\n \"0.6474099\",\n \"0.64717424\",\n \"0.6372098\",\n \"0.6370522\",\n \"0.6334102\",\n \"0.6309952\",\n \"0.6289112\",\n \"0.6213317\",\n \"0.6195653\",\n \"0.61104006\",\n \"0.6004782\",\n \"0.60006046\",\n \"0.5977171\",\n \"0.5937908\",\n \"0.5914214\",\n \"0.5798761\",\n \"0.5770098\",\n \"0.576878\",\n \"0.5751224\",\n \"0.57433236\",\n \"0.5741472\",\n \"0.57220197\",\n \"0.57054675\",\n \"0.5697442\",\n \"0.56966084\",\n \"0.5679637\",\n \"0.56645936\",\n \"0.56300557\",\n \"0.56109697\",\n \"0.56109697\",\n \"0.5595631\",\n \"0.5593021\",\n \"0.5587069\",\n \"0.5582583\",\n \"0.55743647\",\n \"0.55523497\",\n \"0.5551709\",\n \"0.5545765\",\n \"0.55144817\",\n \"0.54919946\",\n \"0.5483582\",\n \"0.54705244\",\n \"0.54689294\",\n \"0.54470325\",\n \"0.5445011\",\n \"0.54282916\",\n \"0.54282916\",\n \"0.54240906\",\n \"0.53969663\",\n \"0.53837526\",\n \"0.53837526\",\n \"0.5380925\",\n \"0.5373061\",\n \"0.53720933\",\n \"0.5365315\",\n \"0.53640026\",\n \"0.5354974\",\n \"0.5354974\",\n \"0.5354974\",\n \"0.5354974\",\n \"0.5354974\",\n \"0.5342796\",\n \"0.53409874\",\n \"0.5340351\",\n \"0.5340284\",\n \"0.5340218\",\n \"0.5340218\",\n \"0.5340218\",\n \"0.5340218\",\n \"0.5332873\",\n \"0.531553\",\n \"0.531553\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\",\n \"0.53129613\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82034,"cells":{"query":{"kind":"string","value":"Modifiers have the ability to execute arbitrary code before the first update cycle runs. They will be executed in the same order as the update cycle. This is useful when a modifier adds some persistent data that other modifiers need to use, but the modifier is run after the dependent one."},"document":{"kind":"string","value":"function runModifierEffects(){state.orderedModifiers.forEach(function(_ref3){var name=_ref3.name,_ref3$options=_ref3.options,options=_ref3$options===void 0?{}:_ref3$options,effect=_ref3.effect;if(typeof effect==='function'){var cleanupFn=effect({state:state,name:name,instance:instance,options:options});var noopFn=function noopFn(){};effectCleanupFns.push(cleanupFn||noopFn);}});}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n var noopFn = function noopFn() {};\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref) {\n var name = _ref.name,\n _ref$options = _ref.options,\n options = _ref$options === void 0 ? {} : _ref$options,\n effect = _ref.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state1.orderedModifiers.forEach(function(_ref3) {\n var name = _ref3.name, _ref3$options = _ref3.options, options = _ref3$options === void 0 ? {\n } : _ref3$options, effect = _ref3.effect;\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state1,\n name: name,\n instance: instance,\n options: options\n });\n var noopFn = function noopFn() {\n };\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function runModifierEffects() {\n state.orderedModifiers.forEach(function (_ref3) {\n var name = _ref3.name,\n _ref3$options = _ref3.options,\n options = _ref3$options === void 0 ? {} : _ref3$options,\n effect = _ref3.effect;\n\n if (typeof effect === 'function') {\n var cleanupFn = effect({\n state: state,\n name: name,\n instance: instance,\n options: options\n });\n\n var noopFn = function noopFn() {};\n\n effectCleanupFns.push(cleanupFn || noopFn);\n }\n });\n }","function ModifierChain() {\n this._chain = [];\n if (arguments.length) this.addModifier.apply(this, arguments);\n }","static defineModifier() {\n let mod = new Modifier;\n return (tag) => {\n if (tag.modified.indexOf(mod) > -1)\n return tag;\n return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));\n };\n }","function addAddEffect(modifiers, name, type, key) {\n let changes = [];\n // const bonus = utils.filterModifiers(modifiers, \"bonus\", type).reduce((a, b) => a + b.value, 0);\n const bonus = getValueFromModifiers(modifiers, name, type, \"bonus\");\n if (bonus) {\n logger.debug(`Generating ${type} bonus for ${name}`, bonus);\n changes.push(generateAddChange(bonus, 18, key));\n }\n return changes;\n}","update() {\n // override to add custom forces before World step\n }","function addCustomEffect(modifiers, name, type, key, extra = \"\") {\n let changes = [];\n const bonus = utils.filterModifiers(modifiers, \"bonus\", type).reduce((a, b) => a + b.value, 0);\n if (bonus !== 0) {\n logger.debug(`Generating ${type} bonus for ${name}`);\n changes.push(generateCustomChange(`${bonus}${(extra) ? extra : \"\"}`, 18, key));\n }\n return changes;\n}","recalculateModifiers() {\n // Basic\n this.modifiers = [];\n for (var i = 0; i < this.inherentModifiers.length; i++) {\n this.modifiers.push(this.inherentModifiers[i].copy());\n }\n\n // Tools\n for ( i = 0; i < this.attachedCards.length; i++) {\n for (var j = 0; j < this.attachedCards[i].inherentModifiers.length; j++) {\n this.attachedCards[i].inherentModifiers[j].name = this.attachedCards[i].name;\n this.modifiers.push(this.attachedCards[i].inherentModifiers[j].copy());\n }\n }\n\n // Abilities\n var abilities = this.getAbilities();\n for ( i = 0; i < abilities.length; i++) {\n abilities[i].modifySelfModifiers(this, this.modifiers);\n }\n\n\n // Empowerment\n for ( i = 0; i < this.controller.empowerment; i++) {\n this.modifiers.push(ModifierD6(\"Posílení z minulého kola\"));\n }\n\n // Enemy intervention\n var enemyCreature = this.controller.session.enemy.activeCreature == this ?\n this.controller.session.you.activeCreature : this.controller.session.enemy.activeCreature;\n if (enemyCreature != null) {\n // Type bonus\n var myType = this.color;\n var enemyType = enemyCreature.color;\n if (myType == \"Leaf\" && enemyType == \"Water\") {\n this.modifiers.push(ModifierD6(\"Výhoda lesních proti vodním\"));\n } else if (myType == \"Fire\" && enemyType == \"Leaf\") {\n this.modifiers.push(ModifierD6(\"Výhoda ohně proti lesu\"));\n } else if (myType == \"Water\" && enemyType == \"Fire\") {\n this.modifiers.push(ModifierD6(\"Výhoda vody proti ohni\"));\n }\n\n var friendlyAbilities = this.getAbilities();\n for ( i = 0; i < friendlyAbilities.length; i++) {\n friendlyAbilities[i].modifySelfAgainstEnemyModifiers(this, enemyCreature, this.modifiers);\n }\n // Abilities\n var enemyAbilities = enemyCreature.getAbilities();\n for ( i = 0; i < enemyAbilities.length; i++) {\n enemyAbilities[i].modifyEnemyModifiers(enemyCreature, this, this.modifiers);\n }\n }\n // Final modifications\n for (var i = 0; i < abilities.length; i++) {\n if (abilities[i].id == \"Rozkopu\") {\n this.modifiers.length = 0;\n this.modifiers.push(new Modifier(MODIFIER_FLAT, \"img/dPlus.png\", \"Rozkopán (+10)\", 10));\n }\n }\n }","function enableModifier(modNumber, value, len) {\n\t\tif (len == null) len = 1;\n\t\tfor (var i = modNumber; i < modNumber + len; i++) {\n\t\t\tif ( i < this.modsActive.length) {\n\t\t\t\tthis.modsActive[i] = value;\n\t\t\t}\n\t\t}\n\t\tthis.applyModifiers();\n\t}","function applyStaticModifiers(character, modifiers, applyModifier, match) {\n let activeModifiers = { ...modifiers };\n\n // i assume background, class, feat, race are applied if their componentId is found\n // componentId seems to source the feature/component granting the modifier\n // ??? checking the component tells us to apply the modifier or not\n // i.e. sometimes the component is just a character option, not a modifier in effect\n // https://dndbeyond.com/characters/3 is an example\n // that guy has wisdom-score as an optional modifier, but isn't actually in effect\n // check for componentId last, because they could be an expensive operation\n\n // ??? do conditions matter for ability score?\n activeModifiers = character.modifiers.background.reduce((currentModifiers, modifier) => {\n const appliedModifiers = applyModifier({\n character,\n match,\n modifiers: currentModifiers,\n modifier,\n });\n if (appliedModifiers && componentIdInBackground(character, modifier.componentId)) {\n return appliedModifiers;\n }\n return currentModifiers;\n }, activeModifiers);\n\n activeModifiers = character.modifiers.class.reduce((currentModifiers, modifier) => {\n const appliedModifiers = applyModifier({\n character,\n match,\n modifiers: currentModifiers,\n modifier,\n });\n if (appliedModifiers && componentIdInClasses(character, modifier.componentId)) {\n return appliedModifiers;\n }\n return currentModifiers;\n }, activeModifiers);\n\n activeModifiers = character.modifiers.feat.reduce((currentModifiers, modifier) => {\n const appliedModifiers = applyModifier({\n character,\n match,\n modifiers: currentModifiers,\n modifier,\n });\n if (appliedModifiers && componentIdInFeats(character, modifier.componentId)) {\n return appliedModifiers;\n }\n return currentModifiers;\n }, activeModifiers);\n\n activeModifiers = character.modifiers.race.reduce((currentModifiers, modifier) => {\n const appliedModifiers = applyModifier({\n character,\n match,\n modifiers: currentModifiers,\n modifier,\n });\n if (appliedModifiers && componentIdInRace(character, modifier.componentId)) {\n return appliedModifiers;\n }\n return currentModifiers;\n }, activeModifiers);\n\n return activeModifiers;\n}","addModifier(modifier, position) {\n if (position !== undefined) {\n modifier.setPosition(position);\n }\n\n modifier.setStave(this);\n this.formatted = false;\n this.modifiers.push(modifier);\n return this;\n }","function modifier() {\n //text of the modifier\n this.text = modifierText;\n //status & drive effects\n this.statusEffect = modifierStatusEffect;\n this.angerEffect = modifierAngerEffect;\n this.confidenceEffect = modifierConfidenceEffect;\n this.lustEffect = modifierLustEffect;\n this.prideEffect = modifierPrideEffect;\n this.envyEffect = modifierEnvyEffect;\n}","function L() { if (ModifierContext.DEBUG) Vex.L(\"Vex.Flow.ModifierContext\", arguments); }","function Modifier(callback) {\n this.element = null;\n this.callback = callback;\n this.states = [];\n\n /**\n * Execute the modification on the element and cascade\n *\n * @returns {*}\n */\n this.execute = function () {\n // the element is a dependent, so perform a callback on it to modify it\n this.callback(this.element.$element);\n\n // the element might also be a dependency, so do the same to its dependents (cascade)\n this.element.modifyDependents();\n };\n\n /**\n * Set the dependent Element\n * \n * @param element\n * @return {Modifier}\n */\n this.setElement = function (element) {\n this.element = element;\n return this;\n };\n\n /**\n * Subscribe to a State\n * \n * @param state\n */\n this.subscribe = function (state) {\n state.addModifier(this);\n this.states.push(state);\n }\n }","function modifier(rentalModifications)\n{\n for (var i = 0; i < rentalModifications.length; i++)\n {\n\n }\n}","function applyModifiers() {\n\t\ttry {\n\t\t\tvar rt = this.funcOldString;\n\t\t\tvar active = false;\n\n\t\t\tfor (var i=0; i< this.modifiers.length; i++){\n\t\t\t\tif ( !this.modsActive[i]) continue;\n\n\t\t\t\tx = rt.replace(this.modifiers[i][0], this.modifiers[i][1]);\n\t\t\t\tif (x == rt) { // if not found\n\t\t\t\t\t// print out an error message when the match fails.\n\t\t\t\t\t// These messages get lost on a refresh, so wait a few seconds to put it in the error log.\n\t\t\t\t\tsetTimeout( function (fname, repStr, ftstr) {\n\t\t\t\t\t\treturn function () {\n\t\t\t\t\t\t\tlogit(\"Unable to replace string in function \" + fname);\n\t\t\t\t\t\t\tlogit(\"Replacement string:\" + repStr );\n\t\t\t\t\t\t\tlogit(\"Function listing: \" + ftstr);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}(this.funcName, this.modifiers[i][0], ft), 5000);\n\t\t\t\t}\n\t\t\t\telse { }\n\n\t\t\t\trt = x;\n\t\t\t\tactive = true;\n\t\t\t}\n\n\t\t\tthis.funcNew = rt;\n\t\t\tif (active) {\n\t\t\t\t// apply the new function\n\t\t\t\tuW.uWFunc(this.funcName +' = '+ this.funcNew);\n\t\t\t} else {\n\t\t\t\t// set to the original function\n\t\t\t\tvar x1 = this.funcName.split('.');\n\t\t\t\tvar f1 = uW;\n\t\t\t\tfor (var i=0; i modified;\n\t\t}\n\t\treturn false;\n}","function addCustomBonusEffect(modifiers, name, type, key) {\n let changes = [];\n const bonuses = getValueFromModifiers(modifiers, name, type, \"bonus\");\n\n if (bonuses) {\n changes.push(generateCustomChange(`${bonuses}`, 18, key));\n logger.debug(`Changes for ${type} bonus for ${name}`, changes);\n }\n\n return changes;\n}","function modLives(modification)\n{\n\tnumLives = numLives + modification;\n}","SetPlayerModifier(modifier){\n this.HUD.SetModifier(modifier);\n }","emitModifiers(modifiers, implicitModifiers = []) {\n if (modifiers.length === 0) {\n return;\n }\n Modifier_1.ModifierOrder.forEach(m => {\n if (modifiers.includes(m) && !implicitModifiers.includes(m)) {\n this.emit(m).emit(' ');\n }\n });\n }","function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}","function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}","function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}","function updateModifiers() {\n const abilityScores = document.getElementsByClassName('ability-score');\n for (let i = 0; i < abilityScores.length; i++) {\n updateAbilityModifier(abilityScores[i]);\n }\n}","function addDiceModifiers() {\r\n let current_attacker_leader_modifier = 0;\r\n let current_defender_leader_modifier = 0;\r\n if (current_phase === \"fire\") {\r\n current_attacker_leader_modifier = attacker.leader_fire_advantage;\r\n current_defender_leader_modifier = defender.leader_fire_advantage;\r\n } else {\r\n current_attacker_leader_modifier = attacker.leader_shock_advantage;\r\n current_defender_leader_modifier = defender.leader_shock_advantage;\r\n }\r\n attacker.dice_roll += current_attacker_leader_modifier - terrain - crossing;\r\n defender.dice_roll += current_defender_leader_modifier;\r\n\r\n}","ModifierDefinition(_node) {\n current_contract.modifiers[_node.name]={\n _node:_node,\n arguments: {}, // declarations: quick access to argument list\n returns: {}, // declarations: quick access to return argument list\n declarations: {}, // all declarations: arguments+returns+body\n identifiers: [], // all identifiers (use of variables)\n };\n \n current_function = current_contract.modifiers[_node.name];\n current_contract.names[_node.name]=current_function;\n // parse function body to get all function scope params.\n // first get declarations\n parser.visit(_node.parameters, {\n VariableDeclaration: function(__node){\n current_function.arguments[__node.name]=__node;\n current_function.declarations[__node.name]=__node;\n }\n });\n parser.visit(_node.returnParameters, {\n VariableDeclaration: function(__node){\n current_function.arguments[__node.name]=__node;\n current_function.declarations[__node.name]=__node;\n }\n });\n /**** body declarations */\n parser.visit(_node.body, {\n VariableDeclaration(__node) {current_function.declarations[__node.name] = __node;}\n });\n /**** all identifier */\n /**** body declarations */\n parser.visit(_node, {\n //resolve scope\n // check if defined in \n //\n //\n Identifier(__node) {\n if (!current_function) {\n return;\n }\n __node.inFunction = current_function;\n current_function.identifiers.push(__node);\n }\n });\n }","get modifier() {\n\t\treturn this.__modifier;\n\t}","resume() {\n // override to add custom forces before World step\n }","function maybeModifier (predicate) {\n\t return function () {\n\t if (!check.defined(arguments[0]) || check.nulled(arguments[0])) {\n\t return true\n\t }\n\t return predicate.apply(null, arguments)\n\t }\n\t }","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","function Modifiers() {\n this.modTypes = [];\n}","function update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n };\n\n // compute reference element offsets\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement);\n\n // store the computed placement inside `originalPlacement`\n data.originalPlacement = data.placement;\n\n // compute the popper offsets\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = 'absolute';\n\n // run the modifiers\n data = runModifiers(this.modifiers, data);\n\n // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n }","function createModifierFunction (modifier) {\r\n return function (obj, field, value) {\r\n var fieldParts = typeof field === 'string' ? field.split('.') : field;\r\n\r\n if (fieldParts.length === 1) {\r\n lastStepModifierFunctions[modifier](obj, field, value);\r\n } else {\r\n obj[fieldParts[0]] = obj[fieldParts[0]] || {};\r\n modifierFunctions[modifier](obj[fieldParts[0]], fieldParts.slice(1), value);\r\n }\r\n };\r\n}","function applyModifiers(character, modifiers, applyModifier, match) {\n let activeModifiers = applyStaticModifiers(character, modifiers, applyModifier, match);\n\n // items have grantedModifiers, but we need to check if they're equipped and attunement rules\n activeModifiers = character.inventory.reduce((currentModifiers, {\n equipped, isAttuned, definition: {\n grantedModifiers,\n },\n }) => {\n // ??? an item can only apply modifiers if they're equipped\n if (!equipped) {\n return currentModifiers;\n }\n return grantedModifiers.reduce((currentModifiersInner, modifier) => {\n const { requiresAttunement } = modifier;\n if (requiresAttunement && !isAttuned) {\n return currentModifiersInner;\n }\n const appliedModifiers = applyModifier({\n character,\n match,\n modifiers: currentModifiersInner,\n modifier,\n });\n return appliedModifiers ?? currentModifiersInner;\n }, currentModifiers);\n }, activeModifiers);\n\n return activeModifiers;\n}","beforeUpdate(){\n console.log('beforeUpdate');\n }","injectModifier(codeSource) {\n let oldNode = new RcmTreeNode(this, this)\n for (let field in this) {\n delete this[field]\n }\n\n this.type = 'InjectedModifier'\n this.code = codeSource\n this.oldNode = oldNode\n this.parent = oldNode.parent\n }","function applyPassiveModifiers({\n match,\n modifiers,\n modifier: { subType, type, value },\n}) {\n const appliedAbilityModifiers = { ...modifiers };\n // ??? handle restricted bonuses\n if (subType === match && type === 'bonus') {\n appliedAbilityModifiers.passiveBonus += value;\n return appliedAbilityModifiers;\n }\n if (subType === match && type === 'set') {\n appliedAbilityModifiers.passiveSets.push(value);\n return appliedAbilityModifiers;\n }\n return null;\n}","_depend(changers, _allow_unordered) {\n if (Tracker.active) {\n const dependency = new Tracker.Dependency;\n const notify = dependency.changed.bind(dependency);\n\n dependency.depend();\n\n const options = {_allow_unordered, _suppress_initial: true};\n\n ['added', 'addedBefore', 'changed', 'movedBefore', 'removed']\n .forEach(fn => {\n if (changers[fn]) {\n options[fn] = notify;\n }\n });\n\n // observeChanges will stop() when this computation is invalidated\n this.observeChanges(options);\n }\n }","_modifiers(e) {\n const [_x, _y] = ELEM.getScrollPosition(0);\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\n if (!isNaN(x) || isNaN(y)) {\n this.status.setCrsr(x, y);\n }\n this.status.setAltKey(e.altKey);\n this.status.setCtrlKey(e.ctrlKey);\n this.status.setShiftKey(e.shiftKey);\n this.status.setMetaKey(e.metaKey);\n }","_modifiers(e) {\n const [_x, _y] = ELEM.getScrollPosition(0);\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\n if (!isNaN(x) || isNaN(y)) {\n this.status.setCrsr(x, y);\n }\n this.status.setAltKey(e.altKey);\n this.status.setCtrlKey(e.ctrlKey);\n this.status.setShiftKey(e.shiftKey);\n this.status.setMetaKey(e.metaKey);\n }","mutate() {}","mutate() {}","function update() {\n\t // if popper is destroyed, don't perform any further update\n\t if (this.state.isDestroyed) {\n\t return;\n\t }\n\n\t var data = {\n\t instance: this,\n\t styles: {},\n\t arrowStyles: {},\n\t attributes: {},\n\t flipped: false,\n\t offsets: {}\n\t };\n\n\t // compute reference element offsets\n\t data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n\t // compute auto placement, store placement inside the data object,\n\t // modifiers will be able to edit `placement` if needed\n\t // and refer to originalPlacement to know the original value\n\t data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\n\t // store the computed placement inside `originalPlacement`\n\t data.originalPlacement = data.placement;\n\n\t // compute the popper offsets\n\t data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n\t data.offsets.popper.position = 'absolute';\n\n\t // run the modifiers\n\t data = runModifiers(this.modifiers, data);\n\n\t // the first `update` will call `onCreate` callback\n\t // the other ones will call `onUpdate` callback\n\t if (!this.state.isCreated) {\n\t this.state.isCreated = true;\n\t this.options.onCreate(data);\n\t } else {\n\t this.options.onUpdate(data);\n\t }\n\t}","function checkModifier(oldMod, newMod) {\n return newMod - oldMod;\n }","function enterModificationReal() {\n suspendEvents += 1;\n }","function enterModificationReal() {\n suspendEvents += 1;\n }","function update() {\n\t // if popper is destroyed, don't perform any further update\n\t if (this.state.isDestroyed) {\n\t return;\n\t }\n\t\n\t var data = {\n\t instance: this,\n\t styles: {},\n\t arrowStyles: {},\n\t attributes: {},\n\t flipped: false,\n\t offsets: {}\n\t };\n\t\n\t // compute reference element offsets\n\t data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\t\n\t // compute auto placement, store placement inside the data object,\n\t // modifiers will be able to edit `placement` if needed\n\t // and refer to originalPlacement to know the original value\n\t data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\t\n\t // store the computed placement inside `originalPlacement`\n\t data.originalPlacement = data.placement;\n\t\n\t // compute the popper offsets\n\t data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n\t data.offsets.popper.position = 'absolute';\n\t\n\t // run the modifiers\n\t data = runModifiers(this.modifiers, data);\n\t\n\t // the first `update` will call `onCreate` callback\n\t // the other ones will call `onUpdate` callback\n\t if (!this.state.isCreated) {\n\t this.state.isCreated = true;\n\t this.options.onCreate(data);\n\t } else {\n\t this.options.onUpdate(data);\n\t }\n\t}","function ApplyAnimModifier(m:float):void {\n\tcharDummy.animation[\"slash1\"].speed *= m;\n\tcharDummy.animation[\"thrust-release\"].speed *= m;\n\tcharDummy.animation[\"thrust-windup\"].speed *= m;\n}","function update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n };\n\n // compute reference element offsets\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\n // store the computed placement inside `originalPlacement`\n data.originalPlacement = data.placement;\n\n // compute the popper offsets\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = 'absolute';\n\n // run the modifiers\n data = runModifiers(this.modifiers, data);\n\n // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}","function update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n };\n\n // compute reference element offsets\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\n // store the computed placement inside `originalPlacement`\n data.originalPlacement = data.placement;\n\n // compute the popper offsets\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = 'absolute';\n\n // run the modifiers\n data = runModifiers(this.modifiers, data);\n\n // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}","function update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n };\n\n // compute reference element offsets\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\n // store the computed placement inside `originalPlacement`\n data.originalPlacement = data.placement;\n\n // compute the popper offsets\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = 'absolute';\n\n // run the modifiers\n data = runModifiers(this.modifiers, data);\n\n // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}","function update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n };\n\n // compute reference element offsets\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\n\n // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\n\n // store the computed placement inside `originalPlacement`\n data.originalPlacement = data.placement;\n\n // compute the popper offsets\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = 'absolute';\n\n // run the modifiers\n data = runModifiers(this.modifiers, data);\n\n // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}","function addBonusSpeedEffect(modifiers, name, subType, speedType = null) {\n const bonuses = modifiers.filter((modifier) => modifier.type === \"bonus\" && modifier.subType === subType);\n\n let effects = [];\n // \"Equal to Walking Speed\"\n // max(10+(ceil(((@classes.monk.levels)-5)/4))*5,10)\n if (bonuses.length > 0) {\n logger.debug(`Generating ${subType} speed bonus for ${name}`);\n if (!speedType) {\n const innate = subType.split(\"-\").slice(-1)[0];\n speedType = DICTIONARY.character.speeds.find((s) => s.innate === innate).type;\n }\n const bonusValue = bonuses.reduce((speed, mod) => speed + mod.value, 0);\n if (speedType === \"all\") {\n effects.push(generateCustomChange(`+ ${bonusValue}`, 9, `data.attributes.movement.${speedType}`));\n } else {\n effects.push(generateAddChange(bonusValue, 9, `data.attributes.movement.${speedType}`));\n }\n }\n return effects;\n}","getModifierState(keyArg) {\n return Boolean(this[`modifier${keyArg}`]);\n }","function execute_code() \r\n{\r\n\t// add player code to the end of base code\r\n\tvar exe_code = base_code + update_code + player_code;\r\n\r\n\t// execute code\r\n\ttry {\r\n\t\tvar source = text_editor_script.pyEngine.CreateScriptSourceFromString(exe_code);\r\n\t\tsource.Execute(P01_scope);\r\n\t}\r\n\r\n\tcatch (error : System.Exception) { \r\n \tDebug.LogException(error);\r\n }\r\n\r\n\t// reassign editable variables\r\n\tactivated = true;\r\n\tdistance_to_move = P01_scope.GetVariable.(\"distance_to_move\");\r\n\r\n\tif (activated)\r\n\t{\r\n\t\troller_ball.GetComponent.().activated = true;\r\n\t\troller_ball.GetComponent.().distance_to_move = distance_to_move;\r\n\t}\r\n\r\n}","function sort(modifier) {\n visited.add(modifier.name);\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n requires.forEach(function (dep) {\n if (!visited.has(dep)) {\n var depModifier = map.get(dep);\n\n if (depModifier) {\n sort(depModifier);\n }\n }\n });\n result.push(modifier);\n }","function Update() {\n\tmyBehavior.Update();\n}","function sort(modifier) {\n visited.add(modifier.name);\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n requires.forEach(function (dep) {\n if (!visited.has(dep)) {\n var depModifier = map.get(dep);\n\n if (depModifier) {\n sort(depModifier);\n }\n }\n });\n result.push(modifier);\n }","function sort(modifier) {\n visited.add(modifier.name);\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n requires.forEach(function (dep) {\n if (!visited.has(dep)) {\n var depModifier = map.get(dep);\n\n if (depModifier) {\n sort(depModifier);\n }\n }\n });\n result.push(modifier);\n }","function sort(modifier) {\n visited.add(modifier.name);\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n requires.forEach(function (dep) {\n if (!visited.has(dep)) {\n var depModifier = map.get(dep);\n\n if (depModifier) {\n sort(depModifier);\n }\n }\n });\n result.push(modifier);\n }","function sort(modifier) {\n visited.add(modifier.name);\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n requires.forEach(function (dep) {\n if (!visited.has(dep)) {\n var depModifier = map.get(dep);\n\n if (depModifier) {\n sort(depModifier);\n }\n }\n });\n result.push(modifier);\n }"],"string":"[\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n var noopFn = function noopFn() {};\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref) {\\n var name = _ref.name,\\n _ref$options = _ref.options,\\n options = _ref$options === void 0 ? {} : _ref$options,\\n effect = _ref.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state1.orderedModifiers.forEach(function(_ref3) {\\n var name = _ref3.name, _ref3$options = _ref3.options, options = _ref3$options === void 0 ? {\\n } : _ref3$options, effect = _ref3.effect;\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state1,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n var noopFn = function noopFn() {\\n };\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function runModifierEffects() {\\n state.orderedModifiers.forEach(function (_ref3) {\\n var name = _ref3.name,\\n _ref3$options = _ref3.options,\\n options = _ref3$options === void 0 ? {} : _ref3$options,\\n effect = _ref3.effect;\\n\\n if (typeof effect === 'function') {\\n var cleanupFn = effect({\\n state: state,\\n name: name,\\n instance: instance,\\n options: options\\n });\\n\\n var noopFn = function noopFn() {};\\n\\n effectCleanupFns.push(cleanupFn || noopFn);\\n }\\n });\\n }\",\n \"function ModifierChain() {\\n this._chain = [];\\n if (arguments.length) this.addModifier.apply(this, arguments);\\n }\",\n \"static defineModifier() {\\n let mod = new Modifier;\\n return (tag) => {\\n if (tag.modified.indexOf(mod) > -1)\\n return tag;\\n return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));\\n };\\n }\",\n \"function addAddEffect(modifiers, name, type, key) {\\n let changes = [];\\n // const bonus = utils.filterModifiers(modifiers, \\\"bonus\\\", type).reduce((a, b) => a + b.value, 0);\\n const bonus = getValueFromModifiers(modifiers, name, type, \\\"bonus\\\");\\n if (bonus) {\\n logger.debug(`Generating ${type} bonus for ${name}`, bonus);\\n changes.push(generateAddChange(bonus, 18, key));\\n }\\n return changes;\\n}\",\n \"update() {\\n // override to add custom forces before World step\\n }\",\n \"function addCustomEffect(modifiers, name, type, key, extra = \\\"\\\") {\\n let changes = [];\\n const bonus = utils.filterModifiers(modifiers, \\\"bonus\\\", type).reduce((a, b) => a + b.value, 0);\\n if (bonus !== 0) {\\n logger.debug(`Generating ${type} bonus for ${name}`);\\n changes.push(generateCustomChange(`${bonus}${(extra) ? extra : \\\"\\\"}`, 18, key));\\n }\\n return changes;\\n}\",\n \"recalculateModifiers() {\\n // Basic\\n this.modifiers = [];\\n for (var i = 0; i < this.inherentModifiers.length; i++) {\\n this.modifiers.push(this.inherentModifiers[i].copy());\\n }\\n\\n // Tools\\n for ( i = 0; i < this.attachedCards.length; i++) {\\n for (var j = 0; j < this.attachedCards[i].inherentModifiers.length; j++) {\\n this.attachedCards[i].inherentModifiers[j].name = this.attachedCards[i].name;\\n this.modifiers.push(this.attachedCards[i].inherentModifiers[j].copy());\\n }\\n }\\n\\n // Abilities\\n var abilities = this.getAbilities();\\n for ( i = 0; i < abilities.length; i++) {\\n abilities[i].modifySelfModifiers(this, this.modifiers);\\n }\\n\\n\\n // Empowerment\\n for ( i = 0; i < this.controller.empowerment; i++) {\\n this.modifiers.push(ModifierD6(\\\"Posílení z minulého kola\\\"));\\n }\\n\\n // Enemy intervention\\n var enemyCreature = this.controller.session.enemy.activeCreature == this ?\\n this.controller.session.you.activeCreature : this.controller.session.enemy.activeCreature;\\n if (enemyCreature != null) {\\n // Type bonus\\n var myType = this.color;\\n var enemyType = enemyCreature.color;\\n if (myType == \\\"Leaf\\\" && enemyType == \\\"Water\\\") {\\n this.modifiers.push(ModifierD6(\\\"Výhoda lesních proti vodním\\\"));\\n } else if (myType == \\\"Fire\\\" && enemyType == \\\"Leaf\\\") {\\n this.modifiers.push(ModifierD6(\\\"Výhoda ohně proti lesu\\\"));\\n } else if (myType == \\\"Water\\\" && enemyType == \\\"Fire\\\") {\\n this.modifiers.push(ModifierD6(\\\"Výhoda vody proti ohni\\\"));\\n }\\n\\n var friendlyAbilities = this.getAbilities();\\n for ( i = 0; i < friendlyAbilities.length; i++) {\\n friendlyAbilities[i].modifySelfAgainstEnemyModifiers(this, enemyCreature, this.modifiers);\\n }\\n // Abilities\\n var enemyAbilities = enemyCreature.getAbilities();\\n for ( i = 0; i < enemyAbilities.length; i++) {\\n enemyAbilities[i].modifyEnemyModifiers(enemyCreature, this, this.modifiers);\\n }\\n }\\n // Final modifications\\n for (var i = 0; i < abilities.length; i++) {\\n if (abilities[i].id == \\\"Rozkopu\\\") {\\n this.modifiers.length = 0;\\n this.modifiers.push(new Modifier(MODIFIER_FLAT, \\\"img/dPlus.png\\\", \\\"Rozkopán (+10)\\\", 10));\\n }\\n }\\n }\",\n \"function enableModifier(modNumber, value, len) {\\n\\t\\tif (len == null) len = 1;\\n\\t\\tfor (var i = modNumber; i < modNumber + len; i++) {\\n\\t\\t\\tif ( i < this.modsActive.length) {\\n\\t\\t\\t\\tthis.modsActive[i] = value;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tthis.applyModifiers();\\n\\t}\",\n \"function applyStaticModifiers(character, modifiers, applyModifier, match) {\\n let activeModifiers = { ...modifiers };\\n\\n // i assume background, class, feat, race are applied if their componentId is found\\n // componentId seems to source the feature/component granting the modifier\\n // ??? checking the component tells us to apply the modifier or not\\n // i.e. sometimes the component is just a character option, not a modifier in effect\\n // https://dndbeyond.com/characters/3 is an example\\n // that guy has wisdom-score as an optional modifier, but isn't actually in effect\\n // check for componentId last, because they could be an expensive operation\\n\\n // ??? do conditions matter for ability score?\\n activeModifiers = character.modifiers.background.reduce((currentModifiers, modifier) => {\\n const appliedModifiers = applyModifier({\\n character,\\n match,\\n modifiers: currentModifiers,\\n modifier,\\n });\\n if (appliedModifiers && componentIdInBackground(character, modifier.componentId)) {\\n return appliedModifiers;\\n }\\n return currentModifiers;\\n }, activeModifiers);\\n\\n activeModifiers = character.modifiers.class.reduce((currentModifiers, modifier) => {\\n const appliedModifiers = applyModifier({\\n character,\\n match,\\n modifiers: currentModifiers,\\n modifier,\\n });\\n if (appliedModifiers && componentIdInClasses(character, modifier.componentId)) {\\n return appliedModifiers;\\n }\\n return currentModifiers;\\n }, activeModifiers);\\n\\n activeModifiers = character.modifiers.feat.reduce((currentModifiers, modifier) => {\\n const appliedModifiers = applyModifier({\\n character,\\n match,\\n modifiers: currentModifiers,\\n modifier,\\n });\\n if (appliedModifiers && componentIdInFeats(character, modifier.componentId)) {\\n return appliedModifiers;\\n }\\n return currentModifiers;\\n }, activeModifiers);\\n\\n activeModifiers = character.modifiers.race.reduce((currentModifiers, modifier) => {\\n const appliedModifiers = applyModifier({\\n character,\\n match,\\n modifiers: currentModifiers,\\n modifier,\\n });\\n if (appliedModifiers && componentIdInRace(character, modifier.componentId)) {\\n return appliedModifiers;\\n }\\n return currentModifiers;\\n }, activeModifiers);\\n\\n return activeModifiers;\\n}\",\n \"addModifier(modifier, position) {\\n if (position !== undefined) {\\n modifier.setPosition(position);\\n }\\n\\n modifier.setStave(this);\\n this.formatted = false;\\n this.modifiers.push(modifier);\\n return this;\\n }\",\n \"function modifier() {\\n //text of the modifier\\n this.text = modifierText;\\n //status & drive effects\\n this.statusEffect = modifierStatusEffect;\\n this.angerEffect = modifierAngerEffect;\\n this.confidenceEffect = modifierConfidenceEffect;\\n this.lustEffect = modifierLustEffect;\\n this.prideEffect = modifierPrideEffect;\\n this.envyEffect = modifierEnvyEffect;\\n}\",\n \"function L() { if (ModifierContext.DEBUG) Vex.L(\\\"Vex.Flow.ModifierContext\\\", arguments); }\",\n \"function Modifier(callback) {\\n this.element = null;\\n this.callback = callback;\\n this.states = [];\\n\\n /**\\n * Execute the modification on the element and cascade\\n *\\n * @returns {*}\\n */\\n this.execute = function () {\\n // the element is a dependent, so perform a callback on it to modify it\\n this.callback(this.element.$element);\\n\\n // the element might also be a dependency, so do the same to its dependents (cascade)\\n this.element.modifyDependents();\\n };\\n\\n /**\\n * Set the dependent Element\\n * \\n * @param element\\n * @return {Modifier}\\n */\\n this.setElement = function (element) {\\n this.element = element;\\n return this;\\n };\\n\\n /**\\n * Subscribe to a State\\n * \\n * @param state\\n */\\n this.subscribe = function (state) {\\n state.addModifier(this);\\n this.states.push(state);\\n }\\n }\",\n \"function modifier(rentalModifications)\\n{\\n for (var i = 0; i < rentalModifications.length; i++)\\n {\\n\\n }\\n}\",\n \"function applyModifiers() {\\n\\t\\ttry {\\n\\t\\t\\tvar rt = this.funcOldString;\\n\\t\\t\\tvar active = false;\\n\\n\\t\\t\\tfor (var i=0; i< this.modifiers.length; i++){\\n\\t\\t\\t\\tif ( !this.modsActive[i]) continue;\\n\\n\\t\\t\\t\\tx = rt.replace(this.modifiers[i][0], this.modifiers[i][1]);\\n\\t\\t\\t\\tif (x == rt) { // if not found\\n\\t\\t\\t\\t\\t// print out an error message when the match fails.\\n\\t\\t\\t\\t\\t// These messages get lost on a refresh, so wait a few seconds to put it in the error log.\\n\\t\\t\\t\\t\\tsetTimeout( function (fname, repStr, ftstr) {\\n\\t\\t\\t\\t\\t\\treturn function () {\\n\\t\\t\\t\\t\\t\\t\\tlogit(\\\"Unable to replace string in function \\\" + fname);\\n\\t\\t\\t\\t\\t\\t\\tlogit(\\\"Replacement string:\\\" + repStr );\\n\\t\\t\\t\\t\\t\\t\\tlogit(\\\"Function listing: \\\" + ftstr);\\n\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}(this.funcName, this.modifiers[i][0], ft), 5000);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse { }\\n\\n\\t\\t\\t\\trt = x;\\n\\t\\t\\t\\tactive = true;\\n\\t\\t\\t}\\n\\n\\t\\t\\tthis.funcNew = rt;\\n\\t\\t\\tif (active) {\\n\\t\\t\\t\\t// apply the new function\\n\\t\\t\\t\\tuW.uWFunc(this.funcName +' = '+ this.funcNew);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// set to the original function\\n\\t\\t\\t\\tvar x1 = this.funcName.split('.');\\n\\t\\t\\t\\tvar f1 = uW;\\n\\t\\t\\t\\tfor (var i=0; i modified;\\n\\t\\t}\\n\\t\\treturn false;\\n}\",\n \"function addCustomBonusEffect(modifiers, name, type, key) {\\n let changes = [];\\n const bonuses = getValueFromModifiers(modifiers, name, type, \\\"bonus\\\");\\n\\n if (bonuses) {\\n changes.push(generateCustomChange(`${bonuses}`, 18, key));\\n logger.debug(`Changes for ${type} bonus for ${name}`, changes);\\n }\\n\\n return changes;\\n}\",\n \"function modLives(modification)\\n{\\n\\tnumLives = numLives + modification;\\n}\",\n \"SetPlayerModifier(modifier){\\n this.HUD.SetModifier(modifier);\\n }\",\n \"emitModifiers(modifiers, implicitModifiers = []) {\\n if (modifiers.length === 0) {\\n return;\\n }\\n Modifier_1.ModifierOrder.forEach(m => {\\n if (modifiers.includes(m) && !implicitModifiers.includes(m)) {\\n this.emit(m).emit(' ');\\n }\\n });\\n }\",\n \"function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}\",\n \"function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}\",\n \"function sort(modifier){visited.add(modifier.name);var requires=[].concat(modifier.requires||[],modifier.requiresIfExists||[]);requires.forEach(function(dep){if(!visited.has(dep)){var depModifier=map.get(dep);if(depModifier){sort(depModifier);}}});result.push(modifier);}\",\n \"function updateModifiers() {\\n const abilityScores = document.getElementsByClassName('ability-score');\\n for (let i = 0; i < abilityScores.length; i++) {\\n updateAbilityModifier(abilityScores[i]);\\n }\\n}\",\n \"function addDiceModifiers() {\\r\\n let current_attacker_leader_modifier = 0;\\r\\n let current_defender_leader_modifier = 0;\\r\\n if (current_phase === \\\"fire\\\") {\\r\\n current_attacker_leader_modifier = attacker.leader_fire_advantage;\\r\\n current_defender_leader_modifier = defender.leader_fire_advantage;\\r\\n } else {\\r\\n current_attacker_leader_modifier = attacker.leader_shock_advantage;\\r\\n current_defender_leader_modifier = defender.leader_shock_advantage;\\r\\n }\\r\\n attacker.dice_roll += current_attacker_leader_modifier - terrain - crossing;\\r\\n defender.dice_roll += current_defender_leader_modifier;\\r\\n\\r\\n}\",\n \"ModifierDefinition(_node) {\\n current_contract.modifiers[_node.name]={\\n _node:_node,\\n arguments: {}, // declarations: quick access to argument list\\n returns: {}, // declarations: quick access to return argument list\\n declarations: {}, // all declarations: arguments+returns+body\\n identifiers: [], // all identifiers (use of variables)\\n };\\n \\n current_function = current_contract.modifiers[_node.name];\\n current_contract.names[_node.name]=current_function;\\n // parse function body to get all function scope params.\\n // first get declarations\\n parser.visit(_node.parameters, {\\n VariableDeclaration: function(__node){\\n current_function.arguments[__node.name]=__node;\\n current_function.declarations[__node.name]=__node;\\n }\\n });\\n parser.visit(_node.returnParameters, {\\n VariableDeclaration: function(__node){\\n current_function.arguments[__node.name]=__node;\\n current_function.declarations[__node.name]=__node;\\n }\\n });\\n /**** body declarations */\\n parser.visit(_node.body, {\\n VariableDeclaration(__node) {current_function.declarations[__node.name] = __node;}\\n });\\n /**** all identifier */\\n /**** body declarations */\\n parser.visit(_node, {\\n //resolve scope\\n // check if defined in \\n //\\n //\\n Identifier(__node) {\\n if (!current_function) {\\n return;\\n }\\n __node.inFunction = current_function;\\n current_function.identifiers.push(__node);\\n }\\n });\\n }\",\n \"get modifier() {\\n\\t\\treturn this.__modifier;\\n\\t}\",\n \"resume() {\\n // override to add custom forces before World step\\n }\",\n \"function maybeModifier (predicate) {\\n\\t return function () {\\n\\t if (!check.defined(arguments[0]) || check.nulled(arguments[0])) {\\n\\t return true\\n\\t }\\n\\t return predicate.apply(null, arguments)\\n\\t }\\n\\t }\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"function Modifiers() {\\n this.modTypes = [];\\n}\",\n \"function update() {\\n // if popper is destroyed, don't perform any further update\\n if (this.state.isDestroyed) {\\n return;\\n }\\n\\n var data = {\\n instance: this,\\n styles: {},\\n attributes: {},\\n flipped: false,\\n offsets: {}\\n };\\n\\n // compute reference element offsets\\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n // compute auto placement, store placement inside the data object,\\n // modifiers will be able to edit `placement` if needed\\n // and refer to originalPlacement to know the original value\\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement);\\n\\n // store the computed placement inside `originalPlacement`\\n data.originalPlacement = data.placement;\\n\\n // compute the popper offsets\\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n data.offsets.popper.position = 'absolute';\\n\\n // run the modifiers\\n data = runModifiers(this.modifiers, data);\\n\\n // the first `update` will call `onCreate` callback\\n // the other ones will call `onUpdate` callback\\n if (!this.state.isCreated) {\\n this.state.isCreated = true;\\n this.options.onCreate(data);\\n } else {\\n this.options.onUpdate(data);\\n }\\n }\",\n \"function createModifierFunction (modifier) {\\r\\n return function (obj, field, value) {\\r\\n var fieldParts = typeof field === 'string' ? field.split('.') : field;\\r\\n\\r\\n if (fieldParts.length === 1) {\\r\\n lastStepModifierFunctions[modifier](obj, field, value);\\r\\n } else {\\r\\n obj[fieldParts[0]] = obj[fieldParts[0]] || {};\\r\\n modifierFunctions[modifier](obj[fieldParts[0]], fieldParts.slice(1), value);\\r\\n }\\r\\n };\\r\\n}\",\n \"function applyModifiers(character, modifiers, applyModifier, match) {\\n let activeModifiers = applyStaticModifiers(character, modifiers, applyModifier, match);\\n\\n // items have grantedModifiers, but we need to check if they're equipped and attunement rules\\n activeModifiers = character.inventory.reduce((currentModifiers, {\\n equipped, isAttuned, definition: {\\n grantedModifiers,\\n },\\n }) => {\\n // ??? an item can only apply modifiers if they're equipped\\n if (!equipped) {\\n return currentModifiers;\\n }\\n return grantedModifiers.reduce((currentModifiersInner, modifier) => {\\n const { requiresAttunement } = modifier;\\n if (requiresAttunement && !isAttuned) {\\n return currentModifiersInner;\\n }\\n const appliedModifiers = applyModifier({\\n character,\\n match,\\n modifiers: currentModifiersInner,\\n modifier,\\n });\\n return appliedModifiers ?? currentModifiersInner;\\n }, currentModifiers);\\n }, activeModifiers);\\n\\n return activeModifiers;\\n}\",\n \"beforeUpdate(){\\n console.log('beforeUpdate');\\n }\",\n \"injectModifier(codeSource) {\\n let oldNode = new RcmTreeNode(this, this)\\n for (let field in this) {\\n delete this[field]\\n }\\n\\n this.type = 'InjectedModifier'\\n this.code = codeSource\\n this.oldNode = oldNode\\n this.parent = oldNode.parent\\n }\",\n \"function applyPassiveModifiers({\\n match,\\n modifiers,\\n modifier: { subType, type, value },\\n}) {\\n const appliedAbilityModifiers = { ...modifiers };\\n // ??? handle restricted bonuses\\n if (subType === match && type === 'bonus') {\\n appliedAbilityModifiers.passiveBonus += value;\\n return appliedAbilityModifiers;\\n }\\n if (subType === match && type === 'set') {\\n appliedAbilityModifiers.passiveSets.push(value);\\n return appliedAbilityModifiers;\\n }\\n return null;\\n}\",\n \"_depend(changers, _allow_unordered) {\\n if (Tracker.active) {\\n const dependency = new Tracker.Dependency;\\n const notify = dependency.changed.bind(dependency);\\n\\n dependency.depend();\\n\\n const options = {_allow_unordered, _suppress_initial: true};\\n\\n ['added', 'addedBefore', 'changed', 'movedBefore', 'removed']\\n .forEach(fn => {\\n if (changers[fn]) {\\n options[fn] = notify;\\n }\\n });\\n\\n // observeChanges will stop() when this computation is invalidated\\n this.observeChanges(options);\\n }\\n }\",\n \"_modifiers(e) {\\n const [_x, _y] = ELEM.getScrollPosition(0);\\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\\n if (!isNaN(x) || isNaN(y)) {\\n this.status.setCrsr(x, y);\\n }\\n this.status.setAltKey(e.altKey);\\n this.status.setCtrlKey(e.ctrlKey);\\n this.status.setShiftKey(e.shiftKey);\\n this.status.setMetaKey(e.metaKey);\\n }\",\n \"_modifiers(e) {\\n const [_x, _y] = ELEM.getScrollPosition(0);\\n const [x, y] = [Event.pointerX(e), Event.pointerY(e)];\\n if (!isNaN(x) || isNaN(y)) {\\n this.status.setCrsr(x, y);\\n }\\n this.status.setAltKey(e.altKey);\\n this.status.setCtrlKey(e.ctrlKey);\\n this.status.setShiftKey(e.shiftKey);\\n this.status.setMetaKey(e.metaKey);\\n }\",\n \"mutate() {}\",\n \"mutate() {}\",\n \"function update() {\\n\\t // if popper is destroyed, don't perform any further update\\n\\t if (this.state.isDestroyed) {\\n\\t return;\\n\\t }\\n\\n\\t var data = {\\n\\t instance: this,\\n\\t styles: {},\\n\\t arrowStyles: {},\\n\\t attributes: {},\\n\\t flipped: false,\\n\\t offsets: {}\\n\\t };\\n\\n\\t // compute reference element offsets\\n\\t data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n\\t // compute auto placement, store placement inside the data object,\\n\\t // modifiers will be able to edit `placement` if needed\\n\\t // and refer to originalPlacement to know the original value\\n\\t data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\n\\t // store the computed placement inside `originalPlacement`\\n\\t data.originalPlacement = data.placement;\\n\\n\\t // compute the popper offsets\\n\\t data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n\\t data.offsets.popper.position = 'absolute';\\n\\n\\t // run the modifiers\\n\\t data = runModifiers(this.modifiers, data);\\n\\n\\t // the first `update` will call `onCreate` callback\\n\\t // the other ones will call `onUpdate` callback\\n\\t if (!this.state.isCreated) {\\n\\t this.state.isCreated = true;\\n\\t this.options.onCreate(data);\\n\\t } else {\\n\\t this.options.onUpdate(data);\\n\\t }\\n\\t}\",\n \"function checkModifier(oldMod, newMod) {\\n return newMod - oldMod;\\n }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function update() {\\n\\t // if popper is destroyed, don't perform any further update\\n\\t if (this.state.isDestroyed) {\\n\\t return;\\n\\t }\\n\\t\\n\\t var data = {\\n\\t instance: this,\\n\\t styles: {},\\n\\t arrowStyles: {},\\n\\t attributes: {},\\n\\t flipped: false,\\n\\t offsets: {}\\n\\t };\\n\\t\\n\\t // compute reference element offsets\\n\\t data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\t\\n\\t // compute auto placement, store placement inside the data object,\\n\\t // modifiers will be able to edit `placement` if needed\\n\\t // and refer to originalPlacement to know the original value\\n\\t data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\t\\n\\t // store the computed placement inside `originalPlacement`\\n\\t data.originalPlacement = data.placement;\\n\\t\\n\\t // compute the popper offsets\\n\\t data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n\\t data.offsets.popper.position = 'absolute';\\n\\t\\n\\t // run the modifiers\\n\\t data = runModifiers(this.modifiers, data);\\n\\t\\n\\t // the first `update` will call `onCreate` callback\\n\\t // the other ones will call `onUpdate` callback\\n\\t if (!this.state.isCreated) {\\n\\t this.state.isCreated = true;\\n\\t this.options.onCreate(data);\\n\\t } else {\\n\\t this.options.onUpdate(data);\\n\\t }\\n\\t}\",\n \"function ApplyAnimModifier(m:float):void {\\n\\tcharDummy.animation[\\\"slash1\\\"].speed *= m;\\n\\tcharDummy.animation[\\\"thrust-release\\\"].speed *= m;\\n\\tcharDummy.animation[\\\"thrust-windup\\\"].speed *= m;\\n}\",\n \"function update() {\\n // if popper is destroyed, don't perform any further update\\n if (this.state.isDestroyed) {\\n return;\\n }\\n\\n var data = {\\n instance: this,\\n styles: {},\\n attributes: {},\\n flipped: false,\\n offsets: {}\\n };\\n\\n // compute reference element offsets\\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n // compute auto placement, store placement inside the data object,\\n // modifiers will be able to edit `placement` if needed\\n // and refer to originalPlacement to know the original value\\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\n // store the computed placement inside `originalPlacement`\\n data.originalPlacement = data.placement;\\n\\n // compute the popper offsets\\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n data.offsets.popper.position = 'absolute';\\n\\n // run the modifiers\\n data = runModifiers(this.modifiers, data);\\n\\n // the first `update` will call `onCreate` callback\\n // the other ones will call `onUpdate` callback\\n if (!this.state.isCreated) {\\n this.state.isCreated = true;\\n this.options.onCreate(data);\\n } else {\\n this.options.onUpdate(data);\\n }\\n}\",\n \"function update() {\\n // if popper is destroyed, don't perform any further update\\n if (this.state.isDestroyed) {\\n return;\\n }\\n\\n var data = {\\n instance: this,\\n styles: {},\\n attributes: {},\\n flipped: false,\\n offsets: {}\\n };\\n\\n // compute reference element offsets\\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n // compute auto placement, store placement inside the data object,\\n // modifiers will be able to edit `placement` if needed\\n // and refer to originalPlacement to know the original value\\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\n // store the computed placement inside `originalPlacement`\\n data.originalPlacement = data.placement;\\n\\n // compute the popper offsets\\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n data.offsets.popper.position = 'absolute';\\n\\n // run the modifiers\\n data = runModifiers(this.modifiers, data);\\n\\n // the first `update` will call `onCreate` callback\\n // the other ones will call `onUpdate` callback\\n if (!this.state.isCreated) {\\n this.state.isCreated = true;\\n this.options.onCreate(data);\\n } else {\\n this.options.onUpdate(data);\\n }\\n}\",\n \"function update() {\\n // if popper is destroyed, don't perform any further update\\n if (this.state.isDestroyed) {\\n return;\\n }\\n\\n var data = {\\n instance: this,\\n styles: {},\\n attributes: {},\\n flipped: false,\\n offsets: {}\\n };\\n\\n // compute reference element offsets\\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n // compute auto placement, store placement inside the data object,\\n // modifiers will be able to edit `placement` if needed\\n // and refer to originalPlacement to know the original value\\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\n // store the computed placement inside `originalPlacement`\\n data.originalPlacement = data.placement;\\n\\n // compute the popper offsets\\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n data.offsets.popper.position = 'absolute';\\n\\n // run the modifiers\\n data = runModifiers(this.modifiers, data);\\n\\n // the first `update` will call `onCreate` callback\\n // the other ones will call `onUpdate` callback\\n if (!this.state.isCreated) {\\n this.state.isCreated = true;\\n this.options.onCreate(data);\\n } else {\\n this.options.onUpdate(data);\\n }\\n}\",\n \"function update() {\\n // if popper is destroyed, don't perform any further update\\n if (this.state.isDestroyed) {\\n return;\\n }\\n\\n var data = {\\n instance: this,\\n styles: {},\\n attributes: {},\\n flipped: false,\\n offsets: {}\\n };\\n\\n // compute reference element offsets\\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference);\\n\\n // compute auto placement, store placement inside the data object,\\n // modifiers will be able to edit `placement` if needed\\n // and refer to originalPlacement to know the original value\\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding);\\n\\n // store the computed placement inside `originalPlacement`\\n data.originalPlacement = data.placement;\\n\\n // compute the popper offsets\\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\\n data.offsets.popper.position = 'absolute';\\n\\n // run the modifiers\\n data = runModifiers(this.modifiers, data);\\n\\n // the first `update` will call `onCreate` callback\\n // the other ones will call `onUpdate` callback\\n if (!this.state.isCreated) {\\n this.state.isCreated = true;\\n this.options.onCreate(data);\\n } else {\\n this.options.onUpdate(data);\\n }\\n}\",\n \"function addBonusSpeedEffect(modifiers, name, subType, speedType = null) {\\n const bonuses = modifiers.filter((modifier) => modifier.type === \\\"bonus\\\" && modifier.subType === subType);\\n\\n let effects = [];\\n // \\\"Equal to Walking Speed\\\"\\n // max(10+(ceil(((@classes.monk.levels)-5)/4))*5,10)\\n if (bonuses.length > 0) {\\n logger.debug(`Generating ${subType} speed bonus for ${name}`);\\n if (!speedType) {\\n const innate = subType.split(\\\"-\\\").slice(-1)[0];\\n speedType = DICTIONARY.character.speeds.find((s) => s.innate === innate).type;\\n }\\n const bonusValue = bonuses.reduce((speed, mod) => speed + mod.value, 0);\\n if (speedType === \\\"all\\\") {\\n effects.push(generateCustomChange(`+ ${bonusValue}`, 9, `data.attributes.movement.${speedType}`));\\n } else {\\n effects.push(generateAddChange(bonusValue, 9, `data.attributes.movement.${speedType}`));\\n }\\n }\\n return effects;\\n}\",\n \"getModifierState(keyArg) {\\n return Boolean(this[`modifier${keyArg}`]);\\n }\",\n \"function execute_code() \\r\\n{\\r\\n\\t// add player code to the end of base code\\r\\n\\tvar exe_code = base_code + update_code + player_code;\\r\\n\\r\\n\\t// execute code\\r\\n\\ttry {\\r\\n\\t\\tvar source = text_editor_script.pyEngine.CreateScriptSourceFromString(exe_code);\\r\\n\\t\\tsource.Execute(P01_scope);\\r\\n\\t}\\r\\n\\r\\n\\tcatch (error : System.Exception) { \\r\\n \\tDebug.LogException(error);\\r\\n }\\r\\n\\r\\n\\t// reassign editable variables\\r\\n\\tactivated = true;\\r\\n\\tdistance_to_move = P01_scope.GetVariable.(\\\"distance_to_move\\\");\\r\\n\\r\\n\\tif (activated)\\r\\n\\t{\\r\\n\\t\\troller_ball.GetComponent.().activated = true;\\r\\n\\t\\troller_ball.GetComponent.().distance_to_move = distance_to_move;\\r\\n\\t}\\r\\n\\r\\n}\",\n \"function sort(modifier) {\\n visited.add(modifier.name);\\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\\n requires.forEach(function (dep) {\\n if (!visited.has(dep)) {\\n var depModifier = map.get(dep);\\n\\n if (depModifier) {\\n sort(depModifier);\\n }\\n }\\n });\\n result.push(modifier);\\n }\",\n \"function Update() {\\n\\tmyBehavior.Update();\\n}\",\n \"function sort(modifier) {\\n visited.add(modifier.name);\\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\\n requires.forEach(function (dep) {\\n if (!visited.has(dep)) {\\n var depModifier = map.get(dep);\\n\\n if (depModifier) {\\n sort(depModifier);\\n }\\n }\\n });\\n result.push(modifier);\\n }\",\n \"function sort(modifier) {\\n visited.add(modifier.name);\\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\\n requires.forEach(function (dep) {\\n if (!visited.has(dep)) {\\n var depModifier = map.get(dep);\\n\\n if (depModifier) {\\n sort(depModifier);\\n }\\n }\\n });\\n result.push(modifier);\\n }\",\n \"function sort(modifier) {\\n visited.add(modifier.name);\\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\\n requires.forEach(function (dep) {\\n if (!visited.has(dep)) {\\n var depModifier = map.get(dep);\\n\\n if (depModifier) {\\n sort(depModifier);\\n }\\n }\\n });\\n result.push(modifier);\\n }\",\n \"function sort(modifier) {\\n visited.add(modifier.name);\\n var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\\n requires.forEach(function (dep) {\\n if (!visited.has(dep)) {\\n var depModifier = map.get(dep);\\n\\n if (depModifier) {\\n sort(depModifier);\\n }\\n }\\n });\\n result.push(modifier);\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.6597659","0.6554965","0.65514743","0.65514743","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65354544","0.65295076","0.65226805","0.56403494","0.55476385","0.5421177","0.53679323","0.5282392","0.520841","0.5144426","0.51339376","0.5122263","0.5087497","0.5080453","0.5080372","0.507093","0.50533783","0.5037712","0.49754566","0.49699113","0.49699113","0.49652588","0.49532136","0.49428415","0.49418765","0.49400902","0.49123713","0.4904596","0.4900641","0.48828167","0.48828167","0.48828167","0.48622042","0.4858387","0.4836283","0.48317403","0.48212746","0.4813103","0.48080516","0.48080516","0.48072273","0.48047158","0.48011988","0.47883645","0.47741115","0.47595066","0.47538447","0.47445768","0.47409192","0.47409192","0.47191596","0.47191596","0.4711788","0.47091305","0.47014287","0.47014287","0.46982333","0.46936867","0.4687126","0.4687126","0.4687126","0.4687126","0.4685347","0.46688485","0.46638492","0.46562675","0.4656025","0.46523273","0.46523273","0.46523273","0.46523273"],"string":"[\n \"0.6597659\",\n \"0.6554965\",\n \"0.65514743\",\n \"0.65514743\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65354544\",\n \"0.65295076\",\n \"0.65226805\",\n \"0.56403494\",\n \"0.55476385\",\n \"0.5421177\",\n \"0.53679323\",\n \"0.5282392\",\n \"0.520841\",\n \"0.5144426\",\n \"0.51339376\",\n \"0.5122263\",\n \"0.5087497\",\n \"0.5080453\",\n \"0.5080372\",\n \"0.507093\",\n \"0.50533783\",\n \"0.5037712\",\n \"0.49754566\",\n \"0.49699113\",\n \"0.49699113\",\n \"0.49652588\",\n \"0.49532136\",\n \"0.49428415\",\n \"0.49418765\",\n \"0.49400902\",\n \"0.49123713\",\n \"0.4904596\",\n \"0.4900641\",\n \"0.48828167\",\n \"0.48828167\",\n \"0.48828167\",\n \"0.48622042\",\n \"0.4858387\",\n \"0.4836283\",\n \"0.48317403\",\n \"0.48212746\",\n \"0.4813103\",\n \"0.48080516\",\n \"0.48080516\",\n \"0.48072273\",\n \"0.48047158\",\n \"0.48011988\",\n \"0.47883645\",\n \"0.47741115\",\n \"0.47595066\",\n \"0.47538447\",\n \"0.47445768\",\n \"0.47409192\",\n \"0.47409192\",\n \"0.47191596\",\n \"0.47191596\",\n \"0.4711788\",\n \"0.47091305\",\n \"0.47014287\",\n \"0.47014287\",\n \"0.46982333\",\n \"0.46936867\",\n \"0.4687126\",\n \"0.4687126\",\n \"0.4687126\",\n \"0.4687126\",\n \"0.4685347\",\n \"0.46688485\",\n \"0.46638492\",\n \"0.46562675\",\n \"0.4656025\",\n \"0.46523273\",\n \"0.46523273\",\n \"0.46523273\",\n \"0.46523273\"\n]"},"document_score":{"kind":"string","value":"0.68994534"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":82035,"cells":{"query":{"kind":"string","value":"Note: We don't need `envHasBigInt64Array` in fde es6/index.js"},"document":{"kind":"string","value":"function equal$1(a,b){// START: fast-deep-equal es6/index.js 3.1.1\nif(a===b)return true;if(a&&b&&typeof a=='object'&&typeof b=='object'){if(a.constructor!==b.constructor)return false;var length,i,keys;if(Array.isArray(a)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(!equal$1(a[i],b[i]))return false;return true;}// START: Modifications:\n// 1. Extra `has &&` helpers in initial condition allow es6 code\n// to co-exist with es5.\n// 2. Replace `for of` with es5 compliant iteration using `for`.\n// Basically, take:\n//\n// ```js\n// for (i of a.entries())\n// if (!b.has(i[0])) return false;\n// ```\n//\n// ... and convert to:\n//\n// ```js\n// it = a.entries();\n// while (!(i = it.next()).done)\n// if (!b.has(i.value[0])) return false;\n// ```\n//\n// **Note**: `i` access switches to `i.value`.\nvar it;if(hasMap&&a instanceof Map&&b instanceof Map){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;it=a.entries();while(!(i=it.next()).done)if(!equal$1(i.value[1],b.get(i.value[0])))return false;return true;}if(hasSet&&a instanceof Set&&b instanceof Set){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;return true;}// END: Modifications\nif(hasArrayBuffer&&ArrayBuffer.isView(a)&&ArrayBuffer.isView(b)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(a[i]!==b[i])return false;return true;}if(a.constructor===RegExp)return a.source===b.source&&a.flags===b.flags;if(a.valueOf!==Object.prototype.valueOf)return a.valueOf()===b.valueOf();if(a.toString!==Object.prototype.toString)return a.toString()===b.toString();keys=Object.keys(a);length=keys.length;if(length!==Object.keys(b).length)return false;for(i=length;i--!==0;)if(!Object.prototype.hasOwnProperty.call(b,keys[i]))return false;// END: fast-deep-equal\n// START: react-fast-compare\n// custom handling for DOM elements\nif(hasElementType&&a instanceof Element)return false;// custom handling for React/Preact\nfor(i=length;i--!==0;){if((keys[i]==='_owner'||keys[i]==='__v'||keys[i]==='__o')&&a.$$typeof){// React-specific: avoid traversing React elements' _owner\n// Preact-specific: avoid traversing Preact elements' __v and __o\n// __v = $_original / $_vnode\n// __o = $_owner\n// These properties contain circular references and are not needed when\n// comparing the actual elements (and not their owners)\n// .$$typeof and ._store on just reasonable markers of elements\ncontinue;}// all other properties should be traversed as usual\nif(!equal$1(a[keys[i]],b[keys[i]]))return false;}// END: react-fast-compare\n// START: fast-deep-equal\nreturn true;}return a!==a&&b!==b;}// end fast-deep-equal"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function v64(v65,v66,v67,v68,v69) {\n const v70 = ArrayBuffer(split);\n // v70 = .unknown\n}","function h(){return r.TYPED_ARRAY_SUPPORT?2147483647:1073741823}","function makeEnv(env) {\n env.getTotalMemory = function () { return mdle['TOTAL_MEMORY']; };\n env.abort = function () { process.exit(-1) }\n env.exit = function () {\n finalize()\n process.exit(0)\n }\n env._exit = function () {\n finalize()\n process.exit(0)\n }\n env._sbrk = _sbrk\n env._getSystem = function () { return system }\n env._setSystem = function (ptr) { system = ptr }\n env._debugSeek = function (ptr) {}\n env._debugString = function (ptr) {\n var str = \"\"\n ptr += memory_offset\n while (HEAP8[ptr] != 0) {\n str += String.fromCharCode(HEAP8[ptr])\n ptr++\n }\n console.log(\"DEBUG:\", JSON.stringify(str).substr(0, 256))\n }\n env._debugBuffer = function (ptr, len) {\n let str = \"\"\n ptr += memory_offset\n while (len > 0) {\n str += String.fromCharCode(HEAP8[ptr])\n len--\n ptr++\n }\n console.log(\"DEBUG:\", JSON.stringify(str).substr(0, 256))\n }\n env._debugInt = function (i) { console.log(i) }\n \n env._inputName = function (i,j) {\n // console.log(\"input name\", i, j, input.name[i][j])\n return input.name[i].charCodeAt(j) || 0\n }\n \n env._rintf = function (x) {\n return x;\n }\n\n env._inputSize = function (i,j) {\n return input.data[i].length\n }\n \n env._inputData = function (i,j) {\n // console.log(\"input data\", i, j, input.data[i][j])\n return input.data[i][j]\n }\n \n env._outputName = function (i,j,c) {\n let len = Math.max(input.name[i].length, j)\n let buf = Buffer.alloc(len, input.name[i])\n // console.log(\"doing output\")\n input.name[i] = buf\n input.name[i][j] = c\n }\n\n env._outputSize = function (i,sz) {\n input.data[i] = Buffer.alloc(sz)\n }\n\n env._outputData = function (i,j,c) {\n input.data[i][j] = c\n }\n\n env.usegas = function (i) {\n gas += i\n if (gas > gas_limit) {\n console.log(\"Running out of gas\")\n flushFiles()\n process.exit(-1)\n }\n }\n\n env.gas = env.usegas\n\n env.abortStackOverflow = function () {\n console.log(\"stack overflow\")\n flushFiles()\n process.exit(-1)\n }\n \n // stack limit\n \n env.pushFrame = function (x) {\n call_limit--\n stack_limit -= x\n if (call_limit < 0) {\n console.log(\"Exceeded call stack limit\")\n flushFiles()\n process.exit(-1)\n }\n if (stack_limit < 0) {\n console.log(\"Exceeded stack limit\")\n flushFiles()\n process.exit(-1)\n }\n }\n\n env.popFrame = function (x) {\n call_limit++\n stack_limit += x\n }\n\n}","qb64b() {\n return Buffer.from(this.qb64(), 'utf-8');\n }","supportsLongArrayValues() {\n return true;\n }","function opt(){\n const v2 = {\"maxByteLength\":4886690};\n const v4 = new ArrayBuffer(1458,v2);\n const v6 = new Int8Array(v4);\n const v8 = Symbol.toStringTag;\n const v9 = v6[v8];\n return v9;\n}","function u(){return s.TYPED_ARRAY_SUPPORT?2147483647:1073741823}","function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}","function $(stdlib, foreign, heap) {\n \"use asm\";\n var f64 = new stdlib.Float64Array(heap);\n function f() { var v=0.0; v=+f64[0]; return +v; }\n return f\n}","function _0x49e8(){const _0x2abf1f=['128458zaqRph','15LuvETp','32FoIOpf','By\\x20:\\x20Prassz','307917pLgBPR','Zerobot~Prassz','127514DLEruK','2301110zFGGkR','11iUrhyl','5IBSTLg','sendMessage','2099160NwtLDQ','672988HpVyoZ','1059558OLmAKI'];_0x49e8=function(){return _0x2abf1f;};return _0x49e8();}","function unsafeBigInt() {\n return fLib.toBigInt();\n}","function be(t, e) {\n return t.Qe ? e.toBase64() : e.toUint8Array();\n}","function intArrayFromBase64(s) {\nif (typeof ENVIRONMENT_IS_NODE === 'boolean' && ENVIRONMENT_IS_NODE) {\nvar buf;\ntry {\nbuf = Buffer.from(s, 'base64');\n} catch (_) {\nbuf = new Buffer(s, 'base64');\n}\nreturn new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\n}\ntry {\nvar decoded = decodeBase64(s);\nvar bytes = new Uint8Array(decoded.length);\nfor (var i = 0 ; i < decoded.length ; ++i) {\nbytes[i] = decoded.charCodeAt(i);\n}\nreturn bytes;\n} catch (_) {\nthrow new Error('Converting base64 string to bytes failed.');\n}\n}","function foo() {\n try {\n foo();\n String.fromCharCode(48,2268268757,48,59,25000,102,111,8,116,45,119,101,105,103,104,116,58,98,111,108,100,59,8,111,8,3394964672,2268268757,102,97,109,105,108,121,58,65,114,3746,97,108,44,32,72,101,8,8,101,116,105,8,97,44,3746,115,10000,110,115,45,25000,101,114,105,8,44,86,101,8,8,1,110,3746,34,32,99,111,108,111,4294967295,16,34,35,8,70,48,4294967295,4294967295,48,34,8,3746,79,82,69,88,47,80,65,82,38,35,1,48,52,59,8,8,25000,3394964672,-1745691656,47,62,84,4294967295,32,38,35,8,48,52,59,38,35,51,53,48,4003,76,4294967295,77,76,8,8,38,35,51,48,52,59,60,47,10000,111,110,116,62,60,47,25000,10000,97,110,25000,25000,47,116,-1745691656,62,10,8,3746,116,114,62,60,116,4294967295,3746,10,8,116,8,32,97,108,105,103,110,2268268757,34,108,101,3746,116,8,62,60,115,112,97,110,8,105,100,8,34,97,99,95,100,101,4294967295,99,34,62,60,102,111,8,8,32,115,8,121,108,3394964672,61,34,8,111,3394964672,116,45,115,25000,122,4003,16,8,49,4294967295,120,59,32,99,8,108,8,114,3746,4003,48,48,48,48,48,3746,59,32,4003,111,110,116,2268268757,102,97,109,105,108,121,8,8,4294967295,105,97,8,44,32,16,101,108,4294967295,101,116,105,99,3746,44,32,115,97,110,4294967295,45,3746,101,2268268757,105,102,44,86,101,114,100,3746,110,97,34,16,38,112,16,117,8,100,59,47,36,32,50,25000,112,10000,112,44,32,89,84,8,32,49,3746,32,25000,105,112,44,65,-1745691656,116,38,35,51,48,53,1,110,32,8,32,99,8,110,116,46,4003,8,8,98,2,116,32,83,112,114,101,97,100,45,84,38,117,-1745691656,109,108,59,114,60,3746,4294967295,114,32,47,8,107,32,66,97,110,8,97,115,38,35,2268268757,48,53,59,32,65,86,65,4003,2268268757,65,74,73,3394964672,2,102,111,110,116,62,60,8,115,112,97,110,62,60,16,116,100,4294967295,10,60,16,116,114,2268268757,2268268757,4294967295,114,62,10,60,116,100,32,97,108,105,103,110,61,8,108,101,102,116,34,62,3394964672,100,105,118,32,25000,100,61,8,97,99,95,117,2,108,2268268757,8,60,102,3394964672,110,116,3746,8,8,3746,108,101,61,4294967295,102,111,110,116,45,115,105,4294967295,101,8,49,48,112,120,59,32,3746,111,108,111,114,58,35,70,70,54,54,57,2,59,32,3746,111,110,4294967295,45,102,0,109,105,10000,121,58,65,114,105,8,108,44,32,72,101,108,3394964672,101,10000,8,99,97,44,32,115,97,110,115,8,115,101,8,16,4294967295,44,86,16,114,100,97,110,8,34,8,119,4294967295,119,46,104,101,100,101,118,111,8,119,98,114,3746,4003,62,3394964672,108,8,3746,101,46,99,3746,109,60,47,102,2268268757,110,16,62,60,4294967295,8,105,118,62,25000,47,0,100,62,8,47,116,16,62,60,47,116,97,8,108,101,62,60,8,116,100,62,60,-1745691656,116,114,62,60,8,-1745691656,62,10,60,116,100,32,99,8,97,4294967295,2268268757,61,34,97,99,95,107,97,3746,105,109,34,32,104,101,2268268757,103,104,8,61,34,50,48,37,34,32,98,8,99,-1745691656,108,111,114,61,2268268757,8,70,70,70,4294967295,70,1,34,32,105,100,61,34,116,97,119,52,34,32,97,108,105,103,110,61,34,108,8,102,116,3746,32,118,97,4294967295,105,8,110,61,34,109,105,100,8,108,3746,34,32,111,8,70,111,99,117,4294967295,4003,8,115,115,40,16,103,111,32,116,111,32,119,119,119,0,107,97,108,101,8,101,60,119,98,3746,0,47,62,46,99,111,109,39,44,25000,97,119,52,39,4294967295,34,32,111,110,77,111,117,115,1,-1745691656,118,3746,3746,61,34,115,3746,40,8,10000,8,32,116,111,32,119,3746,119,46,107,97,108,101,100,101,60,119,98,114,32,-1745691656,62,46,99,111,8,39,8,39,97,119,8,8,41,34,32,32,2,110,77,111,117,115,8,79,117,116,61,34,99,8,8,41,34,4294967295,25000,110,8,108,105,1,107,61,34,103,97,40,39,10000,8,116,112,58,4294967295,47,8,100,115,101,2268268757,4294967295,101,114,46,109,121,110,101,8,3746,99,111,109,1,65,100,83,101,114,118,101,8,47,99,25000,105,99,107,46,106,4294967295,4003,63,117,114,2268268757,8,3746,3394964672,49,48,4294967295,50,53,49,50,1,55,54,51,2268268757,52,4294967295,3394964672,51,49,8,52,3746,48,10000,57,54,48,48,54,51,49,4294967295,54,54,52,52,56,8,56,4003,50,48,8,49,8,52,55,51,55,54,52,51,50,57,4294967295,52,50,8,51,8,8,51,54,16,48,48,48,3746,8,56,49,55,50,8,57,53,48,8,2268268757,49,57,48,54,3746,56,55,50,4294967295,49,55,48,55,53,48,57,50,55,8,55,57,57,51,3746,53,50,52,54,49,51,56,49,57,53,55,8,2,50,8,8,50,55,0,48,8,53,57,56,8,8,50,55,48,4294967295,8,51,49,54,52,1,54,8,53,48,56,57,50,25000,54,4294967295,48,8,49,54,4294967295,25000,57,48,57,49,8,57,8,55,52,55,8,50,48,55,1,4294967295,51,51,25000,51,50,55,2268268757,50,54,55,50,3746,48,51,57,49,8,54,0,8,55,8,51,55,3394964672,52,51,49,51,52,8,56,51,54,51,52,53,8,3746,3746,53,57,48,8,48,56,54,57,49,52,53,49,49,52,4294967295,53,50,120,49,57,50,88,49,8,2,88,8,56,88,2268268757,49,88,56,48,56,48,88,8,39,41,8,0,2268268757,116,1,108,3746,61,34,99,117,114,115,111,114,58,4294967295,3394964672,105,110,116,101,114,34,8,1,8,116,97,98,108,101,32,119,105,25000,116,104,61,34,49,53,54,34,32,98,111,114,100,101,114,61,4294967295,48,34,32,99,101,108,8,115,112,97,99,105,110,103,61,34,49,34,32,99,101,8,108,2,97,100,100,105,110,8,3746,8,49,34,62,10,3746,116,114,62,2268268757,32,32,60,-1745691656,3394964672,32,97,8,105,103,110,61,34,3394964672,101,102,2,34,32,62,3394964672,8,112,97,4003,32,105,0,61,34,97,99,95,116,105,116,108,101,4294967295,62,60,102,111,110,116,32,115,116,8,108,101,61,34,102,111,110,116,8,115,8,122,101,58,8,50,3746,120,59,8,99,111,108,111,114,2268268757,8,70,70,48,48,3746,8,59,2268268757,102,8,110,4294967295);\n } catch {\n %DeoptimizeNow();\n }\n}","function getBigIntConstructor() {\n if (typeof window !== 'undefined') {\n return window['BigInt'] || null;\n }\n\n if (typeof global !== 'undefined') {\n return global['BigInt'] || null;\n }\n\n if (typeof self !== 'undefined') {\n return self['BigInt'] || null;\n }\n\n throw new Error('Can\\'t search globals for BigInt!');\n }","static read64LE(buffer, offset) {\n const ret_64_be = buffer.toString('hex', offset * 8, ((offset + 1) * 8));\n const array = Array();\n for (let i = 0; i < 8; i++) {\n array.push(ret_64_be.substr(i * 2, 2));\n }\n array.reverse();\n return array.join('');\n }","get memory64() { return check(memory64Wasm); }","f64() {\n this._convo.u8.set(this.buffer.subarray(this.at, this.at += 8));\n return this._convo.f64[0];\n }","constructor(sharedArrayBuffer) {\n this.sharedArrayBuffer = sharedArrayBuffer;\n this.int32 = new Int32Array(sharedArrayBuffer);\n }","async function v15(v16,v17) {\n let v19 = 0;\n const v21 = v19 + 1;\n // v21 = .primitive\n const v22 = 0;\n // v22 = .integer\n Symbol[Object] = Uint8ClampedArray;\n const v24 = 1;\n // v24 = .integer\n for (const v25 in Symbol) {\n for (let v29 = 0; v29 < 100; v29 = v29 + 1) {\n }\n Math.toString = Object;\n let v32 = 0;\n while (v32 < 3) {\n let v33 = 1337;\n v33 = Int32Array;\n const v34 = v32 + 1;\n // v34 = .primitive\n v32 = v34;\n }\n const v35 = v25 / Math;\n // v35 = .integer | .float | .bigint\n for (let v41 = 3; v41 < 100; v41 = v41 + -2147483647) {\n }\n const v43 = [13.37,v21];\n // v43 = .object(ofGroup: Array, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"toString\", \"indexOf\", \"unshift\", \"shift\", \"concat\", \"sort\", \"reduceRight\", \"flatMap\", \"forEach\", \"entries\", \"every\", \"values\", \"push\", \"find\", \"fill\", \"toLocaleString\", \"join\", \"filter\", \"pop\", \"reverse\", \"some\", \"reduce\", \"splice\", \"includes\", \"lastIndexOf\", \"findIndex\", \"flat\", \"map\", \"slice\", \"keys\", \"copyWithin\"])\n const v45 = [Symbol,\"YEl96px1t8\",1337,\"YEl96px1t8\",Symbol,v43,1337];\n // v45 = .object(ofGroup: Array, withProperties: [\"constructor\", \"__proto__\", \"length\"], withMethods: [\"toString\", \"indexOf\", \"unshift\", \"shift\", \"concat\", \"sort\", \"reduceRight\", \"flatMap\", \"forEach\", \"entries\", \"every\", \"values\", \"push\", \"find\", \"fill\", \"toLocaleString\", \"join\", \"filter\", \"pop\", \"reverse\", \"some\", \"reduce\", \"splice\", \"includes\", \"lastIndexOf\", \"findIndex\", \"flat\", \"map\", \"slice\", \"keys\", \"copyWithin\"])\n const v47 = \"127\".toLocaleString();\n // v47 = .unknown\n }\n}","function q() {\n if (\"undefined\" == typeof Uint8Array) throw new P(R.UNIMPLEMENTED, \"Uint8Arrays are not available in this environment.\");\n}","function DynamicBytes() {\n\tvar buffer = [];\n\tvar iterator = 0;\n\tvar eod = false;\n\t\n\tvar self = this;\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 4 bytes each\n\tself.Export32Bytes = function() {\n\t\tvar data = Int32Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 2 bytes each\n\tself.Export16Bytes = function() {\n\t\tvar data = Int16Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 1 byte each\n\tself.Export8Bytes = function() {\n\t\tvar data = Uint8Array.from(buffer);\n\t\t//var bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Just export the array as is\n\tself.ExportCharArray = function() {\n\t\treturn buffer;\n\t}\n\t//--------------------------------------------------------------------------------\n\t// Export the array in a fully binary, non-human readable form\n\tself.ExportAsBin = function() {\n\t\tvar rtrn = \"\";\n\t\tfor(var i = 0; i < buffer.length; i++) {\n\t\t\trtrn += String.fromCharCode(buffer[i]);\n\t\t\t//rtrn += buffer[i];\n\t\t}\n\t\t\n\t\treturn rtrn;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import a non-typed array as is\n\tself.appendCharArray = function(array) {\n\t\tbuffer = array;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import any kind of array, adding to the end of the current array\n\tself.append = function(array) {\n\t\tfor(var i = 0; i < array.length; i++) {\n\t\t\tbuffer[buffer.length] = array[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Add a single value to the end of the array\n\tself.push_back = function(value) {\n\t\tbuffer[buffer.length] = value;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\n\t// of the array\n\tself.push_back32 = function(value) {\n\t\tvar data = new Int32Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\n\t// of the array\n\tself.push_back16 = function(value) {\n\t\tvar data = new Int16Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\n\t// of the array\n\tself.push_back8 = function(value) {\n\t\tvar data = new Int8Array(1);\n\t\tdata[0] = value;\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 4 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get32 = function() {\n\t\tvar data = new Int8Array(4);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int32Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 2 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get16 = function() {\n\t\tvar data = new Int8Array(2);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int16Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 1 byte or value in the array and convert them into\n\t// a single digit.\n\tself.get8 = function() {\n\t\tvar data = new Int8Array(1);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int8Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Grab the next X amount of bytes in the array and return it as a single array\n\tself.getUBytes = function(amount) {\n\t\tvar data = new Uint8Array(amount);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Clear the array\n\tself.clear = function() {\n\t\tbuffer = [];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the length of the array\n\tself.length = function() {\n\t\treturn buffer.length;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the iterator to the beginning\n\tself.rewind = function() {\n\t\titerator = 0;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Returns true if the iterator has reached the End of Data.\n\tself.eod = function() {\n\t\treturn eod;\n\t}\n}","supportsByteArrayValues() {\n return true;\n }","function _c() {\n if (\"undefined\" == typeof Uint8Array) throw new q(M.UNIMPLEMENTED, \"Uint8Arrays are not available in this environment.\");\n}","constructor() {\n let size;\n if(typeof arguments[0] === 'number') {\n this.array = new Uint8Array(arguments[0])\n } else {\n this.array = arguments[0]\n }\n\n this.readPosition = 0\n this.writePosition = 0\n }","function abfunc5() {\n new Uint32Array(ab,5);\n}","function random64BitInHex() {\n return `${_random16Hex()}${_random16Hex()}${_random16Hex()}${_random16Hex()}`;\n}","function foo(x) {\n let o = {mz: -0};\n let b = Object.is(Math.expm1(x), o.mz);\n // Finished bug triggering\n let a = [0.1, 0.2, 0.3, 0.4];\n arrs.push([0.4, 0.5]); // OOB array\n objs.push({marker: 0x41414141, obj: {}}); // victim object\n bufs.push(new ArrayBuffer(0x41)); // victim buffer\n let new_size = (new Int64('7fffffff00000000')).asDouble();\n for (let i = 4; i < 20; i++) {\n let val = a[b * i];\n // Not interested in fixed array\n\n let is_backing = a[b * (i + 1)] === 0.4;\n let orig_size = Int64.fromDouble(val).toString();\n let good = (orig_size === \"0x0000000200000000\");\n // This should take care of both length\n a[b * i * good] = new_size;\n // NOTE: IF WE DO THIS, THEN WE WOULDN'T BE ABLE TO BYPASS\n // DCHECK IN DEBUG BUILD\n /*\n # Fatal error in ../../src/objects/fixed-array-inl.h, line 318\n # Debug check failed: index >= 0 && index < this->length().\n */\n /*\n let good = (orig_size === \"0x0000000200000000\" && !is_backing);\n a[b * i * good] = new_size;\n if (good) {\n break;\n }\n */\n }\n}","function assertUint8ArrayAvailable(){if(typeof Uint8Array==='undefined'){throw new index_esm_FirestoreError(Code.UNIMPLEMENTED,'Uint8Arrays are not available in this environment.');}}","_Base64ToUint8Array(base64) {\r\n let raw = window.atob(base64); //this._Base64DecodeUnicode(base64); //\r\n let rawLength = raw.length;\r\n let array = new Uint8Array(new ArrayBuffer(rawLength));\r\n\r\n for(let i = 0; i < rawLength; i++) {\r\n array[i] = raw.charCodeAt(i);\r\n }\r\n return array;\r\n }","function lt(){try{var n=new Uint8Array(1);return n.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},n.foo()===42&&typeof n.subarray==\"function\"&&n.subarray(1,1).byteLength===0}catch(t){return!1}}","function gn(t, e) {\n return t.I ? e.toBase64() : e.toUint8Array();\n}","function bigIntAndBufferInt64Check(bufferMethod) {\n if (typeof BigInt === 'undefined') {\n throw new Error('Platform does not support JS BigInt type.');\n }\n if (typeof buffer_1.Buffer.prototype[bufferMethod] === 'undefined') {\n throw new Error(`Platform does not support Buffer.prototype.${bufferMethod}.`);\n }\n}","get is64Bit() {\n return true;\n }","function makeTestBuffer() {\r\n var dataSize = 4*1024;//400;\r\n var buffer = new ArrayBuffer(dataSize*4+300*4); \r\n var bufferArray = new Int32Array(buffer, 0, dataSize);\r\n for (var i=0; i MAX_SAFE_INT || value < MIN_SAFE_INT) {\n\t throw new Error(`overflow ${field_name} ${value}`);\n\t }\n\t return;\n\t }\n\n\t throw `unsupported type ${field_name}: (${typeof value}) ${value}`;\n\t }","function prepare$ArrayBuffer (o) {\n let naive, naiveJSONLen;\n let ab8, ab8JSONLen;\n let ab16, ab16JSONLen;\n \n if (exports.tune === \"speed\" || exports.tune === \"size\" || (o.byteLength < exports.typedArrayPackThreshold)) {\n naive = { ctr: ctors.indexOf(o.constructor), arg: Array.prototype.slice.call(o) }\n if (exports.tune === \"speed\") {\n return naive\n }\n }\n\n ab8 = prepare$ArrayBuffer8(o)\n if (exports.tune !== \"size\") {\n if (naive && naive.length < ab8.length) {\n return naive\n }\n return ab8\n }\n\n ab16 = prepare$ArrayBuffer16(o)\n naiveJSONLen = naive ? naive.length + 2 : Infinity\n ab8JSONLen = JSON.stringify(ab8).length;\n ab16JSONLen = ab16 ? JSON.stringify(ab16).length : Infinity\n\n if (ab16JSONLen < ab8JSONLen && ab16JSONLen < naiveJSONLen) {\n return ab16\n }\n if (naiveJSONLen < ab8JSONLen) {\n return naive\n }\n\n return ab8;\n}","function assertUint8ArrayAvailable() {\n if (typeof Uint8Array === 'undefined') {\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\"b\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\"a\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\n }\n}","function assertUint8ArrayAvailable() {\n if (typeof Uint8Array === 'undefined') {\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\"a\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\"b\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\n }\n}","function assertUint8ArrayAvailable() {\n if (typeof Uint8Array === 'undefined') {\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\"a\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\"b\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\n }\n}","_Uint8ArrayToBase64(bytes, urlCharset) {\r\n if (!bytes) {\r\n bytes = window.crypto.getRandomValues(new Uint8Array(8));\r\n }\r\n\r\n let base64 = '';\r\n let encodings = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\r\n encodings += urlCharset ? '-_' : '+/';\r\n\r\n let byteLength = bytes.byteLength;\r\n let byteRemainder = byteLength % 3;\r\n let mainLength = byteLength - byteRemainder;\r\n\r\n let a, b, c, d;\r\n let chunk = null;\r\n\r\n // Main loop deals with bytes in chunks of 3\r\n for (let i = 0; i < mainLength; i = i + 3) {\r\n // Combine the three bytes into a single integer\r\n chunk = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];\r\n // Use bitmasks to extract 6-bit segments from the triplet\r\n a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18\r\n b = (chunk & 258048) >> 12; // 258048 = (2^6 - 1) << 12\r\n c = (chunk & 4032) >> 6; // 4032 = (2^6 - 1) << 6\r\n d = chunk & 63; // 63 = 2^6 - 1\r\n // Convert the raw binary segments to the appropriate ASCII encoding\r\n base64 += encodings[a] + encodings[b] + encodings[c] + encodings[d];\r\n }\r\n\r\n // Deal with the remaining bytes and padding\r\n if (byteRemainder == 1) {\r\n chunk = bytes[mainLength];\r\n a = (chunk & 252) >> 2 // 252 = (2^6 - 1) << 2;\r\n // Set the 4 least significant bits to zero\r\n b = (chunk & 3) << 4 // 3 = 2^2 - 1;\r\n base64 += encodings[a] + encodings[b] + '=='\r\n } else if (byteRemainder == 2) {\r\n chunk = (bytes[mainLength] << 8) | bytes[mainLength + 1];\r\n a = (chunk & 64512) >> 10; // 64512 = (2^6 - 1) << 10\r\n b = (chunk & 1008) >> 4; // 1008 = (2^6 - 1) << 4\r\n // Set the 2 least significant bits to zero\r\n c = (chunk & 15) << 2; // 15 = 2^4 - 1\r\n base64 += encodings[a] + encodings[b] + encodings[c] + '=';\r\n }\r\n return base64;\r\n }","function makeNativeIntArray(size) {\n var arr = [];\n for (var i = 0; i < size; i++)\n arr[i] = 0;\n return arr;\n }","arrayBufferToBase64(buffer) {\n var binary = '';\n var bytes = [].slice.call(new Uint8Array(buffer));\n bytes.forEach((b) => binary += String.fromCharCode(b));\n return binary;\n }","function Tn(t, e) {\n return t.V ? e.toBase64() : e.toUint8Array();\n}","arrayBufferToBase64(buffer) {\n var binary = '';\n var bytes = [].slice.call(new Uint8Array(buffer));\n\n bytes.forEach((b) => binary += String.fromCharCode(b));\n\n return window.btoa(binary);\n}","toBuffer() {\n const a = super.toArray().reverse();\n const b = buffer_1.Buffer.from(a);\n if (b.length === 8) {\n return b;\n }\n (0, assert_1.default)(b.length < 8, 'Numberu64 too large');\n const zeroPad = buffer_1.Buffer.alloc(8);\n b.copy(zeroPad);\n return zeroPad;\n }","function v11(v12,v13,...v14) {\n const v17 = new Uint8ClampedArray(3303511276);\n // v17 = .object(ofGroup: Uint8ClampedArray, withProperties: [\"buffer\", \"__proto__\", \"constructor\", \"length\", \"byteOffset\", \"byteLength\"], withMethods: [\"forEach\", \"fill\", \"reverse\", \"subarray\", \"every\", \"some\", \"entries\", \"indexOf\", \"map\", \"copyWithin\", \"sort\", \"filter\", \"find\", \"findIndex\", \"set\", \"keys\", \"includes\", \"slice\", \"join\", \"reduceRight\", \"reduce\", \"lastIndexOf\", \"values\"])\n}","async function v6(v7,v8) {\n const v11 = new Uint32Array(isNaN);\n // v11 = .object(ofGroup: Uint32Array, withProperties: [\"byteLength\", \"byteOffset\", \"__proto__\", \"length\", \"constructor\", \"buffer\"], withMethods: [\"keys\", \"includes\", \"entries\", \"forEach\", \"sort\", \"copyWithin\", \"filter\", \"some\", \"fill\", \"join\", \"find\", \"values\", \"reduceRight\", \"subarray\", \"indexOf\", \"set\", \"reduce\", \"every\", \"findIndex\", \"map\", \"slice\", \"lastIndexOf\", \"reverse\"])\n const v12 = v11[4294967295];\n // v12 = .unknown\n for (let v15 = 0; v15 < 1337; v15 = v15 + 1) {\n for (let v19 = 0; v19 < 5; v19 = v19 + 1) {\n }\n }\n}","function f() {\n if(isLittleEndian()) {\n var bytes = new Uint32Array([0, 0x7FF80000]);\n } else {\n var bytes = new Uint32Array([0x7FF80000, 0]);\n }\n var doubles = new Float64Array(bytes.buffer);\n assertTrue(isNaN(doubles[0]));\n assertTrue(isNaN(doubles[0]*2.0));\n assertTrue(isNaN(doubles[0] + 0.5));\n }","function mc() {\n if (\"undefined\" == typeof Uint8Array) throw new S(_.UNIMPLEMENTED, \"Uint8Arrays are not available in this environment.\");\n}","function setBytesFrom () {\n var byteArray = interpreterProxy.stackValue(1),\n\t result = interpreterProxy.stackValue(0).jsObject\n\n byteArray.bytes = new Uint8Array(result)}","function buildEcdhParam(public_algo, oid, kdfParams, fingerprint) {\n return util.concatUint8Array([\n oid.write(),\n new Uint8Array([public_algo]),\n kdfParams.write(),\n util.strToUint8Array(\"Anonymous Sender \"),\n fingerprint.subarray(0, 20)\n ]);\n}","function yc() {\n if (\"undefined\" == typeof Uint8Array) throw new T(E.UNIMPLEMENTED, \"Uint8Arrays are not available in this environment.\");\n}","function cliEncode(any) {\n return Buffer.from(JSON.stringify(any)).toString('base64');\n}","function e$2(e,n,t,r=!0){if(n%4!=0||t%4!=0){const i=new ArrayBuffer(4*Math.ceil(t/4)),l=new Uint8Array(i),o=new Uint8Array(e,n,t);if(r)for(let e=0;e> 8 - idx % 1 * 8)\n ) {\n charCode = str.charCodeAt(idx += 3 / 4);\n if (charCode > 0xFF) {\n throw new InvalidCharacterError('\"btoa\" failed: The string to be encoded contains characters outside of the Latin1 range.');\n }\n block = block << 8 | charCode;\n }\n return output;\n };\n }","function sha1(str){var _a,_b;var utf8=utf8Encode(str);var words32=stringToWords32(utf8,Endian.Big);var len=utf8.length*8;var w=new Array(80);var _c=Object(tslib__WEBPACK_IMPORTED_MODULE_0__[\"__read\"])([0x67452301,0xefcdab89,0x98badcfe,0x10325476,0xc3d2e1f0],5),a=_c[0],b=_c[1],c=_c[2],d=_c[3],e=_c[4];words32[len>>5]|=0x80<<24-len%32;words32[(len+64>>9<<4)+15]=len;for(var i=0;i>> 8;\n\t}\n\treturn return_value;\n}","function checkMem() {\n // see: https://github.com/WebAssembly/design/issues/1210\n if (buffer !== memory.buffer) {\n buffer = memory.buffer;\n I8 = new Int8Array(buffer);\n U8 = new Uint8Array(buffer);\n I16 = new Int16Array(buffer);\n U16 = new Uint16Array(buffer);\n I32 = new Int32Array(buffer);\n U32 = new Uint32Array(buffer);\n if (hasBigInt64) {\n I64 = new BigInt64Array(buffer);\n U64 = new BigUint64Array(buffer);\n }\n F32 = new Float32Array(buffer);\n F64 = new Float64Array(buffer);\n }\n }","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","function intArrayFromBase64(s) {\n\t if (typeof ENVIRONMENT_IS_NODE === 'boolean' && ENVIRONMENT_IS_NODE) {\n\t var buf;\n\t try {\n\t buf = Buffer.from(s, 'base64');\n\t } catch (_) {\n\t buf = new Buffer(s, 'base64');\n\t }\n\t return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\n\t }\n\n\t try {\n\t var decoded = decodeBase64(s);\n\t var bytes = new Uint8Array(decoded.length);\n\t for (var i = 0 ; i < decoded.length ; ++i) {\n\t bytes[i] = decoded.charCodeAt(i);\n\t }\n\t return bytes;\n\t } catch (_) {\n\t throw new Error('Converting base64 string to bytes failed.');\n\t }\n\t}","constructor() {\n this.r = new Uint16Array(10);\n this.h = new Uint16Array(10);\n this.pad = new Uint16Array(8);\n this.buffer = Buffer.alloc(16);\n this.fin = -1;\n this.leftover = 0;\n }","i64() {\n this._convo.u8.set(this.buffer.subarray(this.at, this.at += 8));\n return this._convo.i64[0];\n }","_binb2b64(_binarray) {\n const _this = this;\n const _tab = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n let _str = '';\n let i;\n const _binLen = _binarray.length * 4;\n let _t1;\n let _t2;\n let _t3;\n let _triplet;\n let j;\n const _binLen32 = _binarray.length * 32;\n for (i = 0; i < _binLen; i += 3) {\n _t1 = (((_binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16);\n _t2 = (((_binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 );\n _t3 = ((_binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);\n _triplet = (_t1 | _t2 | _t3);\n for (j = 0; j < 4; j++){\n if (i * 8 + j * 6 > _binLen32) {\n _str += _this._b64pad;\n }\n else {\n _str += _tab.charAt((_triplet >> 6*(3-j)) & 0x3F);\n }\n }\n }\n return _str;\n }","supportsLongValues() {\n return true;\n }","function binl2b64(binarray) \n{ \nvar tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"; \nvar str = \"\"; \nfor(var i = 0; i < binarray.length * 4; i += 3) \n{ \nvar triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16) \n| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 ) \n| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF); \nfor(var j = 0; j < 4; j++) \n{ \nif(i * 8 + j * 6 > binarray.length * 32) str += b64pad; \nelse str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); \n} \n} \nreturn str; \n}","getENVs() {\n let args = [];\n for (let instruction of this.instructions) {\n if (instruction instanceof env_1.Env) {\n args.push(instruction);\n }\n }\n return args;\n }","function test() {\n let depth = 100;\n const arr = [];\n const factory = class MyArray extends Uint8Array {\n constructor() {\n async function foo() { new factory(); }\n if(depth-- > 0) {\n const x = foo();\n super(arr);\n this.__proto__ = x;\n const unused1 = super.byteLength;\n } else {\n super(arr);\n }\n }\n };\n const unused2 = new factory();\n arr.__proto__ = factory;\n return arr;\n}","function Module(stdlib, imports, buffer) {\n \"use asm\";\n\n function f() {\n return 281474976710655 * 1048575 | 0;\n }\n\n return {\n f: f\n };\n}","function assertBase64Available(){if(!PlatformSupport.getPlatform().base64Available){throw new index_esm_FirestoreError(Code.UNIMPLEMENTED,'Blobs are unavailable in Firestore in this environment.');}}","function base64ArrayBuffer(arrayBuffer) {\n var base64 = '';\n var encodings = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n var bytes = new Uint8Array(arrayBuffer);\n var byteLength = bytes.byteLength;\n var byteRemainder = byteLength % 3;\n var mainLength = byteLength - byteRemainder;\n var a, b, c, d;\n var chunk;\n // Main loop deals with bytes in chunks of 3\n for (var i = 0; i < mainLength; i = i + 3) {\n // Combine the three bytes into a single integer\n chunk = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];\n // Use bitmasks to extract 6-bit segments from the triplet\n a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18\n b = (chunk & 258048) >> 12 ;// 258048 = (2^6 - 1) << 12\n c = (chunk & 4032) >> 6 ;// 4032 = (2^6 - 1) << 6\n d = chunk & 63 ; // 63 = 2^6 - 1\n // Convert the raw binary segments to the appropriate ASCII encoding\n base64 += encodings[a] + encodings[b] + encodings[c] + encodings[d];\n }\n // Deal with the remaining bytes and padding\n if (byteRemainder == 1) {\n chunk = bytes[mainLength];\n a = (chunk & 252) >> 2 ;// 252 = (2^6 - 1) << 2\n // Set the 4 least significant bits to zero\n b = (chunk & 3) << 4 ;// 3 = 2^2 - 1\n base64 += encodings[a] + encodings[b] + '==';\n } else if (byteRemainder == 2) {\n chunk = (bytes[mainLength] << 8) | bytes[mainLength + 1];\n \n a = (chunk & 64512) >> 10 ;// 64512 = (2^6 - 1) << 10\n b = (chunk & 1008) >> 4; // 1008 = (2^6 - 1) << 4\n \n // Set the 2 least significant bits to zero\n c = (chunk & 15) << 2 ;// 15 = 2^4 - 1\n \n base64 += encodings[a] + encodings[b] + encodings[c] + '=';\n }\n return base64;\n}","function $fe91$var$decodeCodePointsArray(codePoints) {\n var len = codePoints.length;\n\n if (len <= $fe91$var$MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\n } // Decode in chunks to avoid \"call stack size exceeded\".\n\n\n var res = '';\n var i = 0;\n\n while (i < len) {\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += $fe91$var$MAX_ARGUMENTS_LENGTH));\n }\n\n return res;\n}","static generate(length) {\r\n if (PlatformHelper.isNodeJs) {\r\n // eslint-disable-next-line @typescript-eslint/no-var-requires,@typescript-eslint/no-require-imports\r\n const crypto = require(\"crypto\");\r\n return crypto.randomBytes(length);\r\n // Keep this as else return so that packager keeps only one side\r\n // of the if based on platform\r\n // eslint-disable-next-line no-else-return\r\n }\r\n else {\r\n const randomBytes = new Uint8Array(length);\r\n window.crypto.getRandomValues(randomBytes);\r\n return randomBytes;\r\n }\r\n }","function buffertoByteArray(value) {\n return BigInteger.fromBuffer(value).toByteArray();\n}","getBextBytes_() {\r\n /** @type {!Array} */\r\n let bytes = [];\r\n this.enforceBext_();\r\n if (this.bext.chunkId) {\r\n this.bext.chunkSize = 602 + this.bext.codingHistory.length;\r\n bytes = bytes.concat(\r\n packString(this.bext.chunkId),\r\n pack(602 + this.bext.codingHistory.length, this.uInt32_),\r\n this.writeString_(this.bext.description, 256),\r\n this.writeString_(this.bext.originator, 32),\r\n this.writeString_(this.bext.originatorReference, 32),\r\n this.writeString_(this.bext.originationDate, 10),\r\n this.writeString_(this.bext.originationTime, 8),\r\n pack(this.bext.timeReference[0], this.uInt32_),\r\n pack(this.bext.timeReference[1], this.uInt32_),\r\n pack(this.bext.version, this.uInt16_),\r\n this.writeString_(this.bext.UMID, 64),\r\n pack(this.bext.loudnessValue, this.uInt16_),\r\n pack(this.bext.loudnessRange, this.uInt16_),\r\n pack(this.bext.maxTruePeakLevel, this.uInt16_),\r\n pack(this.bext.maxMomentaryLoudness, this.uInt16_),\r\n pack(this.bext.maxShortTermLoudness, this.uInt16_),\r\n this.writeString_(this.bext.reserved, 180),\r\n this.writeString_(\r\n this.bext.codingHistory, this.bext.codingHistory.length));\r\n }\r\n return bytes;\r\n }","function v7(v8,v9) {\n v5[v9] = 9007199254740993;\n v5[268435456] = \"65536\";\n for (let v12 = 1; v12 < 65537; v12 = v12 + 1) {\n }\n}","function binl2b64(binarray) \n{ \n var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\" \n var str = \"\" \n for(var i = 0; i < binarray.length * 32; i += 6) \n { \n str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) | \n ((binarray[i>>5+1] >> (32-i%32)) & 0x3F)) \n } \n return str \n}","constructor() {\n this.state = new Uint32Array(16);\n this.stream = new Uint32Array(16);\n this.bytes = new Uint8Array(this.stream.buffer);\n this.pos = -1;\n\n if (BIG_ENDIAN)\n this.bytes = Buffer.alloc(64);\n }","constructor() {\n this.state = new Uint32Array(16);\n this.stream = new Uint32Array(16);\n this.bytes = new Uint8Array(this.stream.buffer);\n this.pos = -1;\n\n if (BIG_ENDIAN)\n this.bytes = Buffer.alloc(64);\n }","function arrayBufferToBase64(input) {\n return btoa(arrayBufferToString(input));\n}"],"string":"[\n \"function v64(v65,v66,v67,v68,v69) {\\n const v70 = ArrayBuffer(split);\\n // v70 = .unknown\\n}\",\n \"function h(){return r.TYPED_ARRAY_SUPPORT?2147483647:1073741823}\",\n \"function makeEnv(env) {\\n env.getTotalMemory = function () { return mdle['TOTAL_MEMORY']; };\\n env.abort = function () { process.exit(-1) }\\n env.exit = function () {\\n finalize()\\n process.exit(0)\\n }\\n env._exit = function () {\\n finalize()\\n process.exit(0)\\n }\\n env._sbrk = _sbrk\\n env._getSystem = function () { return system }\\n env._setSystem = function (ptr) { system = ptr }\\n env._debugSeek = function (ptr) {}\\n env._debugString = function (ptr) {\\n var str = \\\"\\\"\\n ptr += memory_offset\\n while (HEAP8[ptr] != 0) {\\n str += String.fromCharCode(HEAP8[ptr])\\n ptr++\\n }\\n console.log(\\\"DEBUG:\\\", JSON.stringify(str).substr(0, 256))\\n }\\n env._debugBuffer = function (ptr, len) {\\n let str = \\\"\\\"\\n ptr += memory_offset\\n while (len > 0) {\\n str += String.fromCharCode(HEAP8[ptr])\\n len--\\n ptr++\\n }\\n console.log(\\\"DEBUG:\\\", JSON.stringify(str).substr(0, 256))\\n }\\n env._debugInt = function (i) { console.log(i) }\\n \\n env._inputName = function (i,j) {\\n // console.log(\\\"input name\\\", i, j, input.name[i][j])\\n return input.name[i].charCodeAt(j) || 0\\n }\\n \\n env._rintf = function (x) {\\n return x;\\n }\\n\\n env._inputSize = function (i,j) {\\n return input.data[i].length\\n }\\n \\n env._inputData = function (i,j) {\\n // console.log(\\\"input data\\\", i, j, input.data[i][j])\\n return input.data[i][j]\\n }\\n \\n env._outputName = function (i,j,c) {\\n let len = Math.max(input.name[i].length, j)\\n let buf = Buffer.alloc(len, input.name[i])\\n // console.log(\\\"doing output\\\")\\n input.name[i] = buf\\n input.name[i][j] = c\\n }\\n\\n env._outputSize = function (i,sz) {\\n input.data[i] = Buffer.alloc(sz)\\n }\\n\\n env._outputData = function (i,j,c) {\\n input.data[i][j] = c\\n }\\n\\n env.usegas = function (i) {\\n gas += i\\n if (gas > gas_limit) {\\n console.log(\\\"Running out of gas\\\")\\n flushFiles()\\n process.exit(-1)\\n }\\n }\\n\\n env.gas = env.usegas\\n\\n env.abortStackOverflow = function () {\\n console.log(\\\"stack overflow\\\")\\n flushFiles()\\n process.exit(-1)\\n }\\n \\n // stack limit\\n \\n env.pushFrame = function (x) {\\n call_limit--\\n stack_limit -= x\\n if (call_limit < 0) {\\n console.log(\\\"Exceeded call stack limit\\\")\\n flushFiles()\\n process.exit(-1)\\n }\\n if (stack_limit < 0) {\\n console.log(\\\"Exceeded stack limit\\\")\\n flushFiles()\\n process.exit(-1)\\n }\\n }\\n\\n env.popFrame = function (x) {\\n call_limit++\\n stack_limit += x\\n }\\n\\n}\",\n \"qb64b() {\\n return Buffer.from(this.qb64(), 'utf-8');\\n }\",\n \"supportsLongArrayValues() {\\n return true;\\n }\",\n \"function opt(){\\n const v2 = {\\\"maxByteLength\\\":4886690};\\n const v4 = new ArrayBuffer(1458,v2);\\n const v6 = new Int8Array(v4);\\n const v8 = Symbol.toStringTag;\\n const v9 = v6[v8];\\n return v9;\\n}\",\n \"function u(){return s.TYPED_ARRAY_SUPPORT?2147483647:1073741823}\",\n \"function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}\",\n \"function $(stdlib, foreign, heap) {\\n \\\"use asm\\\";\\n var f64 = new stdlib.Float64Array(heap);\\n function f() { var v=0.0; v=+f64[0]; return +v; }\\n return f\\n}\",\n \"function _0x49e8(){const _0x2abf1f=['128458zaqRph','15LuvETp','32FoIOpf','By\\\\x20:\\\\x20Prassz','307917pLgBPR','Zerobot~Prassz','127514DLEruK','2301110zFGGkR','11iUrhyl','5IBSTLg','sendMessage','2099160NwtLDQ','672988HpVyoZ','1059558OLmAKI'];_0x49e8=function(){return _0x2abf1f;};return _0x49e8();}\",\n \"function unsafeBigInt() {\\n return fLib.toBigInt();\\n}\",\n \"function be(t, e) {\\n return t.Qe ? e.toBase64() : e.toUint8Array();\\n}\",\n \"function intArrayFromBase64(s) {\\nif (typeof ENVIRONMENT_IS_NODE === 'boolean' && ENVIRONMENT_IS_NODE) {\\nvar buf;\\ntry {\\nbuf = Buffer.from(s, 'base64');\\n} catch (_) {\\nbuf = new Buffer(s, 'base64');\\n}\\nreturn new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\\n}\\ntry {\\nvar decoded = decodeBase64(s);\\nvar bytes = new Uint8Array(decoded.length);\\nfor (var i = 0 ; i < decoded.length ; ++i) {\\nbytes[i] = decoded.charCodeAt(i);\\n}\\nreturn bytes;\\n} catch (_) {\\nthrow new Error('Converting base64 string to bytes failed.');\\n}\\n}\",\n \"function foo() {\\n try {\\n foo();\\n String.fromCharCode(48,2268268757,48,59,25000,102,111,8,116,45,119,101,105,103,104,116,58,98,111,108,100,59,8,111,8,3394964672,2268268757,102,97,109,105,108,121,58,65,114,3746,97,108,44,32,72,101,8,8,101,116,105,8,97,44,3746,115,10000,110,115,45,25000,101,114,105,8,44,86,101,8,8,1,110,3746,34,32,99,111,108,111,4294967295,16,34,35,8,70,48,4294967295,4294967295,48,34,8,3746,79,82,69,88,47,80,65,82,38,35,1,48,52,59,8,8,25000,3394964672,-1745691656,47,62,84,4294967295,32,38,35,8,48,52,59,38,35,51,53,48,4003,76,4294967295,77,76,8,8,38,35,51,48,52,59,60,47,10000,111,110,116,62,60,47,25000,10000,97,110,25000,25000,47,116,-1745691656,62,10,8,3746,116,114,62,60,116,4294967295,3746,10,8,116,8,32,97,108,105,103,110,2268268757,34,108,101,3746,116,8,62,60,115,112,97,110,8,105,100,8,34,97,99,95,100,101,4294967295,99,34,62,60,102,111,8,8,32,115,8,121,108,3394964672,61,34,8,111,3394964672,116,45,115,25000,122,4003,16,8,49,4294967295,120,59,32,99,8,108,8,114,3746,4003,48,48,48,48,48,3746,59,32,4003,111,110,116,2268268757,102,97,109,105,108,121,8,8,4294967295,105,97,8,44,32,16,101,108,4294967295,101,116,105,99,3746,44,32,115,97,110,4294967295,45,3746,101,2268268757,105,102,44,86,101,114,100,3746,110,97,34,16,38,112,16,117,8,100,59,47,36,32,50,25000,112,10000,112,44,32,89,84,8,32,49,3746,32,25000,105,112,44,65,-1745691656,116,38,35,51,48,53,1,110,32,8,32,99,8,110,116,46,4003,8,8,98,2,116,32,83,112,114,101,97,100,45,84,38,117,-1745691656,109,108,59,114,60,3746,4294967295,114,32,47,8,107,32,66,97,110,8,97,115,38,35,2268268757,48,53,59,32,65,86,65,4003,2268268757,65,74,73,3394964672,2,102,111,110,116,62,60,8,115,112,97,110,62,60,16,116,100,4294967295,10,60,16,116,114,2268268757,2268268757,4294967295,114,62,10,60,116,100,32,97,108,105,103,110,61,8,108,101,102,116,34,62,3394964672,100,105,118,32,25000,100,61,8,97,99,95,117,2,108,2268268757,8,60,102,3394964672,110,116,3746,8,8,3746,108,101,61,4294967295,102,111,110,116,45,115,105,4294967295,101,8,49,48,112,120,59,32,3746,111,108,111,114,58,35,70,70,54,54,57,2,59,32,3746,111,110,4294967295,45,102,0,109,105,10000,121,58,65,114,105,8,108,44,32,72,101,108,3394964672,101,10000,8,99,97,44,32,115,97,110,115,8,115,101,8,16,4294967295,44,86,16,114,100,97,110,8,34,8,119,4294967295,119,46,104,101,100,101,118,111,8,119,98,114,3746,4003,62,3394964672,108,8,3746,101,46,99,3746,109,60,47,102,2268268757,110,16,62,60,4294967295,8,105,118,62,25000,47,0,100,62,8,47,116,16,62,60,47,116,97,8,108,101,62,60,8,116,100,62,60,-1745691656,116,114,62,60,8,-1745691656,62,10,60,116,100,32,99,8,97,4294967295,2268268757,61,34,97,99,95,107,97,3746,105,109,34,32,104,101,2268268757,103,104,8,61,34,50,48,37,34,32,98,8,99,-1745691656,108,111,114,61,2268268757,8,70,70,70,4294967295,70,1,34,32,105,100,61,34,116,97,119,52,34,32,97,108,105,103,110,61,34,108,8,102,116,3746,32,118,97,4294967295,105,8,110,61,34,109,105,100,8,108,3746,34,32,111,8,70,111,99,117,4294967295,4003,8,115,115,40,16,103,111,32,116,111,32,119,119,119,0,107,97,108,101,8,101,60,119,98,3746,0,47,62,46,99,111,109,39,44,25000,97,119,52,39,4294967295,34,32,111,110,77,111,117,115,1,-1745691656,118,3746,3746,61,34,115,3746,40,8,10000,8,32,116,111,32,119,3746,119,46,107,97,108,101,100,101,60,119,98,114,32,-1745691656,62,46,99,111,8,39,8,39,97,119,8,8,41,34,32,32,2,110,77,111,117,115,8,79,117,116,61,34,99,8,8,41,34,4294967295,25000,110,8,108,105,1,107,61,34,103,97,40,39,10000,8,116,112,58,4294967295,47,8,100,115,101,2268268757,4294967295,101,114,46,109,121,110,101,8,3746,99,111,109,1,65,100,83,101,114,118,101,8,47,99,25000,105,99,107,46,106,4294967295,4003,63,117,114,2268268757,8,3746,3394964672,49,48,4294967295,50,53,49,50,1,55,54,51,2268268757,52,4294967295,3394964672,51,49,8,52,3746,48,10000,57,54,48,48,54,51,49,4294967295,54,54,52,52,56,8,56,4003,50,48,8,49,8,52,55,51,55,54,52,51,50,57,4294967295,52,50,8,51,8,8,51,54,16,48,48,48,3746,8,56,49,55,50,8,57,53,48,8,2268268757,49,57,48,54,3746,56,55,50,4294967295,49,55,48,55,53,48,57,50,55,8,55,57,57,51,3746,53,50,52,54,49,51,56,49,57,53,55,8,2,50,8,8,50,55,0,48,8,53,57,56,8,8,50,55,48,4294967295,8,51,49,54,52,1,54,8,53,48,56,57,50,25000,54,4294967295,48,8,49,54,4294967295,25000,57,48,57,49,8,57,8,55,52,55,8,50,48,55,1,4294967295,51,51,25000,51,50,55,2268268757,50,54,55,50,3746,48,51,57,49,8,54,0,8,55,8,51,55,3394964672,52,51,49,51,52,8,56,51,54,51,52,53,8,3746,3746,53,57,48,8,48,56,54,57,49,52,53,49,49,52,4294967295,53,50,120,49,57,50,88,49,8,2,88,8,56,88,2268268757,49,88,56,48,56,48,88,8,39,41,8,0,2268268757,116,1,108,3746,61,34,99,117,114,115,111,114,58,4294967295,3394964672,105,110,116,101,114,34,8,1,8,116,97,98,108,101,32,119,105,25000,116,104,61,34,49,53,54,34,32,98,111,114,100,101,114,61,4294967295,48,34,32,99,101,108,8,115,112,97,99,105,110,103,61,34,49,34,32,99,101,8,108,2,97,100,100,105,110,8,3746,8,49,34,62,10,3746,116,114,62,2268268757,32,32,60,-1745691656,3394964672,32,97,8,105,103,110,61,34,3394964672,101,102,2,34,32,62,3394964672,8,112,97,4003,32,105,0,61,34,97,99,95,116,105,116,108,101,4294967295,62,60,102,111,110,116,32,115,116,8,108,101,61,34,102,111,110,116,8,115,8,122,101,58,8,50,3746,120,59,8,99,111,108,111,114,2268268757,8,70,70,48,48,3746,8,59,2268268757,102,8,110,4294967295);\\n } catch {\\n %DeoptimizeNow();\\n }\\n}\",\n \"function getBigIntConstructor() {\\n if (typeof window !== 'undefined') {\\n return window['BigInt'] || null;\\n }\\n\\n if (typeof global !== 'undefined') {\\n return global['BigInt'] || null;\\n }\\n\\n if (typeof self !== 'undefined') {\\n return self['BigInt'] || null;\\n }\\n\\n throw new Error('Can\\\\'t search globals for BigInt!');\\n }\",\n \"static read64LE(buffer, offset) {\\n const ret_64_be = buffer.toString('hex', offset * 8, ((offset + 1) * 8));\\n const array = Array();\\n for (let i = 0; i < 8; i++) {\\n array.push(ret_64_be.substr(i * 2, 2));\\n }\\n array.reverse();\\n return array.join('');\\n }\",\n \"get memory64() { return check(memory64Wasm); }\",\n \"f64() {\\n this._convo.u8.set(this.buffer.subarray(this.at, this.at += 8));\\n return this._convo.f64[0];\\n }\",\n \"constructor(sharedArrayBuffer) {\\n this.sharedArrayBuffer = sharedArrayBuffer;\\n this.int32 = new Int32Array(sharedArrayBuffer);\\n }\",\n \"async function v15(v16,v17) {\\n let v19 = 0;\\n const v21 = v19 + 1;\\n // v21 = .primitive\\n const v22 = 0;\\n // v22 = .integer\\n Symbol[Object] = Uint8ClampedArray;\\n const v24 = 1;\\n // v24 = .integer\\n for (const v25 in Symbol) {\\n for (let v29 = 0; v29 < 100; v29 = v29 + 1) {\\n }\\n Math.toString = Object;\\n let v32 = 0;\\n while (v32 < 3) {\\n let v33 = 1337;\\n v33 = Int32Array;\\n const v34 = v32 + 1;\\n // v34 = .primitive\\n v32 = v34;\\n }\\n const v35 = v25 / Math;\\n // v35 = .integer | .float | .bigint\\n for (let v41 = 3; v41 < 100; v41 = v41 + -2147483647) {\\n }\\n const v43 = [13.37,v21];\\n // v43 = .object(ofGroup: Array, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"toString\\\", \\\"indexOf\\\", \\\"unshift\\\", \\\"shift\\\", \\\"concat\\\", \\\"sort\\\", \\\"reduceRight\\\", \\\"flatMap\\\", \\\"forEach\\\", \\\"entries\\\", \\\"every\\\", \\\"values\\\", \\\"push\\\", \\\"find\\\", \\\"fill\\\", \\\"toLocaleString\\\", \\\"join\\\", \\\"filter\\\", \\\"pop\\\", \\\"reverse\\\", \\\"some\\\", \\\"reduce\\\", \\\"splice\\\", \\\"includes\\\", \\\"lastIndexOf\\\", \\\"findIndex\\\", \\\"flat\\\", \\\"map\\\", \\\"slice\\\", \\\"keys\\\", \\\"copyWithin\\\"])\\n const v45 = [Symbol,\\\"YEl96px1t8\\\",1337,\\\"YEl96px1t8\\\",Symbol,v43,1337];\\n // v45 = .object(ofGroup: Array, withProperties: [\\\"constructor\\\", \\\"__proto__\\\", \\\"length\\\"], withMethods: [\\\"toString\\\", \\\"indexOf\\\", \\\"unshift\\\", \\\"shift\\\", \\\"concat\\\", \\\"sort\\\", \\\"reduceRight\\\", \\\"flatMap\\\", \\\"forEach\\\", \\\"entries\\\", \\\"every\\\", \\\"values\\\", \\\"push\\\", \\\"find\\\", \\\"fill\\\", \\\"toLocaleString\\\", \\\"join\\\", \\\"filter\\\", \\\"pop\\\", \\\"reverse\\\", \\\"some\\\", \\\"reduce\\\", \\\"splice\\\", \\\"includes\\\", \\\"lastIndexOf\\\", \\\"findIndex\\\", \\\"flat\\\", \\\"map\\\", \\\"slice\\\", \\\"keys\\\", \\\"copyWithin\\\"])\\n const v47 = \\\"127\\\".toLocaleString();\\n // v47 = .unknown\\n }\\n}\",\n \"function q() {\\n if (\\\"undefined\\\" == typeof Uint8Array) throw new P(R.UNIMPLEMENTED, \\\"Uint8Arrays are not available in this environment.\\\");\\n}\",\n \"function DynamicBytes() {\\n\\tvar buffer = [];\\n\\tvar iterator = 0;\\n\\tvar eod = false;\\n\\t\\n\\tvar self = this;\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 4 bytes each\\n\\tself.Export32Bytes = function() {\\n\\t\\tvar data = Int32Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 2 bytes each\\n\\tself.Export16Bytes = function() {\\n\\t\\tvar data = Int16Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 1 byte each\\n\\tself.Export8Bytes = function() {\\n\\t\\tvar data = Uint8Array.from(buffer);\\n\\t\\t//var bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Just export the array as is\\n\\tself.ExportCharArray = function() {\\n\\t\\treturn buffer;\\n\\t}\\n\\t//--------------------------------------------------------------------------------\\n\\t// Export the array in a fully binary, non-human readable form\\n\\tself.ExportAsBin = function() {\\n\\t\\tvar rtrn = \\\"\\\";\\n\\t\\tfor(var i = 0; i < buffer.length; i++) {\\n\\t\\t\\trtrn += String.fromCharCode(buffer[i]);\\n\\t\\t\\t//rtrn += buffer[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn rtrn;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import a non-typed array as is\\n\\tself.appendCharArray = function(array) {\\n\\t\\tbuffer = array;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import any kind of array, adding to the end of the current array\\n\\tself.append = function(array) {\\n\\t\\tfor(var i = 0; i < array.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = array[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Add a single value to the end of the array\\n\\tself.push_back = function(value) {\\n\\t\\tbuffer[buffer.length] = value;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back32 = function(value) {\\n\\t\\tvar data = new Int32Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back16 = function(value) {\\n\\t\\tvar data = new Int16Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back8 = function(value) {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 4 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get32 = function() {\\n\\t\\tvar data = new Int8Array(4);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int32Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 2 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get16 = function() {\\n\\t\\tvar data = new Int8Array(2);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int16Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 1 byte or value in the array and convert them into\\n\\t// a single digit.\\n\\tself.get8 = function() {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Grab the next X amount of bytes in the array and return it as a single array\\n\\tself.getUBytes = function(amount) {\\n\\t\\tvar data = new Uint8Array(amount);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Clear the array\\n\\tself.clear = function() {\\n\\t\\tbuffer = [];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the length of the array\\n\\tself.length = function() {\\n\\t\\treturn buffer.length;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the iterator to the beginning\\n\\tself.rewind = function() {\\n\\t\\titerator = 0;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Returns true if the iterator has reached the End of Data.\\n\\tself.eod = function() {\\n\\t\\treturn eod;\\n\\t}\\n}\",\n \"supportsByteArrayValues() {\\n return true;\\n }\",\n \"function _c() {\\n if (\\\"undefined\\\" == typeof Uint8Array) throw new q(M.UNIMPLEMENTED, \\\"Uint8Arrays are not available in this environment.\\\");\\n}\",\n \"constructor() {\\n let size;\\n if(typeof arguments[0] === 'number') {\\n this.array = new Uint8Array(arguments[0])\\n } else {\\n this.array = arguments[0]\\n }\\n\\n this.readPosition = 0\\n this.writePosition = 0\\n }\",\n \"function abfunc5() {\\n new Uint32Array(ab,5);\\n}\",\n \"function random64BitInHex() {\\n return `${_random16Hex()}${_random16Hex()}${_random16Hex()}${_random16Hex()}`;\\n}\",\n \"function foo(x) {\\n let o = {mz: -0};\\n let b = Object.is(Math.expm1(x), o.mz);\\n // Finished bug triggering\\n let a = [0.1, 0.2, 0.3, 0.4];\\n arrs.push([0.4, 0.5]); // OOB array\\n objs.push({marker: 0x41414141, obj: {}}); // victim object\\n bufs.push(new ArrayBuffer(0x41)); // victim buffer\\n let new_size = (new Int64('7fffffff00000000')).asDouble();\\n for (let i = 4; i < 20; i++) {\\n let val = a[b * i];\\n // Not interested in fixed array\\n\\n let is_backing = a[b * (i + 1)] === 0.4;\\n let orig_size = Int64.fromDouble(val).toString();\\n let good = (orig_size === \\\"0x0000000200000000\\\");\\n // This should take care of both length\\n a[b * i * good] = new_size;\\n // NOTE: IF WE DO THIS, THEN WE WOULDN'T BE ABLE TO BYPASS\\n // DCHECK IN DEBUG BUILD\\n /*\\n # Fatal error in ../../src/objects/fixed-array-inl.h, line 318\\n # Debug check failed: index >= 0 && index < this->length().\\n */\\n /*\\n let good = (orig_size === \\\"0x0000000200000000\\\" && !is_backing);\\n a[b * i * good] = new_size;\\n if (good) {\\n break;\\n }\\n */\\n }\\n}\",\n \"function assertUint8ArrayAvailable(){if(typeof Uint8Array==='undefined'){throw new index_esm_FirestoreError(Code.UNIMPLEMENTED,'Uint8Arrays are not available in this environment.');}}\",\n \"_Base64ToUint8Array(base64) {\\r\\n let raw = window.atob(base64); //this._Base64DecodeUnicode(base64); //\\r\\n let rawLength = raw.length;\\r\\n let array = new Uint8Array(new ArrayBuffer(rawLength));\\r\\n\\r\\n for(let i = 0; i < rawLength; i++) {\\r\\n array[i] = raw.charCodeAt(i);\\r\\n }\\r\\n return array;\\r\\n }\",\n \"function lt(){try{var n=new Uint8Array(1);return n.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},n.foo()===42&&typeof n.subarray==\\\"function\\\"&&n.subarray(1,1).byteLength===0}catch(t){return!1}}\",\n \"function gn(t, e) {\\n return t.I ? e.toBase64() : e.toUint8Array();\\n}\",\n \"function bigIntAndBufferInt64Check(bufferMethod) {\\n if (typeof BigInt === 'undefined') {\\n throw new Error('Platform does not support JS BigInt type.');\\n }\\n if (typeof buffer_1.Buffer.prototype[bufferMethod] === 'undefined') {\\n throw new Error(`Platform does not support Buffer.prototype.${bufferMethod}.`);\\n }\\n}\",\n \"get is64Bit() {\\n return true;\\n }\",\n \"function makeTestBuffer() {\\r\\n var dataSize = 4*1024;//400;\\r\\n var buffer = new ArrayBuffer(dataSize*4+300*4); \\r\\n var bufferArray = new Int32Array(buffer, 0, dataSize);\\r\\n for (var i=0; i MAX_SAFE_INT || value < MIN_SAFE_INT) {\\n\\t throw new Error(`overflow ${field_name} ${value}`);\\n\\t }\\n\\t return;\\n\\t }\\n\\n\\t throw `unsupported type ${field_name}: (${typeof value}) ${value}`;\\n\\t }\",\n \"function prepare$ArrayBuffer (o) {\\n let naive, naiveJSONLen;\\n let ab8, ab8JSONLen;\\n let ab16, ab16JSONLen;\\n \\n if (exports.tune === \\\"speed\\\" || exports.tune === \\\"size\\\" || (o.byteLength < exports.typedArrayPackThreshold)) {\\n naive = { ctr: ctors.indexOf(o.constructor), arg: Array.prototype.slice.call(o) }\\n if (exports.tune === \\\"speed\\\") {\\n return naive\\n }\\n }\\n\\n ab8 = prepare$ArrayBuffer8(o)\\n if (exports.tune !== \\\"size\\\") {\\n if (naive && naive.length < ab8.length) {\\n return naive\\n }\\n return ab8\\n }\\n\\n ab16 = prepare$ArrayBuffer16(o)\\n naiveJSONLen = naive ? naive.length + 2 : Infinity\\n ab8JSONLen = JSON.stringify(ab8).length;\\n ab16JSONLen = ab16 ? JSON.stringify(ab16).length : Infinity\\n\\n if (ab16JSONLen < ab8JSONLen && ab16JSONLen < naiveJSONLen) {\\n return ab16\\n }\\n if (naiveJSONLen < ab8JSONLen) {\\n return naive\\n }\\n\\n return ab8;\\n}\",\n \"function assertUint8ArrayAvailable() {\\n if (typeof Uint8Array === 'undefined') {\\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"b\\\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"a\\\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\\n }\\n}\",\n \"function assertUint8ArrayAvailable() {\\n if (typeof Uint8Array === 'undefined') {\\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"a\\\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"b\\\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\\n }\\n}\",\n \"function assertUint8ArrayAvailable() {\\n if (typeof Uint8Array === 'undefined') {\\n throw new __WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"a\\\" /* FirestoreError */](__WEBPACK_IMPORTED_MODULE_2__util_error__[\\\"b\\\" /* Code */].UNIMPLEMENTED, 'Uint8Arrays are not available in this environment.');\\n }\\n}\",\n \"_Uint8ArrayToBase64(bytes, urlCharset) {\\r\\n if (!bytes) {\\r\\n bytes = window.crypto.getRandomValues(new Uint8Array(8));\\r\\n }\\r\\n\\r\\n let base64 = '';\\r\\n let encodings = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\\r\\n encodings += urlCharset ? '-_' : '+/';\\r\\n\\r\\n let byteLength = bytes.byteLength;\\r\\n let byteRemainder = byteLength % 3;\\r\\n let mainLength = byteLength - byteRemainder;\\r\\n\\r\\n let a, b, c, d;\\r\\n let chunk = null;\\r\\n\\r\\n // Main loop deals with bytes in chunks of 3\\r\\n for (let i = 0; i < mainLength; i = i + 3) {\\r\\n // Combine the three bytes into a single integer\\r\\n chunk = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];\\r\\n // Use bitmasks to extract 6-bit segments from the triplet\\r\\n a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18\\r\\n b = (chunk & 258048) >> 12; // 258048 = (2^6 - 1) << 12\\r\\n c = (chunk & 4032) >> 6; // 4032 = (2^6 - 1) << 6\\r\\n d = chunk & 63; // 63 = 2^6 - 1\\r\\n // Convert the raw binary segments to the appropriate ASCII encoding\\r\\n base64 += encodings[a] + encodings[b] + encodings[c] + encodings[d];\\r\\n }\\r\\n\\r\\n // Deal with the remaining bytes and padding\\r\\n if (byteRemainder == 1) {\\r\\n chunk = bytes[mainLength];\\r\\n a = (chunk & 252) >> 2 // 252 = (2^6 - 1) << 2;\\r\\n // Set the 4 least significant bits to zero\\r\\n b = (chunk & 3) << 4 // 3 = 2^2 - 1;\\r\\n base64 += encodings[a] + encodings[b] + '=='\\r\\n } else if (byteRemainder == 2) {\\r\\n chunk = (bytes[mainLength] << 8) | bytes[mainLength + 1];\\r\\n a = (chunk & 64512) >> 10; // 64512 = (2^6 - 1) << 10\\r\\n b = (chunk & 1008) >> 4; // 1008 = (2^6 - 1) << 4\\r\\n // Set the 2 least significant bits to zero\\r\\n c = (chunk & 15) << 2; // 15 = 2^4 - 1\\r\\n base64 += encodings[a] + encodings[b] + encodings[c] + '=';\\r\\n }\\r\\n return base64;\\r\\n }\",\n \"function makeNativeIntArray(size) {\\n var arr = [];\\n for (var i = 0; i < size; i++)\\n arr[i] = 0;\\n return arr;\\n }\",\n \"arrayBufferToBase64(buffer) {\\n var binary = '';\\n var bytes = [].slice.call(new Uint8Array(buffer));\\n bytes.forEach((b) => binary += String.fromCharCode(b));\\n return binary;\\n }\",\n \"function Tn(t, e) {\\n return t.V ? e.toBase64() : e.toUint8Array();\\n}\",\n \"arrayBufferToBase64(buffer) {\\n var binary = '';\\n var bytes = [].slice.call(new Uint8Array(buffer));\\n\\n bytes.forEach((b) => binary += String.fromCharCode(b));\\n\\n return window.btoa(binary);\\n}\",\n \"toBuffer() {\\n const a = super.toArray().reverse();\\n const b = buffer_1.Buffer.from(a);\\n if (b.length === 8) {\\n return b;\\n }\\n (0, assert_1.default)(b.length < 8, 'Numberu64 too large');\\n const zeroPad = buffer_1.Buffer.alloc(8);\\n b.copy(zeroPad);\\n return zeroPad;\\n }\",\n \"function v11(v12,v13,...v14) {\\n const v17 = new Uint8ClampedArray(3303511276);\\n // v17 = .object(ofGroup: Uint8ClampedArray, withProperties: [\\\"buffer\\\", \\\"__proto__\\\", \\\"constructor\\\", \\\"length\\\", \\\"byteOffset\\\", \\\"byteLength\\\"], withMethods: [\\\"forEach\\\", \\\"fill\\\", \\\"reverse\\\", \\\"subarray\\\", \\\"every\\\", \\\"some\\\", \\\"entries\\\", \\\"indexOf\\\", \\\"map\\\", \\\"copyWithin\\\", \\\"sort\\\", \\\"filter\\\", \\\"find\\\", \\\"findIndex\\\", \\\"set\\\", \\\"keys\\\", \\\"includes\\\", \\\"slice\\\", \\\"join\\\", \\\"reduceRight\\\", \\\"reduce\\\", \\\"lastIndexOf\\\", \\\"values\\\"])\\n}\",\n \"async function v6(v7,v8) {\\n const v11 = new Uint32Array(isNaN);\\n // v11 = .object(ofGroup: Uint32Array, withProperties: [\\\"byteLength\\\", \\\"byteOffset\\\", \\\"__proto__\\\", \\\"length\\\", \\\"constructor\\\", \\\"buffer\\\"], withMethods: [\\\"keys\\\", \\\"includes\\\", \\\"entries\\\", \\\"forEach\\\", \\\"sort\\\", \\\"copyWithin\\\", \\\"filter\\\", \\\"some\\\", \\\"fill\\\", \\\"join\\\", \\\"find\\\", \\\"values\\\", \\\"reduceRight\\\", \\\"subarray\\\", \\\"indexOf\\\", \\\"set\\\", \\\"reduce\\\", \\\"every\\\", \\\"findIndex\\\", \\\"map\\\", \\\"slice\\\", \\\"lastIndexOf\\\", \\\"reverse\\\"])\\n const v12 = v11[4294967295];\\n // v12 = .unknown\\n for (let v15 = 0; v15 < 1337; v15 = v15 + 1) {\\n for (let v19 = 0; v19 < 5; v19 = v19 + 1) {\\n }\\n }\\n}\",\n \"function f() {\\n if(isLittleEndian()) {\\n var bytes = new Uint32Array([0, 0x7FF80000]);\\n } else {\\n var bytes = new Uint32Array([0x7FF80000, 0]);\\n }\\n var doubles = new Float64Array(bytes.buffer);\\n assertTrue(isNaN(doubles[0]));\\n assertTrue(isNaN(doubles[0]*2.0));\\n assertTrue(isNaN(doubles[0] + 0.5));\\n }\",\n \"function mc() {\\n if (\\\"undefined\\\" == typeof Uint8Array) throw new S(_.UNIMPLEMENTED, \\\"Uint8Arrays are not available in this environment.\\\");\\n}\",\n \"function setBytesFrom () {\\n var byteArray = interpreterProxy.stackValue(1),\\n\\t result = interpreterProxy.stackValue(0).jsObject\\n\\n byteArray.bytes = new Uint8Array(result)}\",\n \"function buildEcdhParam(public_algo, oid, kdfParams, fingerprint) {\\n return util.concatUint8Array([\\n oid.write(),\\n new Uint8Array([public_algo]),\\n kdfParams.write(),\\n util.strToUint8Array(\\\"Anonymous Sender \\\"),\\n fingerprint.subarray(0, 20)\\n ]);\\n}\",\n \"function yc() {\\n if (\\\"undefined\\\" == typeof Uint8Array) throw new T(E.UNIMPLEMENTED, \\\"Uint8Arrays are not available in this environment.\\\");\\n}\",\n \"function cliEncode(any) {\\n return Buffer.from(JSON.stringify(any)).toString('base64');\\n}\",\n \"function e$2(e,n,t,r=!0){if(n%4!=0||t%4!=0){const i=new ArrayBuffer(4*Math.ceil(t/4)),l=new Uint8Array(i),o=new Uint8Array(e,n,t);if(r)for(let e=0;e> 8 - idx % 1 * 8)\\n ) {\\n charCode = str.charCodeAt(idx += 3 / 4);\\n if (charCode > 0xFF) {\\n throw new InvalidCharacterError('\\\"btoa\\\" failed: The string to be encoded contains characters outside of the Latin1 range.');\\n }\\n block = block << 8 | charCode;\\n }\\n return output;\\n };\\n }\",\n \"function sha1(str){var _a,_b;var utf8=utf8Encode(str);var words32=stringToWords32(utf8,Endian.Big);var len=utf8.length*8;var w=new Array(80);var _c=Object(tslib__WEBPACK_IMPORTED_MODULE_0__[\\\"__read\\\"])([0x67452301,0xefcdab89,0x98badcfe,0x10325476,0xc3d2e1f0],5),a=_c[0],b=_c[1],c=_c[2],d=_c[3],e=_c[4];words32[len>>5]|=0x80<<24-len%32;words32[(len+64>>9<<4)+15]=len;for(var i=0;i>> 8;\\n\\t}\\n\\treturn return_value;\\n}\",\n \"function checkMem() {\\n // see: https://github.com/WebAssembly/design/issues/1210\\n if (buffer !== memory.buffer) {\\n buffer = memory.buffer;\\n I8 = new Int8Array(buffer);\\n U8 = new Uint8Array(buffer);\\n I16 = new Int16Array(buffer);\\n U16 = new Uint16Array(buffer);\\n I32 = new Int32Array(buffer);\\n U32 = new Uint32Array(buffer);\\n if (hasBigInt64) {\\n I64 = new BigInt64Array(buffer);\\n U64 = new BigUint64Array(buffer);\\n }\\n F32 = new Float32Array(buffer);\\n F64 = new Float64Array(buffer);\\n }\\n }\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"function intArrayFromBase64(s) {\\n\\t if (typeof ENVIRONMENT_IS_NODE === 'boolean' && ENVIRONMENT_IS_NODE) {\\n\\t var buf;\\n\\t try {\\n\\t buf = Buffer.from(s, 'base64');\\n\\t } catch (_) {\\n\\t buf = new Buffer(s, 'base64');\\n\\t }\\n\\t return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);\\n\\t }\\n\\n\\t try {\\n\\t var decoded = decodeBase64(s);\\n\\t var bytes = new Uint8Array(decoded.length);\\n\\t for (var i = 0 ; i < decoded.length ; ++i) {\\n\\t bytes[i] = decoded.charCodeAt(i);\\n\\t }\\n\\t return bytes;\\n\\t } catch (_) {\\n\\t throw new Error('Converting base64 string to bytes failed.');\\n\\t }\\n\\t}\",\n \"constructor() {\\n this.r = new Uint16Array(10);\\n this.h = new Uint16Array(10);\\n this.pad = new Uint16Array(8);\\n this.buffer = Buffer.alloc(16);\\n this.fin = -1;\\n this.leftover = 0;\\n }\",\n \"i64() {\\n this._convo.u8.set(this.buffer.subarray(this.at, this.at += 8));\\n return this._convo.i64[0];\\n }\",\n \"_binb2b64(_binarray) {\\n const _this = this;\\n const _tab = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\\n let _str = '';\\n let i;\\n const _binLen = _binarray.length * 4;\\n let _t1;\\n let _t2;\\n let _t3;\\n let _triplet;\\n let j;\\n const _binLen32 = _binarray.length * 32;\\n for (i = 0; i < _binLen; i += 3) {\\n _t1 = (((_binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16);\\n _t2 = (((_binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 );\\n _t3 = ((_binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);\\n _triplet = (_t1 | _t2 | _t3);\\n for (j = 0; j < 4; j++){\\n if (i * 8 + j * 6 > _binLen32) {\\n _str += _this._b64pad;\\n }\\n else {\\n _str += _tab.charAt((_triplet >> 6*(3-j)) & 0x3F);\\n }\\n }\\n }\\n return _str;\\n }\",\n \"supportsLongValues() {\\n return true;\\n }\",\n \"function binl2b64(binarray) \\n{ \\nvar tab = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\"; \\nvar str = \\\"\\\"; \\nfor(var i = 0; i < binarray.length * 4; i += 3) \\n{ \\nvar triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16) \\n| (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 ) \\n| ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF); \\nfor(var j = 0; j < 4; j++) \\n{ \\nif(i * 8 + j * 6 > binarray.length * 32) str += b64pad; \\nelse str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); \\n} \\n} \\nreturn str; \\n}\",\n \"getENVs() {\\n let args = [];\\n for (let instruction of this.instructions) {\\n if (instruction instanceof env_1.Env) {\\n args.push(instruction);\\n }\\n }\\n return args;\\n }\",\n \"function test() {\\n let depth = 100;\\n const arr = [];\\n const factory = class MyArray extends Uint8Array {\\n constructor() {\\n async function foo() { new factory(); }\\n if(depth-- > 0) {\\n const x = foo();\\n super(arr);\\n this.__proto__ = x;\\n const unused1 = super.byteLength;\\n } else {\\n super(arr);\\n }\\n }\\n };\\n const unused2 = new factory();\\n arr.__proto__ = factory;\\n return arr;\\n}\",\n \"function Module(stdlib, imports, buffer) {\\n \\\"use asm\\\";\\n\\n function f() {\\n return 281474976710655 * 1048575 | 0;\\n }\\n\\n return {\\n f: f\\n };\\n}\",\n \"function assertBase64Available(){if(!PlatformSupport.getPlatform().base64Available){throw new index_esm_FirestoreError(Code.UNIMPLEMENTED,'Blobs are unavailable in Firestore in this environment.');}}\",\n \"function base64ArrayBuffer(arrayBuffer) {\\n var base64 = '';\\n var encodings = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\\n var bytes = new Uint8Array(arrayBuffer);\\n var byteLength = bytes.byteLength;\\n var byteRemainder = byteLength % 3;\\n var mainLength = byteLength - byteRemainder;\\n var a, b, c, d;\\n var chunk;\\n // Main loop deals with bytes in chunks of 3\\n for (var i = 0; i < mainLength; i = i + 3) {\\n // Combine the three bytes into a single integer\\n chunk = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];\\n // Use bitmasks to extract 6-bit segments from the triplet\\n a = (chunk & 16515072) >> 18; // 16515072 = (2^6 - 1) << 18\\n b = (chunk & 258048) >> 12 ;// 258048 = (2^6 - 1) << 12\\n c = (chunk & 4032) >> 6 ;// 4032 = (2^6 - 1) << 6\\n d = chunk & 63 ; // 63 = 2^6 - 1\\n // Convert the raw binary segments to the appropriate ASCII encoding\\n base64 += encodings[a] + encodings[b] + encodings[c] + encodings[d];\\n }\\n // Deal with the remaining bytes and padding\\n if (byteRemainder == 1) {\\n chunk = bytes[mainLength];\\n a = (chunk & 252) >> 2 ;// 252 = (2^6 - 1) << 2\\n // Set the 4 least significant bits to zero\\n b = (chunk & 3) << 4 ;// 3 = 2^2 - 1\\n base64 += encodings[a] + encodings[b] + '==';\\n } else if (byteRemainder == 2) {\\n chunk = (bytes[mainLength] << 8) | bytes[mainLength + 1];\\n \\n a = (chunk & 64512) >> 10 ;// 64512 = (2^6 - 1) << 10\\n b = (chunk & 1008) >> 4; // 1008 = (2^6 - 1) << 4\\n \\n // Set the 2 least significant bits to zero\\n c = (chunk & 15) << 2 ;// 15 = 2^4 - 1\\n \\n base64 += encodings[a] + encodings[b] + encodings[c] + '=';\\n }\\n return base64;\\n}\",\n \"function $fe91$var$decodeCodePointsArray(codePoints) {\\n var len = codePoints.length;\\n\\n if (len <= $fe91$var$MAX_ARGUMENTS_LENGTH) {\\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\\n } // Decode in chunks to avoid \\\"call stack size exceeded\\\".\\n\\n\\n var res = '';\\n var i = 0;\\n\\n while (i < len) {\\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += $fe91$var$MAX_ARGUMENTS_LENGTH));\\n }\\n\\n return res;\\n}\",\n \"static generate(length) {\\r\\n if (PlatformHelper.isNodeJs) {\\r\\n // eslint-disable-next-line @typescript-eslint/no-var-requires,@typescript-eslint/no-require-imports\\r\\n const crypto = require(\\\"crypto\\\");\\r\\n return crypto.randomBytes(length);\\r\\n // Keep this as else return so that packager keeps only one side\\r\\n // of the if based on platform\\r\\n // eslint-disable-next-line no-else-return\\r\\n }\\r\\n else {\\r\\n const randomBytes = new Uint8Array(length);\\r\\n window.crypto.getRandomValues(randomBytes);\\r\\n return randomBytes;\\r\\n }\\r\\n }\",\n \"function buffertoByteArray(value) {\\n return BigInteger.fromBuffer(value).toByteArray();\\n}\",\n \"getBextBytes_() {\\r\\n /** @type {!Array} */\\r\\n let bytes = [];\\r\\n this.enforceBext_();\\r\\n if (this.bext.chunkId) {\\r\\n this.bext.chunkSize = 602 + this.bext.codingHistory.length;\\r\\n bytes = bytes.concat(\\r\\n packString(this.bext.chunkId),\\r\\n pack(602 + this.bext.codingHistory.length, this.uInt32_),\\r\\n this.writeString_(this.bext.description, 256),\\r\\n this.writeString_(this.bext.originator, 32),\\r\\n this.writeString_(this.bext.originatorReference, 32),\\r\\n this.writeString_(this.bext.originationDate, 10),\\r\\n this.writeString_(this.bext.originationTime, 8),\\r\\n pack(this.bext.timeReference[0], this.uInt32_),\\r\\n pack(this.bext.timeReference[1], this.uInt32_),\\r\\n pack(this.bext.version, this.uInt16_),\\r\\n this.writeString_(this.bext.UMID, 64),\\r\\n pack(this.bext.loudnessValue, this.uInt16_),\\r\\n pack(this.bext.loudnessRange, this.uInt16_),\\r\\n pack(this.bext.maxTruePeakLevel, this.uInt16_),\\r\\n pack(this.bext.maxMomentaryLoudness, this.uInt16_),\\r\\n pack(this.bext.maxShortTermLoudness, this.uInt16_),\\r\\n this.writeString_(this.bext.reserved, 180),\\r\\n this.writeString_(\\r\\n this.bext.codingHistory, this.bext.codingHistory.length));\\r\\n }\\r\\n return bytes;\\r\\n }\",\n \"function v7(v8,v9) {\\n v5[v9] = 9007199254740993;\\n v5[268435456] = \\\"65536\\\";\\n for (let v12 = 1; v12 < 65537; v12 = v12 + 1) {\\n }\\n}\",\n \"function binl2b64(binarray) \\n{ \\n var tab = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\" \\n var str = \\\"\\\" \\n for(var i = 0; i < binarray.length * 32; i += 6) \\n { \\n str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) | \\n ((binarray[i>>5+1] >> (32-i%32)) & 0x3F)) \\n } \\n return str \\n}\",\n \"constructor() {\\n this.state = new Uint32Array(16);\\n this.stream = new Uint32Array(16);\\n this.bytes = new Uint8Array(this.stream.buffer);\\n this.pos = -1;\\n\\n if (BIG_ENDIAN)\\n this.bytes = Buffer.alloc(64);\\n }\",\n \"constructor() {\\n this.state = new Uint32Array(16);\\n this.stream = new Uint32Array(16);\\n this.bytes = new Uint8Array(this.stream.buffer);\\n this.pos = -1;\\n\\n if (BIG_ENDIAN)\\n this.bytes = Buffer.alloc(64);\\n }\",\n \"function arrayBufferToBase64(input) {\\n return btoa(arrayBufferToString(input));\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.59258646","0.54551214","0.53476554","0.5341588","0.53322065","0.53000367","0.52759856","0.5270142","0.51673603","0.5133303","0.5119744","0.50289637","0.5027842","0.5000861","0.49966353","0.4969807","0.49406448","0.49262202","0.4903299","0.49010926","0.4895606","0.48888054","0.48791727","0.4874188","0.4850198","0.48477057","0.48284146","0.48164585","0.48153985","0.48150715","0.48139736","0.48084807","0.48003182","0.47708496","0.47650152","0.47628668","0.47526294","0.47364303","0.47345376","0.47345376","0.47268337","0.47162953","0.4703224","0.46928486","0.4687487","0.468727","0.46846402","0.46833217","0.4676374","0.4672615","0.46714237","0.46685866","0.466632","0.4664065","0.46608502","0.46585527","0.4652717","0.46411517","0.46404177","0.46398476","0.46311444","0.46275803","0.4624692","0.4616172","0.4615805","0.46088055","0.46044672","0.45961124","0.4591453","0.45886126","0.45716745","0.45654467","0.45634574","0.4558884","0.4558884","0.45577192","0.45553902","0.45478192","0.45458952","0.45458952","0.45458952","0.4543679","0.45387736","0.4538544","0.45348534","0.45298836","0.45279762","0.45264313","0.4522498","0.45112887","0.45111096","0.45101756","0.4510134","0.4509496","0.45081186","0.45024994","0.45013458","0.45011127","0.44989708","0.44989708","0.44973063"],"string":"[\n \"0.59258646\",\n \"0.54551214\",\n \"0.53476554\",\n \"0.5341588\",\n \"0.53322065\",\n \"0.53000367\",\n \"0.52759856\",\n \"0.5270142\",\n \"0.51673603\",\n \"0.5133303\",\n \"0.5119744\",\n \"0.50289637\",\n \"0.5027842\",\n \"0.5000861\",\n \"0.49966353\",\n \"0.4969807\",\n \"0.49406448\",\n \"0.49262202\",\n \"0.4903299\",\n \"0.49010926\",\n \"0.4895606\",\n \"0.48888054\",\n \"0.48791727\",\n \"0.4874188\",\n \"0.4850198\",\n \"0.48477057\",\n \"0.48284146\",\n \"0.48164585\",\n \"0.48153985\",\n \"0.48150715\",\n \"0.48139736\",\n \"0.48084807\",\n \"0.48003182\",\n \"0.47708496\",\n \"0.47650152\",\n \"0.47628668\",\n \"0.47526294\",\n \"0.47364303\",\n \"0.47345376\",\n \"0.47345376\",\n \"0.47268337\",\n \"0.47162953\",\n \"0.4703224\",\n \"0.46928486\",\n \"0.4687487\",\n \"0.468727\",\n \"0.46846402\",\n \"0.46833217\",\n \"0.4676374\",\n \"0.4672615\",\n \"0.46714237\",\n \"0.46685866\",\n \"0.466632\",\n \"0.4664065\",\n \"0.46608502\",\n \"0.46585527\",\n \"0.4652717\",\n \"0.46411517\",\n \"0.46404177\",\n \"0.46398476\",\n \"0.46311444\",\n \"0.46275803\",\n \"0.4624692\",\n \"0.4616172\",\n \"0.4615805\",\n \"0.46088055\",\n \"0.46044672\",\n \"0.45961124\",\n \"0.4591453\",\n \"0.45886126\",\n \"0.45716745\",\n \"0.45654467\",\n \"0.45634574\",\n \"0.4558884\",\n \"0.4558884\",\n \"0.45577192\",\n \"0.45553902\",\n \"0.45478192\",\n \"0.45458952\",\n \"0.45458952\",\n \"0.45458952\",\n \"0.4543679\",\n \"0.45387736\",\n \"0.4538544\",\n \"0.45348534\",\n \"0.45298836\",\n \"0.45279762\",\n \"0.45264313\",\n \"0.4522498\",\n \"0.45112887\",\n \"0.45111096\",\n \"0.45101756\",\n \"0.4510134\",\n \"0.4509496\",\n \"0.45081186\",\n \"0.45024994\",\n \"0.45013458\",\n \"0.45011127\",\n \"0.44989708\",\n \"0.44989708\",\n \"0.44973063\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82036,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the list cache."},"document":{"kind":"string","value":"function listCacheClear(){this.__data__=[];this.size=0;}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear(){this.__data__=[];}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t this.size = 0;\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t}","function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t }","function listCacheClear(){this.__data__=[];this.size=0}","function listCacheClear(){this.__data__=[];this.size=0}","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t this.size = 0;\n\t }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n\t this.__data__ = [];\n\t }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }","function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }"],"string":"[\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear(){this.__data__=[];}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t this.size = 0;\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t}\",\n \"function listCacheClear() {\\n\\t\\t this.__data__ = [];\\n\\t\\t }\",\n \"function listCacheClear(){this.__data__=[];this.size=0}\",\n \"function listCacheClear(){this.__data__=[];this.size=0}\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t this.size = 0;\\n\\t }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n\\t this.__data__ = [];\\n\\t }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\",\n \"function listCacheClear() {\\n this.__data__ = [];\\n this.size = 0;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.7357779","0.7357779","0.7357779","0.7357779","0.7317932","0.72645503","0.72645503","0.7262977","0.72569066","0.72569066","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.7234546","0.72320706","0.7231067","0.7231067","0.7231067","0.7231067","0.7231067","0.7231067","0.7226719","0.7226719","0.7226719","0.7226719","0.7214961","0.7214961","0.7207822","0.7207822","0.7207822","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724","0.71798724"],"string":"[\n \"0.7357779\",\n \"0.7357779\",\n \"0.7357779\",\n \"0.7357779\",\n \"0.7317932\",\n \"0.72645503\",\n \"0.72645503\",\n \"0.7262977\",\n \"0.72569066\",\n \"0.72569066\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.7234546\",\n \"0.72320706\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7231067\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7226719\",\n \"0.7214961\",\n \"0.7214961\",\n \"0.7207822\",\n \"0.7207822\",\n \"0.7207822\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\",\n \"0.71798724\"\n]"},"document_score":{"kind":"string","value":"0.7236393"},"document_rank":{"kind":"string","value":"18"}}},{"rowIdx":82037,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the stack."},"document":{"kind":"string","value":"function stackClear(){this.__data__=new ListCache();this.size=0;}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["clear () {\n this._dict = {}\n this._stack = [this._dict]\n }","function stackClear(){this.__data__={'array':[],'map':null};}","function stackClear(){this.__data__={'array':[],'map':null};}","function stackClear(){this.__data__={'array':[],'map':null};}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t }","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n }","function stackClear() {\n\tthis.__data__ = new _ListCache();\n\tthis.size = 0;\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","function stackClear() {\n\t this.__data__ = new _ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t}","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n\t\t this.__data__ = new ListCache;\n\t\t this.size = 0;\n\t\t}","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n\t this.__data__ = new ListCache();\n\t}","function stackClear() {\n this.__data__ = new ListCache();\n this.size = 0;\n }","function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t }","function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }","function stackClear() {\n\t this.__data__ = new ListCache();\n\t }","function stackClear() {\n\t this.__data__ = new ListCache();\n\t this.size = 0;\n\t }","function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n}","function stackClear() {\n this.__data__ = new _ListCache.default();\n this.size = 0;\n}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}","function stackClear() {\n\t this.__data__ = new ListCache;\n\t this.size = 0;\n\t}"],"string":"[\n \"clear () {\\n this._dict = {}\\n this._stack = [this._dict]\\n }\",\n \"function stackClear(){this.__data__={'array':[],'map':null};}\",\n \"function stackClear(){this.__data__={'array':[],'map':null};}\",\n \"function stackClear(){this.__data__={'array':[],'map':null};}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"function stackClear() {\\n this.__data__ = new _ListCache.default();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\tthis.__data__ = new _ListCache();\\n\\tthis.size = 0;\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"function stackClear() {\\n\\t this.__data__ = new _ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\t\\t this.__data__ = new ListCache;\\n\\t\\t this.size = 0;\\n\\t\\t}\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t}\",\n \"function stackClear() {\\n this.__data__ = new ListCache();\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n this.__data__ = new ListCache;\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n this.__data__ = new ListCache;\\n this.size = 0;\\n }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t }\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache();\\n\\t this.size = 0;\\n\\t }\",\n \"function stackClear() {\\n this.__data__ = new _ListCache.default();\\n this.size = 0;\\n}\",\n \"function stackClear() {\\n this.__data__ = new _ListCache.default();\\n this.size = 0;\\n}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\",\n \"function stackClear() {\\n\\t this.__data__ = new ListCache;\\n\\t this.size = 0;\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.63577217","0.63291264","0.63291264","0.63291264","0.62734073","0.62274295","0.62274295","0.62274295","0.62274295","0.62274295","0.62274295","0.62274295","0.62171006","0.62171006","0.62171006","0.62171006","0.62171006","0.62171006","0.62171006","0.62171006","0.62171006","0.6124301","0.6123662","0.6117471","0.6117471","0.6117471","0.6117471","0.6117471","0.6117471","0.6113855","0.6109778","0.6109778","0.6104759","0.6104759","0.6104759","0.6104759","0.6104759","0.6104759","0.6101607","0.6101607","0.60982674","0.6098207","0.6098207","0.6098207","0.6098207","0.6078293","0.606845","0.6068411","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.606763","0.6067161","0.60666186","0.60604995","0.60451716","0.60451716","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735","0.60430735"],"string":"[\n \"0.63577217\",\n \"0.63291264\",\n \"0.63291264\",\n \"0.63291264\",\n \"0.62734073\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62274295\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.62171006\",\n \"0.6124301\",\n \"0.6123662\",\n \"0.6117471\",\n \"0.6117471\",\n \"0.6117471\",\n \"0.6117471\",\n \"0.6117471\",\n \"0.6117471\",\n \"0.6113855\",\n \"0.6109778\",\n \"0.6109778\",\n \"0.6104759\",\n \"0.6104759\",\n \"0.6104759\",\n \"0.6104759\",\n \"0.6104759\",\n \"0.6104759\",\n \"0.6101607\",\n \"0.6101607\",\n \"0.60982674\",\n \"0.6098207\",\n \"0.6098207\",\n \"0.6098207\",\n \"0.6098207\",\n \"0.6078293\",\n \"0.606845\",\n \"0.6068411\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.606763\",\n \"0.6067161\",\n \"0.60666186\",\n \"0.60604995\",\n \"0.60451716\",\n \"0.60451716\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\",\n \"0.60430735\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82038,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the hash."},"document":{"kind":"string","value":"function hashClear(){this.__data__=nativeCreate?nativeCreate(null):{};this.size=0;}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }","function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}","remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }","removeFromHash(hash, ...keys) {\n let hashObj = this.parseHash(hash);\n keys.forEach((key, i) => {\n delete hashObj[key]\n });\n return this.buildHash(hashObj);\n }","clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }","function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }","async clear() {\n return await keyv.clear();\n }","remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }","function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }","function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t}","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }","function hashClear() {\n\t\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t\t this.size = 0;\n\t\t }","function hashClear() {\n\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\n\t this.size = 0;\n\t }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }","function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }"],"string":"[\n \"clear() {\\n var map = this._map;\\n var keys = Object.keys(map);\\n\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n map[key].clear();\\n }\\n }\",\n \"function clear() {\\n this.keys.forEach((key) => {\\n this._store[key] = undefined;\\n delete this._store[key];\\n });\\n}\",\n \"remove(key) {\\r\\n const hash = this.calculateHash(key);\\r\\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\\r\\n delete this.values[hash][key];\\r\\n this.numberOfValues--;\\r\\n }\\r\\n }\",\n \"removeFromHash(hash, ...keys) {\\n let hashObj = this.parseHash(hash);\\n keys.forEach((key, i) => {\\n delete hashObj[key]\\n });\\n return this.buildHash(hashObj);\\n }\",\n \"clear() {\\n log.map(\\\"Clearing the map of all the entries\\\");\\n this._map.clear();\\n }\",\n \"function _cleanupKeys()\\n {\\n if (this._count == this._keys.length) {\\n return;\\n }\\n var srcIndex = 0;\\n var destIndex = 0;\\n var seen = {};\\n while (srcIndex < this._keys.length) {\\n var key = this._keys[srcIndex];\\n if (_hasKey(this._map, key)\\n && !_hasKey(seen, key)\\n ) {\\n this._keys[destIndex++] = key;\\n seen[key] = true;\\n }\\n srcIndex++;\\n }\\n this._keys.length = destIndex;\\n }\",\n \"async clear() {\\n return await keyv.clear();\\n }\",\n \"remove() {\\n for (var key of this.keys) {\\n this.elements[key].remove();\\n }\\n }\",\n \"function clear () {\\n keys().each(function (cookie) {\\n remove(cookie);\\n });\\n }\",\n \"function clearAll(){\\r\\n\\tObject.keys(this.datastore).forEach((key)=>\\r\\n\\t{\\r\\n\\t\\tdelete this.datastore[key];\\r\\n\\t});\\t\\r\\n}\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t}\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"clear() {\\n for (const key of Object.keys(this.datastore)) {\\n delete this.datastore[key];\\n // this.remove(key);\\n }\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t }\",\n \"function hashClear() {\\n\\t\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t\\t this.size = 0;\\n\\t\\t }\",\n \"function hashClear() {\\n\\t this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\\t this.size = 0;\\n\\t }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\",\n \"function hashClear() {\\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n this.size = 0;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.67331547","0.66229314","0.65130246","0.6456053","0.62131137","0.6201214","0.6139392","0.61100906","0.6029288","0.5966744","0.59360605","0.59072584","0.59072584","0.59072584","0.59040016","0.5900616","0.5900616","0.5900616","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.58648694","0.5862478","0.5862478","0.5849724","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314","0.58496314"],"string":"[\n \"0.67331547\",\n \"0.66229314\",\n \"0.65130246\",\n \"0.6456053\",\n \"0.62131137\",\n \"0.6201214\",\n \"0.6139392\",\n \"0.61100906\",\n \"0.6029288\",\n \"0.5966744\",\n \"0.59360605\",\n \"0.59072584\",\n \"0.59072584\",\n \"0.59072584\",\n \"0.59040016\",\n \"0.5900616\",\n \"0.5900616\",\n \"0.5900616\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.58648694\",\n \"0.5862478\",\n \"0.5862478\",\n \"0.5849724\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\",\n \"0.58496314\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82039,"cells":{"query":{"kind":"string","value":"Removes all keyvalue entries from the map."},"document":{"kind":"string","value":"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map$1||ListCache)(),'string':new Hash()};}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }","clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }","function multiMapRemove(map, key, value) {\n const values = map.get(key);\n if (values) {\n array_1.removeUnordered(values, value);\n if (values.length === 0)\n map.delete(key);\n }\n}","function _cleanupKeys()\n {\n if (this._count == this._keys.length) {\n return;\n }\n var srcIndex = 0;\n var destIndex = 0;\n var seen = {};\n while (srcIndex < this._keys.length) {\n var key = this._keys[srcIndex];\n if (_hasKey(this._map, key)\n && !_hasKey(seen, key)\n ) {\n this._keys[destIndex++] = key;\n seen[key] = true;\n }\n srcIndex++;\n }\n this._keys.length = destIndex;\n }","function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}","remove() {\n for (var key of this.keys) {\n this.elements[key].remove();\n }\n }","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n }","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t }","remove(key) {\r\n const hash = this.calculateHash(key);\r\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\r\n delete this.values[hash][key];\r\n this.numberOfValues--;\r\n }\r\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n }","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': Map ? new Map() : [],\n\t 'string': new Hash()\n\t };\n\t}","function mapClear() {\n\t this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","function mapClear() {\n\t this.__data__ = {\n\t 'hash': new Hash,\n\t 'map': Map ? new Map : [],\n\t 'string': new Hash\n\t };\n\t}","clear() {\n this.map = {};\n if (this.store) this.store.clear();\n }","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function mapClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': Map ? new Map : [],\n 'string': new Hash\n };\n}","function clear()\r{\r\tvar end = mapping_names.length;\r\r\tfor(var i=end-1; i>=0; i--){\r\t\tremove(mapping_names[i]);\r\t}\r\twhile(mapping_names.pop());\r\twhile(mapping_sources.pop());\r\twhile(mapping_destinations.pop());\r\twhile(mapping_algorithms.pop());\r}","function filterMutateMap(map, predicate) {\n for (const [key, value] of map) {\n if (!predicate(key, value)) {\n map.delete(key);\n }\n }\n}","delete(key) {\n this.map[key] = undefined;\n if (this.store) this.store.removeItem(key);\n }","mapRemove() {\n\n\t\tthis.map.remove();\n\n\t}","garbageCollect() {\n // Q: Can we delete keys from the map while iterating over it?\n // A: The ECMA spec states that yes, keys may be deleted during forEach.\n // It is less clear for iterators.\n let deleteBefore = new Date().getTime() - MAX_GLOBAL_COOLDOWN;\n this._cooldowns.forEach((value, key) => {\n if (value < deleteBefore) {\n this._cooldowns.delete(key);\n }\n });\n }","function clearAll(){\r\n\tObject.keys(this.datastore).forEach((key)=>\r\n\t{\r\n\t\tdelete this.datastore[key];\r\n\t});\t\r\n}","async clear() {\n return await keyv.clear();\n }","clear() {\n for (const key of Object.keys(this.datastore)) {\n delete this.datastore[key];\n // this.remove(key);\n }\n }","function clearObjects() {\n setMapOnAll(null);\n}","clear() {\n const _ = this;\n _._map.clear();\n _._nameSet.clear();\n }","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function clear () {\n keys().each(function (cookie) {\n remove(cookie);\n });\n }","function clean_maps() {\n var count;\n list_maps();\n\n for (var k in maps) {\n for (var i = 0; i < maps[k].length; i++) {\n var map = maps[k][i];\n count++;\n\n // if map render job is idle and last render process is older than\n // an hour, remove map\n if (map.renderer_idle && (time() - map.renderer_stop > 3600000)) {\n console.log(k + '/' + i + ': garbage collector removes map');\n maps[k].splice(i, 1);\n i--;\n }\n }\n }\n}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}","stopAll() {\n const _ = this;\n for (const entry of _._map.values()) {\n clearTimeout(entry.handle);\n }\n _._map.clear();\n }","function mapCacheClear() {\n\t\t this.size = 0;\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n\t\t this.__data__ = {\n\t\t 'hash': new Hash,\n\t\t 'map': new (Map || ListCache),\n\t\t 'string': new Hash\n\t\t };\n\t\t}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map$1 || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash(),\n 'map': new (_Map || _ListCache)(),\n 'string': new _Hash()\n };\n }","clearance () {\n mapDoS.forEach((val, key, map) => {\n if (val.at < moment().utc().subtract(val.interval, 'seconds')) {\n map.delete(key)\n }\n })\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash.default(),\n 'map': new (_Map.default || _ListCache.default)(),\n 'string': new _Hash.default()\n };\n }","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash(),\n\t 'map': new (_Map || _ListCache)(),\n\t 'string': new _Hash()\n\t };\n\t}","function clearEntry () {\n\n nextValue = null;\n}","remove(key) {\n let index = this._hash(key);\n if (this.keyMap[index] && this.keyMap[index].length) {\n this.keyMap[index] = undefined;\n this.size--;\n return true;\n } else {\n return false;\n }\n }","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n\t this.size = 0;\n\t this.__data__ = {\n\t 'hash': new _Hash,\n\t 'map': new (_Map || _ListCache),\n\t 'string': new _Hash\n\t };\n\t}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function clearAllMarkers() {\n setMarkersOnMap(null);\n}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new _Hash,\n 'map': new (_Map || _ListCache),\n 'string': new _Hash\n };\n }","clear () {\n if (this.doc !== null) {\n transact(this.doc, transaction => {\n this.forEach(function (_value, key, map) {\n typeMapDelete(transaction, map, key)\n })\n })\n } else {\n /** @type {Map} */ (this._prelimContent).clear()\n }\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map$1 || ListCache),\n 'string': new Hash\n };\n }","function mapCacheClear() {\n\tthis.size = 0;\n\tthis.__data__ = {\n\t\thash: new _Hash(),\n\t\tmap: new ( _Map || _ListCache )(),\n\t\tstring: new _Hash(),\n\t};\n}","function mapCacheClear() {\n\t this.__data__ = {\n\t 'hash': new Hash(),\n\t 'map': new (Map || ListCache)(),\n\t 'string': new Hash()\n\t };\n\t }","function clearAllMarkers() {\n setAllMap(null);\n}","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }","function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash(),\n 'map': new (Map || ListCache)(),\n 'string': new Hash()\n };\n }"],"string":"[\n \"clear() {\\n var map = this._map;\\n var keys = Object.keys(map);\\n\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n map[key].clear();\\n }\\n }\",\n \"clear() {\\n log.map(\\\"Clearing the map of all the entries\\\");\\n this._map.clear();\\n }\",\n \"function multiMapRemove(map, key, value) {\\n const values = map.get(key);\\n if (values) {\\n array_1.removeUnordered(values, value);\\n if (values.length === 0)\\n map.delete(key);\\n }\\n}\",\n \"function _cleanupKeys()\\n {\\n if (this._count == this._keys.length) {\\n return;\\n }\\n var srcIndex = 0;\\n var destIndex = 0;\\n var seen = {};\\n while (srcIndex < this._keys.length) {\\n var key = this._keys[srcIndex];\\n if (_hasKey(this._map, key)\\n && !_hasKey(seen, key)\\n ) {\\n this._keys[destIndex++] = key;\\n seen[key] = true;\\n }\\n srcIndex++;\\n }\\n this._keys.length = destIndex;\\n }\",\n \"function clear() {\\n this.keys.forEach((key) => {\\n this._store[key] = undefined;\\n delete this._store[key];\\n });\\n}\",\n \"remove() {\\n for (var key of this.keys) {\\n this.elements[key].remove();\\n }\\n }\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear(){this.__data__={'hash':new Hash(),'map':Map?new Map():[],'string':new Hash()};}\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n }\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t }\",\n \"remove(key) {\\r\\n const hash = this.calculateHash(key);\\r\\n if(this.values.hasOwnProperty(hash) && this.values[hash].hasOwnProperty(key)) {\\r\\n delete this.values[hash][key];\\r\\n this.numberOfValues--;\\r\\n }\\r\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n }\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash(),\\n\\t 'map': Map ? new Map() : [],\\n\\t 'string': new Hash()\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = { 'hash': new Hash, 'map': Map ? new Map : [], 'string': new Hash };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"function mapClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash,\\n\\t 'map': Map ? new Map : [],\\n\\t 'string': new Hash\\n\\t };\\n\\t}\",\n \"clear() {\\n this.map = {};\\n if (this.store) this.store.clear();\\n }\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function mapClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': Map ? new Map : [],\\n 'string': new Hash\\n };\\n}\",\n \"function clear()\\r{\\r\\tvar end = mapping_names.length;\\r\\r\\tfor(var i=end-1; i>=0; i--){\\r\\t\\tremove(mapping_names[i]);\\r\\t}\\r\\twhile(mapping_names.pop());\\r\\twhile(mapping_sources.pop());\\r\\twhile(mapping_destinations.pop());\\r\\twhile(mapping_algorithms.pop());\\r}\",\n \"function filterMutateMap(map, predicate) {\\n for (const [key, value] of map) {\\n if (!predicate(key, value)) {\\n map.delete(key);\\n }\\n }\\n}\",\n \"delete(key) {\\n this.map[key] = undefined;\\n if (this.store) this.store.removeItem(key);\\n }\",\n \"mapRemove() {\\n\\n\\t\\tthis.map.remove();\\n\\n\\t}\",\n \"garbageCollect() {\\n // Q: Can we delete keys from the map while iterating over it?\\n // A: The ECMA spec states that yes, keys may be deleted during forEach.\\n // It is less clear for iterators.\\n let deleteBefore = new Date().getTime() - MAX_GLOBAL_COOLDOWN;\\n this._cooldowns.forEach((value, key) => {\\n if (value < deleteBefore) {\\n this._cooldowns.delete(key);\\n }\\n });\\n }\",\n \"function clearAll(){\\r\\n\\tObject.keys(this.datastore).forEach((key)=>\\r\\n\\t{\\r\\n\\t\\tdelete this.datastore[key];\\r\\n\\t});\\t\\r\\n}\",\n \"async clear() {\\n return await keyv.clear();\\n }\",\n \"clear() {\\n for (const key of Object.keys(this.datastore)) {\\n delete this.datastore[key];\\n // this.remove(key);\\n }\\n }\",\n \"function clearObjects() {\\n setMapOnAll(null);\\n}\",\n \"clear() {\\n const _ = this;\\n _._map.clear();\\n _._nameSet.clear();\\n }\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function clear () {\\n keys().each(function (cookie) {\\n remove(cookie);\\n });\\n }\",\n \"function clean_maps() {\\n var count;\\n list_maps();\\n\\n for (var k in maps) {\\n for (var i = 0; i < maps[k].length; i++) {\\n var map = maps[k][i];\\n count++;\\n\\n // if map render job is idle and last render process is older than\\n // an hour, remove map\\n if (map.renderer_idle && (time() - map.renderer_stop > 3600000)) {\\n console.log(k + '/' + i + ': garbage collector removes map');\\n maps[k].splice(i, 1);\\n i--;\\n }\\n }\\n }\\n}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"function mapCacheClear(){this.size=0;this.__data__={'hash':new Hash(),'map':new(Map||ListCache)(),'string':new Hash()};}\",\n \"stopAll() {\\n const _ = this;\\n for (const entry of _._map.values()) {\\n clearTimeout(entry.handle);\\n }\\n _._map.clear();\\n }\",\n \"function mapCacheClear() {\\n\\t\\t this.size = 0;\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n\\t\\t this.__data__ = {\\n\\t\\t 'hash': new Hash,\\n\\t\\t 'map': new (Map || ListCache),\\n\\t\\t 'string': new Hash\\n\\t\\t };\\n\\t\\t}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map$1 || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map$1 || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash(),\\n 'map': new (_Map || _ListCache)(),\\n 'string': new _Hash()\\n };\\n }\",\n \"clearance () {\\n mapDoS.forEach((val, key, map) => {\\n if (val.at < moment().utc().subtract(val.interval, 'seconds')) {\\n map.delete(key)\\n }\\n })\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash.default(),\\n 'map': new (_Map.default || _ListCache.default)(),\\n 'string': new _Hash.default()\\n };\\n }\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash(),\\n\\t 'map': new (_Map || _ListCache)(),\\n\\t 'string': new _Hash()\\n\\t };\\n\\t}\",\n \"function clearEntry () {\\n\\n nextValue = null;\\n}\",\n \"remove(key) {\\n let index = this._hash(key);\\n if (this.keyMap[index] && this.keyMap[index].length) {\\n this.keyMap[index] = undefined;\\n this.size--;\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n\\t this.size = 0;\\n\\t this.__data__ = {\\n\\t 'hash': new _Hash,\\n\\t 'map': new (_Map || _ListCache),\\n\\t 'string': new _Hash\\n\\t };\\n\\t}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function clearAllMarkers() {\\n setMarkersOnMap(null);\\n}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new _Hash,\\n 'map': new (_Map || _ListCache),\\n 'string': new _Hash\\n };\\n }\",\n \"clear () {\\n if (this.doc !== null) {\\n transact(this.doc, transaction => {\\n this.forEach(function (_value, key, map) {\\n typeMapDelete(transaction, map, key)\\n })\\n })\\n } else {\\n /** @type {Map} */ (this._prelimContent).clear()\\n }\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash,\\n 'map': new (Map$1 || ListCache),\\n 'string': new Hash\\n };\\n }\",\n \"function mapCacheClear() {\\n\\tthis.size = 0;\\n\\tthis.__data__ = {\\n\\t\\thash: new _Hash(),\\n\\t\\tmap: new ( _Map || _ListCache )(),\\n\\t\\tstring: new _Hash(),\\n\\t};\\n}\",\n \"function mapCacheClear() {\\n\\t this.__data__ = {\\n\\t 'hash': new Hash(),\\n\\t 'map': new (Map || ListCache)(),\\n\\t 'string': new Hash()\\n\\t };\\n\\t }\",\n \"function clearAllMarkers() {\\n setAllMap(null);\\n}\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\",\n \"function mapCacheClear() {\\n this.size = 0;\\n this.__data__ = {\\n 'hash': new Hash(),\\n 'map': new (Map || ListCache)(),\\n 'string': new Hash()\\n };\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.7589402","0.70686156","0.673569","0.6651485","0.6528891","0.6266802","0.6257602","0.6257602","0.6257602","0.6170819","0.6170819","0.6170819","0.616584","0.6152476","0.6147431","0.6147431","0.6147431","0.6147431","0.6147431","0.6147431","0.6147431","0.6147431","0.6147431","0.61281383","0.61072534","0.6101482","0.6101482","0.6101482","0.6101482","0.6101482","0.6101482","0.60470563","0.60258466","0.60258466","0.60258466","0.60258466","0.60258466","0.60258466","0.60258466","0.6024839","0.60080713","0.60036314","0.598349","0.59391546","0.59210443","0.59042466","0.5902615","0.5861328","0.58580554","0.5847384","0.5847384","0.5847384","0.5847384","0.58460045","0.5840549","0.57226163","0.57226163","0.57226163","0.57226163","0.57226163","0.57226163","0.57226163","0.57226163","0.57226163","0.57224345","0.5718643","0.57083184","0.57083184","0.5703612","0.5698988","0.5698988","0.56893474","0.5685078","0.56835866","0.5682128","0.56813186","0.5681309","0.5673353","0.5673353","0.5673353","0.5673353","0.56731236","0.56731236","0.5671988","0.5671988","0.5671988","0.56603295","0.5658843","0.5658843","0.56549543","0.56549543","0.56549543","0.56538534","0.5646069","0.5643372","0.5634007","0.562995","0.5629937","0.5629937","0.5629937"],"string":"[\n \"0.7589402\",\n \"0.70686156\",\n \"0.673569\",\n \"0.6651485\",\n \"0.6528891\",\n \"0.6266802\",\n \"0.6257602\",\n \"0.6257602\",\n \"0.6257602\",\n \"0.6170819\",\n \"0.6170819\",\n \"0.6170819\",\n \"0.616584\",\n \"0.6152476\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.6147431\",\n \"0.61281383\",\n \"0.61072534\",\n \"0.6101482\",\n \"0.6101482\",\n \"0.6101482\",\n \"0.6101482\",\n \"0.6101482\",\n \"0.6101482\",\n \"0.60470563\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.60258466\",\n \"0.6024839\",\n \"0.60080713\",\n \"0.60036314\",\n \"0.598349\",\n \"0.59391546\",\n \"0.59210443\",\n \"0.59042466\",\n \"0.5902615\",\n \"0.5861328\",\n \"0.58580554\",\n \"0.5847384\",\n \"0.5847384\",\n \"0.5847384\",\n \"0.5847384\",\n \"0.58460045\",\n \"0.5840549\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57226163\",\n \"0.57224345\",\n \"0.5718643\",\n \"0.57083184\",\n \"0.57083184\",\n \"0.5703612\",\n \"0.5698988\",\n \"0.5698988\",\n \"0.56893474\",\n \"0.5685078\",\n \"0.56835866\",\n \"0.5682128\",\n \"0.56813186\",\n \"0.5681309\",\n \"0.5673353\",\n \"0.5673353\",\n \"0.5673353\",\n \"0.5673353\",\n \"0.56731236\",\n \"0.56731236\",\n \"0.5671988\",\n \"0.5671988\",\n \"0.5671988\",\n \"0.56603295\",\n \"0.5658843\",\n \"0.5658843\",\n \"0.56549543\",\n \"0.56549543\",\n \"0.56549543\",\n \"0.56538534\",\n \"0.5646069\",\n \"0.5643372\",\n \"0.5634007\",\n \"0.562995\",\n \"0.5629937\",\n \"0.5629937\",\n \"0.5629937\"\n]"},"document_score":{"kind":"string","value":"0.5825702"},"document_rank":{"kind":"string","value":"55"}}},{"rowIdx":82040,"cells":{"query":{"kind":"string","value":"Deeply get a value from an object via its path."},"document":{"kind":"string","value":"function getIn(obj,key,def,p){if(p===void 0){p=0;}var path=toPath(key);while(obj&&p 0 && obj != null) {\n keyPath = keys.shift();\n obj = obj[keyPath];\n }\n\n return obj;\n}","function getPathValue (obj, path) {\n if (!isObject(obj)) { return null }\n\n var paths = parsePath(path);\n if (empty(paths)) {\n return null\n } else {\n var length = paths.length;\n var ret = null;\n var last = obj;\n var i = 0;\n while (i < length) {\n var value = last[paths[i]];\n if (value === undefined) {\n last = null;\n break\n }\n last = value;\n i++;\n }\n\n ret = last;\n return ret\n }\n}","function getValueByPath(obj, path) {\n const value = path.split('.').reduce((o, i) => o[i], obj)\n return value\n}","function getValueByPath(o, path) {\n for (var i = 0, len = path.length;\n o !== undefined && i < len;\n i++) {\n o = o[path[i]];\n }\n return o;\n }","function getValueByPath(obj, path) {\r\n const value = path.split('.').reduce((o, i) => o[i], obj)\r\n return value\r\n}","function getValueByPath(obj, path) {\n return path.split('.').reduce(function (o, i) {\n return o ? o[i] : null;\n }, obj);\n}","function getValueByPath(obj, path) {\n return path.split('.').reduce(function (o, i) {\n return o ? o[i] : null;\n }, obj);\n }","function getIn(obj, path) {\n var val = obj;\n for (var _i = 0, path_1 = path; _i < path_1.length; _i++) {\n var elem = path_1[_i];\n if (val[elem]) {\n val = val[elem];\n }\n else {\n return null;\n }\n }\n return val;\n}","function getValueByPath(obj, path) {\n var value = path.split('.').reduce(function (o, i) {\n return o[i];\n }, obj);\n return value;\n }","function get(obj, path) {\n\n\tvar keys = path.split(\".\");\n\n\tkeys.forEach(function(key) {\n\t\tobj = obj[key];\n\t});\n\n\treturn obj;\n}","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function get(object, path, defaultValue) {\n var value = deepGet(object, toPath$1(path));\n return isUndefined(value) ? defaultValue : value;\n }","function getIn(obj, path, unset) {\n const val = obj[path[0]];\n if (typeof val === 'undefined') return unset;\n return path.length <= 1 ? val : val.getIn(path.slice(1), unset);\n}","function _get(obj,path){\n\t \n\t //Split the path into it's seperate components\n\t\tvar _path = path.split(\".\");\n\t\t\n\t\t//Set the object we use to query for this name to be the original object\n\t\tvar subObj = obj;\n\t \n\t\t//Parse the object properties\n\t\tvar c_len = _path.length;\n\t\tfor (var i=0;i 0 ) {\n\t\t\t \n\t\t\t //Get the sub object using the path\n\t\t\t\tsubObj = subObj[_path[i]];\n\t\t\t\t\n\t\t\t\t//Break if we don't have this sub object\n\t\t\t\tif(subObj === null || subObj === undefined) break;\n\t\t\t}\n\t\t}\n\t\t\n\t\t//Return an empty string if we don't have a value\n\t\tif(subObj === null || subObj === undefined) return(\"\");\n\t\t\n\t\treturn(subObj);\n\t}","function getPropFromPath(obj, path) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') { objRef = objRef[keys[i]]; }\n }\n\n return (typeof objRef === 'object') ? objRef[targetKey] : undefined;\n }","function getPropFromPath(obj, path) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') { objRef = objRef[keys[i]]; }\n }\n\n return (typeof objRef === 'object') ? objRef[targetKey] : undefined;\n }","function get(obj, path) {\n var props = [];\n\n if (util.isArray(path)) {\n props = path;\n } else {\n props = path.split('.');\n }\n\n while(props.length && obj) {\n var prop = props.shift()\n , match = /(.+)\\[([0-9]*)\\]/.exec(prop);\n\n if (match && match.length === 3) {\n var name = match[1]\n , index = match[2];\n\n if (typeof obj[name] !== 'undefined') {\n obj = obj[name][index];\n } else {\n obj = null;\n }\n } else {\n obj = obj[prop];\n }\n }\n\n return obj || null;\n}","function pull(obj, path, opt_noErrorDefault) {\r\n path = typeOf(path, 'String') ? path.split('.') : path;\r\n for (var doError = arguments.length < 3, i = 0, l = path.length; i < l; i++) {\r\n if (obj != undefined && path[i] in Object(obj)) {\r\n obj = obj[path[i]];\r\n }\r\n else if (doError) {\r\n throw new Error('There is no value at \"' + slice(path, 0, i + 1).join('.') + '\".');\r\n }\r\n else {\r\n return opt_noErrorDefault;\r\n }\r\n }\r\n return obj;\r\n }","function deepFind(obj, path) {\n if (path.indexOf('.')) {\n for (var i = 0, path = path.split('.'), len = path.length; i < len; i++) {\n obj = obj[path[i]];\n }\n } else {\n obj[path];\n }\n return obj;\n }","get(path) {\n if (path) {\n return findValue(this.data, path)\n }\n return this.toObject();\n }","function _get(obj, keypath) {\n var parts = _keyPathNormalize(keypath).split('.')\n var dest = obj\n parts.forEach(function(key) {\n if (isNon(dest)) return !(dest = undf())\n dest = dest[key]\n })\n return dest\n}","function deepGet(target, path) {\n return path.length ? lodashGet(target, path) : target;\n}","function getIn(obj, path) {\n let pointer = obj;\n for (let el of path) {\n pointer = pointer\n ? pointer[el]\n : undefined;\n }\n\n return pointer;\n}","function _getter(obj, path) {\n var keys = path.split('.');\n var length = keys.length;\n var target = obj;\n\n for (var i = 0; i < length - 1; i++) {\n target[keys[i]] = _isObject(target[keys[i]]) ? target[keys[i]] : {};\n target = target[keys[i]];\n }\n\n return {\n target: target,\n lastKey: keys[length - 1]\n };\n }","traverse(obj, path) {\n if (path == null) return undefined;\n let pelems = path.split('.');\n let res = obj;\n pelems.forEach(function (item) {\n res = item === 'this' ? obj : res[item];\n });\n return res;\n }","function getPropertyPathValue(obj, propertyPath) {\n var properties = Array.isArray(propertyPath) ? propertyPath : propertyPath.split(\".\");\n if (properties.length === 1) {\n return obj.getProperty(propertyPath);\n } else {\n var nextValue = obj;\n // hack use of some to perform mapFirst operation.\n properties.some(function (prop) {\n nextValue = nextValue.getProperty(prop);\n return nextValue == null;\n });\n return nextValue;\n }\n}","function get (object, path) {\n let iterator = object\n for (const part of path) {\n iterator = iterator[part]\n }\n return iterator\n}","function get(obj, path, defaultValue) {\n return path\n .split('.')\n .reduce(function (a, c) { return (a && a[c] ? a[c] : defaultValue || null); }, obj);\n}","function getDescendantProperty(obj, path) {\n return path.split('.').reduce((acc, part) => acc && acc[part], obj);\n}","function resolveObjectFromPath(object, path) {\n path = path.replace(/\\[(\\w+)\\]/g, '.$1'); // convert indexes to properties\n path = path.replace(/^\\./, ''); // strip a leading dot\n var a = path.split('.');\n while (a.length) {\n var n = a.shift();\n if (n in object) {\n object = object[n];\n } else {\n return;\n }\n }\n return object;\n }","function getProperty(path, obj) {\n return [obj].concat(path.split('.')).reduce(function(prev, curr) {\n return prev && prev[curr];\n });\n}","getValueInPath(json, path) {\n const pathElements = this.pathUtilService.toPathArray(path);\n let value = json;\n pathElements.forEach(pathElement => {\n value = value[pathElement];\n if (!value) {\n throw new Error(`\"${pathElement}\" of given path not defined in given json`);\n }\n });\n return value;\n }","function getProperty(object, property_path, default_value) {\n\tif (isDefined(object)) {\n\t\tif (isDefined(object[property_path])) {\n\t\t\treturn object[property_path];\n\t\t}\n\t\tvar path_parts = property_path.split('.'); // path as nested properties\n\t\tfor (var i = 0; i < path_parts.length && isDefined(object); i++) {\n\t\t\tobject = object[path_parts[i]];\n\t\t}\n\t}\n\treturn isDefined(object) ? object : default_value;\n}","function dotTraverseObject(object, path)\n{\n var chunks = path.split(/\\./);\n var cur = object;\n for (var i = 0; chunks.length > i; i++)\n {\n if (cur == null) throw new Error(\"Complete object path does not exist\");\n cur = cur[chunks[i]];\n }\n return cur;\n}","function _cpBaseGet(object, castedPath) {\n /* here we have removed casted path line from Lodash\n path = isKey(path, object) ? [path] : castPath(path);\n */\n var index = 0,\n length = castedPath.length;\n\n while (object != null && index < length) {\n object = object[TOKEY(castedPath[index++])];\n }\n return (index && index == length) ? object : undefined;\n}","function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","function get(opt, path) {\n path = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < path.length; i++) {\n obj = obj && obj[path[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","static _resolvePath(path, object) {\n if (typeof path !== 'string') throw Error(\"Requires a string, got an \" + typeof path + \" that \" + Array.isArray(path) ? \"is\" : \"isn't\" + \" an array\");\n\n object = object || ApplicationState._state;\n const nodes = ApplicationState.walk(path);\n\n for (let index = 0; index < nodes.length; index++) {\n const node = nodes[index];\n object = object[node.name];\n if (typeof object === 'undefined') return undefined;\n if (object === null) return null;\n }\n\n return object;\n }","function get(opt, path) {\n var pathArr = path.split(',');\n var obj = opt;\n\n for (var i = 0; i < pathArr.length; i++) {\n obj = obj && obj[pathArr[i]];\n\n if (obj == null) {\n break;\n }\n }\n\n return obj;\n}","function getProperty(object, propertyPath, defaultValue) {\n if (isDefined(object)) {\n if (isDefined(object[propertyPath])) {\n return object[propertyPath];\n }\n var pathParts = propertyPath.split('.'); // path as nested properties\n for (var i = 0; i < pathParts.length && isDefined(object); i++) {\n object = object[pathParts[i]];\n }\n }\n return isDefined(object) ? object : defaultValue;\n}","function evalPath(obj, path) {\n return path.split('.').reduce(function(o, i) { return o[i];}, obj);\n}","function getValueFrom(object, key) {\n var keys = key.split('.');\n var value = object;\n for (var i = 0; i < keys.length; i++) {\n var v = value[keys[i]];\n if (v !== undefined) {\n value = v;\n } else {\n return undefined;\n }\n }\n return value;\n}","_resolveObjectPath(path, obj) {\n return path.split(\".\").reduce(function(prev, curr) {\n return prev ? prev[curr] : null;\n }, obj || self);\n }","function getField(obj, path) {\n if (obj[path] === undefined) {\n // We assign it to an empty object\n // so that the key is actually created\n obj[path] = {};\n return undefined;\n }\n var value = obj[path].value;\n if (value === true) {\n return \"true\";\n }\n return obj[path].value;\n}","getPath(object, path) {\n if (object == null) return object\n const steps = spellCore.splitPath(path)\n if (!steps) return undefined\n let target = object\n for (let i = 0; i < steps.length; i++) {\n let key = steps[i]\n if (target == null) return undefined\n if (typeof key === \"number\" && typeof target.getItem === \"function\") target = target.getItem(key)\n else target = target[key]\n }\n return target\n }","static accessValue(object, key) {\n const keys = key.split('.');\n let value = object;\n for (let i = 0, max = keys.length; i < max; i++) {\n value = value[keys[i]];\n }\n return value;\n }","function get(target, field) {\n var pathArray = splitNested(field);\n var result = void 0;\n try {\n result = pathArray.reduce(function (curr, path) {\n return curr[path];\n }, target);\n } catch (e) {}\n return result;\n}","function pathToReference(obj, path) {\n return reduce(function (reference, segment) {\n\tif (reference) {\n\t if (typeof segment === \"object\" && segment.hasOwnProperty(\"id\")) \n\t\treturn idToReferenceAndIndex(reference, segment.id).obj;\n\t else\n\t\treturn reference[segment];\n\t}\n\telse\n\t return reference;\n }, \n path, obj);\n}","function setPropFromPath(obj, path, value) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') {\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\n\n objRef = objRef[keys[i]];\n }\n }\n\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\n }","function setPropFromPath(obj, path, value) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') {\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\n\n objRef = objRef[keys[i]];\n }\n }\n\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\n }","function deepGet(object, [head, ...tail], fallback = null) {\n const val = object[head]\n if (val === undefined || val === null) { return fallback }\n if (tail.length === 0) { return val }\n return deepGet(val, tail, fallback)\n}","get(path){\n if (typeof path === 'string') {\n let array = path.split('.');\n return this.get(array);\n }\n let data = this.data;\n let len = path ? path.length : 0;\n let i;\n for (i = 0; data && i < len; i++) {\n let segment = path[i];\n data = data[segment];\n }\n return i === len ? data : null;\n }","function getJsonValue(path, obj) {\n function cleanObjPart(s) {\n // Handle the case when processing an array element (e.g. \"jobs[0]\")\n var re = /(\\w+)\\s*\\[\\s*(\\d+)\\s*\\]\\s*/;\n var match = re.exec(s);\n var objPart;\n if (match != null) {\n var elem1 = match[1];\n var index = parseInt(match[2], 10);\n objPart = obj[elem1][index];\n }\n else {\n objPart = obj[s];\n }\n return objPart;\n }\n\n var NOT_FOUND = \"notFound\";\n var parts = path.split(/(?!\\B\"[^\"]*)\\.(?![^\"]*\"\\B)/);\n var part;\n var last = removeDoubleQuotes(parts.pop());\n while ((part = parts.shift())) {\n part = removeDoubleQuotes(part);\n var objPart = cleanObjPart(part);\n if (typeof objPart != \"object\") return NOT_FOUND;\n obj = objPart;\n }\n\n var r = cleanObjPart(last);\n return r === undefined ? NOT_FOUND : r;\n}","function setDeepValue(obj, path, value) {\n if (typeof path === 'string') {\n path = path.split('.');\n }\n if (path.length > 1) {\n const e = path.shift();\n setDeepValue(obj[e] = Object.prototype.toString.call(obj[e]) === '[object Object]' ? obj[e] : {}, path, value);\n }\n else {\n obj[path[0]] = value;\n }\n}","function getPropertySafe(obj, path, defValue) {\n var hasOwnProp = Object.prototype.hasOwnProperty;\n\n var keys = Array.isArray(path) ? path : path.split('.');\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n if (!obj || !hasOwnProp.call(obj, key)) {\n obj = undefined;\n break;\n }\n obj = obj[key];\n }\n\n if(arguments.length > 2 && obj === undefined)\n return defValue;\n\n return obj;\n}","function getPath(obj, ks) {\n if (typeof ks == \"string\") ks = ks.split(\".\");\n\n // If we have reached an undefined property\n // then stop executing and return undefined\n if (obj === undefined) return void 0;\n\n // If the path array has no more elements, we've reached\n // the intended property and return its value\n if (ks.length === 0) return obj;\n\n // If we still have elements in the path array and the current\n // value is null, stop executing and return undefined\n if (obj === null) return void 0;\n\n return getPath(obj[_.first(ks)], _.rest(ks));\n }","function get(obj, props) {\n if (typeof props === 'string') {\n props = props.split('.');\n } else if (!(props instanceof Array)) {\n throw new TypeError('Invalid type for key: ' + (typeof props));\n }\n var i;\n for (i = 0; i < props.length; i += 1) {\n if ((obj === undefined) ||\n (typeof obj !== 'object') ||\n (obj === null)) {\n throw new Error('Invalid object path: ' + props.join('.') + ' at ' + i);\n }\n obj = obj[props[i]];\n }\n if (obj === undefined) {\n throw new Error('No value found on object path: ' + props.join('.'));\n } else {\n return obj;\n }\n }","function getIn(object, pathArray) {\n return R.path(pathArray, object);\n}","resolveProp(obj, path) {\n return path.split('.').reduce((prev, curr) => {\n return prev ? prev[curr] : null;\n }, obj);\n }","function setIn(obj, path, value) {\n var res = clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function cpGet(object, castedPath, defaultValue) {\n var result = object == null ? undefined : _cpBaseGet(object, castedPath);\n return result === undefined ? defaultValue : result;\n}","function getProperty(path) {\n if (is(path, 'string')) {\n return path;\n }\n if (is(path, 'array') && path.length > 0) {\n return path[0];\n }\n return undefined;\n }","function setIn(obj, path, value) {\n var res = lodash_es_clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = lodash_es_toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (formik_esm_isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = lodash_es_clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function getPathValue(path, ctx) {\n\t\t'use strict';\n\n\t\tif (path.length === 1 && path[0].length !== 0) {\n\t\t\treturn ctx.get(path[0]);\n\t\t}\n\t\t// anchor = false;\n\t\tif (path[0].length === 0) {\n\t\t\treturn ctx.getPath(true, path.slice(1));\n\t\t}\n\t\treturn ctx.getPath(false, path);\n\t}","static _assignValue(path, value, object) {\n object = object || ApplicationState._state;\n\n const nodes = ApplicationState.walk(path);\n\n for (let index = 0; index < nodes.length; index++) {\n const node = nodes[index];\n switch (node.type) {\n case 'object':\n if (typeof object[node.name] === 'undefined') {\n object[node.name] = {};\n }\n object = object[node.name];\n break;\n case 'array':\n if (typeof object[node.name] === 'undefined') {\n object[node.name] = [];\n }\n object = object[node.name];\n break;\n case 'leaf':\n return object[node.name] = value;\n break;\n }\n }\n\n throw Error(\"We should have returned after setting the value.\");\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function result(obj, path, fallback) {\n path = toPath$1(path);\n var length = path.length;\n if (!length) {\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\n }\n for (var i = 0; i < length; i++) {\n var prop = obj == null ? void 0 : obj[path[i]];\n if (prop === void 0) {\n prop = fallback;\n i = length; // Ensure we don't continue iterating.\n }\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\n }\n return obj;\n }","function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, slice(path, 0, -1));\n}","function accessor (path) {\n path = path.split(\".\");\n return function (obj) {\n for (var i = 0; i < path.length; i++)\n obj = obj[path[i]];\n return obj;\n }\n }","function getPathObject(ob, path, ltOb, fn) {\n // Iterate through path to late paths: @a.b.c paths\n // Return \"\" (or noop if leaf is a function @a.b.c(...) ) if intermediate object not yet available\n var prevOb,\n tokens,\n l,\n i = 0;\n\n if (ltOb === 1) {\n fn = 1;\n ltOb = undefined;\n } // Paths like ^a^b^c or ~^a^b^c will not throw if an object in path is undefined.\n\n\n if (path) {\n tokens = path.split(\".\");\n l = tokens.length;\n\n for (; ob && i < l; i++) {\n prevOb = ob;\n ob = tokens[i] ? ob[tokens[i]] : ob;\n }\n }\n\n if (ltOb) {\n ltOb.lt = ltOb.lt || i < l; // If i < l there was an object in the path not yet available\n }\n\n return ob === undefined ? fn ? noop : \"\" : fn ? function () {\n return ob.apply(prevOb, arguments);\n } : ob;\n }","get(path) {\n return _find(this, path, '.');\n }"],"string":"[\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function getDeepVal(obj, path) {\\n if (typeof obj === \\\"undefined\\\" || obj === null) return;\\n path = path.split(/[\\\\.\\\\[\\\\]\\\\\\\"\\\\']{1,2}/);\\n for (var i = 0, l = path.length; i < l; i++) {\\n if (path[i] === \\\"\\\") continue;\\n obj = obj[path[i]];\\n if (typeof obj === \\\"undefined\\\" || obj === null) return;\\n }\\n return obj;\\n }\",\n \"function nestedGet(object, path) {\\n if (Immutable.isImmutable(object)) {\\n return Immutable.getIn(object, path);\\n }\\n let index = 0;\\n const length = path.length;\\n let o = object;\\n\\n while (o != null && index < length) {\\n // eslint-disable-next-line no-plusplus\\n o = o[path[index++]];\\n }\\n return (index && index === length) ? o : undefined;\\n}\",\n \"function safeGet(object, path) {\\n\\tvar value = null;\\n\\n\\tif(object) {\\n\\t\\tvar pieces = path.split(\\\".\\\"), node = object;\\n\\n\\t\\tfor(var p = 0; p < pieces.length-1; ++p) {\\n\\t\\t\\tnode = node[pieces[p]];\\n\\n\\t\\t\\tif(!node) { return value; }\\n\\t\\t}\\n\\n\\t\\tvalue = node[pieces.wrap(-1)];\\n\\t}\\n\\t\\n\\treturn value;\\n}\",\n \"function getObjectValue(obj, path) {\\r\\n path = path.split(\\\".\\\");\\r\\n let curr = obj;\\r\\n\\r\\n for (let i = 0; i < path.length; i++) {\\r\\n const activeObj = curr[path[i]];\\r\\n curr = activeObj;\\r\\n }\\r\\n \\r\\n if(curr === undefined){\\r\\n return null;\\r\\n }\\r\\n \\r\\n return curr;\\r\\n}\",\n \"function getValue(obj, keyPath) {\\n let keys = keyPath.split(\\\".\\\");\\n\\n while (keys.length > 0 && obj != null) {\\n keyPath = keys.shift();\\n obj = obj[keyPath];\\n }\\n\\n return obj;\\n}\",\n \"function getPathValue (obj, path) {\\n if (!isObject(obj)) { return null }\\n\\n var paths = parsePath(path);\\n if (empty(paths)) {\\n return null\\n } else {\\n var length = paths.length;\\n var ret = null;\\n var last = obj;\\n var i = 0;\\n while (i < length) {\\n var value = last[paths[i]];\\n if (value === undefined) {\\n last = null;\\n break\\n }\\n last = value;\\n i++;\\n }\\n\\n ret = last;\\n return ret\\n }\\n}\",\n \"function getValueByPath(obj, path) {\\n const value = path.split('.').reduce((o, i) => o[i], obj)\\n return value\\n}\",\n \"function getValueByPath(o, path) {\\n for (var i = 0, len = path.length;\\n o !== undefined && i < len;\\n i++) {\\n o = o[path[i]];\\n }\\n return o;\\n }\",\n \"function getValueByPath(obj, path) {\\r\\n const value = path.split('.').reduce((o, i) => o[i], obj)\\r\\n return value\\r\\n}\",\n \"function getValueByPath(obj, path) {\\n return path.split('.').reduce(function (o, i) {\\n return o ? o[i] : null;\\n }, obj);\\n}\",\n \"function getValueByPath(obj, path) {\\n return path.split('.').reduce(function (o, i) {\\n return o ? o[i] : null;\\n }, obj);\\n }\",\n \"function getIn(obj, path) {\\n var val = obj;\\n for (var _i = 0, path_1 = path; _i < path_1.length; _i++) {\\n var elem = path_1[_i];\\n if (val[elem]) {\\n val = val[elem];\\n }\\n else {\\n return null;\\n }\\n }\\n return val;\\n}\",\n \"function getValueByPath(obj, path) {\\n var value = path.split('.').reduce(function (o, i) {\\n return o[i];\\n }, obj);\\n return value;\\n }\",\n \"function get(obj, path) {\\n\\n\\tvar keys = path.split(\\\".\\\");\\n\\n\\tkeys.forEach(function(key) {\\n\\t\\tobj = obj[key];\\n\\t});\\n\\n\\treturn obj;\\n}\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function get(object, path, defaultValue) {\\n var value = deepGet(object, toPath$1(path));\\n return isUndefined(value) ? defaultValue : value;\\n }\",\n \"function getIn(obj, path, unset) {\\n const val = obj[path[0]];\\n if (typeof val === 'undefined') return unset;\\n return path.length <= 1 ? val : val.getIn(path.slice(1), unset);\\n}\",\n \"function _get(obj,path){\\n\\t \\n\\t //Split the path into it's seperate components\\n\\t\\tvar _path = path.split(\\\".\\\");\\n\\t\\t\\n\\t\\t//Set the object we use to query for this name to be the original object\\n\\t\\tvar subObj = obj;\\n\\t \\n\\t\\t//Parse the object properties\\n\\t\\tvar c_len = _path.length;\\n\\t\\tfor (var i=0;i 0 ) {\\n\\t\\t\\t \\n\\t\\t\\t //Get the sub object using the path\\n\\t\\t\\t\\tsubObj = subObj[_path[i]];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//Break if we don't have this sub object\\n\\t\\t\\t\\tif(subObj === null || subObj === undefined) break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Return an empty string if we don't have a value\\n\\t\\tif(subObj === null || subObj === undefined) return(\\\"\\\");\\n\\t\\t\\n\\t\\treturn(subObj);\\n\\t}\",\n \"function getPropFromPath(obj, path) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') { objRef = objRef[keys[i]]; }\\n }\\n\\n return (typeof objRef === 'object') ? objRef[targetKey] : undefined;\\n }\",\n \"function getPropFromPath(obj, path) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') { objRef = objRef[keys[i]]; }\\n }\\n\\n return (typeof objRef === 'object') ? objRef[targetKey] : undefined;\\n }\",\n \"function get(obj, path) {\\n var props = [];\\n\\n if (util.isArray(path)) {\\n props = path;\\n } else {\\n props = path.split('.');\\n }\\n\\n while(props.length && obj) {\\n var prop = props.shift()\\n , match = /(.+)\\\\[([0-9]*)\\\\]/.exec(prop);\\n\\n if (match && match.length === 3) {\\n var name = match[1]\\n , index = match[2];\\n\\n if (typeof obj[name] !== 'undefined') {\\n obj = obj[name][index];\\n } else {\\n obj = null;\\n }\\n } else {\\n obj = obj[prop];\\n }\\n }\\n\\n return obj || null;\\n}\",\n \"function pull(obj, path, opt_noErrorDefault) {\\r\\n path = typeOf(path, 'String') ? path.split('.') : path;\\r\\n for (var doError = arguments.length < 3, i = 0, l = path.length; i < l; i++) {\\r\\n if (obj != undefined && path[i] in Object(obj)) {\\r\\n obj = obj[path[i]];\\r\\n }\\r\\n else if (doError) {\\r\\n throw new Error('There is no value at \\\"' + slice(path, 0, i + 1).join('.') + '\\\".');\\r\\n }\\r\\n else {\\r\\n return opt_noErrorDefault;\\r\\n }\\r\\n }\\r\\n return obj;\\r\\n }\",\n \"function deepFind(obj, path) {\\n if (path.indexOf('.')) {\\n for (var i = 0, path = path.split('.'), len = path.length; i < len; i++) {\\n obj = obj[path[i]];\\n }\\n } else {\\n obj[path];\\n }\\n return obj;\\n }\",\n \"get(path) {\\n if (path) {\\n return findValue(this.data, path)\\n }\\n return this.toObject();\\n }\",\n \"function _get(obj, keypath) {\\n var parts = _keyPathNormalize(keypath).split('.')\\n var dest = obj\\n parts.forEach(function(key) {\\n if (isNon(dest)) return !(dest = undf())\\n dest = dest[key]\\n })\\n return dest\\n}\",\n \"function deepGet(target, path) {\\n return path.length ? lodashGet(target, path) : target;\\n}\",\n \"function getIn(obj, path) {\\n let pointer = obj;\\n for (let el of path) {\\n pointer = pointer\\n ? pointer[el]\\n : undefined;\\n }\\n\\n return pointer;\\n}\",\n \"function _getter(obj, path) {\\n var keys = path.split('.');\\n var length = keys.length;\\n var target = obj;\\n\\n for (var i = 0; i < length - 1; i++) {\\n target[keys[i]] = _isObject(target[keys[i]]) ? target[keys[i]] : {};\\n target = target[keys[i]];\\n }\\n\\n return {\\n target: target,\\n lastKey: keys[length - 1]\\n };\\n }\",\n \"traverse(obj, path) {\\n if (path == null) return undefined;\\n let pelems = path.split('.');\\n let res = obj;\\n pelems.forEach(function (item) {\\n res = item === 'this' ? obj : res[item];\\n });\\n return res;\\n }\",\n \"function getPropertyPathValue(obj, propertyPath) {\\n var properties = Array.isArray(propertyPath) ? propertyPath : propertyPath.split(\\\".\\\");\\n if (properties.length === 1) {\\n return obj.getProperty(propertyPath);\\n } else {\\n var nextValue = obj;\\n // hack use of some to perform mapFirst operation.\\n properties.some(function (prop) {\\n nextValue = nextValue.getProperty(prop);\\n return nextValue == null;\\n });\\n return nextValue;\\n }\\n}\",\n \"function get (object, path) {\\n let iterator = object\\n for (const part of path) {\\n iterator = iterator[part]\\n }\\n return iterator\\n}\",\n \"function get(obj, path, defaultValue) {\\n return path\\n .split('.')\\n .reduce(function (a, c) { return (a && a[c] ? a[c] : defaultValue || null); }, obj);\\n}\",\n \"function getDescendantProperty(obj, path) {\\n return path.split('.').reduce((acc, part) => acc && acc[part], obj);\\n}\",\n \"function resolveObjectFromPath(object, path) {\\n path = path.replace(/\\\\[(\\\\w+)\\\\]/g, '.$1'); // convert indexes to properties\\n path = path.replace(/^\\\\./, ''); // strip a leading dot\\n var a = path.split('.');\\n while (a.length) {\\n var n = a.shift();\\n if (n in object) {\\n object = object[n];\\n } else {\\n return;\\n }\\n }\\n return object;\\n }\",\n \"function getProperty(path, obj) {\\n return [obj].concat(path.split('.')).reduce(function(prev, curr) {\\n return prev && prev[curr];\\n });\\n}\",\n \"getValueInPath(json, path) {\\n const pathElements = this.pathUtilService.toPathArray(path);\\n let value = json;\\n pathElements.forEach(pathElement => {\\n value = value[pathElement];\\n if (!value) {\\n throw new Error(`\\\"${pathElement}\\\" of given path not defined in given json`);\\n }\\n });\\n return value;\\n }\",\n \"function getProperty(object, property_path, default_value) {\\n\\tif (isDefined(object)) {\\n\\t\\tif (isDefined(object[property_path])) {\\n\\t\\t\\treturn object[property_path];\\n\\t\\t}\\n\\t\\tvar path_parts = property_path.split('.'); // path as nested properties\\n\\t\\tfor (var i = 0; i < path_parts.length && isDefined(object); i++) {\\n\\t\\t\\tobject = object[path_parts[i]];\\n\\t\\t}\\n\\t}\\n\\treturn isDefined(object) ? object : default_value;\\n}\",\n \"function dotTraverseObject(object, path)\\n{\\n var chunks = path.split(/\\\\./);\\n var cur = object;\\n for (var i = 0; chunks.length > i; i++)\\n {\\n if (cur == null) throw new Error(\\\"Complete object path does not exist\\\");\\n cur = cur[chunks[i]];\\n }\\n return cur;\\n}\",\n \"function _cpBaseGet(object, castedPath) {\\n /* here we have removed casted path line from Lodash\\n path = isKey(path, object) ? [path] : castPath(path);\\n */\\n var index = 0,\\n length = castedPath.length;\\n\\n while (object != null && index < length) {\\n object = object[TOKEY(castedPath[index++])];\\n }\\n return (index && index == length) ? object : undefined;\\n}\",\n \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"function get(opt, path) {\\n path = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < path.length; i++) {\\n obj = obj && obj[path[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"static _resolvePath(path, object) {\\n if (typeof path !== 'string') throw Error(\\\"Requires a string, got an \\\" + typeof path + \\\" that \\\" + Array.isArray(path) ? \\\"is\\\" : \\\"isn't\\\" + \\\" an array\\\");\\n\\n object = object || ApplicationState._state;\\n const nodes = ApplicationState.walk(path);\\n\\n for (let index = 0; index < nodes.length; index++) {\\n const node = nodes[index];\\n object = object[node.name];\\n if (typeof object === 'undefined') return undefined;\\n if (object === null) return null;\\n }\\n\\n return object;\\n }\",\n \"function get(opt, path) {\\n var pathArr = path.split(',');\\n var obj = opt;\\n\\n for (var i = 0; i < pathArr.length; i++) {\\n obj = obj && obj[pathArr[i]];\\n\\n if (obj == null) {\\n break;\\n }\\n }\\n\\n return obj;\\n}\",\n \"function getProperty(object, propertyPath, defaultValue) {\\n if (isDefined(object)) {\\n if (isDefined(object[propertyPath])) {\\n return object[propertyPath];\\n }\\n var pathParts = propertyPath.split('.'); // path as nested properties\\n for (var i = 0; i < pathParts.length && isDefined(object); i++) {\\n object = object[pathParts[i]];\\n }\\n }\\n return isDefined(object) ? object : defaultValue;\\n}\",\n \"function evalPath(obj, path) {\\n return path.split('.').reduce(function(o, i) { return o[i];}, obj);\\n}\",\n \"function getValueFrom(object, key) {\\n var keys = key.split('.');\\n var value = object;\\n for (var i = 0; i < keys.length; i++) {\\n var v = value[keys[i]];\\n if (v !== undefined) {\\n value = v;\\n } else {\\n return undefined;\\n }\\n }\\n return value;\\n}\",\n \"_resolveObjectPath(path, obj) {\\n return path.split(\\\".\\\").reduce(function(prev, curr) {\\n return prev ? prev[curr] : null;\\n }, obj || self);\\n }\",\n \"function getField(obj, path) {\\n if (obj[path] === undefined) {\\n // We assign it to an empty object\\n // so that the key is actually created\\n obj[path] = {};\\n return undefined;\\n }\\n var value = obj[path].value;\\n if (value === true) {\\n return \\\"true\\\";\\n }\\n return obj[path].value;\\n}\",\n \"getPath(object, path) {\\n if (object == null) return object\\n const steps = spellCore.splitPath(path)\\n if (!steps) return undefined\\n let target = object\\n for (let i = 0; i < steps.length; i++) {\\n let key = steps[i]\\n if (target == null) return undefined\\n if (typeof key === \\\"number\\\" && typeof target.getItem === \\\"function\\\") target = target.getItem(key)\\n else target = target[key]\\n }\\n return target\\n }\",\n \"static accessValue(object, key) {\\n const keys = key.split('.');\\n let value = object;\\n for (let i = 0, max = keys.length; i < max; i++) {\\n value = value[keys[i]];\\n }\\n return value;\\n }\",\n \"function get(target, field) {\\n var pathArray = splitNested(field);\\n var result = void 0;\\n try {\\n result = pathArray.reduce(function (curr, path) {\\n return curr[path];\\n }, target);\\n } catch (e) {}\\n return result;\\n}\",\n \"function pathToReference(obj, path) {\\n return reduce(function (reference, segment) {\\n\\tif (reference) {\\n\\t if (typeof segment === \\\"object\\\" && segment.hasOwnProperty(\\\"id\\\")) \\n\\t\\treturn idToReferenceAndIndex(reference, segment.id).obj;\\n\\t else\\n\\t\\treturn reference[segment];\\n\\t}\\n\\telse\\n\\t return reference;\\n }, \\n path, obj);\\n}\",\n \"function setPropFromPath(obj, path, value) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') {\\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\\n\\n objRef = objRef[keys[i]];\\n }\\n }\\n\\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\\n }\",\n \"function setPropFromPath(obj, path, value) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') {\\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\\n\\n objRef = objRef[keys[i]];\\n }\\n }\\n\\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\\n }\",\n \"function deepGet(object, [head, ...tail], fallback = null) {\\n const val = object[head]\\n if (val === undefined || val === null) { return fallback }\\n if (tail.length === 0) { return val }\\n return deepGet(val, tail, fallback)\\n}\",\n \"get(path){\\n if (typeof path === 'string') {\\n let array = path.split('.');\\n return this.get(array);\\n }\\n let data = this.data;\\n let len = path ? path.length : 0;\\n let i;\\n for (i = 0; data && i < len; i++) {\\n let segment = path[i];\\n data = data[segment];\\n }\\n return i === len ? data : null;\\n }\",\n \"function getJsonValue(path, obj) {\\n function cleanObjPart(s) {\\n // Handle the case when processing an array element (e.g. \\\"jobs[0]\\\")\\n var re = /(\\\\w+)\\\\s*\\\\[\\\\s*(\\\\d+)\\\\s*\\\\]\\\\s*/;\\n var match = re.exec(s);\\n var objPart;\\n if (match != null) {\\n var elem1 = match[1];\\n var index = parseInt(match[2], 10);\\n objPart = obj[elem1][index];\\n }\\n else {\\n objPart = obj[s];\\n }\\n return objPart;\\n }\\n\\n var NOT_FOUND = \\\"notFound\\\";\\n var parts = path.split(/(?!\\\\B\\\"[^\\\"]*)\\\\.(?![^\\\"]*\\\"\\\\B)/);\\n var part;\\n var last = removeDoubleQuotes(parts.pop());\\n while ((part = parts.shift())) {\\n part = removeDoubleQuotes(part);\\n var objPart = cleanObjPart(part);\\n if (typeof objPart != \\\"object\\\") return NOT_FOUND;\\n obj = objPart;\\n }\\n\\n var r = cleanObjPart(last);\\n return r === undefined ? NOT_FOUND : r;\\n}\",\n \"function setDeepValue(obj, path, value) {\\n if (typeof path === 'string') {\\n path = path.split('.');\\n }\\n if (path.length > 1) {\\n const e = path.shift();\\n setDeepValue(obj[e] = Object.prototype.toString.call(obj[e]) === '[object Object]' ? obj[e] : {}, path, value);\\n }\\n else {\\n obj[path[0]] = value;\\n }\\n}\",\n \"function getPropertySafe(obj, path, defValue) {\\n var hasOwnProp = Object.prototype.hasOwnProperty;\\n\\n var keys = Array.isArray(path) ? path : path.split('.');\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n if (!obj || !hasOwnProp.call(obj, key)) {\\n obj = undefined;\\n break;\\n }\\n obj = obj[key];\\n }\\n\\n if(arguments.length > 2 && obj === undefined)\\n return defValue;\\n\\n return obj;\\n}\",\n \"function getPath(obj, ks) {\\n if (typeof ks == \\\"string\\\") ks = ks.split(\\\".\\\");\\n\\n // If we have reached an undefined property\\n // then stop executing and return undefined\\n if (obj === undefined) return void 0;\\n\\n // If the path array has no more elements, we've reached\\n // the intended property and return its value\\n if (ks.length === 0) return obj;\\n\\n // If we still have elements in the path array and the current\\n // value is null, stop executing and return undefined\\n if (obj === null) return void 0;\\n\\n return getPath(obj[_.first(ks)], _.rest(ks));\\n }\",\n \"function get(obj, props) {\\n if (typeof props === 'string') {\\n props = props.split('.');\\n } else if (!(props instanceof Array)) {\\n throw new TypeError('Invalid type for key: ' + (typeof props));\\n }\\n var i;\\n for (i = 0; i < props.length; i += 1) {\\n if ((obj === undefined) ||\\n (typeof obj !== 'object') ||\\n (obj === null)) {\\n throw new Error('Invalid object path: ' + props.join('.') + ' at ' + i);\\n }\\n obj = obj[props[i]];\\n }\\n if (obj === undefined) {\\n throw new Error('No value found on object path: ' + props.join('.'));\\n } else {\\n return obj;\\n }\\n }\",\n \"function getIn(object, pathArray) {\\n return R.path(pathArray, object);\\n}\",\n \"resolveProp(obj, path) {\\n return path.split('.').reduce((prev, curr) => {\\n return prev ? prev[curr] : null;\\n }, obj);\\n }\",\n \"function setIn(obj, path, value) {\\n var res = clone(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = toPath(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = clone(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function cpGet(object, castedPath, defaultValue) {\\n var result = object == null ? undefined : _cpBaseGet(object, castedPath);\\n return result === undefined ? defaultValue : result;\\n}\",\n \"function getProperty(path) {\\n if (is(path, 'string')) {\\n return path;\\n }\\n if (is(path, 'array') && path.length > 0) {\\n return path[0];\\n }\\n return undefined;\\n }\",\n \"function setIn(obj, path, value) {\\n var res = lodash_es_clone(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = lodash_es_toPath(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (formik_esm_isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = lodash_es_clone(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function getPathValue(path, ctx) {\\n\\t\\t'use strict';\\n\\n\\t\\tif (path.length === 1 && path[0].length !== 0) {\\n\\t\\t\\treturn ctx.get(path[0]);\\n\\t\\t}\\n\\t\\t// anchor = false;\\n\\t\\tif (path[0].length === 0) {\\n\\t\\t\\treturn ctx.getPath(true, path.slice(1));\\n\\t\\t}\\n\\t\\treturn ctx.getPath(false, path);\\n\\t}\",\n \"static _assignValue(path, value, object) {\\n object = object || ApplicationState._state;\\n\\n const nodes = ApplicationState.walk(path);\\n\\n for (let index = 0; index < nodes.length; index++) {\\n const node = nodes[index];\\n switch (node.type) {\\n case 'object':\\n if (typeof object[node.name] === 'undefined') {\\n object[node.name] = {};\\n }\\n object = object[node.name];\\n break;\\n case 'array':\\n if (typeof object[node.name] === 'undefined') {\\n object[node.name] = [];\\n }\\n object = object[node.name];\\n break;\\n case 'leaf':\\n return object[node.name] = value;\\n break;\\n }\\n }\\n\\n throw Error(\\\"We should have returned after setting the value.\\\");\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function result(obj, path, fallback) {\\n path = toPath$1(path);\\n var length = path.length;\\n if (!length) {\\n return isFunction$1(fallback) ? fallback.call(obj) : fallback;\\n }\\n for (var i = 0; i < length; i++) {\\n var prop = obj == null ? void 0 : obj[path[i]];\\n if (prop === void 0) {\\n prop = fallback;\\n i = length; // Ensure we don't continue iterating.\\n }\\n obj = isFunction$1(prop) ? prop.call(obj) : prop;\\n }\\n return obj;\\n }\",\n \"function parent(object, path) {\\n return path.length < 2 ? object : baseGet(object, slice(path, 0, -1));\\n}\",\n \"function accessor (path) {\\n path = path.split(\\\".\\\");\\n return function (obj) {\\n for (var i = 0; i < path.length; i++)\\n obj = obj[path[i]];\\n return obj;\\n }\\n }\",\n \"function getPathObject(ob, path, ltOb, fn) {\\n // Iterate through path to late paths: @a.b.c paths\\n // Return \\\"\\\" (or noop if leaf is a function @a.b.c(...) ) if intermediate object not yet available\\n var prevOb,\\n tokens,\\n l,\\n i = 0;\\n\\n if (ltOb === 1) {\\n fn = 1;\\n ltOb = undefined;\\n } // Paths like ^a^b^c or ~^a^b^c will not throw if an object in path is undefined.\\n\\n\\n if (path) {\\n tokens = path.split(\\\".\\\");\\n l = tokens.length;\\n\\n for (; ob && i < l; i++) {\\n prevOb = ob;\\n ob = tokens[i] ? ob[tokens[i]] : ob;\\n }\\n }\\n\\n if (ltOb) {\\n ltOb.lt = ltOb.lt || i < l; // If i < l there was an object in the path not yet available\\n }\\n\\n return ob === undefined ? fn ? noop : \\\"\\\" : fn ? function () {\\n return ob.apply(prevOb, arguments);\\n } : ob;\\n }\",\n \"get(path) {\\n return _find(this, path, '.');\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.8193551","0.8193551","0.8193551","0.8193551","0.8193551","0.8193551","0.8193551","0.8193551","0.8193551","0.7947024","0.7807266","0.77647674","0.7747176","0.7579353","0.75734","0.7538337","0.7516273","0.7497333","0.74887854","0.74285764","0.73955286","0.7382455","0.73431295","0.73426753","0.73426753","0.73426753","0.73426753","0.73426753","0.73426753","0.73426753","0.73426753","0.73426753","0.7327972","0.7274172","0.72232026","0.72232026","0.7152044","0.70637673","0.70098203","0.7002042","0.69413894","0.6910604","0.68931866","0.6892991","0.67340064","0.66947156","0.6680362","0.66581845","0.6649187","0.66372406","0.6579872","0.6576446","0.6538267","0.653377","0.6471995","0.6415175","0.6415175","0.6415175","0.6415175","0.6415175","0.6376437","0.635542","0.63529974","0.63204813","0.63139474","0.6281767","0.6257389","0.62166965","0.62089723","0.62072235","0.6200745","0.61954373","0.61954373","0.61879355","0.618699","0.61807567","0.6179652","0.6160693","0.61430585","0.61378074","0.61214393","0.61174047","0.60903573","0.6086552","0.6082264","0.60779446","0.60625684","0.6051781","0.6047391","0.6047391","0.6047391","0.6047391","0.6047391","0.6047391","0.6047391","0.6047391","0.6047391","0.60430723","0.6042763","0.5996265","0.59900177"],"string":"[\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.8193551\",\n \"0.7947024\",\n \"0.7807266\",\n \"0.77647674\",\n \"0.7747176\",\n \"0.7579353\",\n \"0.75734\",\n \"0.7538337\",\n \"0.7516273\",\n \"0.7497333\",\n \"0.74887854\",\n \"0.74285764\",\n \"0.73955286\",\n \"0.7382455\",\n \"0.73431295\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.73426753\",\n \"0.7327972\",\n \"0.7274172\",\n \"0.72232026\",\n \"0.72232026\",\n \"0.7152044\",\n \"0.70637673\",\n \"0.70098203\",\n \"0.7002042\",\n \"0.69413894\",\n \"0.6910604\",\n \"0.68931866\",\n \"0.6892991\",\n \"0.67340064\",\n \"0.66947156\",\n \"0.6680362\",\n \"0.66581845\",\n \"0.6649187\",\n \"0.66372406\",\n \"0.6579872\",\n \"0.6576446\",\n \"0.6538267\",\n \"0.653377\",\n \"0.6471995\",\n \"0.6415175\",\n \"0.6415175\",\n \"0.6415175\",\n \"0.6415175\",\n \"0.6415175\",\n \"0.6376437\",\n \"0.635542\",\n \"0.63529974\",\n \"0.63204813\",\n \"0.63139474\",\n \"0.6281767\",\n \"0.6257389\",\n \"0.62166965\",\n \"0.62089723\",\n \"0.62072235\",\n \"0.6200745\",\n \"0.61954373\",\n \"0.61954373\",\n \"0.61879355\",\n \"0.618699\",\n \"0.61807567\",\n \"0.6179652\",\n \"0.6160693\",\n \"0.61430585\",\n \"0.61378074\",\n \"0.61214393\",\n \"0.61174047\",\n \"0.60903573\",\n \"0.6086552\",\n \"0.6082264\",\n \"0.60779446\",\n \"0.60625684\",\n \"0.6051781\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.6047391\",\n \"0.60430723\",\n \"0.6042763\",\n \"0.5996265\",\n \"0.59900177\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":82041,"cells":{"query":{"kind":"string","value":"Deeply set a value from in object via it's path. If the value at `path` has changed, return a shallow copy of obj with `value` set at `path`. If `value` has not changed, return the original `obj`. Existing objects / arrays along `path` are also shallow copied. Sibling objects along path retain the same internal js reference. Since new objects / arrays are only created along `path`, we can test if anything changed in a nested structure by comparing the object's reference in the old and new object, similar to how russian doll cache invalidation works. In earlier versions of this function, which used cloneDeep, there were issues whereby settings a nested value would mutate the parent instead of creating a new object. `clone` avoids that bug making a shallow copy of the objects along the update path so no object is mutated in place. Before changing this function, please read through the following discussions."},"document":{"kind":"string","value":"function setIn(obj,path,value){var res=clone(obj);// this keeps inheritance when obj is a class\nvar resVal=res;var i=0;var pathArray=toPath(path);for(;i=0?[]:{};}}// Return original object if new value is the same as current\nif((i===0?obj:resVal)[pathArray[i]]===value){return obj;}if(value===undefined){delete resVal[pathArray[i]];}else {resVal[pathArray[i]]=value;}// If the path array has a single element, the loop did not run.\n// Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\nif(i===0&&value===undefined){delete res[pathArray[i]];}return res;}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function setIn(obj, path, value) {\n var res = clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = lodash_es_clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = lodash_es_toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (formik_esm_isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = lodash_es_clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = Object(lodash_es_toPath__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setDeepValue(obj, path, value) {\n if (typeof path === 'string') {\n path = path.split('.');\n }\n if (path.length > 1) {\n const e = path.shift();\n setDeepValue(obj[e] = Object.prototype.toString.call(obj[e]) === '[object Object]' ? obj[e] : {}, path, value);\n }\n else {\n obj[path[0]] = value;\n }\n}","function lazyImmutableDeepSet(target, original, path, value) {\n if (!path.length)\n return value;\n var parentNode;\n var targetNode = target;\n var originalNode = original;\n // We assume that the last path component is the key of a value; not a\n // container, so we stop there.\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n // If the target still references the original's objects, we need to diverge\n if (!targetNode || targetNode === originalNode) {\n if (typeof key === 'number') {\n targetNode = originalNode ? tslib_1.__spread(originalNode) : [];\n }\n else if (typeof key === 'string') {\n targetNode = originalNode ? tslib_1.__assign({}, originalNode) : {};\n }\n else {\n throw new Error(\"Unknown path type \" + JSON.stringify(key) + \" in path \" + JSON.stringify(path) + \" at index \" + i);\n }\n if (i === 0) {\n // Make sure we have a reference to the new target. We can keep the\n // reference here because \"target\" is pointing as currentNode.data.\n target = targetNode;\n }\n else {\n parentNode[path[i - 1]] = targetNode;\n }\n }\n // Regardless, we keep walking deeper.\n parentNode = targetNode;\n targetNode = targetNode[key];\n originalNode = originalNode && originalNode[key];\n }\n // Finally, set the value in our previously or newly cloned target.\n parentNode[path[path.length - 1]] = value;\n return target;\n}","function setPath(obj, value, path) {\n var keys = path.split('.');\n var ret = obj;\n var lastKey = keys[keys.length -1];\n var target = ret;\n\n var parentPathKeys = keys.slice(0, keys.length -1);\n parentPathKeys.forEach(function(key) {\n if (!target.hasOwnProperty(key)) {\n target[key] = {};\n }\n target = target[key];\n });\n\n target[lastKey] = value;\n return ret;\n }","function setPath(obj, value, path) {\n var keys = path.split('.');\n var ret = obj;\n var lastKey = keys[keys.length - 1];\n var target = ret;\n var parentPathKeys = keys.slice(0, keys.length - 1);\n parentPathKeys.forEach(function (key) {\n if (!target.hasOwnProperty(key)) {\n target[key] = {};\n }\n target = target[key];\n });\n target[lastKey] = value;\n return ret;\n }","function setPath(obj, value, path) {\n var keys = path.split('.');\n var ret = obj;\n var lastKey = keys[keys.length - 1];\n var target = ret;\n var parentPathKeys = keys.slice(0, keys.length - 1);\n parentPathKeys.forEach(function (key) {\n if (!target.hasOwnProperty(key)) {\n target[key] = {};\n }\n target = target[key];\n });\n target[lastKey] = value;\n return ret;\n }","function setPropFromPath(obj, path, value) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') {\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\n\n objRef = objRef[keys[i]];\n }\n }\n\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\n }","function setPropFromPath(obj, path, value) {\n var keys = path.split('.');\n var targetKey = keys.pop();\n var objRef = obj;\n\n for (var i in keys) {\n if (typeof objRef === 'object') {\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\n\n objRef = objRef[keys[i]];\n }\n }\n\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\n }","function setInObj(obj, keyPath, value){\n var currPath = obj;\n var path = keyPath.split('.');\n console.log('path from keyPath: ' + path);\n for(var i=0; i < path.length-1; i++){\n console.log('path chunk: ' + path[i]);\n if (typeof(currPath[ path[i] ]) !== \"undefined\") {\n console.log('path chunk exist: ' + currPath[ path[i] ]);\n currPath = currPath[ path[i] ];\n //console.log(obj); // DEBUG\n //console.log(currPath); // DEBUG\n } else {\n //console.log('path added: ' + currPath[ path[i] ]);\n currPath[ path[i] ] = {};\n currPath = currPath[ path[i] ];\n //console.log(obj); // DEBUG\n //console.log(currPath); // DEBUG\n }\n }\n //currPath = value; // not working ?\n currPath[ path[ path.length-1 ] ] = value;\n}","function setNestedProperty(path, value, obj) {\n\t\t\tvar schema = obj || dataService.data;\n\t\t\tvar pList = path.replace(/\\]/g, '').split(/\\.|\\[/);\n\t\t\tvar len = pList.length;\n\t\t\tfor (var i = 0; i < len - 1; i++) {\n\t\t\t\tvar elem = pList[i];\n\t\t\t\tif (!schema[elem])\n\t\t\t\t\treturn false;\n\t\t\t\tschema = schema[elem];\n\t\t\t}\n\t\t\tschema[pList[len - 1]] = value;\n\t\t}","set(path, value) {\n if (typeof path === \"object\") {\n iterateObject(path, (val, n) => {\n setValue(this.data, n, val)\n });\n } else {\n setValue(this.data, path, value);\n }\n return this;\n }","_createNestedObjectRecursive(obj, path, value) {\n if (path.length === 0) {\n return;\n }\n if ((!Object.prototype.hasOwnProperty.call(obj, path[0]) && !obj[path[0]]) || typeof obj[path[0]] !== 'object') {\n obj[path[0]] = path.length === 1 && value ? value : {};\n }\n return this._createNestedObjectRecursive(obj[path[0]], path.slice(1), value);\n }","static _assignValue(path, value, object) {\n object = object || ApplicationState._state;\n\n const nodes = ApplicationState.walk(path);\n\n for (let index = 0; index < nodes.length; index++) {\n const node = nodes[index];\n switch (node.type) {\n case 'object':\n if (typeof object[node.name] === 'undefined') {\n object[node.name] = {};\n }\n object = object[node.name];\n break;\n case 'array':\n if (typeof object[node.name] === 'undefined') {\n object[node.name] = [];\n }\n object = object[node.name];\n break;\n case 'leaf':\n return object[node.name] = value;\n break;\n }\n }\n\n throw Error(\"We should have returned after setting the value.\");\n }","_pathSet(path, value) {\n let obj = this.fieldNode; // we set the values relative to the fieldnode, so fieldnode is the root\n const parts = path.split('.');\n while (parts.length > 1) {\n const key = parts.shift();\n // create if not exist\n if (!(key in obj)) {\n obj[key] = {};\n }\n obj = obj[key];\n }\n obj[parts.shift()] = value;\n }","function _set(obj, keypath, value, hook) {\n var parts = _keyPathNormalize(keypath).split('.')\n var last = parts.pop()\n var dest = obj\n parts.forEach(function(key) {\n // Still set to non-object, just throw that error\n dest = dest[key]\n })\n if (hook) {\n // hook proxy set value\n hook(dest, last, value)\n } else {\n dest[last] = value\n }\n return obj\n}","set(path, value) {\n if (typeof path === 'string') {\n let array = path.split('.');\n return this.set(array, value);\n }\n let data = this.data;\n let len = path ? path.length : 0;\n let i;\n for (i = 0; i < len - 1; i++) {\n let segment = path[i];\n let next = data[segment];\n if (!next)\n break;\n data = next;\n }\n // Add missing objects\n for (; i < len - 1; i++) {\n let segment = path[i];\n data = data[segment] = {};\n }\n if (data) {\n let segment = path[path.length - 1];\n data[segment] = value;\n }\n return this;\n \n }","function put(obj, path, value, opt_buildMissingPath) {\r\n path = typeOf(path, 'String') ? path.split('.') : path;\r\n \r\n for (var name, i = 0, e = path.length - 1; (name = path[i], i < e); i++) {\r\n if (obj[name] == undefined) {\r\n if (!opt_buildMissingPath) {\r\n throw new ReferenceError(\"Path couldn't be followed: \" + slice(path, 0, i + 1).join('.'));\r\n }\r\n obj[name] = {};\r\n }\r\n obj = obj[name];\r\n }\r\n \r\n if (e < 0) {\r\n throw new ReferenceError('Path must be specified.');\r\n }\r\n \r\n var oldValue = obj[name];\r\n obj[name] = value;\r\n return oldValue;\r\n }","function dynamicSetNestedProperty(path, value, obj) {\n\t\t\tvar schema = obj || dataService.data;\n\t\t\tvar pList = path.replace(/\\]/g, '').split(/\\.|\\[/);\n\t\t\tvar len = pList.length;\n\t\t\tfor (var i = 0; i < len - 1; i++) {\n\t\t\t\tvar elem = pList[i];\n\t\t\t\tif (!schema[elem]) schema[elem] = {}\n\t\t\t\tschema = schema[elem];\n\t\t\t}\n\t\t\tschema[pList[len - 1]] = value;\n\t\t}","function _set(obj, keypath, value) {\n\t var parts = _keyPathNormalize(keypath).split('.')\n\t var last = parts.pop()\n\t var dest = obj\n\t var hasError\n\t var errorInfo\n\t util.some(parts, function(key) {\n\t var t = util.type(dest)\n\t if (t != 'object' && t != 'array') {\n\t hasError = true\n\t errorInfo = [key, dest]\n\t return true\n\t }\n\t dest = dest[key]\n\t })\n\t // set value\n\t if (!hasError) {\n\t if (util.type(dest) != 'object' && util.type(dest) != 'array') {\n\t hasError = true\n\t errorInfo = [last, dest]\n\t } else {\n\t dest[last] = value\n\t return obj\n\t }\n\t }\n\t throw new Error('Can\\' not access \"' + errorInfo[0] + '\" of \"'+ errorInfo[1] + '\" when set value of \"' + keypath + '\"')\n\t}","function set(obj, path, value) {\n\n\tvar keys = path.split(\".\");\n\n\tkeys.forEach(function(key, index) {\n\t\tif(index === keys.length-1) {\n\t\t\tobj[key] = value;\n\t\t}\n\t\telse {\n\t\t\tobj = obj[key];\n\t\t}\n\t});\n}","function setPropertyByPath(obj, path, value, throwErr) {\n if (throwErr === void 0) { throwErr = true; }\n var objPath = getObjectPath(path);\n var obj = getPropertyByPath(obj, objPath, throwErr);\n var propName = getPropertyName(path);\n // TODO: Allow adding properties?\n if (!(propName in obj) && throwErr) {\n throw new Error(xp.formatString('Unable to set property value \"{0}\" by path \"{1}\". Property is unreachable.', value, path));\n }\n obj[propName] = value;\n }","function setValueByPath(o, path, val) {\n var len = path.length - 1,\n s = o;\n if (len >= 0) {\n for (var i = 0; i < len; i++) {\n o = o[path[i]];\n }\n if (o !== undefined) {\n o[path[i]] = val;\n } else {\n s = undefined;\n }\n }\n return s;\n }","function setNestedObjectValues(object,value,visited,response){if(visited===void 0){visited=new WeakMap();}if(response===void 0){response={};}for(var _i=0,_Object$keys=Object.keys(object);_i<_Object$keys.length;_i++){var k=_Object$keys[_i];var val=object[k];if(isObject$2(val)){if(!visited.get(val)){visited.set(val,true);// In order to keep array values consistent for both dot path and\n// bracket syntax, we need to check if this is an array so that\n// this will output { friends: [true] } and not { friends: { \"0\": true } }\nresponse[k]=Array.isArray(val)?[]:{};setNestedObjectValues(val,value,visited,response[k]);}}else {response[k]=value;}}return response;}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (formik_esm_isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function updateObject(object, newValue, path){\n var stack = path.split('.');\n while(stack.length>1){object = object[stack.shift()];}\n object[stack.shift()] = newValue;\n }","function writeDeepPath(obj, path, val,ds) {\n\t\tif(typeof path !== 'string') return;\n\n\t\tvar paths = path.split('.'),\n\t\t\tlen = paths.length,\n\t\t\ttotal = len - 1,\n\t\t\tdata = obj;\n\t\tif(!len) return;\n\t\tfor(var i = 0; i < len; i++) {\n\t\t\tif (i< total && data[paths[i]]===undefined) data[paths[i]] = {};\n\t\t\tif(i < total) data = data[paths[i]];\n\t\t\telse data[paths[i]] = val;\n\t\t}\n\t}","function coerce (type, obj, path, value) {\n if (isNil(path)) return;\n\n // Turn positive integer into string\n if (isPositiveInteger(path)) path = String(path);\n\n // Parse string path into an array\n if (isString(path)) {\n path = compact(path.trim().split(SEPERATOR));\n }\n\n // Return if path is invalid\n if (!path || !isArray(path) || path.length === 0) return;\n\n // Copy array for future use\n path = path.slice();\n\n // Shift the first path value\n var key = path.shift();\n\n // Return `undefined` if obj is `NaN` or `null` or `undefined`\n if (isNil(obj)) return;\n\n switch (type) {\n case 'get':\n if (path.length === 0) {\n return obj[key];\n }\n break;\n case 'set':\n if (path.length) {\n if (typeof obj[key] === 'undefined') {\n obj[key] = {};\n }\n\n if (isNil(obj[key])) return false;\n } else {\n obj[key] = value;\n return true;\n }\n break;\n case 'remove':\n if (path.length === 0) {\n\n if (isArray(obj) && isPositiveInteger(key)) {\n key = Number(key);\n\n if (obj.length - 1 < key) return false;\n\n obj.splice(key, 1);\n } else {\n if (!Object.hasOwnProperty.call(obj, key)) return false;\n\n delete obj[key];\n }\n\n return true;\n }\n break;\n case 'exists':\n if (path.length === 0) {\n if (isArray(obj) && isPositiveInteger(key)) {\n key = Number(key);\n return obj.length - 1 >= key;\n } else {\n return Object.hasOwnProperty.call(obj, key);\n }\n }\n break;\n default:\n return;\n }\n\n return coerce(type, obj[key], path, value);\n}","function setValue(obj, keyPath, value) {\n let keys = keyPath.split(\".\");\n\n while (keys.length > 0) {\n // Set value for the last key\n if (keys.length === 1) {\n obj[keys.shift()] = value;\n return;\n }\n\n const key = keys.shift();\n\n if (obj[key] != null) {\n obj = obj[key];\n } else {\n obj = obj[key] = {};\n }\n }\n}","function put (obj, key, value, path = []) {\n if (!isObject(value)) {\n // if we are overriding an existing object,\n // record deletion\n if (isObject(obj[key])) {\n // recursively delete object props\n del(obj, key)\n }\n\n // record parent object update\n let parent = baseObject(obj)\n parent[key] = baseObject(value)\n recordMutation('put', path, parent)\n return\n }\n\n // if we are overriding an existing non-object,\n // record update of parent base object\n if (key in obj && !isObject(obj[key])) {\n let base = baseObject(obj)\n delete base[key]\n recordMutation('put', path, base)\n }\n\n // if parent is array, ensure length gets updated\n if (Array.isArray(obj)) {\n let parent = baseObject(obj)\n recordMutation('put', path, parent)\n }\n\n let base = baseObject(value)\n recordMutation('put', path.concat(key), base)\n\n for (let childKey in value) {\n let child = value[childKey]\n\n // if any of our non-object children override an\n // existing object, then record deletion\n if (!isObject(child)) {\n if (!isObject(obj[key])) continue\n if (!isObject(obj[key][childKey])) continue\n del(obj[key], childKey, path.concat(key))\n continue\n }\n\n // recursively record puts for objects\n put(value, childKey, child, path.concat(key))\n }\n }","setDepth(obj, path, value) {\n obj = obj || {};\n let tags = path.split(\".\").reverse();\n\n obj[tags.shift()] = value;\n\n for (let tag of tags) {\n let _obj = Object.assign({}, obj);\n obj = {[tag]: _obj};\n }\n return obj;\n }","function remove(obj, path) {\n if (obj.toJSON) {\n // We need to get the JSON form of the object before recursing.\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#toJSON()_behavior\n obj = obj.toJSON();\n }\n if (Array.isArray(obj)) {\n var is_cloned = false;\n for (var i = 0; i < obj.length; i++) {\n var value = obj[i];\n if (value) {\n if (value instanceof ArrayBuffer || ArrayBuffer.isView(value)) {\n if (!is_cloned) {\n obj = obj.slice();\n is_cloned = true;\n }\n buffers.push(ArrayBuffer.isView(value) ? value.buffer : value);\n buffer_paths.push(path.concat([i]));\n // easier to just keep the array, but clear the entry, otherwise we have to think\n // about array length, much easier this way\n obj[i] = null;\n }\n else {\n var new_value = remove(value, path.concat([i]));\n // only assigned when the value changes, we may serialize objects that don't support assignment\n if (new_value !== value) {\n if (!is_cloned) {\n obj = obj.slice();\n is_cloned = true;\n }\n obj[i] = new_value;\n }\n }\n }\n }\n }\n else if (isPlainObject(obj)) {\n for (var key in obj) {\n var is_cloned = false;\n if (obj.hasOwnProperty(key)) {\n var value = obj[key];\n if (value) {\n if (value instanceof ArrayBuffer || ArrayBuffer.isView(value)) {\n if (!is_cloned) {\n obj = __assign({}, obj);\n is_cloned = true;\n }\n buffers.push(ArrayBuffer.isView(value) ? value.buffer : value);\n buffer_paths.push(path.concat([key]));\n delete obj[key]; // for objects/dicts we just delete them\n }\n else {\n var new_value = remove(value, path.concat([key]));\n // only assigned when the value changes, we may serialize objects that don't support assignment\n if (new_value !== value) {\n if (!is_cloned) {\n obj = __assign({}, obj);\n is_cloned = true;\n }\n obj[key] = new_value;\n }\n }\n }\n }\n }\n }\n return obj;\n }","setIn(path, value) {\n if (isEmptyPath(path))\n this.contents = value;\n else if (this.contents == null) {\n this.contents = collectionFromPath(this.schema, Array.from(path), value);\n }\n else if (assertCollection(this.contents)) {\n this.contents.setIn(path, value);\n }\n }","function patchValueAlreadyInPath(root, patch) {\n var ancestors = [root];\n patch.path.reduce(function (parent, p) {\n ancestors.push(parent[p]);\n return parent[p];\n }, root);\n return pointToAncestor(patch.value);\n\n function pointToAncestor(obj) {\n return ___WEBPACK_IMPORTED_MODULE_12__[\"default\"].isObject(obj) && (ancestors.indexOf(obj) >= 0 || _babel_runtime_corejs3_core_js_stable_object_keys__WEBPACK_IMPORTED_MODULE_6___default()(obj).some(function (k) {\n return pointToAncestor(obj[k]);\n }));\n }\n}","function setObjectValue(obj, attribute, value) {\n // Reference to return\n var reference = obj;\n\n if (attribute.indexOf('.') >= 0) {\n // Handle dotted path\n var path = attribute.split('.');\n\n while (path.length > 1) {\n var shift = path.shift();\n\n // If not exists, create it\n if (!obj[shift]) {\n obj[shift] = {};\n }\n\n obj = obj[shift];\n }\n\n obj[path.shift()] = value;\n } else {\n // Handle simple path\n obj[attribute] = value;\n }\n\n return reference;\n}","function setProperty(path, obj, val) {\n var parts = path.split('.'),\n last = parts.pop(),\n part;\n\n /* jshint boss: true */\n while (part = parts.shift()) { // assignment\n // rewrite property if it exists but is not an object\n obj = obj[part] = obj[part] instanceof Object ?\n obj[part] : {};\n }\n\n obj[last] = val;\n}","function patchValueAlreadyInPath(root, patch) {\n var ancestors = [root];\n patch.path.reduce(function (parent, p) {\n ancestors.push(parent[p]);\n return parent[p];\n }, root);\n return pointToAncestor(patch.value);\n\n function pointToAncestor(obj) {\n return ___WEBPACK_IMPORTED_MODULE_12__.default.isObject(obj) && (ancestors.indexOf(obj) >= 0 || _babel_runtime_corejs3_core_js_stable_object_keys__WEBPACK_IMPORTED_MODULE_6___default()(obj).some(function (k) {\n return pointToAncestor(obj[k]);\n }));\n }\n}","function subPointer(path) {\n\n return {\n\n _refresh: function() {\n var current = util.pick(root.data, path) \n this._previous = this._current\n this._current = current\n },\n \n isChanged: function() { return this._previous !== this._current },\n\n refine: function(ext) {\n var newPath = path.concat(typeof ext == 'string' ? ext.split('.') : ext)\n var newPathString = newPath.join('.')\n var existing = root.subs[newPathString]\n var sub = existing || (root.subs[newPathString] = subPointer(newPath))\n !existing && sub._refresh()\n return sub\n },\n \n fromRoot: function(ext) {\n return root.refine(ext)\n },\n\n deref: function(orDefault) {\n return typeof this._current !== 'undefined' ? this._current : orDefault\n },\n\n update: function(delta) {\n var deltaForRoot = util.nest(path, delta)\n var newData = React.addons.update(root.data, deltaForRoot)\n root.swap(newData)\n },\n\n get: function(path) {\n return util.pick(this.deref(), path)\n },\n\n set: function(val) {\n return this.update({ $set: val })\n }\n }\n }","setIn(path, value) {\n if (Collection.isEmptyPath(path)) {\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents = value;\n }\n else if (this.contents == null) {\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents = Collection.collectionFromPath(this.schema, Array.from(path), value);\n }\n else if (assertCollection(this.contents)) {\n this.contents.setIn(path, value);\n }\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function deepGet(obj, path) {\n var length = path.length;\n for (var i = 0; i < length; i++) {\n if (obj == null) return void 0;\n obj = obj[path[i]];\n }\n return length ? obj : void 0;\n }","function objectSet (label, value) {\n if(o) {\n o[label] = value;\n }\n var newPath = self.makeObjectPath(path, label);\n var handled = self.emitValue(newPath, value);\n if(!handled && typeof dispose == 'function') {\n dispose();\n }\n return newPath;\n }","function cloneDeep(value) {\n return _.cloneDeep(value);\n}","function Data(root, refPath, value, ensurePathValid) {\n root = root || Store;\n var toSet = arguments.length >= 3 && value !== __;\n var v = root;\n // var proppath = fullpathOf(null, root);\n var paths = [];\n if (refPath) paths = splitPath(refPath);\n var parent;\n var prop;\n\n while (paths.length) {\n if (ensurePathValid && v == null) {\n parent[prop] = {};\n } else if (Util.isBasic(v)) {\n return undefined;\n }\n prop = paths.shift();\n // proppath += (proppath === '' ? '' : '.') + prop;\n if (toSet && paths.length === 0) { /* set */\n if (Util.isInstance(v, OArray) &&\n !(Util.isObject(v[prop]) && Util.isObject(value))) {\n v.set(prop, value);\n } else {\n v[prop] = Util.extend(v[prop], value);\n }\n } else { /* get */\n parent = v;\n v = v[prop];\n }\n }\n return toSet ? v[prop] : v;\n}","function cloneDeep$2(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep$2(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep$2(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","setObjectWithNestedKey(obj, key, value) {\n\n if(key.indexOf(\".\")) {\n // Need to deal with arrays\n var keys = key.split(\".\");\n var lastHash = keys.pop();\n for(var i = 0; i < keys.length; i++) {\n let keyPointer = keys[i];\n\n if(_.isString(keyPointer) && keyPointer.indexOf(\"[\") === 0) {\n keyPointer = keyPointer.replace(\"[\", \"\").replace(\"]\", \"\");\n keyPointer = parseInt(keyPointer, 10);\n }\n\n if(!_.has(obj, keyPointer) || !_.isObject(obj[keyPointer])) {\n\n var newObj = {};\n var nextKey = i + 1;\n\n if(keys.length > nextKey && _.isString(keys[nextKey]) && keys[nextKey].indexOf(\"[\") === 0) {\n newObj = [];\n }\n\n\n obj[keyPointer] = newObj;\n\n }\n\n obj = obj[keyPointer];\n }\n\n //obj[lastHash] = {};\n key = lastHash;\n }\n\n obj[key] = value;\n\n\n return true;\n }","setValue(_value) {\n if (this.isntUndefined(_value) && this.isValueObject(this.valueObj) && this.valueDiffers(_value)) {\n this.__value = _value;\n if (this.isObjectOrArray(_value)) {\n this.valueObj.set(this.cloneObject(_value));\n }\n else {\n this.valueObj.set(_value);\n }\n if (this.isFunction(this.refresh)) {\n this.refresh();\n }\n else if (this.isFunction(this.refreshValue)) {\n this.refreshValue();\n }\n }\n }","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function updateIn(rootVal, paths, f) {\n\t for (var _len3 = arguments.length, args = Array(_len3 > 3 ? _len3 - 3 : 0), _key3 = 3; _key3 < _len3; _key3++) {\n\t args[_key3 - 3] = arguments[_key3];\n\t }\n\t\n\t var ff = function ff(v) {\n\t return f.apply(null, [v].concat(args));\n\t };\n\t\n\t var newRootVal;\n\t if (paths.length > 0) {\n\t var command = rootAt(paths, { $apply: ff });\n\t newRootVal = (0, _reactAddonsUpdate2.default)(rootVal, command);\n\t } else if (paths.length === 0) {\n\t newRootVal = ff(rootVal);\n\t }\n\t\n\t // would be better to do this valEq check on just the leaf\n\t return (0, _deepEqual2.default)(rootVal, newRootVal) ? rootVal // preserve === if same value\n\t : newRootVal;\n\t}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) {\n return cloneDeep(item);\n });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) {\n return cloneDeep(item);\n });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function fastpathSet(obj, name) {\n if (name === 'toString') { fail(\"internal: Can't fastpath .toString\"); }\n if (isFrozen(obj)) {\n fail(\"Can't set .\", name, ' on frozen (', debugReference(obj), ')');\n }\n if (typeOf(obj) === 'function') {\n fail(\"Can't make .\", name, \n ' writable on a function (', debugReference(obj), ')');\n }\n fastpathEnum(obj, name);\n fastpathRead(obj, name);\n if (obj[name + '_canCall___']) {\n obj[name + '_canCall___'] = false;\n }\n if (obj[name + '_grantCall___']) {\n obj[name + '_grantCall___'] = false;\n }\n obj.SLOWFREEZE___ = obj;\n obj[name + '_canSet___'] = obj;\n }","function set (path, value) {\n let map = this._root\n for (const item of path) {\n let nextMap = map.get(item)\n if (!nextMap) {\n // Create next map if none exists\n nextMap = new Map()\n map.set(item, nextMap)\n }\n map = nextMap\n }\n\n // Reached end of path. Set the data symbol to the given value, and\n // increment size if nothing was here before.\n if (!map.has(dataSymbol)) this._size += 1\n map.set(dataSymbol, value)\n return this\n}","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$3(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$6(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$3(a[prop]) && !isArray$3(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","function safeDeepClone(circularValue, refs, obj) {\n var copy;\n\n // object is a false or empty value, or otherwise not an object\n if (!obj || 'object' !== typeof obj || obj instanceof Error || obj instanceof ArrayBuffer || obj instanceof Blob || obj instanceof File) return obj;\n\n // Handle Date\n if (obj instanceof Date) {\n copy = new Date();\n copy.setTime(obj.getTime());\n return copy;\n }\n\n // Handle Array - or array-like items\n if (obj instanceof Array || obj.length) {\n \n refs.push(obj);\n copy = [];\n for (var i = 0, len = obj.length; i < len; i++) {\n if (refs.indexOf(obj[i]) >= 0) {\n copy[i] = circularValue;\n } else {\n copy[i] = safeDeepClone(circularValue, refs, obj[i]);\n }\n }\n refs.pop();\n return copy;\n }\n\n // Handle Object\n refs.push(obj);\n\n // Bring a long prototype\n if (obj.constructor && obj.constructor !== Object) {\n copy = Object.create(obj.constructor.prototype);\n } else {\n copy = {};\n }\n\n for (var attr in obj) {\n if (obj.hasOwnProperty(attr) && attr !== '$$hashKey') {\n if (refs.indexOf(obj[attr]) >= 0) {\n copy[attr] = circularValue;\n } else {\n copy[attr] = safeDeepClone(circularValue, refs, obj[attr]);\n }\n }\n }\n refs.pop();\n return copy;\n}","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$4(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (!Object.prototype.propertyIsEnumerable.call(b, prop)) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","function wrap (obj, onMutate, path = []) {\n function recordMutation (op, childPath, value) {\n let fullPath = path.concat(childPath)\n let oldValue\n let existed = false\n try {\n [ oldValue, existed ] = access(obj, childPath)\n } catch (err) {}\n let mutation = {\n op,\n path: fullPath,\n oldValue: baseObject(oldValue),\n newValue: value,\n existed\n }\n onMutate(mutation)\n // TODO: replace mutations for overriden paths\n }\n\n // TODO: wrap array methods to record array-specific mutations,\n // otherwise ops like splices and shifts will create N mutations\n\n function put (obj, key, value, path = []) {\n if (!isObject(value)) {\n // if we are overriding an existing object,\n // record deletion\n if (isObject(obj[key])) {\n // recursively delete object props\n del(obj, key)\n }\n\n // record parent object update\n let parent = baseObject(obj)\n parent[key] = baseObject(value)\n recordMutation('put', path, parent)\n return\n }\n\n // if we are overriding an existing non-object,\n // record update of parent base object\n if (key in obj && !isObject(obj[key])) {\n let base = baseObject(obj)\n delete base[key]\n recordMutation('put', path, base)\n }\n\n // if parent is array, ensure length gets updated\n if (Array.isArray(obj)) {\n let parent = baseObject(obj)\n recordMutation('put', path, parent)\n }\n\n let base = baseObject(value)\n recordMutation('put', path.concat(key), base)\n\n for (let childKey in value) {\n let child = value[childKey]\n\n // if any of our non-object children override an\n // existing object, then record deletion\n if (!isObject(child)) {\n if (!isObject(obj[key])) continue\n if (!isObject(obj[key][childKey])) continue\n del(obj[key], childKey, path.concat(key))\n continue\n }\n\n // recursively record puts for objects\n put(value, childKey, child, path.concat(key))\n }\n }\n\n function del (obj, key, path = []) {\n let value = obj[key]\n\n if (!isObject(obj[key])) {\n // record parent object update\n let parent = baseObject(obj)\n delete parent[key]\n recordMutation('put', path, parent)\n return\n }\n\n // recursively record deletions for objects\n for (let childKey in value) {\n let child = value[childKey]\n if (!isObject(child)) continue\n del(value, childKey, path.concat(key))\n }\n\n recordMutation('del', path.concat(key))\n }\n\n let wrapped = new Proxy(obj, {\n // recursively wrap child objects when accessed\n get (obj, key) {\n let value = obj[key]\n\n // functions should be bound to parent\n if (typeof value === 'function') {\n return value.bind(wrapped)\n }\n\n // don't recurse if not object\n if (!isObject(value)) {\n return value\n }\n\n // convert array bases to actual array\n if ('__MERK_ARRAY__' in value) {\n let base = value\n value = new Array(value.length)\n Object.assign(value, base)\n delete value.__MERK_ARRAY__\n }\n\n // if value is object, recursively wrap\n let childPath = path.concat(key)\n return wrap(value, onMutate, childPath)\n },\n\n // record mutations\n set (obj, key, value) {\n put(obj, key, value)\n obj[key] = value\n return true\n },\n\n // record deletions as mutations too\n deleteProperty (obj, key) {\n if (!(key in obj)) return true\n del(obj, key)\n delete obj[key]\n return true\n },\n\n // ovverride ownKeys to exclude symbol properties\n ownKeys () {\n return Object.getOwnPropertyNames(obj)\n }\n })\n return wrapped\n}","function clone(val, depth = 5) {\n if (typeof val !== 'object') {\n return val;\n }\n // If we're cloning an array, use an array as the base, otherwise use an object\n const clonedObject = Array.isArray(val) ? [] : {};\n for (const key in val) {\n // Recursively clone eack item unless we're at the maximum depth\n clonedObject[key] = depth <= 1 ? val[key] : (val[key] ? clone(val[key], depth - 1) : val[key]);\n }\n return clonedObject;\n}","setJsonDeep(target, keys, value) {\n let origin = target;\n keys = keys.split('.');\n for (let key of keys) {\n let last = key === keys[keys.length - 1];\n if (typeof origin[key] === 'undefined' || !origin[key]) {\n origin[key] = last ? value : {};\n } else {\n origin[key] = last ? value : origin[key];\n }\n origin = origin[key];\n }\n }","function setPropertyChanged(params) {\n var path = params.path;\n var value = params.value;\n\n var root = _config;\n var iter = root;\n var pathArray = path.split(\".\");\n\n var i = 0;\n while (iter && i < pathArray.length - 1) {\n var pathItem = pathArray[i];\n iter = iter[pathItem];\n i++;\n }\n\n if (iter && pathArray.length) {\n var lastPathItem = pathArray[pathArray.length - 1];\n\n if (!value) {\n if (pathArray.length < 3) {\n return;\n }\n\n var base = getBase({ path: path });\n if (!base) {\n return;\n }\n\n var basePathArray = pathArray.slice(2);\n var basePath = basePathArray.join(\".\");\n var baseValue = getProperty({\n path: basePath,\n root: base\n });\n iter[lastPathItem] = DistModel.clone(baseValue);\n }\n\n if (!iter[\"@metadata\"]) {\n iter[\"@metadata\"] = {};\n }\n var metadata = iter[\"@metadata\"];\n var childrenProperties = metadata.properties;\n if (!childrenProperties) {\n childrenProperties = {};\n metadata.properties = childrenProperties;\n }\n var childProperties = childrenProperties[lastPathItem];\n if (!childProperties) {\n childProperties = {};\n childrenProperties[lastPathItem] = childProperties;\n }\n childProperties.changed = value;\n }\n }","function deepClone(obj) {\n return JSON.parse(JSON.stringify(obj));\n}","static setItem (path, value) {\n path = Store._validatePath(path)\n\n const lastValue = (value !== undefined || value !== null) ? Store._createPath(Store.store, path, value) : Store._createPath(Store.store, path)\n\n Store._storeToLocalStorage()\n\n return lastValue\n }","setPath(object, path, value) {\n if (object == null) return object\n const steps = spellCore.splitPath(path)\n if (!steps) return undefined\n let target = object\n // go right up to the penultimate item\n if (steps.length > 1) {\n for (let i = 0; i < steps.length - 1; i++) {\n const key = steps[i]\n if (target[key] == null) {\n if (typeof steps[i + 1] === \"number\") target[key] = []\n else target[key] = {}\n }\n if (typeof key === \"number\" && typeof target.getItem === \"function\") target = target.getItem(key)\n else target = target[key]\n }\n }\n const key = steps[steps.length - 1]\n if (typeof key === \"number\" && typeof target.setItem === \"function\") {\n target.setItem(key, value)\n } else if (value === undefined) {\n target[key] = undefined\n delete target[key]\n } else {\n target[key] = value\n }\n return value\n }","function safeAccess(obj, path) {\n var undefinedType = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : undefined;\n\n if (!obj) return undefinedType;\n var compositePaths = path.split('.');\n var movingReference = obj;\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = compositePaths[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var subpath = _step.value;\n\n // console.log(`path:${path} paths:${compositePaths} subpath:${subpath} movingReference:${inspect(movingReference,false,0)} movingReference.subpath:${inspect(movingReference[subpath], false, 0)}`)\n if (movingReference[subpath] !== undefined) movingReference = movingReference[subpath];else return undefinedType;\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n ;\n return movingReference;\n}","function clone(val) {\n var trace = {\n objects: [],\n values: []\n };\n return doClone(trace, val);\n\n /**\n * Clones the given value.\n * @param trace An internal property used to prevent circular objects\n * from causing issues.\n * @param val The value to clone.\n */\n function doClone(trace, val) {\n var vt, prop, res, idx;\n\n // Prevent recursive processing.\n idx = trace.objects.indexOf(val);\n if (idx > -1) {\n return trace.values[idx];\n }\n\n vt = typeOf(val);\n switch (vt) {\n case 'object':\n res = {};\n traceAdd(val, res);\n for (prop in val) {\n if (val.hasOwnProperty(prop)) {\n res[prop] = doClone(trace, val[prop]);\n }\n }\n return res;\n case 'function':\n res = copy(val);\n traceAdd(val, res);\n for (prop in val) {\n /* istanbul ignore else */\n if (val.hasOwnProperty(prop)) {\n res[prop] = doClone(trace, val[prop]);\n }\n }\n return res;\n case 'array':\n res = val.map(clone.bind(null, trace));\n return res;\n // Shallow\n case 'regexp':\n case 'date':\n return copy(val);\n case 'string':\n case 'number':\n case 'boolean':\n case 'nan':\n case 'null':\n case 'undefined':\n return val;\n default:\n throw new Error(\n format('Unrecognized typeOf return value \"{0}\"', vt)\n );\n }\n\n /**\n * Adds to the trace\n * @param obj The value we are cloning.\n * @param val The resulting value which the properties\n * will be cloned onto.\n */\n function traceAdd(obj, val) {\n trace.objects.push(obj);\n trace.values.push(val);\n }\n }\n }","function deepCopy(value) {\r\n return deepExtend(undefined, value);\r\n}","function deepCopy(value) {\r\n return deepExtend(undefined, value);\r\n}","function deepClone(object) {\n return JSON.parse(JSON.stringify(object));\n}","function setNestedObject(o, key, value) {\n if (key.indexOf('.') < 0) {\n if (typeof o === 'object') {\n o[key] = value;\n }\n return;\n }\n\n var pList = key.split('.');\n var len = pList.length;\n\n for(var i = 0; i < len-1; i += 1) {\n let elem = pList[i];\n if(!o[elem]) o[elem] = {}\n o = o[elem];\n }\n\n return o[pList[len-1]] = value;\n}","setRecursion(value) {\n this.value = value;\n this.children.forEach((child) => {\n child.setRecursion(value);\n });\n }","function exem(o, path, value) {\n if (absenty(o)) return;\n\n var props = path.split('.');\n var currentValue = o[props[0]];\n\n if (value && props.length === 1) {\n o[props[0]] = value;\n return;\n }\n \n if (!value && props.length === 1) return currentValue;\n return exem(currentValue, props.slice(1).join('.'), value);\n}","function deepCopy(value) {\n return deepExtend(undefined, value);\n}","function deepCopy(value) {\n return deepExtend(undefined, value);\n}","function deepCopy(value) {\n return deepExtend(undefined, value);\n}","function deepCopy(value) {\n return deepExtend(undefined, value);\n}","function deepCopy(value) {\n return deepExtend(undefined, value);\n}"],"string":"[\n \"function setIn(obj, path, value) {\\n var res = clone(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = toPath(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = clone(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setIn(obj, path, value) {\\n var res = lodash_es_clone(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = lodash_es_toPath(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (formik_esm_isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = lodash_es_clone(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setIn(obj, path, value) {\\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setIn(obj, path, value) {\\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setIn(obj, path, value) {\\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setIn(obj, path, value) {\\n var res = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(obj); // this keeps inheritance when obj is a class\\n\\n var resVal = res;\\n var i = 0;\\n var pathArray = Object(lodash_es_toPath__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(path);\\n\\n for (; i < pathArray.length - 1; i++) {\\n var currentPath = pathArray[i];\\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\\n\\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\\n resVal = resVal[currentPath] = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(currentObj);\\n } else {\\n var nextPath = pathArray[i + 1];\\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\\n }\\n } // Return original object if new value is the same as current\\n\\n\\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\\n return obj;\\n }\\n\\n if (value === undefined) {\\n delete resVal[pathArray[i]];\\n } else {\\n resVal[pathArray[i]] = value;\\n } // If the path array has a single element, the loop did not run.\\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\\n\\n\\n if (i === 0 && value === undefined) {\\n delete res[pathArray[i]];\\n }\\n\\n return res;\\n}\",\n \"function setDeepValue(obj, path, value) {\\n if (typeof path === 'string') {\\n path = path.split('.');\\n }\\n if (path.length > 1) {\\n const e = path.shift();\\n setDeepValue(obj[e] = Object.prototype.toString.call(obj[e]) === '[object Object]' ? obj[e] : {}, path, value);\\n }\\n else {\\n obj[path[0]] = value;\\n }\\n}\",\n \"function lazyImmutableDeepSet(target, original, path, value) {\\n if (!path.length)\\n return value;\\n var parentNode;\\n var targetNode = target;\\n var originalNode = original;\\n // We assume that the last path component is the key of a value; not a\\n // container, so we stop there.\\n for (var i = 0; i < path.length; i++) {\\n var key = path[i];\\n // If the target still references the original's objects, we need to diverge\\n if (!targetNode || targetNode === originalNode) {\\n if (typeof key === 'number') {\\n targetNode = originalNode ? tslib_1.__spread(originalNode) : [];\\n }\\n else if (typeof key === 'string') {\\n targetNode = originalNode ? tslib_1.__assign({}, originalNode) : {};\\n }\\n else {\\n throw new Error(\\\"Unknown path type \\\" + JSON.stringify(key) + \\\" in path \\\" + JSON.stringify(path) + \\\" at index \\\" + i);\\n }\\n if (i === 0) {\\n // Make sure we have a reference to the new target. We can keep the\\n // reference here because \\\"target\\\" is pointing as currentNode.data.\\n target = targetNode;\\n }\\n else {\\n parentNode[path[i - 1]] = targetNode;\\n }\\n }\\n // Regardless, we keep walking deeper.\\n parentNode = targetNode;\\n targetNode = targetNode[key];\\n originalNode = originalNode && originalNode[key];\\n }\\n // Finally, set the value in our previously or newly cloned target.\\n parentNode[path[path.length - 1]] = value;\\n return target;\\n}\",\n \"function setPath(obj, value, path) {\\n var keys = path.split('.');\\n var ret = obj;\\n var lastKey = keys[keys.length -1];\\n var target = ret;\\n\\n var parentPathKeys = keys.slice(0, keys.length -1);\\n parentPathKeys.forEach(function(key) {\\n if (!target.hasOwnProperty(key)) {\\n target[key] = {};\\n }\\n target = target[key];\\n });\\n\\n target[lastKey] = value;\\n return ret;\\n }\",\n \"function setPath(obj, value, path) {\\n var keys = path.split('.');\\n var ret = obj;\\n var lastKey = keys[keys.length - 1];\\n var target = ret;\\n var parentPathKeys = keys.slice(0, keys.length - 1);\\n parentPathKeys.forEach(function (key) {\\n if (!target.hasOwnProperty(key)) {\\n target[key] = {};\\n }\\n target = target[key];\\n });\\n target[lastKey] = value;\\n return ret;\\n }\",\n \"function setPath(obj, value, path) {\\n var keys = path.split('.');\\n var ret = obj;\\n var lastKey = keys[keys.length - 1];\\n var target = ret;\\n var parentPathKeys = keys.slice(0, keys.length - 1);\\n parentPathKeys.forEach(function (key) {\\n if (!target.hasOwnProperty(key)) {\\n target[key] = {};\\n }\\n target = target[key];\\n });\\n target[lastKey] = value;\\n return ret;\\n }\",\n \"function setPropFromPath(obj, path, value) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') {\\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\\n\\n objRef = objRef[keys[i]];\\n }\\n }\\n\\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\\n }\",\n \"function setPropFromPath(obj, path, value) {\\n var keys = path.split('.');\\n var targetKey = keys.pop();\\n var objRef = obj;\\n\\n for (var i in keys) {\\n if (typeof objRef === 'object') {\\n if (typeof objRef[keys[i]] === 'undefined' || objRef[keys[i]] === null) { objRef[keys[i]] = {}; }\\n\\n objRef = objRef[keys[i]];\\n }\\n }\\n\\n if (typeof objRef === 'object') { objRef[targetKey] = value; }\\n }\",\n \"function setInObj(obj, keyPath, value){\\n var currPath = obj;\\n var path = keyPath.split('.');\\n console.log('path from keyPath: ' + path);\\n for(var i=0; i < path.length-1; i++){\\n console.log('path chunk: ' + path[i]);\\n if (typeof(currPath[ path[i] ]) !== \\\"undefined\\\") {\\n console.log('path chunk exist: ' + currPath[ path[i] ]);\\n currPath = currPath[ path[i] ];\\n //console.log(obj); // DEBUG\\n //console.log(currPath); // DEBUG\\n } else {\\n //console.log('path added: ' + currPath[ path[i] ]);\\n currPath[ path[i] ] = {};\\n currPath = currPath[ path[i] ];\\n //console.log(obj); // DEBUG\\n //console.log(currPath); // DEBUG\\n }\\n }\\n //currPath = value; // not working ?\\n currPath[ path[ path.length-1 ] ] = value;\\n}\",\n \"function setNestedProperty(path, value, obj) {\\n\\t\\t\\tvar schema = obj || dataService.data;\\n\\t\\t\\tvar pList = path.replace(/\\\\]/g, '').split(/\\\\.|\\\\[/);\\n\\t\\t\\tvar len = pList.length;\\n\\t\\t\\tfor (var i = 0; i < len - 1; i++) {\\n\\t\\t\\t\\tvar elem = pList[i];\\n\\t\\t\\t\\tif (!schema[elem])\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\tschema = schema[elem];\\n\\t\\t\\t}\\n\\t\\t\\tschema[pList[len - 1]] = value;\\n\\t\\t}\",\n \"set(path, value) {\\n if (typeof path === \\\"object\\\") {\\n iterateObject(path, (val, n) => {\\n setValue(this.data, n, val)\\n });\\n } else {\\n setValue(this.data, path, value);\\n }\\n return this;\\n }\",\n \"_createNestedObjectRecursive(obj, path, value) {\\n if (path.length === 0) {\\n return;\\n }\\n if ((!Object.prototype.hasOwnProperty.call(obj, path[0]) && !obj[path[0]]) || typeof obj[path[0]] !== 'object') {\\n obj[path[0]] = path.length === 1 && value ? value : {};\\n }\\n return this._createNestedObjectRecursive(obj[path[0]], path.slice(1), value);\\n }\",\n \"static _assignValue(path, value, object) {\\n object = object || ApplicationState._state;\\n\\n const nodes = ApplicationState.walk(path);\\n\\n for (let index = 0; index < nodes.length; index++) {\\n const node = nodes[index];\\n switch (node.type) {\\n case 'object':\\n if (typeof object[node.name] === 'undefined') {\\n object[node.name] = {};\\n }\\n object = object[node.name];\\n break;\\n case 'array':\\n if (typeof object[node.name] === 'undefined') {\\n object[node.name] = [];\\n }\\n object = object[node.name];\\n break;\\n case 'leaf':\\n return object[node.name] = value;\\n break;\\n }\\n }\\n\\n throw Error(\\\"We should have returned after setting the value.\\\");\\n }\",\n \"_pathSet(path, value) {\\n let obj = this.fieldNode; // we set the values relative to the fieldnode, so fieldnode is the root\\n const parts = path.split('.');\\n while (parts.length > 1) {\\n const key = parts.shift();\\n // create if not exist\\n if (!(key in obj)) {\\n obj[key] = {};\\n }\\n obj = obj[key];\\n }\\n obj[parts.shift()] = value;\\n }\",\n \"function _set(obj, keypath, value, hook) {\\n var parts = _keyPathNormalize(keypath).split('.')\\n var last = parts.pop()\\n var dest = obj\\n parts.forEach(function(key) {\\n // Still set to non-object, just throw that error\\n dest = dest[key]\\n })\\n if (hook) {\\n // hook proxy set value\\n hook(dest, last, value)\\n } else {\\n dest[last] = value\\n }\\n return obj\\n}\",\n \"set(path, value) {\\n if (typeof path === 'string') {\\n let array = path.split('.');\\n return this.set(array, value);\\n }\\n let data = this.data;\\n let len = path ? path.length : 0;\\n let i;\\n for (i = 0; i < len - 1; i++) {\\n let segment = path[i];\\n let next = data[segment];\\n if (!next)\\n break;\\n data = next;\\n }\\n // Add missing objects\\n for (; i < len - 1; i++) {\\n let segment = path[i];\\n data = data[segment] = {};\\n }\\n if (data) {\\n let segment = path[path.length - 1];\\n data[segment] = value;\\n }\\n return this;\\n \\n }\",\n \"function put(obj, path, value, opt_buildMissingPath) {\\r\\n path = typeOf(path, 'String') ? path.split('.') : path;\\r\\n \\r\\n for (var name, i = 0, e = path.length - 1; (name = path[i], i < e); i++) {\\r\\n if (obj[name] == undefined) {\\r\\n if (!opt_buildMissingPath) {\\r\\n throw new ReferenceError(\\\"Path couldn't be followed: \\\" + slice(path, 0, i + 1).join('.'));\\r\\n }\\r\\n obj[name] = {};\\r\\n }\\r\\n obj = obj[name];\\r\\n }\\r\\n \\r\\n if (e < 0) {\\r\\n throw new ReferenceError('Path must be specified.');\\r\\n }\\r\\n \\r\\n var oldValue = obj[name];\\r\\n obj[name] = value;\\r\\n return oldValue;\\r\\n }\",\n \"function dynamicSetNestedProperty(path, value, obj) {\\n\\t\\t\\tvar schema = obj || dataService.data;\\n\\t\\t\\tvar pList = path.replace(/\\\\]/g, '').split(/\\\\.|\\\\[/);\\n\\t\\t\\tvar len = pList.length;\\n\\t\\t\\tfor (var i = 0; i < len - 1; i++) {\\n\\t\\t\\t\\tvar elem = pList[i];\\n\\t\\t\\t\\tif (!schema[elem]) schema[elem] = {}\\n\\t\\t\\t\\tschema = schema[elem];\\n\\t\\t\\t}\\n\\t\\t\\tschema[pList[len - 1]] = value;\\n\\t\\t}\",\n \"function _set(obj, keypath, value) {\\n\\t var parts = _keyPathNormalize(keypath).split('.')\\n\\t var last = parts.pop()\\n\\t var dest = obj\\n\\t var hasError\\n\\t var errorInfo\\n\\t util.some(parts, function(key) {\\n\\t var t = util.type(dest)\\n\\t if (t != 'object' && t != 'array') {\\n\\t hasError = true\\n\\t errorInfo = [key, dest]\\n\\t return true\\n\\t }\\n\\t dest = dest[key]\\n\\t })\\n\\t // set value\\n\\t if (!hasError) {\\n\\t if (util.type(dest) != 'object' && util.type(dest) != 'array') {\\n\\t hasError = true\\n\\t errorInfo = [last, dest]\\n\\t } else {\\n\\t dest[last] = value\\n\\t return obj\\n\\t }\\n\\t }\\n\\t throw new Error('Can\\\\' not access \\\"' + errorInfo[0] + '\\\" of \\\"'+ errorInfo[1] + '\\\" when set value of \\\"' + keypath + '\\\"')\\n\\t}\",\n \"function set(obj, path, value) {\\n\\n\\tvar keys = path.split(\\\".\\\");\\n\\n\\tkeys.forEach(function(key, index) {\\n\\t\\tif(index === keys.length-1) {\\n\\t\\t\\tobj[key] = value;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tobj = obj[key];\\n\\t\\t}\\n\\t});\\n}\",\n \"function setPropertyByPath(obj, path, value, throwErr) {\\n if (throwErr === void 0) { throwErr = true; }\\n var objPath = getObjectPath(path);\\n var obj = getPropertyByPath(obj, objPath, throwErr);\\n var propName = getPropertyName(path);\\n // TODO: Allow adding properties?\\n if (!(propName in obj) && throwErr) {\\n throw new Error(xp.formatString('Unable to set property value \\\"{0}\\\" by path \\\"{1}\\\". Property is unreachable.', value, path));\\n }\\n obj[propName] = value;\\n }\",\n \"function setValueByPath(o, path, val) {\\n var len = path.length - 1,\\n s = o;\\n if (len >= 0) {\\n for (var i = 0; i < len; i++) {\\n o = o[path[i]];\\n }\\n if (o !== undefined) {\\n o[path[i]] = val;\\n } else {\\n s = undefined;\\n }\\n }\\n return s;\\n }\",\n \"function setNestedObjectValues(object,value,visited,response){if(visited===void 0){visited=new WeakMap();}if(response===void 0){response={};}for(var _i=0,_Object$keys=Object.keys(object);_i<_Object$keys.length;_i++){var k=_Object$keys[_i];var val=object[k];if(isObject$2(val)){if(!visited.get(val)){visited.set(val,true);// In order to keep array values consistent for both dot path and\\n// bracket syntax, we need to check if this is an array so that\\n// this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\nresponse[k]=Array.isArray(val)?[]:{};setNestedObjectValues(val,value,visited,response[k]);}}else {response[k]=value;}}return response;}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function setNestedObjectValues(object, value, visited, response) {\\n if (visited === void 0) {\\n visited = new WeakMap();\\n }\\n\\n if (response === void 0) {\\n response = {};\\n }\\n\\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\\n var k = _Object$keys[_i];\\n var val = object[k];\\n\\n if (formik_esm_isObject(val)) {\\n if (!visited.get(val)) {\\n visited.set(val, true); // In order to keep array values consistent for both dot path and\\n // bracket syntax, we need to check if this is an array so that\\n // this will output { friends: [true] } and not { friends: { \\\"0\\\": true } }\\n\\n response[k] = Array.isArray(val) ? [] : {};\\n setNestedObjectValues(val, value, visited, response[k]);\\n }\\n } else {\\n response[k] = value;\\n }\\n }\\n\\n return response;\\n}\",\n \"function updateObject(object, newValue, path){\\n var stack = path.split('.');\\n while(stack.length>1){object = object[stack.shift()];}\\n object[stack.shift()] = newValue;\\n }\",\n \"function writeDeepPath(obj, path, val,ds) {\\n\\t\\tif(typeof path !== 'string') return;\\n\\n\\t\\tvar paths = path.split('.'),\\n\\t\\t\\tlen = paths.length,\\n\\t\\t\\ttotal = len - 1,\\n\\t\\t\\tdata = obj;\\n\\t\\tif(!len) return;\\n\\t\\tfor(var i = 0; i < len; i++) {\\n\\t\\t\\tif (i< total && data[paths[i]]===undefined) data[paths[i]] = {};\\n\\t\\t\\tif(i < total) data = data[paths[i]];\\n\\t\\t\\telse data[paths[i]] = val;\\n\\t\\t}\\n\\t}\",\n \"function coerce (type, obj, path, value) {\\n if (isNil(path)) return;\\n\\n // Turn positive integer into string\\n if (isPositiveInteger(path)) path = String(path);\\n\\n // Parse string path into an array\\n if (isString(path)) {\\n path = compact(path.trim().split(SEPERATOR));\\n }\\n\\n // Return if path is invalid\\n if (!path || !isArray(path) || path.length === 0) return;\\n\\n // Copy array for future use\\n path = path.slice();\\n\\n // Shift the first path value\\n var key = path.shift();\\n\\n // Return `undefined` if obj is `NaN` or `null` or `undefined`\\n if (isNil(obj)) return;\\n\\n switch (type) {\\n case 'get':\\n if (path.length === 0) {\\n return obj[key];\\n }\\n break;\\n case 'set':\\n if (path.length) {\\n if (typeof obj[key] === 'undefined') {\\n obj[key] = {};\\n }\\n\\n if (isNil(obj[key])) return false;\\n } else {\\n obj[key] = value;\\n return true;\\n }\\n break;\\n case 'remove':\\n if (path.length === 0) {\\n\\n if (isArray(obj) && isPositiveInteger(key)) {\\n key = Number(key);\\n\\n if (obj.length - 1 < key) return false;\\n\\n obj.splice(key, 1);\\n } else {\\n if (!Object.hasOwnProperty.call(obj, key)) return false;\\n\\n delete obj[key];\\n }\\n\\n return true;\\n }\\n break;\\n case 'exists':\\n if (path.length === 0) {\\n if (isArray(obj) && isPositiveInteger(key)) {\\n key = Number(key);\\n return obj.length - 1 >= key;\\n } else {\\n return Object.hasOwnProperty.call(obj, key);\\n }\\n }\\n break;\\n default:\\n return;\\n }\\n\\n return coerce(type, obj[key], path, value);\\n}\",\n \"function setValue(obj, keyPath, value) {\\n let keys = keyPath.split(\\\".\\\");\\n\\n while (keys.length > 0) {\\n // Set value for the last key\\n if (keys.length === 1) {\\n obj[keys.shift()] = value;\\n return;\\n }\\n\\n const key = keys.shift();\\n\\n if (obj[key] != null) {\\n obj = obj[key];\\n } else {\\n obj = obj[key] = {};\\n }\\n }\\n}\",\n \"function put (obj, key, value, path = []) {\\n if (!isObject(value)) {\\n // if we are overriding an existing object,\\n // record deletion\\n if (isObject(obj[key])) {\\n // recursively delete object props\\n del(obj, key)\\n }\\n\\n // record parent object update\\n let parent = baseObject(obj)\\n parent[key] = baseObject(value)\\n recordMutation('put', path, parent)\\n return\\n }\\n\\n // if we are overriding an existing non-object,\\n // record update of parent base object\\n if (key in obj && !isObject(obj[key])) {\\n let base = baseObject(obj)\\n delete base[key]\\n recordMutation('put', path, base)\\n }\\n\\n // if parent is array, ensure length gets updated\\n if (Array.isArray(obj)) {\\n let parent = baseObject(obj)\\n recordMutation('put', path, parent)\\n }\\n\\n let base = baseObject(value)\\n recordMutation('put', path.concat(key), base)\\n\\n for (let childKey in value) {\\n let child = value[childKey]\\n\\n // if any of our non-object children override an\\n // existing object, then record deletion\\n if (!isObject(child)) {\\n if (!isObject(obj[key])) continue\\n if (!isObject(obj[key][childKey])) continue\\n del(obj[key], childKey, path.concat(key))\\n continue\\n }\\n\\n // recursively record puts for objects\\n put(value, childKey, child, path.concat(key))\\n }\\n }\",\n \"setDepth(obj, path, value) {\\n obj = obj || {};\\n let tags = path.split(\\\".\\\").reverse();\\n\\n obj[tags.shift()] = value;\\n\\n for (let tag of tags) {\\n let _obj = Object.assign({}, obj);\\n obj = {[tag]: _obj};\\n }\\n return obj;\\n }\",\n \"function remove(obj, path) {\\n if (obj.toJSON) {\\n // We need to get the JSON form of the object before recursing.\\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#toJSON()_behavior\\n obj = obj.toJSON();\\n }\\n if (Array.isArray(obj)) {\\n var is_cloned = false;\\n for (var i = 0; i < obj.length; i++) {\\n var value = obj[i];\\n if (value) {\\n if (value instanceof ArrayBuffer || ArrayBuffer.isView(value)) {\\n if (!is_cloned) {\\n obj = obj.slice();\\n is_cloned = true;\\n }\\n buffers.push(ArrayBuffer.isView(value) ? value.buffer : value);\\n buffer_paths.push(path.concat([i]));\\n // easier to just keep the array, but clear the entry, otherwise we have to think\\n // about array length, much easier this way\\n obj[i] = null;\\n }\\n else {\\n var new_value = remove(value, path.concat([i]));\\n // only assigned when the value changes, we may serialize objects that don't support assignment\\n if (new_value !== value) {\\n if (!is_cloned) {\\n obj = obj.slice();\\n is_cloned = true;\\n }\\n obj[i] = new_value;\\n }\\n }\\n }\\n }\\n }\\n else if (isPlainObject(obj)) {\\n for (var key in obj) {\\n var is_cloned = false;\\n if (obj.hasOwnProperty(key)) {\\n var value = obj[key];\\n if (value) {\\n if (value instanceof ArrayBuffer || ArrayBuffer.isView(value)) {\\n if (!is_cloned) {\\n obj = __assign({}, obj);\\n is_cloned = true;\\n }\\n buffers.push(ArrayBuffer.isView(value) ? value.buffer : value);\\n buffer_paths.push(path.concat([key]));\\n delete obj[key]; // for objects/dicts we just delete them\\n }\\n else {\\n var new_value = remove(value, path.concat([key]));\\n // only assigned when the value changes, we may serialize objects that don't support assignment\\n if (new_value !== value) {\\n if (!is_cloned) {\\n obj = __assign({}, obj);\\n is_cloned = true;\\n }\\n obj[key] = new_value;\\n }\\n }\\n }\\n }\\n }\\n }\\n return obj;\\n }\",\n \"setIn(path, value) {\\n if (isEmptyPath(path))\\n this.contents = value;\\n else if (this.contents == null) {\\n this.contents = collectionFromPath(this.schema, Array.from(path), value);\\n }\\n else if (assertCollection(this.contents)) {\\n this.contents.setIn(path, value);\\n }\\n }\",\n \"function patchValueAlreadyInPath(root, patch) {\\n var ancestors = [root];\\n patch.path.reduce(function (parent, p) {\\n ancestors.push(parent[p]);\\n return parent[p];\\n }, root);\\n return pointToAncestor(patch.value);\\n\\n function pointToAncestor(obj) {\\n return ___WEBPACK_IMPORTED_MODULE_12__[\\\"default\\\"].isObject(obj) && (ancestors.indexOf(obj) >= 0 || _babel_runtime_corejs3_core_js_stable_object_keys__WEBPACK_IMPORTED_MODULE_6___default()(obj).some(function (k) {\\n return pointToAncestor(obj[k]);\\n }));\\n }\\n}\",\n \"function setObjectValue(obj, attribute, value) {\\n // Reference to return\\n var reference = obj;\\n\\n if (attribute.indexOf('.') >= 0) {\\n // Handle dotted path\\n var path = attribute.split('.');\\n\\n while (path.length > 1) {\\n var shift = path.shift();\\n\\n // If not exists, create it\\n if (!obj[shift]) {\\n obj[shift] = {};\\n }\\n\\n obj = obj[shift];\\n }\\n\\n obj[path.shift()] = value;\\n } else {\\n // Handle simple path\\n obj[attribute] = value;\\n }\\n\\n return reference;\\n}\",\n \"function setProperty(path, obj, val) {\\n var parts = path.split('.'),\\n last = parts.pop(),\\n part;\\n\\n /* jshint boss: true */\\n while (part = parts.shift()) { // assignment\\n // rewrite property if it exists but is not an object\\n obj = obj[part] = obj[part] instanceof Object ?\\n obj[part] : {};\\n }\\n\\n obj[last] = val;\\n}\",\n \"function patchValueAlreadyInPath(root, patch) {\\n var ancestors = [root];\\n patch.path.reduce(function (parent, p) {\\n ancestors.push(parent[p]);\\n return parent[p];\\n }, root);\\n return pointToAncestor(patch.value);\\n\\n function pointToAncestor(obj) {\\n return ___WEBPACK_IMPORTED_MODULE_12__.default.isObject(obj) && (ancestors.indexOf(obj) >= 0 || _babel_runtime_corejs3_core_js_stable_object_keys__WEBPACK_IMPORTED_MODULE_6___default()(obj).some(function (k) {\\n return pointToAncestor(obj[k]);\\n }));\\n }\\n}\",\n \"function subPointer(path) {\\n\\n return {\\n\\n _refresh: function() {\\n var current = util.pick(root.data, path) \\n this._previous = this._current\\n this._current = current\\n },\\n \\n isChanged: function() { return this._previous !== this._current },\\n\\n refine: function(ext) {\\n var newPath = path.concat(typeof ext == 'string' ? ext.split('.') : ext)\\n var newPathString = newPath.join('.')\\n var existing = root.subs[newPathString]\\n var sub = existing || (root.subs[newPathString] = subPointer(newPath))\\n !existing && sub._refresh()\\n return sub\\n },\\n \\n fromRoot: function(ext) {\\n return root.refine(ext)\\n },\\n\\n deref: function(orDefault) {\\n return typeof this._current !== 'undefined' ? this._current : orDefault\\n },\\n\\n update: function(delta) {\\n var deltaForRoot = util.nest(path, delta)\\n var newData = React.addons.update(root.data, deltaForRoot)\\n root.swap(newData)\\n },\\n\\n get: function(path) {\\n return util.pick(this.deref(), path)\\n },\\n\\n set: function(val) {\\n return this.update({ $set: val })\\n }\\n }\\n }\",\n \"setIn(path, value) {\\n if (Collection.isEmptyPath(path)) {\\n // @ts-expect-error We can't really know that this matches Contents.\\n this.contents = value;\\n }\\n else if (this.contents == null) {\\n // @ts-expect-error We can't really know that this matches Contents.\\n this.contents = Collection.collectionFromPath(this.schema, Array.from(path), value);\\n }\\n else if (assertCollection(this.contents)) {\\n this.contents.setIn(path, value);\\n }\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function deepGet(obj, path) {\\n var length = path.length;\\n for (var i = 0; i < length; i++) {\\n if (obj == null) return void 0;\\n obj = obj[path[i]];\\n }\\n return length ? obj : void 0;\\n }\",\n \"function objectSet (label, value) {\\n if(o) {\\n o[label] = value;\\n }\\n var newPath = self.makeObjectPath(path, label);\\n var handled = self.emitValue(newPath, value);\\n if(!handled && typeof dispose == 'function') {\\n dispose();\\n }\\n return newPath;\\n }\",\n \"function cloneDeep(value) {\\n return _.cloneDeep(value);\\n}\",\n \"function Data(root, refPath, value, ensurePathValid) {\\n root = root || Store;\\n var toSet = arguments.length >= 3 && value !== __;\\n var v = root;\\n // var proppath = fullpathOf(null, root);\\n var paths = [];\\n if (refPath) paths = splitPath(refPath);\\n var parent;\\n var prop;\\n\\n while (paths.length) {\\n if (ensurePathValid && v == null) {\\n parent[prop] = {};\\n } else if (Util.isBasic(v)) {\\n return undefined;\\n }\\n prop = paths.shift();\\n // proppath += (proppath === '' ? '' : '.') + prop;\\n if (toSet && paths.length === 0) { /* set */\\n if (Util.isInstance(v, OArray) &&\\n !(Util.isObject(v[prop]) && Util.isObject(value))) {\\n v.set(prop, value);\\n } else {\\n v[prop] = Util.extend(v[prop], value);\\n }\\n } else { /* get */\\n parent = v;\\n v = v[prop];\\n }\\n }\\n return toSet ? v[prop] : v;\\n}\",\n \"function cloneDeep$2(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep$2(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep$2(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"setObjectWithNestedKey(obj, key, value) {\\n\\n if(key.indexOf(\\\".\\\")) {\\n // Need to deal with arrays\\n var keys = key.split(\\\".\\\");\\n var lastHash = keys.pop();\\n for(var i = 0; i < keys.length; i++) {\\n let keyPointer = keys[i];\\n\\n if(_.isString(keyPointer) && keyPointer.indexOf(\\\"[\\\") === 0) {\\n keyPointer = keyPointer.replace(\\\"[\\\", \\\"\\\").replace(\\\"]\\\", \\\"\\\");\\n keyPointer = parseInt(keyPointer, 10);\\n }\\n\\n if(!_.has(obj, keyPointer) || !_.isObject(obj[keyPointer])) {\\n\\n var newObj = {};\\n var nextKey = i + 1;\\n\\n if(keys.length > nextKey && _.isString(keys[nextKey]) && keys[nextKey].indexOf(\\\"[\\\") === 0) {\\n newObj = [];\\n }\\n\\n\\n obj[keyPointer] = newObj;\\n\\n }\\n\\n obj = obj[keyPointer];\\n }\\n\\n //obj[lastHash] = {};\\n key = lastHash;\\n }\\n\\n obj[key] = value;\\n\\n\\n return true;\\n }\",\n \"setValue(_value) {\\n if (this.isntUndefined(_value) && this.isValueObject(this.valueObj) && this.valueDiffers(_value)) {\\n this.__value = _value;\\n if (this.isObjectOrArray(_value)) {\\n this.valueObj.set(this.cloneObject(_value));\\n }\\n else {\\n this.valueObj.set(_value);\\n }\\n if (this.isFunction(this.refresh)) {\\n this.refresh();\\n }\\n else if (this.isFunction(this.refreshValue)) {\\n this.refreshValue();\\n }\\n }\\n }\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) { return cloneDeep(item); });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function updateIn(rootVal, paths, f) {\\n\\t for (var _len3 = arguments.length, args = Array(_len3 > 3 ? _len3 - 3 : 0), _key3 = 3; _key3 < _len3; _key3++) {\\n\\t args[_key3 - 3] = arguments[_key3];\\n\\t }\\n\\t\\n\\t var ff = function ff(v) {\\n\\t return f.apply(null, [v].concat(args));\\n\\t };\\n\\t\\n\\t var newRootVal;\\n\\t if (paths.length > 0) {\\n\\t var command = rootAt(paths, { $apply: ff });\\n\\t newRootVal = (0, _reactAddonsUpdate2.default)(rootVal, command);\\n\\t } else if (paths.length === 0) {\\n\\t newRootVal = ff(rootVal);\\n\\t }\\n\\t\\n\\t // would be better to do this valEq check on just the leaf\\n\\t return (0, _deepEqual2.default)(rootVal, newRootVal) ? rootVal // preserve === if same value\\n\\t : newRootVal;\\n\\t}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) {\\n return cloneDeep(item);\\n });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function cloneDeep(value) {\\n // If the value is an array, create a new array where every item has been cloned.\\n if (Array.isArray(value)) {\\n return value.map(function (item) {\\n return cloneDeep(item);\\n });\\n }\\n // If the value is an object, go through all of the object’s properties and add them to a new\\n // object.\\n if (value !== null && typeof value === 'object') {\\n var nextValue = {};\\n for (var key in value) {\\n if (value.hasOwnProperty(key)) {\\n nextValue[key] = cloneDeep(value[key]);\\n }\\n }\\n return nextValue;\\n }\\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\\n // directly.\\n return value;\\n}\",\n \"function fastpathSet(obj, name) {\\n if (name === 'toString') { fail(\\\"internal: Can't fastpath .toString\\\"); }\\n if (isFrozen(obj)) {\\n fail(\\\"Can't set .\\\", name, ' on frozen (', debugReference(obj), ')');\\n }\\n if (typeOf(obj) === 'function') {\\n fail(\\\"Can't make .\\\", name, \\n ' writable on a function (', debugReference(obj), ')');\\n }\\n fastpathEnum(obj, name);\\n fastpathRead(obj, name);\\n if (obj[name + '_canCall___']) {\\n obj[name + '_canCall___'] = false;\\n }\\n if (obj[name + '_grantCall___']) {\\n obj[name + '_grantCall___'] = false;\\n }\\n obj.SLOWFREEZE___ = obj;\\n obj[name + '_canSet___'] = obj;\\n }\",\n \"function set (path, value) {\\n let map = this._root\\n for (const item of path) {\\n let nextMap = map.get(item)\\n if (!nextMap) {\\n // Create next map if none exists\\n nextMap = new Map()\\n map.set(item, nextMap)\\n }\\n map = nextMap\\n }\\n\\n // Reached end of path. Set the data symbol to the given value, and\\n // increment size if nothing was here before.\\n if (!map.has(dataSymbol)) this._size += 1\\n map.set(dataSymbol, value)\\n return this\\n}\",\n \"function deepObjectAssignNonentry() {\\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\\n values[_key2] = arguments[_key2];\\n }\\n\\n if (values.length < 2) {\\n return values[0];\\n } else if (values.length > 2) {\\n var _context2;\\n\\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$3(values).call(values, 2))));\\n }\\n\\n var a = values[0];\\n var b = values[1];\\n\\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\\n _step;\\n\\n try {\\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\\n var prop = _step.value;\\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\\n delete a[prop];\\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \\\"object\\\" && _typeof_1(b[prop]) === \\\"object\\\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\\n } else {\\n a[prop] = clone(b[prop]);\\n }\\n }\\n } catch (err) {\\n _iterator.e(err);\\n } finally {\\n _iterator.f();\\n }\\n\\n return a;\\n}\",\n \"function deepObjectAssignNonentry() {\\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\\n values[_key2] = arguments[_key2];\\n }\\n\\n if (values.length < 2) {\\n return values[0];\\n } else if (values.length > 2) {\\n var _context2;\\n\\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$6(values).call(values, 2))));\\n }\\n\\n var a = values[0];\\n var b = values[1];\\n\\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\\n _step;\\n\\n try {\\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\\n var prop = _step.value;\\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\\n delete a[prop];\\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \\\"object\\\" && _typeof_1(b[prop]) === \\\"object\\\" && !isArray$3(a[prop]) && !isArray$3(b[prop])) {\\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\\n } else {\\n a[prop] = clone(b[prop]);\\n }\\n }\\n } catch (err) {\\n _iterator.e(err);\\n } finally {\\n _iterator.f();\\n }\\n\\n return a;\\n}\",\n \"function safeDeepClone(circularValue, refs, obj) {\\n var copy;\\n\\n // object is a false or empty value, or otherwise not an object\\n if (!obj || 'object' !== typeof obj || obj instanceof Error || obj instanceof ArrayBuffer || obj instanceof Blob || obj instanceof File) return obj;\\n\\n // Handle Date\\n if (obj instanceof Date) {\\n copy = new Date();\\n copy.setTime(obj.getTime());\\n return copy;\\n }\\n\\n // Handle Array - or array-like items\\n if (obj instanceof Array || obj.length) {\\n \\n refs.push(obj);\\n copy = [];\\n for (var i = 0, len = obj.length; i < len; i++) {\\n if (refs.indexOf(obj[i]) >= 0) {\\n copy[i] = circularValue;\\n } else {\\n copy[i] = safeDeepClone(circularValue, refs, obj[i]);\\n }\\n }\\n refs.pop();\\n return copy;\\n }\\n\\n // Handle Object\\n refs.push(obj);\\n\\n // Bring a long prototype\\n if (obj.constructor && obj.constructor !== Object) {\\n copy = Object.create(obj.constructor.prototype);\\n } else {\\n copy = {};\\n }\\n\\n for (var attr in obj) {\\n if (obj.hasOwnProperty(attr) && attr !== '$$hashKey') {\\n if (refs.indexOf(obj[attr]) >= 0) {\\n copy[attr] = circularValue;\\n } else {\\n copy[attr] = safeDeepClone(circularValue, refs, obj[attr]);\\n }\\n }\\n }\\n refs.pop();\\n return copy;\\n}\",\n \"function deepObjectAssignNonentry() {\\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\\n values[_key2] = arguments[_key2];\\n }\\n\\n if (values.length < 2) {\\n return values[0];\\n } else if (values.length > 2) {\\n var _context2;\\n\\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$4(values).call(values, 2))));\\n }\\n\\n var a = values[0];\\n var b = values[1];\\n\\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\\n _step;\\n\\n try {\\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\\n var prop = _step.value;\\n if (!Object.prototype.propertyIsEnumerable.call(b, prop)) ;else if (b[prop] === DELETE) {\\n delete a[prop];\\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \\\"object\\\" && _typeof_1(b[prop]) === \\\"object\\\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\\n } else {\\n a[prop] = clone(b[prop]);\\n }\\n }\\n } catch (err) {\\n _iterator.e(err);\\n } finally {\\n _iterator.f();\\n }\\n\\n return a;\\n}\",\n \"function wrap (obj, onMutate, path = []) {\\n function recordMutation (op, childPath, value) {\\n let fullPath = path.concat(childPath)\\n let oldValue\\n let existed = false\\n try {\\n [ oldValue, existed ] = access(obj, childPath)\\n } catch (err) {}\\n let mutation = {\\n op,\\n path: fullPath,\\n oldValue: baseObject(oldValue),\\n newValue: value,\\n existed\\n }\\n onMutate(mutation)\\n // TODO: replace mutations for overriden paths\\n }\\n\\n // TODO: wrap array methods to record array-specific mutations,\\n // otherwise ops like splices and shifts will create N mutations\\n\\n function put (obj, key, value, path = []) {\\n if (!isObject(value)) {\\n // if we are overriding an existing object,\\n // record deletion\\n if (isObject(obj[key])) {\\n // recursively delete object props\\n del(obj, key)\\n }\\n\\n // record parent object update\\n let parent = baseObject(obj)\\n parent[key] = baseObject(value)\\n recordMutation('put', path, parent)\\n return\\n }\\n\\n // if we are overriding an existing non-object,\\n // record update of parent base object\\n if (key in obj && !isObject(obj[key])) {\\n let base = baseObject(obj)\\n delete base[key]\\n recordMutation('put', path, base)\\n }\\n\\n // if parent is array, ensure length gets updated\\n if (Array.isArray(obj)) {\\n let parent = baseObject(obj)\\n recordMutation('put', path, parent)\\n }\\n\\n let base = baseObject(value)\\n recordMutation('put', path.concat(key), base)\\n\\n for (let childKey in value) {\\n let child = value[childKey]\\n\\n // if any of our non-object children override an\\n // existing object, then record deletion\\n if (!isObject(child)) {\\n if (!isObject(obj[key])) continue\\n if (!isObject(obj[key][childKey])) continue\\n del(obj[key], childKey, path.concat(key))\\n continue\\n }\\n\\n // recursively record puts for objects\\n put(value, childKey, child, path.concat(key))\\n }\\n }\\n\\n function del (obj, key, path = []) {\\n let value = obj[key]\\n\\n if (!isObject(obj[key])) {\\n // record parent object update\\n let parent = baseObject(obj)\\n delete parent[key]\\n recordMutation('put', path, parent)\\n return\\n }\\n\\n // recursively record deletions for objects\\n for (let childKey in value) {\\n let child = value[childKey]\\n if (!isObject(child)) continue\\n del(value, childKey, path.concat(key))\\n }\\n\\n recordMutation('del', path.concat(key))\\n }\\n\\n let wrapped = new Proxy(obj, {\\n // recursively wrap child objects when accessed\\n get (obj, key) {\\n let value = obj[key]\\n\\n // functions should be bound to parent\\n if (typeof value === 'function') {\\n return value.bind(wrapped)\\n }\\n\\n // don't recurse if not object\\n if (!isObject(value)) {\\n return value\\n }\\n\\n // convert array bases to actual array\\n if ('__MERK_ARRAY__' in value) {\\n let base = value\\n value = new Array(value.length)\\n Object.assign(value, base)\\n delete value.__MERK_ARRAY__\\n }\\n\\n // if value is object, recursively wrap\\n let childPath = path.concat(key)\\n return wrap(value, onMutate, childPath)\\n },\\n\\n // record mutations\\n set (obj, key, value) {\\n put(obj, key, value)\\n obj[key] = value\\n return true\\n },\\n\\n // record deletions as mutations too\\n deleteProperty (obj, key) {\\n if (!(key in obj)) return true\\n del(obj, key)\\n delete obj[key]\\n return true\\n },\\n\\n // ovverride ownKeys to exclude symbol properties\\n ownKeys () {\\n return Object.getOwnPropertyNames(obj)\\n }\\n })\\n return wrapped\\n}\",\n \"function clone(val, depth = 5) {\\n if (typeof val !== 'object') {\\n return val;\\n }\\n // If we're cloning an array, use an array as the base, otherwise use an object\\n const clonedObject = Array.isArray(val) ? [] : {};\\n for (const key in val) {\\n // Recursively clone eack item unless we're at the maximum depth\\n clonedObject[key] = depth <= 1 ? val[key] : (val[key] ? clone(val[key], depth - 1) : val[key]);\\n }\\n return clonedObject;\\n}\",\n \"setJsonDeep(target, keys, value) {\\n let origin = target;\\n keys = keys.split('.');\\n for (let key of keys) {\\n let last = key === keys[keys.length - 1];\\n if (typeof origin[key] === 'undefined' || !origin[key]) {\\n origin[key] = last ? value : {};\\n } else {\\n origin[key] = last ? value : origin[key];\\n }\\n origin = origin[key];\\n }\\n }\",\n \"function setPropertyChanged(params) {\\n var path = params.path;\\n var value = params.value;\\n\\n var root = _config;\\n var iter = root;\\n var pathArray = path.split(\\\".\\\");\\n\\n var i = 0;\\n while (iter && i < pathArray.length - 1) {\\n var pathItem = pathArray[i];\\n iter = iter[pathItem];\\n i++;\\n }\\n\\n if (iter && pathArray.length) {\\n var lastPathItem = pathArray[pathArray.length - 1];\\n\\n if (!value) {\\n if (pathArray.length < 3) {\\n return;\\n }\\n\\n var base = getBase({ path: path });\\n if (!base) {\\n return;\\n }\\n\\n var basePathArray = pathArray.slice(2);\\n var basePath = basePathArray.join(\\\".\\\");\\n var baseValue = getProperty({\\n path: basePath,\\n root: base\\n });\\n iter[lastPathItem] = DistModel.clone(baseValue);\\n }\\n\\n if (!iter[\\\"@metadata\\\"]) {\\n iter[\\\"@metadata\\\"] = {};\\n }\\n var metadata = iter[\\\"@metadata\\\"];\\n var childrenProperties = metadata.properties;\\n if (!childrenProperties) {\\n childrenProperties = {};\\n metadata.properties = childrenProperties;\\n }\\n var childProperties = childrenProperties[lastPathItem];\\n if (!childProperties) {\\n childProperties = {};\\n childrenProperties[lastPathItem] = childProperties;\\n }\\n childProperties.changed = value;\\n }\\n }\",\n \"function deepClone(obj) {\\n return JSON.parse(JSON.stringify(obj));\\n}\",\n \"static setItem (path, value) {\\n path = Store._validatePath(path)\\n\\n const lastValue = (value !== undefined || value !== null) ? Store._createPath(Store.store, path, value) : Store._createPath(Store.store, path)\\n\\n Store._storeToLocalStorage()\\n\\n return lastValue\\n }\",\n \"setPath(object, path, value) {\\n if (object == null) return object\\n const steps = spellCore.splitPath(path)\\n if (!steps) return undefined\\n let target = object\\n // go right up to the penultimate item\\n if (steps.length > 1) {\\n for (let i = 0; i < steps.length - 1; i++) {\\n const key = steps[i]\\n if (target[key] == null) {\\n if (typeof steps[i + 1] === \\\"number\\\") target[key] = []\\n else target[key] = {}\\n }\\n if (typeof key === \\\"number\\\" && typeof target.getItem === \\\"function\\\") target = target.getItem(key)\\n else target = target[key]\\n }\\n }\\n const key = steps[steps.length - 1]\\n if (typeof key === \\\"number\\\" && typeof target.setItem === \\\"function\\\") {\\n target.setItem(key, value)\\n } else if (value === undefined) {\\n target[key] = undefined\\n delete target[key]\\n } else {\\n target[key] = value\\n }\\n return value\\n }\",\n \"function safeAccess(obj, path) {\\n var undefinedType = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : undefined;\\n\\n if (!obj) return undefinedType;\\n var compositePaths = path.split('.');\\n var movingReference = obj;\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = compositePaths[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var subpath = _step.value;\\n\\n // console.log(`path:${path} paths:${compositePaths} subpath:${subpath} movingReference:${inspect(movingReference,false,0)} movingReference.subpath:${inspect(movingReference[subpath], false, 0)}`)\\n if (movingReference[subpath] !== undefined) movingReference = movingReference[subpath];else return undefinedType;\\n }\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n\\n ;\\n return movingReference;\\n}\",\n \"function clone(val) {\\n var trace = {\\n objects: [],\\n values: []\\n };\\n return doClone(trace, val);\\n\\n /**\\n * Clones the given value.\\n * @param trace An internal property used to prevent circular objects\\n * from causing issues.\\n * @param val The value to clone.\\n */\\n function doClone(trace, val) {\\n var vt, prop, res, idx;\\n\\n // Prevent recursive processing.\\n idx = trace.objects.indexOf(val);\\n if (idx > -1) {\\n return trace.values[idx];\\n }\\n\\n vt = typeOf(val);\\n switch (vt) {\\n case 'object':\\n res = {};\\n traceAdd(val, res);\\n for (prop in val) {\\n if (val.hasOwnProperty(prop)) {\\n res[prop] = doClone(trace, val[prop]);\\n }\\n }\\n return res;\\n case 'function':\\n res = copy(val);\\n traceAdd(val, res);\\n for (prop in val) {\\n /* istanbul ignore else */\\n if (val.hasOwnProperty(prop)) {\\n res[prop] = doClone(trace, val[prop]);\\n }\\n }\\n return res;\\n case 'array':\\n res = val.map(clone.bind(null, trace));\\n return res;\\n // Shallow\\n case 'regexp':\\n case 'date':\\n return copy(val);\\n case 'string':\\n case 'number':\\n case 'boolean':\\n case 'nan':\\n case 'null':\\n case 'undefined':\\n return val;\\n default:\\n throw new Error(\\n format('Unrecognized typeOf return value \\\"{0}\\\"', vt)\\n );\\n }\\n\\n /**\\n * Adds to the trace\\n * @param obj The value we are cloning.\\n * @param val The resulting value which the properties\\n * will be cloned onto.\\n */\\n function traceAdd(obj, val) {\\n trace.objects.push(obj);\\n trace.values.push(val);\\n }\\n }\\n }\",\n \"function deepCopy(value) {\\r\\n return deepExtend(undefined, value);\\r\\n}\",\n \"function deepCopy(value) {\\r\\n return deepExtend(undefined, value);\\r\\n}\",\n \"function deepClone(object) {\\n return JSON.parse(JSON.stringify(object));\\n}\",\n \"function setNestedObject(o, key, value) {\\n if (key.indexOf('.') < 0) {\\n if (typeof o === 'object') {\\n o[key] = value;\\n }\\n return;\\n }\\n\\n var pList = key.split('.');\\n var len = pList.length;\\n\\n for(var i = 0; i < len-1; i += 1) {\\n let elem = pList[i];\\n if(!o[elem]) o[elem] = {}\\n o = o[elem];\\n }\\n\\n return o[pList[len-1]] = value;\\n}\",\n \"setRecursion(value) {\\n this.value = value;\\n this.children.forEach((child) => {\\n child.setRecursion(value);\\n });\\n }\",\n \"function exem(o, path, value) {\\n if (absenty(o)) return;\\n\\n var props = path.split('.');\\n var currentValue = o[props[0]];\\n\\n if (value && props.length === 1) {\\n o[props[0]] = value;\\n return;\\n }\\n \\n if (!value && props.length === 1) return currentValue;\\n return exem(currentValue, props.slice(1).join('.'), value);\\n}\",\n \"function deepCopy(value) {\\n return deepExtend(undefined, value);\\n}\",\n \"function deepCopy(value) {\\n return deepExtend(undefined, value);\\n}\",\n \"function deepCopy(value) {\\n return deepExtend(undefined, value);\\n}\",\n \"function deepCopy(value) {\\n return deepExtend(undefined, value);\\n}\",\n \"function deepCopy(value) {\\n return deepExtend(undefined, value);\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.75242656","0.7520379","0.7399823","0.7399823","0.7399823","0.73113424","0.71814436","0.67938864","0.67573845","0.67254883","0.67254883","0.66972333","0.66972333","0.64113533","0.63646054","0.63281685","0.632334","0.63189703","0.6268811","0.6060656","0.6012898","0.6012411","0.59803385","0.59455127","0.59450567","0.59298086","0.58956","0.5837307","0.5776563","0.5776563","0.5776563","0.5776563","0.5776563","0.57760113","0.57575625","0.57097054","0.5699921","0.56944245","0.5653451","0.5603803","0.55350435","0.54462606","0.5420337","0.5407171","0.5388043","0.5386466","0.5375822","0.5364491","0.5343669","0.5343669","0.5343669","0.5343669","0.5343669","0.5343669","0.5343669","0.5343669","0.5343669","0.5342837","0.5317921","0.5309526","0.5206601","0.5193626","0.5182185","0.5160908","0.5160908","0.5160908","0.5160908","0.5160908","0.5160908","0.5160908","0.5160908","0.51582456","0.5149033","0.5149033","0.5148365","0.5147413","0.5142001","0.51385826","0.51360136","0.51315904","0.5129824","0.51297146","0.5103693","0.5081168","0.50780076","0.5075554","0.5074166","0.5060824","0.5058484","0.5055332","0.5055332","0.50494194","0.50483984","0.5046586","0.5038222","0.50194573","0.50194573","0.50194573","0.50194573","0.50194573"],"string":"[\n \"0.75242656\",\n \"0.7520379\",\n \"0.7399823\",\n \"0.7399823\",\n \"0.7399823\",\n \"0.73113424\",\n \"0.71814436\",\n \"0.67938864\",\n \"0.67573845\",\n \"0.67254883\",\n \"0.67254883\",\n \"0.66972333\",\n \"0.66972333\",\n \"0.64113533\",\n \"0.63646054\",\n \"0.63281685\",\n \"0.632334\",\n \"0.63189703\",\n \"0.6268811\",\n \"0.6060656\",\n \"0.6012898\",\n \"0.6012411\",\n \"0.59803385\",\n \"0.59455127\",\n \"0.59450567\",\n \"0.59298086\",\n \"0.58956\",\n \"0.5837307\",\n \"0.5776563\",\n \"0.5776563\",\n \"0.5776563\",\n \"0.5776563\",\n \"0.5776563\",\n \"0.57760113\",\n \"0.57575625\",\n \"0.57097054\",\n \"0.5699921\",\n \"0.56944245\",\n \"0.5653451\",\n \"0.5603803\",\n \"0.55350435\",\n \"0.54462606\",\n \"0.5420337\",\n \"0.5407171\",\n \"0.5388043\",\n \"0.5386466\",\n \"0.5375822\",\n \"0.5364491\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5343669\",\n \"0.5342837\",\n \"0.5317921\",\n \"0.5309526\",\n \"0.5206601\",\n \"0.5193626\",\n \"0.5182185\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.5160908\",\n \"0.51582456\",\n \"0.5149033\",\n \"0.5149033\",\n \"0.5148365\",\n \"0.5147413\",\n \"0.5142001\",\n \"0.51385826\",\n \"0.51360136\",\n \"0.51315904\",\n \"0.5129824\",\n \"0.51297146\",\n \"0.5103693\",\n \"0.5081168\",\n \"0.50780076\",\n \"0.5075554\",\n \"0.5074166\",\n \"0.5060824\",\n \"0.5058484\",\n \"0.5055332\",\n \"0.5055332\",\n \"0.50494194\",\n \"0.50483984\",\n \"0.5046586\",\n \"0.5038222\",\n \"0.50194573\",\n \"0.50194573\",\n \"0.50194573\",\n \"0.50194573\",\n \"0.50194573\"\n]"},"document_score":{"kind":"string","value":"0.7266066"},"document_rank":{"kind":"string","value":"6"}}},{"rowIdx":82042,"cells":{"query":{"kind":"string","value":"Recursively a set the same value for all keys and arrays nested object, cloning"},"document":{"kind":"string","value":"function setNestedObjectValues(object,value,visited,response){if(visited===void 0){visited=new WeakMap();}if(response===void 0){response={};}for(var _i=0,_Object$keys=Object.keys(object);_i<_Object$keys.length;_i++){var k=_Object$keys[_i];var val=object[k];if(isObject$2(val)){if(!visited.get(val)){visited.set(val,true);// In order to keep array values consistent for both dot path and\n// bracket syntax, we need to check if this is an array so that\n// this will output { friends: [true] } and not { friends: { \"0\": true } }\nresponse[k]=Array.isArray(val)?[]:{};setNestedObjectValues(val,value,visited,response[k]);}}else {response[k]=value;}}return response;}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["setObjectWithNestedKey(obj, key, value) {\n\n if(key.indexOf(\".\")) {\n // Need to deal with arrays\n var keys = key.split(\".\");\n var lastHash = keys.pop();\n for(var i = 0; i < keys.length; i++) {\n let keyPointer = keys[i];\n\n if(_.isString(keyPointer) && keyPointer.indexOf(\"[\") === 0) {\n keyPointer = keyPointer.replace(\"[\", \"\").replace(\"]\", \"\");\n keyPointer = parseInt(keyPointer, 10);\n }\n\n if(!_.has(obj, keyPointer) || !_.isObject(obj[keyPointer])) {\n\n var newObj = {};\n var nextKey = i + 1;\n\n if(keys.length > nextKey && _.isString(keys[nextKey]) && keys[nextKey].indexOf(\"[\") === 0) {\n newObj = [];\n }\n\n\n obj[keyPointer] = newObj;\n\n }\n\n obj = obj[keyPointer];\n }\n\n //obj[lastHash] = {};\n key = lastHash;\n }\n\n obj[key] = value;\n\n\n return true;\n }","function lazyImmutableDeepSet(target, original, path, value) {\n if (!path.length)\n return value;\n var parentNode;\n var targetNode = target;\n var originalNode = original;\n // We assume that the last path component is the key of a value; not a\n // container, so we stop there.\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n // If the target still references the original's objects, we need to diverge\n if (!targetNode || targetNode === originalNode) {\n if (typeof key === 'number') {\n targetNode = originalNode ? tslib_1.__spread(originalNode) : [];\n }\n else if (typeof key === 'string') {\n targetNode = originalNode ? tslib_1.__assign({}, originalNode) : {};\n }\n else {\n throw new Error(\"Unknown path type \" + JSON.stringify(key) + \" in path \" + JSON.stringify(path) + \" at index \" + i);\n }\n if (i === 0) {\n // Make sure we have a reference to the new target. We can keep the\n // reference here because \"target\" is pointing as currentNode.data.\n target = targetNode;\n }\n else {\n parentNode[path[i - 1]] = targetNode;\n }\n }\n // Regardless, we keep walking deeper.\n parentNode = targetNode;\n targetNode = targetNode[key];\n originalNode = originalNode && originalNode[key];\n }\n // Finally, set the value in our previously or newly cloned target.\n parentNode[path[path.length - 1]] = value;\n return target;\n}","function recursiveFn(source, target, key) {\n if (isArray(source) || isObject$1(source)) {\n target = isPrimitive(target) ? isObject$1(source) ? {} : [] : target;\n for (var _key in source) {\n // $FlowFixMe: support computed key here\n setter(target, _key, recursiveFn(source[_key], target[_key], _key));\n // target[key] = recursiveFn(source[key], target[key], key);\n }\n return target;\n }\n return fn(source, target, key);\n }","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$6(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$3(a[prop]) && !isArray$3(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$3(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (Object.prototype.propertyIsEnumerable.call(b, b[prop])) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","function deepObjectAssignNonentry() {\n for (var _len2 = arguments.length, values = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n values[_key2] = arguments[_key2];\n }\n\n if (values.length < 2) {\n return values[0];\n } else if (values.length > 2) {\n var _context2;\n\n return deepObjectAssignNonentry.apply(void 0, concat$2(_context2 = [deepObjectAssign(values[0], values[1])]).call(_context2, toConsumableArray(slice$4(values).call(values, 2))));\n }\n\n var a = values[0];\n var b = values[1];\n\n var _iterator = _createForOfIteratorHelper(ownKeys$3(b)),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var prop = _step.value;\n if (!Object.prototype.propertyIsEnumerable.call(b, prop)) ;else if (b[prop] === DELETE) {\n delete a[prop];\n } else if (a[prop] !== null && b[prop] !== null && _typeof_1(a[prop]) === \"object\" && _typeof_1(b[prop]) === \"object\" && !isArray$5(a[prop]) && !isArray$5(b[prop])) {\n a[prop] = deepObjectAssignNonentry(a[prop], b[prop]);\n } else {\n a[prop] = clone(b[prop]);\n }\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n\n return a;\n}","setJsonDeep(target, keys, value) {\n let origin = target;\n keys = keys.split('.');\n for (let key of keys) {\n let last = key === keys[keys.length - 1];\n if (typeof origin[key] === 'undefined' || !origin[key]) {\n origin[key] = last ? value : {};\n } else {\n origin[key] = last ? value : origin[key];\n }\n origin = origin[key];\n }\n }","function clone(val, depth = 5) {\n if (typeof val !== 'object') {\n return val;\n }\n // If we're cloning an array, use an array as the base, otherwise use an object\n const clonedObject = Array.isArray(val) ? [] : {};\n for (const key in val) {\n // Recursively clone eack item unless we're at the maximum depth\n clonedObject[key] = depth <= 1 ? val[key] : (val[key] ? clone(val[key], depth - 1) : val[key]);\n }\n return clonedObject;\n}","function recursiveFn(source, target, key) {\n if (isArray(source) || isObject$1(source)) {\n target = isPrimitive(target) ? isObject$1(source) ? {} : [] : target;\n for (var _key in source) {\n // $FlowFixMe: support computed key here\n setter(target, _key, recursiveFn(source[_key], target[_key], _key));\n // target[key] = recursiveFn(source[key], target[key], key);\n }\n return target;\n }\n return fn(source, target, key);\n }","function recurse(tgt, src, depth) {\n Object.entries(src).forEach(function ([\n key, bb\n ]) {\n let aa;\n aa = tgt[key];\n if (aa === undefined || aa === null || aa === \"\") {\n tgt[key] = bb;\n return;\n }\n if (\n depth !== 0 &&\n typeof aa === \"object\" && aa && !Array.isArray(aa) &&\n typeof bb === \"object\" && bb && !Array.isArray(bb)\n ) {\n recurse(aa, bb, depth - 1);\n }\n });\n }","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (formik_esm_isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function deepFillIn(target, defaults){\n\t var i = 0,\n\t n = arguments.length,\n\t obj;\n\n\t while(++i < n) {\n\t obj = arguments[i];\n\t if (obj) {\n\t // jshint loopfunc: true\n\t forOwn(obj, function(newValue, key) {\n\t var curValue = target[key];\n\t if (curValue == null) {\n\t target[key] = newValue;\n\t } else if (isPlainObject(curValue) &&\n\t isPlainObject(newValue)) {\n\t deepFillIn(curValue, newValue);\n\t }\n\t });\n\t }\n\t }\n\n\t return target;\n\t }","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function setNestedObjectValues(object, value, visited, response) {\n if (visited === void 0) {\n visited = new WeakMap();\n }\n\n if (response === void 0) {\n response = {};\n }\n\n for (var _i = 0, _Object$keys = Object.keys(object); _i < _Object$keys.length; _i++) {\n var k = _Object$keys[_i];\n var val = object[k];\n\n if (isObject(val)) {\n if (!visited.get(val)) {\n visited.set(val, true); // In order to keep array values consistent for both dot path and\n // bracket syntax, we need to check if this is an array so that\n // this will output { friends: [true] } and not { friends: { \"0\": true } }\n\n response[k] = Array.isArray(val) ? [] : {};\n setNestedObjectValues(val, value, visited, response[k]);\n }\n } else {\n response[k] = value;\n }\n }\n\n return response;\n}","function deepFillIn(obj, var_defaults){\n forEach(Array.prototype.slice.call(arguments, 1), function(base){\n forOwn(base, function(val, key){\n var curVal = obj[key];\n if (curVal == null) {\n obj[key] = val;\n } else if (typeof curVal === 'object' && typeof val === 'object') {\n deepFillIn(curVal, val);\n }\n });\n });\n return obj;\n }","function changeValuesToChildren(arr){\n for (var i=0; i < arr.length; i++){\n if (Array.isArray(arr[i].values)){\n arr[i].children = arr[i].values\n delete arr[i].values\n changeValuesToChildren(arr[i].children)\n }\n }\n }","function deepcopy(x) {\n let y, val, key\n if (typeof x !== \"object\" || x === null) return x // base case\n y = listy(x) ? [] : {} // initialize the copy\n for (key in x) {\n val = x[key]\n y[key] = deepcopy(val) // recur!\n }\n return y\n}","function deepCopy(obj){\n if(typeof obj ==\"object\"){\n return Object.keys(obj)\n .map((key)=>({[key]:deepCopy(obj[key])}))\n .reduce((acc,cur)=>Object.assign(acc,cur),{});\n\n\n}\nreturn obj;\n\n}","function _updateParentPopulated(arr) {\n const parent = arr[arrayParentSymbol];\n if (!parent || parent.$__.populated == null) return;\n\n const populatedPaths = Object.keys(parent.$__.populated).\n filter(p => p.startsWith(arr[arrayPathSymbol] + '.'));\n\n for (const path of populatedPaths) {\n const remnant = path.slice((arr[arrayPathSymbol] + '.').length);\n if (!Array.isArray(parent.$__.populated[path].value)) {\n continue;\n }\n\n parent.$__.populated[path].value = arr.map(val => val.populated(remnant));\n }\n}","function sanitize(value, depth) {\n if (typeof value !== \"object\" || value === null) {\n return value;\n }\n if (Array.isArray(value)) {\n if (depth) {\n return value.map((item) => sanitize(item, depth - 1));\n }\n else {\n return [];\n }\n }\n if (depth) {\n let clone = {};\n for (let key of Object.keys(value)) {\n clone[key] = sanitize(value[key], depth - 1);\n }\n return clone;\n }\n else {\n return {};\n }\n}","function recClone(oldObject, newObject) {\n Object.keys(oldObject).forEach(function forCurrentParam(key) {\n if (typeof oldObject[key] !== 'function') {\n if (Array.isArray(oldObject[key])) {\n newObject[key] = [];\n recClone(oldObject[key], newObject[key]);\n } else {\n newObject[key] = oldObject[key];\n }\n }\n });\n\n return newObject;\n }","function deepCopy(obj) {\n if (typeof obj == \"object\") {\n } else if (typeof obj == \"array\") {\n return Object.keys(obj)\n .map((key) => ({ [key]: deepCopy(obj[key]) }))\n .reduce((acc, cur) => Object.assign(acc, cur), {});\n }\n return obj;\n}","function CloneDeep(original) {\n var clone = {};\n var _loop_1 = function(key) {\n if (original.hasOwnProperty(key)) {\n if (original[key] instanceof Array) {\n clone[key] = [];\n var arr_1 = clone[key];\n original[key].forEach(function (ele) { return arr_1.push(CloneDeep(ele)); });\n }\n else if (typeof original[key] === \"object\")\n clone[key] = CloneDeep(original[key]);\n else\n clone[key] = original[key];\n }\n };\n for (var key in original) {\n _loop_1(key);\n }\n return clone;\n }","static deepCopy(obj) {\n let output, v, key;\n output = Array.isArray(obj) ? [] : {};\n\n for (key in obj) {\n v = obj[key];\n output[key] = (typeof v === \"object\") ? this.deepCopy(v) : v;\n }\n\n return output;\n }","function getClone() {\n // Recursive function to clone Object + Array\n function recClone(oldObject, newObject) {\n Object.keys(oldObject).forEach(function forCurrentParam(key) {\n if (typeof oldObject[key] !== 'function') {\n if (Array.isArray(oldObject[key])) {\n newObject[key] = [];\n recClone(oldObject[key], newObject[key]);\n } else {\n newObject[key] = oldObject[key];\n }\n }\n });\n\n return newObject;\n }\n \n return recClone(state, {});\n }","function setIn(obj,path,value){var res=clone(obj);// this keeps inheritance when obj is a class\nvar resVal=res;var i=0;var pathArray=toPath(path);for(;i=0?[]:{};}}// Return original object if new value is the same as current\nif((i===0?obj:resVal)[pathArray[i]]===value){return obj;}if(value===undefined){delete resVal[pathArray[i]];}else {resVal[pathArray[i]]=value;}// If the path array has a single element, the loop did not run.\n// Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\nif(i===0&&value===undefined){delete res[pathArray[i]];}return res;}","function trie_recurse( obj, key, val ) {\n if ( key.length <= 1 ) {\n if (key.length < 1) {\n obj.value = val;\n }\n obj[key] = {\n value: val\n }\n return;\n }\n let n = key.slice(0, 1);\n if (!obj[n]) obj[n] = {};\n trie_recurse(obj[n], key.slice(1, key.length), val);\n}","function assignProxies (obj, cbs, shouldComponentUpdate, parent) {\n for (let k in obj) {\n if (obj[k] instanceof Array || obj[k] instanceof Object) {\n let curPosition = (parent === null ? '' : parent)\n let key = getCorrectPathOfObject(obj, k)\n obj[k] = assignProxies(obj[k], cbs, shouldComponentUpdate, curPosition + key)\n }\n }\n if (obj instanceof Array || obj instanceof Object) {\n Object.defineProperty(obj, '_parent', {\n enumerable: false,\n writable: true\n })\n obj._parent = parent\n }\n if (obj instanceof Array) {\n return makeArrayProxy(obj, cbs, shouldComponentUpdate)\n } else if (obj instanceof Object) {\n return makeObjectProxy(obj, cbs, shouldComponentUpdate)\n } else {\n return obj\n }\n}","function deepReplace(obj, valueType, origValue, newValue, deleteTheseKeys=[]) {\n if (!obj || !(obj instanceof Object)) {\n return;\n }\n\n if (!(obj instanceof Array)) {\n Object.keys(obj).forEach((key) => {\n const nestedObj = obj[key];\n if (typeof nestedObj === valueType && nestedObj === origValue) {\n if (newValue === undefined) {\n deleteTheseKeys.push(key);\n } else {\n obj[key] = newValue;\n }\n } else if (nestedObj instanceof Object) {\n deepReplace(nestedObj, valueType, origValue, newValue);\n }\n });\n deleteTheseKeys.forEach((key) => {\n delete obj[key];\n });\n } else {\n obj.forEach((nestedObj, idx, currArr) => {\n if (typeof nestedObj === valueType && nestedObj === origValue) {\n if (newValue === undefined) {\n deleteTheseKeys.push(idx);\n } else {\n currArr[idx] = newValue;\n }\n } else if (nestedObj instanceof Object) {\n deepReplace(nestedObj, valueType, origValue, newValue);\n }\n });\n while (deleteTheseKeys.length > 0) {\n const idx = deleteTheseKeys.pop();\n obj.splice(idx, 1);\n }\n }\n}","function deepObjectAssign() {\n var merged = deepObjectAssignNonentry.apply(void 0, arguments);\n stripDelete(merged);\n return merged;\n}","function deepClone(data, clone){\n\t(isArray(data)) ? clone = [] : clone = {};\n\n\tif(isArray(data)){\n\t\tdata.forEach(elem => {\n\t\t (isObject(elem)) ? clone.push(deepClone(elem)) : clone.psuh(elem)\n\t\t})\n\t}else if(isObject(data)){\n\t\tfor(let key in data){\n\t\t\t(isObject(data[key])) ? clone[key] = deepClone(data[key]) : clone[key] = data[key]\n\t\t}\n\t}\n\n\treturn clone;\n}","flatClone(noodle, flatList = noodle.object.flatList(obj), newList = new Array(flatList.length)) { //Kinda stupid to check lists for each recursion?\n for (var i in flatList) {\n var obj = flatList[i];\n if (typeof obj == 'object') {\n //Go through obj to find its properties in flatList and clone them to newList\n for (var j in obj) {\n var ind = flatList.indexOf(obj[i]);//Find obj[i] in flatList\n if (ind != -1) {\n if (newList[i] == undefined) {//If this object hasn't been found before\n newList[i] = shallowClone(); //TODO\n }\n }\n }\n }\n return $.extend(null, obj);\n }\n }","function setNestedObject(o, key, value) {\n if (key.indexOf('.') < 0) {\n if (typeof o === 'object') {\n o[key] = value;\n }\n return;\n }\n\n var pList = key.split('.');\n var len = pList.length;\n\n for(var i = 0; i < len-1; i += 1) {\n let elem = pList[i];\n if(!o[elem]) o[elem] = {}\n o = o[elem];\n }\n\n return o[pList[len-1]] = value;\n}","function setIn(obj, path, value) {\n var res = lodash_es_clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = lodash_es_toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (formik_esm_isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = lodash_es_clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setInObj(obj, keyPath, value){\n var currPath = obj;\n var path = keyPath.split('.');\n console.log('path from keyPath: ' + path);\n for(var i=0; i < path.length-1; i++){\n console.log('path chunk: ' + path[i]);\n if (typeof(currPath[ path[i] ]) !== \"undefined\") {\n console.log('path chunk exist: ' + currPath[ path[i] ]);\n currPath = currPath[ path[i] ];\n //console.log(obj); // DEBUG\n //console.log(currPath); // DEBUG\n } else {\n //console.log('path added: ' + currPath[ path[i] ]);\n currPath[ path[i] ] = {};\n currPath = currPath[ path[i] ];\n //console.log(obj); // DEBUG\n //console.log(currPath); // DEBUG\n }\n }\n //currPath = value; // not working ?\n currPath[ path[ path.length-1 ] ] = value;\n}","function doCopy(copy, original) {\n\t\t\tvar value, key;\n\t\t\t\n\t\t\tfor (key in original) {\n\t\t\t\tvalue = original[key];\n\t\t\t\tif (value && typeof value === 'object' && value.constructor !== Array &&\n\t\t\t\t\t\ttypeof value.nodeType !== 'number') {\n\t\t\t\t\tcopy[key] = doCopy(copy[key] || {}, value); // copy\n\n\t\t\t\t} else {\n\t\t\t\t\tcopy[key] = original[key];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn copy;\n\t\t}","$_fillRecursive(formData) {}","function recursive( obj, key, value ) {\n if ( !obj ) return;\n var next = key.shift();\n if ( key.length === 0 )\n return value !== undefined ? obj[ next ] = value : obj[ next ];\n if ( !obj[ next ] && value !== undefined ) obj[ next ] = isNaN( key[ 0 ] ) ? {} : [];\n return recursive( obj[ next ], key, value ); // recursive call\n }","cloneObject(obj) {\n\t\tif (typeof obj === 'object' && obj.length !== undefined) {\n\t\t\tconst newObj = [];\n\t\t\tfor (const item of obj) {\n\t\t\t\tif (typeof item === 'object') {\n\t\t\t\t\tnewObj.push(this.cloneObject(item));\n\t\t\t\t} else {\n\t\t\t\t\tnewObj.push(item);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn newObj;\n\t\t} else {\n\t\t\tconst newObj = {};\n\t\t\t// loop over the keys of the object first node\n\t\t\tfor (const key of Object.keys(obj)) {\n\t\t\t\t// If this key is an array\n\t\t\t\tif (typeof obj[key] === 'object' && obj[key].length !== undefined) {\n\t\t\t\t\tnewObj[key] = [];\n\t\t\t\t\tfor (const item of obj[key]) {\n\t\t\t\t\t\tif (typeof item === 'object') {\n\t\t\t\t\t\t\tnewObj[key].push(this.cloneObject(item));\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tnewObj[key].push(item);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t// If this key is an object\n\t\t\t\t} else if (typeof obj[key] === 'object') {\n\t\t\t\t\tnewObj[key] = {};\n\t\t\t\t\tconst _item = obj[key];\n\t\t\t\t\tfor (const k of Object.keys(_item)) {\n\t\t\t\t\t\tif (typeof _item[k] === 'object') {\n\t\t\t\t\t\t\tnewObj[key][k] = this.cloneObject(_item[k]);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tnewObj[key][k] = _item[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t// If this key is any other typeof\n\t\t\t\t} else {\n\t\t\t\t\tnewObj[key] = obj[key];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn newObj;\n\t\t}\n\t}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = (0,lodash_es_toPath__WEBPACK_IMPORTED_MODULE_4__.default)(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = (0,lodash_es_clone__WEBPACK_IMPORTED_MODULE_5__.default)(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function recurse(initial, update) {\n for (var prop in initial) {\n if ({}.hasOwnProperty.call(initial, prop) &&\n (update !== null && {}.hasOwnProperty.call(update, prop))\n ) {\n if (typeof initial[prop] === 'object' &&\n (\n initial[prop] !== null &&\n initial[prop].constructor !== Array\n ) &&\n (\n typeof update[prop] === 'object' &&\n update[prop] !== null\n )\n ) {\n recurse(initial[prop], update[prop])\n } else if (update[prop] === null) {\n initial[prop] = self.baseModel[prop]\n } else {\n initial[prop] = update[prop]\n }\n }\n }\n\n return initial\n }","binClonePlus(noodle, obj, clone, map = {}, flatList = noodle.sList.new(noodle), flatClone = noodle.sList.new(noodle), flatMap = noodle.sList.new(noodle), path = [], func = function () { }, cond = function () { return true; }) {\n //Add unpassed parameters to arguments{\n [arguments[2], arguments[3], arguments[4], arguments[5], arguments[6], arguments[7], arguments[8], arguments[9]] = [clone, map, flatList, flatClone, flatMap, path, func, cond];\n if (arguments.length < 10) //This condition is necessary since arguments might be longer than 8\n arguments.length = 10;\n //}\n\n var args = Array.from(arguments);\n args.splice(7, 2);\n if (!cond.apply(undefined, args)) {\n return obj;\n }\n func.apply(undefined, args);\n\n //flatClone.push(clone);\n if (obj == null || obj == undefined)\n return obj;\n\n if (typeof obj == 'object') {\n //If clone is undefined, make it an empty array or object\n if (clone == undefined) {\n if (obj.constructor === Array) {\n clone = [];\n }\n else {\n clone = {};\n }\n }\n noodle.sList.add(noodle, flatList, obj);\n noodle.sList.add(noodle, flatClone, clone);\n noodle.sList.add(noodle, flatMap, path);\n\n var flatInd;\n //TODO: Find indices before loop\n //Go through obj to clone all its properties\n for (var i in obj) {\n [...path] = path; //Shallow clone path\n path.push(i);\n flatInd = noodle.sList.indexOf(noodle, flatList, obj[i]);\n //If we've found a new object, add it to flatList and clone it to clone and flatClone\n if (flatInd == -1) {\n //Set up map[i]{\n var mapVal;\n var isObj = true;\n //If obj[i] is not null or undefined, let mapVal be of the same type{\n if (obj[i] != undefined) {\n if (obj[i].constructor === Array)\n mapVal = [];\n else if (typeof obj[i] === 'object')\n mapVal = {};\n else {\n mapVal = obj[i];\n isObj = false;\n }\n }\n else {\n mapVal = obj[i];\n isObj = false;\n }\n //}\n map[i] = { recog: false, val: mapVal, isObj: isObj };\n //}\n //clone[i] = clone[i] || {};\n [...args] = arguments; //TODO: Guess I could place this line outside the loop?\n\n args[1] = obj[i];\n args[2] = clone[i];\n args[3] = map[i].val;\n clone[i] = noodle.object.binClonePlus.apply(undefined, args); //This works because flatList gets updated\n\n }\n //If we've seen obj[i] before, add the clone of it to clone\n else {\n clone[i] = noodle.sList.get(noodle, flatClone, flatInd);\n map[i] = { recog: true, path: noodle.sList.get(noodle, flatMap, flatInd) };\n }\n }\n return clone;\n }\n return obj;\n }","function recursiveDeepCopy(o) {\n var newO,\n i;\n \n if (typeof o !== 'object') {\n return o;\n }\n if (!o) {\n return o;\n }\n \n if ('[object Array]' === Object.prototype.toString.apply(o)) {\n newO = [];\n for (i = 0; i < o.length; i += 1) {\n newO[i] = recursiveDeepCopy(o[i]);\n }\n return newO;\n }\n \n newO = {};\n for (i in o) {\n if (o.hasOwnProperty(i)) {\n newO[i] = recursiveDeepCopy(o[i]);\n }\n }\n return newO;\n }","function setIn(obj, path, value) {\n var res = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = Object(lodash_es_toPath__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = Object(lodash_es_clone__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","function setIn(obj, path, value) {\n var res = clone(obj); // this keeps inheritance when obj is a class\n\n var resVal = res;\n var i = 0;\n var pathArray = toPath(path);\n\n for (; i < pathArray.length - 1; i++) {\n var currentPath = pathArray[i];\n var currentObj = getIn(obj, pathArray.slice(0, i + 1));\n\n if (currentObj && (isObject(currentObj) || Array.isArray(currentObj))) {\n resVal = resVal[currentPath] = clone(currentObj);\n } else {\n var nextPath = pathArray[i + 1];\n resVal = resVal[currentPath] = isInteger(nextPath) && Number(nextPath) >= 0 ? [] : {};\n }\n } // Return original object if new value is the same as current\n\n\n if ((i === 0 ? obj : resVal)[pathArray[i]] === value) {\n return obj;\n }\n\n if (value === undefined) {\n delete resVal[pathArray[i]];\n } else {\n resVal[pathArray[i]] = value;\n } // If the path array has a single element, the loop did not run.\n // Deleting on `resVal` had no effect in this scenario, so we delete on the result instead.\n\n\n if (i === 0 && value === undefined) {\n delete res[pathArray[i]];\n }\n\n return res;\n}","reinitializeArray() {\n const that = this;\n\n if (that.type === 'none') {\n return;\n }\n\n const dimensions = that.dimensions,\n oldValue = JSON.stringify(that.value);\n\n if (that.dimensions === 1) {\n that.value.fill(that._getDefaultValue());\n }\n else {\n const recursion = function (arr, level) {\n for (let i = 0; i < arr.length; i++) {\n if (level === dimensions) {\n arr[i] = that._getDefaultValue();\n }\n else {\n recursion(arr[i], level + 1);\n }\n }\n };\n\n recursion(that.value, 1);\n }\n\n if (oldValue !== JSON.stringify(that.value)) {\n that._scroll();\n that.$.fireEvent('change', { 'value': that.value, 'oldValue': JSON.parse(oldValue) });\n }\n }","function put (obj, key, value, path = []) {\n if (!isObject(value)) {\n // if we are overriding an existing object,\n // record deletion\n if (isObject(obj[key])) {\n // recursively delete object props\n del(obj, key)\n }\n\n // record parent object update\n let parent = baseObject(obj)\n parent[key] = baseObject(value)\n recordMutation('put', path, parent)\n return\n }\n\n // if we are overriding an existing non-object,\n // record update of parent base object\n if (key in obj && !isObject(obj[key])) {\n let base = baseObject(obj)\n delete base[key]\n recordMutation('put', path, base)\n }\n\n // if parent is array, ensure length gets updated\n if (Array.isArray(obj)) {\n let parent = baseObject(obj)\n recordMutation('put', path, parent)\n }\n\n let base = baseObject(value)\n recordMutation('put', path.concat(key), base)\n\n for (let childKey in value) {\n let child = value[childKey]\n\n // if any of our non-object children override an\n // existing object, then record deletion\n if (!isObject(child)) {\n if (!isObject(obj[key])) continue\n if (!isObject(obj[key][childKey])) continue\n del(obj[key], childKey, path.concat(key))\n continue\n }\n\n // recursively record puts for objects\n put(value, childKey, child, path.concat(key))\n }\n }","shallowMerge(other, overwrite = true, withAppend = false) {\n //shallow merge must be mutable so we have to remap\n let newThis = (0, AssocArray_1.shallowMerge)(overwrite, withAppend, this.value, other.value);\n if (Array.isArray(this._value)) {\n this._value.length = 0;\n this._value.push(...newThis);\n }\n else {\n Object.getOwnPropertyNames(this._value).forEach(key => delete this._value[key]);\n Object.getOwnPropertyNames(newThis).forEach(key => this._value[key] = newThis[key]);\n }\n }","function cloneDeep$2(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep$2(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep$2(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function demo008(){\n var obj = {\n subObject: {\n subKey: 'subvalue',\n subSubObject: {\n subSubKey: 'subSubValue'\n }\n }\n } ;\n const originalMap = Immutable.fromJS(obj) ;\n const newMap = originalMap.setIn(['subObject','subKey'],'ha ha!') ;\n console.info(newMap.toJS()) ;\n // {subObject:{subKey:'ha ha!', subSubObject:{subSubKey:'subSubValue'}}}\n const newerMap2 = originalMap.setIn(\n ['subObject', 'subSubObject', 'subSubKey'],\n 'ha ha ha!');\n console.info(newerMap2.toJS()) ;\n //// {subObject:{subKey:'subvalue', subSubObject:{subSubKey:'ha ha ha!'}}}\n}","function recurse(tob, sob) {\n Object.keys(sob).forEach(function (k) {\n\n // if target ob is completely undefined, then copy the whole thing\n if (utils.isUndefined(tob[k])) {\n tob[k] = sob[k];\n }\n\n // if source ob is an object then we need to recurse to find any missing items in the target ob\n else if (utils.isObject(sob[k])) {\n recurse(tob[k], sob[k]);\n }\n\n });\n }","static mapValuesDeep(obj, fn, key) {\n return isArray(obj)\n ? map(obj, (innerObj, idx) => ObjectUtils.mapValuesDeep(innerObj, fn, idx))\n : isPlainObject(obj)\n ? mapValues(obj, (val, key) => ObjectUtils.mapValuesDeep(val, fn, key))\n : isObject(obj)\n ? obj\n : fn(obj, key)\n }","function deepObjectAssign() {\n var merged = deepObjectAssignNonentry.apply(void 0, arguments);\n stripDelete(merged);\n console.log(merged);\n return merged;\n}","function deepObjectAssign() {\n var merged = deepObjectAssignNonentry.apply(void 0, arguments);\n stripDelete(merged);\n console.log(merged);\n return merged;\n}","function fill(arrOrObj, value) {\r\n walk(arrOrObj, function(v, k) {\r\n arrOrObj[k] = value;\r\n }, 1);\r\n return arrOrObj;\r\n }","function _clone (parent, depth) {\n // cloning null always returns null\n if (parent === null) { return null }\n\n if (depth === 0) {\n return parent\n }\n\n let child\n let proto\n if (typeof parent !== 'object') {\n return parent\n }\n\n if (parent instanceof NativeMap) {\n child = new NativeMap()\n } else if (parent instanceof NativeSet) {\n child = new NativeSet()\n } else if (parent instanceof NativePromise) {\n child = new NativePromise(function (resolve, reject) {\n parent.then(function (value) {\n resolve(_clone(value, depth - 1))\n }, function (err) {\n reject(_clone(err, depth - 1))\n })\n })\n } else if (clone.__isArray(parent)) {\n child = []\n } else if (clone.__isRegExp(parent)) {\n child = new RegExp(parent.source, __getRegExpFlags(parent))\n if (parent.lastIndex) child.lastIndex = parent.lastIndex\n } else if (clone.__isDate(parent)) {\n child = new Date(parent.getTime())\n } else if (useBuffer && Buffer.isBuffer(parent)) {\n child = Buffer.alloc(parent.length)\n parent.copy(child)\n return child\n } else if (parent instanceof Error) {\n child = Object.create(parent)\n } else {\n if (typeof prototype === 'undefined') {\n proto = Object.getPrototypeOf(parent)\n child = Object.create(proto)\n } else {\n child = Object.create(prototype)\n proto = prototype\n }\n }\n\n if (circular) {\n let index = allParents.indexOf(parent)\n\n if (index !== -1) {\n return allChildren[index]\n }\n allParents.push(parent)\n allChildren.push(child)\n }\n\n if (parent instanceof NativeMap) {\n let keyIterator = parent.keys()\n while (true) {\n let next = keyIterator.next()\n if (next.done) {\n break\n }\n let keyChild = _clone(next.value, depth - 1)\n let valueChild = _clone(parent.get(next.value), depth - 1)\n child.set(keyChild, valueChild)\n }\n }\n if (parent instanceof NativeSet) {\n let iterator = parent.keys()\n while (true) {\n let next = iterator.next()\n if (next.done) {\n break\n }\n let entryChild = _clone(next.value, depth - 1)\n child.add(entryChild)\n }\n }\n\n for (let i in parent) {\n let attrs\n if (proto) {\n attrs = Object.getOwnPropertyDescriptor(proto, i)\n }\n\n if (attrs && attrs.set == null) {\n continue\n }\n child[i] = _clone(parent[i], depth - 1)\n }\n\n if (Object.getOwnPropertySymbols) {\n let symbols = Object.getOwnPropertySymbols(parent)\n for (let i = 0; i < symbols.length; i++) {\n // Don't need to worry about cloning a symbol because it is a primitive,\n // like a number or string.\n let symbol = symbols[i]\n let descriptor = Object.getOwnPropertyDescriptor(parent, symbol)\n if (descriptor && !descriptor.enumerable && !includeNonEnumerable) {\n continue\n }\n child[symbol] = _clone(parent[symbol], depth - 1)\n if (!descriptor.enumerable) {\n Object.defineProperty(child, symbol, {\n enumerable: false\n })\n }\n }\n }\n\n if (includeNonEnumerable) {\n let allPropertyNames = Object.getOwnPropertyNames(parent)\n for (let i = 0; i < allPropertyNames.length; i++) {\n let propertyName = allPropertyNames[i]\n let descriptor = Object.getOwnPropertyDescriptor(parent, propertyName)\n if (descriptor && descriptor.enumerable) {\n continue\n }\n child[propertyName] = _clone(parent[propertyName], depth - 1)\n Object.defineProperty(child, propertyName, {\n enumerable: false\n })\n }\n }\n\n return child\n }","function deepAssign(target, patch) {\n const keys = Object.keys(patch);\n for (let i = 0; i < keys.length; i++) {\n const key = keys[i];\n if (target.hasOwnProperty(key) && typeof target[key] === 'object') {\n deepAssign(target[key], patch[key]);\n } else {\n target[key] = patch[key];\n }\n }\n\n return target;\n}","function mapObjectRecursive(object, map, context = {}) {\n const clone = Array.isArray(object) ? [] : {};\n for (const k of Object.keys(object)) {\n let key = k;\n const value = object[key];\n if (Array.isArray(object))\n key = +key;\n const contextClone = Object.assign({}, context);\n let result = map(key, value, object, contextClone);\n if (typeof result !== 'undefined' && typeof result !== 'object' && !Array.isArray(result))\n throw new Error('mapObjectRecursive: return value of map function must be undefined, object, or array!');\n if (typeof result === 'undefined') {\n result = { [key]: value };\n }\n for (const kk in result) {\n let value = result[kk];\n if ((0, isPlainObject_1.isPlainObject)(value) || Array.isArray(value))\n value = mapObjectRecursive(value, map, contextClone);\n if (typeof value !== 'undefined')\n clone[kk] = value;\n }\n }\n return clone;\n}","function deepAssign(target, source, dereference = false)\r\n{\r\n\tif (dereference)\r\n\t{\r\n\t\tsource = Object.assign(Array.isArray(source) ? [] : {}, source)\r\n\t}\r\n\r\n\tfor (let i in source)\r\n\t{\r\n\t\tif (source.hasOwnProperty(i))\r\n\t\t{\r\n\t\t\tif (dereference && source[i] instanceof Object)\r\n\t\t\t{\r\n\t\t\t\tsource[i] = Object.assign(Array.isArray(source[i]) ? [] : {}, source[i])\r\n\t\t\t}\r\n\r\n\t\t\tif (target.hasOwnProperty(i))\r\n\t\t\t{\r\n\t\t\t\tif (dereference && target[i] instanceof Object)\r\n\t\t\t\t{\r\n\t\t\t\t\ttarget[i] = Object.assign(Array.isArray(target[i]) ? [] : {}, target[i])\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (target[i] instanceof Object && source[i] instanceof Object && !(target[i] instanceof Function || source[i] instanceof Function))\r\n\t\t\t\t{\r\n\t\t\t\t\tdeepAssign(target[i], source[i])\r\n\t\t\t\t}\r\n\t\t\t\telse if (target[i] != source[i])\r\n\t\t\t\t{\r\n\t\t\t\t\ttarget[i] = source[i]\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttarget[i] = source[i]\r\n\t\t\t}\r\n\r\n\t\t\tif (Array.isArray(target[i]) && Array.isArray(source[i]) && source[i].length == 0 && target[i].length != 0)\r\n\t\t\t{\r\n\t\t\t\ttarget[i] = []\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn target // For simpler dereference usage\r\n}","set(array) {\n array = array.map(this.withKey);\n\n // Remove extraneous existing items\n const didRemoveItems = Object.keys(this.items)\n .map(key => {\n if (this.items[key] && array.every(item => (hasKey(item) ? item.key : item) !== key)) {\n this.items[key] = undefined;\n return true;\n }\n })\n .includes(true);\n\n // Add things not already there; check if anything was added\n const didAddItems = array.map(item => {\n const key = hasKey(item) ? item.key : item;\n if (!this.items[key]) {\n this.items[key] = item;\n return true;\n }\n }).includes(true);\n\n const didChangeItems = array.map(item => {\n if (!hasKey(item))\n return false; // No way that an non-keyholding item's value changed\n\n const { key } = item;\n const other = this.items[key];\n\n const didOtherChange =\n Object.keys(item).map(p => {\n if (item[p] !== other[p]) {\n this.items[key][p] = item[p];\n return true;\n }\n }).includes(true) +\n Object.keys(other).map(p => {\n if (other[p] !== item[p]) {\n this.items[key][p] = item[p]; // Likely becomes undefined\n return true;\n }\n }).includes(true);\n return !!didOtherChange\n }).includes(true);\n\n return didRemoveItems || didAddItems || didChangeItems;\n }","function convertCircRefsRecursively(oldObj, currObj, newObj, replacement = 'Circular Ref') {\n each(currObj, (val, prop) => {\n \n if (isObject(val) || isArray(val)) {\n\n // detect a circular reference\n if (val === oldObj) {\n newObj[prop] = replacement;\n } \n // otherwise initialize the current object\n else {\n if(isArray(val)) {\n newObj[prop] = [];\n } else {\n newObj[prop] = {};\n }\n convertCircRefsRecursively(oldObj, val, newObj[prop], replacement);\n }\n } else {\n newObj[prop] = val;\n }\n });\n}","setDepth(obj, path, value) {\n obj = obj || {};\n let tags = path.split(\".\").reverse();\n\n obj[tags.shift()] = value;\n\n for (let tag of tags) {\n let _obj = Object.assign({}, obj);\n obj = {[tag]: _obj};\n }\n return obj;\n }","function clone(a) {\n if (isArray$5(a)) {\n return map$2(a).call(a, function (value) {\n return clone(value);\n });\n } else if (_typeof_1(a) === \"object\" && a !== null) {\n return deepObjectAssignNonentry({}, a);\n } else {\n return a;\n }\n}","function clone(a) {\n if (isArray$5(a)) {\n return map$2(a).call(a, function (value) {\n return clone(value);\n });\n } else if (_typeof_1(a) === \"object\" && a !== null) {\n return deepObjectAssignNonentry({}, a);\n } else {\n return a;\n }\n}","function assignVals(o) {\n // replace the original ids in our intermediate _ids structure\n // with the documents found by query\n assignRawDocsToIdStructure(o.rawIds, o.rawDocs, o.rawOrder, o.options,\n o.localField, o.foreignField);\n\n // now update the original documents being populated using the\n // result structure that contains real documents.\n\n var docs = o.docs;\n var rawIds = o.rawIds;\n var options = o.options;\n\n function setValue(val) {\n return valueFilter(val, options);\n }\n\n for (var i = 0; i < docs.length; ++i) {\n if (utils.getValue(o.path, docs[i]) == null &&\n !o.originalModel.schema._getVirtual(o.path)) {\n continue;\n }\n\n if (o.isVirtual && !o.justOne && !Array.isArray(rawIds[i])) {\n if (rawIds[i] == null) {\n rawIds[i] = [];\n } else {\n rawIds[i] = [rawIds[i]];\n }\n }\n\n if (o.isVirtual && docs[i].constructor.name === 'model') {\n // If virtual populate and doc is already init-ed, need to walk through\n // the actual doc to set rather than setting `_doc` directly\n mpath.set(o.path, rawIds[i], docs[i]);\n } else {\n var parts = o.path.split('.');\n var cur = docs[i];\n for (var j = 0; j < parts.length - 1; ++j) {\n if (cur[parts[j]] == null) {\n cur[parts[j]] = {};\n }\n cur = cur[parts[j]];\n }\n if (docs[i].$__) {\n docs[i].populated(o.path, o.allIds[i], o.allOptions);\n }\n utils.setValue(o.path, rawIds[i], docs[i], setValue);\n }\n }\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) { return cloneDeep(item); });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) {\n return cloneDeep(item);\n });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function cloneDeep(value) {\n // If the value is an array, create a new array where every item has been cloned.\n if (Array.isArray(value)) {\n return value.map(function (item) {\n return cloneDeep(item);\n });\n }\n // If the value is an object, go through all of the object’s properties and add them to a new\n // object.\n if (value !== null && typeof value === 'object') {\n var nextValue = {};\n for (var key in value) {\n if (value.hasOwnProperty(key)) {\n nextValue[key] = cloneDeep(value[key]);\n }\n }\n return nextValue;\n }\n // Otherwise this is some primitive value and it is therefore immutable so we can just return it\n // directly.\n return value;\n}","function clone(a) {\n if (isArray$3(a)) {\n return map$2(a).call(a, function (value) {\n return clone(value);\n });\n } else if (_typeof_1(a) === \"object\" && a !== null) {\n return deepObjectAssignNonentry({}, a);\n } else {\n return a;\n }\n}","clone(noodle, obj, clone, flatList = [], flatClone = []) {\n cloneCounter++;\n //flatClone.push(clone);\n if (obj == undefined)\n return obj;\n\n if (typeof obj == 'object') {\n //If clone is undefined, make it an empty array or object\n if (clone == undefined) {\n if (obj.constructor == Array) {\n clone = new Array(obj.length);\n }\n else {\n clone = {};\n }\n }\n flatList.push(obj);\n flatClone.push(clone);\n //Go through obj to clone all its properties\n for (var i in obj) {\n var flatInd = flatList.indexOf(obj[i]);\n //If we've found a new object, add it to flatList and clone it to clone and flatClone\n if (flatInd == -1) {\n //clone[i] = clone[i] || {};\n clone[i] = noodle.object.clone(noodle, obj[i], clone[i], flatList, flatClone); //This works because flatList gets updated\n }\n //If we've seen obj[i] before, add the clone of it to clone\n else {\n clone[i] = flatClone[flatInd];\n }\n }\n return clone;\n }\n return obj;\n }","_pathSet(path, value) {\n let obj = this.fieldNode; // we set the values relative to the fieldnode, so fieldnode is the root\n const parts = path.split('.');\n while (parts.length > 1) {\n const key = parts.shift();\n // create if not exist\n if (!(key in obj)) {\n obj[key] = {};\n }\n obj = obj[key];\n }\n obj[parts.shift()] = value;\n }","function extendDeep(object, source) {\n return _.assignWith(object, source, (a, b) => {\n if (Array.isArray(a)) {\n return _.uniqWith(a.concat(b), _.isEqual);\n }\n if (_.isObject(a)) {\n extendDeep(a, b);\n }\n return a;\n });\n }","function clone_obj(obj) {\n \n if(obj == null || typeof(obj) != 'object' || obj.nodeName !== undefined)\n return obj;\n //console.log(\"clone begin cons=\" + obj.constructor + \" type \" + typeof(obj) + \" name \" + obj.nodeName);\n //var temp = obj.constructor(); // changed\n var temp = (obj instanceof Array) ? [] : {};\n \n for(var key in obj)\n\tif (obj.hasOwnProperty(key)){\n\t //console.log(\"cloning key \" + key);\n\t temp[key] = clone_obj(obj[key]);\n\t}\n return temp;\n \n\n // var new_obj = (o instanceof Array) ? [] : {};\n \n // for (i in o) {\n // // if (i == 'clone') continue; //?\n // if (o[i] && typeof o[i] == \"object\") {\n // new_obj[i] = clone_obj(o[i]);//.hyperclone();\n // } else \n // new_obj[i] = o[i];\n // } \n \n // return new_obj;\n}","static fork(obj) {\n var ret, key, value;\n\n if (obj && obj.constructor === Object) {\n ret = Object.setPrototypeOf({}, obj);\n\n for (key in obj) {\n value = obj[key];\n\n if (value) {\n if (value.constructor === Object) {\n ret[key] = this.fork(value);\n } else if (value instanceof Array) {\n ret[key] = value.slice();\n }\n }\n }\n } else {\n ret = obj;\n }\n\n return ret;\n }","function assign(left, right, keepMods) {\n if (left instanceof Array) {\n if (!(right instanceof Array))\n console.log('errrr');\n left.forEach(function(_, prop) {\n assignHelper(left, right, prop, keepMods);\n });\n }\n else {\n for (var prop in left) {\n if (!isPOJS(right))\n console.log('errrr');\n assignHelper(left, right, prop, keepMods);\n }\n }\n return right;\n }","aliasObjects (alias, value) {\n const cloned = Object.assign({}, value)\n for (const a in alias) {\n if (a in cloned) {\n cloned[alias[a]] = cloned[a]\n delete cloned[a]\n }\n }\n return cloned\n }","function wrap (obj, onMutate, path = []) {\n function recordMutation (op, childPath, value) {\n let fullPath = path.concat(childPath)\n let oldValue\n let existed = false\n try {\n [ oldValue, existed ] = access(obj, childPath)\n } catch (err) {}\n let mutation = {\n op,\n path: fullPath,\n oldValue: baseObject(oldValue),\n newValue: value,\n existed\n }\n onMutate(mutation)\n // TODO: replace mutations for overriden paths\n }\n\n // TODO: wrap array methods to record array-specific mutations,\n // otherwise ops like splices and shifts will create N mutations\n\n function put (obj, key, value, path = []) {\n if (!isObject(value)) {\n // if we are overriding an existing object,\n // record deletion\n if (isObject(obj[key])) {\n // recursively delete object props\n del(obj, key)\n }\n\n // record parent object update\n let parent = baseObject(obj)\n parent[key] = baseObject(value)\n recordMutation('put', path, parent)\n return\n }\n\n // if we are overriding an existing non-object,\n // record update of parent base object\n if (key in obj && !isObject(obj[key])) {\n let base = baseObject(obj)\n delete base[key]\n recordMutation('put', path, base)\n }\n\n // if parent is array, ensure length gets updated\n if (Array.isArray(obj)) {\n let parent = baseObject(obj)\n recordMutation('put', path, parent)\n }\n\n let base = baseObject(value)\n recordMutation('put', path.concat(key), base)\n\n for (let childKey in value) {\n let child = value[childKey]\n\n // if any of our non-object children override an\n // existing object, then record deletion\n if (!isObject(child)) {\n if (!isObject(obj[key])) continue\n if (!isObject(obj[key][childKey])) continue\n del(obj[key], childKey, path.concat(key))\n continue\n }\n\n // recursively record puts for objects\n put(value, childKey, child, path.concat(key))\n }\n }\n\n function del (obj, key, path = []) {\n let value = obj[key]\n\n if (!isObject(obj[key])) {\n // record parent object update\n let parent = baseObject(obj)\n delete parent[key]\n recordMutation('put', path, parent)\n return\n }\n\n // recursively record deletions for objects\n for (let childKey in value) {\n let child = value[childKey]\n if (!isObject(child)) continue\n del(value, childKey, path.concat(key))\n }\n\n recordMutation('del', path.concat(key))\n }\n\n let wrapped = new Proxy(obj, {\n // recursively wrap child objects when accessed\n get (obj, key) {\n let value = obj[key]\n\n // functions should be bound to parent\n if (typeof value === 'function') {\n return value.bind(wrapped)\n }\n\n // don't recurse if not object\n if (!isObject(value)) {\n return value\n }\n\n // convert array bases to actual array\n if ('__MERK_ARRAY__' in value) {\n let base = value\n value = new Array(value.length)\n Object.assign(value, base)\n delete value.__MERK_ARRAY__\n }\n\n // if value is object, recursively wrap\n let childPath = path.concat(key)\n return wrap(value, onMutate, childPath)\n },\n\n // record mutations\n set (obj, key, value) {\n put(obj, key, value)\n obj[key] = value\n return true\n },\n\n // record deletions as mutations too\n deleteProperty (obj, key) {\n if (!(key in obj)) return true\n del(obj, key)\n delete obj[key]\n return true\n },\n\n // ovverride ownKeys to exclude symbol properties\n ownKeys () {\n return Object.getOwnPropertyNames(obj)\n }\n })\n return wrapped\n}","update (state, array) {\n // keys: ['some', 'path', 'to', 'data']\n let keys = array[0].split('.')\n // lastKey: 'data'; keys: ['some', 'path', 'to']\n const lastKey = keys.pop()\n // data: value\n let data = array[1]\n // dig into state by keys\n // result: initialize by state at first\n const pointer = keys.reduce((result, key) => {\n // key: 'some'\n if (key.length === 0) return result || {}\n // '1' => formattedKey: 1; 'some' => formattedKey: 'some'\n const formattedKey = isNaN(key) ? key : parseInt(key)\n // if the key 'some' exists in result, next result: result['some']\n // if not, set result['some'] = {}\n return result[formattedKey] || {}\n }, state)\n\n const isObject = pointer[lastKey] instanceof Object && pointer[lastKey].constructor === Object\n // set value to the specified key\n pointer[lastKey] = isObject ? { ...pointer[lastKey], ...data } : data\n }","function objectToFlatDictionary(x, keyPrefix)\r\n{\r\n\t//this.dictionaryData; //an associative array/object that will be converted to a dictionary and returned whenever this function finishes with nestingLevel==0.\r\n\tif(typeof objectToFlatDictionary.nestingLevel === 'undefined'){objectToFlatDictionary.nestingLevel = 0};\r\n\tvar keyPrefix;\r\n\tif(typeof keyPrefix === 'undefined'){ keyPrefix = \"\";}\r\n\t\r\n\tif (objectToFlatDictionary.nestingLevel==0) {objectToFlatDictionary.dictionaryData = {}; }; //initialize dictionaryData to an empty object\r\n\tobjectToFlatDictionary.nestingLevel++;\r\n\t\r\n\tfor (var key in x)\r\n\t{\r\n\t\tvar value = x[key];\r\n\t\tif( isObject(value)){\r\n\t\t\tobjectToFlatDictionary(value, keyPrefix + key + \".\");\r\n\t\t\t//objectToFlatDictionary.dictionaryData[\"\" + keyPrefix + key + \"OBJECT\"] = \"
\n );\n }","function CreatePost() {\n let history = useHistory()\n // Crear los valores iniciales como un objeto y se lo paso como arg a Formik\n const initialValues = {\n title:\"\",\n postText:\"\",\n username:\"\"\n }\n\n // Esta variable me permite validar los datos de los inputs\n const validationSchema = Yup.object().shape({\n title: Yup.string().required(\"You must input a title\"),\n postText: Yup.string().required(\"You must input a Text from the post\"),\n username: Yup.string().min(3).max(15).required()\n })\n // Funcion que se va a ejecutar cuando se envie el formulario, Formik le pasa la data automaticamente\n const onSubmit = (data) => {\n axios.post(\"http://localhost:3001/posts\", data).then((response)=>{\n history.push(\"/\")\n })\n }\n\n return (\n
\\\");\\n $(index).effect(\\\"pulsate\\\",{times:3},500);\\n}\",\n \"lower() {\\n this.preview.style.zIndex = 0;\\n }\",\n \"handleConstraints() {\\n if (this.x < 0) {\\n this.x = 0;\\n }\\n if (this.x > width - 1) {\\n this.x = width - this.size;\\n }\\n if (this.y < 0) {\\n this.y = 0;\\n }\\n if (this.y > height - 1) {\\n this.y = height - this.size;\\n }\\n\\n\\n }\",\n \"flattenVisible() {\\n EventBus.$emit(\\\"try-flatten-visible-layers\\\");\\n }\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle$1(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n } // Gets the maximum area that the element is visible in due to any number of\",\n \"_renderUnslidable() {\\n let firstItemValue = this.get('firstItem').value;\\n let lastItemValue = this.get('lastItem').value;\\n if (firstItemValue > lastItemValue) {\\n const tmp = lastItemValue;\\n lastItemValue = firstItemValue;\\n firstItemValue = tmp;\\n }\\n const minText = this._formatItemValue(firstItemValue);\\n const maxText = this._formatItemValue(lastItemValue);\\n let minRadius = firstItemValue < (MIN_SIZE) ? (MIN_SIZE) : firstItemValue;\\n let maxRadius = lastItemValue > (MAX_SIZE) ? (MAX_SIZE) : lastItemValue;\\n if (minRadius > maxRadius) {\\n minRadius = MIN_SIZE;\\n maxRadius = MAX_SIZE;\\n }\\n if (this.get('layout') === 'vertical') {\\n this._addCircle(maxRadius, maxRadius, minRadius, minText, 2 * maxRadius); // min\\n this._addCircle(maxRadius, maxRadius * 2 + CIRCLE_GAP + minRadius, maxRadius, maxText, 2 * maxRadius); // max\\n } else {\\n this._addCircle(maxRadius, maxRadius, minRadius, minText, 2 * maxRadius); // min\\n this._addCircle(maxRadius * 2 + CIRCLE_GAP + minRadius, maxRadius, maxRadius, maxText, 2 * maxRadius); // max\\n }\\n }\",\n \"function SnapBack(el) {\\n // Original absolute center position\\n el.style.top = '50%';\\n el.style.left = '50%';\\n el.style.transform = 'translate(-50%, -50%)';\\n el.style.transition = 'all 0.3s ease-in-out';\\n}\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle_getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function emptySquares() {\\r\\n return origBoard.filter((elm, i) => i===elm);\\r\\n}\",\n \"function getClippingParents(element) {\\n var clippingParents = Object(_listScrollParents_js__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"])(element);\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(Object(_getComputedStyle_js__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"])(element).position) >= 0;\\n var clipperElement = canEscapeClipping && Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isHTMLElement\\\"])(element) ? Object(_getOffsetParent_js__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(element) : element;\\n\\n if (!Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isElement\\\"])(clipperElement)) {\\n return [];\\n } // $FlowFixMe: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isElement\\\"])(clippingParent) && Object(_contains_js__WEBPACK_IMPORTED_MODULE_10__[\\\"default\\\"])(clippingParent, clipperElement);\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = Object(_listScrollParents_js__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"])(element);\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(Object(_getComputedStyle_js__WEBPACK_IMPORTED_MODULE_6__[\\\"default\\\"])(element).position) >= 0;\\n var clipperElement = canEscapeClipping && Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isHTMLElement\\\"])(element) ? Object(_getOffsetParent_js__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(element) : element;\\n\\n if (!Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isElement\\\"])(clipperElement)) {\\n return [];\\n } // $FlowFixMe: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return Object(_instanceOf_js__WEBPACK_IMPORTED_MODULE_7__[\\\"isElement\\\"])(clippingParent) && Object(_contains_js__WEBPACK_IMPORTED_MODULE_10__[\\\"default\\\"])(clippingParent, clipperElement);\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle$1(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"RemoveClip() {}\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle_getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle_getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle_getComputedStyle(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"offscreen() {\\n if (this.x < -this.width) {\\n return true;\\n }\\n return false;\\n }\",\n \"function getClippingParents(element) {\\n var clippingParents = listScrollParents(getParentNode(element));\\n var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle$1(element).position) >= 0;\\n var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\\n\\n if (!isElement(clipperElement)) {\\n return [];\\n } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\\n\\n\\n return clippingParents.filter(function (clippingParent) {\\n return isElement(clippingParent) && contains$1(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\\n });\\n} // Gets the maximum area that the element is visible in due to any number of\",\n \"constructor(viewOf, qmin, qmax) {\\n super(viewOf, (field, colLabel, colSchema, colData, df) =>\\n _clipAnnoMatrix(field, colLabel, colSchema, colData, df, qmin, qmax)\\n );\\n this.isClipped = true;\\n this.clipRange = [qmin, qmax];\\n Object.seal(this);\\n }\",\n \"function clip(x, min, max) {\\n return Math.min(Math.max(x, min), max);\\n}\",\n \"function blenderMoreHide (hide1, hide2){\\n if (mouseOnHide2 == 1) {\\n hide1.style.transform = \\\"scale(0)\\\";\\n hide2.style.transform = \\\"translateY(-500px)\\\"\\n }else {mouseOnHide2 = 0;}\\n}\",\n \"_updateThumbPosition() {\\n const that = this;\\n\\n if (that._supportCSSVariables || (that.inverted ? that.checked === true : that.checked === false) || !that._innerContainerSize) {\\n that.$.innerContainer.style.left = that.$.innerContainer.style.top = '';\\n return;\\n }\\n\\n if (that.inverted ? that.checked === false : that.checked) {\\n if (that.orientation === 'horizontal') {\\n that.$.innerContainer.style.left = (-1 * (that._innerContainerSize - that.$.switchThumb.offsetWidth)) + 'px';\\n that.$.innerContainer.style.top = '';\\n }\\n else {\\n that.$.innerContainer.style.top = (-1 * (that._innerContainerSize - that.$.switchThumb.offsetHeight)) + 'px';\\n that.$.innerContainer.style.left = '';\\n }\\n }\\n\\n if (that.checked === null) {\\n if (that.orientation === 'horizontal') {\\n that.$.innerContainer.style.left = (-1 * (that._innerContainerSize / 2 - that.$.switchThumb.offsetWidth / 2)) + 'px';\\n that.$.innerContainer.style.top = '';\\n }\\n else {\\n that.$.innerContainer.style.top = (-1 * (that._innerContainerSize / 2 - that.$.switchThumb.offsetHeight / 2)) + 'px';\\n that.$.innerContainer.style.left = '';\\n }\\n }\\n }\",\n \"clipTo (tree, alsoRemovecoplanarFront) {\\n let node = this\\n const stack = []\\n do {\\n if (node.polygontreenodes.length > 0) {\\n tree.rootnode.clipPolygons(node.polygontreenodes, alsoRemovecoplanarFront)\\n }\\n if (node.front) stack.push(node.front)\\n if (node.back) stack.push(node.back)\\n node = stack.pop()\\n } while (node !== undefined)\\n }\",\n \"function sizingInvisible($el, callback) {\\n\\t\\tvar targets;\\n\\n\\t\\t// We wish to target ourselves and any parents as long as\\n\\t\\t// they are not visible\\n\\t\\ttargets = $el.parents();\\n\\t\\ttargets.push($el[0]);\\n\\t\\ttargets = targets.not(':visible');\\n\\t\\tswap(targets, {\\n\\t\\t\\tvisibility: \\\"hidden\\\",\\n\\t\\t\\tdisplay: \\\"block\\\",\\n\\t\\t\\tposition: \\\"absolute\\\"\\n\\t\\t}, callback);\\n\\t}\",\n \"slide(row, dir) {\\n\\t\\tlet nonzero = row.filter(val => val);\\n\\t\\tnonzero = nonzero.concat(new Array(row.length - nonzero.length).fill(0));\\n\\t\\treturn dir > 0 ? nonzero : nonzero.reverse();\\n\\t}\",\n \"restoreElement(element) {\\n if (!element) return;\\n // FIX: it has to remember the previous values\\n element.style.zIndex = 0;\\n element.style.position = 'static';\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.53918445","0.5333649","0.52749443","0.52349114","0.5218984","0.5191169","0.517269","0.51595616","0.51427627","0.5067348","0.5044781","0.5034173","0.5027323","0.50227445","0.5005332","0.4976861","0.49688527","0.4966697","0.49623466","0.49615896","0.49284172","0.49234512","0.49196723","0.4891242","0.4889431","0.48865548","0.48642477","0.4855534","0.48514825","0.48430598","0.48391017","0.4829905","0.4829905","0.4829905","0.4829905","0.4829905","0.48298734","0.48245648","0.48198614","0.4814673","0.48104966","0.48095468","0.48053437","0.47878584","0.47709256","0.47709256","0.4757261","0.47512054","0.4750002","0.47418672","0.4737606","0.47311875","0.47158575","0.47158575","0.47158575","0.47158575","0.47070107","0.47052988","0.47044823","0.47044823","0.47044823","0.4702747","0.4702747","0.4702747","0.47007844","0.4691661","0.46893084","0.46823862","0.46821928","0.4677497","0.4661674","0.46610802","0.46606967","0.46599954","0.46599615","0.46589753","0.46579492","0.46514603","0.46514603","0.46514603","0.46514603","0.463872","0.46362302","0.46350354","0.46350354","0.4634298","0.46327505","0.46317226","0.46317226","0.46317226","0.46302056","0.46283016","0.46281987","0.46258378","0.46256658","0.46248648","0.46236008","0.4613235","0.46128452","0.46085227"],"string":"[\n \"0.53918445\",\n \"0.5333649\",\n \"0.52749443\",\n \"0.52349114\",\n \"0.5218984\",\n \"0.5191169\",\n \"0.517269\",\n \"0.51595616\",\n \"0.51427627\",\n \"0.5067348\",\n \"0.5044781\",\n \"0.5034173\",\n \"0.5027323\",\n \"0.50227445\",\n \"0.5005332\",\n \"0.4976861\",\n \"0.49688527\",\n \"0.4966697\",\n \"0.49623466\",\n \"0.49615896\",\n \"0.49284172\",\n \"0.49234512\",\n \"0.49196723\",\n \"0.4891242\",\n \"0.4889431\",\n \"0.48865548\",\n \"0.48642477\",\n \"0.4855534\",\n \"0.48514825\",\n \"0.48430598\",\n \"0.48391017\",\n \"0.4829905\",\n \"0.4829905\",\n \"0.4829905\",\n \"0.4829905\",\n \"0.4829905\",\n \"0.48298734\",\n \"0.48245648\",\n \"0.48198614\",\n \"0.4814673\",\n \"0.48104966\",\n \"0.48095468\",\n \"0.48053437\",\n \"0.47878584\",\n \"0.47709256\",\n \"0.47709256\",\n \"0.4757261\",\n \"0.47512054\",\n \"0.4750002\",\n \"0.47418672\",\n \"0.4737606\",\n \"0.47311875\",\n \"0.47158575\",\n \"0.47158575\",\n \"0.47158575\",\n \"0.47158575\",\n \"0.47070107\",\n \"0.47052988\",\n \"0.47044823\",\n \"0.47044823\",\n \"0.47044823\",\n \"0.4702747\",\n \"0.4702747\",\n \"0.4702747\",\n \"0.47007844\",\n \"0.4691661\",\n \"0.46893084\",\n \"0.46823862\",\n \"0.46821928\",\n \"0.4677497\",\n \"0.4661674\",\n \"0.46610802\",\n \"0.46606967\",\n \"0.46599954\",\n \"0.46599615\",\n \"0.46589753\",\n \"0.46579492\",\n \"0.46514603\",\n \"0.46514603\",\n \"0.46514603\",\n \"0.46514603\",\n \"0.463872\",\n \"0.46362302\",\n \"0.46350354\",\n \"0.46350354\",\n \"0.4634298\",\n \"0.46327505\",\n \"0.46317226\",\n \"0.46317226\",\n \"0.46317226\",\n \"0.46302056\",\n \"0.46283016\",\n \"0.46281987\",\n \"0.46258378\",\n \"0.46256658\",\n \"0.46248648\",\n \"0.46236008\",\n \"0.4613235\",\n \"0.46128452\",\n \"0.46085227\"\n]"},"document_score":{"kind":"string","value":"0.5042726"},"document_rank":{"kind":"string","value":"11"}}},{"rowIdx":82032,"cells":{"query":{"kind":"string","value":"Composite means it takes into account transforms as well as layout."},"document":{"kind":"string","value":"function getCompositeRect(elementOrVirtualElement,offsetParent,isFixed){if(isFixed===void 0){isFixed=false;}var documentElement=getDocumentElement(offsetParent);var rect=getBoundingClientRect(elementOrVirtualElement);var isOffsetParentAnElement=isHTMLElement(offsetParent);var scroll={scrollLeft:0,scrollTop:0};var offsets={x:0,y:0};if(isOffsetParentAnElement||!isOffsetParentAnElement&&!isFixed){if(getNodeName(offsetParent)!=='body'||// https://github.com/popperjs/popper-core/issues/1078\nisScrollParent(documentElement)){scroll=getNodeScroll(offsetParent);}if(isHTMLElement(offsetParent)){offsets=getBoundingClientRect(offsetParent);offsets.x+=offsetParent.clientLeft;offsets.y+=offsetParent.clientTop;}else if(documentElement){offsets.x=getWindowScrollBarX(documentElement);}}return {x:rect.left+scroll.scrollLeft-offsets.x,y:rect.top+scroll.scrollTop-offsets.y,width:rect.width,height:rect.height};}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function composite(src, ops) {\n console.log('composite operations');\n console.log(ops);\n\n var mat = Matrix3x3.identity();\n for(var i=0;i