\r\n\r\n`;\n// Exports\nmodule.exports = code;","/*!\r\n Knockout Fast Foreach v0.6.0 (2016-07-28T11:02:54.197Z)\r\n By: Brian M Hunt (C) 2015 | License: MIT\r\n\r\n Adds `fastForEach` to `ko.bindingHandlers`.\r\n*/\r\n(function (root, factory) {\r\n if (typeof define === 'function' && define.amd) {\r\n define(['ko'], factory);\r\n } else if (typeof exports === 'object') {\r\n module.exports = factory(require('ko'));\r\n } else {\r\n root.KnockoutFastForeach = factory(root.ko);\r\n }\r\n}(this, function (ko) {\r\n \"use strict\";\r\n// index.js\r\n// --------\r\n// Fast For Each\r\n//\r\n// Employing sound techniques to make a faster Knockout foreach binding.\r\n// --------\r\n\r\n// Utilities\r\n var MAX_LIST_SIZE = 9007199254740991;\r\n\r\n// from https://github.com/jonschlinkert/is-plain-object\r\n function isPlainObject(o) {\r\n return !!o && typeof o === 'object' && o.constructor === Object;\r\n }\r\n\r\n// From knockout/src/virtualElements.js\r\n var commentNodesHaveTextProperty = document && document.createComment(\"test\").text === \"\";\r\n var startCommentRegex = commentNodesHaveTextProperty ? /^$/ : /^\\s*ko(?:\\s+([\\s\\S]+))?\\s*$/;\r\n var supportsDocumentFragment = document && typeof document.createDocumentFragment === \"function\";\r\n function isVirtualNode(node) {\r\n return (node.nodeType === 8) && startCommentRegex.test(commentNodesHaveTextProperty ? node.text : node.nodeValue);\r\n }\r\n\r\n\r\n// Get a copy of the (possibly virtual) child nodes of the given element,\r\n// put them into a container, then empty the given node.\r\n function makeTemplateNode(sourceNode) {\r\n var container = document.createElement(\"div\");\r\n var parentNode;\r\n if (sourceNode.content) {\r\n // For e.g. tags\r\n parentNode = sourceNode.content;\r\n } else if (sourceNode.tagName === 'SCRIPT') {\r\n parentNode = document.createElement(\"div\");\r\n parentNode.innerHTML = sourceNode.text;\r\n } else {\r\n // Anything else e.g.
\r\n parentNode = sourceNode;\r\n }\r\n ko.utils.arrayForEach(ko.virtualElements.childNodes(parentNode), function (child) {\r\n // FIXME - This cloneNode could be expensive; we may prefer to iterate over the\r\n // parentNode children in reverse (so as not to foul the indexes as childNodes are\r\n // removed from parentNode when inserted into the container)\r\n if (child) {\r\n container.insertBefore(child.cloneNode(true), null);\r\n }\r\n });\r\n return container;\r\n }\r\n\r\n// Mimic a KO change item 'add'\r\n function valueToChangeAddItem(value, index) {\r\n return {\r\n status: 'added',\r\n value: value,\r\n index: index\r\n };\r\n }\r\n\r\n// KO 3.4 doesn't seem to export this utility function so it's here just to be sure\r\n function createSymbolOrString(identifier) {\r\n return typeof Symbol === 'function' ? Symbol(identifier) : identifier;\r\n }\r\n\r\n// store a symbol for caching the pending delete info index in the data item objects\r\n var PENDING_DELETE_INDEX_KEY = createSymbolOrString(\"_ko_ffe_pending_delete_index\");\r\n\r\n function FastForEach(spec) {\r\n this.element = spec.element;\r\n this.container = isVirtualNode(this.element) ?\r\n this.element.parentNode : this.element;\r\n this.$context = spec.$context;\r\n this.data = spec.data;\r\n this.as = spec.as;\r\n this.noContext = spec.noContext;\r\n this.noIndex = spec.noIndex;\r\n this.afterAdd = spec.afterAdd;\r\n this.beforeRemove = spec.beforeRemove;\r\n this.templateNode = makeTemplateNode(\r\n spec.templateNode || (spec.name ? document.getElementById(spec.name).cloneNode(true) : spec.element)\r\n );\r\n this.afterQueueFlush = spec.afterQueueFlush;\r\n this.beforeQueueFlush = spec.beforeQueueFlush;\r\n this.changeQueue = [];\r\n this.firstLastNodesList = [];\r\n this.indexesToDelete = [];\r\n this.rendering_queued = false;\r\n this.pendingDeletes = [];\r\n\r\n // Remove existing content.\r\n ko.virtualElements.emptyNode(this.element);\r\n\r\n // Prime content\r\n var primeData = ko.unwrap(this.data);\r\n if (primeData && primeData.map) {\r\n this.onArrayChange(primeData.map(valueToChangeAddItem), true);\r\n }\r\n\r\n // Watch for changes\r\n if (ko.isObservable(this.data)) {\r\n if (!this.data.indexOf) {\r\n // Make sure the observable is trackable.\r\n this.data = this.data.extend({ trackArrayChanges: true });\r\n }\r\n this.changeSubs = this.data.subscribe(this.onArrayChange, this, 'arrayChange');\r\n }\r\n }\r\n\r\n FastForEach.PENDING_DELETE_INDEX_KEY = PENDING_DELETE_INDEX_KEY;\r\n\r\n FastForEach.animateFrame = window.requestAnimationFrame || window.webkitRequestAnimationFrame ||\r\n window.mozRequestAnimationFrame || window.msRequestAnimationFrame ||\r\n function (cb) { return window.setTimeout(cb, 1000 / 60); };\r\n\r\n\r\n FastForEach.prototype.dispose = function () {\r\n if (this.changeSubs) {\r\n this.changeSubs.dispose();\r\n }\r\n this.flushPendingDeletes();\r\n };\r\n\r\n\r\n// If the array changes we register the change.\r\n FastForEach.prototype.onArrayChange = function (changeSet, isInitial) {\r\n var self = this;\r\n var changeMap = {\r\n added: [],\r\n deleted: []\r\n };\r\n\r\n // knockout array change notification index handling:\r\n // - sends the original array indexes for deletes\r\n // - sends the new array indexes for adds\r\n // - sorts them all by index in ascending order\r\n // because of this, when checking for possible batch additions, any delete can be between to adds with neighboring indexes, so only additions should be checked\r\n for (var i = 0, len = changeSet.length; i < len; i++) {\r\n\r\n if (changeMap.added.length && changeSet[i].status == 'added') {\r\n var lastAdd = changeMap.added[changeMap.added.length - 1];\r\n var lastIndex = lastAdd.isBatch ? lastAdd.index + lastAdd.values.length - 1 : lastAdd.index;\r\n if (lastIndex + 1 == changeSet[i].index) {\r\n if (!lastAdd.isBatch) {\r\n // transform the last addition into a batch addition object\r\n lastAdd = {\r\n isBatch: true,\r\n status: 'added',\r\n index: lastAdd.index,\r\n values: [lastAdd.value]\r\n };\r\n changeMap.added.splice(changeMap.added.length - 1, 1, lastAdd);\r\n }\r\n lastAdd.values.push(changeSet[i].value);\r\n continue;\r\n }\r\n }\r\n\r\n changeMap[changeSet[i].status].push(changeSet[i]);\r\n }\r\n\r\n if (changeMap.deleted.length > 0) {\r\n this.changeQueue.push.apply(this.changeQueue, changeMap.deleted);\r\n this.changeQueue.push({ status: 'clearDeletedIndexes' });\r\n }\r\n this.changeQueue.push.apply(this.changeQueue, changeMap.added);\r\n // Once a change is registered, the ticking count-down starts for the processQueue.\r\n if (this.changeQueue.length > 0 && !this.rendering_queued) {\r\n this.rendering_queued = true;\r\n if (isInitial) {\r\n self.processQueue();\r\n } else {\r\n FastForEach.animateFrame.call(window, function () { self.processQueue(); });\r\n }\r\n }\r\n };\r\n\r\n\r\n// Reflect all the changes in the queue in the DOM, then wipe the queue.\r\n FastForEach.prototype.processQueue = function () {\r\n var self = this;\r\n var lowestIndexChanged = MAX_LIST_SIZE;\r\n\r\n // Callback so folks can do things before the queue flush.\r\n if (typeof this.beforeQueueFlush === 'function') {\r\n this.beforeQueueFlush(this.changeQueue);\r\n }\r\n\r\n ko.utils.arrayForEach(this.changeQueue, function (changeItem) {\r\n if (typeof changeItem.index === 'number') {\r\n lowestIndexChanged = Math.min(lowestIndexChanged, changeItem.index);\r\n }\r\n // console.log(self.data(), \"CI\", JSON.stringify(changeItem, null, 2), JSON.stringify($(self.element).text()))\r\n self[changeItem.status](changeItem);\r\n // console.log(\" ==> \", JSON.stringify($(self.element).text()))\r\n });\r\n this.flushPendingDeletes();\r\n this.rendering_queued = false;\r\n\r\n // Update our indexes.\r\n if (!this.noIndex) {\r\n this.updateIndexes(lowestIndexChanged);\r\n }\r\n\r\n // Callback so folks can do things.\r\n if (typeof this.afterQueueFlush === 'function') {\r\n this.afterQueueFlush(this.changeQueue);\r\n }\r\n this.changeQueue = [];\r\n };\r\n\r\n\r\n function extendWithIndex(context) {\r\n context.$index = ko.observable();\r\n };\r\n\r\n\r\n// Process a changeItem with {status: 'added', ...}\r\n FastForEach.prototype.added = function (changeItem) {\r\n var index = changeItem.index;\r\n var valuesToAdd = changeItem.isBatch ? changeItem.values : [changeItem.value];\r\n var referenceElement = this.getLastNodeBeforeIndex(index);\r\n // gather all childnodes for a possible batch insertion\r\n var allChildNodes = [];\r\n\r\n for (var i = 0, len = valuesToAdd.length; i < len; ++i) {\r\n var childNodes;\r\n\r\n // we check if we have a pending delete with reusable nodesets for this data, and if yes, we reuse one nodeset\r\n var pendingDelete = this.getPendingDeleteFor(valuesToAdd[i]);\r\n if (pendingDelete && pendingDelete.nodesets.length) {\r\n childNodes = pendingDelete.nodesets.pop();\r\n } else {\r\n var templateClone = this.templateNode.cloneNode(true);\r\n var childContext;\r\n\r\n if (this.noContext) {\r\n childContext = this.$context.extend({\r\n $item: valuesToAdd[i],\r\n $index: this.noIndex ? undefined : ko.observable()\r\n });\r\n } else {\r\n childContext = this.$context.createChildContext(valuesToAdd[i], this.as || null, this.noIndex ? undefined : extendWithIndex);\r\n }\r\n\r\n // apply bindings first, and then process child nodes, because bindings can add childnodes\r\n ko.applyBindingsToDescendants(childContext, templateClone);\r\n\r\n childNodes = ko.virtualElements.childNodes(templateClone);\r\n }\r\n\r\n // Note discussion at https://github.com/angular/angular.js/issues/7851\r\n allChildNodes.push.apply(allChildNodes, Array.prototype.slice.call(childNodes));\r\n this.firstLastNodesList.splice(index + i, 0, { first: childNodes[0], last: childNodes[childNodes.length - 1] });\r\n }\r\n\r\n if (typeof this.afterAdd === 'function') {\r\n this.afterAdd({\r\n nodeOrArrayInserted: this.insertAllAfter(allChildNodes, referenceElement),\r\n foreachInstance: this\r\n }\r\n );\r\n } else {\r\n this.insertAllAfter(allChildNodes, referenceElement);\r\n }\r\n };\r\n\r\n FastForEach.prototype.getNodesForIndex = function (index) {\r\n var result = [],\r\n ptr = this.firstLastNodesList[index].first,\r\n last = this.firstLastNodesList[index].last;\r\n result.push(ptr);\r\n while (ptr && ptr !== last) {\r\n ptr = ptr.nextSibling;\r\n result.push(ptr);\r\n }\r\n return result;\r\n };\r\n\r\n FastForEach.prototype.getLastNodeBeforeIndex = function (index) {\r\n if (index < 1 || index - 1 >= this.firstLastNodesList.length)\r\n return null;\r\n return this.firstLastNodesList[index - 1].last;\r\n };\r\n\r\n FastForEach.prototype.insertAllAfter = function (nodeOrNodeArrayToInsert, insertAfterNode) {\r\n var frag, len, i,\r\n containerNode = this.element;\r\n\r\n // poor man's node and array check, should be enough for this\r\n if (nodeOrNodeArrayToInsert.nodeType === undefined && nodeOrNodeArrayToInsert.length === undefined) {\r\n throw new Error(\"Expected a single node or a node array\");\r\n }\r\n if (nodeOrNodeArrayToInsert.nodeType !== undefined) {\r\n ko.virtualElements.insertAfter(containerNode, nodeOrNodeArrayToInsert, insertAfterNode);\r\n return [nodeOrNodeArrayToInsert];\r\n } else if (nodeOrNodeArrayToInsert.length === 1) {\r\n ko.virtualElements.insertAfter(containerNode, nodeOrNodeArrayToInsert[0], insertAfterNode);\r\n } else if (supportsDocumentFragment) {\r\n frag = document.createDocumentFragment();\r\n\r\n for (i = 0, len = nodeOrNodeArrayToInsert.length; i !== len; ++i) {\r\n frag.appendChild(nodeOrNodeArrayToInsert[i]);\r\n }\r\n ko.virtualElements.insertAfter(containerNode, frag, insertAfterNode);\r\n } else {\r\n // Nodes are inserted in reverse order - pushed down immediately after\r\n // the last node for the previous item or as the first node of element.\r\n for (i = nodeOrNodeArrayToInsert.length - 1; i >= 0; --i) {\r\n var child = nodeOrNodeArrayToInsert[i];\r\n if (!child) { break; }\r\n ko.virtualElements.insertAfter(containerNode, child, insertAfterNode);\r\n }\r\n }\r\n return nodeOrNodeArrayToInsert;\r\n };\r\n\r\n// checks if the deleted data item should be handled with delay for a possible reuse at additions\r\n FastForEach.prototype.shouldDelayDeletion = function (data) {\r\n return data && (typeof data === \"object\" || typeof data === \"function\");\r\n };\r\n\r\n// gets the pending deletion info for this data item\r\n FastForEach.prototype.getPendingDeleteFor = function (data) {\r\n var index = data && data[PENDING_DELETE_INDEX_KEY];\r\n if (index === undefined) return null;\r\n return this.pendingDeletes[index];\r\n };\r\n\r\n// tries to find the existing pending delete info for this data item, and if it can't, it registeres one\r\n FastForEach.prototype.getOrCreatePendingDeleteFor = function (data) {\r\n var pd = this.getPendingDeleteFor(data);\r\n if (pd) {\r\n return pd;\r\n }\r\n pd = {\r\n data: data,\r\n nodesets: []\r\n };\r\n data[PENDING_DELETE_INDEX_KEY] = this.pendingDeletes.length;\r\n this.pendingDeletes.push(pd);\r\n return pd;\r\n };\r\n\r\n// Process a changeItem with {status: 'deleted', ...}\r\n FastForEach.prototype.deleted = function (changeItem) {\r\n // if we should delay the deletion of this data, we add the nodeset to the pending delete info object\r\n if (this.shouldDelayDeletion(changeItem.value)) {\r\n var pd = this.getOrCreatePendingDeleteFor(changeItem.value);\r\n pd.nodesets.push(this.getNodesForIndex(changeItem.index));\r\n } else { // simple data, just remove the nodes\r\n this.removeNodes(this.getNodesForIndex(changeItem.index));\r\n }\r\n this.indexesToDelete.push(changeItem.index);\r\n };\r\n\r\n// removes a set of nodes from the DOM\r\n FastForEach.prototype.removeNodes = function (nodes) {\r\n if (!nodes.length) { return; }\r\n\r\n var removeFn = function () {\r\n var parent = nodes[0].parentNode;\r\n for (var i = nodes.length - 1; i >= 0; --i) {\r\n ko.cleanNode(nodes[i]);\r\n parent.removeChild(nodes[i]);\r\n }\r\n };\r\n\r\n if (this.beforeRemove) {\r\n var beforeRemoveReturn = this.beforeRemove({\r\n nodesToRemove: nodes, foreachInstance: this\r\n }) || {};\r\n // If beforeRemove returns a `then`–able e.g. a Promise, we remove\r\n // the nodes when that thenable completes. We pass any errors to\r\n // ko.onError.\r\n if (typeof beforeRemoveReturn.then === 'function') {\r\n beforeRemoveReturn.then(removeFn, ko.onError ? ko.onError : undefined);\r\n }\r\n } else {\r\n removeFn();\r\n }\r\n };\r\n\r\n// flushes the pending delete info store\r\n// this should be called after queue processing has finished, so that data items and remaining (not reused) nodesets get cleaned up\r\n// we also call it on dispose not to leave any mess\r\n FastForEach.prototype.flushPendingDeletes = function () {\r\n for (var i = 0, len = this.pendingDeletes.length; i != len; ++i) {\r\n var pd = this.pendingDeletes[i];\r\n while (pd.nodesets.length) {\r\n this.removeNodes(pd.nodesets.pop());\r\n }\r\n if (pd.data && pd.data[PENDING_DELETE_INDEX_KEY] !== undefined)\r\n delete pd.data[PENDING_DELETE_INDEX_KEY];\r\n }\r\n this.pendingDeletes = [];\r\n };\r\n\r\n// We batch our deletion of item indexes in our parallel array.\r\n// See brianmhunt/knockout-fast-foreach#6/#8\r\n FastForEach.prototype.clearDeletedIndexes = function () {\r\n // We iterate in reverse on the presumption (following the unit tests) that KO's diff engine\r\n // processes diffs (esp. deletes) monotonically ascending i.e. from index 0 -> N.\r\n for (var i = this.indexesToDelete.length - 1; i >= 0; --i) {\r\n this.firstLastNodesList.splice(this.indexesToDelete[i], 1);\r\n }\r\n this.indexesToDelete = [];\r\n };\r\n\r\n\r\n FastForEach.prototype.getContextStartingFrom = function (node) {\r\n var ctx;\r\n while (node) {\r\n ctx = ko.contextFor(node);\r\n if (ctx) { return ctx; }\r\n node = node.nextSibling;\r\n }\r\n };\r\n\r\n\r\n FastForEach.prototype.updateIndexes = function (fromIndex) {\r\n var ctx;\r\n for (var i = fromIndex, len = this.firstLastNodesList.length; i < len; ++i) {\r\n ctx = this.getContextStartingFrom(this.firstLastNodesList[i].first);\r\n if (ctx) { ctx.$index(i); }\r\n }\r\n };\r\n\r\n\r\n ko.bindingHandlers.fastForEach = {\r\n // Valid valueAccessors:\r\n // []\r\n // ko.observable([])\r\n // ko.observableArray([])\r\n // ko.computed\r\n // {data: array, name: string, as: string}\r\n init: function init(element, valueAccessor, bindings, vm, context) {\r\n var ffe, value = valueAccessor();\r\n if (isPlainObject(value)) {\r\n value.element = value.element || element;\r\n value.$context = context;\r\n ffe = new FastForEach(value);\r\n } else {\r\n ffe = new FastForEach({\r\n element: element,\r\n data: ko.unwrap(context.$rawData) === value ? context.$rawData : value,\r\n $context: context\r\n });\r\n }\r\n\r\n ko.utils.domNodeDisposal.addDisposeCallback(element, function () {\r\n ffe.dispose();\r\n });\r\n return { controlsDescendantBindings: true };\r\n },\r\n\r\n // Export for testing, debugging, and overloading.\r\n FastForEach: FastForEach\r\n };\r\n\r\n ko.virtualElements.allowedBindings.fastForEach = true;\r\n}));\r\n","module.exports = \"// Module\\nvar code = `
![](\\\"/assets/icons/icon-variants-white-16.svg\\\")
\\r\\n ![](\"/assets/icons/icon-variants-white-16.svg\"){kind=icon}
\r\n