<tr><td></td><td>t</td></tr></table>\",s=r.getElementsByTagName(\"td\"),s[0].style.cssText=\"padding:0;margin:0;border:0;display:none\",c=s[0].offsetHeight===0,s[0].style.display=\"\",s[1].style.display=\"none\",t.reliableHiddenOffsets=c&&s[0].offsetHeight===0,r.innerHTML=\"\",r.style.cssText=\"box-sizing:border-box;-moz-box-sizing:border-box;-webkit-box-sizing:border-box;padding:1px;border:1px;display:block;width:4px;margin-top:1%;position:absolute;top:1%;\",t.boxSizing=r.offsetWidth===4,t.doesNotIncludeMarginInBodyOffset=a.offsetTop!==1,e.getComputedStyle&&(t.pixelPosition=(e.getComputedStyle(r,null)||{}).top!==\"1%\",t.boxSizingReliable=(e.getComputedStyle(r,null)||{width:\"4px\"}).width===\"4px\",o=i.createElement(\"div\"),o.style.cssText=r.style.cssText=u,o.style.marginRight=o.style.width=\"0\",r.style.width=\"1px\",r.appendChild(o),t.reliableMarginRight=!parseFloat((e.getComputedStyle(o,null)||{}).marginRight)),typeof r.style.zoom!=\"undefined\"&&(r.innerHTML=\"\",r.style.cssText=u+\"width:1px;padding:1px;display:inline;zoom:1\",t.inlineBlockNeedsLayout=r.offsetWidth===3,r.style.display=\"block\",r.style.overflow=\"visible\",r.innerHTML=\"<div></div>\",r.firstChild.style.width=\"5px\",t.shrinkWrapBlocks=r.offsetWidth!==3,n.style.zoom=1),a.removeChild(n),n=r=s=o=null}),a.removeChild(p),n=r=s=o=u=a=p=null,t}();var D=/(?:\\{[\\s\\S]*\\}|\\[[\\s\\S]*\\])$/,P=/([A-Z])/g;v.extend({cache:{},deletedIds:[],uuid:0,expando:\"jQuery\"+(v.fn.jquery+Math.random()).replace(/\\D/g,\"\"),noData:{embed:!0,object:\"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000\",applet:!0},hasData:function(e){return e=e.nodeType?v.cache[e[v.expando]]:e[v.expando],!!e&&!B(e)},data:function(e,n,r,i){if(!v.acceptData(e))return;var s,o,u=v.expando,a=typeof n==\"string\",f=e.nodeType,l=f?v.cache:e,c=f?e[u]:e[u]&&u;if((!c||!l[c]||!i&&!l[c].data)&&a&&r===t)return;c||(f?e[u]=c=v.deletedIds.pop()||v.guid++:c=u),l[c]||(l[c]={},f||(l[c].toJSON=v.noop));if(typeof n==\"object\"||typeof n==\"function\")i?l[c]=v.extend(l[c],n):l[c].data=v.extend(l[c].data,n);return s=l[c],i||(s.data||(s.data={}),s=s.data),r!==t&&(s[v.camelCase(n)]=r),a?(o=s[n],o==null&&(o=s[v.camelCase(n)])):o=s,o},removeData:function(e,t,n){if(!v.acceptData(e))return;var r,i,s,o=e.nodeType,u=o?v.cache:e,a=o?e[v.expando]:v.expando;if(!u[a])return;if(t){r=n?u[a]:u[a].data;if(r){v.isArray(t)||(t in r?t=[t]:(t=v.camelCase(t),t in r?t=[t]:t=t.split(\" \")));for(i=0,s=t.length;i<s;i++)delete r[t[i]];if(!(n?B:v.isEmptyObject)(r))return}}if(!n){delete u[a].data;if(!B(u[a]))return}o?v.cleanData([e],!0):v.support.deleteExpando||u!=u.window?delete u[a]:u[a]=null},_data:function(e,t,n){return v.data(e,t,n,!0)},acceptData:function(e){var t=e.nodeName&&v.noData[e.nodeName.toLowerCase()];return!t||t!==!0&&e.getAttribute(\"classid\")===t}}),v.fn.extend({data:function(e,n){var r,i,s,o,u,a=this[0],f=0,l=null;if(e===t){if(this.length){l=v.data(a);if(a.nodeType===1&&!v._data(a,\"parsedAttrs\")){s=a.attributes;for(u=s.length;f<u;f++)o=s[f].name,o.indexOf(\"data-\")||(o=v.camelCase(o.substring(5)),H(a,o,l[o]));v._data(a,\"parsedAttrs\",!0)}}return l}return typeof e==\"object\"?this.each(function(){v.data(this,e)}):(r=e.split(\".\",2),r[1]=r[1]?\".\"+r[1]:\"\",i=r[1]+\"!\",v.access(this,function(n){if(n===t)return l=this.triggerHandler(\"getData\"+i,[r[0]]),l===t&&a&&(l=v.data(a,e),l=H(a,e,l)),l===t&&r[1]?this.data(r[0]):l;r[1]=n,this.each(function(){var t=v(this);t.triggerHandler(\"setData\"+i,r),v.data(this,e,n),t.triggerHandler(\"changeData\"+i,r)})},null,n,arguments.length>1,null,!1))},removeData:function(e){return this.each(function(){v.removeData(this,e)})}}),v.extend({queue:function(e,t,n){var r;if(e)return t=(t||\"fx\")+\"queue\",r=v._data(e,t),n&&(!r||v.isArray(n)?r=v._data(e,t,v.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||\"fx\";var n=v.queue(e,t),r=n.length,i=n.shift(),s=v._queueHooks(e,t),o=function(){v.dequeue(e,t)};i===\"inprogress\"&&(i=n.shift(),r--),i&&(t===\"fx\"&&n.unshift(\"inprogress\"),delete s.stop,i.call(e,o,s)),!r&&s&&s.empty.fire()},_queueHooks:function(e,t){var n=t+\"queueHooks\";return v._data(e,n)||v._data(e,n,{empty:v.Callbacks(\"once memory\").add(function(){v.removeData(e,t+\"queue\",!0),v.removeData(e,n,!0)})})}}),v.fn.extend({queue:function(e,n){var r=2;return typeof e!=\"string\"&&(n=e,e=\"fx\",r--),arguments.length<r?v.queue(this[0],e):n===t?this:this.each(function(){var t=v.queue(this,e,n);v._queueHooks(this,e),e===\"fx\"&&t[0]!==\"inprogress\"&&v.dequeue(this,e)})},dequeue:function(e){return this.each(function(){v.dequeue(this,e)})},delay:function(e,t){return e=v.fx?v.fx.speeds[e]||e:e,t=t||\"fx\",this.queue(t,function(t,n){var r=setTimeout(t,e);n.stop=function(){clearTimeout(r)}})},clearQueue:function(e){return this.queue(e||\"fx\",[])},promise:function(e,n){var r,i=1,s=v.Deferred(),o=this,u=this.length,a=function(){--i||s.resolveWith(o,[o])};typeof e!=\"string\"&&(n=e,e=t),e=e||\"fx\";while(u--)r=v._data(o[u],e+\"queueHooks\"),r&&r.empty&&(i++,r.empty.add(a));return a(),s.promise(n)}});var j,F,I,q=/[\\t\\r\\n]/g,R=/\\r/g,U=/^(?:button|input)$/i,z=/^(?:button|input|object|select|textarea)$/i,W=/^a(?:rea|)$/i,X=/^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,V=v.support.getSetAttribute;v.fn.extend({attr:function(e,t){return v.access(this,v.attr,e,t,arguments.length>1)},removeAttr:function(e){return this.each(function(){v.removeAttr(this,e)})},prop:function(e,t){return v.access(this,v.prop,e,t,arguments.length>1)},removeProp:function(e){return e=v.propFix[e]||e,this.each(function(){try{this[e]=t,delete this[e]}catch(n){}})},addClass:function(e){var t,n,r,i,s,o,u;if(v.isFunction(e))return this.each(function(t){v(this).addClass(e.call(this,t,this.className))});if(e&&typeof e==\"string\"){t=e.split(y);for(n=0,r=this.length;n<r;n++){i=this[n];if(i.nodeType===1)if(!i.className&&t.length===1)i.className=e;else{s=\" \"+i.className+\" \";for(o=0,u=t.length;o<u;o++)s.indexOf(\" \"+t[o]+\" \")<0&&(s+=t[o]+\" \");i.className=v.trim(s)}}}return this},removeClass:function(e){var n,r,i,s,o,u,a;if(v.isFunction(e))return this.each(function(t){v(this).removeClass(e.call(this,t,this.className))});if(e&&typeof e==\"string\"||e===t){n=(e||\"\").split(y);for(u=0,a=this.length;u<a;u++){i=this[u];if(i.nodeType===1&&i.className){r=(\" \"+i.className+\" \").replace(q,\" \");for(s=0,o=n.length;s<o;s++)while(r.indexOf(\" \"+n[s]+\" \")>=0)r=r.replace(\" \"+n[s]+\" \",\" \");i.className=e?v.trim(r):\"\"}}}return this},toggleClass:function(e,t){var n=typeof e,r=typeof t==\"boolean\";return v.isFunction(e)?this.each(function(n){v(this).toggleClass(e.call(this,n,this.className,t),t)}):this.each(function(){if(n===\"string\"){var i,s=0,o=v(this),u=t,a=e.split(y);while(i=a[s++])u=r?u:!o.hasClass(i),o[u?\"addClass\":\"removeClass\"](i)}else if(n===\"undefined\"||n===\"boolean\")this.className&&v._data(this,\"__className__\",this.className),this.className=this.className||e===!1?\"\":v._data(this,\"__className__\")||\"\"})},hasClass:function(e){var t=\" \"+e+\" \",n=0,r=this.length;for(;n<r;n++)if(this[n].nodeType===1&&(\" \"+this[n].className+\" \").replace(q,\" \").indexOf(t)>=0)return!0;return!1},val:function(e){var n,r,i,s=this[0];if(!arguments.length){if(s)return n=v.valHooks[s.type]||v.valHooks[s.nodeName.toLowerCase()],n&&\"get\"in n&&(r=n.get(s,\"value\"))!==t?r:(r=s.value,typeof r==\"string\"?r.replace(R,\"\"):r==null?\"\":r);return}return i=v.isFunction(e),this.each(function(r){var s,o=v(this);if(this.nodeType!==1)return;i?s=e.call(this,r,o.val()):s=e,s==null?s=\"\":typeof s==\"number\"?s+=\"\":v.isArray(s)&&(s=v.map(s,function(e){return e==null?\"\":e+\"\"})),n=v.valHooks[this.type]||v.valHooks[this.nodeName.toLowerCase()];if(!n||!(\"set\"in n)||n.set(this,s,\"value\")===t)this.value=s})}}),v.extend({valHooks:{option:{get:function(e){var t=e.attributes.value;return!t||t.specified?e.value:e.text}},select:{get:function(e){var t,n,r,i,s=e.selectedIndex,o=[],u=e.options,a=e.type===\"select-one\";if(s<0)return null;n=a?s:0,r=a?s+1:u.length;for(;n<r;n++){i=u[n];if(i.selected&&(v.support.optDisabled?!i.disabled:i.getAttribute(\"disabled\")===null)&&(!i.parentNode.disabled||!v.nodeName(i.parentNode,\"optgroup\"))){t=v(i).val();if(a)return t;o.push(t)}}return a&&!o.length&&u.length?v(u[s]).val():o},set:function(e,t){var n=v.makeArray(t);return v(e).find(\"option\").each(function(){this.selected=v.inArray(v(this).val(),n)>=0}),n.length||(e.selectedIndex=-1),n}}},attrFn:{},attr:function(e,n,r,i){var s,o,u,a=e.nodeType;if(!e||a===3||a===8||a===2)return;if(i&&v.isFunction(v.fn[n]))return v(e)[n](r);if(typeof e.getAttribute==\"undefined\")return v.prop(e,n,r);u=a!==1||!v.isXMLDoc(e),u&&(n=n.toLowerCase(),o=v.attrHooks[n]||(X.test(n)?F:j));if(r!==t){if(r===null){v.removeAttr(e,n);return}return o&&\"set\"in o&&u&&(s=o.set(e,r,n))!==t?s:(e.setAttribute(n,r+\"\"),r)}return o&&\"get\"in o&&u&&(s=o.get(e,n))!==null?s:(s=e.getAttribute(n),s===null?t:s)},removeAttr:function(e,t){var n,r,i,s,o=0;if(t&&e.nodeType===1){r=t.split(y);for(;o<r.length;o++)i=r[o],i&&(n=v.propFix[i]||i,s=X.test(i),s||v.attr(e,i,\"\"),e.removeAttribute(V?i:n),s&&n in e&&(e[n]=!1))}},attrHooks:{type:{set:function(e,t){if(U.test(e.nodeName)&&e.parentNode)v.error(\"type property can't be changed\");else if(!v.support.radioValue&&t===\"radio\"&&v.nodeName(e,\"input\")){var n=e.value;return e.setAttribute(\"type\",t),n&&(e.value=n),t}}},value:{get:function(e,t){return j&&v.nodeName(e,\"button\")?j.get(e,t):t in e?e.value:null},set:function(e,t,n){if(j&&v.nodeName(e,\"button\"))return j.set(e,t,n);e.value=t}}},propFix:{tabindex:\"tabIndex\",readonly:\"readOnly\",\"for\":\"htmlFor\",\"class\":\"className\",maxlength:\"maxLength\",cellspacing:\"cellSpacing\",cellpadding:\"cellPadding\",rowspan:\"rowSpan\",colspan:\"colSpan\",usemap:\"useMap\",frameborder:\"frameBorder\",contenteditable:\"contentEditable\"},prop:function(e,n,r){var i,s,o,u=e.nodeType;if(!e||u===3||u===8||u===2)return;return o=u!==1||!v.isXMLDoc(e),o&&(n=v.propFix[n]||n,s=v.propHooks[n]),r!==t?s&&\"set\"in s&&(i=s.set(e,r,n))!==t?i:e[n]=r:s&&\"get\"in s&&(i=s.get(e,n))!==null?i:e[n]},propHooks:{tabIndex:{get:function(e){var n=e.getAttributeNode(\"tabindex\");return n&&n.specified?parseInt(n.value,10):z.test(e.nodeName)||W.test(e.nodeName)&&e.href?0:t}}}}),F={get:function(e,n){var r,i=v.prop(e,n);return i===!0||typeof i!=\"boolean\"&&(r=e.getAttributeNode(n))&&r.nodeValue!==!1?n.toLowerCase():t},set:function(e,t,n){var r;return t===!1?v.removeAttr(e,n):(r=v.propFix[n]||n,r in e&&(e[r]=!0),e.setAttribute(n,n.toLowerCase())),n}},V||(I={name:!0,id:!0,coords:!0},j=v.valHooks.button={get:function(e,n){var r;return r=e.getAttributeNode(n),r&&(I[n]?r.value!==\"\":r.specified)?r.value:t},set:function(e,t,n){var r=e.getAttributeNode(n);return r||(r=i.createAttribute(n),e.setAttributeNode(r)),r.value=t+\"\"}},v.each([\"width\",\"height\"],function(e,t){v.attrHooks[t]=v.extend(v.attrHooks[t],{set:function(e,n){if(n===\"\")return e.setAttribute(t,\"auto\"),n}})}),v.attrHooks.contenteditable={get:j.get,set:function(e,t,n){t===\"\"&&(t=\"false\"),j.set(e,t,n)}}),v.support.hrefNormalized||v.each([\"href\",\"src\",\"width\",\"height\"],function(e,n){v.attrHooks[n]=v.extend(v.attrHooks[n],{get:function(e){var r=e.getAttribute(n,2);return r===null?t:r}})}),v.support.style||(v.attrHooks.style={get:function(e){return e.style.cssText.toLowerCase()||t},set:function(e,t){return e.style.cssText=t+\"\"}}),v.support.optSelected||(v.propHooks.selected=v.extend(v.propHooks.selected,{get:function(e){var t=e.parentNode;return t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex),null}})),v.support.enctype||(v.propFix.enctype=\"encoding\"),v.support.checkOn||v.each([\"radio\",\"checkbox\"],function(){v.valHooks[this]={get:function(e){return e.getAttribute(\"value\")===null?\"on\":e.value}}}),v.each([\"radio\",\"checkbox\"],function(){v.valHooks[this]=v.extend(v.valHooks[this],{set:function(e,t){if(v.isArray(t))return e.checked=v.inArray(v(e).val(),t)>=0}})});var $=/^(?:textarea|input|select)$/i,J=/^([^\\.]*|)(?:\\.(.+)|)$/,K=/(?:^|\\s)hover(\\.\\S+|)\\b/,Q=/^key/,G=/^(?:mouse|contextmenu)|click/,Y=/^(?:focusinfocus|focusoutblur)$/,Z=function(e){return v.event.special.hover?e:e.replace(K,\"mouseenter$1 mouseleave$1\")};v.event={add:function(e,n,r,i,s){var o,u,a,f,l,c,h,p,d,m,g;if(e.nodeType===3||e.nodeType===8||!n||!r||!(o=v._data(e)))return;r.handler&&(d=r,r=d.handler,s=d.selector),r.guid||(r.guid=v.guid++),a=o.events,a||(o.events=a={}),u=o.handle,u||(o.handle=u=function(e){return typeof v==\"undefined\"||!!e&&v.event.triggered===e.type?t:v.event.dispatch.apply(u.elem,arguments)},u.elem=e),n=v.trim(Z(n)).split(\" \");for(f=0;f<n.length;f++){l=J.exec(n[f])||[],c=l[1],h=(l[2]||\"\").split(\".\").sort(),g=v.event.special[c]||{},c=(s?g.delegateType:g.bindType)||c,g=v.event.special[c]||{},p=v.extend({type:c,origType:l[1],data:i,handler:r,guid:r.guid,selector:s,needsContext:s&&v.expr.match.needsContext.test(s),namespace:h.join(\".\")},d),m=a[c];if(!m){m=a[c]=[],m.delegateCount=0;if(!g.setup||g.setup.call(e,i,h,u)===!1)e.addEventListener?e.addEventListener(c,u,!1):e.attachEvent&&e.attachEvent(\"on\"+c,u)}g.add&&(g.add.call(e,p),p.handler.guid||(p.handler.guid=r.guid)),s?m.splice(m.delegateCount++,0,p):m.push(p),v.event.global[c]=!0}e=null},global:{},remove:function(e,t,n,r,i){var s,o,u,a,f,l,c,h,p,d,m,g=v.hasData(e)&&v._data(e);if(!g||!(h=g.events))return;t=v.trim(Z(t||\"\")).split(\" \");for(s=0;s<t.length;s++){o=J.exec(t[s])||[],u=a=o[1],f=o[2];if(!u){for(u in h)v.event.remove(e,u+t[s],n,r,!0);continue}p=v.event.special[u]||{},u=(r?p.delegateType:p.bindType)||u,d=h[u]||[],l=d.length,f=f?new RegExp(\"(^|\\\\.)\"+f.split(\".\").sort().join(\"\\\\.(?:.*\\\\.|)\")+\"(\\\\.|$)\"):null;for(c=0;c<d.length;c++)m=d[c],(i||a===m.origType)&&(!n||n.guid===m.guid)&&(!f||f.test(m.namespace))&&(!r||r===m.selector||r===\"**\"&&m.selector)&&(d.splice(c--,1),m.selector&&d.delegateCount--,p.remove&&p.remove.call(e,m));d.length===0&&l!==d.length&&((!p.teardown||p.teardown.call(e,f,g.handle)===!1)&&v.removeEvent(e,u,g.handle),delete h[u])}v.isEmptyObject(h)&&(delete g.handle,v.removeData(e,\"events\",!0))},customEvent:{getData:!0,setData:!0,changeData:!0},trigger:function(n,r,s,o){if(!s||s.nodeType!==3&&s.nodeType!==8){var u,a,f,l,c,h,p,d,m,g,y=n.type||n,b=[];if(Y.test(y+v.event.triggered))return;y.indexOf(\"!\")>=0&&(y=y.slice(0,-1),a=!0),y.indexOf(\".\")>=0&&(b=y.split(\".\"),y=b.shift(),b.sort());if((!s||v.event.customEvent[y])&&!v.event.global[y])return;n=typeof n==\"object\"?n[v.expando]?n:new v.Event(y,n):new v.Event(y),n.type=y,n.isTrigger=!0,n.exclusive=a,n.namespace=b.join(\".\"),n.namespace_re=n.namespace?new RegExp(\"(^|\\\\.)\"+b.join(\"\\\\.(?:.*\\\\.|)\")+\"(\\\\.|$)\"):null,h=y.indexOf(\":\")<0?\"on\"+y:\"\";if(!s){u=v.cache;for(f in u)u[f].events&&u[f].events[y]&&v.event.trigger(n,r,u[f].handle.elem,!0);return}n.result=t,n.target||(n.target=s),r=r!=null?v.makeArray(r):[],r.unshift(n),p=v.event.special[y]||{};if(p.trigger&&p.trigger.apply(s,r)===!1)return;m=[[s,p.bindType||y]];if(!o&&!p.noBubble&&!v.isWindow(s)){g=p.delegateType||y,l=Y.test(g+y)?s:s.parentNode;for(c=s;l;l=l.parentNode)m.push([l,g]),c=l;c===(s.ownerDocument||i)&&m.push([c.defaultView||c.parentWindow||e,g])}for(f=0;f<m.length&&!n.isPropagationStopped();f++)l=m[f][0],n.type=m[f][1],d=(v._data(l,\"events\")||{})[n.type]&&v._data(l,\"handle\"),d&&d.apply(l,r),d=h&&l[h],d&&v.acceptData(l)&&d.apply&&d.apply(l,r)===!1&&n.preventDefault();return n.type=y,!o&&!n.isDefaultPrevented()&&(!p._default||p._default.apply(s.ownerDocument,r)===!1)&&(y!==\"click\"||!v.nodeName(s,\"a\"))&&v.acceptData(s)&&h&&s[y]&&(y!==\"focus\"&&y!==\"blur\"||n.target.offsetWidth!==0)&&!v.isWindow(s)&&(c=s[h],c&&(s[h]=null),v.event.triggered=y,s[y](),v.event.triggered=t,c&&(s[h]=c)),n.result}return},dispatch:function(n){n=v.event.fix(n||e.event);var r,i,s,o,u,a,f,c,h,p,d=(v._data(this,\"events\")||{})[n.type]||[],m=d.delegateCount,g=l.call(arguments),y=!n.exclusive&&!n.namespace,b=v.event.special[n.type]||{},w=[];g[0]=n,n.delegateTarget=this;if(b.preDispatch&&b.preDispatch.call(this,n)===!1)return;if(m&&(!n.button||n.type!==\"click\"))for(s=n.target;s!=this;s=s.parentNode||this)if(s.disabled!==!0||n.type!==\"click\"){u={},f=[];for(r=0;r<m;r++)c=d[r],h=c.selector,u[h]===t&&(u[h]=c.needsContext?v(h,this).index(s)>=0:v.find(h,this,null,[s]).length),u[h]&&f.push(c);f.length&&w.push({elem:s,matches:f})}d.length>m&&w.push({elem:this,matches:d.slice(m)});for(r=0;r<w.length&&!n.isPropagationStopped();r++){a=w[r],n.currentTarget=a.elem;for(i=0;i<a.matches.length&&!n.isImmediatePropagationStopped();i++){c=a.matches[i];if(y||!n.namespace&&!c.namespace||n.namespace_re&&n.namespace_re.test(c.namespace))n.data=c.data,n.handleObj=c,o=((v.event.special[c.origType]||{}).handle||c.handler).apply(a.elem,g),o!==t&&(n.result=o,o===!1&&(n.preventDefault(),n.stopPropagation()))}}return b.postDispatch&&b.postDispatch.call(this,n),n.result},props:\"attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which\".split(\" \"),fixHooks:{},keyHooks:{props:\"char charCode key keyCode\".split(\" \"),filter:function(e,t){return e.which==null&&(e.which=t.charCode!=null?t.charCode:t.keyCode),e}},mouseHooks:{props:\"button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement\".split(\" \"),filter:function(e,n){var r,s,o,u=n.button,a=n.fromElement;return e.pageX==null&&n.clientX!=null&&(r=e.target.ownerDocument||i,s=r.documentElement,o=r.body,e.pageX=n.clientX+(s&&s.scrollLeft||o&&o.scrollLeft||0)-(s&&s.clientLeft||o&&o.clientLeft||0),e.pageY=n.clientY+(s&&s.scrollTop||o&&o.scrollTop||0)-(s&&s.clientTop||o&&o.clientTop||0)),!e.relatedTarget&&a&&(e.relatedTarget=a===e.target?n.toElement:a),!e.which&&u!==t&&(e.which=u&1?1:u&2?3:u&4?2:0),e}},fix:function(e){if(e[v.expando])return e;var t,n,r=e,s=v.event.fixHooks[e.type]||{},o=s.props?this.props.concat(s.props):this.props;e=v.Event(r);for(t=o.length;t;)n=o[--t],e[n]=r[n];return e.target||(e.target=r.srcElement||i),e.target.nodeType===3&&(e.target=e.target.parentNode),e.metaKey=!!e.metaKey,s.filter?s.filter(e,r):e},special:{load:{noBubble:!0},focus:{delegateType:\"focusin\"},blur:{delegateType:\"focusout\"},beforeunload:{setup:function(e,t,n){v.isWindow(this)&&(this.onbeforeunload=n)},teardown:function(e,t){this.onbeforeunload===t&&(this.onbeforeunload=null)}}},simulate:function(e,t,n,r){var i=v.extend(new v.Event,n,{type:e,isSimulated:!0,originalEvent:{}});r?v.event.trigger(i,null,t):v.event.dispatch.call(t,i),i.isDefaultPrevented()&&n.preventDefault()}},v.event.handle=v.event.dispatch,v.removeEvent=i.removeEventListener?function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n,!1)}:function(e,t,n){var r=\"on\"+t;e.detachEvent&&(typeof e[r]==\"undefined\"&&(e[r]=null),e.detachEvent(r,n))},v.Event=function(e,t){if(!(this instanceof v.Event))return new v.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||e.returnValue===!1||e.getPreventDefault&&e.getPreventDefault()?tt:et):this.type=e,t&&v.extend(this,t),this.timeStamp=e&&e.timeStamp||v.now(),this[v.expando]=!0},v.Event.prototype={preventDefault:function(){this.isDefaultPrevented=tt;var e=this.originalEvent;if(!e)return;e.preventDefault?e.preventDefault():e.returnValue=!1},stopPropagation:function(){this.isPropagationStopped=tt;var e=this.originalEvent;if(!e)return;e.stopPropagation&&e.stopPropagation(),e.cancelBubble=!0},stopImmediatePropagation:function(){this.isImmediatePropagationStopped=tt,this.stopPropagation()},isDefaultPrevented:et,isPropagationStopped:et,isImmediatePropagationStopped:et},v.each({mouseenter:\"mouseover\",mouseleave:\"mouseout\"},function(e,t){v.event.special[e]={delegateType:t,bindType:t,handle:function(e){var n,r=this,i=e.relatedTarget,s=e.handleObj,o=s.selector;if(!i||i!==r&&!v.contains(r,i))e.type=s.origType,n=s.handler.apply(this,arguments),e.type=t;return n}}}),v.support.submitBubbles||(v.event.special.submit={setup:function(){if(v.nodeName(this,\"form\"))return!1;v.event.add(this,\"click._submit keypress._submit\",function(e){var n=e.target,r=v.nodeName(n,\"input\")||v.nodeName(n,\"button\")?n.form:t;r&&!v._data(r,\"_submit_attached\")&&(v.event.add(r,\"submit._submit\",function(e){e._submit_bubble=!0}),v._data(r,\"_submit_attached\",!0))})},postDispatch:function(e){e._submit_bubble&&(delete e._submit_bubble,this.parentNode&&!e.isTrigger&&v.event.simulate(\"submit\",this.parentNode,e,!0))},teardown:function(){if(v.nodeName(this,\"form\"))return!1;v.event.remove(this,\"._submit\")}}),v.support.changeBubbles||(v.event.special.change={setup:function(){if($.test(this.nodeName)){if(this.type===\"checkbox\"||this.type===\"radio\")v.event.add(this,\"propertychange._change\",function(e){e.originalEvent.propertyName===\"checked\"&&(this._just_changed=!0)}),v.event.add(this,\"click._change\",function(e){this._just_changed&&!e.isTrigger&&(this._just_changed=!1),v.event.simulate(\"change\",this,e,!0)});return!1}v.event.add(this,\"beforeactivate._change\",function(e){var t=e.target;$.test(t.nodeName)&&!v._data(t,\"_change_attached\")&&(v.event.add(t,\"change._change\",function(e){this.parentNode&&!e.isSimulated&&!e.isTrigger&&v.event.simulate(\"change\",this.parentNode,e,!0)}),v._data(t,\"_change_attached\",!0))})},handle:function(e){var t=e.target;if(this!==t||e.isSimulated||e.isTrigger||t.type!==\"radio\"&&t.type!==\"checkbox\")return e.handleObj.handler.apply(this,arguments)},teardown:function(){return v.event.remove(this,\"._change\"),!$.test(this.nodeName)}}),v.support.focusinBubbles||v.each({focus:\"focusin\",blur:\"focusout\"},function(e,t){var n=0,r=function(e){v.event.simulate(t,e.target,v.event.fix(e),!0)};v.event.special[t]={setup:function(){n++===0&&i.addEventListener(e,r,!0)},teardown:function(){--n===0&&i.removeEventListener(e,r,!0)}}}),v.fn.extend({on:function(e,n,r,i,s){var o,u;if(typeof e==\"object\"){typeof n!=\"string\"&&(r=r||n,n=t);for(u in e)this.on(u,n,r,e[u],s);return this}r==null&&i==null?(i=n,r=n=t):i==null&&(typeof n==\"string\"?(i=r,r=t):(i=r,r=n,n=t));if(i===!1)i=et;else if(!i)return this;return s===1&&(o=i,i=function(e){return v().off(e),o.apply(this,arguments)},i.guid=o.guid||(o.guid=v.guid++)),this.each(function(){v.event.add(this,e,i,r,n)})},one:function(e,t,n,r){return this.on(e,t,n,r,1)},off:function(e,n,r){var i,s;if(e&&e.preventDefault&&e.handleObj)return i=e.handleObj,v(e.delegateTarget).off(i.namespace?i.origType+\".\"+i.namespace:i.origType,i.selector,i.handler),this;if(typeof e==\"object\"){for(s in e)this.off(s,n,e[s]);return this}if(n===!1||typeof n==\"function\")r=n,n=t;return r===!1&&(r=et),this.each(function(){v.event.remove(this,e,r,n)})},bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},live:function(e,t,n){return v(this.context).on(e,this.selector,t,n),this},die:function(e,t){return v(this.context).off(e,this.selector||\"**\",t),this},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return arguments.length===1?this.off(e,\"**\"):this.off(t,e||\"**\",n)},trigger:function(e,t){return this.each(function(){v.event.trigger(e,t,this)})},triggerHandler:function(e,t){if(this[0])return v.event.trigger(e,t,this[0],!0)},toggle:function(e){var t=arguments,n=e.guid||v.guid++,r=0,i=function(n){var i=(v._data(this,\"lastToggle\"+e.guid)||0)%r;return v._data(this,\"lastToggle\"+e.guid,i+1),n.preventDefault(),t[i].apply(this,arguments)||!1};i.guid=n;while(r<t.length)t[r++].guid=n;return this.click(i)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),v.each(\"blur focus focusin focusout load resize scroll unload click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup error contextmenu\".split(\" \"),function(e,t){v.fn[t]=function(e,n){return n==null&&(n=e,e=null),arguments.length>0?this.on(t,null,e,n):this.trigger(t)},Q.test(t)&&(v.event.fixHooks[t]=v.event.keyHooks),G.test(t)&&(v.event.fixHooks[t]=v.event.mouseHooks)}),function(e,t){function nt(e,t,n,r){n=n||[],t=t||g;var i,s,a,f,l=t.nodeType;if(!e||typeof e!=\"string\")return n;if(l!==1&&l!==9)return[];a=o(t);if(!a&&!r)if(i=R.exec(e))if(f=i[1]){if(l===9){s=t.getElementById(f);if(!s||!s.parentNode)return n;if(s.id===f)return n.push(s),n}else if(t.ownerDocument&&(s=t.ownerDocument.getElementById(f))&&u(t,s)&&s.id===f)return n.push(s),n}else{if(i[2])return S.apply(n,x.call(t.getElementsByTagName(e),0)),n;if((f=i[3])&&Z&&t.getElementsByClassName)return S.apply(n,x.call(t.getElementsByClassName(f),0)),n}return vt(e.replace(j,\"$1\"),t,n,r,a)}function rt(e){return function(t){var n=t.nodeName.toLowerCase();return n===\"input\"&&t.type===e}}function it(e){return function(t){var n=t.nodeName.toLowerCase();return(n===\"input\"||n===\"button\")&&t.type===e}}function st(e){return N(function(t){return t=+t,N(function(n,r){var i,s=e([],n.length,t),o=s.length;while(o--)n[i=s[o]]&&(n[i]=!(r[i]=n[i]))})})}function ot(e,t,n){if(e===t)return n;var r=e.nextSibling;while(r){if(r===t)return-1;r=r.nextSibling}return 1}function ut(e,t){var n,r,s,o,u,a,f,l=L[d][e];if(l)return t?0:l.slice(0);u=e,a=[],f=i.preFilter;while(u){if(!n||(r=F.exec(u)))r&&(u=u.slice(r[0].length)),a.push(s=[]);n=!1;if(r=I.exec(u))s.push(n=new m(r.shift())),u=u.slice(n.length),n.type=r[0].replace(j,\" \");for(o in i.filter)(r=J[o].exec(u))&&(!f[o]||(r=f[o](r,g,!0)))&&(s.push(n=new m(r.shift())),u=u.slice(n.length),n.type=o,n.matches=r);if(!n)break}return t?u.length:u?nt.error(e):L(e,a).slice(0)}function at(e,t,r){var i=t.dir,s=r&&t.dir===\"parentNode\",o=w++;return t.first?function(t,n,r){while(t=t[i])if(s||t.nodeType===1)return e(t,n,r)}:function(t,r,u){if(!u){var a,f=b+\" \"+o+\" \",l=f+n;while(t=t[i])if(s||t.nodeType===1){if((a=t[d])===l)return t.sizset;if(typeof a==\"string\"&&a.indexOf(f)===0){if(t.sizset)return t}else{t[d]=l;if(e(t,r,u))return t.sizset=!0,t;t.sizset=!1}}}else while(t=t[i])if(s||t.nodeType===1)if(e(t,r,u))return t}}function ft(e){return e.length>1?function(t,n,r){var i=e.length;while(i--)if(!e[i](t,n,r))return!1;return!0}:e[0]}function lt(e,t,n,r,i){var s,o=[],u=0,a=e.length,f=t!=null;for(;u<a;u++)if(s=e[u])if(!n||n(s,r,i))o.push(s),f&&t.push(u);return o}function ct(e,t,n,r,i,s){return r&&!r[d]&&(r=ct(r)),i&&!i[d]&&(i=ct(i,s)),N(function(s,o,u,a){if(s&&i)return;var f,l,c,h=[],p=[],d=o.length,v=s||dt(t||\"*\",u.nodeType?[u]:u,[],s),m=e&&(s||!t)?lt(v,h,e,u,a):v,g=n?i||(s?e:d||r)?[]:o:m;n&&n(m,g,u,a);if(r){c=lt(g,p),r(c,[],u,a),f=c.length;while(f--)if(l=c[f])g[p[f]]=!(m[p[f]]=l)}if(s){f=e&&g.length;while(f--)if(l=g[f])s[h[f]]=!(o[h[f]]=l)}else g=lt(g===o?g.splice(d,g.length):g),i?i(null,o,g,a):S.apply(o,g)})}function ht(e){var t,n,r,s=e.length,o=i.relative[e[0].type],u=o||i.relative[\" \"],a=o?1:0,f=at(function(e){return e===t},u,!0),l=at(function(e){return T.call(t,e)>-1},u,!0),h=[function(e,n,r){return!o&&(r||n!==c)||((t=n).nodeType?f(e,n,r):l(e,n,r))}];for(;a<s;a++)if(n=i.relative[e[a].type])h=[at(ft(h),n)];else{n=i.filter[e[a].type].apply(null,e[a].matches);if(n[d]){r=++a;for(;r<s;r++)if(i.relative[e[r].type])break;return ct(a>1&&ft(h),a>1&&e.slice(0,a-1).join(\"\").replace(j,\"$1\"),n,a<r&&ht(e.slice(a,r)),r<s&&ht(e=e.slice(r)),r<s&&e.join(\"\"))}h.push(n)}return ft(h)}function pt(e,t){var r=t.length>0,s=e.length>0,o=function(u,a,f,l,h){var p,d,v,m=[],y=0,w=\"0\",x=u&&[],T=h!=null,N=c,C=u||s&&i.find.TAG(\"*\",h&&a.parentNode||a),k=b+=N==null?1:Math.E;T&&(c=a!==g&&a,n=o.el);for(;(p=C[w])!=null;w++){if(s&&p){for(d=0;v=e[d];d++)if(v(p,a,f)){l.push(p);break}T&&(b=k,n=++o.el)}r&&((p=!v&&p)&&y--,u&&x.push(p))}y+=w;if(r&&w!==y){for(d=0;v=t[d];d++)v(x,m,a,f);if(u){if(y>0)while(w--)!x[w]&&!m[w]&&(m[w]=E.call(l));m=lt(m)}S.apply(l,m),T&&!u&&m.length>0&&y+t.length>1&&nt.uniqueSort(l)}return T&&(b=k,c=N),x};return o.el=0,r?N(o):o}function dt(e,t,n,r){var i=0,s=t.length;for(;i<s;i++)nt(e,t[i],n,r);return n}function vt(e,t,n,r,s){var o,u,f,l,c,h=ut(e),p=h.length;if(!r&&h.length===1){u=h[0]=h[0].slice(0);if(u.length>2&&(f=u[0]).type===\"ID\"&&t.nodeType===9&&!s&&i.relative[u[1].type]){t=i.find.ID(f.matches[0].replace($,\"\"),t,s)[0];if(!t)return n;e=e.slice(u.shift().length)}for(o=J.POS.test(e)?-1:u.length-1;o>=0;o--){f=u[o];if(i.relative[l=f.type])break;if(c=i.find[l])if(r=c(f.matches[0].replace($,\"\"),z.test(u[0].type)&&t.parentNode||t,s)){u.splice(o,1),e=r.length&&u.join(\"\");if(!e)return S.apply(n,x.call(r,0)),n;break}}}return a(e,h)(r,t,s,n,z.test(e)),n}function mt(){}var n,r,i,s,o,u,a,f,l,c,h=!0,p=\"undefined\",d=(\"sizcache\"+Math.random()).replace(\".\",\"\"),m=String,g=e.document,y=g.documentElement,b=0,w=0,E=[].pop,S=[].push,x=[].slice,T=[].indexOf||function(e){var t=0,n=this.length;for(;t<n;t++)if(this[t]===e)return t;return-1},N=function(e,t){return e[d]=t==null||t,e},C=function(){var e={},t=[];return N(function(n,r){return t.push(n)>i.cacheLength&&delete e[t.shift()],e[n]=r},e)},k=C(),L=C(),A=C(),O=\"[\\\\x20\\\\t\\\\r\\\\n\\\\f]\",M=\"(?:\\\\\\\\.|[-\\\\w]|[^\\\\x00-\\\\xa0])+\",_=M.replace(\"w\",\"w#\"),D=\"([*^$|!~]?=)\",P=\"\\\\[\"+O+\"*(\"+M+\")\"+O+\"*(?:\"+D+O+\"*(?:(['\\\"])((?:\\\\\\\\.|[^\\\\\\\\])*?)\\\\3|(\"+_+\")|)|)\"+O+\"*\\\\]\",H=\":(\"+M+\")(?:\\\\((?:(['\\\"])((?:\\\\\\\\.|[^\\\\\\\\])*?)\\\\2|([^()[\\\\]]*|(?:(?:\"+P+\")|[^:]|\\\\\\\\.)*|.*))\\\\)|)\",B=\":(even|odd|eq|gt|lt|nth|first|last)(?:\\\\(\"+O+\"*((?:-\\\\d)?\\\\d*)\"+O+\"*\\\\)|)(?=[^-]|$)\",j=new RegExp(\"^\"+O+\"+|((?:^|[^\\\\\\\\])(?:\\\\\\\\.)*)\"+O+\"+$\",\"g\"),F=new RegExp(\"^\"+O+\"*,\"+O+\"*\"),I=new RegExp(\"^\"+O+\"*([\\\\x20\\\\t\\\\r\\\\n\\\\f>+~])\"+O+\"*\"),q=new RegExp(H),R=/^(?:#([\\w\\-]+)|(\\w+)|\\.([\\w\\-]+))$/,U=/^:not/,z=/[\\x20\\t\\r\\n\\f]*[+~]/,W=/:not\\($/,X=/h\\d/i,V=/input|select|textarea|button/i,$=/\\\\(?!\\\\)/g,J={ID:new RegExp(\"^#(\"+M+\")\"),CLASS:new RegExp(\"^\\\\.(\"+M+\")\"),NAME:new RegExp(\"^\\\\[name=['\\\"]?(\"+M+\")['\\\"]?\\\\]\"),TAG:new RegExp(\"^(\"+M.replace(\"w\",\"w*\")+\")\"),ATTR:new RegExp(\"^\"+P),PSEUDO:new RegExp(\"^\"+H),POS:new RegExp(B,\"i\"),CHILD:new RegExp(\"^:(only|nth|first|last)-child(?:\\\\(\"+O+\"*(even|odd|(([+-]|)(\\\\d*)n|)\"+O+\"*(?:([+-]|)\"+O+\"*(\\\\d+)|))\"+O+\"*\\\\)|)\",\"i\"),needsContext:new RegExp(\"^\"+O+\"*[>+~]|\"+B,\"i\")},K=function(e){var t=g.createElement(\"div\");try{return e(t)}catch(n){return!1}finally{t=null}},Q=K(function(e){return e.appendChild(g.createComment(\"\")),!e.getElementsByTagName(\"*\").length}),G=K(function(e){return e.innerHTML=\"<a href='#'></a>\",e.firstChild&&typeof e.firstChild.getAttribute!==p&&e.firstChild.getAttribute(\"href\")===\"#\"}),Y=K(function(e){e.innerHTML=\"<select></select>\";var t=typeof e.lastChild.getAttribute(\"multiple\");return t!==\"boolean\"&&t!==\"string\"}),Z=K(function(e){return e.innerHTML=\"<div class='hidden e'></div><div class='hidden'></div>\",!e.getElementsByClassName||!e.getElementsByClassName(\"e\").length?!1:(e.lastChild.className=\"e\",e.getElementsByClassName(\"e\").length===2)}),et=K(function(e){e.id=d+0,e.innerHTML=\"<a name='\"+d+\"'></a><div name='\"+d+\"'></div>\",y.insertBefore(e,y.firstChild);var t=g.getElementsByName&&g.getElementsByName(d).length===2+g.getElementsByName(d+0).length;return r=!g.getElementById(d),y.removeChild(e),t});try{x.call(y.childNodes,0)[0].nodeType}catch(tt){x=function(e){var t,n=[];for(;t=this[e];e++)n.push(t);return n}}nt.matches=function(e,t){return nt(e,null,null,t)},nt.matchesSelector=function(e,t){return nt(t,null,null,[e]).length>0},s=nt.getText=function(e){var t,n=\"\",r=0,i=e.nodeType;if(i){if(i===1||i===9||i===11){if(typeof e.textContent==\"string\")return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=s(e)}else if(i===3||i===4)return e.nodeValue}else for(;t=e[r];r++)n+=s(t);return n},o=nt.isXML=function(e){var t=e&&(e.ownerDocument||e).documentElement;return t?t.nodeName!==\"HTML\":!1},u=nt.contains=y.contains?function(e,t){var n=e.nodeType===9?e.documentElement:e,r=t&&t.parentNode;return e===r||!!(r&&r.nodeType===1&&n.contains&&n.contains(r))}:y.compareDocumentPosition?function(e,t){return t&&!!(e.compareDocumentPosition(t)&16)}:function(e,t){while(t=t.parentNode)if(t===e)return!0;return!1},nt.attr=function(e,t){var n,r=o(e);return r||(t=t.toLowerCase()),(n=i.attrHandle[t])?n(e):r||Y?e.getAttribute(t):(n=e.getAttributeNode(t),n?typeof e[t]==\"boolean\"?e[t]?t:null:n.specified?n.value:null:null)},i=nt.selectors={cacheLength:50,createPseudo:N,match:J,attrHandle:G?{}:{href:function(e){return e.getAttribute(\"href\",2)},type:function(e){return e.getAttribute(\"type\")}},find:{ID:r?function(e,t,n){if(typeof t.getElementById!==p&&!n){var r=t.getElementById(e);return r&&r.parentNode?[r]:[]}}:function(e,n,r){if(typeof n.getElementById!==p&&!r){var i=n.getElementById(e);return i?i.id===e||typeof i.getAttributeNode!==p&&i.getAttributeNode(\"id\").value===e?[i]:t:[]}},TAG:Q?function(e,t){if(typeof t.getElementsByTagName!==p)return t.getElementsByTagName(e)}:function(e,t){var n=t.getElementsByTagName(e);if(e===\"*\"){var r,i=[],s=0;for(;r=n[s];s++)r.nodeType===1&&i.push(r);return i}return n},NAME:et&&function(e,t){if(typeof t.getElementsByName!==p)return t.getElementsByName(name)},CLASS:Z&&function(e,t,n){if(typeof t.getElementsByClassName!==p&&!n)return t.getElementsByClassName(e)}},relative:{\">\":{dir:\"parentNode\",first:!0},\" \":{dir:\"parentNode\"},\"+\":{dir:\"previousSibling\",first:!0},\"~\":{dir:\"previousSibling\"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace($,\"\"),e[3]=(e[4]||e[5]||\"\").replace($,\"\"),e[2]===\"~=\"&&(e[3]=\" \"+e[3]+\" \"),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),e[1]===\"nth\"?(e[2]||nt.error(e[0]),e[3]=+(e[3]?e[4]+(e[5]||1):2*(e[2]===\"even\"||e[2]===\"odd\")),e[4]=+(e[6]+e[7]||e[2]===\"odd\")):e[2]&&nt.error(e[0]),e},PSEUDO:function(e){var t,n;if(J.CHILD.test(e[0]))return null;if(e[3])e[2]=e[3];else if(t=e[4])q.test(t)&&(n=ut(t,!0))&&(n=t.indexOf(\")\",t.length-n)-t.length)&&(t=t.slice(0,n),e[0]=e[0].slice(0,n)),e[2]=t;return e.slice(0,3)}},filter:{ID:r?function(e){return e=e.replace($,\"\"),function(t){return t.getAttribute(\"id\")===e}}:function(e){return e=e.replace($,\"\"),function(t){var n=typeof t.getAttributeNode!==p&&t.getAttributeNode(\"id\");return n&&n.value===e}},TAG:function(e){return e===\"*\"?function(){return!0}:(e=e.replace($,\"\").toLowerCase(),function(t){return t.nodeName&&t.nodeName.toLowerCase()===e})},CLASS:function(e){var t=k[d][e];return t||(t=k(e,new RegExp(\"(^|\"+O+\")\"+e+\"(\"+O+\"|$)\"))),function(e){return t.test(e.className||typeof e.getAttribute!==p&&e.getAttribute(\"class\")||\"\")}},ATTR:function(e,t,n){return function(r,i){var s=nt.attr(r,e);return s==null?t===\"!=\":t?(s+=\"\",t===\"=\"?s===n:t===\"!=\"?s!==n:t===\"^=\"?n&&s.indexOf(n)===0:t===\"*=\"?n&&s.indexOf(n)>-1:t===\"$=\"?n&&s.substr(s.length-n.length)===n:t===\"~=\"?(\" \"+s+\" \").indexOf(n)>-1:t===\"|=\"?s===n||s.substr(0,n.length+1)===n+\"-\":!1):!0}},CHILD:function(e,t,n,r){return e===\"nth\"?function(e){var t,i,s=e.parentNode;if(n===1&&r===0)return!0;if(s){i=0;for(t=s.firstChild;t;t=t.nextSibling)if(t.nodeType===1){i++;if(e===t)break}}return i-=r,i===n||i%n===0&&i/n>=0}:function(t){var n=t;switch(e){case\"only\":case\"first\":while(n=n.previousSibling)if(n.nodeType===1)return!1;if(e===\"first\")return!0;n=t;case\"last\":while(n=n.nextSibling)if(n.nodeType===1)return!1;return!0}}},PSEUDO:function(e,t){var n,r=i.pseudos[e]||i.setFilters[e.toLowerCase()]||nt.error(\"unsupported pseudo: \"+e);return r[d]?r(t):r.length>1?(n=[e,e,\"\",t],i.setFilters.hasOwnProperty(e.toLowerCase())?N(function(e,n){var i,s=r(e,t),o=s.length;while(o--)i=T.call(e,s[o]),e[i]=!(n[i]=s[o])}):function(e){return r(e,0,n)}):r}},pseudos:{not:N(function(e){var t=[],n=[],r=a(e.replace(j,\"$1\"));return r[d]?N(function(e,t,n,i){var s,o=r(e,null,i,[]),u=e.length;while(u--)if(s=o[u])e[u]=!(t[u]=s)}):function(e,i,s){return t[0]=e,r(t,null,s,n),!n.pop()}}),has:N(function(e){return function(t){return nt(e,t).length>0}}),contains:N(function(e){return function(t){return(t.textContent||t.innerText||s(t)).indexOf(e)>-1}}),enabled:function(e){return e.disabled===!1},disabled:function(e){return e.disabled===!0},checked:function(e){var t=e.nodeName.toLowerCase();return t===\"input\"&&!!e.checked||t===\"option\"&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,e.selected===!0},parent:function(e){return!i.pseudos.empty(e)},empty:function(e){var t;e=e.firstChild;while(e){if(e.nodeName>\"@\"||(t=e.nodeType)===3||t===4)return!1;e=e.nextSibling}return!0},header:function(e){return X.test(e.nodeName)},text:function(e){var t,n;return e.nodeName.toLowerCase()===\"input\"&&(t=e.type)===\"text\"&&((n=e.getAttribute(\"type\"))==null||n.toLowerCase()===t)},radio:rt(\"radio\"),checkbox:rt(\"checkbox\"),file:rt(\"file\"),password:rt(\"password\"),image:rt(\"image\"),submit:it(\"submit\"),reset:it(\"reset\"),button:function(e){var t=e.nodeName.toLowerCase();return t===\"input\"&&e.type===\"button\"||t===\"button\"},input:function(e){return V.test(e.nodeName)},focus:function(e){var t=e.ownerDocument;return e===t.activeElement&&(!t.hasFocus||t.hasFocus())&&(!!e.type||!!e.href)},active:function(e){return e===e.ownerDocument.activeElement},first:st(function(e,t,n){return[0]}),last:st(function(e,t,n){return[t-1]}),eq:st(function(e,t,n){return[n<0?n+t:n]}),even:st(function(e,t,n){for(var r=0;r<t;r+=2)e.push(r);return e}),odd:st(function(e,t,n){for(var r=1;r<t;r+=2)e.push(r);return e}),lt:st(function(e,t,n){for(var r=n<0?n+t:n;--r>=0;)e.push(r);return e}),gt:st(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}},f=y.compareDocumentPosition?function(e,t){return e===t?(l=!0,0):(!e.compareDocumentPosition||!t.compareDocumentPosition?e.compareDocumentPosition:e.compareDocumentPosition(t)&4)?-1:1}:function(e,t){if(e===t)return l=!0,0;if(e.sourceIndex&&t.sourceIndex)return e.sourceIndex-t.sourceIndex;var n,r,i=[],s=[],o=e.parentNode,u=t.parentNode,a=o;if(o===u)return ot(e,t);if(!o)return-1;if(!u)return 1;while(a)i.unshift(a),a=a.parentNode;a=u;while(a)s.unshift(a),a=a.parentNode;n=i.length,r=s.length;for(var f=0;f<n&&f<r;f++)if(i[f]!==s[f])return ot(i[f],s[f]);return f===n?ot(e,s[f],-1):ot(i[f],t,1)},[0,0].sort(f),h=!l,nt.uniqueSort=function(e){var t,n=1;l=h,e.sort(f);if(l)for(;t=e[n];n++)t===e[n-1]&&e.splice(n--,1);return e},nt.error=function(e){throw new Error(\"Syntax error, unrecognized expression: \"+e)},a=nt.compile=function(e,t){var n,r=[],i=[],s=A[d][e];if(!s){t||(t=ut(e)),n=t.length;while(n--)s=ht(t[n]),s[d]?r.push(s):i.push(s);s=A(e,pt(i,r))}return s},g.querySelectorAll&&function(){var e,t=vt,n=/'|\\\\/g,r=/\\=[\\x20\\t\\r\\n\\f]*([^'\"\\]]*)[\\x20\\t\\r\\n\\f]*\\]/g,i=[\":focus\"],s=[\":active\",\":focus\"],u=y.matchesSelector||y.mozMatchesSelector||y.webkitMatchesSelector||y.oMatchesSelector||y.msMatchesSelector;K(function(e){e.innerHTML=\"<select><option selected=''></option></select>\",e.querySelectorAll(\"[selected]\").length||i.push(\"\\\\[\"+O+\"*(?:checked|disabled|ismap|multiple|readonly|selected|value)\"),e.querySelectorAll(\":checked\").length||i.push(\":checked\")}),K(function(e){e.innerHTML=\"<p test=''></p>\",e.querySelectorAll(\"[test^='']\").length&&i.push(\"[*^$]=\"+O+\"*(?:\\\"\\\"|'')\"),e.innerHTML=\"<input type='hidden'/>\",e.querySelectorAll(\":enabled\").length||i.push(\":enabled\",\":disabled\")}),i=new RegExp(i.join(\"|\")),vt=function(e,r,s,o,u){if(!o&&!u&&(!i||!i.test(e))){var a,f,l=!0,c=d,h=r,p=r.nodeType===9&&e;if(r.nodeType===1&&r.nodeName.toLowerCase()!==\"object\"){a=ut(e),(l=r.getAttribute(\"id\"))?c=l.replace(n,\"\\\\$&\"):r.setAttribute(\"id\",c),c=\"[id='\"+c+\"'] \",f=a.length;while(f--)a[f]=c+a[f].join(\"\");h=z.test(e)&&r.parentNode||r,p=a.join(\",\")}if(p)try{return S.apply(s,x.call(h.querySelectorAll(p),0)),s}catch(v){}finally{l||r.removeAttribute(\"id\")}}return t(e,r,s,o,u)},u&&(K(function(t){e=u.call(t,\"div\");try{u.call(t,\"[test!='']:sizzle\"),s.push(\"!=\",H)}catch(n){}}),s=new RegExp(s.join(\"|\")),nt.matchesSelector=function(t,n){n=n.replace(r,\"='$1']\");if(!o(t)&&!s.test(n)&&(!i||!i.test(n)))try{var a=u.call(t,n);if(a||e||t.document&&t.document.nodeType!==11)return a}catch(f){}return nt(n,null,null,[t]).length>0})}(),i.pseudos.nth=i.pseudos.eq,i.filters=mt.prototype=i.pseudos,i.setFilters=new mt,nt.attr=v.attr,v.find=nt,v.expr=nt.selectors,v.expr[\":\"]=v.expr.pseudos,v.unique=nt.uniqueSort,v.text=nt.getText,v.isXMLDoc=nt.isXML,v.contains=nt.contains}(e);var nt=/Until$/,rt=/^(?:parents|prev(?:Until|All))/,it=/^.[^:#\\[\\.,]*$/,st=v.expr.match.needsContext,ot={children:!0,contents:!0,next:!0,prev:!0};v.fn.extend({find:function(e){var t,n,r,i,s,o,u=this;if(typeof e!=\"string\")return v(e).filter(function(){for(t=0,n=u.length;t<n;t++)if(v.contains(u[t],this))return!0});o=this.pushStack(\"\",\"find\",e);for(t=0,n=this.length;t<n;t++){r=o.length,v.find(e,this[t],o);if(t>0)for(i=r;i<o.length;i++)for(s=0;s<r;s++)if(o[s]===o[i]){o.splice(i--,1);break}}return o},has:function(e){var t,n=v(e,this),r=n.length;return this.filter(function(){for(t=0;t<r;t++)if(v.contains(this,n[t]))return!0})},not:function(e){return this.pushStack(ft(this,e,!1),\"not\",e)},filter:function(e){return this.pushStack(ft(this,e,!0),\"filter\",e)},is:function(e){return!!e&&(typeof e==\"string\"?st.test(e)?v(e,this.context).index(this[0])>=0:v.filter(e,this).length>0:this.filter(e).length>0)},closest:function(e,t){var n,r=0,i=this.length,s=[],o=st.test(e)||typeof e!=\"string\"?v(e,t||this.context):0;for(;r<i;r++){n=this[r];while(n&&n.ownerDocument&&n!==t&&n.nodeType!==11){if(o?o.index(n)>-1:v.find.matchesSelector(n,e)){s.push(n);break}n=n.parentNode}}return s=s.length>1?v.unique(s):s,this.pushStack(s,\"closest\",e)},index:function(e){return e?typeof e==\"string\"?v.inArray(this[0],v(e)):v.inArray(e.jquery?e[0]:e,this):this[0]&&this[0].parentNode?this.prevAll().length:-1},add:function(e,t){var n=typeof e==\"string\"?v(e,t):v.makeArray(e&&e.nodeType?[e]:e),r=v.merge(this.get(),n);return this.pushStack(ut(n[0])||ut(r[0])?r:v.unique(r))},addBack:function(e){return this.add(e==null?this.prevObject:this.prevObject.filter(e))}}),v.fn.andSelf=v.fn.addBack,v.each({parent:function(e){var t=e.parentNode;return t&&t.nodeType!==11?t:null},parents:function(e){return v.dir(e,\"parentNode\")},parentsUntil:function(e,t,n){return v.dir(e,\"parentNode\",n)},next:function(e){return at(e,\"nextSibling\")},prev:function(e){return at(e,\"previousSibling\")},nextAll:function(e){return v.dir(e,\"nextSibling\")},prevAll:function(e){return v.dir(e,\"previousSibling\")},nextUntil:function(e,t,n){return v.dir(e,\"nextSibling\",n)},prevUntil:function(e,t,n){return v.dir(e,\"previousSibling\",n)},siblings:function(e){return v.sibling((e.parentNode||{}).firstChild,e)},children:function(e){return v.sibling(e.firstChild)},contents:function(e){return v.nodeName(e,\"iframe\")?e.contentDocument||e.contentWindow.document:v.merge([],e.childNodes)}},function(e,t){v.fn[e]=function(n,r){var i=v.map(this,t,n);return nt.test(e)||(r=n),r&&typeof r==\"string\"&&(i=v.filter(r,i)),i=this.length>1&&!ot[e]?v.unique(i):i,this.length>1&&rt.test(e)&&(i=i.reverse()),this.pushStack(i,e,l.call(arguments).join(\",\"))}}),v.extend({filter:function(e,t,n){return n&&(e=\":not(\"+e+\")\"),t.length===1?v.find.matchesSelector(t[0],e)?[t[0]]:[]:v.find.matches(e,t)},dir:function(e,n,r){var i=[],s=e[n];while(s&&s.nodeType!==9&&(r===t||s.nodeType!==1||!v(s).is(r)))s.nodeType===1&&i.push(s),s=s[n];return i},sibling:function(e,t){var n=[];for(;e;e=e.nextSibling)e.nodeType===1&&e!==t&&n.push(e);return n}});var ct=\"abbr|article|aside|audio|bdi|canvas|data|datalist|details|figcaption|figure|footer|header|hgroup|mark|meter|nav|output|progress|section|summary|time|video\",ht=/ jQuery\\d+=\"(?:null|\\d+)\"/g,pt=/^\\s+/,dt=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\\w:]+)[^>]*)\\/>/gi,vt=/<([\\w:]+)/,mt=/<tbody/i,gt=/<|&#?\\w+;/,yt=/<(?:script|style|link)/i,bt=/<(?:script|object|embed|option|style)/i,wt=new RegExp(\"<(?:\"+ct+\")[\\\\s/>]\",\"i\"),Et=/^(?:checkbox|radio)$/,St=/checked\\s*(?:[^=]|=\\s*.checked.)/i,xt=/\\/(java|ecma)script/i,Tt=/^\\s*<!(?:\\[CDATA\\[|\\-\\-)|[\\]\\-]{2}>\\s*$/g,Nt={option:[1,\"<select multiple='multiple'>\",\"</select>\"],legend:[1,\"<fieldset>\",\"</fieldset>\"],thead:[1,\"<table>\",\"</table>\"],tr:[2,\"<table><tbody>\",\"</tbody></table>\"],td:[3,\"<table><tbody><tr>\",\"</tr></tbody></table>\"],col:[2,\"<table><tbody></tbody><colgroup>\",\"</colgroup></table>\"],area:[1,\"<map>\",\"</map>\"],_default:[0,\"\",\"\"]},Ct=lt(i),kt=Ct.appendChild(i.createElement(\"div\"));Nt.optgroup=Nt.option,Nt.tbody=Nt.tfoot=Nt.colgroup=Nt.caption=Nt.thead,Nt.th=Nt.td,v.support.htmlSerialize||(Nt._default=[1,\"X<div>\",\"</div>\"]),v.fn.extend({text:function(e){return v.access(this,function(e){return e===t?v.text(this):this.empty().append((this[0]&&this[0].ownerDocument||i).createTextNode(e))},null,e,arguments.length)},wrapAll:function(e){if(v.isFunction(e))return this.each(function(t){v(this).wrapAll(e.call(this,t))});if(this[0]){var t=v(e,this[0].ownerDocument).eq(0).clone(!0);this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstChild&&e.firstChild.nodeType===1)e=e.firstChild;return e}).append(this)}return this},wrapInner:function(e){return v.isFunction(e)?this.each(function(t){v(this).wrapInner(e.call(this,t))}):this.each(function(){var t=v(this),n=t.contents();n.length?n.wrapAll(e):t.append(e)})},wrap:function(e){var t=v.isFunction(e);return this.each(function(n){v(this).wrapAll(t?e.call(this,n):e)})},unwrap:function(){return this.parent().each(function(){v.nodeName(this,\"body\")||v(this).replaceWith(this.childNodes)}).end()},append:function(){return this.domManip(arguments,!0,function(e){(this.nodeType===1||this.nodeType===11)&&this.appendChild(e)})},prepend:function(){return this.domManip(arguments,!0,function(e){(this.nodeType===1||this.nodeType===11)&&this.insertBefore(e,this.firstChild)})},before:function(){if(!ut(this[0]))return this.domManip(arguments,!1,function(e){this.parentNode.insertBefore(e,this)});if(arguments.length){var e=v.clean(arguments);return this.pushStack(v.merge(e,this),\"before\",this.selector)}},after:function(){if(!ut(this[0]))return this.domManip(arguments,!1,function(e){this.parentNode.insertBefore(e,this.nextSibling)});if(arguments.length){var e=v.clean(arguments);return this.pushStack(v.merge(this,e),\"after\",this.selector)}},remove:function(e,t){var n,r=0;for(;(n=this[r])!=null;r++)if(!e||v.filter(e,[n]).length)!t&&n.nodeType===1&&(v.cleanData(n.getElementsByTagName(\"*\")),v.cleanData([n])),n.parentNode&&n.parentNode.removeChild(n);return this},empty:function(){var e,t=0;for(;(e=this[t])!=null;t++){e.nodeType===1&&v.cleanData(e.getElementsByTagName(\"*\"));while(e.firstChild)e.removeChild(e.firstChild)}return this},clone:function(e,t){return e=e==null?!1:e,t=t==null?e:t,this.map(function(){return v.clone(this,e,t)})},html:function(e){return v.access(this,function(e){var n=this[0]||{},r=0,i=this.length;if(e===t)return n.nodeType===1?n.innerHTML.replace(ht,\"\"):t;if(typeof e==\"string\"&&!yt.test(e)&&(v.support.htmlSerialize||!wt.test(e))&&(v.support.leadingWhitespace||!pt.test(e))&&!Nt[(vt.exec(e)||[\"\",\"\"])[1].toLowerCase()]){e=e.replace(dt,\"<$1></$2>\");try{for(;r<i;r++)n=this[r]||{},n.nodeType===1&&(v.cleanData(n.getElementsByTagName(\"*\")),n.innerHTML=e);n=0}catch(s){}}n&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(e){return ut(this[0])?this.length?this.pushStack(v(v.isFunction(e)?e():e),\"replaceWith\",e):this:v.isFunction(e)?this.each(function(t){var n=v(this),r=n.html();n.replaceWith(e.call(this,t,r))}):(typeof e!=\"string\"&&(e=v(e).detach()),this.each(function(){var t=this.nextSibling,n=this.parentNode;v(this).remove(),t?v(t).before(e):v(n).append(e)}))},detach:function(e){return this.remove(e,!0)},domManip:function(e,n,r){e=[].concat.apply([],e);var i,s,o,u,a=0,f=e[0],l=[],c=this.length;if(!v.support.checkClone&&c>1&&typeof f==\"string\"&&St.test(f))return this.each(function(){v(this).domManip(e,n,r)});if(v.isFunction(f))return this.each(function(i){var s=v(this);e[0]=f.call(this,i,n?s.html():t),s.domManip(e,n,r)});if(this[0]){i=v.buildFragment(e,this,l),o=i.fragment,s=o.firstChild,o.childNodes.length===1&&(o=s);if(s){n=n&&v.nodeName(s,\"tr\");for(u=i.cacheable||c-1;a<c;a++)r.call(n&&v.nodeName(this[a],\"table\")?Lt(this[a],\"tbody\"):this[a],a===u?o:v.clone(o,!0,!0))}o=s=null,l.length&&v.each(l,function(e,t){t.src?v.ajax?v.ajax({url:t.src,type:\"GET\",dataType:\"script\",async:!1,global:!1,\"throws\":!0}):v.error(\"no ajax\"):v.globalEval((t.text||t.textContent||t.innerHTML||\"\").replace(Tt,\"\")),t.parentNode&&t.parentNode.removeChild(t)})}return this}}),v.buildFragment=function(e,n,r){var s,o,u,a=e[0];return n=n||i,n=!n.nodeType&&n[0]||n,n=n.ownerDocument||n,e.length===1&&typeof a==\"string\"&&a.length<512&&n===i&&a.charAt(0)===\"<\"&&!bt.test(a)&&(v.support.checkClone||!St.test(a))&&(v.support.html5Clone||!wt.test(a))&&(o=!0,s=v.fragments[a],u=s!==t),s||(s=n.createDocumentFragment(),v.clean(e,n,s,r),o&&(v.fragments[a]=u&&s)),{fragment:s,cacheable:o}},v.fragments={},v.each({appendTo:\"append\",prependTo:\"prepend\",insertBefore:\"before\",insertAfter:\"after\",replaceAll:\"replaceWith\"},function(e,t){v.fn[e]=function(n){var r,i=0,s=[],o=v(n),u=o.length,a=this.length===1&&this[0].parentNode;if((a==null||a&&a.nodeType===11&&a.childNodes.length===1)&&u===1)return o[t](this[0]),this;for(;i<u;i++)r=(i>0?this.clone(!0):this).get(),v(o[i])[t](r),s=s.concat(r);return this.pushStack(s,e,o.selector)}}),v.extend({clone:function(e,t,n){var r,i,s,o;v.support.html5Clone||v.isXMLDoc(e)||!wt.test(\"<\"+e.nodeName+\">\")?o=e.cloneNode(!0):(kt.innerHTML=e.outerHTML,kt.removeChild(o=kt.firstChild));if((!v.support.noCloneEvent||!v.support.noCloneChecked)&&(e.nodeType===1||e.nodeType===11)&&!v.isXMLDoc(e)){Ot(e,o),r=Mt(e),i=Mt(o);for(s=0;r[s];++s)i[s]&&Ot(r[s],i[s])}if(t){At(e,o);if(n){r=Mt(e),i=Mt(o);for(s=0;r[s];++s)At(r[s],i[s])}}return r=i=null,o},clean:function(e,t,n,r){var s,o,u,a,f,l,c,h,p,d,m,g,y=t===i&&Ct,b=[];if(!t||typeof t.createDocumentFragment==\"undefined\")t=i;for(s=0;(u=e[s])!=null;s++){typeof u==\"number\"&&(u+=\"\");if(!u)continue;if(typeof u==\"string\")if(!gt.test(u))u=t.createTextNode(u);else{y=y||lt(t),c=t.createElement(\"div\"),y.appendChild(c),u=u.replace(dt,\"<$1></$2>\"),a=(vt.exec(u)||[\"\",\"\"])[1].toLowerCase(),f=Nt[a]||Nt._default,l=f[0],c.innerHTML=f[1]+u+f[2];while(l--)c=c.lastChild;if(!v.support.tbody){h=mt.test(u),p=a===\"table\"&&!h?c.firstChild&&c.firstChild.childNodes:f[1]===\"<table>\"&&!h?c.childNodes:[];for(o=p.length-1;o>=0;--o)v.nodeName(p[o],\"tbody\")&&!p[o].childNodes.length&&p[o].parentNode.removeChild(p[o])}!v.support.leadingWhitespace&&pt.test(u)&&c.insertBefore(t.createTextNode(pt.exec(u)[0]),c.firstChild),u=c.childNodes,c.parentNode.removeChild(c)}u.nodeType?b.push(u):v.merge(b,u)}c&&(u=c=y=null);if(!v.support.appendChecked)for(s=0;(u=b[s])!=null;s++)v.nodeName(u,\"input\")?_t(u):typeof u.getElementsByTagName!=\"undefined\"&&v.grep(u.getElementsByTagName(\"input\"),_t);if(n){m=function(e){if(!e.type||xt.test(e.type))return r?r.push(e.parentNode?e.parentNode.removeChild(e):e):n.appendChild(e)};for(s=0;(u=b[s])!=null;s++)if(!v.nodeName(u,\"script\")||!m(u))n.appendChild(u),typeof u.getElementsByTagName!=\"undefined\"&&(g=v.grep(v.merge([],u.getElementsByTagName(\"script\")),m),b.splice.apply(b,[s+1,0].concat(g)),s+=g.length)}return b},cleanData:function(e,t){var n,r,i,s,o=0,u=v.expando,a=v.cache,f=v.support.deleteExpando,l=v.event.special;for(;(i=e[o])!=null;o++)if(t||v.acceptData(i)){r=i[u],n=r&&a[r];if(n){if(n.events)for(s in n.events)l[s]?v.event.remove(i,s):v.removeEvent(i,s,n.handle);a[r]&&(delete a[r],f?delete i[u]:i.removeAttribute?i.removeAttribute(u):i[u]=null,v.deletedIds.push(r))}}}});var Dt=/%20/g,Pt=/\\[\\]$/,Ht=/\\r?\\n/g,Bt=/^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,jt=/^(?:select|textarea)/i;v.fn.extend({serialize:function(){return v.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?v.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||jt.test(this.nodeName)||Bt.test(this.type))}).map(function(e,t){var n=v(this).val();return n==null?null:v.isArray(n)?v.map(n,function(e,n){return{name:t.name,value:e.replace(Ht,\"\\r\\n\")}}):{name:t.name,value:n.replace(Ht,\"\\r\\n\")}}).get()}}),v.param=function(e,n){var r,i=[],s=function(e,t){t=v.isFunction(t)?t():t==null?\"\":t,i[i.length]=encodeURIComponent(e)+\"=\"+encodeURIComponent(t)};n===t&&(n=v.ajaxSettings&&v.ajaxSettings.traditional);if(v.isArray(e)||e.jquery&&!v.isPlainObject(e))v.each(e,function(){s(this.name,this.value)});else for(r in e)Ft(r,e[r],n,s);return i.join(\"&\").replace(Dt,\"+\")};var It,qt,Rt=/#.*$/,Ut=/^(.*?):[ \\t]*([^\\r\\n]*)\\r?$/mg,zt=/^(?:about|app|app\\-storage|.+\\-extension|file|res|widget):$/,Wt=/^(?:GET|HEAD)$/,Xt=/^\\/\\//,Vt=/\\?/,$t=/<script\\b[^<]*(?:(?!<\\/script>)<[^<]*)*<\\/script>/gi,Jt=/([?&])_=[^&]*/,Kt=/^([\\w\\+\\.\\-]+:)(?:\\/\\/([^\\/?#:]*)(?::(\\d+)|)|)/,Qt=v.fn.load,Gt={},Yt={},Zt=[\"*/\"]+[\"*\"];try{qt=s.href}catch(en){qt=i.createElement(\"a\"),qt.href=\"\",qt=qt.href}It=Kt.exec(qt.toLowerCase())||[],v.fn.load=function(e,n,r){if(typeof e!=\"string\"&&Qt)return Qt.apply(this,arguments);if(!this.length)return this;var i,s,o,u=this,a=e.indexOf(\" \");return a>=0&&(i=e.slice(a,e.length),e=e.slice(0,a)),v.isFunction(n)?(r=n,n=t):n&&typeof n==\"object\"&&(s=\"POST\"),v.ajax({url:e,type:s,dataType:\"html\",data:n,complete:function(e,t){r&&u.each(r,o||[e.responseText,t,e])}}).done(function(e){o=arguments,u.html(i?v(\"<div>\").append(e.replace($t,\"\")).find(i):e)}),this},v.each(\"ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend\".split(\" \"),function(e,t){v.fn[t]=function(e){return this.on(t,e)}}),v.each([\"get\",\"post\"],function(e,n){v[n]=function(e,r,i,s){return v.isFunction(r)&&(s=s||i,i=r,r=t),v.ajax({type:n,url:e,data:r,success:i,dataType:s})}}),v.extend({getScript:function(e,n){return v.get(e,t,n,\"script\")},getJSON:function(e,t,n){return v.get(e,t,n,\"json\")},ajaxSetup:function(e,t){return t?rn(e,v.ajaxSettings):(t=e,e=v.ajaxSettings),rn(e,t),e},ajaxSettings:{url:qt,isLocal:zt.test(It[1]),global:!0,type:\"GET\",contentType:\"application/x-www-form-urlencoded; charset=UTF-8\",processData:!0,async:!0,accepts:{xml:\"application/xml, text/xml\",html:\"text/html\",text:\"text/plain\",json:\"application/json, text/javascript\",\"*\":Zt},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:\"responseXML\",text:\"responseText\"},converters:{\"* text\":e.String,\"text html\":!0,\"text json\":v.parseJSON,\"text xml\":v.parseXML},flatOptions:{context:!0,url:!0}},ajaxPrefilter:tn(Gt),ajaxTransport:tn(Yt),ajax:function(e,n){function T(e,n,s,a){var l,y,b,w,S,T=n;if(E===2)return;E=2,u&&clearTimeout(u),o=t,i=a||\"\",x.readyState=e>0?4:0,s&&(w=sn(c,x,s));if(e>=200&&e<300||e===304)c.ifModified&&(S=x.getResponseHeader(\"Last-Modified\"),S&&(v.lastModified[r]=S),S=x.getResponseHeader(\"Etag\"),S&&(v.etag[r]=S)),e===304?(T=\"notmodified\",l=!0):(l=on(c,w),T=l.state,y=l.data,b=l.error,l=!b);else{b=T;if(!T||e)T=\"error\",e<0&&(e=0)}x.status=e,x.statusText=(n||T)+\"\",l?d.resolveWith(h,[y,T,x]):d.rejectWith(h,[x,T,b]),x.statusCode(g),g=t,f&&p.trigger(\"ajax\"+(l?\"Success\":\"Error\"),[x,c,l?y:b]),m.fireWith(h,[x,T]),f&&(p.trigger(\"ajaxComplete\",[x,c]),--v.active||v.event.trigger(\"ajaxStop\"))}typeof e==\"object\"&&(n=e,e=t),n=n||{};var r,i,s,o,u,a,f,l,c=v.ajaxSetup({},n),h=c.context||c,p=h!==c&&(h.nodeType||h instanceof v)?v(h):v.event,d=v.Deferred(),m=v.Callbacks(\"once memory\"),g=c.statusCode||{},b={},w={},E=0,S=\"canceled\",x={readyState:0,setRequestHeader:function(e,t){if(!E){var n=e.toLowerCase();e=w[n]=w[n]||e,b[e]=t}return this},getAllResponseHeaders:function(){return E===2?i:null},getResponseHeader:function(e){var n;if(E===2){if(!s){s={};while(n=Ut.exec(i))s[n[1].toLowerCase()]=n[2]}n=s[e.toLowerCase()]}return n===t?null:n},overrideMimeType:function(e){return E||(c.mimeType=e),this},abort:function(e){return e=e||S,o&&o.abort(e),T(0,e),this}};d.promise(x),x.success=x.done,x.error=x.fail,x.complete=m.add,x.statusCode=function(e){if(e){var t;if(E<2)for(t in e)g[t]=[g[t],e[t]];else t=e[x.status],x.always(t)}return this},c.url=((e||c.url)+\"\").replace(Rt,\"\").replace(Xt,It[1]+\"//\"),c.dataTypes=v.trim(c.dataType||\"*\").toLowerCase().split(y),c.crossDomain==null&&(a=Kt.exec(c.url.toLowerCase())||!1,c.crossDomain=a&&a.join(\":\")+(a[3]?\"\":a[1]===\"http:\"?80:443)!==It.join(\":\")+(It[3]?\"\":It[1]===\"http:\"?80:443)),c.data&&c.processData&&typeof c.data!=\"string\"&&(c.data=v.param(c.data,c.traditional)),nn(Gt,c,n,x);if(E===2)return x;f=c.global,c.type=c.type.toUpperCase(),c.hasContent=!Wt.test(c.type),f&&v.active++===0&&v.event.trigger(\"ajaxStart\");if(!c.hasContent){c.data&&(c.url+=(Vt.test(c.url)?\"&\":\"?\")+c.data,delete c.data),r=c.url;if(c.cache===!1){var N=v.now(),C=c.url.replace(Jt,\"$1_=\"+N);c.url=C+(C===c.url?(Vt.test(c.url)?\"&\":\"?\")+\"_=\"+N:\"\")}}(c.data&&c.hasContent&&c.contentType!==!1||n.contentType)&&x.setRequestHeader(\"Content-Type\",c.contentType),c.ifModified&&(r=r||c.url,v.lastModified[r]&&x.setRequestHeader(\"If-Modified-Since\",v.lastModified[r]),v.etag[r]&&x.setRequestHeader(\"If-None-Match\",v.etag[r])),x.setRequestHeader(\"Accept\",c.dataTypes[0]&&c.accepts[c.dataTypes[0]]?c.accepts[c.dataTypes[0]]+(c.dataTypes[0]!==\"*\"?\", \"+Zt+\"; q=0.01\":\"\"):c.accepts[\"*\"]);for(l in c.headers)x.setRequestHeader(l,c.headers[l]);if(!c.beforeSend||c.beforeSend.call(h,x,c)!==!1&&E!==2){S=\"abort\";for(l in{success:1,error:1,complete:1})x[l](c[l]);o=nn(Yt,c,n,x);if(!o)T(-1,\"No Transport\");else{x.readyState=1,f&&p.trigger(\"ajaxSend\",[x,c]),c.async&&c.timeout>0&&(u=setTimeout(function(){x.abort(\"timeout\")},c.timeout));try{E=1,o.send(b,T)}catch(k){if(!(E<2))throw k;T(-1,k)}}return x}return x.abort()},active:0,lastModified:{},etag:{}});var un,an=e.ActiveXObject?function(){for(var e in un)un[e](0,1)}:!1,fn=0;v.ajaxSettings.xhr=e.ActiveXObject?function(){return!this.isLocal&&ln()||cn()}:ln,function(e){v.extend(v.support,{ajax:!!e,cors:!!e&&\"withCredentials\"in e})}(v.ajaxSettings.xhr()),v.support.ajax&&v.ajaxTransport(function(n){if(!n.crossDomain||v.support.cors){var r;return{send:function(i,s){var o,u,a=n.xhr();n.username?a.open(n.type,n.url,n.async,n.username,n.password):a.open(n.type,n.url,n.async);if(n.xhrFields)for(u in n.xhrFields)a[u]=n.xhrFields[u];n.mimeType&&a.overrideMimeType&&a.overrideMimeType(n.mimeType),!n.crossDomain&&!i[\"X-Requested-With\"]&&(i[\"X-Requested-With\"]=\"XMLHttpRequest\");try{for(u in i)a.setRequestHeader(u,i[u])}catch(f){}a.send(n.hasContent&&n.data||null),r=function(e,i){var u,f,l,c,h;try{if(r&&(i||a.readyState===4)){r=t,o&&(a.onreadystatechange=v.noop,an&&delete un[o]);if(i)a.readyState!==4&&a.abort();else{u=a.status,l=a.getAllResponseHeaders(),c={},h=a.responseXML,h&&h.documentElement&&(c.xml=h);try{c.text=a.responseText}catch(e){}try{f=a.statusText}catch(p){f=\"\"}!u&&n.isLocal&&!n.crossDomain?u=c.text?200:404:u===1223&&(u=204)}}}catch(d){i||s(-1,d)}c&&s(u,f,c,l)},n.async?a.readyState===4?setTimeout(r,0):(o=++fn,an&&(un||(un={},v(e).unload(an)),un[o]=r),a.onreadystatechange=r):r()},abort:function(){r&&r(0,1)}}}}),e.jQuery=e.$=v,typeof define==\"function\"&&define.amd&&define.amd.jQuery&&define(\"jquery\",[],function(){return v})})(window);\n"}}},{"rowIdx":789376,"cells":{"path":{"kind":"string","value":"ajax/libs/react-grid-layout/0.13.6/react-grid-layout.min.js"},"repo_name":{"kind":"string","value":"joeyparrish/cdnjs"},"content":{"kind":"string","value":"!function(t,e){\"object\"==typeof exports&&\"object\"==typeof module?module.exports=e(require(\"react\"),require(\"react-dom\")):\"function\"==typeof define&&define.amd?define([\"react\",\"react-dom\"],e):\"object\"==typeof exports?exports.ReactGridLayout=e(require(\"react\"),require(\"react-dom\")):t.ReactGridLayout=e(t.React,t.ReactDOM)}(this,function(t,e){return function(t){function e(n){if(r[n])return r[n].exports;var o=r[n]={exports:{},id:n,loaded:!1};return t[n].call(o.exports,o,o.exports,e),o.loaded=!0,o.exports}var r={};return e.m=t,e.c=r,e.p=\"\",e(0)}([function(t,e,r){\"use strict\";t.exports=r(4)[\"default\"],t.exports.utils=r(2),t.exports.Responsive=r(10)[\"default\"],t.exports.Responsive.utils=r(5),t.exports.WidthProvider=r(11)[\"default\"]},function(e,r){e.exports=t},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t){for(var e=0,r=void 0,n=0,o=t.length;n<o;n++)r=t[n].y+t[n].h,r>e&&(e=r);return e}function a(t){for(var e=Array(t.length),r=0,n=t.length;r<n;r++)e[r]=i(t[r]);return e}function i(t){return{w:t.w,h:t.h,x:t.x,y:t.y,i:t.i,minW:t.minW,maxW:t.maxW,minH:t.minH,maxH:t.maxH,moved:Boolean(t.moved),\"static\":Boolean(t[\"static\"]),isDraggable:t.isDraggable,isResizable:t.isResizable}}function s(t,e){return(0,R[\"default\"])(C[\"default\"].Children.map(t,function(t){return t.key}),C[\"default\"].Children.map(e,function(t){return t.key}))}function u(t,e){return t!==e&&(!(t.x+t.w<=e.x)&&(!(t.x>=e.x+e.w)&&(!(t.y+t.h<=e.y)&&!(t.y>=e.y+e.h))))}function l(t,e){for(var r=y(t),n=S(t),o=Array(t.length),a=0,i=n.length;a<i;a++){var s=n[a];s[\"static\"]||(s=c(r,s,e),r.push(s)),o[t.indexOf(s)]=s,s.moved=!1}return o}function c(t,e,r){if(r)for(e.y=Math.min(o(t),e.y);e.y>0&&!h(t,e);)e.y--;for(var n=void 0;n=h(t,e);)e.y=n.y+n.h;return e}function p(t,e){for(var r=y(t),n=0,o=t.length;n<o;n++){var a=t[n];if(a.x+a.w>e.cols&&(a.x=e.cols-a.w),a.x<0&&(a.x=0,a.w=e.cols),a[\"static\"])for(;h(r,a);)a.y++;else r.push(a)}return t}function f(t,e){for(var r=0,n=t.length;r<n;r++)if(t[r].i===e)return t[r]}function h(t,e){for(var r=0,n=t.length;r<n;r++)if(u(t[r],e))return t[r]}function d(t,e){return t.filter(function(t){return u(t,e)})}function y(t){return t.filter(function(t){return t[\"static\"]})}function g(t,e,r,n,o){if(e[\"static\"])return t;if(e.y===n&&e.x===r)return t;var a=n&&e.y>n;\"number\"==typeof r&&(e.x=r),\"number\"==typeof n&&(e.y=n),e.moved=!0;var i=S(t);a&&(i=i.reverse());for(var s=d(i,e),u=0,l=s.length;u<l;u++){var c=s[u];c.moved||e.y>c.y&&e.y-c.y>c.h/4||(t=c[\"static\"]?m(t,c,e,o):m(t,e,c,o))}return t}function m(t,e,r,n){if(n){var o={x:r.x,y:r.y,w:r.w,h:r.h,i:\"-1\"};if(o.y=Math.max(e.y-r.h,0),!h(t,o))return g(t,r,void 0,o.y)}return g(t,r,void 0,r.y+1)}function v(t){return 100*t+\"%\"}function b(t){var e=t.top,r=t.left,n=t.width,o=t.height,a=\"translate(\"+r+\"px,\"+e+\"px)\";return{transform:a,WebkitTransform:a,MozTransform:a,msTransform:a,OTransform:a,width:n+\"px\",height:o+\"px\",position:\"absolute\"}}function w(t){var e=t.top,r=t.left,n=t.width,o=t.height;return{top:e+\"px\",left:r+\"px\",width:n+\"px\",height:o+\"px\",position:\"absolute\"}}function S(t){return[].concat(t).sort(function(t,e){return t.y>e.y||t.y===e.y&&t.x>e.x?1:-1})}function x(t,e,r,n){Array.isArray(e)||(e=[e]),t=t||[];for(var a=[],s=0,u=e.length;s<u;s++){var c=void 0,h=e[s],d=f(t,h.key||\"1\");if(d)c=i(d);else{var y=h.props[\"data-grid\"]||h.props._grid;y?(j||P([y],\"ReactGridLayout.children\"),c=i(T({},y,{i:h.key}))):c=i({w:1,h:1,x:0,y:o(a),i:h.key||\"1\"})}a[s]=c}return a=p(a,{cols:r}),a=l(a,n)}function P(t,e){e=e||\"Layout\";var r=[\"x\",\"y\",\"w\",\"h\"];if(!Array.isArray(t))throw new Error(e+\" must be an array!\");for(var n=0,o=t.length;n<o;n++){for(var a=t[n],i=0;i<r.length;i++)if(\"number\"!=typeof a[r[i]])throw new Error(\"ReactGridLayout: \"+e+\"[\"+n+\"].\"+r[i]+\" must be a number!\");if(a.i&&\"string\"!=typeof a.i)throw new Error(\"ReactGridLayout: \"+e+\"[\"+n+\"].i must be a string!\");if(void 0!==a[\"static\"]&&\"boolean\"!=typeof a[\"static\"])throw new Error(\"ReactGridLayout: \"+e+\"[\"+n+\"].static must be a boolean!\")}}function _(t,e){e.forEach(function(e){return t[e]=t[e].bind(t)})}e.__esModule=!0;var T=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t};e.bottom=o,e.cloneLayout=a,e.cloneLayoutItem=i,e.childrenEqual=s,e.collides=u,e.compact=l,e.compactItem=c,e.correctBounds=p,e.getLayoutItem=f,e.getFirstCollision=h,e.getAllCollisions=d,e.getStatics=y,e.moveElement=g,e.moveElementAwayFromCollision=m,e.perc=v,e.setTransform=b,e.setTopLeft=w,e.sortLayoutItemsByRowCol=S,e.synchronizeLayoutWithChildren=x,e.validateLayout=P,e.autoBindHandlers=_;var D=r(3),R=n(D),O=r(1),C=n(O),j=!0},function(t,e,r){(function(t,r){function n(t,e){for(var r=-1,n=t?t.length:0;++r<n;)if(e(t[r],r,t))return!0;return!1}function o(t,e){for(var r=-1,n=Array(t);++r<t;)n[r]=e(r);return n}function a(t){return function(e){return t(e)}}function i(t,e){return null==t?void 0:t[e]}function s(t){var e=!1;if(null!=t&&\"function\"!=typeof t.toString)try{e=!!(t+\"\")}catch(r){}return e}function u(t){var e=-1,r=Array(t.size);return t.forEach(function(t,n){r[++e]=[n,t]}),r}function l(t,e){return function(r){return t(e(r))}}function c(t){var e=-1,r=Array(t.size);return t.forEach(function(t){r[++e]=t}),r}function p(t){var e=-1,r=t?t.length:0;for(this.clear();++e<r;){var n=t[e];this.set(n[0],n[1])}}function f(){this.__data__=xe?xe(null):{}}function h(t){return this.has(t)&&delete this.__data__[t]}function d(t){var e=this.__data__;if(xe){var r=e[t];return r===ht?void 0:r}return le.call(e,t)?e[t]:void 0}function y(t){var e=this.__data__;return xe?void 0!==e[t]:le.call(e,t)}function g(t,e){var r=this.__data__;return r[t]=xe&&void 0===e?ht:e,this}function m(t){var e=-1,r=t?t.length:0;for(this.clear();++e<r;){var n=t[e];this.set(n[0],n[1])}}function v(){this.__data__=[]}function b(t){var e=this.__data__,r=A(e,t);if(r<0)return!1;var n=e.length-1;return r==n?e.pop():ye.call(e,r,1),!0}function w(t){var e=this.__data__,r=A(e,t);return r<0?void 0:e[r][1]}function S(t){return A(this.__data__,t)>-1}function x(t,e){var r=this.__data__,n=A(r,t);return n<0?r.push([t,e]):r[n][1]=e,this}function P(t){var e=-1,r=t?t.length:0;for(this.clear();++e<r;){var n=t[e];this.set(n[0],n[1])}}function _(){this.__data__={hash:new p,map:new(ve||m),string:new p}}function T(t){return $(this,t)[\"delete\"](t)}function D(t){return $(this,t).get(t)}function R(t){return $(this,t).has(t)}function O(t,e){return $(this,t).set(t,e),this}function C(t){var e=-1,r=t?t.length:0;for(this.__data__=new P;++e<r;)this.add(t[e])}function j(t){return this.__data__.set(t,ht),this}function z(t){return this.__data__.has(t)}function E(t){this.__data__=new m(t)}function k(){this.__data__=new m}function M(t){return this.__data__[\"delete\"](t)}function W(t){return this.__data__.get(t)}function L(t){return this.__data__.has(t)}function H(t,e){var r=this.__data__;if(r instanceof m){var n=r.__data__;if(!ve||n.length<ft-1)return n.push([t,e]),this;r=this.__data__=new P(n)}return r.set(t,e),this}function N(t,e){var r=ze(t)||nt(t)?o(t.length,String):[],n=r.length,a=!!n;for(var i in t)!e&&!le.call(t,i)||a&&(\"length\"==i||J(i,n))||r.push(i);return r}function A(t,e){for(var r=t.length;r--;)if(rt(t[r][0],e))return r;return-1}function I(t){return ce.call(t)}function B(t,e,r,n,o){return t===e||(null==t||null==e||!lt(t)&&!ct(e)?t!==t&&e!==e:X(t,e,B,r,n,o))}function X(t,e,r,n,o,a){var i=ze(t),u=ze(e),l=vt,c=vt;i||(l=je(t),l=l==mt?Dt:l),u||(c=je(e),c=c==mt?Dt:c);var p=l==Dt&&!s(t),f=c==Dt&&!s(e),h=l==c;if(h&&!p)return a||(a=new E),i||Ee(t)?U(t,e,r,n,o,a):F(t,e,l,r,n,o,a);if(!(o&yt)){var d=p&&le.call(t,\"__wrapped__\"),y=f&&le.call(e,\"__wrapped__\");if(d||y){var g=d?t.value():t,m=y?e.value():e;return a||(a=new E),r(g,m,n,o,a)}}return!!h&&(a||(a=new E),V(t,e,r,n,o,a))}function Y(t){if(!lt(t)||Z(t))return!1;var e=st(t)||s(t)?pe:Gt;return e.test(et(t))}function q(t){return ct(t)&&ut(t.length)&&!!Ft[ce.call(t)]}function G(t){if(!tt(t))return ge(t);var e=[];for(var r in Object(t))le.call(t,r)&&\"constructor\"!=r&&e.push(r);return e}function U(t,e,r,o,a,i){var s=a&yt,u=t.length,l=e.length;if(u!=l&&!(s&&l>u))return!1;var c=i.get(t);if(c&&i.get(e))return c==e;var p=-1,f=!0,h=a&dt?new C:void 0;for(i.set(t,e),i.set(e,t);++p<u;){var d=t[p],y=e[p];if(o)var g=s?o(y,d,p,e,t,i):o(d,y,p,t,e,i);if(void 0!==g){if(g)continue;f=!1;break}if(h){if(!n(e,function(t,e){if(!h.has(e)&&(d===t||r(d,t,o,a,i)))return h.add(e)})){f=!1;break}}else if(d!==y&&!r(d,y,o,a,i)){f=!1;break}}return i[\"delete\"](t),i[\"delete\"](e),f}function F(t,e,r,n,o,a,i){switch(r){case Mt:if(t.byteLength!=e.byteLength||t.byteOffset!=e.byteOffset)return!1;t=t.buffer,e=e.buffer;case kt:return!(t.byteLength!=e.byteLength||!n(new he(t),new he(e)));case bt:case wt:case Tt:return rt(+t,+e);case St:return t.name==e.name&&t.message==e.message;case Ot:case jt:return t==e+\"\";case _t:var s=u;case Ct:var l=a&yt;if(s||(s=c),t.size!=e.size&&!l)return!1;var p=i.get(t);if(p)return p==e;a|=dt,i.set(t,e);var f=U(s(t),s(e),n,o,a,i);return i[\"delete\"](t),f;case zt:if(Ce)return Ce.call(t)==Ce.call(e)}return!1}function V(t,e,r,n,o,a){var i=o&yt,s=pt(t),u=s.length,l=pt(e),c=l.length;if(u!=c&&!i)return!1;for(var p=u;p--;){var f=s[p];if(!(i?f in e:le.call(e,f)))return!1}var h=a.get(t);if(h&&a.get(e))return h==e;var d=!0;a.set(t,e),a.set(e,t);for(var y=i;++p<u;){f=s[p];var g=t[f],m=e[f];if(n)var v=i?n(m,g,f,e,t,a):n(g,m,f,t,e,a);if(!(void 0===v?g===m||r(g,m,n,o,a):v)){d=!1;break}y||(y=\"constructor\"==f)}if(d&&!y){var b=t.constructor,w=e.constructor;b!=w&&\"constructor\"in t&&\"constructor\"in e&&!(\"function\"==typeof b&&b instanceof b&&\"function\"==typeof w&&w instanceof w)&&(d=!1)}return a[\"delete\"](t),a[\"delete\"](e),d}function $(t,e){var r=t.__data__;return Q(e)?r[\"string\"==typeof e?\"string\":\"hash\"]:r.map}function K(t,e){var r=i(t,e);return Y(r)?r:void 0}function J(t,e){return e=null==e?gt:e,!!e&&(\"number\"==typeof t||Ut.test(t))&&t>-1&&t%1==0&&t<e}function Q(t){var e=typeof t;return\"string\"==e||\"number\"==e||\"symbol\"==e||\"boolean\"==e?\"__proto__\"!==t:null===t}function Z(t){return!!se&&se in t}function tt(t){var e=t&&t.constructor,r=\"function\"==typeof e&&e.prototype||ae;return t===r}function et(t){if(null!=t){try{return ue.call(t)}catch(e){}try{return t+\"\"}catch(e){}}return\"\"}function rt(t,e){return t===e||t!==t&&e!==e}function nt(t){return at(t)&&le.call(t,\"callee\")&&(!de.call(t,\"callee\")||ce.call(t)==mt)}function ot(t){return null!=t&&ut(t.length)&&!st(t)}function at(t){return ct(t)&&ot(t)}function it(t,e){return B(t,e)}function st(t){var e=lt(t)?ce.call(t):\"\";return e==xt||e==Pt}function ut(t){return\"number\"==typeof t&&t>-1&&t%1==0&&t<=gt}function lt(t){var e=typeof t;return!!t&&(\"object\"==e||\"function\"==e)}function ct(t){return!!t&&\"object\"==typeof t}function pt(t){return ot(t)?N(t):G(t)}var ft=200,ht=\"__lodash_hash_undefined__\",dt=1,yt=2,gt=9007199254740991,mt=\"[object Arguments]\",vt=\"[object Array]\",bt=\"[object Boolean]\",wt=\"[object Date]\",St=\"[object Error]\",xt=\"[object Function]\",Pt=\"[object GeneratorFunction]\",_t=\"[object Map]\",Tt=\"[object Number]\",Dt=\"[object Object]\",Rt=\"[object Promise]\",Ot=\"[object RegExp]\",Ct=\"[object Set]\",jt=\"[object String]\",zt=\"[object Symbol]\",Et=\"[object WeakMap]\",kt=\"[object ArrayBuffer]\",Mt=\"[object DataView]\",Wt=\"[object Float32Array]\",Lt=\"[object Float64Array]\",Ht=\"[object Int8Array]\",Nt=\"[object Int16Array]\",At=\"[object Int32Array]\",It=\"[object Uint8Array]\",Bt=\"[object Uint8ClampedArray]\",Xt=\"[object Uint16Array]\",Yt=\"[object Uint32Array]\",qt=/[\\\\^$.*+?()[\\]{}|]/g,Gt=/^\\[object .+?Constructor\\]$/,Ut=/^(?:0|[1-9]\\d*)$/,Ft={};Ft[Wt]=Ft[Lt]=Ft[Ht]=Ft[Nt]=Ft[At]=Ft[It]=Ft[Bt]=Ft[Xt]=Ft[Yt]=!0,Ft[mt]=Ft[vt]=Ft[kt]=Ft[bt]=Ft[Mt]=Ft[wt]=Ft[St]=Ft[xt]=Ft[_t]=Ft[Tt]=Ft[Dt]=Ft[Ot]=Ft[Ct]=Ft[jt]=Ft[Et]=!1;var Vt=\"object\"==typeof t&&t&&t.Object===Object&&t,$t=\"object\"==typeof self&&self&&self.Object===Object&&self,Kt=Vt||$t||Function(\"return this\")(),Jt=\"object\"==typeof e&&e&&!e.nodeType&&e,Qt=Jt&&\"object\"==typeof r&&r&&!r.nodeType&&r,Zt=Qt&&Qt.exports===Jt,te=Zt&&Vt.process,ee=function(){try{return te&&te.binding(\"util\")}catch(t){}}(),re=ee&&ee.isTypedArray,ne=Array.prototype,oe=Function.prototype,ae=Object.prototype,ie=Kt[\"__core-js_shared__\"],se=function(){var t=/[^.]+$/.exec(ie&&ie.keys&&ie.keys.IE_PROTO||\"\");return t?\"Symbol(src)_1.\"+t:\"\"}(),ue=oe.toString,le=ae.hasOwnProperty,ce=ae.toString,pe=RegExp(\"^\"+ue.call(le).replace(qt,\"\\\\$&\").replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g,\"$1.*?\")+\"$\"),fe=Kt.Symbol,he=Kt.Uint8Array,de=ae.propertyIsEnumerable,ye=ne.splice,ge=l(Object.keys,Object),me=K(Kt,\"DataView\"),ve=K(Kt,\"Map\"),be=K(Kt,\"Promise\"),we=K(Kt,\"Set\"),Se=K(Kt,\"WeakMap\"),xe=K(Object,\"create\"),Pe=et(me),_e=et(ve),Te=et(be),De=et(we),Re=et(Se),Oe=fe?fe.prototype:void 0,Ce=Oe?Oe.valueOf:void 0;p.prototype.clear=f,p.prototype[\"delete\"]=h,p.prototype.get=d,p.prototype.has=y,p.prototype.set=g,m.prototype.clear=v,m.prototype[\"delete\"]=b,m.prototype.get=w,m.prototype.has=S,m.prototype.set=x,P.prototype.clear=_,P.prototype[\"delete\"]=T,P.prototype.get=D,P.prototype.has=R,P.prototype.set=O,C.prototype.add=C.prototype.push=j,C.prototype.has=z,E.prototype.clear=k,E.prototype[\"delete\"]=M,E.prototype.get=W,E.prototype.has=L,E.prototype.set=H;var je=I;(me&&je(new me(new ArrayBuffer(1)))!=Mt||ve&&je(new ve)!=_t||be&&je(be.resolve())!=Rt||we&&je(new we)!=Ct||Se&&je(new Se)!=Et)&&(je=function(t){var e=ce.call(t),r=e==Dt?t.constructor:void 0,n=r?et(r):void 0;if(n)switch(n){case Pe:return Mt;case _e:return _t;case Te:return Rt;case De:return Ct;case Re:return Et}return e});var ze=Array.isArray,Ee=re?a(re):q;r.exports=it}).call(e,function(){return this}(),r(15)(t))},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function a(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function i(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var s=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},u=r(1),l=n(u),c=r(3),p=n(c),f=r(2),h=r(9),d=n(h),y=function(){},g=function(t){function e(r,n){o(this,e);var i=a(this,t.call(this,r,n));return m.call(i),(0,f.autoBindHandlers)(i,[\"onDragStart\",\"onDrag\",\"onDragStop\",\"onResizeStart\",\"onResize\",\"onResizeStop\"]),i}return i(e,t),e.prototype.componentDidMount=function(){this.setState({mounted:!0}),this.props.onLayoutChange(this.state.layout)},e.prototype.componentWillReceiveProps=function(t){var e=void 0;if((0,p[\"default\"])(t.layout,this.props.layout)?(0,f.childrenEqual)(this.props.children,t.children)||(e=this.state.layout):e=t.layout,e){var r=(0,f.synchronizeLayoutWithChildren)(e,t.children,t.cols,t.verticalCompact);this.setState({layout:r}),this.props.onLayoutChange(r)}},e.prototype.containerHeight=function(){if(this.props.autoSize){var t=(0,f.bottom)(this.state.layout),e=this.props.containerPadding?this.props.containerPadding[1]:this.props.margin[1];return t*this.props.rowHeight+(t-1)*this.props.margin[1]+2*e+\"px\"}},e.prototype.onDragStart=function(t,e,r,n){var o=n.e,a=n.node,i=this.state.layout,s=(0,f.getLayoutItem)(i,t);s&&(this.setState({oldDragItem:(0,f.cloneLayoutItem)(s)}),this.props.onDragStart(i,s,s,null,o,a))},e.prototype.onDrag=function(t,e,r,n){var o=n.e,a=n.node,i=this.state.oldDragItem,s=this.state.layout,u=(0,f.getLayoutItem)(s,t);if(u){var l={w:u.w,h:u.h,x:u.x,y:u.y,placeholder:!0,i:t};s=(0,f.moveElement)(s,u,e,r,!0),this.props.onDrag(s,i,u,l,o,a),this.setState({layout:(0,f.compact)(s,this.props.verticalCompact),activeDrag:l})}},e.prototype.onDragStop=function(t,e,r,n){var o=n.e,a=n.node,i=this.state.oldDragItem,s=this.state.layout,u=(0,f.getLayoutItem)(s,t);u&&(s=(0,f.moveElement)(s,u,e,r,!0),this.props.onDragStop(s,i,u,null,o,a),this.setState({activeDrag:null,layout:(0,f.compact)(s,this.props.verticalCompact),oldDragItem:null}),this.props.onLayoutChange(this.state.layout))},e.prototype.onResizeStart=function(t,e,r,n){var o=n.e,a=n.node,i=this.state.layout,s=(0,f.getLayoutItem)(i,t);s&&(this.setState({oldResizeItem:(0,f.cloneLayoutItem)(s)}),this.props.onResizeStart(i,s,s,null,o,a))},e.prototype.onResize=function(t,e,r,n){var o=n.e,a=n.node,i=this.state,s=i.layout,u=i.oldResizeItem,l=(0,f.getLayoutItem)(s,t);if(l){l.w=e,l.h=r;var c={w:e,h:r,x:l.x,y:l.y,\"static\":!0,i:t};this.props.onResize(s,u,l,c,o,a),this.setState({layout:(0,f.compact)(s,this.props.verticalCompact),activeDrag:c})}},e.prototype.onResizeStop=function(t,e,r,n){var o=n.e,a=n.node,i=this.state,s=i.layout,u=i.oldResizeItem,l=(0,f.getLayoutItem)(s,t);this.props.onResizeStop(s,u,l,null,o,a),this.setState({activeDrag:null,layout:(0,f.compact)(s,this.props.verticalCompact),oldResizeItem:null}),this.props.onLayoutChange(this.state.layout)},e.prototype.placeholder=function(){var t=this.state.activeDrag;if(!t)return null;var e=this.props,r=e.width,n=e.cols,o=e.margin,a=e.containerPadding,i=e.rowHeight,s=e.maxRows,u=e.useCSSTransforms;return l[\"default\"].createElement(d[\"default\"],{w:t.w,h:t.h,x:t.x,y:t.y,i:t.i,className:\"react-grid-placeholder\",containerWidth:r,cols:n,margin:o,containerPadding:a||o,maxRows:s,rowHeight:i,isDraggable:!1,isResizable:!1,useCSSTransforms:u},l[\"default\"].createElement(\"div\",null))},e.prototype.processGridItem=function(t){if(t.key){var e=(0,f.getLayoutItem)(this.state.layout,t.key);if(!e)return null;var r=this.props,n=r.width,o=r.cols,a=r.margin,i=r.containerPadding,s=r.rowHeight,u=r.maxRows,c=r.isDraggable,p=r.isResizable,h=r.useCSSTransforms,y=r.draggableCancel,g=r.draggableHandle,m=this.state.mounted,v=Boolean(!e[\"static\"]&&c&&(e.isDraggable||null==e.isDraggable)),b=Boolean(!e[\"static\"]&&p&&(e.isResizable||null==e.isResizable));return l[\"default\"].createElement(d[\"default\"],{containerWidth:n,cols:o,margin:a,containerPadding:i||a,maxRows:u,rowHeight:s,cancel:y,handle:g,onDragStop:this.onDragStop,onDragStart:this.onDragStart,onDrag:this.onDrag,onResizeStart:this.onResizeStart,onResize:this.onResize,onResizeStop:this.onResizeStop,isDraggable:v,isResizable:b,useCSSTransforms:h&&m,usePercentages:!m,w:e.w,h:e.h,x:e.x,y:e.y,i:e.i,minH:e.minH,minW:e.minW,maxH:e.maxH,maxW:e.maxW,\"static\":e[\"static\"]},t)}},e.prototype.render=function(){var t=this,e=this.props,r=e.className,n=e.style,o=\"react-grid-layout \"+r,a=s({height:this.containerHeight()},n);return l[\"default\"].createElement(\"div\",{className:o,style:a},l[\"default\"].Children.map(this.props.children,function(e){return t.processGridItem(e)}),this.placeholder())},e}(l[\"default\"].Component);g.displayName=\"ReactGridLayout\",g.propTypes={className:u.PropTypes.string,style:u.PropTypes.object,width:u.PropTypes.number,autoSize:u.PropTypes.bool,cols:u.PropTypes.number,draggableCancel:u.PropTypes.string,draggableHandle:u.PropTypes.string,verticalCompact:u.PropTypes.bool,layout:function v(t){var v=t.layout;void 0!==v&&(0,f.validateLayout)(v,\"layout\")},margin:u.PropTypes.arrayOf(u.PropTypes.number),containerPadding:u.PropTypes.arrayOf(u.PropTypes.number),rowHeight:u.PropTypes.number,maxRows:u.PropTypes.number,isDraggable:u.PropTypes.bool,isResizable:u.PropTypes.bool,useCSSTransforms:u.PropTypes.bool,onLayoutChange:u.PropTypes.func,onDragStart:u.PropTypes.func,onDrag:u.PropTypes.func,onDragStop:u.PropTypes.func,onResizeStart:u.PropTypes.func,onResize:u.PropTypes.func,onResizeStop:u.PropTypes.func,children:function b(t,e,r){var b=t[e],n={};l[\"default\"].Children.forEach(b,function(t){if(n[t.key])throw new Error(\"Duplicate child key found! This will cause problems in ReactGridLayout.\");n[t.key]=!0})}},g.defaultProps={autoSize:!0,cols:12,className:\"\",rowHeight:150,maxRows:1/0,layout:[],margin:[10,10],isDraggable:!0,isResizable:!0,useCSSTransforms:!0,verticalCompact:!0,onLayoutChange:y,onDragStart:y,onDrag:y,onDragStop:y,onResizeStart:y,onResize:y,onResizeStop:y};var m=function(){this.state={activeDrag:null,layout:(0,f.synchronizeLayoutWithChildren)(this.props.layout,this.props.children,this.props.cols,this.props.verticalCompact),mounted:!1,oldDragItem:null,oldResizeItem:null}};e[\"default\"]=g},function(t,e,r){\"use strict\";function n(t,e){for(var r=i(t),n=r[0],o=1,a=r.length;o<a;o++){var s=r[o];e>t[s]&&(n=s)}return n}function o(t,e){if(!e[t])throw new Error(\"ResponsiveReactGridLayout: `cols` entry for breakpoint \"+t+\" is missing!\");return e[t]}function a(t,e,r,n,o,a){if(t[r])return(0,s.cloneLayout)(t[r]);for(var u=t[n],l=i(e),c=l.slice(l.indexOf(r)),p=0,f=c.length;p<f;p++){var h=c[p];if(t[h]){u=t[h];break}}return u=(0,s.cloneLayout)(u||[]),(0,s.compact)((0,s.correctBounds)(u,{cols:o}),a)}function i(t){var e=Object.keys(t);return e.sort(function(e,r){return t[e]-t[r]})}e.__esModule=!0,e.getBreakpointFromWidth=n,e.getColsFromBreakpoint=o,e.findOrGenerateResponsiveLayout=a,e.sortBreakpoints=i;var s=r(2)},function(t,e,r){!function(e,n){t.exports=n(r(1),r(8))}(this,function(t,e){return function(t){function e(n){if(r[n])return r[n].exports;var o=r[n]={exports:{},id:n,loaded:!1};return t[n].call(o.exports,o,o.exports,e),o.loaded=!0,o.exports}var r={};return e.m=t,e.c=r,e.p=\"\",e(0)}([function(t,e,r){\"use strict\";t.exports=r(1)[\"default\"],t.exports.DraggableCore=r(9)[\"default\"]},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}function a(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function i(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function s(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}Object.defineProperty(e,\"__esModule\",{value:!0});var u=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},l=function(){function t(t,e){var r=[],n=!0,o=!1,a=void 0;try{for(var i,s=t[Symbol.iterator]();!(n=(i=s.next()).done)&&(r.push(i.value),!e||r.length!==e);n=!0);}catch(u){o=!0,a=u}finally{try{!n&&s[\"return\"]&&s[\"return\"]()}finally{if(o)throw a}}return r}return function(e,r){if(Array.isArray(e))return e;if(Symbol.iterator in Object(e))return t(e,r);throw new TypeError(\"Invalid attempt to destructure non-iterable instance\")}}(),c=function(){function t(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,\"value\"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}return function(e,r,n){return r&&t(e.prototype,r),n&&t(e,n),e}}(),p=r(2),f=n(p),h=r(3),d=n(h),y=r(4),g=n(y),m=r(5),v=r(8),b=r(6),w=r(9),S=n(w),x=r(11),P=n(x),_=function(t){function e(t){a(this,e);var r=i(this,Object.getPrototypeOf(e).call(this,t));return r.onDragStart=function(t,e){(0,P[\"default\"])(\"Draggable: onDragStart: %j\",e);var n=r.props.onStart(t,(0,v.createDraggableData)(r,e));return n!==!1&&void r.setState({dragging:!0,dragged:!0})},r.onDrag=function(t,e){if(!r.state.dragging)return!1;(0,P[\"default\"])(\"Draggable: onDrag: %j\",e);var n=(0,v.createDraggableData)(r,e),o={x:n.x,y:n.y};if(r.props.bounds){var a=o.x,i=o.y;o.x+=r.state.slackX,o.y+=r.state.slackY;var s=(0,v.getBoundPosition)(r,o.x,o.y),u=l(s,2);o.x=u[0],o.y=u[1],o.slackX=r.state.slackX+(a-o.x),o.slackY=r.state.slackY+(i-o.y),n.x=a,n.y=i,n.deltaX=o.x-r.state.x,n.deltaY=o.y-r.state.y}var c=r.props.onDrag(t,n);return c!==!1&&void r.setState(o)},r.onDragStop=function(t,e){if(!r.state.dragging)return!1;var n=r.props.onStop(t,(0,v.createDraggableData)(r,e));if(n===!1)return!1;(0,P[\"default\"])(\"Draggable: onDragStop: %j\",e);var o={dragging:!1,slackX:0,slackY:0},a=Boolean(r.props.position);if(a){var i=r.props.position,s=i.x,u=i.y;o.x=s,o.y=u}r.setState(o)},r.state={dragging:!1,dragged:!1,x:t.position?t.position.x:t.defaultPosition.x,y:t.position?t.position.y:t.defaultPosition.y,slackX:0,slackY:0,isElementSVG:!1},r}return s(e,t),c(e,[{key:\"componentWillMount\",value:function(){!this.props.position||this.props.onDrag||this.props.onStop||console.warn(\"A `position` was applied to this <Draggable>, without drag handlers. This will make this component effectively undraggable. Please attach `onDrag` or `onStop` handlers so you can adjust the `position` of this element.\")}},{key:\"componentDidMount\",value:function(){\"undefined\"!=typeof SVGElement&&d[\"default\"].findDOMNode(this)instanceof SVGElement&&this.setState({isElementSVG:!0})}},{key:\"componentWillReceiveProps\",value:function(t){!t.position||this.props.position&&t.position.x===this.props.position.x&&t.position.y===this.props.position.y||this.setState({x:t.position.x,y:t.position.y})}},{key:\"componentWillUnmount\",value:function(){this.setState({dragging:!1})}},{key:\"render\",value:function(){var t,e={},r=null,n=Boolean(this.props.position),a=!n||this.state.dragging,i=this.props.position||this.props.defaultPosition,s={x:(0,v.canDragX)(this)&&a?this.state.x:i.x,y:(0,v.canDragY)(this)&&a?this.state.y:i.y};this.state.isElementSVG?r=(0,m.createSVGTransform)(s):e=(0,m.createCSSTransform)(s);var l=this.props,c=l.defaultClassName,p=l.defaultClassNameDragging,h=l.defaultClassNameDragged,d=(0,g[\"default\"])(this.props.children.props.className||\"\",c,(t={},o(t,p,this.state.dragging),o(t,h,this.state.dragged),t));return f[\"default\"].createElement(S[\"default\"],u({},this.props,{onStart:this.onDragStart,onDrag:this.onDrag,onStop:this.onDragStop}),f[\"default\"].cloneElement(f[\"default\"].Children.only(this.props.children),{className:d,style:u({},this.props.children.props.style,e),transform:r}))}}]),e}(f[\"default\"].Component);_.displayName=\"Draggable\",_.propTypes=u({},S[\"default\"].propTypes,{axis:p.PropTypes.oneOf([\"both\",\"x\",\"y\",\"none\"]),bounds:p.PropTypes.oneOfType([p.PropTypes.shape({left:p.PropTypes.number,right:p.PropTypes.number,top:p.PropTypes.number,bottom:p.PropTypes.number}),p.PropTypes.string,p.PropTypes.oneOf([!1])]),defaultClassName:p.PropTypes.string,defaultClassNameDragging:p.PropTypes.string,defaultClassNameDragged:p.PropTypes.string,defaultPosition:p.PropTypes.shape({x:p.PropTypes.number,y:p.PropTypes.number}),position:p.PropTypes.shape({x:p.PropTypes.number,y:p.PropTypes.number}),className:b.dontSetMe,style:b.dontSetMe,transform:b.dontSetMe}),_.defaultProps=u({},S[\"default\"].defaultProps,{axis:\"both\",bounds:!1,defaultClassName:\"react-draggable\",defaultClassNameDragging:\"react-draggable-dragging\",defaultClassNameDragged:\"react-draggable-dragged\",defaultPosition:{x:0,y:0},position:null}),e[\"default\"]=_},function(e,r){e.exports=t},function(t,r){t.exports=e},function(t,e,r){var n,o;/*!\n\t\t Copyright (c) 2016 Jed Watson.\n\t\t Licensed under the MIT License (MIT), see\n\t\t http://jedwatson.github.io/classnames\n\t\t*/\n!function(){\"use strict\";function r(){for(var t=[],e=0;e<arguments.length;e++){var n=arguments[e];if(n){var o=typeof n;if(\"string\"===o||\"number\"===o)t.push(n);else if(Array.isArray(n))t.push(r.apply(null,n));else if(\"object\"===o)for(var i in n)a.call(n,i)&&n[i]&&t.push(i)}}return t.join(\" \")}var a={}.hasOwnProperty;\"undefined\"!=typeof t&&t.exports?t.exports=r:(n=[],o=function(){return r}.apply(e,n),!(void 0!==o&&(t.exports=o)))}()},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}function a(t,e){return T||(T=(0,x.findInArray)([\"matches\",\"webkitMatchesSelector\",\"mozMatchesSelector\",\"msMatchesSelector\",\"oMatchesSelector\"],function(e){return(0,x.isFunction)(t[e])})),t[T].call(t,e)}function i(t,e,r){var n=t;do{if(a(n,e))return!0;if(n===r)return!1;n=n.parentNode}while(n);return!1}function s(t,e,r){t&&(t.attachEvent?t.attachEvent(\"on\"+e,r):t.addEventListener?t.addEventListener(e,r,!0):t[\"on\"+e]=r)}function u(t,e,r){t&&(t.detachEvent?t.detachEvent(\"on\"+e,r):t.removeEventListener?t.removeEventListener(e,r,!0):t[\"on\"+e]=null)}function l(t){var e=t.clientHeight,r=t.ownerDocument.defaultView.getComputedStyle(t);return e+=(0,x[\"int\"])(r.borderTopWidth),e+=(0,x[\"int\"])(r.borderBottomWidth)}function c(t){var e=t.clientWidth,r=t.ownerDocument.defaultView.getComputedStyle(t);return e+=(0,x[\"int\"])(r.borderLeftWidth),e+=(0,x[\"int\"])(r.borderRightWidth)}function p(t){var e=t.clientHeight,r=t.ownerDocument.defaultView.getComputedStyle(t);return e-=(0,x[\"int\"])(r.paddingTop),e-=(0,x[\"int\"])(r.paddingBottom)}function f(t){var e=t.clientWidth,r=t.ownerDocument.defaultView.getComputedStyle(t);return e-=(0,x[\"int\"])(r.paddingLeft),e-=(0,x[\"int\"])(r.paddingRight)}function h(t,e){var r=e===e.ownerDocument.body,n=r?{left:0,top:0}:e.getBoundingClientRect(),o=t.clientX+e.scrollLeft-n.left,a=t.clientY+e.scrollTop-n.top;return{x:o,y:a}}function d(t){var e=t.x,r=t.y;return o({},(0,P.browserPrefixToKey)(\"transform\",_[\"default\"]),\"translate(\"+e+\"px,\"+r+\"px)\")}function y(t){var e=t.x,r=t.y;return\"translate(\"+e+\",\"+r+\")\"}function g(t,e){return t.targetTouches&&(0,x.findInArray)(t.targetTouches,function(t){return e===t.identifier})||t.changedTouches&&(0,x.findInArray)(t.changedTouches,function(t){return e===t.identifier})}function m(t){return t.targetTouches&&t.targetTouches[0]?t.targetTouches[0].identifier:t.changedTouches&&t.changedTouches[0]?t.changedTouches[0].identifier:void 0}function v(t){var e=t.getAttribute(\"style\")||\"\";t.setAttribute(\"style\",e+O)}function b(t){var e=t.getAttribute(\"style\")||\"\";t.setAttribute(\"style\",e.replace(O,\"\"))}function w(){var t=arguments.length<=0||void 0===arguments[0]?{}:arguments[0];return S({touchAction:\"none\"},t)}Object.defineProperty(e,\"__esModule\",{value:!0});var S=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t};e.matchesSelector=a,e.matchesSelectorAndParentsTo=i,e.addEvent=s,e.removeEvent=u,e.outerHeight=l,e.outerWidth=c,e.innerHeight=p,e.innerWidth=f,e.offsetXYFromParent=h,e.createCSSTransform=d,e.createSVGTransform=y,e.getTouch=g,e.getTouchIdentifier=m,e.addUserSelectStyles=v,e.removeUserSelectStyles=b,e.styleHacks=w;var x=r(6),P=r(7),_=n(P),T=\"\",D=(0,P.getPrefix)(\"user-select\"),R=(0,P.browserPrefixToStyle)(\"user-select\",D),O=\";\"+R+\": none;\"},function(t,e){\"use strict\";function r(t,e){for(var r=0,n=t.length;r<n;r++)if(e.apply(e,[t[r],r,t]))return t[r]}function n(t){return\"function\"==typeof t||\"[object Function]\"===Object.prototype.toString.call(t)}function o(t){return\"number\"==typeof t&&!isNaN(t)}function a(t){return parseInt(t,10)}function i(t,e,r){if(t[e])return new Error(\"Invalid prop \"+e+\" passed to \"+r+\" - do not set this, set it on the child.\")}Object.defineProperty(e,\"__esModule\",{value:!0}),e.findInArray=r,e.isFunction=n,e.isNum=o,e[\"int\"]=a,e.dontSetMe=i},function(t,e){\"use strict\";function r(){var t=arguments.length<=0||void 0===arguments[0]?\"transform\":arguments[0];if(\"undefined\"==typeof window||\"undefined\"==typeof window.document)return\"\";var e=window.document.documentElement.style;if(t in e)return\"\";for(var r=0;r<i.length;r++)if(n(t,i[r])in e)return i[r];return\"\"}function n(t,e){return e?\"\"+e+a(t):t}function o(t,e){return e?\"-\"+e.toLowerCase()+\"-\"+t:t}function a(t){for(var e=\"\",r=!0,n=0;n<t.length;n++)r?(e+=t[n].toUpperCase(),r=!1):\"-\"===t[n]?r=!0:e+=t[n];return e}Object.defineProperty(e,\"__esModule\",{value:!0}),e.getPrefix=r,e.browserPrefixToKey=n,e.browserPrefixToStyle=o;var i=[\"Moz\",\"Webkit\",\"O\",\"ms\"];e[\"default\"]=r()},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e,r){if(!t.props.bounds)return[e,r];var n=t.props.bounds;n=\"string\"==typeof n?n:p(n);var o=d[\"default\"].findDOMNode(t);if(\"string\"==typeof n){var a=o.ownerDocument,i=a.defaultView,s=void 0;if(\"parent\"===n)s=o.parentNode;else if(s=a.querySelector(n),!s)throw new Error('Bounds selector \"'+n+'\" could not find an element.');var u=i.getComputedStyle(o),l=i.getComputedStyle(s);n={left:-o.offsetLeft+(0,f[\"int\"])(l.paddingLeft)+(0,f[\"int\"])(u.borderLeftWidth)+(0,f[\"int\"])(u.marginLeft),top:-o.offsetTop+(0,f[\"int\"])(l.paddingTop)+(0,f[\"int\"])(u.borderTopWidth)+(0,f[\"int\"])(u.marginTop),right:(0,y.innerWidth)(s)-(0,y.outerWidth)(o)-o.offsetLeft,bottom:(0,y.innerHeight)(s)-(0,y.outerHeight)(o)-o.offsetTop}}return(0,f.isNum)(n.right)&&(e=Math.min(e,n.right)),(0,f.isNum)(n.bottom)&&(r=Math.min(r,n.bottom)),(0,f.isNum)(n.left)&&(e=Math.max(e,n.left)),(0,f.isNum)(n.top)&&(r=Math.max(r,n.top)),[e,r]}function a(t,e,r){var n=Math.round(e/t[0])*t[0],o=Math.round(r/t[1])*t[1];return[n,o]}function i(t){return\"both\"===t.props.axis||\"x\"===t.props.axis}function s(t){return\"both\"===t.props.axis||\"y\"===t.props.axis}function u(t,e,r){var n=\"number\"==typeof e?(0,y.getTouch)(t,e):null;if(\"number\"==typeof e&&!n)return null;var o=d[\"default\"].findDOMNode(r),a=r.props.offsetParent||o.offsetParent||o.ownerDocument.body;return(0,y.offsetXYFromParent)(n||t,a)}function l(t,e,r){var n=t._pendingState||t.state,o=!(0,f.isNum)(n.lastX);return o?{node:d[\"default\"].findDOMNode(t),deltaX:0,deltaY:0,lastX:e,lastY:r,x:e,y:r}:{node:d[\"default\"].findDOMNode(t),deltaX:e-n.lastX,deltaY:r-n.lastY,lastX:n.lastX,lastY:n.lastY,x:e,y:r}}function c(t,e){return{node:e.node,x:t.state.x+e.deltaX,y:t.state.y+e.deltaY,deltaX:e.deltaX,deltaY:e.deltaY,lastX:t.state.x,lastY:t.state.y}}function p(t){return{left:t.left,top:t.top,right:t.right,bottom:t.bottom}}Object.defineProperty(e,\"__esModule\",{value:!0}),e.getBoundPosition=o,e.snapToGrid=a,e.canDragX=i,e.canDragY=s,e.getControlPosition=u,e.createCoreData=l,e.createDraggableData=c;var f=r(6),h=r(3),d=n(h),y=r(5)},function(t,e,r){(function(t){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function a(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function i(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}Object.defineProperty(e,\"__esModule\",{value:!0});var s=function(){function t(t,e){var r=[],n=!0,o=!1,a=void 0;try{for(var i,s=t[Symbol.iterator]();!(n=(i=s.next()).done)&&(r.push(i.value),!e||r.length!==e);n=!0);}catch(u){o=!0,a=u}finally{try{!n&&s[\"return\"]&&s[\"return\"]()}finally{if(o)throw a}}return r}return function(e,r){if(Array.isArray(e))return e;if(Symbol.iterator in Object(e))return t(e,r);throw new TypeError(\"Invalid attempt to destructure non-iterable instance\")}}(),u=function(){function t(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,\"value\"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}return function(e,r,n){return r&&t(e.prototype,r),n&&t(e,n),e}}(),l=r(2),c=n(l),p=r(3),f=n(p),h=r(5),d=r(8),y=r(6),g=r(11),m=n(g),v={touch:{start:\"touchstart\",move:\"touchmove\",stop:\"touchend\"},mouse:{start:\"mousedown\",move:\"mousemove\",stop:\"mouseup\"}},b=v.mouse,w=function(t){function e(){var t,r,n,i;o(this,e);for(var u=arguments.length,l=Array(u),c=0;c<u;c++)l[c]=arguments[c];return r=n=a(this,(t=Object.getPrototypeOf(e)).call.apply(t,[this].concat(l))),n.state={dragging:!1,lastX:NaN,lastY:NaN,touchIdentifier:null},n.handleDragStart=function(t){if(n.props.onMouseDown(t),!n.props.allowAnyClick&&\"number\"==typeof t.button&&0!==t.button)return!1;var e=f[\"default\"].findDOMNode(n),r=e.ownerDocument;if(!(n.props.disabled||!(t.target instanceof r.defaultView.Node)||n.props.handle&&!(0,h.matchesSelectorAndParentsTo)(t.target,n.props.handle,e)||n.props.cancel&&(0,h.matchesSelectorAndParentsTo)(t.target,n.props.cancel,e))){var o=(0,h.getTouchIdentifier)(t);n.setState({touchIdentifier:o});var a=(0,d.getControlPosition)(t,o,n);if(null!=a){var i=a.x,s=a.y,u=(0,d.createCoreData)(n,i,s);(0,m[\"default\"])(\"DraggableCore: handleDragStart: %j\",u),(0,m[\"default\"])(\"calling\",n.props.onStart);var l=n.props.onStart(t,u);l!==!1&&(n.props.enableUserSelectHack&&(0,h.addUserSelectStyles)(r.body),n.setState({dragging:!0,lastX:i,lastY:s}),(0,h.addEvent)(r,b.move,n.handleDrag),(0,h.addEvent)(r,b.stop,n.handleDragStop))}}},n.handleDrag=function(t){var e=(0,d.getControlPosition)(t,n.state.touchIdentifier,n);if(null!=e){var r=e.x,o=e.y;if(Array.isArray(n.props.grid)){var a=r-n.state.lastX,i=o-n.state.lastY,u=(0,d.snapToGrid)(n.props.grid,a,i),l=s(u,2);if(a=l[0],i=l[1],!a&&!i)return;r=n.state.lastX+a,o=n.state.lastY+i}var c=(0,d.createCoreData)(n,r,o);(0,m[\"default\"])(\"DraggableCore: handleDrag: %j\",c);var p=n.props.onDrag(t,c);if(p!==!1)n.setState({lastX:r,lastY:o});else try{n.handleDragStop(new MouseEvent(\"mouseup\"))}catch(f){var h=document.createEvent(\"MouseEvents\");h.initMouseEvent(\"mouseup\",!0,!0,window,0,0,0,0,0,!1,!1,!1,!1,0,null),n.handleDragStop(h)}}},n.handleDragStop=function(t){if(n.state.dragging){var e=(0,d.getControlPosition)(t,n.state.touchIdentifier,n);if(null!=e){var r=e.x,o=e.y,a=(0,d.createCoreData)(n,r,o),i=f[\"default\"].findDOMNode(n),s=i.ownerDocument;n.props.enableUserSelectHack&&(0,h.removeUserSelectStyles)(s.body),(0,m[\"default\"])(\"DraggableCore: handleDragStop: %j\",a),n.setState({dragging:!1,lastX:NaN,lastY:NaN}),n.props.onStop(t,a),(0,m[\"default\"])(\"DraggableCore: Removing handlers\"),(0,h.removeEvent)(s,b.move,n.handleDrag),(0,h.removeEvent)(s,b.stop,n.handleDragStop)}}},n.onMouseDown=function(t){return b=v.mouse,n.handleDragStart(t)},n.onMouseUp=function(t){return b=v.mouse,n.handleDragStop(t)},n.onTouchStart=function(t){return b=v.touch,n.handleDragStart(t)},n.onTouchEnd=function(t){return b=v.touch,n.handleDragStop(t)},i=r,a(n,i)}return i(e,t),u(e,[{key:\"componentWillUnmount\",value:function(){var t=f[\"default\"].findDOMNode(this),e=t.ownerDocument;(0,h.removeEvent)(e,v.mouse.move,this.handleDrag),(0,h.removeEvent)(e,v.touch.move,this.handleDrag),(0,h.removeEvent)(e,v.mouse.stop,this.handleDragStop),(0,h.removeEvent)(e,v.touch.stop,this.handleDragStop),this.props.enableUserSelectHack&&(0,h.removeUserSelectStyles)(e.body)}},{key:\"render\",value:function(){return c[\"default\"].cloneElement(c[\"default\"].Children.only(this.props.children),{style:(0,h.styleHacks)(this.props.children.props.style),onMouseDown:this.onMouseDown,onTouchStart:this.onTouchStart,onMouseUp:this.onMouseUp,onTouchEnd:this.onTouchEnd})}}]),e}(c[\"default\"].Component);w.displayName=\"DraggableCore\",w.propTypes={allowAnyClick:l.PropTypes.bool,disabled:l.PropTypes.bool,enableUserSelectHack:l.PropTypes.bool,offsetParent:function(e,r){if(t.browser&&e[r]&&1!==e[r].nodeType)throw new Error(\"Draggable's offsetParent must be a DOM Node.\")},grid:l.PropTypes.arrayOf(l.PropTypes.number),handle:l.PropTypes.string,cancel:l.PropTypes.string,onStart:l.PropTypes.func,onDrag:l.PropTypes.func,onStop:l.PropTypes.func,onMouseDown:l.PropTypes.func,className:y.dontSetMe,style:y.dontSetMe,transform:y.dontSetMe},w.defaultProps={allowAnyClick:!1,cancel:null,disabled:!1,enableUserSelectHack:!0,offsetParent:null,handle:null,grid:null,transform:null,onStart:function(){},onDrag:function(){},onStop:function(){},onMouseDown:function(){}},e[\"default\"]=w}).call(e,r(10))},function(t,e){function r(){p&&l&&(p=!1,l.length?c=l.concat(c):f=-1,c.length&&n())}function n(){if(!p){var t=i(r);p=!0;for(var e=c.length;e;){for(l=c,c=[];++f<e;)l&&l[f].run();f=-1,e=c.length}l=null,p=!1,s(t)}}function o(t,e){this.fun=t,this.array=e}function a(){}var i,s,u=t.exports={};!function(){try{i=setTimeout}catch(t){i=function(){throw new Error(\"setTimeout is not defined\")}}try{s=clearTimeout}catch(t){s=function(){throw new Error(\"clearTimeout is not defined\")}}}();var l,c=[],p=!1,f=-1;u.nextTick=function(t){var e=new Array(arguments.length-1);if(arguments.length>1)for(var r=1;r<arguments.length;r++)e[r-1]=arguments[r];c.push(new o(t,e)),1!==c.length||p||i(n,0)},o.prototype.run=function(){this.fun.apply(null,this.array)},u.title=\"browser\",u.browser=!0,u.env={},u.argv=[],u.version=\"\",u.versions={},u.on=a,u.addListener=a,u.once=a,u.off=a,u.removeListener=a,u.removeAllListeners=a,u.emit=a,u.binding=function(t){throw new Error(\"process.binding is not supported\")},u.cwd=function(){return\"/\"},u.chdir=function(t){throw new Error(\"process.chdir is not supported\")},u.umask=function(){return 0}},function(t,e,r){\"use strict\";function n(){}Object.defineProperty(e,\"__esModule\",{value:!0}),e[\"default\"]=n}])})},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){var r={};for(var n in t)e.indexOf(n)>=0||Object.prototype.hasOwnProperty.call(t,n)&&(r[n]=t[n]);return r}function a(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function i(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function s(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var u=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},l=r(1),c=n(l),p=r(6),f=r(13),h=n(f),d=function(t){function e(){var r,n,o;a(this,e);for(var s=arguments.length,u=Array(s),l=0;l<s;l++)u[l]=arguments[l];return r=n=i(this,t.call.apply(t,[this].concat(u))),n.state={resizing:!1,width:n.props.width,height:n.props.height,slackW:0,slackH:0},o=r,i(n,o)}return s(e,t),e.prototype.componentWillReceiveProps=function(t){this.state.resizing||t.width===this.props.width&&t.height===this.props.height||this.setState({width:t.width,height:t.height})},e.prototype.lockAspectRatio=function(t,e,r){return e=t/r,t=e*r,[t,e]},e.prototype.runConstraints=function(t,e){var r=this.props.minConstraints,n=this.props.maxConstraints;if(this.props.lockAspectRatio){var o=this.state.width/this.state.height;e=t/o,t=e*o}if(!r&&!n)return[t,e];var a=t,i=e,s=this.state,u=s.slackW,l=s.slackH;return t+=u,e+=l,r&&(t=Math.max(r[0],t),e=Math.max(r[1],e)),n&&(t=Math.min(n[0],t),e=Math.min(n[1],e)),u+=a-t,l+=i-e,u===this.state.slackW&&l===this.state.slackH||this.setState({slackW:u,slackH:l}),[t,e]},e.prototype.resizeHandler=function(t){var e=this;return function(r,n){var o=n.node,a=n.deltaX,i=n.deltaY,s=e.state.width+a,u=e.state.height+i,l=s!==e.state.width,c=u!==e.state.height;if(\"onResize\"!==t||l||c){var p=e.runConstraints(s,u);s=p[0],u=p[1];var f={};if(\"onResizeStart\"===t)f.resizing=!0;else if(\"onResizeStop\"===t)f.resizing=!1,f.slackW=f.slackH=0;else{if(s===e.state.width&&u===e.state.height)return;f.width=s,f.height=u}e.setState(f,function(){e.props[t]&&e.props[t](r,{node:o,size:{width:s,height:u}})})}}},e.prototype.render=function(){var t=this.props,e=t.children,r=t.draggableOpts,n=(t.width,t.height,t.handleSize,t.lockAspectRatio,t.minConstraints,t.maxConstraints,t.onResize,t.onResizeStop,t.onResizeStart,o(t,[\"children\",\"draggableOpts\",\"width\",\"height\",\"handleSize\",\"lockAspectRatio\",\"minConstraints\",\"maxConstraints\",\"onResize\",\"onResizeStop\",\"onResizeStart\"])),a=n.className?n.className+\" react-resizable\":\"react-resizable\";return(0,h[\"default\"])(e,u({},n,{className:a,children:[e.props.children,c[\"default\"].createElement(p.DraggableCore,u({},r,{key:\"resizableHandle\",ref:\"draggable\",onStop:this.resizeHandler(\"onResizeStop\"),onStart:this.resizeHandler(\"onResizeStart\"),onDrag:this.resizeHandler(\"onResize\")}),c[\"default\"].createElement(\"span\",{className:\"react-resizable-handle\"}))]}))},e}(c[\"default\"].Component);d.propTypes={children:l.PropTypes.element.isRequired,width:l.PropTypes.number.isRequired,height:l.PropTypes.number.isRequired,handleSize:l.PropTypes.array,lockAspectRatio:l.PropTypes.bool,minConstraints:l.PropTypes.arrayOf(l.PropTypes.number),maxConstraints:l.PropTypes.arrayOf(l.PropTypes.number),onResizeStop:l.PropTypes.func,onResizeStart:l.PropTypes.func,onResize:l.PropTypes.func,draggableOpts:l.PropTypes.object},d.defaultProps={handleSize:[20,20],lockAspectRatio:!1,minConstraints:[20,20],maxConstraints:[1/0,1/0]},e[\"default\"]=d},function(t,r){t.exports=e},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function a(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function i(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var s=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},u=r(1),l=n(u),c=r(6),p=r(14),f=r(2),h=function(t){function e(){var r,n,i;o(this,e);for(var s=arguments.length,u=Array(s),l=0;l<s;l++)u[l]=arguments[l];return r=n=a(this,t.call.apply(t,[this].concat(u))),n.state={resizing:null,dragging:null,className:\"\"},i=r,a(n,i)}return i(e,t),e.prototype.calcColWidth=function(){var t=this.props,e=t.margin,r=t.containerPadding,n=t.containerWidth,o=t.cols;return(n-e[0]*(o-1)-2*r[0])/o},e.prototype.calcPosition=function(t,e,r,n,o){var a=this.props,i=a.margin,s=a.containerPadding,u=a.rowHeight,l=this.calcColWidth(),c={left:Math.round((l+i[0])*t+s[0]),top:Math.round((u+i[1])*e+s[1]),width:r===1/0?r:Math.round(l*r+Math.max(0,r-1)*i[0]),height:n===1/0?n:Math.round(u*n+Math.max(0,n-1)*i[1])};return o&&o.resizing&&(c.width=Math.round(o.resizing.width),c.height=Math.round(o.resizing.height)),o&&o.dragging&&(c.top=Math.round(o.dragging.top),c.left=Math.round(o.dragging.left)),c},e.prototype.calcXY=function(t,e){var r=this.props,n=r.margin,o=r.cols,a=r.rowHeight,i=r.w,s=r.h,u=r.maxRows,l=this.calcColWidth(),c=Math.round((e-n[0])/(l+n[0])),p=Math.round((t-n[1])/(a+n[1]));return c=Math.max(Math.min(c,o-i),0),p=Math.max(Math.min(p,u-s),0),{x:c,y:p}},e.prototype.calcWH=function(t){var e=t.height,r=t.width,n=this.props,o=n.margin,a=n.maxRows,i=n.cols,s=n.rowHeight,u=n.x,l=n.y,c=this.calcColWidth(),p=Math.round((r+o[0])/(c+o[0])),f=Math.round((e+o[1])/(s+o[1]));return p=Math.max(Math.min(p,i-u),0),f=Math.max(Math.min(f,a-l),0),{w:p,h:f}},e.prototype.createStyle=function(t){var e=this.props,r=e.usePercentages,n=e.containerWidth,o=e.useCSSTransforms,a=void 0;return o?a=(0,f.setTransform)(t):(a=(0,f.setTopLeft)(t),r&&(a.left=(0,f.perc)(t.left/n),a.width=(0,f.perc)(t.width/n))),a},e.prototype.mixinDraggable=function(t){return l[\"default\"].createElement(c.DraggableCore,{onStart:this.onDragHandler(\"onDragStart\"),onDrag:this.onDragHandler(\"onDrag\"),onStop:this.onDragHandler(\"onDragStop\"),handle:this.props.handle,cancel:\".react-resizable-handle\"+(this.props.cancel?\",\"+this.props.cancel:\"\")},t)},e.prototype.mixinResizable=function(t,e){var r=this.props,n=r.cols,o=r.x,a=r.minW,i=r.minH,s=r.maxW,u=r.maxH,c=this.calcPosition(0,0,n-o,0).width,f=this.calcPosition(0,0,a,i),h=this.calcPosition(0,0,s,u),d=[f.width,f.height],y=[Math.min(h.width,c),Math.min(h.height,1/0)];return l[\"default\"].createElement(p.Resizable,{width:e.width,height:e.height,minConstraints:d,maxConstraints:y,onResizeStop:this.onResizeHandler(\"onResizeStop\"),onResizeStart:this.onResizeHandler(\"onResizeStart\"),onResize:this.onResizeHandler(\"onResize\")},t)},e.prototype.onDragHandler=function(t){var e=this;return function(r,n){var o=n.node,a=n.deltaX,i=n.deltaY;if(e.props[t]){var s={top:0,left:0};switch(t){case\"onDragStart\":var u=o.offsetParent.getBoundingClientRect(),l=o.getBoundingClientRect();s.left=l.left-u.left,s.top=l.top-u.top,e.setState({dragging:s});break;case\"onDrag\":if(!e.state.dragging)throw new Error(\"onDrag called before onDragStart.\");s.left=e.state.dragging.left+a,s.top=e.state.dragging.top+i,e.setState({dragging:s});break;case\"onDragStop\":if(!e.state.dragging)throw new Error(\"onDragEnd called before onDragStart.\");s.left=e.state.dragging.left,s.top=e.state.dragging.top,e.setState({dragging:null});break;default:throw new Error(\"onDragHandler called with unrecognized handlerName: \"+t)}var c=e.calcXY(s.top,s.left),p=c.x,f=c.y;e.props[t](e.props.i,p,f,{e:r,node:o,newPosition:s})}}},e.prototype.onResizeHandler=function(t){var e=this;return function(r,n){var o=n.node,a=n.size;if(e.props[t]){var i=e.props,s=i.cols,u=i.x,l=i.i,c=i.maxW,p=i.minW,f=i.maxH,h=i.minH,d=e.calcWH(a),y=d.w,g=d.h;y=Math.min(y,s-u),y=Math.max(y,1),y=Math.max(Math.min(y,c),p),g=Math.max(Math.min(g,f),h),e.setState({resizing:\"onResizeStop\"===t?null:a}),e.props[t](l,y,g,{e:r,node:o,size:a})}}},e.prototype.render=function(){var t=this.props,e=t.x,r=t.y,n=t.w,o=t.h,a=t.isDraggable,i=t.isResizable,u=t.useCSSTransforms,c=this.calcPosition(e,r,n,o,this.state),p=l[\"default\"].Children.only(this.props.children),f=l[\"default\"].cloneElement(p,{className:[\"react-grid-item\",p.props.className||\"\",this.props.className,this.props[\"static\"]?\"static\":\"\",this.state.resizing?\"resizing\":\"\",this.state.dragging?\"react-draggable-dragging\":\"\",u?\"cssTransforms\":\"\"].join(\" \"),style:s({},this.props.style,p.props.style,this.createStyle(c))});return i&&(f=this.mixinResizable(f,c)),a&&(f=this.mixinDraggable(f)),f},e}(l[\"default\"].Component);h.propTypes={children:u.PropTypes.element,cols:u.PropTypes.number.isRequired,containerWidth:u.PropTypes.number.isRequired,rowHeight:u.PropTypes.number.isRequired,margin:u.PropTypes.array.isRequired,maxRows:u.PropTypes.number.isRequired,containerPadding:u.PropTypes.array.isRequired,x:u.PropTypes.number.isRequired,y:u.PropTypes.number.isRequired,w:u.PropTypes.number.isRequired,h:u.PropTypes.number.isRequired,minW:function(t,e,r){var n=t[e];return\"number\"!=typeof n?new Error(\"minWidth not Number\"):n>t.w||n>t.maxW?new Error(\"minWidth larger than item width/maxWidth\"):void 0},maxW:function(t,e,r){var n=t[e];return\"number\"!=typeof n?new Error(\"maxWidth not Number\"):n<t.w||n<t.minW?new Error(\"maxWidth smaller than item width/minWidth\"):void 0},minH:function(t,e,r){var n=t[e];return\"number\"!=typeof n?new Error(\"minHeight not Number\"):n>t.h||n>t.maxH?new Error(\"minHeight larger than item height/maxHeight\"):void 0},maxH:function(t,e,r){var n=t[e];return\"number\"!=typeof n?new Error(\"maxHeight not Number\"):n<t.h||n<t.minH?new Error(\"maxHeight smaller than item height/minHeight\"):void 0},i:u.PropTypes.string.isRequired,onDragStop:u.PropTypes.func,onDragStart:u.PropTypes.func,onDrag:u.PropTypes.func,onResizeStop:u.PropTypes.func,onResizeStart:u.PropTypes.func,onResize:u.PropTypes.func,isDraggable:u.PropTypes.bool.isRequired,isResizable:u.PropTypes.bool.isRequired,\"static\":u.PropTypes.bool,useCSSTransforms:u.PropTypes.bool.isRequired,className:u.PropTypes.string,handle:u.PropTypes.string,cancel:u.PropTypes.string},h.defaultProps={className:\"\",cancel:\"\",minH:1,minW:1,maxH:1/0,maxW:1/0},e[\"default\"]=h},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){var r={};for(var n in t)e.indexOf(n)>=0||Object.prototype.hasOwnProperty.call(t,n)&&(r[n]=t[n]);return r}function a(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function i(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function s(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var u=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},l=r(1),c=n(l),p=r(3),f=n(p),h=r(2),d=r(5),y=r(4),g=n(y),m=function(){},v=function(t){return Object.prototype.toString.call(t)},b=function(t){function e(){var r,n,o;a(this,e);for(var s=arguments.length,l=Array(s),c=0;c<s;c++)l[c]=arguments[c];return r=n=i(this,t.call.apply(t,[this].concat(l))),n.state=n.generateInitialState(),n.onLayoutChange=function(t){var e;n.props.onLayoutChange(t,u({},n.props.layouts,(e={},e[n.state.breakpoint]=t,e)))},o=r,i(n,o)}return s(e,t),e.prototype.generateInitialState=function(){var t=this.props,e=t.width,r=t.breakpoints,n=t.layouts,o=t.verticalCompact,a=t.cols,i=(0,d.getBreakpointFromWidth)(r,e),s=(0,d.getColsFromBreakpoint)(i,a),u=(0,d.findOrGenerateResponsiveLayout)(n,r,i,i,s,o);return{layout:u,breakpoint:i,cols:s}},e.prototype.componentWillReceiveProps=function(t){if(t.width==this.props.width&&t.breakpoint===this.props.breakpoint&&(0,f[\"default\"])(t.breakpoints,this.props.breakpoints)&&(0,f[\"default\"])(t.cols,this.props.cols)){if(!(0,f[\"default\"])(t.layouts,this.props.layouts)){var e=this.state,r=e.breakpoint,n=e.cols,o=(0,d.findOrGenerateResponsiveLayout)(t.layouts,t.breakpoints,r,r,n,t.verticalCompact);this.setState({layout:o})}}else this.onWidthChange(t)},e.prototype.onWidthChange=function(t){var e=t.breakpoints,r=t.cols,n=t.verticalCompact,o=t.breakpoint||(0,d.getBreakpointFromWidth)(t.breakpoints,t.width),a=this.state.breakpoint;if(a!==o||this.props.breakpoints!==e||this.props.cols!==r){var i=t.layouts;a in i||(i[a]=(0,h.cloneLayout)(this.state.layout));var s=(0,d.getColsFromBreakpoint)(o,r),u=(0,d.findOrGenerateResponsiveLayout)(i,e,o,a,s,n);u=(0,h.synchronizeLayoutWithChildren)(u,t.children,s,n),i[o]=u,this.props.onLayoutChange(u,i),this.props.onBreakpointChange(o,s),this.props.onWidthChange(t.width,t.margin,s,t.containerPadding),this.setState({breakpoint:o,layout:u,cols:s})}},e.prototype.render=function(){var t=this.props,e=(t.breakpoint,t.breakpoints,t.cols,t.layouts,t.onBreakpointChange,t.onLayoutChange,t.onWidthChange,o(t,[\"breakpoint\",\"breakpoints\",\"cols\",\"layouts\",\"onBreakpointChange\",\"onLayoutChange\",\"onWidthChange\"]));return c[\"default\"].createElement(g[\"default\"],u({},e,{onLayoutChange:this.onLayoutChange,layout:this.state.layout,cols:this.state.cols}))},e}(c[\"default\"].Component);b.propTypes={breakpoint:c[\"default\"].PropTypes.string,breakpoints:c[\"default\"].PropTypes.object,cols:c[\"default\"].PropTypes.object,layouts:function(t,e){if(\"[object Object]\"!==v(t[e]))throw new Error(\"Layout property must be an object. Received: \"+v(t[e]));Object.keys(t[e]).forEach(function(e){if(!(e in t.breakpoints))throw new Error(\"Each key in layouts must align with a key in breakpoints.\");(0,h.validateLayout)(t.layouts[e],\"layouts.\"+e)})},width:c[\"default\"].PropTypes.number.isRequired,onBreakpointChange:c[\"default\"].PropTypes.func,onLayoutChange:c[\"default\"].PropTypes.func,onWidthChange:c[\"default\"].PropTypes.func},b.defaultProps={breakpoints:{lg:1200,md:996,sm:768,xs:480,xxs:0},cols:{lg:12,md:10,sm:6,xs:4,xxs:2},layouts:{},onBreakpointChange:m,onLayoutChange:m,onWidthChange:m},e[\"default\"]=b},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function a(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function i(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var s=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},u=r(1),l=n(u),c=r(8),p=n(c),f=function(t){var e,r;return r=e=function(e){function r(){var t,n,i;o(this,r);for(var s=arguments.length,u=Array(s),l=0;l<s;l++)u[l]=arguments[l];return t=n=a(this,e.call.apply(e,[this].concat(u))),n.state={width:1280},n.mounted=!1,n.onWindowResize=function(t){if(n.mounted){var e=p[\"default\"].findDOMNode(n);n.setState({width:e.offsetWidth})}},i=t,a(n,i)}return i(r,e),r.prototype.componentDidMount=function(){this.mounted=!0,window.addEventListener(\"resize\",this.onWindowResize),this.onWindowResize()},r.prototype.componentWillUnmount=function(){this.mounted=!1,window.removeEventListener(\"resize\",this.onWindowResize)},r.prototype.render=function(){return this.props.measureBeforeMount&&!this.mounted?l[\"default\"].createElement(\"div\",{className:this.props.className,style:this.props.style}):l[\"default\"].createElement(t,s({},this.props,this.state))},r}(l[\"default\"].Component),e.defaultProps={measureBeforeMount:!1},e.propTypes={measureBeforeMount:l[\"default\"].PropTypes.bool},r};e[\"default\"]=f},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}function o(t,e){var r={};for(var n in t)e.indexOf(n)>=0||Object.prototype.hasOwnProperty.call(t,n)&&(r[n]=t[n]);return r}function a(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")}function i(t,e){if(!t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return!e||\"object\"!=typeof e&&\"function\"!=typeof e?t:e}function s(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Super expression must either be null or a function, not \"+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}e.__esModule=!0;var u=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},l=r(1),c=n(l),p=r(7),f=n(p),h=function(t){function e(){var r,n,o;a(this,e);for(var s=arguments.length,u=Array(s),l=0;l<s;l++)u[l]=arguments[l];return r=n=i(this,t.call.apply(t,[this].concat(u))),n.state={width:n.props.width,height:n.props.height},n.onResize=function(t,e){var r=e.element,o=e.size;o.width,o.height;n.setState(o,function(){n.props.onResize&&n.props.onResize(t,{element:r,size:o})})},o=r,i(n,o)}return s(e,t),e.prototype.render=function(){var t=this.props,e=t.handleSize,r=t.onResizeStart,n=t.onResizeStop,a=t.draggableOpts,i=t.minConstraints,s=t.maxConstraints,l=t.lockAspectRatio,p=(t.width,t.height,o(t,[\"handleSize\",\"onResizeStart\",\"onResizeStop\",\"draggableOpts\",\"minConstraints\",\"maxConstraints\",\"lockAspectRatio\",\"width\",\"height\"]));\nreturn c[\"default\"].createElement(f[\"default\"],{handleSize:e,width:this.state.width,height:this.state.height,onResizeStart:r,onResize:this.onResize,onResizeStop:n,draggableOpts:a,minConstraints:i,maxConstraints:s,lockAspectRatio:l},c[\"default\"].createElement(\"div\",u({style:{width:this.state.width+\"px\",height:this.state.height+\"px\"}},p)))},e}(c[\"default\"].Component);h.propTypes={height:l.PropTypes.number,width:l.PropTypes.number},h.defaultProps={handleSize:[20,20]},e[\"default\"]=h},function(t,e,r){\"use strict\";function n(t){return t&&t.__esModule?t:{\"default\":t}}var o=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},a=r(1),i=n(a);t.exports=function(t,e){return e.style&&t.props.style&&(e.style=o({},t.props.style,e.style)),e.className&&t.props.className&&(e.className=t.props.className+\" \"+e.className),i[\"default\"].cloneElement(t,e)}},function(t,e,r){\"use strict\";t.exports=function(){throw new Error(\"Don't instantiate Resizable directly! Use require('react-resizable').Resizable\")},t.exports.Resizable=r(7)[\"default\"],t.exports.ResizableBox=r(12)[\"default\"]},function(t,e){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children=[],t.webpackPolyfill=1),t}}])});\n//# sourceMappingURL=react-grid-layout.min.js.map"}}},{"rowIdx":789377,"cells":{"path":{"kind":"string","value":"ajax/libs/forerunnerdb/1.3.716/fdb-core+persist.js"},"repo_name":{"kind":"string","value":"keicheng/cdnjs"},"content":{"kind":"string","value":"(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){\nvar Core = _dereq_('./core'),\n\tPersist = _dereq_('../lib/Persist');\n\nif (typeof window !== 'undefined') {\n\twindow.ForerunnerDB = Core;\n}\nmodule.exports = Core;\n},{\"../lib/Persist\":28,\"./core\":2}],2:[function(_dereq_,module,exports){\nvar Core = _dereq_('../lib/Core'),\n\tShimIE8 = _dereq_('../lib/Shim.IE8');\n\nif (typeof window !== 'undefined') {\n\twindow.ForerunnerDB = Core;\n}\nmodule.exports = Core;\n},{\"../lib/Core\":7,\"../lib/Shim.IE8\":34}],3:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tPath = _dereq_('./Path'),\n\tsharedPathSolver = new Path();\n\nvar BinaryTree = function (data, compareFunc, hashFunc) {\n\tthis.init.apply(this, arguments);\n};\n\nBinaryTree.prototype.init = function (data, index, primaryKey, compareFunc, hashFunc) {\n\tthis._store = [];\n\tthis._keys = [];\n\n\tif (primaryKey !== undefined) { this.primaryKey(primaryKey); }\n\tif (index !== undefined) { this.index(index); }\n\tif (compareFunc !== undefined) { this.compareFunc(compareFunc); }\n\tif (hashFunc !== undefined) { this.hashFunc(hashFunc); }\n\tif (data !== undefined) { this.data(data); }\n};\n\nShared.addModule('BinaryTree', BinaryTree);\nShared.mixin(BinaryTree.prototype, 'Mixin.ChainReactor');\nShared.mixin(BinaryTree.prototype, 'Mixin.Sorting');\nShared.mixin(BinaryTree.prototype, 'Mixin.Common');\n\nShared.synthesize(BinaryTree.prototype, 'compareFunc');\nShared.synthesize(BinaryTree.prototype, 'hashFunc');\nShared.synthesize(BinaryTree.prototype, 'indexDir');\nShared.synthesize(BinaryTree.prototype, 'primaryKey');\nShared.synthesize(BinaryTree.prototype, 'keys');\nShared.synthesize(BinaryTree.prototype, 'index', function (index) {\n\tif (index !== undefined) {\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Setting index', index, sharedPathSolver.parse(index, true));\n\t\t}\n\n\t\t// Convert the index object to an array of key val objects\n\t\tthis.keys(sharedPathSolver.parse(index, true));\n\t}\n\n\treturn this.$super.call(this, index);\n});\n\n/**\n * Remove all data from the binary tree.\n */\nBinaryTree.prototype.clear = function () {\n\tdelete this._data;\n\tdelete this._left;\n\tdelete this._right;\n\n\tthis._store = [];\n};\n\n/**\n * Sets this node's data object. All further inserted documents that\n * match this node's key and value will be pushed via the push()\n * method into the this._store array. When deciding if a new data\n * should be created left, right or middle (pushed) of this node the\n * new data is checked against the data set via this method.\n * @param val\n * @returns {*}\n */\nBinaryTree.prototype.data = function (val) {\n\tif (val !== undefined) {\n\t\tthis._data = val;\n\n\t\tif (this._hashFunc) { this._hash = this._hashFunc(val); }\n\t\treturn this;\n\t}\n\n\treturn this._data;\n};\n\n/**\n * Pushes an item to the binary tree node's store array.\n * @param {*} val The item to add to the store.\n * @returns {*}\n */\nBinaryTree.prototype.push = function (val) {\n\tif (val !== undefined) {\n\t\tthis._store.push(val);\n\t\treturn this;\n\t}\n\n\treturn false;\n};\n\n/**\n * Pulls an item from the binary tree node's store array.\n * @param {*} val The item to remove from the store.\n * @returns {*}\n */\nBinaryTree.prototype.pull = function (val) {\n\tif (val !== undefined) {\n\t\tvar index = this._store.indexOf(val);\n\n\t\tif (index > -1) {\n\t\t\tthis._store.splice(index, 1);\n\t\t\treturn this;\n\t\t}\n\t}\n\n\treturn false;\n};\n\n/**\n * Default compare method. Can be overridden.\n * @param a\n * @param b\n * @returns {number}\n * @private\n */\nBinaryTree.prototype._compareFunc = function (a, b) {\n\t// Loop the index array\n\tvar i,\n\t\tindexData,\n\t\tresult = 0;\n\n\tfor (i = 0; i < this._keys.length; i++) {\n\t\tindexData = this._keys[i];\n\n\t\tif (indexData.value === 1) {\n\t\t\tresult = this.sortAsc(sharedPathSolver.get(a, indexData.path), sharedPathSolver.get(b, indexData.path));\n\t\t} else if (indexData.value === -1) {\n\t\t\tresult = this.sortDesc(sharedPathSolver.get(a, indexData.path), sharedPathSolver.get(b, indexData.path));\n\t\t}\n\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Compared %s with %s order %d in path %s and result was %d', sharedPathSolver.get(a, indexData.path), sharedPathSolver.get(b, indexData.path), indexData.value, indexData.path, result);\n\t\t}\n\n\t\tif (result !== 0) {\n\t\t\tif (this.debug()) {\n\t\t\t\tconsole.log('Retuning result %d', result);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\n\tif (this.debug()) {\n\t\tconsole.log('Retuning result %d', result);\n\t}\n\n\treturn result;\n};\n\n/**\n * Default hash function. Can be overridden.\n * @param obj\n * @private\n */\nBinaryTree.prototype._hashFunc = function (obj) {\n\t/*var i,\n\t\tindexData,\n\t\thash = '';\n\n\tfor (i = 0; i < this._keys.length; i++) {\n\t\tindexData = this._keys[i];\n\n\t\tif (hash) { hash += '_'; }\n\t\thash += obj[indexData.path];\n\t}\n\n\treturn hash;*/\n\n\treturn obj[this._keys[0].path];\n};\n\n/**\n * Removes (deletes reference to) either left or right child if the passed\n * node matches one of them.\n * @param {BinaryTree} node The node to remove.\n */\nBinaryTree.prototype.removeChildNode = function (node) {\n\tif (this._left === node) {\n\t\t// Remove left\n\t\tdelete this._left;\n\t} else if (this._right === node) {\n\t\t// Remove right\n\t\tdelete this._right;\n\t}\n};\n\n/**\n * Returns the branch this node matches (left or right).\n * @param node\n * @returns {String}\n */\nBinaryTree.prototype.nodeBranch = function (node) {\n\tif (this._left === node) {\n\t\treturn 'left';\n\t} else if (this._right === node) {\n\t\treturn 'right';\n\t}\n};\n\n/**\n * Inserts a document into the binary tree.\n * @param data\n * @returns {*}\n */\nBinaryTree.prototype.insert = function (data) {\n\tvar result,\n\t\tinserted,\n\t\tfailed,\n\t\ti;\n\n\tif (data instanceof Array) {\n\t\t// Insert array of data\n\t\tinserted = [];\n\t\tfailed = [];\n\n\t\tfor (i = 0; i < data.length; i++) {\n\t\t\tif (this.insert(data[i])) {\n\t\t\t\tinserted.push(data[i]);\n\t\t\t} else {\n\t\t\t\tfailed.push(data[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn {\n\t\t\tinserted: inserted,\n\t\t\tfailed: failed\n\t\t};\n\t}\n\n\tif (this.debug()) {\n\t\tconsole.log('Inserting', data);\n\t}\n\n\tif (!this._data) {\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Node has no data, setting data', data);\n\t\t}\n\t\t// Insert into this node (overwrite) as there is no data\n\t\tthis.data(data);\n\t\t//this.push(data);\n\t\treturn true;\n\t}\n\n\tresult = this._compareFunc(this._data, data);\n\n\tif (result === 0) {\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Data is equal (currrent, new)', this._data, data);\n\t\t}\n\n\t\t//this.push(data);\n\n\t\t// Less than this node\n\t\tif (this._left) {\n\t\t\t// Propagate down the left branch\n\t\t\tthis._left.insert(data);\n\t\t} else {\n\t\t\t// Assign to left branch\n\t\t\tthis._left = new BinaryTree(data, this._index, this._binaryTree, this._compareFunc, this._hashFunc);\n\t\t\tthis._left._parent = this;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tif (result === -1) {\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Data is greater (currrent, new)', this._data, data);\n\t\t}\n\n\t\t// Greater than this node\n\t\tif (this._right) {\n\t\t\t// Propagate down the right branch\n\t\t\tthis._right.insert(data);\n\t\t} else {\n\t\t\t// Assign to right branch\n\t\t\tthis._right = new BinaryTree(data, this._index, this._binaryTree, this._compareFunc, this._hashFunc);\n\t\t\tthis._right._parent = this;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tif (result === 1) {\n\t\tif (this.debug()) {\n\t\t\tconsole.log('Data is less (currrent, new)', this._data, data);\n\t\t}\n\n\t\t// Less than this node\n\t\tif (this._left) {\n\t\t\t// Propagate down the left branch\n\t\t\tthis._left.insert(data);\n\t\t} else {\n\t\t\t// Assign to left branch\n\t\t\tthis._left = new BinaryTree(data, this._index, this._binaryTree, this._compareFunc, this._hashFunc);\n\t\t\tthis._left._parent = this;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nBinaryTree.prototype.remove = function (data) {\n\tvar pk = this.primaryKey(),\n\t\tresult,\n\t\tremoved,\n\t\ti;\n\n\tif (data instanceof Array) {\n\t\t// Insert array of data\n\t\tremoved = [];\n\n\t\tfor (i = 0; i < data.length; i++) {\n\t\t\tif (this.remove(data[i])) {\n\t\t\t\tremoved.push(data[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn removed;\n\t}\n\n\tif (this.debug()) {\n\t\tconsole.log('Removing', data);\n\t}\n\n\tif (this._data[pk] === data[pk]) {\n\t\t// Remove this node\n\t\treturn this._remove(this);\n\t}\n\n\t// Compare the data to work out which branch to send the remove command down\n\tresult = this._compareFunc(this._data, data);\n\n\tif (result === -1 && this._right) {\n\t\treturn this._right.remove(data);\n\t}\n\n\tif (result === 1 && this._left) {\n\t\treturn this._left.remove(data);\n\t}\n\n\treturn false;\n};\n\nBinaryTree.prototype._remove = function (node) {\n\tvar leftNode,\n\t\trightNode;\n\n\tif (this._left) {\n\t\t// Backup branch data\n\t\tleftNode = this._left;\n\t\trightNode = this._right;\n\n\t\t// Copy data from left node\n\t\tthis._left = leftNode._left;\n\t\tthis._right = leftNode._right;\n\t\tthis._data = leftNode._data;\n\t\tthis._store = leftNode._store;\n\n\t\tif (rightNode) {\n\t\t\t// Attach the rightNode data to the right-most node\n\t\t\t// of the leftNode\n\t\t\tleftNode.rightMost()._right = rightNode;\n\t\t}\n\t} else if (this._right) {\n\t\t// Backup branch data\n\t\trightNode = this._right;\n\n\t\t// Copy data from right node\n\t\tthis._left = rightNode._left;\n\t\tthis._right = rightNode._right;\n\t\tthis._data = rightNode._data;\n\t\tthis._store = rightNode._store;\n\t} else {\n\t\tthis.clear();\n\t}\n\n\treturn true;\n};\n\nBinaryTree.prototype.leftMost = function () {\n\tif (!this._left) {\n\t\treturn this;\n\t} else {\n\t\treturn this._left.leftMost();\n\t}\n};\n\nBinaryTree.prototype.rightMost = function () {\n\tif (!this._right) {\n\t\treturn this;\n\t} else {\n\t\treturn this._right.rightMost();\n\t}\n};\n\n/**\n * Searches the binary tree for all matching documents based on the data\n * passed (query).\n * @param data\n * @param options\n * @param {Array=} resultArr The results passed between recursive calls.\n * Do not pass anything into this argument when calling externally.\n * @returns {*|Array}\n */\nBinaryTree.prototype.lookup = function (data, options, resultArr) {\n\tvar result = this._compareFunc(this._data, data);\n\n\tresultArr = resultArr || [];\n\n\tif (result === 0) {\n\t\tif (this._left) { this._left.lookup(data, options, resultArr); }\n\t\tresultArr.push(this._data);\n\t\tif (this._right) { this._right.lookup(data, options, resultArr); }\n\t}\n\n\tif (result === -1) {\n\t\tif (this._right) { this._right.lookup(data, options, resultArr); }\n\t}\n\n\tif (result === 1) {\n\t\tif (this._left) { this._left.lookup(data, options, resultArr); }\n\t}\n\n\treturn resultArr;\n};\n\n/**\n * Returns the entire binary tree ordered.\n * @param {String} type\n * @param resultArr\n * @returns {*|Array}\n */\nBinaryTree.prototype.inOrder = function (type, resultArr) {\n\tresultArr = resultArr || [];\n\n\tif (this._left) {\n\t\tthis._left.inOrder(type, resultArr);\n\t}\n\n\tswitch (type) {\n\t\tcase 'hash':\n\t\t\tresultArr.push(this._hash);\n\t\t\tbreak;\n\n\t\tcase 'data':\n\t\t\tresultArr.push(this._data);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tresultArr.push({\n\t\t\t\tkey: this._data,\n\t\t\t\tarr: this._store\n\t\t\t});\n\t\t\tbreak;\n\t}\n\n\tif (this._right) {\n\t\tthis._right.inOrder(type, resultArr);\n\t}\n\n\treturn resultArr;\n};\n\n/**\n * Searches the binary tree for all matching documents based on the regular\n * expression passed.\n * @param path\n * @param val\n * @param regex\n * @param {Array=} resultArr The results passed between recursive calls.\n * Do not pass anything into this argument when calling externally.\n * @returns {*|Array}\n */\nBinaryTree.prototype.startsWith = function (path, val, regex, resultArr) {\n\tvar reTest,\n\t\tthisDataPathVal = sharedPathSolver.get(this._data, path),\n\t\tthisDataPathValSubStr = thisDataPathVal.substr(0, val.length),\n\t\tresult;\n\n\tregex = regex || new RegExp('^' + val);\n\tresultArr = resultArr || [];\n\n\tif (resultArr._visited === undefined) { resultArr._visited = 0; }\n\tresultArr._visited++;\n\n\tresult = this.sortAsc(thisDataPathVal, val);\n\treTest = thisDataPathValSubStr === val;\n\n\tif (result === 0) {\n\t\tif (this._left) { this._left.startsWith(path, val, regex, resultArr); }\n\t\tif (reTest) { resultArr.push(this._data); }\n\t\tif (this._right) { this._right.startsWith(path, val, regex, resultArr); }\n\t}\n\n\tif (result === -1) {\n\t\tif (reTest) { resultArr.push(this._data); }\n\t\tif (this._right) { this._right.startsWith(path, val, regex, resultArr); }\n\t}\n\n\tif (result === 1) {\n\t\tif (this._left) { this._left.startsWith(path, val, regex, resultArr); }\n\t\tif (reTest) { resultArr.push(this._data); }\n\t}\n\n\treturn resultArr;\n};\n\n/*BinaryTree.prototype.find = function (type, search, resultArr) {\n\tresultArr = resultArr || [];\n\n\tif (this._left) {\n\t\tthis._left.find(type, search, resultArr);\n\t}\n\n\t// Check if this node's data is greater or less than the from value\n\tvar fromResult = this.sortAsc(this._data[key], from),\n\t\t\ttoResult = this.sortAsc(this._data[key], to);\n\n\tif ((fromResult === 0 || fromResult === 1) && (toResult === 0 || toResult === -1)) {\n\t\t// This data node is greater than or equal to the from value,\n\t\t// and less than or equal to the to value so include it\n\t\tswitch (type) {\n\t\t\tcase 'hash':\n\t\t\t\tresultArr.push(this._hash);\n\t\t\t\tbreak;\n\n\t\t\tcase 'data':\n\t\t\t\tresultArr.push(this._data);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tresultArr.push({\n\t\t\t\t\tkey: this._data,\n\t\t\t\t\tarr: this._store\n\t\t\t\t});\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (this._right) {\n\t\tthis._right.find(type, search, resultArr);\n\t}\n\n\treturn resultArr;\n};*/\n\n/**\n *\n * @param {String} type\n * @param {String} key The data key / path to range search against.\n * @param {Number} from Range search from this value (inclusive)\n * @param {Number} to Range search to this value (inclusive)\n * @param {Array=} resultArr Leave undefined when calling (internal use),\n * passes the result array between recursive calls to be returned when\n * the recursion chain completes.\n * @param {Path=} pathResolver Leave undefined when calling (internal use),\n * caches the path resolver instance for performance.\n * @returns {Array} Array of matching document objects\n */\nBinaryTree.prototype.findRange = function (type, key, from, to, resultArr, pathResolver) {\n\tresultArr = resultArr || [];\n\tpathResolver = pathResolver || new Path(key);\n\n\tif (this._left) {\n\t\tthis._left.findRange(type, key, from, to, resultArr, pathResolver);\n\t}\n\n\t// Check if this node's data is greater or less than the from value\n\tvar pathVal = pathResolver.value(this._data),\n\t\tfromResult = this.sortAsc(pathVal, from),\n\t\ttoResult = this.sortAsc(pathVal, to);\n\n\tif ((fromResult === 0 || fromResult === 1) && (toResult === 0 || toResult === -1)) {\n\t\t// This data node is greater than or equal to the from value,\n\t\t// and less than or equal to the to value so include it\n\t\tswitch (type) {\n\t\t\tcase 'hash':\n\t\t\t\tresultArr.push(this._hash);\n\t\t\t\tbreak;\n\n\t\t\tcase 'data':\n\t\t\t\tresultArr.push(this._data);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tresultArr.push({\n\t\t\t\t\tkey: this._data,\n\t\t\t\t\tarr: this._store\n\t\t\t\t});\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (this._right) {\n\t\tthis._right.findRange(type, key, from, to, resultArr, pathResolver);\n\t}\n\n\treturn resultArr;\n};\n\n/*BinaryTree.prototype.findRegExp = function (type, key, pattern, resultArr) {\n\tresultArr = resultArr || [];\n\n\tif (this._left) {\n\t\tthis._left.findRegExp(type, key, pattern, resultArr);\n\t}\n\n\t// Check if this node's data is greater or less than the from value\n\tvar fromResult = this.sortAsc(this._data[key], from),\n\t\t\ttoResult = this.sortAsc(this._data[key], to);\n\n\tif ((fromResult === 0 || fromResult === 1) && (toResult === 0 || toResult === -1)) {\n\t\t// This data node is greater than or equal to the from value,\n\t\t// and less than or equal to the to value so include it\n\t\tswitch (type) {\n\t\t\tcase 'hash':\n\t\t\t\tresultArr.push(this._hash);\n\t\t\t\tbreak;\n\n\t\t\tcase 'data':\n\t\t\t\tresultArr.push(this._data);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tresultArr.push({\n\t\t\t\t\tkey: this._data,\n\t\t\t\t\tarr: this._store\n\t\t\t\t});\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (this._right) {\n\t\tthis._right.findRegExp(type, key, pattern, resultArr);\n\t}\n\n\treturn resultArr;\n};*/\n\n/**\n * Determines if the passed query and options object will be served\n * by this index successfully or not and gives a score so that the\n * DB search system can determine how useful this index is in comparison\n * to other indexes on the same collection.\n * @param query\n * @param queryOptions\n * @param matchOptions\n * @returns {{matchedKeys: Array, totalKeyCount: Number, score: number}}\n */\nBinaryTree.prototype.match = function (query, queryOptions, matchOptions) {\n\t// Check if the passed query has data in the keys our index\n\t// operates on and if so, is the query sort matching our order\n\tvar indexKeyArr,\n\t\tqueryArr,\n\t\tmatchedKeys = [],\n\t\tmatchedKeyCount = 0,\n\t\ti;\n\n\tindexKeyArr = sharedPathSolver.parseArr(this._index, {\n\t\tverbose: true\n\t});\n\n\tqueryArr = sharedPathSolver.parseArr(query, matchOptions && matchOptions.pathOptions ? matchOptions.pathOptions : {\n\t\tignore:/\\$/,\n\t\tverbose: true\n\t});\n\n\t// Loop the query array and check the order of keys against the\n\t// index key array to see if this index can be used\n\tfor (i = 0; i < indexKeyArr.length; i++) {\n\t\tif (queryArr[i] === indexKeyArr[i]) {\n\t\t\tmatchedKeyCount++;\n\t\t\tmatchedKeys.push(queryArr[i]);\n\t\t}\n\t}\n\n\treturn {\n\t\tmatchedKeys: matchedKeys,\n\t\ttotalKeyCount: queryArr.length,\n\t\tscore: matchedKeyCount\n\t};\n\n\t//return sharedPathSolver.countObjectPaths(this._keys, query);\n};\n\nShared.finishModule('BinaryTree');\nmodule.exports = BinaryTree;\n},{\"./Path\":27,\"./Shared\":33}],4:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar crcTable,\n\tchecksum;\n\ncrcTable = (function () {\n\tvar crcTable = [],\n\t\tc, n, k;\n\n\tfor (n = 0; n < 256; n++) {\n\t\tc = n;\n\n\t\tfor (k = 0; k < 8; k++) {\n\t\t\tc = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); // jshint ignore:line\n\t\t}\n\n\t\tcrcTable[n] = c;\n\t}\n\n\treturn crcTable;\n}());\n\n/**\n * Returns a checksum of a string.\n * @param {String} str The string to checksum.\n * @return {Number} The checksum generated.\n */\nchecksum = function(str) {\n\tvar crc = 0 ^ (-1), // jshint ignore:line\n\t\ti;\n\n\tfor (i = 0; i < str.length; i++) {\n\t\tcrc = (crc >>> 8) ^ crcTable[(crc ^ str.charCodeAt(i)) & 0xFF]; // jshint ignore:line\n\t}\n\n\treturn (crc ^ (-1)) >>> 0; // jshint ignore:line\n};\n\nmodule.exports = checksum;\n},{}],5:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared,\n\tDb,\n\tMetrics,\n\tKeyValueStore,\n\tPath,\n\tIndexHashMap,\n\tIndexBinaryTree,\n\tIndex2d,\n\tOverload,\n\tReactorIO,\n\tsharedPathSolver;\n\nShared = _dereq_('./Shared');\n\n/**\n * Creates a new collection. Collections store multiple documents and\n * handle CRUD against those documents.\n * @constructor\n */\nvar Collection = function (name, options) {\n\tthis.init.apply(this, arguments);\n};\n\nCollection.prototype.init = function (name, options) {\n\tthis.sharedPathSolver = sharedPathSolver;\n\tthis._primaryKey = '_id';\n\tthis._primaryIndex = new KeyValueStore('primary');\n\tthis._primaryCrc = new KeyValueStore('primaryCrc');\n\tthis._crcLookup = new KeyValueStore('crcLookup');\n\tthis._name = name;\n\tthis._data = [];\n\tthis._metrics = new Metrics();\n\n\tthis._options = options || {\n\t\tchangeTimestamp: false\n\t};\n\n\tif (this._options.db) {\n\t\tthis.db(this._options.db);\n\t}\n\n\t// Create an object to store internal protected data\n\tthis._metaData = {};\n\n\tthis._deferQueue = {\n\t\tinsert: [],\n\t\tupdate: [],\n\t\tremove: [],\n\t\tupsert: [],\n\t\tasync: []\n\t};\n\n\tthis._deferThreshold = {\n\t\tinsert: 100,\n\t\tupdate: 100,\n\t\tremove: 100,\n\t\tupsert: 100\n\t};\n\n\tthis._deferTime = {\n\t\tinsert: 1,\n\t\tupdate: 1,\n\t\tremove: 1,\n\t\tupsert: 1\n\t};\n\n\tthis._deferredCalls = true;\n\n\t// Set the subset to itself since it is the root collection\n\tthis.subsetOf(this);\n};\n\nShared.addModule('Collection', Collection);\nShared.mixin(Collection.prototype, 'Mixin.Common');\nShared.mixin(Collection.prototype, 'Mixin.Events');\nShared.mixin(Collection.prototype, 'Mixin.ChainReactor');\nShared.mixin(Collection.prototype, 'Mixin.CRUD');\nShared.mixin(Collection.prototype, 'Mixin.Constants');\nShared.mixin(Collection.prototype, 'Mixin.Triggers');\nShared.mixin(Collection.prototype, 'Mixin.Sorting');\nShared.mixin(Collection.prototype, 'Mixin.Matching');\nShared.mixin(Collection.prototype, 'Mixin.Updating');\nShared.mixin(Collection.prototype, 'Mixin.Tags');\n\nMetrics = _dereq_('./Metrics');\nKeyValueStore = _dereq_('./KeyValueStore');\nPath = _dereq_('./Path');\nIndexHashMap = _dereq_('./IndexHashMap');\nIndexBinaryTree = _dereq_('./IndexBinaryTree');\nIndex2d = _dereq_('./Index2d');\nDb = Shared.modules.Db;\nOverload = _dereq_('./Overload');\nReactorIO = _dereq_('./ReactorIO');\nsharedPathSolver = new Path();\n\n/**\n * Gets / sets the deferred calls flag. If set to true (default)\n * then operations on large data sets can be broken up and done\n * over multiple CPU cycles (creating an async state). For purely\n * synchronous behaviour set this to false.\n * @param {Boolean=} val The value to set.\n * @returns {Boolean}\n */\nShared.synthesize(Collection.prototype, 'deferredCalls');\n\n/**\n * Gets / sets the current state.\n * @param {String=} val The name of the state to set.\n * @returns {*}\n */\nShared.synthesize(Collection.prototype, 'state');\n\n/**\n * Gets / sets the name of the collection.\n * @param {String=} val The name of the collection to set.\n * @returns {*}\n */\nShared.synthesize(Collection.prototype, 'name');\n\n/**\n * Gets / sets the metadata stored in the collection.\n */\nShared.synthesize(Collection.prototype, 'metaData');\n\n/**\n * Gets / sets boolean to determine if the collection should be\n * capped or not.\n */\nShared.synthesize(Collection.prototype, 'capped');\n\n/**\n * Gets / sets capped collection size. This is the maximum number\n * of records that the capped collection will store.\n */\nShared.synthesize(Collection.prototype, 'cappedSize');\n\nCollection.prototype._asyncPending = function (key) {\n\tthis._deferQueue.async.push(key);\n};\n\nCollection.prototype._asyncComplete = function (key) {\n\t// Remove async flag for this type\n\tvar index = this._deferQueue.async.indexOf(key);\n\n\twhile (index > -1) {\n\t\tthis._deferQueue.async.splice(index, 1);\n\t\tindex = this._deferQueue.async.indexOf(key);\n\t}\n\n\tif (this._deferQueue.async.length === 0) {\n\t\tthis.deferEmit('ready');\n\t}\n};\n\n/**\n * Get the data array that represents the collection's data.\n * This data is returned by reference and should not be altered outside\n * of the provided CRUD functionality of the collection as doing so\n * may cause unstable index behaviour within the collection.\n * @returns {Array}\n */\nCollection.prototype.data = function () {\n\treturn this._data;\n};\n\n/**\n * Drops a collection and all it's stored data from the database.\n * @returns {boolean} True on success, false on failure.\n */\nCollection.prototype.drop = function (callback) {\n\tvar key;\n\n\tif (!this.isDropped()) {\n\t\tif (this._db && this._db._collection && this._name) {\n\t\t\tif (this.debug()) {\n\t\t\t\tconsole.log(this.logIdentifier() + ' Dropping');\n\t\t\t}\n\n\t\t\tthis._state = 'dropped';\n\n\t\t\tthis.emit('drop', this);\n\n\t\t\tdelete this._db._collection[this._name];\n\n\t\t\t// Remove any reactor IO chain links\n\t\t\tif (this._collate) {\n\t\t\t\tfor (key in this._collate) {\n\t\t\t\t\tif (this._collate.hasOwnProperty(key)) {\n\t\t\t\t\t\tthis.collateRemove(key);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdelete this._primaryKey;\n\t\t\tdelete this._primaryIndex;\n\t\t\tdelete this._primaryCrc;\n\t\t\tdelete this._crcLookup;\n\t\t\tdelete this._data;\n\t\t\tdelete this._metrics;\n\t\t\tdelete this._listeners;\n\n\t\t\tif (callback) { callback.call(this, false, true); }\n\n\t\t\treturn true;\n\t\t}\n\t} else {\n\t\tif (callback) { callback.call(this, false, true); }\n\n\t\treturn true;\n\t}\n\n\tif (callback) { callback.call(this, false, true); }\n\treturn false;\n};\n\n/**\n * Gets / sets the primary key for this collection.\n * @param {String=} keyName The name of the primary key.\n * @returns {*}\n */\nCollection.prototype.primaryKey = function (keyName) {\n\tif (keyName !== undefined) {\n\t\tif (this._primaryKey !== keyName) {\n\t\t\tvar oldKey = this._primaryKey;\n\t\t\tthis._primaryKey = keyName;\n\n\t\t\t// Set the primary key index primary key\n\t\t\tthis._primaryIndex.primaryKey(keyName);\n\n\t\t\t// Rebuild the primary key index\n\t\t\tthis.rebuildPrimaryKeyIndex();\n\n\t\t\t// Propagate change down the chain\n\t\t\tthis.chainSend('primaryKey', {\n\t\t\t\tkeyName: keyName,\n\t\t\t\toldData: oldKey\n\t\t\t});\n\t\t}\n\t\treturn this;\n\t}\n\n\treturn this._primaryKey;\n};\n\n/**\n * Handles insert events and routes changes to binds and views as required.\n * @param {Array} inserted An array of inserted documents.\n * @param {Array} failed An array of documents that failed to insert.\n * @private\n */\nCollection.prototype._onInsert = function (inserted, failed) {\n\tthis.emit('insert', inserted, failed);\n};\n\n/**\n * Handles update events and routes changes to binds and views as required.\n * @param {Array} items An array of updated documents.\n * @private\n */\nCollection.prototype._onUpdate = function (items) {\n\tthis.emit('update', items);\n};\n\n/**\n * Handles remove events and routes changes to binds and views as required.\n * @param {Array} items An array of removed documents.\n * @private\n */\nCollection.prototype._onRemove = function (items) {\n\tthis.emit('remove', items);\n};\n\n/**\n * Handles any change to the collection.\n * @private\n */\nCollection.prototype._onChange = function () {\n\tif (this._options.changeTimestamp) {\n\t\t// Record the last change timestamp\n\t\tthis._metaData.lastChange = this.serialiser.convert(new Date());\n\t}\n};\n\n/**\n * Gets / sets the db instance this class instance belongs to.\n * @param {Db=} db The db instance.\n * @returns {*}\n */\nShared.synthesize(Collection.prototype, 'db', function (db) {\n\tif (db) {\n\t\tif (this.primaryKey() === '_id') {\n\t\t\t// Set primary key to the db's key by default\n\t\t\tthis.primaryKey(db.primaryKey());\n\n\t\t\t// Apply the same debug settings\n\t\t\tthis.debug(db.debug());\n\t\t}\n\t}\n\n\treturn this.$super.apply(this, arguments);\n});\n\n/**\n * Gets / sets mongodb emulation mode.\n * @param {Boolean=} val True to enable, false to disable.\n * @returns {*}\n */\nShared.synthesize(Collection.prototype, 'mongoEmulation');\n\n/**\n * Sets the collection's data to the array / documents passed. If any\n * data already exists in the collection it will be removed before the\n * new data is set.\n * @param {Array|Object} data The array of documents or a single document\n * that will be set as the collections data.\n * @param options Optional options object.\n * @param callback Optional callback function.\n */\nCollection.prototype.setData = new Overload('Collection.prototype.setData', {\n\t'*': function (data) {\n\t\treturn this.$main.call(this, data, {});\n\t},\n\n\t'*, object': function (data, options) {\n\t\treturn this.$main.call(this, data, options);\n\t},\n\n\t'*, function': function (data, callback) {\n\t\treturn this.$main.call(this, data, {}, callback);\n\t},\n\n\t'*, *, function': function (data, options, callback) {\n\t\treturn this.$main.call(this, data, options, callback);\n\t},\n\n\t'*, *, *': function (data, options, callback) {\n\t\treturn this.$main.call(this, data, options, callback);\n\t},\n\n\n\t'$main': function (data, options, callback) {\n\t\tif (this.isDropped()) {\n\t\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t\t}\n\n\t\tif (data) {\n\t\t\tvar deferredSetting = this.deferredCalls(),\n\t\t\t\toldData = [].concat(this._data);\n\n\t\t\t// Switch off deferred calls since setData should be\n\t\t\t// a synchronous call\n\t\t\tthis.deferredCalls(false);\n\n\t\t\toptions = this.options(options);\n\n\t\t\tif (options.$decouple) {\n\t\t\t\tdata = this.decouple(data);\n\t\t\t}\n\n\t\t\tif (!(data instanceof Array)) {\n\t\t\t\tdata = [data];\n\t\t\t}\n\n\t\t\t// Remove all items from the collection\n\t\t\tthis.remove({});\n\n\t\t\t// Insert the new data\n\t\t\tthis.insert(data);\n\n\t\t\t// Switch deferred calls back to previous settings\n\t\t\tthis.deferredCalls(deferredSetting);\n\n\t\t\tthis._onChange();\n\t\t\tthis.emit('setData', this._data, oldData);\n\t\t}\n\n\t\tif (callback) { callback.call(this); }\n\n\t\treturn this;\n\t}\n});\n\n/**\n * Drops and rebuilds the primary key index for all documents in the collection.\n * @param {Object=} options An optional options object.\n * @private\n */\nCollection.prototype.rebuildPrimaryKeyIndex = function (options) {\n\toptions = options || {\n\t\t$ensureKeys: undefined,\n\t\t$violationCheck: undefined\n\t};\n\n\tvar ensureKeys = options && options.$ensureKeys !== undefined ? options.$ensureKeys : true,\n\t\tviolationCheck = options && options.$violationCheck !== undefined ? options.$violationCheck : true,\n\t\tarr,\n\t\tarrCount,\n\t\tarrItem,\n\t\tpIndex = this._primaryIndex,\n\t\tcrcIndex = this._primaryCrc,\n\t\tcrcLookup = this._crcLookup,\n\t\tpKey = this._primaryKey,\n\t\tjString;\n\n\t// Drop the existing primary index\n\tpIndex.truncate();\n\tcrcIndex.truncate();\n\tcrcLookup.truncate();\n\n\t// Loop the data and check for a primary key in each object\n\tarr = this._data;\n\tarrCount = arr.length;\n\n\twhile (arrCount--) {\n\t\tarrItem = arr[arrCount];\n\n\t\tif (ensureKeys) {\n\t\t\t// Make sure the item has a primary key\n\t\t\tthis.ensurePrimaryKey(arrItem);\n\t\t}\n\n\t\tif (violationCheck) {\n\t\t\t// Check for primary key violation\n\t\t\tif (!pIndex.uniqueSet(arrItem[pKey], arrItem)) {\n\t\t\t\t// Primary key violation\n\t\t\t\tthrow(this.logIdentifier() + ' Call to setData on collection failed because your data violates the primary key unique constraint. One or more documents are using the same primary key: ' + arrItem[this._primaryKey]);\n\t\t\t}\n\t\t} else {\n\t\t\tpIndex.set(arrItem[pKey], arrItem);\n\t\t}\n\n\t\t// Generate a hash string\n\t\tjString = this.hash(arrItem);\n\n\t\tcrcIndex.set(arrItem[pKey], jString);\n\t\tcrcLookup.set(jString, arrItem);\n\t}\n};\n\n/**\n * Checks for a primary key on the document and assigns one if none\n * currently exists.\n * @param {Object} obj The object to check a primary key against.\n * @private\n */\nCollection.prototype.ensurePrimaryKey = function (obj) {\n\tif (obj[this._primaryKey] === undefined) {\n\t\t// Assign a primary key automatically\n\t\tobj[this._primaryKey] = this.objectId();\n\t}\n};\n\n/**\n * Clears all data from the collection.\n * @returns {Collection}\n */\nCollection.prototype.truncate = function () {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\t// TODO: This should use remove so that chain reactor events are properly\n\t// TODO: handled, but ensure that chunking is switched off\n\tthis.emit('truncate', this._data);\n\n\t// Clear all the data from the collection\n\tthis._data.length = 0;\n\n\t// Re-create the primary index data\n\tthis._primaryIndex = new KeyValueStore('primary');\n\tthis._primaryCrc = new KeyValueStore('primaryCrc');\n\tthis._crcLookup = new KeyValueStore('crcLookup');\n\n\tthis._onChange();\n\tthis.emit('immediateChange', {type: 'truncate'});\n\tthis.deferEmit('change', {type: 'truncate'});\n\treturn this;\n};\n\n/**\n * Modifies an existing document or documents in a collection. This will update\n * all matches for 'query' with the data held in 'update'. It will not overwrite\n * the matched documents with the update document.\n *\n * @param {Object} obj The document object to upsert or an array containing\n * documents to upsert.\n *\n * If the document contains a primary key field (based on the collections's primary\n * key) then the database will search for an existing document with a matching id.\n * If a matching document is found, the document will be updated. Any keys that\n * match keys on the existing document will be overwritten with new data. Any keys\n * that do not currently exist on the document will be added to the document.\n *\n * If the document does not contain an id or the id passed does not match an existing\n * document, an insert is performed instead. If no id is present a new primary key\n * id is provided for the item.\n *\n * @param {Function=} callback Optional callback method.\n * @returns {Object} An object containing two keys, \"op\" contains either \"insert\" or\n * \"update\" depending on the type of operation that was performed and \"result\"\n * contains the return data from the operation used.\n */\nCollection.prototype.upsert = function (obj, callback) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\tif (obj) {\n\t\tvar queue = this._deferQueue.upsert,\n\t\t\tdeferThreshold = this._deferThreshold.upsert,\n\t\t\treturnData = {},\n\t\t\tquery,\n\t\t\ti;\n\n\t\t// Determine if the object passed is an array or not\n\t\tif (obj instanceof Array) {\n\t\t\tif (this._deferredCalls && obj.length > deferThreshold) {\n\t\t\t\t// Break up upsert into blocks\n\t\t\t\tthis._deferQueue.upsert = queue.concat(obj);\n\t\t\t\tthis._asyncPending('upsert');\n\n\t\t\t\t// Fire off the insert queue handler\n\t\t\t\tthis.processQueue('upsert', callback);\n\n\t\t\t\treturn {};\n\t\t\t} else {\n\t\t\t\t// Loop the array and upsert each item\n\t\t\t\treturnData = [];\n\n\t\t\t\tfor (i = 0; i < obj.length; i++) {\n\t\t\t\t\treturnData.push(this.upsert(obj[i]));\n\t\t\t\t}\n\n\t\t\t\tif (callback) { callback.call(this); }\n\n\t\t\t\treturn returnData;\n\t\t\t}\n\t\t}\n\n\t\t// Determine if the operation is an insert or an update\n\t\tif (obj[this._primaryKey]) {\n\t\t\t// Check if an object with this primary key already exists\n\t\t\tquery = {};\n\t\t\tquery[this._primaryKey] = obj[this._primaryKey];\n\n\t\t\tif (this._primaryIndex.lookup(query)[0]) {\n\t\t\t\t// The document already exists with this id, this operation is an update\n\t\t\t\treturnData.op = 'update';\n\t\t\t} else {\n\t\t\t\t// No document with this id exists, this operation is an insert\n\t\t\t\treturnData.op = 'insert';\n\t\t\t}\n\t\t} else {\n\t\t\t// The document passed does not contain an id, this operation is an insert\n\t\t\treturnData.op = 'insert';\n\t\t}\n\n\t\tswitch (returnData.op) {\n\t\t\tcase 'insert':\n\t\t\t\treturnData.result = this.insert(obj, callback);\n\t\t\t\tbreak;\n\n\t\t\tcase 'update':\n\t\t\t\treturnData.result = this.update(query, obj, {}, callback);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn returnData;\n\t} else {\n\t\tif (callback) { callback.call(this); }\n\t}\n\n\treturn {};\n};\n\n/**\n * Executes a method against each document that matches query and returns an\n * array of documents that may have been modified by the method.\n * @param {Object} query The query object.\n * @param {Function} func The method that each document is passed to. If this method\n * returns false for a particular document it is excluded from the results.\n * @param {Object=} options Optional options object.\n * @returns {Array}\n */\nCollection.prototype.filter = function (query, func, options) {\n\treturn (this.find(query, options)).filter(func);\n};\n\n/**\n * Executes a method against each document that matches query and then executes\n * an update based on the return data of the method.\n * @param {Object} query The query object.\n * @param {Function} func The method that each document is passed to. If this method\n * returns false for a particular document it is excluded from the update.\n * @param {Object=} options Optional options object passed to the initial find call.\n * @returns {Array}\n */\nCollection.prototype.filterUpdate = function (query, func, options) {\n\tvar items = this.find(query, options),\n\t\tresults = [],\n\t\tsingleItem,\n\t\tsingleQuery,\n\t\tsingleUpdate,\n\t\tpk = this.primaryKey(),\n\t\ti;\n\n\tfor (i = 0; i < items.length; i++) {\n\t\tsingleItem = items[i];\n\t\tsingleUpdate = func(singleItem);\n\n\t\tif (singleUpdate) {\n\t\t\tsingleQuery = {};\n\t\t\tsingleQuery[pk] = singleItem[pk];\n\n\t\t\tresults.push(this.update(singleQuery, singleUpdate));\n\t\t}\n\t}\n\n\treturn results;\n};\n\n/**\n * Modifies an existing document or documents in a collection. This will update\n * all matches for 'query' with the data held in 'update'. It will not overwrite\n * the matched documents with the update document.\n *\n * @param {Object} query The query that must be matched for a document to be\n * operated on.\n * @param {Object} update The object containing updated key/values. Any keys that\n * match keys on the existing document will be overwritten with this data. Any\n * keys that do not currently exist on the document will be added to the document.\n * @param {Object=} options An options object.\n * @param {Function=} callback The callback method to call when the update is\n * complete.\n * @returns {Array} The items that were updated.\n */\nCollection.prototype.update = function (query, update, options, callback) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\t// Convert queries from mongo dot notation to forerunner queries\n\tif (this.mongoEmulation()) {\n\t\tthis.convertToFdb(query);\n\t\tthis.convertToFdb(update);\n\t} else {\n\t\t// Decouple the update data\n\t\tupdate = this.decouple(update);\n\t}\n\n\t// Handle transform\n\tupdate = this.transformIn(update);\n\n\treturn this._handleUpdate(query, update, options, callback);\n};\n\nCollection.prototype._handleUpdate = function (query, update, options, callback) {\n\tvar self = this,\n\t\top = this._metrics.create('update'),\n\t\tdataSet,\n\t\tupdated,\n\t\tupdateCall = function (referencedDoc) {\n\t\t\tvar oldDoc = self.decouple(referencedDoc),\n\t\t\t\tnewDoc,\n\t\t\t\ttriggerOperation,\n\t\t\t\tresult;\n\n\t\t\tif (self.willTrigger(self.TYPE_UPDATE, self.PHASE_BEFORE) || self.willTrigger(self.TYPE_UPDATE, self.PHASE_AFTER)) {\n\t\t\t\tnewDoc = self.decouple(referencedDoc);\n\n\t\t\t\ttriggerOperation = {\n\t\t\t\t\ttype: 'update',\n\t\t\t\t\tquery: self.decouple(query),\n\t\t\t\t\tupdate: self.decouple(update),\n\t\t\t\t\toptions: self.decouple(options),\n\t\t\t\t\top: op\n\t\t\t\t};\n\n\t\t\t\t// Update newDoc with the update criteria so we know what the data will look\n\t\t\t\t// like AFTER the update is processed\n\t\t\t\tresult = self.updateObject(newDoc, triggerOperation.update, triggerOperation.query, triggerOperation.options, '');\n\n\t\t\t\tif (self.processTrigger(triggerOperation, self.TYPE_UPDATE, self.PHASE_BEFORE, referencedDoc, newDoc) !== false) {\n\t\t\t\t\t// No triggers complained so let's execute the replacement of the existing\n\t\t\t\t\t// object with the new one\n\t\t\t\t\tresult = self.updateObject(referencedDoc, newDoc, triggerOperation.query, triggerOperation.options, '');\n\n\t\t\t\t\t// NOTE: If for some reason we would only like to fire this event if changes are actually going\n\t\t\t\t\t// to occur on the object from the proposed update then we can add \"result &&\" to the if\n\t\t\t\t\tself.processTrigger(triggerOperation, self.TYPE_UPDATE, self.PHASE_AFTER, oldDoc, newDoc);\n\t\t\t\t} else {\n\t\t\t\t\t// Trigger cancelled operation so tell result that it was not updated\n\t\t\t\t\tresult = false;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// No triggers complained so let's execute the replacement of the existing\n\t\t\t\t// object with the new one\n\t\t\t\tresult = self.updateObject(referencedDoc, update, query, options, '');\n\t\t\t}\n\n\t\t\t// Inform indexes of the change\n\t\t\tself._updateIndexes(oldDoc, referencedDoc);\n\n\t\t\treturn result;\n\t\t};\n\n\top.start();\n\top.time('Retrieve documents to update');\n\tdataSet = this.find(query, {$decouple: false});\n\top.time('Retrieve documents to update');\n\n\tif (dataSet.length) {\n\t\top.time('Update documents');\n\t\tupdated = dataSet.filter(updateCall);\n\t\top.time('Update documents');\n\n\t\tif (updated.length) {\n\t\t\tif (this.debug()) {\n\t\t\t\tconsole.log(this.logIdentifier() + ' Updated some data');\n\t\t\t}\n\n\t\t\top.time('Resolve chains');\n\t\t\tif (this.chainWillSend()) {\n\t\t\t\tthis.chainSend('update', {\n\t\t\t\t\tquery: query,\n\t\t\t\t\tupdate: update,\n\t\t\t\t\tdataSet: this.decouple(updated)\n\t\t\t\t}, options);\n\t\t\t}\n\t\t\top.time('Resolve chains');\n\n\t\t\tthis._onUpdate(updated);\n\t\t\tthis._onChange();\n\n\t\t\tif (callback) { callback.call(this); }\n\n\t\t\tthis.emit('immediateChange', {type: 'update', data: updated});\n\t\t\tthis.deferEmit('change', {type: 'update', data: updated});\n\t\t}\n\t}\n\n\top.stop();\n\n\t// TODO: Should we decouple the updated array before return by default?\n\treturn updated || [];\n};\n\n/**\n * Replaces an existing object with data from the new object without\n * breaking data references.\n * @param {Object} currentObj The object to alter.\n * @param {Object} newObj The new object to overwrite the existing one with.\n * @returns {*} Chain.\n * @private\n */\nCollection.prototype._replaceObj = function (currentObj, newObj) {\n\tvar i;\n\n\t// Check if the new document has a different primary key value from the existing one\n\t// Remove item from indexes\n\tthis._removeFromIndexes(currentObj);\n\n\t// Remove existing keys from current object\n\tfor (i in currentObj) {\n\t\tif (currentObj.hasOwnProperty(i)) {\n\t\t\tdelete currentObj[i];\n\t\t}\n\t}\n\n\t// Add new keys to current object\n\tfor (i in newObj) {\n\t\tif (newObj.hasOwnProperty(i)) {\n\t\t\tcurrentObj[i] = newObj[i];\n\t\t}\n\t}\n\n\t// Update the item in the primary index\n\tif (!this._insertIntoIndexes(currentObj)) {\n\t\tthrow(this.logIdentifier() + ' Primary key violation in update! Key violated: ' + currentObj[this._primaryKey]);\n\t}\n\n\t// Update the object in the collection data\n\t//this._data.splice(this._data.indexOf(currentObj), 1, newObj);\n\n\treturn this;\n};\n\n/**\n * Helper method to update a document from it's id.\n * @param {String} id The id of the document.\n * @param {Object} update The object containing the key/values to update to.\n * @returns {Object} The document that was updated or undefined\n * if no document was updated.\n */\nCollection.prototype.updateById = function (id, update) {\n\tvar searchObj = {};\n\tsearchObj[this._primaryKey] = id;\n\treturn this.update(searchObj, update)[0];\n};\n\n/**\n * Internal method for document updating.\n * @param {Object} doc The document to update.\n * @param {Object} update The object with key/value pairs to update the document with.\n * @param {Object} query The query object that we need to match to perform an update.\n * @param {Object} options An options object.\n * @param {String} path The current recursive path.\n * @param {String} opType The type of update operation to perform, if none is specified\n * default is to set new data against matching fields.\n * @returns {Boolean} True if the document was updated with new / changed data or\n * false if it was not updated because the data was the same.\n * @private\n */\nCollection.prototype.updateObject = function (doc, update, query, options, path, opType) {\n\t// TODO: This method is long, try to break it into smaller pieces\n\tupdate = this.decouple(update);\n\n\t// Clear leading dots from path\n\tpath = path || '';\n\tif (path.substr(0, 1) === '.') { path = path.substr(1, path.length -1); }\n\n\t//var oldDoc = this.decouple(doc),\n\tvar\tupdated = false,\n\t\trecurseUpdated = false,\n\t\toperation,\n\t\ttmpArray,\n\t\ttmpIndex,\n\t\ttmpCount,\n\t\ttempIndex,\n\t\ttempKey,\n\t\treplaceObj,\n\t\tpk,\n\t\tpathInstance,\n\t\tsourceIsArray,\n\t\tupdateIsArray,\n\t\ti;\n\n\t// Loop each key in the update object\n\tfor (i in update) {\n\t\tif (update.hasOwnProperty(i)) {\n\t\t\t// Reset operation flag\n\t\t\toperation = false;\n\n\t\t\t// Check if the property starts with a dollar (function)\n\t\t\tif (i.substr(0, 1) === '$') {\n\t\t\t\t// Check for commands\n\t\t\t\tswitch (i) {\n\t\t\t\t\tcase '$key':\n\t\t\t\t\tcase '$index':\n\t\t\t\t\tcase '$data':\n\t\t\t\t\tcase '$min':\n\t\t\t\t\tcase '$max':\n\t\t\t\t\t\t// Ignore some operators\n\t\t\t\t\t\toperation = true;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase '$each':\n\t\t\t\t\t\toperation = true;\n\n\t\t\t\t\t\t// Loop over the array of updates and run each one\n\t\t\t\t\t\ttmpCount = update.$each.length;\n\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < tmpCount; tmpIndex++) {\n\t\t\t\t\t\t\trecurseUpdated = this.updateObject(doc, update.$each[tmpIndex], query, options, path);\n\n\t\t\t\t\t\t\tif (recurseUpdated) {\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tupdated = updated || recurseUpdated;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase '$replace':\n\t\t\t\t\t\toperation = true;\n\t\t\t\t\t\treplaceObj = update.$replace;\n\t\t\t\t\t\tpk = this.primaryKey();\n\n\t\t\t\t\t\t// Loop the existing item properties and compare with\n\t\t\t\t\t\t// the replacement (never remove primary key)\n\t\t\t\t\t\tfor (tempKey in doc) {\n\t\t\t\t\t\t\tif (doc.hasOwnProperty(tempKey) && tempKey !== pk) {\n\t\t\t\t\t\t\t\tif (replaceObj[tempKey] === undefined) {\n\t\t\t\t\t\t\t\t\t// The new document doesn't have this field, remove it from the doc\n\t\t\t\t\t\t\t\t\tthis._updateUnset(doc, tempKey);\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Loop the new item props and update the doc\n\t\t\t\t\t\tfor (tempKey in replaceObj) {\n\t\t\t\t\t\t\tif (replaceObj.hasOwnProperty(tempKey) && tempKey !== pk) {\n\t\t\t\t\t\t\t\tthis._updateOverwrite(doc, tempKey, replaceObj[tempKey]);\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tdefault:\n\t\t\t\t\t\toperation = true;\n\n\t\t\t\t\t\t// Now run the operation\n\t\t\t\t\t\trecurseUpdated = this.updateObject(doc, update[i], query, options, path, i);\n\t\t\t\t\t\tupdated = updated || recurseUpdated;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check if the key has a .$ at the end, denoting an array lookup\n\t\t\tif (this._isPositionalKey(i)) {\n\t\t\t\toperation = true;\n\n\t\t\t\t// Modify i to be the name of the field\n\t\t\t\ti = i.substr(0, i.length - 2);\n\n\t\t\t\tpathInstance = new Path(path + '.' + i);\n\n\t\t\t\t// Check if the key is an array and has items\n\t\t\t\tif (doc[i] && doc[i] instanceof Array && doc[i].length) {\n\t\t\t\t\ttmpArray = [];\n\n\t\t\t\t\t// Loop the array and find matches to our search\n\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < doc[i].length; tmpIndex++) {\n\t\t\t\t\t\tif (this._match(doc[i][tmpIndex], pathInstance.value(query)[0], options, '', {})) {\n\t\t\t\t\t\t\ttmpArray.push(tmpIndex);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Loop the items that matched and update them\n\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < tmpArray.length; tmpIndex++) {\n\t\t\t\t\t\trecurseUpdated = this.updateObject(doc[i][tmpArray[tmpIndex]], update[i + '.$'], query, options, path + '.' + i, opType);\n\t\t\t\t\t\tupdated = updated || recurseUpdated;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!operation) {\n\t\t\t\tif (!opType && typeof(update[i]) === 'object') {\n\t\t\t\t\tif (doc[i] !== null && typeof(doc[i]) === 'object') {\n\t\t\t\t\t\t// Check if we are dealing with arrays\n\t\t\t\t\t\tsourceIsArray = doc[i] instanceof Array;\n\t\t\t\t\t\tupdateIsArray = update[i] instanceof Array;\n\n\t\t\t\t\t\tif (sourceIsArray || updateIsArray) {\n\t\t\t\t\t\t\t// Check if the update is an object and the doc is an array\n\t\t\t\t\t\t\tif (!updateIsArray && sourceIsArray) {\n\t\t\t\t\t\t\t\t// Update is an object, source is an array so match the array items\n\t\t\t\t\t\t\t\t// with our query object to find the one to update inside this array\n\n\t\t\t\t\t\t\t\t// Loop the array and find matches to our search\n\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < doc[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\trecurseUpdated = this.updateObject(doc[i][tmpIndex], update[i], query, options, path + '.' + i, opType);\n\t\t\t\t\t\t\t\t\tupdated = updated || recurseUpdated;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t// Either both source and update are arrays or the update is\n\t\t\t\t\t\t\t\t// an array and the source is not, so set source to update\n\t\t\t\t\t\t\t\tif (doc[i] !== update[i]) {\n\t\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, update[i]);\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// The doc key is an object so traverse the\n\t\t\t\t\t\t\t// update further\n\t\t\t\t\t\t\trecurseUpdated = this.updateObject(doc[i], update[i], query, options, path + '.' + i, opType);\n\t\t\t\t\t\t\tupdated = updated || recurseUpdated;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (doc[i] !== update[i]) {\n\t\t\t\t\t\t\tthis._updateProperty(doc, i, update[i]);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tswitch (opType) {\n\t\t\t\t\t\tcase '$inc':\n\t\t\t\t\t\t\tvar doUpdate = true;\n\n\t\t\t\t\t\t\t// Check for a $min / $max operator\n\t\t\t\t\t\t\tif (update[i] > 0) {\n\t\t\t\t\t\t\t\tif (update.$max) {\n\t\t\t\t\t\t\t\t\t// Check current value\n\t\t\t\t\t\t\t\t\tif (doc[i] >= update.$max) {\n\t\t\t\t\t\t\t\t\t\t// Don't update\n\t\t\t\t\t\t\t\t\t\tdoUpdate = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else if (update[i] < 0) {\n\t\t\t\t\t\t\t\tif (update.$min) {\n\t\t\t\t\t\t\t\t\t// Check current value\n\t\t\t\t\t\t\t\t\tif (doc[i] <= update.$min) {\n\t\t\t\t\t\t\t\t\t\t// Don't update\n\t\t\t\t\t\t\t\t\t\tdoUpdate = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (doUpdate) {\n\t\t\t\t\t\t\t\tthis._updateIncrement(doc, i, update[i]);\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$cast':\n\t\t\t\t\t\t\t// Casts a property to the type specified if it is not already\n\t\t\t\t\t\t\t// that type. If the cast is an array or an object and the property\n\t\t\t\t\t\t\t// is not already that type a new array or object is created and\n\t\t\t\t\t\t\t// set to the property, overwriting the previous value\n\t\t\t\t\t\t\tswitch (update[i]) {\n\t\t\t\t\t\t\t\tcase 'array':\n\t\t\t\t\t\t\t\t\tif (!(doc[i] instanceof Array)) {\n\t\t\t\t\t\t\t\t\t\t// Cast to an array\n\t\t\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, update.$data || []);\n\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\tcase 'object':\n\t\t\t\t\t\t\t\t\tif (!(doc[i] instanceof Object) || (doc[i] instanceof Array)) {\n\t\t\t\t\t\t\t\t\t\t// Cast to an object\n\t\t\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, update.$data || {});\n\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\tcase 'number':\n\t\t\t\t\t\t\t\t\tif (typeof doc[i] !== 'number') {\n\t\t\t\t\t\t\t\t\t\t// Cast to a number\n\t\t\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, Number(doc[i]));\n\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\tcase 'string':\n\t\t\t\t\t\t\t\t\tif (typeof doc[i] !== 'string') {\n\t\t\t\t\t\t\t\t\t\t// Cast to a string\n\t\t\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, String(doc[i]));\n\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot update cast to unknown type: ' + update[i]);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$push':\n\t\t\t\t\t\t\t// Check if the target key is undefined and if so, create an array\n\t\t\t\t\t\t\tif (doc[i] === undefined) {\n\t\t\t\t\t\t\t\t// Initialise a new array\n\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, []);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Check that the target key is an array\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\t// Check for a $position modifier with an $each\n\t\t\t\t\t\t\t\tif (update[i].$position !== undefined && update[i].$each instanceof Array) {\n\t\t\t\t\t\t\t\t\t// Grab the position to insert at\n\t\t\t\t\t\t\t\t\ttempIndex = update[i].$position;\n\n\t\t\t\t\t\t\t\t\t// Loop the each array and push each item\n\t\t\t\t\t\t\t\t\ttmpCount = update[i].$each.length;\n\t\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < tmpCount; tmpIndex++) {\n\t\t\t\t\t\t\t\t\t\tthis._updateSplicePush(doc[i], tempIndex + tmpIndex, update[i].$each[tmpIndex]);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else if (update[i].$each instanceof Array) {\n\t\t\t\t\t\t\t\t\t// Do a loop over the each to push multiple items\n\t\t\t\t\t\t\t\t\ttmpCount = update[i].$each.length;\n\t\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < tmpCount; tmpIndex++) {\n\t\t\t\t\t\t\t\t\t\tthis._updatePush(doc[i], update[i].$each[tmpIndex]);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t// Do a standard push\n\t\t\t\t\t\t\t\t\tthis._updatePush(doc[i], update[i]);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot push to a key that is not an array! (' + i + ')');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$pull':\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\ttmpArray = [];\n\n\t\t\t\t\t\t\t\t// Loop the array and find matches to our search\n\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < doc[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\tif (this._match(doc[i][tmpIndex], update[i], options, '', {})) {\n\t\t\t\t\t\t\t\t\t\ttmpArray.push(tmpIndex);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\ttmpCount = tmpArray.length;\n\n\t\t\t\t\t\t\t\t// Now loop the pull array and remove items to be pulled\n\t\t\t\t\t\t\t\twhile (tmpCount--) {\n\t\t\t\t\t\t\t\t\tthis._updatePull(doc[i], tmpArray[tmpCount]);\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$pullAll':\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\tif (update[i] instanceof Array) {\n\t\t\t\t\t\t\t\t\ttmpArray = doc[i];\n\t\t\t\t\t\t\t\t\ttmpCount = tmpArray.length;\n\n\t\t\t\t\t\t\t\t\tif (tmpCount > 0) {\n\t\t\t\t\t\t\t\t\t\t// Now loop the pull array and remove items to be pulled\n\t\t\t\t\t\t\t\t\t\twhile (tmpCount--) {\n\t\t\t\t\t\t\t\t\t\t\tfor (tempIndex = 0; tempIndex < update[i].length; tempIndex++) {\n\t\t\t\t\t\t\t\t\t\t\t\tif (tmpArray[tmpCount] === update[i][tempIndex]) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tthis._updatePull(doc[i], tmpCount);\n\t\t\t\t\t\t\t\t\t\t\t\t\ttmpCount--;\n\t\t\t\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\t\tif (tmpCount < 0) {\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot pullAll without being given an array of values to pull! (' + i + ')');\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$addToSet':\n\t\t\t\t\t\t\t// Check if the target key is undefined and if so, create an array\n\t\t\t\t\t\t\tif (doc[i] === undefined) {\n\t\t\t\t\t\t\t\t// Initialise a new array\n\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, []);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Check that the target key is an array\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\t// Loop the target array and check for existence of item\n\t\t\t\t\t\t\t\tvar targetArr = doc[i],\n\t\t\t\t\t\t\t\t\ttargetArrIndex,\n\t\t\t\t\t\t\t\t\ttargetArrCount = targetArr.length,\n\t\t\t\t\t\t\t\t\tobjHash,\n\t\t\t\t\t\t\t\t\taddObj = true,\n\t\t\t\t\t\t\t\t\toptionObj = (options && options.$addToSet),\n\t\t\t\t\t\t\t\t\thashMode,\n\t\t\t\t\t\t\t\t\tpathSolver;\n\n\t\t\t\t\t\t\t\t// Check if we have an options object for our operation\n\t\t\t\t\t\t\t\tif (update[i].$key) {\n\t\t\t\t\t\t\t\t\thashMode = false;\n\t\t\t\t\t\t\t\t\tpathSolver = new Path(update[i].$key);\n\t\t\t\t\t\t\t\t\tobjHash = pathSolver.value(update[i])[0];\n\n\t\t\t\t\t\t\t\t\t// Remove the key from the object before we add it\n\t\t\t\t\t\t\t\t\tdelete update[i].$key;\n\t\t\t\t\t\t\t\t} else if (optionObj && optionObj.key) {\n\t\t\t\t\t\t\t\t\thashMode = false;\n\t\t\t\t\t\t\t\t\tpathSolver = new Path(optionObj.key);\n\t\t\t\t\t\t\t\t\tobjHash = pathSolver.value(update[i])[0];\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tobjHash = this.jStringify(update[i]);\n\t\t\t\t\t\t\t\t\thashMode = true;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tfor (targetArrIndex = 0; targetArrIndex < targetArrCount; targetArrIndex++) {\n\t\t\t\t\t\t\t\t\tif (hashMode) {\n\t\t\t\t\t\t\t\t\t\t// Check if objects match via a string hash (JSON)\n\t\t\t\t\t\t\t\t\t\tif (this.jStringify(targetArr[targetArrIndex]) === objHash) {\n\t\t\t\t\t\t\t\t\t\t\t// The object already exists, don't add it\n\t\t\t\t\t\t\t\t\t\t\taddObj = false;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t// Check if objects match based on the path\n\t\t\t\t\t\t\t\t\t\tif (objHash === pathSolver.value(targetArr[targetArrIndex])[0]) {\n\t\t\t\t\t\t\t\t\t\t\t// The object already exists, don't add it\n\t\t\t\t\t\t\t\t\t\t\taddObj = false;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (addObj) {\n\t\t\t\t\t\t\t\t\tthis._updatePush(doc[i], update[i]);\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot addToSet on a key that is not an array! (' + i + ')');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$splicePush':\n\t\t\t\t\t\t\t// Check if the target key is undefined and if so, create an array\n\t\t\t\t\t\t\tif (doc[i] === undefined) {\n\t\t\t\t\t\t\t\t// Initialise a new array\n\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, []);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Check that the target key is an array\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\ttempIndex = update.$index;\n\n\t\t\t\t\t\t\t\tif (tempIndex !== undefined) {\n\t\t\t\t\t\t\t\t\tdelete update.$index;\n\n\t\t\t\t\t\t\t\t\t// Check for out of bounds index\n\t\t\t\t\t\t\t\t\tif (tempIndex > doc[i].length) {\n\t\t\t\t\t\t\t\t\t\ttempIndex = doc[i].length;\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tthis._updateSplicePush(doc[i], tempIndex, update[i]);\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot splicePush without a $index integer value!');\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot splicePush with a key that is not an array! (' + i + ')');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$move':\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\t// Loop the array and find matches to our search\n\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < doc[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\tif (this._match(doc[i][tmpIndex], update[i], options, '', {})) {\n\t\t\t\t\t\t\t\t\t\tvar moveToIndex = update.$index;\n\n\t\t\t\t\t\t\t\t\t\tif (moveToIndex !== undefined) {\n\t\t\t\t\t\t\t\t\t\t\tdelete update.$index;\n\n\t\t\t\t\t\t\t\t\t\t\tthis._updateSpliceMove(doc[i], tmpIndex, moveToIndex);\n\t\t\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot move without a $index integer value!');\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot move on a key that is not an array! (' + i + ')');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$mul':\n\t\t\t\t\t\t\tthis._updateMultiply(doc, i, update[i]);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$rename':\n\t\t\t\t\t\t\tthis._updateRename(doc, i, update[i]);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$overwrite':\n\t\t\t\t\t\t\tthis._updateOverwrite(doc, i, update[i]);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$unset':\n\t\t\t\t\t\t\tthis._updateUnset(doc, i);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$clear':\n\t\t\t\t\t\t\tthis._updateClear(doc, i);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$pop':\n\t\t\t\t\t\t\tif (doc[i] instanceof Array) {\n\t\t\t\t\t\t\t\tif (this._updatePop(doc[i], update[i])) {\n\t\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot pop from a key that is not an array! (' + i + ')');\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '$toggle':\n\t\t\t\t\t\t\t// Toggle the boolean property between true and false\n\t\t\t\t\t\t\tthis._updateProperty(doc, i, !doc[i]);\n\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tif (doc[i] !== update[i]) {\n\t\t\t\t\t\t\t\tthis._updateProperty(doc, i, update[i]);\n\t\t\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn updated;\n};\n\n/**\n * Determines if the passed key has an array positional mark (a dollar at the end\n * of its name).\n * @param {String} key The key to check.\n * @returns {Boolean} True if it is a positional or false if not.\n * @private\n */\nCollection.prototype._isPositionalKey = function (key) {\n\treturn key.substr(key.length - 2, 2) === '.$';\n};\n\n/**\n * Removes any documents from the collection that match the search query\n * key/values.\n * @param {Object} query The query object.\n * @param {Object=} options An options object.\n * @param {Function=} callback A callback method.\n * @returns {Array} An array of the documents that were removed.\n */\nCollection.prototype.remove = function (query, options, callback) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\tvar self = this,\n\t\tdataSet,\n\t\tindex,\n\t\tarrIndex,\n\t\treturnArr,\n\t\tremoveMethod,\n\t\ttriggerOperation,\n\t\tdoc,\n\t\tnewDoc;\n\n\tif (typeof(options) === 'function') {\n\t\tcallback = options;\n\t\toptions = {};\n\t}\n\n\t// Convert queries from mongo dot notation to forerunner queries\n\tif (this.mongoEmulation()) {\n\t\tthis.convertToFdb(query);\n\t}\n\n\tif (query instanceof Array) {\n\t\treturnArr = [];\n\n\t\tfor (arrIndex = 0; arrIndex < query.length; arrIndex++) {\n\t\t\treturnArr.push(this.remove(query[arrIndex], {noEmit: true}));\n\t\t}\n\n\t\tif (!options || (options && !options.noEmit)) {\n\t\t\tthis._onRemove(returnArr);\n\t\t}\n\n\t\tif (callback) { callback.call(this, false, returnArr); }\n\t\treturn returnArr;\n\t} else {\n\t\treturnArr = [];\n\t\tdataSet = this.find(query, {$decouple: false});\n\n\t\tif (dataSet.length) {\n\t\t\tremoveMethod = function (dataItem) {\n\t\t\t\t// Remove the item from the collection's indexes\n\t\t\t\tself._removeFromIndexes(dataItem);\n\n\t\t\t\t// Remove data from internal stores\n\t\t\t\tindex = self._data.indexOf(dataItem);\n\t\t\t\tself._dataRemoveAtIndex(index);\n\n\t\t\t\treturnArr.push(dataItem);\n\t\t\t};\n\n\t\t\t// Remove the data from the collection\n\t\t\tfor (var i = 0; i < dataSet.length; i++) {\n\t\t\t\tdoc = dataSet[i];\n\n\t\t\t\tif (self.willTrigger(self.TYPE_REMOVE, self.PHASE_BEFORE) || self.willTrigger(self.TYPE_REMOVE, self.PHASE_AFTER)) {\n\t\t\t\t\ttriggerOperation = {\n\t\t\t\t\t\ttype: 'remove'\n\t\t\t\t\t};\n\n\t\t\t\t\tnewDoc = self.decouple(doc);\n\n\t\t\t\t\tif (self.processTrigger(triggerOperation, self.TYPE_REMOVE, self.PHASE_BEFORE, newDoc, newDoc) !== false) {\n\t\t\t\t\t\t// The trigger didn't ask to cancel so execute the removal method\n\t\t\t\t\t\tremoveMethod(doc);\n\n\t\t\t\t\t\tself.processTrigger(triggerOperation, self.TYPE_REMOVE, self.PHASE_AFTER, newDoc, newDoc);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// No triggers to execute\n\t\t\t\t\tremoveMethod(doc);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (returnArr.length) {\n\t\t\t\t//op.time('Resolve chains');\n\t\t\t\tself.chainSend('remove', {\n\t\t\t\t\tquery: query,\n\t\t\t\t\tdataSet: returnArr\n\t\t\t\t}, options);\n\t\t\t\t//op.time('Resolve chains');\n\n\t\t\t\tif (!options || (options && !options.noEmit)) {\n\t\t\t\t\tthis._onRemove(returnArr);\n\t\t\t\t}\n\n\t\t\t\tthis._onChange();\n\t\t\t\tthis.emit('immediateChange', {type: 'remove', data: returnArr});\n\t\t\t\tthis.deferEmit('change', {type: 'remove', data: returnArr});\n\t\t\t}\n\t\t}\n\n\t\tif (callback) { callback.call(this, false, returnArr); }\n\t\treturn returnArr;\n\t}\n};\n\n/**\n * Helper method that removes a document that matches the given id.\n * @param {String} id The id of the document to remove.\n * @returns {Object} The document that was removed or undefined if\n * nothing was removed.\n */\nCollection.prototype.removeById = function (id) {\n\tvar searchObj = {};\n\tsearchObj[this._primaryKey] = id;\n\treturn this.remove(searchObj)[0];\n};\n\n/**\n * Processes a deferred action queue.\n * @param {String} type The queue name to process.\n * @param {Function} callback A method to call when the queue has processed.\n * @param {Object=} resultObj A temp object to hold results in.\n */\nCollection.prototype.processQueue = function (type, callback, resultObj) {\n\tvar self = this,\n\t\tqueue = this._deferQueue[type],\n\t\tdeferThreshold = this._deferThreshold[type],\n\t\tdeferTime = this._deferTime[type],\n\t\tdataArr,\n\t\tresult;\n\n\tresultObj = resultObj || {\n\t\tdeferred: true\n\t};\n\n\tif (queue.length) {\n\t\t// Process items up to the threshold\n\t\tif (queue.length > deferThreshold) {\n\t\t\t// Grab items up to the threshold value\n\t\t\tdataArr = queue.splice(0, deferThreshold);\n\t\t} else {\n\t\t\t// Grab all the remaining items\n\t\t\tdataArr = queue.splice(0, queue.length);\n\t\t}\n\n\t\tresult = self[type](dataArr);\n\n\t\tswitch (type) {\n\t\t\tcase 'insert':\n\t\t\t\tresultObj.inserted = resultObj.inserted || [];\n\t\t\t\tresultObj.failed = resultObj.failed || [];\n\n\t\t\t\tresultObj.inserted = resultObj.inserted.concat(result.inserted);\n\t\t\t\tresultObj.failed = resultObj.failed.concat(result.failed);\n\t\t\t\tbreak;\n\t\t}\n\n\t\t// Queue another process\n\t\tsetTimeout(function () {\n\t\t\tself.processQueue.call(self, type, callback, resultObj);\n\t\t}, deferTime);\n\t} else {\n\t\tif (callback) { callback.call(this, resultObj); }\n\n\t\tthis._asyncComplete(type);\n\t}\n\n\t// Check if all queues are complete\n\tif (!this.isProcessingQueue()) {\n\t\tthis.deferEmit('queuesComplete');\n\t}\n};\n\n/**\n * Checks if any CRUD operations have been deferred and are still waiting to\n * be processed.\n * @returns {Boolean} True if there are still deferred CRUD operations to process\n * or false if all queues are clear.\n */\nCollection.prototype.isProcessingQueue = function () {\n\tvar i;\n\n\tfor (i in this._deferQueue) {\n\t\tif (this._deferQueue.hasOwnProperty(i)) {\n\t\t\tif (this._deferQueue[i].length) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n};\n\n/**\n * Inserts a document or array of documents into the collection.\n * @param {Object|Array} data Either a document object or array of document\n * @param {Number=} index Optional index to insert the record at.\n * @param {Function=} callback Optional callback called once action is complete.\n * objects to insert into the collection.\n */\nCollection.prototype.insert = function (data, index, callback) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\tif (typeof(index) === 'function') {\n\t\tcallback = index;\n\t\tindex = this._data.length;\n\t} else if (index === undefined) {\n\t\tindex = this._data.length;\n\t}\n\n\tdata = this.transformIn(data);\n\treturn this._insertHandle(data, index, callback);\n};\n\n/**\n * Inserts a document or array of documents into the collection.\n * @param {Object|Array} data Either a document object or array of document\n * @param {Number=} index Optional index to insert the record at.\n * @param {Function=} callback Optional callback called once action is complete.\n * objects to insert into the collection.\n */\nCollection.prototype._insertHandle = function (data, index, callback) {\n\tvar //self = this,\n\t\tqueue = this._deferQueue.insert,\n\t\tdeferThreshold = this._deferThreshold.insert,\n\t\t//deferTime = this._deferTime.insert,\n\t\tinserted = [],\n\t\tfailed = [],\n\t\tinsertResult,\n\t\tresultObj,\n\t\ti;\n\n\tif (data instanceof Array) {\n\t\t// Check if there are more insert items than the insert defer\n\t\t// threshold, if so, break up inserts so we don't tie up the\n\t\t// ui or thread\n\t\tif (this._deferredCalls && data.length > deferThreshold) {\n\t\t\t// Break up insert into blocks\n\t\t\tthis._deferQueue.insert = queue.concat(data);\n\t\t\tthis._asyncPending('insert');\n\n\t\t\t// Fire off the insert queue handler\n\t\t\tthis.processQueue('insert', callback);\n\n\t\t\treturn;\n\t\t} else {\n\t\t\t// Loop the array and add items\n\t\t\tfor (i = 0; i < data.length; i++) {\n\t\t\t\tinsertResult = this._insert(data[i], index + i);\n\n\t\t\t\tif (insertResult === true) {\n\t\t\t\t\tinserted.push(data[i]);\n\t\t\t\t} else {\n\t\t\t\t\tfailed.push({\n\t\t\t\t\t\tdoc: data[i],\n\t\t\t\t\t\treason: insertResult\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// Store the data item\n\t\tinsertResult = this._insert(data, index);\n\n\t\tif (insertResult === true) {\n\t\t\tinserted.push(data);\n\t\t} else {\n\t\t\tfailed.push({\n\t\t\t\tdoc: data,\n\t\t\t\treason: insertResult\n\t\t\t});\n\t\t}\n\t}\n\n\tresultObj = {\n\t\tdeferred: false,\n\t\tinserted: inserted,\n\t\tfailed: failed\n\t};\n\n\tthis._onInsert(inserted, failed);\n\tif (callback) { callback.call(this, resultObj); }\n\n\tthis._onChange();\n\tthis.emit('immediateChange', {type: 'insert', data: inserted});\n\tthis.deferEmit('change', {type: 'insert', data: inserted});\n\n\treturn resultObj;\n};\n\n/**\n * Internal method to insert a document into the collection. Will\n * check for index violations before allowing the document to be inserted.\n * @param {Object} doc The document to insert after passing index violation\n * tests.\n * @param {Number=} index Optional index to insert the document at.\n * @returns {Boolean|Object} True on success, false if no document passed,\n * or an object containing details about an index violation if one occurred.\n * @private\n */\nCollection.prototype._insert = function (doc, index) {\n\tif (doc) {\n\t\tvar self = this,\n\t\t\tindexViolation,\n\t\t\ttriggerOperation,\n\t\t\tinsertMethod,\n\t\t\tnewDoc,\n\t\t\tcapped = this.capped(),\n\t\t\tcappedSize = this.cappedSize();\n\n\t\tthis.ensurePrimaryKey(doc);\n\n\t\t// Check indexes are not going to be broken by the document\n\t\tindexViolation = this.insertIndexViolation(doc);\n\n\t\tinsertMethod = function (doc) {\n\t\t\t// Add the item to the collection's indexes\n\t\t\tself._insertIntoIndexes(doc);\n\n\t\t\t// Check index overflow\n\t\t\tif (index > self._data.length) {\n\t\t\t\tindex = self._data.length;\n\t\t\t}\n\n\t\t\t// Insert the document\n\t\t\tself._dataInsertAtIndex(index, doc);\n\n\t\t\t// Check capped collection status and remove first record\n\t\t\t// if we are over the threshold\n\t\t\tif (capped && self._data.length > cappedSize) {\n\t\t\t\t// Remove the first item in the data array\n\t\t\t\tself.removeById(self._data[0][self._primaryKey]);\n\t\t\t}\n\n\t\t\t//op.time('Resolve chains');\n\t\t\tif (self.chainWillSend()) {\n\t\t\t\tself.chainSend('insert', {\n\t\t\t\t\tdataSet: self.decouple([doc])\n\t\t\t\t}, {\n\t\t\t\t\tindex: index\n\t\t\t\t});\n\t\t\t}\n\t\t\t//op.time('Resolve chains');\n\t\t};\n\n\t\tif (!indexViolation) {\n\t\t\tif (self.willTrigger(self.TYPE_INSERT, self.PHASE_BEFORE) || self.willTrigger(self.TYPE_INSERT, self.PHASE_AFTER)) {\n\t\t\t\ttriggerOperation = {\n\t\t\t\t\ttype: 'insert'\n\t\t\t\t};\n\n\t\t\t\tif (self.processTrigger(triggerOperation, self.TYPE_INSERT, self.PHASE_BEFORE, {}, doc) !== false) {\n\t\t\t\t\tinsertMethod(doc);\n\n\t\t\t\t\tif (self.willTrigger(self.TYPE_INSERT, self.PHASE_AFTER)) {\n\t\t\t\t\t\t// Clone the doc so that the programmer cannot update the internal document\n\t\t\t\t\t\t// on the \"after\" phase trigger\n\t\t\t\t\t\tnewDoc = self.decouple(doc);\n\n\t\t\t\t\t\tself.processTrigger(triggerOperation, self.TYPE_INSERT, self.PHASE_AFTER, {}, newDoc);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// The trigger just wants to cancel the operation\n\t\t\t\t\treturn 'Trigger cancelled operation';\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// No triggers to execute\n\t\t\t\tinsertMethod(doc);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn 'Index violation in index: ' + indexViolation;\n\t\t}\n\t}\n\n\treturn 'No document passed to insert';\n};\n\n/**\n * Inserts a document into the internal collection data array at\n * Inserts a document into the internal collection data array at\n * the specified index.\n * @param {number} index The index to insert at.\n * @param {object} doc The document to insert.\n * @private\n */\nCollection.prototype._dataInsertAtIndex = function (index, doc) {\n\tthis._data.splice(index, 0, doc);\n};\n\n/**\n * Removes a document from the internal collection data array at\n * the specified index.\n * @param {number} index The index to remove from.\n * @private\n */\nCollection.prototype._dataRemoveAtIndex = function (index) {\n\tthis._data.splice(index, 1);\n};\n\n/**\n * Replaces all data in the collection's internal data array with\n * the passed array of data.\n * @param {array} data The array of data to replace existing data with.\n * @private\n */\nCollection.prototype._dataReplace = function (data) {\n\t// Clear the array - using a while loop with pop is by far the\n\t// fastest way to clear an array currently\n\twhile (this._data.length) {\n\t\tthis._data.pop();\n\t}\n\n\t// Append new items to the array\n\tthis._data = this._data.concat(data);\n};\n\n/**\n * Inserts a document into the collection indexes.\n * @param {Object} doc The document to insert.\n * @private\n */\nCollection.prototype._insertIntoIndexes = function (doc) {\n\tvar arr = this._indexByName,\n\t\tarrIndex,\n\t\tviolated,\n\t\thash = this.hash(doc),\n\t\tpk = this._primaryKey;\n\n\t// Insert to primary key index\n\tviolated = this._primaryIndex.uniqueSet(doc[pk], doc);\n\tthis._primaryCrc.uniqueSet(doc[pk], hash);\n\tthis._crcLookup.uniqueSet(hash, doc);\n\n\t// Insert into other indexes\n\tfor (arrIndex in arr) {\n\t\tif (arr.hasOwnProperty(arrIndex)) {\n\t\t\tarr[arrIndex].insert(doc);\n\t\t}\n\t}\n\n\treturn violated;\n};\n\n/**\n * Removes a document from the collection indexes.\n * @param {Object} doc The document to remove.\n * @private\n */\nCollection.prototype._removeFromIndexes = function (doc) {\n\tvar arr = this._indexByName,\n\t\tarrIndex,\n\t\thash = this.hash(doc),\n\t\tpk = this._primaryKey;\n\n\t// Remove from primary key index\n\tthis._primaryIndex.unSet(doc[pk]);\n\tthis._primaryCrc.unSet(doc[pk]);\n\tthis._crcLookup.unSet(hash);\n\n\t// Remove from other indexes\n\tfor (arrIndex in arr) {\n\t\tif (arr.hasOwnProperty(arrIndex)) {\n\t\t\tarr[arrIndex].remove(doc);\n\t\t}\n\t}\n};\n\n/**\n * Updates collection index data for the passed document.\n * @param {Object} oldDoc The old document as it was before the update.\n * @param {Object} newDoc The document as it now is after the update.\n * @private\n */\nCollection.prototype._updateIndexes = function (oldDoc, newDoc) {\n\tthis._removeFromIndexes(oldDoc);\n\tthis._insertIntoIndexes(newDoc);\n};\n\n/**\n * Rebuild collection indexes.\n * @private\n */\nCollection.prototype._rebuildIndexes = function () {\n\tvar arr = this._indexByName,\n\t\tarrIndex;\n\n\t// Remove from other indexes\n\tfor (arrIndex in arr) {\n\t\tif (arr.hasOwnProperty(arrIndex)) {\n\t\t\tarr[arrIndex].rebuild();\n\t\t}\n\t}\n};\n\n/**\n * Uses the passed query to generate a new collection with results\n * matching the query parameters.\n *\n * @param {Object} query The query object to generate the subset with.\n * @param {Object=} options An options object.\n * @returns {*}\n */\nCollection.prototype.subset = function (query, options) {\n\tvar result = this.find(query, options),\n\t\tcoll;\n\n\tcoll = new Collection();\n\tcoll.db(this._db);\n\n\tcoll.subsetOf(this)\n\t\t.primaryKey(this._primaryKey)\n\t\t.setData(result);\n\n\treturn coll;\n};\n\n/**\n * Gets / sets the collection that this collection is a subset of.\n * @param {Collection=} collection The collection to set as the parent of this subset.\n * @returns {Collection}\n */\nShared.synthesize(Collection.prototype, 'subsetOf');\n\n/**\n * Checks if the collection is a subset of the passed collection.\n * @param {Collection} collection The collection to test against.\n * @returns {Boolean} True if the passed collection is the parent of\n * the current collection.\n */\nCollection.prototype.isSubsetOf = function (collection) {\n\treturn this._subsetOf === collection;\n};\n\n/**\n * Find the distinct values for a specified field across a single collection and\n * returns the results in an array.\n * @param {String} key The field path to return distinct values for e.g. \"person.name\".\n * @param {Object=} query The query to use to filter the documents used to return values from.\n * @param {Object=} options The query options to use when running the query.\n * @returns {Array}\n */\nCollection.prototype.distinct = function (key, query, options) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\tvar data = this.find(query, options),\n\t\tpathSolver = new Path(key),\n\t\tvalueUsed = {},\n\t\tdistinctValues = [],\n\t\tvalue,\n\t\ti;\n\n\t// Loop the data and build array of distinct values\n\tfor (i = 0; i < data.length; i++) {\n\t\tvalue = pathSolver.value(data[i])[0];\n\n\t\tif (value && !valueUsed[value]) {\n\t\t\tvalueUsed[value] = true;\n\t\t\tdistinctValues.push(value);\n\t\t}\n\t}\n\n\treturn distinctValues;\n};\n\n/**\n * Helper method to find a document by it's id.\n * @param {String} id The id of the document.\n * @param {Object=} options The options object, allowed keys are sort and limit.\n * @returns {Array} The items that were updated.\n */\nCollection.prototype.findById = function (id, options) {\n\tvar searchObj = {};\n\tsearchObj[this._primaryKey] = id;\n\treturn this.find(searchObj, options)[0];\n};\n\n/**\n * Finds all documents that contain the passed string or search object\n * regardless of where the string might occur within the document. This\n * will match strings from the start, middle or end of the document's\n * string (partial match).\n * @param search The string to search for. Case sensitive.\n * @param options A standard find() options object.\n * @returns {Array} An array of documents that matched the search string.\n */\nCollection.prototype.peek = function (search, options) {\n\t// Loop all items\n\tvar arr = this._data,\n\t\tarrCount = arr.length,\n\t\tarrIndex,\n\t\tarrItem,\n\t\ttempColl = new Collection(),\n\t\ttypeOfSearch = typeof search;\n\n\tif (typeOfSearch === 'string') {\n\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t// Get json representation of object\n\t\t\tarrItem = this.jStringify(arr[arrIndex]);\n\n\t\t\t// Check if string exists in object json\n\t\t\tif (arrItem.indexOf(search) > -1) {\n\t\t\t\t// Add this item to the temp collection\n\t\t\t\ttempColl.insert(arr[arrIndex]);\n\t\t\t}\n\t\t}\n\n\t\treturn tempColl.find({}, options);\n\t} else {\n\t\treturn this.find(search, options);\n\t}\n};\n\n/**\n * Provides a query plan / operations log for a query.\n * @param {Object} query The query to execute.\n * @param {Object=} options Optional options object.\n * @returns {Object} The query plan.\n */\nCollection.prototype.explain = function (query, options) {\n\tvar result = this.find(query, options);\n\treturn result.__fdbOp._data;\n};\n\n/**\n * Generates an options object with default values or adds default\n * values to a passed object if those values are not currently set\n * to anything.\n * @param {object=} obj Optional options object to modify.\n * @returns {object} The options object.\n */\nCollection.prototype.options = function (obj) {\n\tobj = obj || {};\n\tobj.$decouple = obj.$decouple !== undefined ? obj.$decouple : true;\n\tobj.$explain = obj.$explain !== undefined ? obj.$explain : false;\n\t\n\treturn obj;\n};\n\n/**\n * Queries the collection based on the query object passed.\n * @param {Object} query The query key/values that a document must match in\n * order for it to be returned in the result array.\n * @param {Object=} options An optional options object.\n * @param {Function=} callback !! DO NOT USE, THIS IS NON-OPERATIONAL !!\n * Optional callback. If specified the find process\n * will not return a value and will assume that you wish to operate under an\n * async mode. This will break up large find requests into smaller chunks and\n * process them in a non-blocking fashion allowing large datasets to be queried\n * without causing the browser UI to pause. Results from this type of operation\n * will be passed back to the callback once completed.\n *\n * @returns {Array} The results array from the find operation, containing all\n * documents that matched the query.\n */\nCollection.prototype.find = function (query, options, callback) {\n\t// Convert queries from mongo dot notation to forerunner queries\n\tif (this.mongoEmulation()) {\n\t\tthis.convertToFdb(query);\n\t}\n\n\tif (callback) {\n\t\t// Check the size of the collection's data array\n\n\t\t// Split operation into smaller tasks and callback when complete\n\t\tcallback.call(this, 'Callbacks for the find() operation are not yet implemented!', []);\n\t\treturn [];\n\t}\n\n\treturn this._find.call(this, query, options, callback);\n};\n\nCollection.prototype._find = function (query, options) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\t// TODO: This method is quite long, break into smaller pieces\n\tquery = query || {};\n\n\tvar op = this._metrics.create('find'),\n\t\tpk = this.primaryKey(),\n\t\tself = this,\n\t\tanalysis,\n\t\tscanLength,\n\t\trequiresTableScan = true,\n\t\tresultArr,\n\t\tjoinIndex,\n\t\tjoinSource = {},\n\t\tjoinQuery,\n\t\tjoinPath,\n\t\tjoinSourceKey,\n\t\tjoinSourceType,\n\t\tjoinSourceIdentifier,\n\t\tjoinSourceData,\n\t\tresultRemove = [],\n\t\ti, j, k,\n\t\tfieldListOn = [],\n\t\tfieldListOff = [],\n\t\telemMatchPathSolver,\n\t\telemMatchSubArr,\n\t\telemMatchSpliceArr,\n\t\tmatcherTmpOptions = {},\n\t\tresult,\n\t\tcursor = {},\n\t\tpathSolver,\n\t\twaterfallCollection,\n\t\tmatcher;\n\n\tif (!(options instanceof Array)) {\n\t\toptions = this.options(options);\n\t}\n\n\tmatcher = function (doc) {\n\t\treturn self._match(doc, query, options, 'and', matcherTmpOptions);\n\t};\n\n\top.start();\n\tif (query) {\n\t\t// Check if the query is an array (multi-operation waterfall query)\n\t\tif (query instanceof Array) {\n\t\t\twaterfallCollection = this;\n\n\t\t\t// Loop the query operations\n\t\t\tfor (i = 0; i < query.length; i++) {\n\t\t\t\t// Execute each operation and pass the result into the next\n\t\t\t\t// query operation\n\t\t\t\twaterfallCollection = waterfallCollection.subset(query[i], options && options[i] ? options[i] : {});\n\t\t\t}\n\n\t\t\treturn waterfallCollection.find();\n\t\t}\n\n\t\t// Pre-process any data-changing query operators first\n\t\tif (query.$findSub) {\n\t\t\t// Check we have all the parts we need\n\t\t\tif (!query.$findSub.$path) {\n\t\t\t\tthrow('$findSub missing $path property!');\n\t\t\t}\n\n\t\t\treturn this.findSub(\n\t\t\t\tquery.$findSub.$query,\n\t\t\t\tquery.$findSub.$path,\n\t\t\t\tquery.$findSub.$subQuery,\n\t\t\t\tquery.$findSub.$subOptions\n\t\t\t);\n\t\t}\n\n\t\tif (query.$findSubOne) {\n\t\t\t// Check we have all the parts we need\n\t\t\tif (!query.$findSubOne.$path) {\n\t\t\t\tthrow('$findSubOne missing $path property!');\n\t\t\t}\n\n\t\t\treturn this.findSubOne(\n\t\t\t\tquery.$findSubOne.$query,\n\t\t\t\tquery.$findSubOne.$path,\n\t\t\t\tquery.$findSubOne.$subQuery,\n\t\t\t\tquery.$findSubOne.$subOptions\n\t\t\t);\n\t\t}\n\n\t\t// Get query analysis to execute best optimised code path\n\t\top.time('analyseQuery');\n\t\tanalysis = this._analyseQuery(self.decouple(query), options, op);\n\t\top.time('analyseQuery');\n\t\top.data('analysis', analysis);\n\n\t\t// Check if the query tries to limit by data that would only exist after\n\t\t// the join operation has been completed\n\t\tif (analysis.hasJoin && analysis.queriesJoin) {\n\t\t\t// The query has a join and tries to limit by it's joined data\n\t\t\t// Get references to the join sources\n\t\t\top.time('joinReferences');\n\t\t\tfor (joinIndex = 0; joinIndex < analysis.joinsOn.length; joinIndex++) {\n\t\t\t\tjoinSourceData = analysis.joinsOn[joinIndex];\n\t\t\t\tjoinSourceKey = joinSourceData.key;\n\n\t\t\t\tjoinSourceType = joinSourceData.type;\n\t\t\t\tjoinSourceIdentifier = joinSourceData.id;\n\n\t\t\t\tjoinPath = new Path(analysis.joinQueries[joinSourceKey]);\n\t\t\t\tjoinQuery = joinPath.value(query)[0];\n\n\t\t\t\tjoinSource[joinSourceIdentifier] = this._db[joinSourceType](joinSourceKey).subset(joinQuery);\n\n\t\t\t\t// Remove join clause from main query\n\t\t\t\tdelete query[analysis.joinQueries[joinSourceKey]];\n\t\t\t}\n\t\t\top.time('joinReferences');\n\t\t}\n\n\t\t// Check if an index lookup can be used to return this result\n\t\tif (analysis.indexMatch.length && (!options || (options && !options.$skipIndex))) {\n\t\t\top.data('index.potential', analysis.indexMatch);\n\t\t\top.data('index.used', analysis.indexMatch[0].index);\n\n\t\t\t// Get the data from the index\n\t\t\top.time('indexLookup');\n\t\t\tresultArr = analysis.indexMatch[0].lookup || [];\n\t\t\top.time('indexLookup');\n\n\t\t\t// Check if the index coverage is all keys, if not we still need to table scan it\n\t\t\tif (analysis.indexMatch[0].keyData.totalKeyCount === analysis.indexMatch[0].keyData.score) {\n\t\t\t\t// Don't require a table scan to find relevant documents\n\t\t\t\trequiresTableScan = false;\n\t\t\t}\n\t\t} else {\n\t\t\top.flag('usedIndex', false);\n\t\t}\n\n\t\tif (requiresTableScan) {\n\t\t\tif (resultArr && resultArr.length) {\n\t\t\t\tscanLength = resultArr.length;\n\t\t\t\top.time('tableScan: ' + scanLength);\n\t\t\t\t// Filter the source data and return the result\n\t\t\t\tresultArr = resultArr.filter(matcher);\n\t\t\t} else {\n\t\t\t\t// Filter the source data and return the result\n\t\t\t\tscanLength = this._data.length;\n\t\t\t\top.time('tableScan: ' + scanLength);\n\t\t\t\tresultArr = this._data.filter(matcher);\n\t\t\t}\n\n\t\t\top.time('tableScan: ' + scanLength);\n\t\t}\n\n\t\t// Order the array if we were passed a sort clause\n\t\tif (options.$orderBy) {\n\t\t\top.time('sort');\n\t\t\tresultArr = this.sort(options.$orderBy, resultArr);\n\t\t\top.time('sort');\n\t\t}\n\n\t\tif (options.$page !== undefined && options.$limit !== undefined) {\n\t\t\t// Record paging data\n\t\t\tcursor.page = options.$page;\n\t\t\tcursor.pages = Math.ceil(resultArr.length / options.$limit);\n\t\t\tcursor.records = resultArr.length;\n\n\t\t\t// Check if we actually need to apply the paging logic\n\t\t\tif (options.$page && options.$limit > 0) {\n\t\t\t\top.data('cursor', cursor);\n\n\t\t\t\t// Skip to the page specified based on limit\n\t\t\t\tresultArr.splice(0, options.$page * options.$limit);\n\t\t\t}\n\t\t}\n\n\t\tif (options.$skip) {\n\t\t\tcursor.skip = options.$skip;\n\n\t\t\t// Skip past the number of records specified\n\t\t\tresultArr.splice(0, options.$skip);\n\t\t\top.data('skip', options.$skip);\n\t\t}\n\n\t\tif (options.$limit && resultArr && resultArr.length > options.$limit) {\n\t\t\tcursor.limit = options.$limit;\n\n\t\t\tresultArr.length = options.$limit;\n\t\t\top.data('limit', options.$limit);\n\t\t}\n\n\t\tif (options.$decouple) {\n\t\t\t// Now decouple the data from the original objects\n\t\t\top.time('decouple');\n\t\t\tresultArr = this.decouple(resultArr);\n\t\t\top.time('decouple');\n\t\t\top.data('flag.decouple', true);\n\t\t}\n\n\t\t// Now process any joins on the final data\n\t\tif (options.$join) {\n\t\t\tresultRemove = resultRemove.concat(this.applyJoin(resultArr, options.$join, joinSource));\n\t\t\top.data('flag.join', true);\n\t\t}\n\n\t\t// Process removal queue\n\t\tif (resultRemove.length) {\n\t\t\top.time('removalQueue');\n\t\t\tthis.spliceArrayByIndexList(resultArr, resultRemove);\n\t\t\top.time('removalQueue');\n\t\t}\n\n\t\tif (options.$transform) {\n\t\t\top.time('transform');\n\t\t\tfor (i = 0; i < resultArr.length; i++) {\n\t\t\t\tresultArr.splice(i, 1, options.$transform(resultArr[i]));\n\t\t\t}\n\t\t\top.time('transform');\n\t\t\top.data('flag.transform', true);\n\t\t}\n\n\t\t// Process transforms\n\t\tif (this._transformEnabled && this._transformOut) {\n\t\t\top.time('transformOut');\n\t\t\tresultArr = this.transformOut(resultArr);\n\t\t\top.time('transformOut');\n\t\t}\n\n\t\top.data('results', resultArr.length);\n\t} else {\n\t\tresultArr = [];\n\t}\n\n\t// Check for an $as operator in the options object and if it exists\n\t// iterate over the fields and generate a rename function that will\n\t// operate over the entire returned data array and rename each object's\n\t// fields to their new names\n\t// TODO: Enable $as in collection find to allow renaming fields\n\t/*if (options.$as) {\n\t\trenameFieldPath = new Path();\n\t\trenameFieldMethod = function (obj, oldFieldPath, newFieldName) {\n\t\t\trenameFieldPath.path(oldFieldPath);\n\t\t\trenameFieldPath.rename(newFieldName);\n\t\t};\n\n\t\tfor (i in options.$as) {\n\t\t\tif (options.$as.hasOwnProperty(i)) {\n\n\t\t\t}\n\t\t}\n\t}*/\n\n\tif (!options.$aggregate) {\n\t\t// Generate a list of fields to limit data by\n\t\t// Each property starts off being enabled by default (= 1) then\n\t\t// if any property is explicitly specified as 1 then all switch to\n\t\t// zero except _id.\n\t\t//\n\t\t// Any that are explicitly set to zero are switched off.\n\t\top.time('scanFields');\n\t\tfor (i in options) {\n\t\t\tif (options.hasOwnProperty(i) && i.indexOf('$') !== 0) {\n\t\t\t\tif (options[i] === 1) {\n\t\t\t\t\tfieldListOn.push(i);\n\t\t\t\t} else if (options[i] === 0) {\n\t\t\t\t\tfieldListOff.push(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\top.time('scanFields');\n\n\t\t// Limit returned fields by the options data\n\t\tif (fieldListOn.length || fieldListOff.length) {\n\t\t\top.data('flag.limitFields', true);\n\t\t\top.data('limitFields.on', fieldListOn);\n\t\t\top.data('limitFields.off', fieldListOff);\n\n\t\t\top.time('limitFields');\n\n\t\t\t// We have explicit fields switched on or off\n\t\t\tfor (i = 0; i < resultArr.length; i++) {\n\t\t\t\tresult = resultArr[i];\n\n\t\t\t\tfor (j in result) {\n\t\t\t\t\tif (result.hasOwnProperty(j)) {\n\t\t\t\t\t\tif (fieldListOn.length) {\n\t\t\t\t\t\t\t// We have explicit fields switched on so remove all fields\n\t\t\t\t\t\t\t// that are not explicitly switched on\n\n\t\t\t\t\t\t\t// Check if the field name is not the primary key\n\t\t\t\t\t\t\tif (j !== pk) {\n\t\t\t\t\t\t\t\tif (fieldListOn.indexOf(j) === -1) {\n\t\t\t\t\t\t\t\t\t// This field is not in the on list, remove it\n\t\t\t\t\t\t\t\t\tdelete result[j];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (fieldListOff.length) {\n\t\t\t\t\t\t\t// We have explicit fields switched off so remove fields\n\t\t\t\t\t\t\t// that are explicitly switched off\n\t\t\t\t\t\t\tif (fieldListOff.indexOf(j) > -1) {\n\t\t\t\t\t\t\t\t// This field is in the off list, remove it\n\t\t\t\t\t\t\t\tdelete result[j];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\top.time('limitFields');\n\t\t}\n\n\t\t// Now run any projections on the data required\n\t\tif (options.$elemMatch) {\n\t\t\top.data('flag.elemMatch', true);\n\t\t\top.time('projection-elemMatch');\n\n\t\t\tfor (i in options.$elemMatch) {\n\t\t\t\tif (options.$elemMatch.hasOwnProperty(i)) {\n\t\t\t\t\telemMatchPathSolver = new Path(i);\n\n\t\t\t\t\t// Loop the results array\n\t\t\t\t\tfor (j = 0; j < resultArr.length; j++) {\n\t\t\t\t\t\telemMatchSubArr = elemMatchPathSolver.value(resultArr[j])[0];\n\n\t\t\t\t\t\t// Check we have a sub-array to loop\n\t\t\t\t\t\tif (elemMatchSubArr && elemMatchSubArr.length) {\n\n\t\t\t\t\t\t\t// Loop the sub-array and check for projection query matches\n\t\t\t\t\t\t\tfor (k = 0; k < elemMatchSubArr.length; k++) {\n\n\t\t\t\t\t\t\t\t// Check if the current item in the sub-array matches the projection query\n\t\t\t\t\t\t\t\tif (self._match(elemMatchSubArr[k], options.$elemMatch[i], options, '', {})) {\n\t\t\t\t\t\t\t\t\t// The item matches the projection query so set the sub-array\n\t\t\t\t\t\t\t\t\t// to an array that ONLY contains the matching item and then\n\t\t\t\t\t\t\t\t\t// exit the loop since we only want to match the first item\n\t\t\t\t\t\t\t\t\telemMatchPathSolver.set(resultArr[j], i, [elemMatchSubArr[k]]);\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\top.time('projection-elemMatch');\n\t\t}\n\n\t\tif (options.$elemsMatch) {\n\t\t\top.data('flag.elemsMatch', true);\n\t\t\top.time('projection-elemsMatch');\n\n\t\t\tfor (i in options.$elemsMatch) {\n\t\t\t\tif (options.$elemsMatch.hasOwnProperty(i)) {\n\t\t\t\t\telemMatchPathSolver = new Path(i);\n\n\t\t\t\t\t// Loop the results array\n\t\t\t\t\tfor (j = 0; j < resultArr.length; j++) {\n\t\t\t\t\t\telemMatchSubArr = elemMatchPathSolver.value(resultArr[j])[0];\n\n\t\t\t\t\t\t// Check we have a sub-array to loop\n\t\t\t\t\t\tif (elemMatchSubArr && elemMatchSubArr.length) {\n\t\t\t\t\t\t\telemMatchSpliceArr = [];\n\n\t\t\t\t\t\t\t// Loop the sub-array and check for projection query matches\n\t\t\t\t\t\t\tfor (k = 0; k < elemMatchSubArr.length; k++) {\n\n\t\t\t\t\t\t\t\t// Check if the current item in the sub-array matches the projection query\n\t\t\t\t\t\t\t\tif (self._match(elemMatchSubArr[k], options.$elemsMatch[i], options, '', {})) {\n\t\t\t\t\t\t\t\t\t// The item matches the projection query so add it to the final array\n\t\t\t\t\t\t\t\t\telemMatchSpliceArr.push(elemMatchSubArr[k]);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Now set the final sub-array to the matched items\n\t\t\t\t\t\t\telemMatchPathSolver.set(resultArr[j], i, elemMatchSpliceArr);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\top.time('projection-elemsMatch');\n\t\t}\n\t}\n\n\t// Process aggregation\n\tif (options.$aggregate) {\n\t\top.data('flag.aggregate', true);\n\t\top.time('aggregate');\n\t\tpathSolver = new Path(options.$aggregate);\n\t\tresultArr = pathSolver.value(resultArr);\n\t\top.time('aggregate');\n\t}\n\n\top.stop();\n\tresultArr.__fdbOp = op;\n\tresultArr.$cursor = cursor;\n\treturn resultArr;\n};\n\n/**\n * Returns one document that satisfies the specified query criteria. If multiple\n * documents satisfy the query, this method returns the first document to match\n * the query.\n * @returns {*}\n */\nCollection.prototype.findOne = function () {\n\treturn (this.find.apply(this, arguments))[0];\n};\n\n/**\n * Gets the index in the collection data array of the first item matched by\n * the passed query object.\n * @param {Object} query The query to run to find the item to return the index of.\n * @param {Object=} options An options object.\n * @returns {Number}\n */\nCollection.prototype.indexOf = function (query, options) {\n\tvar item = this.find(query, {$decouple: false})[0],\n\t\tsortedData;\n\n\tif (item) {\n\t\tif (!options || options && !options.$orderBy) {\n\t\t\t// Basic lookup from order of insert\n\t\t\treturn this._data.indexOf(item);\n\t\t} else {\n\t\t\t// Trying to locate index based on query with sort order\n\t\t\toptions.$decouple = false;\n\t\t\tsortedData = this.find(query, options);\n\n\t\t\treturn sortedData.indexOf(item);\n\t\t}\n\t}\n\n\treturn -1;\n};\n\n/**\n * Returns the index of the document identified by the passed item's primary key.\n * @param {*} itemLookup The document whose primary key should be used to lookup\n * or the id to lookup.\n * @param {Object=} options An options object.\n * @returns {Number} The index the item with the matching primary key is occupying.\n */\nCollection.prototype.indexOfDocById = function (itemLookup, options) {\n\tvar item,\n\t\tsortedData;\n\n\tif (typeof itemLookup !== 'object') {\n\t\titem = this._primaryIndex.get(itemLookup);\n\t} else {\n\t\titem = this._primaryIndex.get(itemLookup[this._primaryKey]);\n\t}\n\n\tif (item) {\n\t\tif (!options || options && !options.$orderBy) {\n\t\t\t// Basic lookup\n\t\t\treturn this._data.indexOf(item);\n\t\t} else {\n\t\t\t// Sorted lookup\n\t\t\toptions.$decouple = false;\n\t\t\tsortedData = this.find({}, options);\n\n\t\t\treturn sortedData.indexOf(item);\n\t\t}\n\t}\n\n\treturn -1;\n};\n\n/**\n * Removes a document from the collection by it's index in the collection's\n * data array.\n * @param {Number} index The index of the document to remove.\n * @returns {Object} The document that has been removed or false if none was\n * removed.\n */\nCollection.prototype.removeByIndex = function (index) {\n\tvar doc,\n\t\tdocId;\n\n\tdoc = this._data[index];\n\n\tif (doc !== undefined) {\n\t\tdoc = this.decouple(doc);\n\t\tdocId = doc[this.primaryKey()];\n\n\t\treturn this.removeById(docId);\n\t}\n\n\treturn false;\n};\n\n/**\n * Gets / sets the collection transform options.\n * @param {Object} obj A collection transform options object.\n * @returns {*}\n */\nCollection.prototype.transform = function (obj) {\n\tif (obj !== undefined) {\n\t\tif (typeof obj === \"object\") {\n\t\t\tif (obj.enabled !== undefined) {\n\t\t\t\tthis._transformEnabled = obj.enabled;\n\t\t\t}\n\n\t\t\tif (obj.dataIn !== undefined) {\n\t\t\t\tthis._transformIn = obj.dataIn;\n\t\t\t}\n\n\t\t\tif (obj.dataOut !== undefined) {\n\t\t\t\tthis._transformOut = obj.dataOut;\n\t\t\t}\n\t\t} else {\n\t\t\tthis._transformEnabled = obj !== false;\n\t\t}\n\n\t\treturn this;\n\t}\n\n\treturn {\n\t\tenabled: this._transformEnabled,\n\t\tdataIn: this._transformIn,\n\t\tdataOut: this._transformOut\n\t};\n};\n\n/**\n * Transforms data using the set transformIn method.\n * @param {Object} data The data to transform.\n * @returns {*}\n */\nCollection.prototype.transformIn = function (data) {\n\tif (this._transformEnabled && this._transformIn) {\n\t\tif (data instanceof Array) {\n\t\t\tvar finalArr = [],\n\t\t\t\ttransformResult,\n\t\t\t\ti;\n\n\t\t\tfor (i = 0; i < data.length; i++) {\n\t\t\t\ttransformResult = this._transformIn(data[i]);\n\n\t\t\t\t// Support transforms returning multiple items\n\t\t\t\tif (transformResult instanceof Array) {\n\t\t\t\t\tfinalArr = finalArr.concat(transformResult);\n\t\t\t\t} else {\n\t\t\t\t\tfinalArr.push(transformResult);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn finalArr;\n\t\t} else {\n\t\t\treturn this._transformIn(data);\n\t\t}\n\t}\n\n\treturn data;\n};\n\n/**\n * Transforms data using the set transformOut method.\n * @param {Object} data The data to transform.\n * @returns {*}\n */\nCollection.prototype.transformOut = function (data) {\n\tif (this._transformEnabled && this._transformOut) {\n\t\tif (data instanceof Array) {\n\t\t\tvar finalArr = [],\n\t\t\t\ttransformResult,\n\t\t\t\ti;\n\n\t\t\tfor (i = 0; i < data.length; i++) {\n\t\t\t\ttransformResult = this._transformOut(data[i]);\n\n\t\t\t\t// Support transforms returning multiple items\n\t\t\t\tif (transformResult instanceof Array) {\n\t\t\t\t\tfinalArr = finalArr.concat(transformResult);\n\t\t\t\t} else {\n\t\t\t\t\tfinalArr.push(transformResult);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn finalArr;\n\t\t} else {\n\t\t\treturn this._transformOut(data);\n\t\t}\n\t}\n\n\treturn data;\n};\n\n/**\n * Sorts an array of documents by the given sort path.\n * @param {*} sortObj The keys and orders the array objects should be sorted by.\n * @param {Array} arr The array of documents to sort.\n * @returns {Array}\n */\nCollection.prototype.sort = function (sortObj, arr) {\n\t// Convert the index object to an array of key val objects\n\tvar self = this,\n\t\tkeys = sharedPathSolver.parse(sortObj, true);\n\n\tif (keys.length) {\n\t\t// Execute sort\n\t\tarr.sort(function (a, b) {\n\t\t\t// Loop the index array\n\t\t\tvar i,\n\t\t\t\tindexData,\n\t\t\t\tresult = 0;\n\n\t\t\tfor (i = 0; i < keys.length; i++) {\n\t\t\t\tindexData = keys[i];\n\n\t\t\t\tif (indexData.value === 1) {\n\t\t\t\t\tresult = self.sortAsc(sharedPathSolver.get(a, indexData.path), sharedPathSolver.get(b, indexData.path));\n\t\t\t\t} else if (indexData.value === -1) {\n\t\t\t\t\tresult = self.sortDesc(sharedPathSolver.get(a, indexData.path), sharedPathSolver.get(b, indexData.path));\n\t\t\t\t}\n\n\t\t\t\tif (result !== 0) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t});\n\t}\n\n\treturn arr;\n};\n\n// Commented as we have a new method that was originally implemented for binary trees.\n// This old method actually has problems with nested sort objects\n/*Collection.prototype.sortold = function (sortObj, arr) {\n\t// Make sure we have an array object\n\tarr = arr || [];\n\n\tvar\tsortArr = [],\n\t\tsortKey,\n\t\tsortSingleObj;\n\n\tfor (sortKey in sortObj) {\n\t\tif (sortObj.hasOwnProperty(sortKey)) {\n\t\t\tsortSingleObj = {};\n\t\t\tsortSingleObj[sortKey] = sortObj[sortKey];\n\t\t\tsortSingleObj.___fdbKey = String(sortKey);\n\t\t\tsortArr.push(sortSingleObj);\n\t\t}\n\t}\n\n\tif (sortArr.length < 2) {\n\t\t// There is only one sort criteria, do a simple sort and return it\n\t\treturn this._sort(sortObj, arr);\n\t} else {\n\t\treturn this._bucketSort(sortArr, arr);\n\t}\n};*/\n\n/**\n * Takes array of sort paths and sorts them into buckets before returning final\n * array fully sorted by multi-keys.\n * @param keyArr\n * @param arr\n * @returns {*}\n * @private\n */\n/*Collection.prototype._bucketSort = function (keyArr, arr) {\n\tvar keyObj = keyArr.shift(),\n\t\tarrCopy,\n\t\tbucketData,\n\t\tbucketOrder,\n\t\tbucketKey,\n\t\tbuckets,\n\t\ti,\n\t\tfinalArr = [];\n\n\tif (keyArr.length > 0) {\n\t\t// Sort array by bucket key\n\t\tarr = this._sort(keyObj, arr);\n\n\t\t// Split items into buckets\n\t\tbucketData = this.bucket(keyObj.___fdbKey, arr);\n\t\tbucketOrder = bucketData.order;\n\t\tbuckets = bucketData.buckets;\n\n\t\t// Loop buckets and sort contents\n\t\tfor (i = 0; i < bucketOrder.length; i++) {\n\t\t\tbucketKey = bucketOrder[i];\n\n\t\t\tarrCopy = [].concat(keyArr);\n\t\t\tfinalArr = finalArr.concat(this._bucketSort(arrCopy, buckets[bucketKey]));\n\t\t}\n\n\t\treturn finalArr;\n\t} else {\n\t\treturn this._sort(keyObj, arr);\n\t}\n};*/\n\n /**\n * Takes an array of objects and returns a new object with the array items\n * split into buckets by the passed key.\n * @param {String} key The key to split the array into buckets by.\n * @param {Array} arr An array of objects.\n * @returns {Object}\n */\n/*Collection.prototype.bucket = function (key, arr) {\n\tvar i,\n\t\t\toldField,\n\t\t\tfield,\n\t\t\tfieldArr = [],\n\t\t\tbuckets = {};\n\n\tfor (i = 0; i < arr.length; i++) {\n\t\tfield = String(arr[i][key]);\n\n\t\tif (oldField !== field) {\n\t\t\tfieldArr.push(field);\n\t\t\toldField = field;\n\t\t}\n\n\t\tbuckets[field] = buckets[field] || [];\n\t\tbuckets[field].push(arr[i]);\n\t}\n\n\treturn {\n\t\tbuckets: buckets,\n\t\torder: fieldArr\n\t};\n};*/\n\n/**\n * Sorts array by individual sort path.\n * @param key\n * @param arr\n * @returns {Array|*}\n * @private\n */\nCollection.prototype._sort = function (key, arr) {\n\tvar self = this,\n\t\tsorterMethod,\n\t\tpathSolver = new Path(),\n\t\tdataPath = pathSolver.parse(key, true)[0];\n\n\tpathSolver.path(dataPath.path);\n\n\tif (dataPath.value === 1) {\n\t\t// Sort ascending\n\t\tsorterMethod = function (a, b) {\n\t\t\tvar valA = pathSolver.value(a)[0],\n\t\t\t\tvalB = pathSolver.value(b)[0];\n\n\t\t\treturn self.sortAsc(valA, valB);\n\t\t};\n\t} else if (dataPath.value === -1) {\n\t\t// Sort descending\n\t\tsorterMethod = function (a, b) {\n\t\t\tvar valA = pathSolver.value(a)[0],\n\t\t\t\tvalB = pathSolver.value(b)[0];\n\n\t\t\treturn self.sortDesc(valA, valB);\n\t\t};\n\t} else {\n\t\tthrow(this.logIdentifier() + ' $orderBy clause has invalid direction: ' + dataPath.value + ', accepted values are 1 or -1 for ascending or descending!');\n\t}\n\n\treturn arr.sort(sorterMethod);\n};\n\n/**\n * Internal method that takes a search query and options and returns an object\n * containing details about the query which can be used to optimise the search.\n *\n * @param query\n * @param options\n * @param op\n * @returns {Object}\n * @private\n */\nCollection.prototype._analyseQuery = function (query, options, op) {\n\tvar analysis = {\n\t\t\tqueriesOn: [{id: '$collection.' + this._name, type: 'colletion', key: this._name}],\n\t\t\tindexMatch: [],\n\t\t\thasJoin: false,\n\t\t\tqueriesJoin: false,\n\t\t\tjoinQueries: {},\n\t\t\tquery: query,\n\t\t\toptions: options\n\t\t},\n\t\tjoinSourceIndex,\n\t\tjoinSourceKey,\n\t\tjoinSourceType,\n\t\tjoinSourceIdentifier,\n\t\tjoinMatch,\n\t\tjoinSources = [],\n\t\tjoinSourceReferences = [],\n\t\tqueryPath,\n\t\tindex,\n\t\tindexMatchData,\n\t\tindexRef,\n\t\tindexRefName,\n\t\tindexLookup,\n\t\tpathSolver,\n\t\tqueryKeyCount,\n\t\tpkQueryType,\n\t\tlookupResult,\n\t\ti;\n\n\t// Check if the query is a primary key lookup\n\top.time('checkIndexes');\n\tpathSolver = new Path();\n\tqueryKeyCount = pathSolver.parseArr(query, {\n\t\tignore:/\\$/,\n\t\tverbose: true\n\t}).length;\n\n\tif (queryKeyCount) {\n\t\tif (query[this._primaryKey] !== undefined) {\n\t\t\t// Check suitability of querying key value index\n\t\t\tpkQueryType = typeof query[this._primaryKey];\n\n\t\t\tif (pkQueryType === 'string' || pkQueryType === 'number' || query[this._primaryKey] instanceof Array) {\n\t\t\t\t// Return item via primary key possible\n\t\t\t\top.time('checkIndexMatch: Primary Key');\n\t\t\t\tlookupResult = this._primaryIndex.lookup(query, options);\n\n\t\t\t\tanalysis.indexMatch.push({\n\t\t\t\t\tlookup: lookupResult,\n\t\t\t\t\tkeyData: {\n\t\t\t\t\t\tmatchedKeys: [this._primaryKey],\n\t\t\t\t\t\ttotalKeyCount: queryKeyCount,\n\t\t\t\t\t\tscore: 1\n\t\t\t\t\t},\n\t\t\t\t\tindex: this._primaryIndex\n\t\t\t\t});\n\t\t\t\top.time('checkIndexMatch: Primary Key');\n\t\t\t}\n\t\t}\n\n\t\t// Check if an index can speed up the query\n\t\tfor (i in this._indexById) {\n\t\t\tif (this._indexById.hasOwnProperty(i)) {\n\t\t\t\tindexRef = this._indexById[i];\n\t\t\t\tindexRefName = indexRef.name();\n\n\t\t\t\top.time('checkIndexMatch: ' + indexRefName);\n\t\t\t\tindexMatchData = indexRef.match(query, options);\n\n\t\t\t\tif (indexMatchData.score > 0) {\n\t\t\t\t\t// This index can be used, store it\n\t\t\t\t\tindexLookup = indexRef.lookup(query, options);\n\n\t\t\t\t\tanalysis.indexMatch.push({\n\t\t\t\t\t\tlookup: indexLookup,\n\t\t\t\t\t\tkeyData: indexMatchData,\n\t\t\t\t\t\tindex: indexRef\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\top.time('checkIndexMatch: ' + indexRefName);\n\n\t\t\t\tif (indexMatchData.score === queryKeyCount) {\n\t\t\t\t\t// Found an optimal index, do not check for any more\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\top.time('checkIndexes');\n\n\t\t// Sort array descending on index key count (effectively a measure of relevance to the query)\n\t\tif (analysis.indexMatch.length > 1) {\n\t\t\top.time('findOptimalIndex');\n\t\t\tanalysis.indexMatch.sort(function (a, b) {\n\t\t\t\tif (a.keyData.score > b.keyData.score) {\n\t\t\t\t\t// This index has a higher score than the other\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\n\t\t\t\tif (a.keyData.score < b.keyData.score) {\n\t\t\t\t\t// This index has a lower score than the other\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\n\t\t\t\t// The indexes have the same score but can still be compared by the number of records\n\t\t\t\t// they return from the query. The fewer records they return the better so order by\n\t\t\t\t// record count\n\t\t\t\tif (a.keyData.score === b.keyData.score) {\n\t\t\t\t\treturn a.lookup.length - b.lookup.length;\n\t\t\t\t}\n\t\t\t});\n\t\t\top.time('findOptimalIndex');\n\t\t}\n\t}\n\n\t// Check for join data\n\tif (options.$join) {\n\t\tanalysis.hasJoin = true;\n\n\t\t// Loop all join operations\n\t\tfor (joinSourceIndex = 0; joinSourceIndex < options.$join.length; joinSourceIndex++) {\n\t\t\t// Loop the join sources and keep a reference to them\n\t\t\tfor (joinSourceKey in options.$join[joinSourceIndex]) {\n\t\t\t\tif (options.$join[joinSourceIndex].hasOwnProperty(joinSourceKey)) {\n\t\t\t\t\tjoinMatch = options.$join[joinSourceIndex][joinSourceKey];\n\n\t\t\t\t\tjoinSourceType = joinMatch.$sourceType || 'collection';\n\t\t\t\t\tjoinSourceIdentifier = '$' + joinSourceType + '.' + joinSourceKey;\n\n\t\t\t\t\tjoinSources.push({\n\t\t\t\t\t\tid: joinSourceIdentifier,\n\t\t\t\t\t\ttype: joinSourceType,\n\t\t\t\t\t\tkey: joinSourceKey\n\t\t\t\t\t});\n\n\t\t\t\t\t// Check if the join uses an $as operator\n\t\t\t\t\tif (options.$join[joinSourceIndex][joinSourceKey].$as !== undefined) {\n\t\t\t\t\t\tjoinSourceReferences.push(options.$join[joinSourceIndex][joinSourceKey].$as);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tjoinSourceReferences.push(joinSourceKey);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Loop the join source references and determine if the query references\n\t\t// any of the sources that are used in the join. If there no queries against\n\t\t// joined sources the find method can use a code path optimised for this.\n\n\t\t// Queries against joined sources requires the joined sources to be filtered\n\t\t// first and then joined so requires a little more work.\n\t\tfor (index = 0; index < joinSourceReferences.length; index++) {\n\t\t\t// Check if the query references any source data that the join will create\n\t\t\tqueryPath = this._queryReferencesSource(query, joinSourceReferences[index], '');\n\n\t\t\tif (queryPath) {\n\t\t\t\tanalysis.joinQueries[joinSources[index].key] = queryPath;\n\t\t\t\tanalysis.queriesJoin = true;\n\t\t\t}\n\t\t}\n\n\t\tanalysis.joinsOn = joinSources;\n\t\tanalysis.queriesOn = analysis.queriesOn.concat(joinSources);\n\t}\n\n\treturn analysis;\n};\n\n/**\n * Checks if the passed query references a source object (such\n * as a collection) by name.\n * @param {Object} query The query object to scan.\n * @param {String} sourceName The source name to scan for in the query.\n * @param {String=} path The path to scan from.\n * @returns {*}\n * @private\n */\nCollection.prototype._queryReferencesSource = function (query, sourceName, path) {\n\tvar i;\n\n\tfor (i in query) {\n\t\tif (query.hasOwnProperty(i)) {\n\t\t\t// Check if this key is a reference match\n\t\t\tif (i === sourceName) {\n\t\t\t\tif (path) { path += '.'; }\n\t\t\t\treturn path + i;\n\t\t\t} else {\n\t\t\t\tif (typeof(query[i]) === 'object') {\n\t\t\t\t\t// Recurse\n\t\t\t\t\tif (path) { path += '.'; }\n\t\t\t\t\tpath += i;\n\t\t\t\t\treturn this._queryReferencesSource(query[i], sourceName, path);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n};\n\n/**\n * Returns the number of documents currently in the collection.\n * @returns {Number}\n */\nCollection.prototype.count = function (query, options) {\n\tif (!query) {\n\t\treturn this._data.length;\n\t} else {\n\t\t// Run query and return count\n\t\treturn this.find(query, options).length;\n\t}\n};\n\n/**\n * Finds sub-documents from the collection's documents.\n * @param {Object} match The query object to use when matching parent documents\n * from which the sub-documents are queried.\n * @param {String} path The path string used to identify the key in which\n * sub-documents are stored in parent documents.\n * @param {Object=} subDocQuery The query to use when matching which sub-documents\n * to return.\n * @param {Object=} subDocOptions The options object to use when querying for\n * sub-documents.\n * @returns {*}\n */\nCollection.prototype.findSub = function (match, path, subDocQuery, subDocOptions) {\n\treturn this._findSub(this.find(match), path, subDocQuery, subDocOptions);\n};\n\nCollection.prototype._findSub = function (docArr, path, subDocQuery, subDocOptions) {\n\tvar pathHandler = new Path(path),\n\t\tdocCount = docArr.length,\n\t\tdocIndex,\n\t\tsubDocArr,\n\t\tsubDocCollection = new Collection('__FDB_temp_' + this.objectId()).db(this._db),\n\t\tsubDocResults,\n\t\tresultObj = {\n\t\t\tparents: docCount,\n\t\t\tsubDocTotal: 0,\n\t\t\tsubDocs: [],\n\t\t\tpathFound: false,\n\t\t\terr: ''\n\t\t};\n\n\tsubDocOptions = subDocOptions || {};\n\n\tfor (docIndex = 0; docIndex < docCount; docIndex++) {\n\t\tsubDocArr = pathHandler.value(docArr[docIndex])[0];\n\t\tif (subDocArr) {\n\t\t\tsubDocCollection.setData(subDocArr);\n\t\t\tsubDocResults = subDocCollection.find(subDocQuery, subDocOptions);\n\t\t\tif (subDocOptions.returnFirst && subDocResults.length) {\n\t\t\t\treturn subDocResults[0];\n\t\t\t}\n\n\t\t\tif (subDocOptions.$split) {\n\t\t\t\tresultObj.subDocs.push(subDocResults);\n\t\t\t} else {\n\t\t\t\tresultObj.subDocs = resultObj.subDocs.concat(subDocResults);\n\t\t\t}\n\n\t\t\tresultObj.subDocTotal += subDocResults.length;\n\t\t\tresultObj.pathFound = true;\n\t\t}\n\t}\n\n\t// Drop the sub-document collection\n\tsubDocCollection.drop();\n\n\tif (!resultObj.pathFound) {\n\t\tresultObj.err = 'No objects found in the parent documents with a matching path of: ' + path;\n\t}\n\n\t// Check if the call should not return stats, if so return only subDocs array\n\tif (subDocOptions.$stats) {\n\t\treturn resultObj;\n\t} else {\n\t\treturn resultObj.subDocs;\n\t}\n};\n\n/**\n * Finds the first sub-document from the collection's documents that matches\n * the subDocQuery parameter.\n * @param {Object} match The query object to use when matching parent documents\n * from which the sub-documents are queried.\n * @param {String} path The path string used to identify the key in which\n * sub-documents are stored in parent documents.\n * @param {Object=} subDocQuery The query to use when matching which sub-documents\n * to return.\n * @param {Object=} subDocOptions The options object to use when querying for\n * sub-documents.\n * @returns {Object}\n */\nCollection.prototype.findSubOne = function (match, path, subDocQuery, subDocOptions) {\n\treturn this.findSub(match, path, subDocQuery, subDocOptions)[0];\n};\n\n/**\n * Checks that the passed document will not violate any index rules if\n * inserted into the collection.\n * @param {Object} doc The document to check indexes against.\n * @returns {Boolean} Either false (no violation occurred) or true if\n * a violation was detected.\n */\nCollection.prototype.insertIndexViolation = function (doc) {\n\tvar indexViolated,\n\t\tarr = this._indexByName,\n\t\tarrIndex,\n\t\tarrItem;\n\n\t// Check the item's primary key is not already in use\n\tif (this._primaryIndex.get(doc[this._primaryKey])) {\n\t\tindexViolated = this._primaryIndex;\n\t} else {\n\t\t// Check violations of other indexes\n\t\tfor (arrIndex in arr) {\n\t\t\tif (arr.hasOwnProperty(arrIndex)) {\n\t\t\t\tarrItem = arr[arrIndex];\n\n\t\t\t\tif (arrItem.unique()) {\n\t\t\t\t\tif (arrItem.violation(doc)) {\n\t\t\t\t\t\tindexViolated = arrItem;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn indexViolated ? indexViolated.name() : false;\n};\n\n/**\n * Creates an index on the specified keys.\n * @param {Object} keys The object containing keys to index.\n * @param {Object} options An options object.\n * @returns {*}\n */\nCollection.prototype.ensureIndex = function (keys, options) {\n\tif (this.isDropped()) {\n\t\tthrow(this.logIdentifier() + ' Cannot operate in a dropped state!');\n\t}\n\n\tthis._indexByName = this._indexByName || {};\n\tthis._indexById = this._indexById || {};\n\n\tvar index,\n\t\ttime = {\n\t\t\tstart: new Date().getTime()\n\t\t};\n\n\tif (options) {\n\t\tif (options.type) {\n\t\t\t// Check if the specified type is available\n\t\t\tif (Shared.index[options.type]) {\n\t\t\t\t// We found the type, generate it\n\t\t\t\tindex = new Shared.index[options.type](keys, options, this);\n\t\t\t} else {\n\t\t\t\tthrow(this.logIdentifier() + ' Cannot create index of type \"' + options.type + '\", type not found in the index type register (Shared.index)');\n\t\t\t}\n\t\t} else {\n\t\t\t// Create default index type\n\t\t\tindex = new IndexHashMap(keys, options, this);\n\t\t}\n\t} else {\n\t\t// Default\n\t\tindex = new IndexHashMap(keys, options, this);\n\t}\n\n\t// Check the index does not already exist\n\tif (this._indexByName[index.name()]) {\n\t\t// Index already exists\n\t\treturn {\n\t\t\terr: 'Index with that name already exists'\n\t\t};\n\t}\n\n\t/*if (this._indexById[index.id()]) {\n\t\t// Index already exists\n\t\treturn {\n\t\t\terr: 'Index with those keys already exists'\n\t\t};\n\t}*/\n\n\t// Create the index\n\tindex.rebuild();\n\n\t// Add the index\n\tthis._indexByName[index.name()] = index;\n\tthis._indexById[index.id()] = index;\n\n\ttime.end = new Date().getTime();\n\ttime.total = time.end - time.start;\n\n\tthis._lastOp = {\n\t\ttype: 'ensureIndex',\n\t\tstats: {\n\t\t\ttime: time\n\t\t}\n\t};\n\n\treturn {\n\t\tindex: index,\n\t\tid: index.id(),\n\t\tname: index.name(),\n\t\tstate: index.state()\n\t};\n};\n\n/**\n * Gets an index by it's name.\n * @param {String} name The name of the index to retreive.\n * @returns {*}\n */\nCollection.prototype.index = function (name) {\n\tif (this._indexByName) {\n\t\treturn this._indexByName[name];\n\t}\n};\n\n/**\n * Gets the last reporting operation's details such as run time.\n * @returns {Object}\n */\nCollection.prototype.lastOp = function () {\n\treturn this._metrics.list();\n};\n\n/**\n * Generates a difference object that contains insert, update and remove arrays\n * representing the operations to execute to make this collection have the same\n * data as the one passed.\n * @param {Collection} collection The collection to diff against.\n * @returns {{}}\n */\nCollection.prototype.diff = function (collection) {\n\tvar diff = {\n\t\tinsert: [],\n\t\tupdate: [],\n\t\tremove: []\n\t};\n\n\tvar pk = this.primaryKey(),\n\t\tarr,\n\t\tarrIndex,\n\t\tarrItem,\n\t\tarrCount;\n\n\t// Check if the primary key index of each collection can be utilised\n\tif (pk !== collection.primaryKey()) {\n\t\tthrow(this.logIdentifier() + ' Diffing requires that both collections have the same primary key!');\n\t}\n\n\t// Use the collection primary key index to do the diff (super-fast)\n\tarr = collection._data;\n\n\t// Check if we have an array or another collection\n\twhile (arr && !(arr instanceof Array)) {\n\t\t// We don't have an array, assign collection and get data\n\t\tcollection = arr;\n\t\tarr = collection._data;\n\t}\n\n\tarrCount = arr.length;\n\n\t// Loop the collection's data array and check for matching items\n\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\tarrItem = arr[arrIndex];\n\n\t\t// Check for a matching item in this collection\n\t\tif (this._primaryIndex.get(arrItem[pk])) {\n\t\t\t// Matching item exists, check if the data is the same\n\t\t\tif (this._primaryCrc.get(arrItem[pk]) !== collection._primaryCrc.get(arrItem[pk])) {\n\t\t\t\t// The documents exist in both collections but data differs, update required\n\t\t\t\tdiff.update.push(arrItem);\n\t\t\t}\n\t\t} else {\n\t\t\t// The document is missing from this collection, insert required\n\t\t\tdiff.insert.push(arrItem);\n\t\t}\n\t}\n\n\t// Now loop this collection's data and check for matching items\n\tarr = this._data;\n\tarrCount = arr.length;\n\n\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\tarrItem = arr[arrIndex];\n\n\t\tif (!collection._primaryIndex.get(arrItem[pk])) {\n\t\t\t// The document does not exist in the other collection, remove required\n\t\t\tdiff.remove.push(arrItem);\n\t\t}\n\t}\n\n\treturn diff;\n};\n\nCollection.prototype.collateAdd = new Overload('Collection.prototype.collateAdd', {\n\t/**\n\t * Adds a data source to collate data from and specifies the\n\t * key name to collate data to.\n\t * @func collateAdd\n\t * @memberof Collection\n\t * @param {Collection} collection The collection to collate data from.\n\t * @param {String=} keyName Optional name of the key to collate data to.\n\t * If none is provided the record CRUD is operated on the root collection\n\t * data.\n\t */\n\t'object, string': function (collection, keyName) {\n\t\tvar self = this;\n\n\t\tself.collateAdd(collection, function (packet) {\n\t\t\tvar obj1,\n\t\t\t\tobj2;\n\n\t\t\tswitch (packet.type) {\n\t\t\t\tcase 'insert':\n\t\t\t\t\tif (keyName) {\n\t\t\t\t\t\tobj1 = {\n\t\t\t\t\t\t\t$push: {}\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\tobj1.$push[keyName] = self.decouple(packet.data.dataSet);\n\t\t\t\t\t\tself.update({}, obj1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tself.insert(packet.data.dataSet);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'update':\n\t\t\t\t\tif (keyName) {\n\t\t\t\t\t\tobj1 = {};\n\t\t\t\t\t\tobj2 = {};\n\n\t\t\t\t\t\tobj1[keyName] = packet.data.query;\n\t\t\t\t\t\tobj2[keyName + '.$'] = packet.data.update;\n\n\t\t\t\t\t\tself.update(obj1, obj2);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tself.update(packet.data.query, packet.data.update);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'remove':\n\t\t\t\t\tif (keyName) {\n\t\t\t\t\t\tobj1 = {\n\t\t\t\t\t\t\t$pull: {}\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\tobj1.$pull[keyName] = {};\n\t\t\t\t\t\tobj1.$pull[keyName][self.primaryKey()] = packet.data.dataSet[0][collection.primaryKey()];\n\n\t\t\t\t\t\tself.update({}, obj1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tself.remove(packet.data.dataSet);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t}\n\t\t});\n\t},\n\n\t/**\n\t * Adds a data source to collate data from and specifies a process\n\t * method that will handle the collation functionality (for custom\n\t * collation).\n\t * @func collateAdd\n\t * @memberof Collection\n\t * @param {Collection} collection The collection to collate data from.\n\t * @param {Function} process The process method.\n\t */\n\t'object, function': function (collection, process) {\n\t\tif (typeof collection === 'string') {\n\t\t\t// The collection passed is a name, not a reference so get\n\t\t\t// the reference from the name\n\t\t\tcollection = this._db.collection(collection, {\n\t\t\t\tautoCreate: false,\n\t\t\t\tthrowError: false\n\t\t\t});\n\t\t}\n\n\t\tif (collection) {\n\t\t\tthis._collate = this._collate || {};\n\t\t\tthis._collate[collection.name()] = new ReactorIO(collection, this, process);\n\n\t\t\treturn this;\n\t\t} else {\n\t\t\tthrow('Cannot collate from a non-existent collection!');\n\t\t}\n\t}\n});\n\nCollection.prototype.collateRemove = function (collection) {\n\tif (typeof collection === 'object') {\n\t\t// We need to have the name of the collection to remove it\n\t\tcollection = collection.name();\n\t}\n\n\tif (collection) {\n\t\t// Drop the reactor IO chain node\n\t\tthis._collate[collection].drop();\n\n\t\t// Remove the collection data from the collate object\n\t\tdelete this._collate[collection];\n\n\t\treturn this;\n\t} else {\n\t\tthrow('No collection name passed to collateRemove() or collection not found!');\n\t}\n};\n\nDb.prototype.collection = new Overload('Db.prototype.collection', {\n\t/**\n\t * Get a collection with no name (generates a random name). If the\n\t * collection does not already exist then one is created for that\n\t * name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @returns {Collection}\n\t */\n\t'': function () {\n\t\treturn this.$main.call(this, {\n\t\t\tname: this.objectId()\n\t\t});\n\t},\n\n\t/**\n\t * Get a collection by name. If the collection does not already exist\n\t * then one is created for that name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @param {Object} data An options object or a collection instance.\n\t * @returns {Collection}\n\t */\n\t'object': function (data) {\n\t\t// Handle being passed an instance\n\t\tif (data instanceof Collection) {\n\t\t\tif (data.state() !== 'droppped') {\n\t\t\t\treturn data;\n\t\t\t} else {\n\t\t\t\treturn this.$main.call(this, {\n\t\t\t\t\tname: data.name()\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn this.$main.call(this, data);\n\t},\n\n\t/**\n\t * Get a collection by name. If the collection does not already exist\n\t * then one is created for that name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @param {String} collectionName The name of the collection.\n\t * @returns {Collection}\n\t */\n\t'string': function (collectionName) {\n\t\treturn this.$main.call(this, {\n\t\t\tname: collectionName\n\t\t});\n\t},\n\n\t/**\n\t * Get a collection by name. If the collection does not already exist\n\t * then one is created for that name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @param {String} collectionName The name of the collection.\n\t * @param {String} primaryKey Optional primary key to specify the primary key field on the collection\n\t * objects. Defaults to \"_id\".\n\t * @returns {Collection}\n\t */\n\t'string, string': function (collectionName, primaryKey) {\n\t\treturn this.$main.call(this, {\n\t\t\tname: collectionName,\n\t\t\tprimaryKey: primaryKey\n\t\t});\n\t},\n\n\t/**\n\t * Get a collection by name. If the collection does not already exist\n\t * then one is created for that name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @param {String} collectionName The name of the collection.\n\t * @param {Object} options An options object.\n\t * @returns {Collection}\n\t */\n\t'string, object': function (collectionName, options) {\n\t\toptions.name = collectionName;\n\n\t\treturn this.$main.call(this, options);\n\t},\n\n\t/**\n\t * Get a collection by name. If the collection does not already exist\n\t * then one is created for that name automatically.\n\t * @func collection\n\t * @memberof Db\n\t * @param {String} collectionName The name of the collection.\n\t * @param {String} primaryKey Optional primary key to specify the primary key field on the collection\n\t * objects. Defaults to \"_id\".\n\t * @param {Object} options An options object.\n\t * @returns {Collection}\n\t */\n\t'string, string, object': function (collectionName, primaryKey, options) {\n\t\toptions.name = collectionName;\n\t\toptions.primaryKey = primaryKey;\n\n\t\treturn this.$main.call(this, options);\n\t},\n\n\t/**\n\t * The main handler method. This gets called by all the other variants and\n\t * handles the actual logic of the overloaded method.\n\t * @func collection\n\t * @memberof Db\n\t * @param {Object} options An options object.\n\t * @returns {*}\n\t */\n\t'$main': function (options) {\n\t\tvar self = this,\n\t\t\tname = options.name;\n\n\t\tif (name) {\n\t\t\tif (this._collection[name]) {\n\t\t\t\treturn this._collection[name];\n\t\t\t} else {\n\t\t\t\tif (options && options.autoCreate === false) {\n\t\t\t\t\tif (options && options.throwError !== false) {\n\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot get collection ' + name + ' because it does not exist and auto-create has been disabled!');\n\t\t\t\t\t}\n\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\tif (this.debug()) {\n\t\t\t\t\tconsole.log(this.logIdentifier() + ' Creating collection ' + name);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthis._collection[name] = this._collection[name] || new Collection(name, options).db(this);\n\t\t\tthis._collection[name].mongoEmulation(this.mongoEmulation());\n\n\t\t\tif (options.primaryKey !== undefined) {\n\t\t\t\tthis._collection[name].primaryKey(options.primaryKey);\n\t\t\t}\n\n\t\t\tif (options.capped !== undefined) {\n\t\t\t\t// Check we have a size\n\t\t\t\tif (options.size !== undefined) {\n\t\t\t\t\tthis._collection[name].capped(options.capped);\n\t\t\t\t\tthis._collection[name].cappedSize(options.size);\n\t\t\t\t} else {\n\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot create a capped collection without specifying a size!');\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Listen for events on this collection so we can fire global events\n\t\t\t// on the database in response to it\n\t\t\tself._collection[name].on('change', function () {\n\t\t\t\tself.emit('change', self._collection[name], 'collection', name);\n\t\t\t});\n\n\t\t\tself.emit('create', self._collection[name], 'collection', name);\n\n\t\t\treturn this._collection[name];\n\t\t} else {\n\t\t\tif (!options || (options && options.throwError !== false)) {\n\t\t\t\tthrow(this.logIdentifier() + ' Cannot get collection with undefined name!');\n\t\t\t}\n\t\t}\n\t}\n});\n\n/**\n * Determine if a collection with the passed name already exists.\n * @memberof Db\n * @param {String} viewName The name of the collection to check for.\n * @returns {boolean}\n */\nDb.prototype.collectionExists = function (viewName) {\n\treturn Boolean(this._collection[viewName]);\n};\n\n/**\n * Returns an array of collections the DB currently has.\n * @memberof Db\n * @param {String|RegExp=} search The optional search string or regular expression to use\n * to match collection names against.\n * @returns {Array} An array of objects containing details of each collection\n * the database is currently managing.\n */\nDb.prototype.collections = function (search) {\n\tvar arr = [],\n\t\tcollections = this._collection,\n\t\tcollection,\n\t\ti;\n\n\tif (search) {\n\t\tif (!(search instanceof RegExp)) {\n\t\t\t// Turn the search into a regular expression\n\t\t\tsearch = new RegExp(search);\n\t\t}\n\t}\n\n\tfor (i in collections) {\n\t\tif (collections.hasOwnProperty(i)) {\n\t\t\tcollection = collections[i];\n\n\t\t\tif (search) {\n\t\t\t\tif (search.exec(i)) {\n\t\t\t\t\tarr.push({\n\t\t\t\t\t\tname: i,\n\t\t\t\t\t\tcount: collection.count(),\n\t\t\t\t\t\tlinked: collection.isLinked !== undefined ? collection.isLinked() : false\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tarr.push({\n\t\t\t\t\tname: i,\n\t\t\t\t\tcount: collection.count(),\n\t\t\t\t\tlinked: collection.isLinked !== undefined ? collection.isLinked() : false\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n\n\tarr.sort(function (a, b) {\n\t\treturn a.name.localeCompare(b.name);\n\t});\n\n\treturn arr;\n};\n\nShared.finishModule('Collection');\nmodule.exports = Collection;\n},{\"./Index2d\":10,\"./IndexBinaryTree\":11,\"./IndexHashMap\":12,\"./KeyValueStore\":13,\"./Metrics\":14,\"./Overload\":26,\"./Path\":27,\"./ReactorIO\":31,\"./Shared\":33}],6:[function(_dereq_,module,exports){\n\"use strict\";\n\n// Import external names locally\nvar Shared,\n\tDb,\n\tDbInit,\n\tCollection;\n\nShared = _dereq_('./Shared');\n\n/**\n * Creates a new collection group. Collection groups allow single operations to be\n * propagated to multiple collections at once. CRUD operations against a collection\n * group are in fed to the group's collections. Useful when separating out slightly\n * different data into multiple collections but querying as one collection.\n * @constructor\n */\nvar CollectionGroup = function () {\n\tthis.init.apply(this, arguments);\n};\n\nCollectionGroup.prototype.init = function (name) {\n\tvar self = this;\n\n\tself._name = name;\n\tself._data = new Collection('__FDB__cg_data_' + self._name);\n\tself._collections = [];\n\tself._view = [];\n};\n\nShared.addModule('CollectionGroup', CollectionGroup);\nShared.mixin(CollectionGroup.prototype, 'Mixin.Common');\nShared.mixin(CollectionGroup.prototype, 'Mixin.ChainReactor');\nShared.mixin(CollectionGroup.prototype, 'Mixin.Constants');\nShared.mixin(CollectionGroup.prototype, 'Mixin.Triggers');\nShared.mixin(CollectionGroup.prototype, 'Mixin.Tags');\nShared.mixin(CollectionGroup.prototype, 'Mixin.Events');\n\nCollection = _dereq_('./Collection');\nDb = Shared.modules.Db;\nDbInit = Shared.modules.Db.prototype.init;\n\nCollectionGroup.prototype.on = function () {\n\tthis._data.on.apply(this._data, arguments);\n};\n\nCollectionGroup.prototype.off = function () {\n\tthis._data.off.apply(this._data, arguments);\n};\n\nCollectionGroup.prototype.emit = function () {\n\tthis._data.emit.apply(this._data, arguments);\n};\n\n/**\n * Gets / sets the primary key for this collection group.\n * @param {String=} keyName The name of the primary key.\n * @returns {*}\n */\nCollectionGroup.prototype.primaryKey = function (keyName) {\n\tif (keyName !== undefined) {\n\t\tthis._primaryKey = keyName;\n\t\treturn this;\n\t}\n\n\treturn this._primaryKey;\n};\n\n/**\n * Gets / sets the current state.\n * @param {String=} val The name of the state to set.\n * @returns {*}\n */\nShared.synthesize(CollectionGroup.prototype, 'state');\n\n/**\n * Gets / sets the db instance the collection group belongs to.\n * @param {Db=} db The db instance.\n * @returns {*}\n */\nShared.synthesize(CollectionGroup.prototype, 'db');\n\n/**\n * Gets / sets the instance name.\n * @param {String=} name The new name to set.\n * @returns {*}\n */\nShared.synthesize(CollectionGroup.prototype, 'name');\n\nCollectionGroup.prototype.addCollection = function (collection) {\n\tif (collection) {\n\t\tif (this._collections.indexOf(collection) === -1) {\n\t\t\t//var self = this;\n\n\t\t\t// Check for compatible primary keys\n\t\t\tif (this._collections.length) {\n\t\t\t\tif (this._primaryKey !== collection.primaryKey()) {\n\t\t\t\t\tthrow(this.logIdentifier() + ' All collections in a collection group must have the same primary key!');\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Set the primary key to the first collection added\n\t\t\t\tthis.primaryKey(collection.primaryKey());\n\t\t\t}\n\n\t\t\t// Add the collection\n\t\t\tthis._collections.push(collection);\n\t\t\tcollection._groups = collection._groups || [];\n\t\t\tcollection._groups.push(this);\n\t\t\tcollection.chain(this);\n\n\t\t\t// Hook the collection's drop event to destroy group data\n\t\t\tcollection.on('drop', function () {\n\t\t\t\t// Remove collection from any group associations\n\t\t\t\tif (collection._groups && collection._groups.length) {\n\t\t\t\t\tvar groupArr = [],\n\t\t\t\t\t\ti;\n\n\t\t\t\t\t// Copy the group array because if we call removeCollection on a group\n\t\t\t\t\t// it will alter the groups array of this collection mid-loop!\n\t\t\t\t\tfor (i = 0; i < collection._groups.length; i++) {\n\t\t\t\t\t\tgroupArr.push(collection._groups[i]);\n\t\t\t\t\t}\n\n\t\t\t\t\t// Loop any groups we are part of and remove ourselves from them\n\t\t\t\t\tfor (i = 0; i < groupArr.length; i++) {\n\t\t\t\t\t\tcollection._groups[i].removeCollection(collection);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdelete collection._groups;\n\t\t\t});\n\n\t\t\t// Add collection's data\n\t\t\tthis._data.insert(collection.find());\n\t\t}\n\t}\n\n\treturn this;\n};\n\nCollectionGroup.prototype.removeCollection = function (collection) {\n\tif (collection) {\n\t\tvar collectionIndex = this._collections.indexOf(collection),\n\t\t\tgroupIndex;\n\n\t\tif (collectionIndex !== -1) {\n\t\t\tcollection.unChain(this);\n\t\t\tthis._collections.splice(collectionIndex, 1);\n\n\t\t\tcollection._groups = collection._groups || [];\n\t\t\tgroupIndex = collection._groups.indexOf(this);\n\n\t\t\tif (groupIndex !== -1) {\n\t\t\t\tcollection._groups.splice(groupIndex, 1);\n\t\t\t}\n\n\t\t\tcollection.off('drop');\n\t\t}\n\n\t\tif (this._collections.length === 0) {\n\t\t\t// Wipe the primary key\n\t\t\tdelete this._primaryKey;\n\t\t}\n\t}\n\n\treturn this;\n};\n\nCollectionGroup.prototype._chainHandler = function (chainPacket) {\n\t//sender = chainPacket.sender;\n\tswitch (chainPacket.type) {\n\t\tcase 'setData':\n\t\t\t// Decouple the data to ensure we are working with our own copy\n\t\t\tchainPacket.data.dataSet = this.decouple(chainPacket.data.dataSet);\n\n\t\t\t// Remove old data\n\t\t\tthis._data.remove(chainPacket.data.oldData);\n\n\t\t\t// Add new data\n\t\t\tthis._data.insert(chainPacket.data.dataSet);\n\t\t\tbreak;\n\n\t\tcase 'insert':\n\t\t\t// Decouple the data to ensure we are working with our own copy\n\t\t\tchainPacket.data.dataSet = this.decouple(chainPacket.data.dataSet);\n\n\t\t\t// Add new data\n\t\t\tthis._data.insert(chainPacket.data.dataSet);\n\t\t\tbreak;\n\n\t\tcase 'update':\n\t\t\t// Update data\n\t\t\tthis._data.update(chainPacket.data.query, chainPacket.data.update, chainPacket.options);\n\t\t\tbreak;\n\n\t\tcase 'remove':\n\t\t\tthis._data.remove(chainPacket.data.query, chainPacket.options);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t}\n};\n\nCollectionGroup.prototype.insert = function () {\n\tthis._collectionsRun('insert', arguments);\n};\n\nCollectionGroup.prototype.update = function () {\n\tthis._collectionsRun('update', arguments);\n};\n\nCollectionGroup.prototype.updateById = function () {\n\tthis._collectionsRun('updateById', arguments);\n};\n\nCollectionGroup.prototype.remove = function () {\n\tthis._collectionsRun('remove', arguments);\n};\n\nCollectionGroup.prototype._collectionsRun = function (type, args) {\n\tfor (var i = 0; i < this._collections.length; i++) {\n\t\tthis._collections[i][type].apply(this._collections[i], args);\n\t}\n};\n\nCollectionGroup.prototype.find = function (query, options) {\n\treturn this._data.find(query, options);\n};\n\n/**\n * Helper method that removes a document that matches the given id.\n * @param {String} id The id of the document to remove.\n */\nCollectionGroup.prototype.removeById = function (id) {\n\t// Loop the collections in this group and apply the remove\n\tfor (var i = 0; i < this._collections.length; i++) {\n\t\tthis._collections[i].removeById(id);\n\t}\n};\n\n/**\n * Uses the passed query to generate a new collection with results\n * matching the query parameters.\n *\n * @param query\n * @param options\n * @returns {*}\n */\nCollectionGroup.prototype.subset = function (query, options) {\n\tvar result = this.find(query, options);\n\n\treturn new Collection()\n\t\t.subsetOf(this)\n\t\t.primaryKey(this._primaryKey)\n\t\t.setData(result);\n};\n\n/**\n * Drops a collection group from the database.\n * @returns {boolean} True on success, false on failure.\n */\nCollectionGroup.prototype.drop = function (callback) {\n\tif (!this.isDropped()) {\n\t\tvar i,\n\t\t\tcollArr,\n\t\t\tviewArr;\n\n\t\tif (this._debug) {\n\t\t\tconsole.log(this.logIdentifier() + ' Dropping');\n\t\t}\n\n\t\tthis._state = 'dropped';\n\n\t\tif (this._collections && this._collections.length) {\n\t\t\tcollArr = [].concat(this._collections);\n\n\t\t\tfor (i = 0; i < collArr.length; i++) {\n\t\t\t\tthis.removeCollection(collArr[i]);\n\t\t\t}\n\t\t}\n\n\t\tif (this._view && this._view.length) {\n\t\t\tviewArr = [].concat(this._view);\n\n\t\t\tfor (i = 0; i < viewArr.length; i++) {\n\t\t\t\tthis._removeView(viewArr[i]);\n\t\t\t}\n\t\t}\n\n\t\tthis.emit('drop', this);\n\n\t\tdelete this._listeners;\n\n\t\tif (callback) { callback(false, true); }\n\t}\n\n\treturn true;\n};\n\n// Extend DB to include collection groups\nDb.prototype.init = function () {\n\tthis._collectionGroup = {};\n\tDbInit.apply(this, arguments);\n};\n\n/**\n * Creates a new collectionGroup instance or returns an existing\n * instance if one already exists with the passed name.\n * @func collectionGroup\n * @memberOf Db\n * @param {String} name The name of the instance.\n * @returns {*}\n */\nDb.prototype.collectionGroup = function (name) {\n\tvar self = this;\n\n\tif (name) {\n\t\t// Handle being passed an instance\n\t\tif (name instanceof CollectionGroup) {\n\t\t\treturn name;\n\t\t}\n\n\t\tif (this._collectionGroup && this._collectionGroup[name]) {\n\t\t\treturn this._collectionGroup[name];\n\t\t}\n\n\t\tthis._collectionGroup[name] = new CollectionGroup(name).db(this);\n\n\t\tself.emit('create', self._collectionGroup[name], 'collectionGroup', name);\n\n\t\treturn this._collectionGroup[name];\n\t} else {\n\t\t// Return an object of collection data\n\t\treturn this._collectionGroup;\n\t}\n};\n\n/**\n * Returns an array of collection groups the DB currently has.\n * @returns {Array} An array of objects containing details of each collection group\n * the database is currently managing.\n */\nDb.prototype.collectionGroups = function () {\n\tvar arr = [],\n\t\ti;\n\n\tfor (i in this._collectionGroup) {\n\t\tif (this._collectionGroup.hasOwnProperty(i)) {\n\t\t\tarr.push({\n\t\t\t\tname: i\n\t\t\t});\n\t\t}\n\t}\n\n\treturn arr;\n};\n\nmodule.exports = CollectionGroup;\n},{\"./Collection\":5,\"./Shared\":33}],7:[function(_dereq_,module,exports){\n/*\n License\n\n Copyright (c) 2015 Irrelon Software Limited\n http://www.irrelon.com\n http://www.forerunnerdb.com\n\n Please visit the license page to see latest license information:\n http://www.forerunnerdb.com/licensing.html\n */\n\"use strict\";\n\nvar Shared,\n\tDb,\n\tMetrics,\n\tOverload,\n\t_instances = [];\n\nShared = _dereq_('./Shared');\nOverload = _dereq_('./Overload');\n\n/**\n * Creates a new ForerunnerDB instance. Core instances handle the lifecycle of\n * multiple database instances.\n * @constructor\n */\nvar Core = function (val) {\n\tthis.init.apply(this, arguments);\n};\n\nCore.prototype.init = function (name) {\n\tthis._db = {};\n\tthis._debug = {};\n\tthis._name = name || 'ForerunnerDB';\n\n\t_instances.push(this);\n};\n\n/**\n * Returns the number of instantiated ForerunnerDB objects.\n * @returns {Number} The number of instantiated instances.\n */\nCore.prototype.instantiatedCount = function () {\n\treturn _instances.length;\n};\n\n/**\n * Get all instances as an array or a single ForerunnerDB instance\n * by it's array index.\n * @param {Number=} index Optional index of instance to get.\n * @returns {Array|Object} Array of instances or a single instance.\n */\nCore.prototype.instances = function (index) {\n\tif (index !== undefined) {\n\t\treturn _instances[index];\n\t}\n\n\treturn _instances;\n};\n\n/**\n * Get all instances as an array of instance names or a single ForerunnerDB\n * instance by it's name.\n * @param {String=} name Optional name of instance to get.\n * @returns {Array|Object} Array of instance names or a single instance.\n */\nCore.prototype.namedInstances = function (name) {\n\tvar i,\n\t\tinstArr;\n\n\tif (name !== undefined) {\n\t\tfor (i = 0; i < _instances.length; i++) {\n\t\t\tif (_instances[i].name === name) {\n\t\t\t\treturn _instances[i];\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\tinstArr = [];\n\n\tfor (i = 0; i < _instances.length; i++) {\n\t\tinstArr.push(_instances[i].name);\n\t}\n\n\treturn instArr;\n};\n\nCore.prototype.moduleLoaded = new Overload({\n\t/**\n\t * Checks if a module has been loaded into the database.\n\t * @func moduleLoaded\n\t * @memberof Core\n\t * @param {String} moduleName The name of the module to check for.\n\t * @returns {Boolean} True if the module is loaded, false if not.\n\t */\n\t'string': function (moduleName) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t},\n\n\t/**\n\t * Checks if a module is loaded and if so calls the passed\n\t * callback method.\n\t * @func moduleLoaded\n\t * @memberof Core\n\t * @param {String} moduleName The name of the module to check for.\n\t * @param {Function} callback The callback method to call if module is loaded.\n\t */\n\t'string, function': function (moduleName, callback) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (callback) { callback(); }\n\t\t}\n\t},\n\n\t/**\n\t * Checks if an array of named modules are loaded and if so\n\t * calls the passed callback method.\n\t * @func moduleLoaded\n\t * @memberof Core\n\t * @param {Array} moduleName The array of module names to check for.\n\t * @param {Function} callback The callback method to call if modules are loaded.\n\t */\n\t'array, function': function (moduleNameArr, callback) {\n\t\tvar moduleName,\n\t\t\ti;\n\n\t\tfor (i = 0; i < moduleNameArr.length; i++) {\n\t\t\tmoduleName = moduleNameArr[i];\n\n\t\t\tif (moduleName !== undefined) {\n\t\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\t\tvar modules = moduleName.split(','),\n\t\t\t\t\tindex;\n\n\t\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (callback) { callback(); }\n\t},\n\n\t/**\n\t * Checks if a module is loaded and if so calls the passed\n\t * success method, otherwise calls the failure method.\n\t * @func moduleLoaded\n\t * @memberof Core\n\t * @param {String} moduleName The name of the module to check for.\n\t * @param {Function} success The callback method to call if module is loaded.\n\t * @param {Function} failure The callback method to call if module not loaded.\n\t */\n\t'string, function, function': function (moduleName, success, failure) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\tfailure();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsuccess();\n\t\t}\n\t}\n});\n\n/**\n * Checks version against the string passed and if it matches (or partially matches)\n * then the callback is called.\n * @param {String} val The version to check against.\n * @param {Function} callback The callback to call if match is true.\n * @returns {Boolean}\n */\nCore.prototype.version = function (val, callback) {\n\tif (val !== undefined) {\n\t\tif (Shared.version.indexOf(val) === 0) {\n\t\t\tif (callback) { callback(); }\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\treturn Shared.version;\n};\n\n// Expose moduleLoaded() method to non-instantiated object ForerunnerDB\nCore.moduleLoaded = Core.prototype.moduleLoaded;\n\n// Expose version() method to non-instantiated object ForerunnerDB\nCore.version = Core.prototype.version;\n\n// Expose instances() method to non-instantiated object ForerunnerDB\nCore.instances = Core.prototype.instances;\n\n// Expose instantiatedCount() method to non-instantiated object ForerunnerDB\nCore.instantiatedCount = Core.prototype.instantiatedCount;\n\n// Provide public access to the Shared object\nCore.shared = Shared;\nCore.prototype.shared = Shared;\n\nShared.addModule('Core', Core);\nShared.mixin(Core.prototype, 'Mixin.Common');\nShared.mixin(Core.prototype, 'Mixin.Constants');\n\nDb = _dereq_('./Db.js');\nMetrics = _dereq_('./Metrics.js');\n\n/**\n * Gets / sets the name of the instance. This is primarily used for\n * name-spacing persistent storage.\n * @param {String=} val The name of the instance to set.\n * @returns {*}\n */\nShared.synthesize(Core.prototype, 'name');\n\n/**\n * Gets / sets mongodb emulation mode.\n * @param {Boolean=} val True to enable, false to disable.\n * @returns {*}\n */\nShared.synthesize(Core.prototype, 'mongoEmulation');\n\n// Set a flag to determine environment\nCore.prototype._isServer = false;\n\n/**\n * Checks if the database is running on a client (browser) or\n * a server (node.js).\n * @returns {Boolean} Returns true if running on a browser.\n */\nCore.prototype.isClient = function () {\n\treturn !this._isServer;\n};\n\n/**\n * Checks if the database is running on a client (browser) or\n * a server (node.js).\n * @returns {Boolean} Returns true if running on a server.\n */\nCore.prototype.isServer = function () {\n\treturn this._isServer;\n};\n\n/**\n * Added to provide an error message for users who have not seen\n * the new instantiation breaking change warning and try to get\n * a collection directly from the core instance.\n */\nCore.prototype.collection = function () {\n\tthrow(\"ForerunnerDB's instantiation has changed since version 1.3.36 to support multiple database instances. Please see the readme.md file for the minor change you have to make to get your project back up and running, or see the issue related to this change at https://github.com/Irrelon/ForerunnerDB/issues/44\");\n};\n\nmodule.exports = Core;\n},{\"./Db.js\":8,\"./Metrics.js\":14,\"./Overload\":26,\"./Shared\":33}],8:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared,\n\tCore,\n\tCollection,\n\tMetrics,\n\tChecksum,\n\tOverload;\n\nShared = _dereq_('./Shared');\nOverload = _dereq_('./Overload');\n\n/**\n * Creates a new ForerunnerDB database instance.\n * @constructor\n */\nvar Db = function (name, core) {\n\tthis.init.apply(this, arguments);\n};\n\nDb.prototype.init = function (name, core) {\n\tthis.core(core);\n\tthis._primaryKey = '_id';\n\tthis._name = name;\n\tthis._collection = {};\n\tthis._debug = {};\n};\n\nShared.addModule('Db', Db);\n\nDb.prototype.moduleLoaded = new Overload({\n\t/**\n\t * Checks if a module has been loaded into the database.\n\t * @func moduleLoaded\n\t * @memberof Db\n\t * @param {String} moduleName The name of the module to check for.\n\t * @returns {Boolean} True if the module is loaded, false if not.\n\t */\n\t'string': function (moduleName) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t},\n\n\t/**\n\t * Checks if a module is loaded and if so calls the passed\n\t * callback method.\n\t * @func moduleLoaded\n\t * @memberof Db\n\t * @param {String} moduleName The name of the module to check for.\n\t * @param {Function} callback The callback method to call if module is loaded.\n\t */\n\t'string, function': function (moduleName, callback) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (callback) { callback(); }\n\t\t}\n\t},\n\n\t/**\n\t * Checks if a module is loaded and if so calls the passed\n\t * success method, otherwise calls the failure method.\n\t * @func moduleLoaded\n\t * @memberof Db\n\t * @param {String} moduleName The name of the module to check for.\n\t * @param {Function} success The callback method to call if module is loaded.\n\t * @param {Function} failure The callback method to call if module not loaded.\n\t */\n\t'string, function, function': function (moduleName, success, failure) {\n\t\tif (moduleName !== undefined) {\n\t\t\tmoduleName = moduleName.replace(/ /g, '');\n\n\t\t\tvar modules = moduleName.split(','),\n\t\t\t\tindex;\n\n\t\t\tfor (index = 0; index < modules.length; index++) {\n\t\t\t\tif (!Shared.modules[modules[index]]) {\n\t\t\t\t\tfailure();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsuccess();\n\t\t}\n\t}\n});\n\n/**\n * Checks version against the string passed and if it matches (or partially matches)\n * then the callback is called.\n * @param {String} val The version to check against.\n * @param {Function} callback The callback to call if match is true.\n * @returns {Boolean}\n */\nDb.prototype.version = function (val, callback) {\n\tif (val !== undefined) {\n\t\tif (Shared.version.indexOf(val) === 0) {\n\t\t\tif (callback) { callback(); }\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\treturn Shared.version;\n};\n\n// Expose moduleLoaded method to non-instantiated object ForerunnerDB\nDb.moduleLoaded = Db.prototype.moduleLoaded;\n\n// Expose version method to non-instantiated object ForerunnerDB\nDb.version = Db.prototype.version;\n\n// Provide public access to the Shared object\nDb.shared = Shared;\nDb.prototype.shared = Shared;\n\nShared.addModule('Db', Db);\nShared.mixin(Db.prototype, 'Mixin.Common');\nShared.mixin(Db.prototype, 'Mixin.ChainReactor');\nShared.mixin(Db.prototype, 'Mixin.Constants');\nShared.mixin(Db.prototype, 'Mixin.Tags');\n\nCore = Shared.modules.Core;\nCollection = _dereq_('./Collection.js');\nMetrics = _dereq_('./Metrics.js');\nChecksum = _dereq_('./Checksum.js');\n\nDb.prototype._isServer = false;\n\n/**\n * Gets / sets the core object this database belongs to.\n */\nShared.synthesize(Db.prototype, 'core');\n\n/**\n * Gets / sets the default primary key for new collections.\n * @param {String=} val The name of the primary key to set.\n * @returns {*}\n */\nShared.synthesize(Db.prototype, 'primaryKey');\n\n/**\n * Gets / sets the current state.\n * @param {String=} val The name of the state to set.\n * @returns {*}\n */\nShared.synthesize(Db.prototype, 'state');\n\n/**\n * Gets / sets the name of the database.\n * @param {String=} val The name of the database to set.\n * @returns {*}\n */\nShared.synthesize(Db.prototype, 'name');\n\n/**\n * Gets / sets mongodb emulation mode.\n * @param {Boolean=} val True to enable, false to disable.\n * @returns {*}\n */\nShared.synthesize(Db.prototype, 'mongoEmulation');\n\n/**\n * Returns true if ForerunnerDB is running on a client browser.\n * @returns {boolean}\n */\nDb.prototype.isClient = function () {\n\treturn !this._isServer;\n};\n\n/**\n * Returns true if ForerunnerDB is running on a server.\n * @returns {boolean}\n */\nDb.prototype.isServer = function () {\n\treturn this._isServer;\n};\n\n/**\n * Returns a checksum of a string.\n * @param {String} string The string to checksum.\n * @return {String} The checksum generated.\n */\nDb.prototype.Checksum = Checksum;\n\n/**\n * Checks if the database is running on a client (browser) or\n * a server (node.js).\n * @returns {Boolean} Returns true if running on a browser.\n */\nDb.prototype.isClient = function () {\n\treturn !this._isServer;\n};\n\n/**\n * Checks if the database is running on a client (browser) or\n * a server (node.js).\n * @returns {Boolean} Returns true if running on a server.\n */\nDb.prototype.isServer = function () {\n\treturn this._isServer;\n};\n\n/**\n * Converts a normal javascript array of objects into a DB collection.\n * @param {Array} arr An array of objects.\n * @returns {Collection} A new collection instance with the data set to the\n * array passed.\n */\nDb.prototype.arrayToCollection = function (arr) {\n\treturn new Collection().setData(arr);\n};\n\n/**\n * Registers an event listener against an event name.\n * @param {String} event The name of the event to listen for.\n * @param {Function} listener The listener method to call when\n * the event is fired.\n * @returns {*}\n */\nDb.prototype.on = function(event, listener) {\n\tthis._listeners = this._listeners || {};\n\tthis._listeners[event] = this._listeners[event] || [];\n\tthis._listeners[event].push(listener);\n\n\treturn this;\n};\n\n/**\n * De-registers an event listener from an event name.\n * @param {String} event The name of the event to stop listening for.\n * @param {Function} listener The listener method passed to on() when\n * registering the event listener.\n * @returns {*}\n */\nDb.prototype.off = function(event, listener) {\n\tif (event in this._listeners) {\n\t\tvar arr = this._listeners[event],\n\t\t\tindex = arr.indexOf(listener);\n\n\t\tif (index > -1) {\n\t\t\tarr.splice(index, 1);\n\t\t}\n\t}\n\n\treturn this;\n};\n\n/**\n * Emits an event by name with the given data.\n * @param {String} event The name of the event to emit.\n * @param {*=} data The data to emit with the event.\n * @returns {*}\n */\nDb.prototype.emit = function(event, data) {\n\tthis._listeners = this._listeners || {};\n\n\tif (event in this._listeners) {\n\t\tvar arr = this._listeners[event],\n\t\t\tarrCount = arr.length,\n\t\t\tarrIndex;\n\n\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\tarr[arrIndex].apply(this, Array.prototype.slice.call(arguments, 1));\n\t\t}\n\t}\n\n\treturn this;\n};\n\nDb.prototype.peek = function (search) {\n\tvar i,\n\t\t\tcoll,\n\t\t\tarr = [],\n\t\t\ttypeOfSearch = typeof search;\n\n\t// Loop collections\n\tfor (i in this._collection) {\n\t\tif (this._collection.hasOwnProperty(i)) {\n\t\t\tcoll = this._collection[i];\n\n\t\t\tif (typeOfSearch === 'string') {\n\t\t\t\tarr = arr.concat(coll.peek(search));\n\t\t\t} else {\n\t\t\t\tarr = arr.concat(coll.find(search));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn arr;\n};\n\n/**\n * Find all documents across all collections in the database that match the passed\n * string or search object.\n * @param search String or search object.\n * @returns {Array}\n */\nDb.prototype.peek = function (search) {\n\tvar i,\n\t\tcoll,\n\t\tarr = [],\n\t\ttypeOfSearch = typeof search;\n\n\t// Loop collections\n\tfor (i in this._collection) {\n\t\tif (this._collection.hasOwnProperty(i)) {\n\t\t\tcoll = this._collection[i];\n\n\t\t\tif (typeOfSearch === 'string') {\n\t\t\t\tarr = arr.concat(coll.peek(search));\n\t\t\t} else {\n\t\t\t\tarr = arr.concat(coll.find(search));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn arr;\n};\n\n/**\n * Find all documents across all collections in the database that match the passed\n * string or search object and return them in an object where each key is the name\n * of the collection that the document was matched in.\n * @param search String or search object.\n * @returns {object}\n */\nDb.prototype.peekCat = function (search) {\n\tvar i,\n\t\tcoll,\n\t\tcat = {},\n\t\tarr,\n\t\ttypeOfSearch = typeof search;\n\n\t// Loop collections\n\tfor (i in this._collection) {\n\t\tif (this._collection.hasOwnProperty(i)) {\n\t\t\tcoll = this._collection[i];\n\n\t\t\tif (typeOfSearch === 'string') {\n\t\t\t\tarr = coll.peek(search);\n\n\t\t\t\tif (arr && arr.length) {\n\t\t\t\t\tcat[coll.name()] = arr;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tarr = coll.find(search);\n\n\t\t\t\tif (arr && arr.length) {\n\t\t\t\t\tcat[coll.name()] = arr;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn cat;\n};\n\nDb.prototype.drop = new Overload({\n\t/**\n\t * Drops the database.\n\t * @func drop\n\t * @memberof Db\n\t */\n\t'': function () {\n\t\tif (!this.isDropped()) {\n\t\t\tvar arr = this.collections(),\n\t\t\t\tarrCount = arr.length,\n\t\t\t\tarrIndex;\n\n\t\t\tthis._state = 'dropped';\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tthis.collection(arr[arrIndex].name).drop();\n\t\t\t\tdelete this._collection[arr[arrIndex].name];\n\t\t\t}\n\n\t\t\tthis.emit('drop', this);\n\n\t\t\tdelete this._listeners;\n\t\t\tdelete this._core._db[this._name];\n\t\t}\n\n\t\treturn true;\n\t},\n\n\t/**\n\t * Drops the database with optional callback method.\n\t * @func drop\n\t * @memberof Db\n\t * @param {Function} callback Optional callback method.\n\t */\n\t'function': function (callback) {\n\t\tif (!this.isDropped()) {\n\t\t\tvar arr = this.collections(),\n\t\t\t\tarrCount = arr.length,\n\t\t\t\tarrIndex,\n\t\t\t\tfinishCount = 0,\n\t\t\t\tafterDrop = function () {\n\t\t\t\t\tfinishCount++;\n\n\t\t\t\t\tif (finishCount === arrCount) {\n\t\t\t\t\t\tif (callback) { callback();\t}\n\t\t\t\t\t}\n\t\t\t\t};\n\n\t\t\tthis._state = 'dropped';\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tthis.collection(arr[arrIndex].name).drop(afterDrop);\n\n\t\t\t\tdelete this._collection[arr[arrIndex].name];\n\t\t\t}\n\n\t\t\tthis.emit('drop', this);\n\n\t\t\tdelete this._listeners;\n\t\t\tdelete this._core._db[this._name];\n\t\t}\n\n\t\treturn true;\n\t},\n\n\t/**\n\t * Drops the database with optional persistent storage drop. Persistent\n\t * storage is dropped by default if no preference is provided.\n\t * @func drop\n\t * @memberof Db\n\t * @param {Boolean} removePersist Drop persistent storage for this database.\n\t */\n\t'boolean': function (removePersist) {\n\t\tif (!this.isDropped()) {\n\t\t\tvar arr = this.collections(),\n\t\t\t\tarrCount = arr.length,\n\t\t\t\tarrIndex;\n\n\t\t\tthis._state = 'dropped';\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tthis.collection(arr[arrIndex].name).drop(removePersist);\n\t\t\t\tdelete this._collection[arr[arrIndex].name];\n\t\t\t}\n\n\t\t\tthis.emit('drop', this);\n\n\t\t\tdelete this._listeners;\n\t\t\tdelete this._core._db[this._name];\n\t\t}\n\n\t\treturn true;\n\t},\n\n\t/**\n\t * Drops the database and optionally controls dropping persistent storage\n\t * and callback method.\n\t * @func drop\n\t * @memberof Db\n\t * @param {Boolean} removePersist Drop persistent storage for this database.\n\t * @param {Function} callback Optional callback method.\n\t */\n\t'boolean, function': function (removePersist, callback) {\n\t\tif (!this.isDropped()) {\n\t\t\tvar arr = this.collections(),\n\t\t\t\tarrCount = arr.length,\n\t\t\t\tarrIndex,\n\t\t\t\tfinishCount = 0,\n\t\t\t\tafterDrop = function () {\n\t\t\t\t\tfinishCount++;\n\n\t\t\t\t\tif (finishCount === arrCount) {\n\t\t\t\t\t\tif (callback) { callback();\t}\n\t\t\t\t\t}\n\t\t\t\t};\n\n\t\t\tthis._state = 'dropped';\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tthis.collection(arr[arrIndex].name).drop(removePersist, afterDrop);\n\t\t\t\tdelete this._collection[arr[arrIndex].name];\n\t\t\t}\n\n\t\t\tthis.emit('drop', this);\n\n\t\t\tdelete this._listeners;\n\t\t\tdelete this._core._db[this._name];\n\t\t}\n\n\t\treturn true;\n\t}\n});\n\n/**\n * Gets a database instance by name.\n * @memberof Core\n * @param {String=} name Optional name of the database. If none is provided\n * a random name is assigned.\n * @returns {Db}\n */\nCore.prototype.db = function (name) {\n\t// Handle being passed an instance\n\tif (name instanceof Db) {\n\t\treturn name;\n\t}\n\n\tif (!name) {\n\t\tname = this.objectId();\n\t}\n\n\tthis._db[name] = this._db[name] || new Db(name, this);\n\n\tthis._db[name].mongoEmulation(this.mongoEmulation());\n\n\treturn this._db[name];\n};\n\n/**\n * Returns an array of databases that ForerunnerDB currently has.\n * @memberof Core\n * @param {String|RegExp=} search The optional search string or regular expression to use\n * to match collection names against.\n * @returns {Array} An array of objects containing details of each database\n * that ForerunnerDB is currently managing and it's child entities.\n */\nCore.prototype.databases = function (search) {\n\tvar arr = [],\n\t\ttmpObj,\n\t\taddDb,\n\t\ti;\n\n\tif (search) {\n\t\tif (!(search instanceof RegExp)) {\n\t\t\t// Turn the search into a regular expression\n\t\t\tsearch = new RegExp(search);\n\t\t}\n\t}\n\n\tfor (i in this._db) {\n\t\tif (this._db.hasOwnProperty(i)) {\n\t\t\taddDb = true;\n\n\t\t\tif (search) {\n\t\t\t\tif (!search.exec(i)) {\n\t\t\t\t\taddDb = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (addDb) {\n\t\t\t\ttmpObj = {\n\t\t\t\t\tname: i,\n\t\t\t\t\tchildren: []\n\t\t\t\t};\n\n\t\t\t\tif (this.shared.moduleExists('Collection')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'collection',\n\t\t\t\t\t\tmoduleName: 'Collections',\n\t\t\t\t\t\tcount: this._db[i].collections().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tif (this.shared.moduleExists('CollectionGroup')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'collectionGroup',\n\t\t\t\t\t\tmoduleName: 'Collection Groups',\n\t\t\t\t\t\tcount: this._db[i].collectionGroups().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tif (this.shared.moduleExists('Document')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'document',\n\t\t\t\t\t\tmoduleName: 'Documents',\n\t\t\t\t\t\tcount: this._db[i].documents().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tif (this.shared.moduleExists('Grid')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'grid',\n\t\t\t\t\t\tmoduleName: 'Grids',\n\t\t\t\t\t\tcount: this._db[i].grids().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tif (this.shared.moduleExists('Overview')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'overview',\n\t\t\t\t\t\tmoduleName: 'Overviews',\n\t\t\t\t\t\tcount: this._db[i].overviews().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tif (this.shared.moduleExists('View')) {\n\t\t\t\t\ttmpObj.children.push({\n\t\t\t\t\t\tmodule: 'view',\n\t\t\t\t\t\tmoduleName: 'Views',\n\t\t\t\t\t\tcount: this._db[i].views().length\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tarr.push(tmpObj);\n\t\t\t}\n\t\t}\n\t}\n\n\tarr.sort(function (a, b) {\n\t\treturn a.name.localeCompare(b.name);\n\t});\n\n\treturn arr;\n};\n\nShared.finishModule('Db');\nmodule.exports = Db;\n},{\"./Checksum.js\":4,\"./Collection.js\":5,\"./Metrics.js\":14,\"./Overload\":26,\"./Shared\":33}],9:[function(_dereq_,module,exports){\n// geohash.js\n// Geohash library for Javascript\n// (c) 2008 David Troy\n// Distributed under the MIT License\n// Original at: https://github.com/davetroy/geohash-js\n\n// Modified by Irrelon Software Limited (http://www.irrelon.com)\n// to clean up and modularise the code using Node.js-style exports\n// and add a few helper methods.\n// @by Rob Evans - rob@irrelon.com\n\"use strict\";\n\n/*\nDefine some shared constants that will be used by all instances\nof the module.\n */\nvar bits,\n\tbase32,\n\tneighbors,\n\tborders;\n\nbits = [16, 8, 4, 2, 1];\n\nbase32 = \"0123456789bcdefghjkmnpqrstuvwxyz\";\nneighbors = {\n\tright: {even: \"bc01fg45238967deuvhjyznpkmstqrwx\"},\n\tleft: {even: \"238967debc01fg45kmstqrwxuvhjyznp\"},\n\ttop: {even: \"p0r21436x8zb9dcf5h7kjnmqesgutwvy\"},\n\tbottom: {even: \"14365h7k9dcfesgujnmqp0r2twvyx8zb\"}\n};\n\nborders = {\n\tright: {even: \"bcfguvyz\"},\n\tleft: {even: \"0145hjnp\"},\n\ttop: {even: \"prxz\"},\n\tbottom: {even: \"028b\"}\n};\n\nneighbors.bottom.odd = neighbors.left.even;\nneighbors.top.odd = neighbors.right.even;\nneighbors.left.odd = neighbors.bottom.even;\nneighbors.right.odd = neighbors.top.even;\n\nborders.bottom.odd = borders.left.even;\nborders.top.odd = borders.right.even;\nborders.left.odd = borders.bottom.even;\nborders.right.odd = borders.top.even;\n\nvar GeoHash = function () {};\n\nGeoHash.prototype.refineInterval = function (interval, cd, mask) {\n\tif (cd & mask) { //jshint ignore: line\n\t\tinterval[0] = (interval[0] + interval[1]) / 2;\n\t} else {\n\t\tinterval[1] = (interval[0] + interval[1]) / 2;\n\t}\n};\n\n/**\n * Calculates all surrounding neighbours of a hash and returns them.\n * @param {String} centerHash The hash at the center of the grid.\n * @param options\n * @returns {*}\n */\nGeoHash.prototype.calculateNeighbours = function (centerHash, options) {\n\tvar response;\n\n\tif (!options || options.type === 'object') {\n\t\tresponse = {\n\t\t\tcenter: centerHash,\n\t\t\tleft: this.calculateAdjacent(centerHash, 'left'),\n\t\t\tright: this.calculateAdjacent(centerHash, 'right'),\n\t\t\ttop: this.calculateAdjacent(centerHash, 'top'),\n\t\t\tbottom: this.calculateAdjacent(centerHash, 'bottom')\n\t\t};\n\n\t\tresponse.topLeft = this.calculateAdjacent(response.left, 'top');\n\t\tresponse.topRight = this.calculateAdjacent(response.right, 'top');\n\t\tresponse.bottomLeft = this.calculateAdjacent(response.left, 'bottom');\n\t\tresponse.bottomRight = this.calculateAdjacent(response.right, 'bottom');\n\t} else {\n\t\tresponse = [];\n\n\t\tresponse[4] = centerHash;\n\t\tresponse[3] = this.calculateAdjacent(centerHash, 'left');\n\t\tresponse[5] = this.calculateAdjacent(centerHash, 'right');\n\t\tresponse[1] = this.calculateAdjacent(centerHash, 'top');\n\t\tresponse[7] = this.calculateAdjacent(centerHash, 'bottom');\n\n\t\tresponse[0] = this.calculateAdjacent(response[3], 'top');\n\t\tresponse[2] = this.calculateAdjacent(response[5], 'top');\n\t\tresponse[6] = this.calculateAdjacent(response[3], 'bottom');\n\t\tresponse[8] = this.calculateAdjacent(response[5], 'bottom');\n\t}\n\n\treturn response;\n};\n\n/**\n * Calculates an adjacent hash to the hash passed, in the direction\n * specified.\n * @param {String} srcHash The hash to calculate adjacent to.\n * @param {String} dir Either \"top\", \"left\", \"bottom\" or \"right\".\n * @returns {String} The resulting geohash.\n */\nGeoHash.prototype.calculateAdjacent = function (srcHash, dir) {\n\tsrcHash = srcHash.toLowerCase();\n\n\tvar lastChr = srcHash.charAt(srcHash.length - 1),\n\t\ttype = (srcHash.length % 2) ? 'odd' : 'even',\n\t\tbase = srcHash.substring(0, srcHash.length - 1);\n\n\tif (borders[dir][type].indexOf(lastChr) !== -1) {\n\t\tbase = this.calculateAdjacent(base, dir);\n\t}\n\n\treturn base + base32[neighbors[dir][type].indexOf(lastChr)];\n};\n\n/**\n * Decodes a string geohash back to longitude/latitude.\n * @param {String} geohash The hash to decode.\n * @returns {Object}\n */\nGeoHash.prototype.decode = function (geohash) {\n\tvar isEven = 1,\n\t\tlat = [],\n\t\tlon = [],\n\t\ti, c, cd, j, mask,\n\t\tlatErr,\n\t\tlonErr;\n\n\tlat[0] = -90.0;\n\tlat[1] = 90.0;\n\tlon[0] = -180.0;\n\tlon[1] = 180.0;\n\n\tlatErr = 90.0;\n\tlonErr = 180.0;\n\n\tfor (i = 0; i < geohash.length; i++) {\n\t\tc = geohash[i];\n\t\tcd = base32.indexOf(c);\n\n\t\tfor (j = 0; j < 5; j++) {\n\t\t\tmask = bits[j];\n\n\t\t\tif (isEven) {\n\t\t\t\tlonErr /= 2;\n\t\t\t\tthis.refineInterval(lon, cd, mask);\n\t\t\t} else {\n\t\t\t\tlatErr /= 2;\n\t\t\t\tthis.refineInterval(lat, cd, mask);\n\t\t\t}\n\n\t\t\tisEven = !isEven;\n\t\t}\n\t}\n\n\tlat[2] = (lat[0] + lat[1]) / 2;\n\tlon[2] = (lon[0] + lon[1]) / 2;\n\n\treturn {\n\t\tlatitude: lat,\n\t\tlongitude: lon\n\t};\n};\n\n/**\n * Encodes a longitude/latitude to geohash string.\n * @param latitude\n * @param longitude\n * @param {Number=} precision Length of the geohash string. Defaults to 12.\n * @returns {String}\n */\nGeoHash.prototype.encode = function (latitude, longitude, precision) {\n\tvar isEven = 1,\n\t\tmid,\n\t\tlat = [],\n\t\tlon = [],\n\t\tbit = 0,\n\t\tch = 0,\n\t\tgeoHash = \"\";\n\n\tif (!precision) { precision = 12; }\n\n\tlat[0] = -90.0;\n\tlat[1] = 90.0;\n\tlon[0] = -180.0;\n\tlon[1] = 180.0;\n\n\twhile (geoHash.length < precision) {\n\t\tif (isEven) {\n\t\t\tmid = (lon[0] + lon[1]) / 2;\n\n\t\t\tif (longitude > mid) {\n\t\t\t\tch |= bits[bit]; //jshint ignore: line\n\t\t\t\tlon[0] = mid;\n\t\t\t} else {\n\t\t\t\tlon[1] = mid;\n\t\t\t}\n\t\t} else {\n\t\t\tmid = (lat[0] + lat[1]) / 2;\n\n\t\t\tif (latitude > mid) {\n\t\t\t\tch |= bits[bit]; //jshint ignore: line\n\t\t\t\tlat[0] = mid;\n\t\t\t} else {\n\t\t\t\tlat[1] = mid;\n\t\t\t}\n\t\t}\n\n\t\tisEven = !isEven;\n\n\t\tif (bit < 4) {\n\t\t\tbit++;\n\t\t} else {\n\t\t\tgeoHash += base32[ch];\n\t\t\tbit = 0;\n\t\t\tch = 0;\n\t\t}\n\t}\n\n\treturn geoHash;\n};\n\nmodule.exports = GeoHash;\n},{}],10:[function(_dereq_,module,exports){\n\"use strict\";\n\n/*\nname(string)\nid(string)\nrebuild(null)\nstate ?? needed?\nmatch(query, options)\nlookup(query, options)\ninsert(doc)\nremove(doc)\nprimaryKey(string)\ncollection(collection)\n*/\n\nvar Shared = _dereq_('./Shared'),\n\tPath = _dereq_('./Path'),\n\tBinaryTree = _dereq_('./BinaryTree'),\n\tGeoHash = _dereq_('./GeoHash'),\n\tsharedPathSolver = new Path(),\n\tsharedGeoHashSolver = new GeoHash(),\n\t// GeoHash Distances in Kilometers\n\tgeoHashDistance = [\n\t\t5000,\n\t\t1250,\n\t\t156,\n\t\t39.1,\n\t\t4.89,\n\t\t1.22,\n\t\t0.153,\n\t\t0.0382,\n\t\t0.00477,\n\t\t0.00119,\n\t\t0.000149,\n\t\t0.0000372\n\t];\n\n/**\n * The index class used to instantiate 2d indexes that the database can\n * use to handle high-performance geospatial queries.\n * @constructor\n */\nvar Index2d = function () {\n\tthis.init.apply(this, arguments);\n};\n\n/**\n * Create the index.\n * @param {Object} keys The object with the keys that the user wishes the index\n * to operate on.\n * @param {Object} options Can be undefined, if passed is an object with arbitrary\n * options keys and values.\n * @param {Collection} collection The collection the index should be created for.\n */\nIndex2d.prototype.init = function (keys, options, collection) {\n\tthis._btree = new BinaryTree();\n\tthis._btree.index(keys);\n\tthis._size = 0;\n\tthis._id = this._itemKeyHash(keys, keys);\n\tthis._debug = options && options.debug ? options.debug : false;\n\n\tthis.unique(options && options.unique ? options.unique : false);\n\n\tif (keys !== undefined) {\n\t\tthis.keys(keys);\n\t}\n\n\tif (collection !== undefined) {\n\t\tthis.collection(collection);\n\t\tthis._btree.primaryKey(collection.primaryKey());\n\t}\n\n\tthis.name(options && options.name ? options.name : this._id);\n\tthis._btree.debug(this._debug);\n};\n\nShared.addModule('Index2d', Index2d);\nShared.mixin(Index2d.prototype, 'Mixin.Common');\nShared.mixin(Index2d.prototype, 'Mixin.ChainReactor');\nShared.mixin(Index2d.prototype, 'Mixin.Sorting');\n\nIndex2d.prototype.id = function () {\n\treturn this._id;\n};\n\nIndex2d.prototype.state = function () {\n\treturn this._state;\n};\n\nIndex2d.prototype.size = function () {\n\treturn this._size;\n};\n\nShared.synthesize(Index2d.prototype, 'data');\nShared.synthesize(Index2d.prototype, 'name');\nShared.synthesize(Index2d.prototype, 'collection');\nShared.synthesize(Index2d.prototype, 'type');\nShared.synthesize(Index2d.prototype, 'unique');\n\nIndex2d.prototype.keys = function (val) {\n\tif (val !== undefined) {\n\t\tthis._keys = val;\n\n\t\t// Count the keys\n\t\tthis._keyCount = sharedPathSolver.parse(this._keys).length;\n\t\treturn this;\n\t}\n\n\treturn this._keys;\n};\n\nIndex2d.prototype.rebuild = function () {\n\t// Do we have a collection?\n\tif (this._collection) {\n\t\t// Get sorted data\n\t\tvar collection = this._collection.subset({}, {\n\t\t\t\t$decouple: false,\n\t\t\t\t$orderBy: this._keys\n\t\t\t}),\n\t\t\tcollectionData = collection.find(),\n\t\t\tdataIndex,\n\t\t\tdataCount = collectionData.length;\n\n\t\t// Clear the index data for the index\n\t\tthis._btree.clear();\n\t\tthis._size = 0;\n\n\t\tif (this._unique) {\n\t\t\tthis._uniqueLookup = {};\n\t\t}\n\n\t\t// Loop the collection data\n\t\tfor (dataIndex = 0; dataIndex < dataCount; dataIndex++) {\n\t\t\tthis.insert(collectionData[dataIndex]);\n\t\t}\n\t}\n\n\tthis._state = {\n\t\tname: this._name,\n\t\tkeys: this._keys,\n\t\tindexSize: this._size,\n\t\tbuilt: new Date(),\n\t\tupdated: new Date(),\n\t\tok: true\n\t};\n};\n\nIndex2d.prototype.insert = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash;\n\n\tdataItem = this.decouple(dataItem);\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tthis._uniqueLookup[uniqueHash] = dataItem;\n\t}\n\n\t// Convert 2d indexed values to geohashes\n\tvar keys = this._btree.keys(),\n\t\tpathVal,\n\t\tgeoHash,\n\t\tlng,\n\t\tlat,\n\t\ti;\n\n\tfor (i = 0; i < keys.length; i++) {\n\t\tpathVal = sharedPathSolver.get(dataItem, keys[i].path);\n\n\t\tif (pathVal instanceof Array) {\n\t\t\tlng = pathVal[0];\n\t\t\tlat = pathVal[1];\n\n\t\t\tgeoHash = sharedGeoHashSolver.encode(lng, lat);\n\n\t\t\tsharedPathSolver.set(dataItem, keys[i].path, geoHash);\n\t\t}\n\t}\n\n\tif (this._btree.insert(dataItem)) {\n\t\tthis._size++;\n\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nIndex2d.prototype.remove = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash;\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tdelete this._uniqueLookup[uniqueHash];\n\t}\n\n\tif (this._btree.remove(dataItem)) {\n\t\tthis._size--;\n\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nIndex2d.prototype.violation = function (dataItem) {\n\t// Generate item hash\n\tvar uniqueHash = this._itemHash(dataItem, this._keys);\n\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndex2d.prototype.hashViolation = function (uniqueHash) {\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndex2d.prototype.lookup = function (query, options) {\n\t// Loop the indexed keys and determine if the query has any operators\n\t// that we want to handle differently from a standard lookup\n\tvar keys = this._btree.keys(),\n\t\tpathStr,\n\t\tpathVal,\n\t\tresults,\n\t\ti;\n\n\tfor (i = 0; i < keys.length; i++) {\n\t\tpathStr = keys[i].path;\n\t\tpathVal = sharedPathSolver.get(query, pathStr);\n\n\t\tif (typeof pathVal === 'object') {\n\t\t\tif (pathVal.$near) {\n\t\t\t\tresults = [];\n\n\t\t\t\t// Do a near point lookup\n\t\t\t\tresults = results.concat(this.near(pathStr, pathVal.$near, options));\n\t\t\t}\n\n\t\t\tif (pathVal.$geoWithin) {\n\t\t\t\tresults = [];\n\n\t\t\t\t// Do a geoWithin shape lookup\n\t\t\t\tresults = results.concat(this.geoWithin(pathStr, pathVal.$geoWithin, options));\n\t\t\t}\n\n\t\t\treturn results;\n\t\t}\n\t}\n\n\treturn this._btree.lookup(query, options);\n};\n\nIndex2d.prototype.near = function (pathStr, query, options) {\n\tvar self = this,\n\t\tgeoHash,\n\t\tneighbours,\n\t\tvisited,\n\t\tsearch,\n\t\tresults,\n\t\tfinalResults = [],\n\t\tprecision,\n\t\tmaxDistanceKm,\n\t\tdistance,\n\t\tdistCache,\n\t\tlatLng,\n\t\tpk = this._collection.primaryKey(),\n\t\ti;\n\n\t// Calculate the required precision to encapsulate the distance\n\t// TODO: Instead of opting for the \"one size larger\" than the distance boxes,\n\t// TODO: we should calculate closest divisible box size as a multiple and then\n\t// TODO: scan neighbours until we have covered the area otherwise we risk\n\t// TODO: opening the results up to vastly more information as the box size\n\t// TODO: increases dramatically between the geohash precisions\n\tif (query.$distanceUnits === 'km') {\n\t\tmaxDistanceKm = query.$maxDistance;\n\n\t\tfor (i = 0; i < geoHashDistance.length; i++) {\n\t\t\tif (maxDistanceKm > geoHashDistance[i]) {\n\t\t\t\tprecision = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (precision === 0) {\n\t\t\tprecision = 1;\n\t\t}\n\t} else if (query.$distanceUnits === 'miles') {\n\t\tmaxDistanceKm = query.$maxDistance * 1.60934;\n\n\t\tfor (i = 0; i < geoHashDistance.length; i++) {\n\t\t\tif (maxDistanceKm > geoHashDistance[i]) {\n\t\t\t\tprecision = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (precision === 0) {\n\t\t\tprecision = 1;\n\t\t}\n\t}\n\n\t// Get the lngLat geohash from the query\n\tgeoHash = sharedGeoHashSolver.encode(query.$point[0], query.$point[1], precision);\n\n\t// Calculate 9 box geohashes\n\tneighbours = sharedGeoHashSolver.calculateNeighbours(geoHash, {type: 'array'});\n\n\t// Lookup all matching co-ordinates from the btree\n\tresults = [];\n\tvisited = 0;\n\n\tfor (i = 0; i < 9; i++) {\n\t\tsearch = this._btree.startsWith(pathStr, neighbours[i]);\n\t\tvisited += search._visited;\n\t\tresults = results.concat(search);\n\t}\n\n\t// Work with original data\n\tresults = this._collection._primaryIndex.lookup(results);\n\n\tif (results.length) {\n\t\tdistance = {};\n\n\t\t// Loop the results and calculate distance\n\t\tfor (i = 0; i < results.length; i++) {\n\t\t\tlatLng = sharedPathSolver.get(results[i], pathStr);\n\t\t\tdistCache = distance[results[i][pk]] = this.distanceBetweenPoints(query.$point[0], query.$point[1], latLng[0], latLng[1]);\n\n\t\t\tif (distCache <= maxDistanceKm) {\n\t\t\t\t// Add item inside radius distance\n\t\t\t\tfinalResults.push(results[i]);\n\t\t\t}\n\t\t}\n\n\t\t// Sort by distance from center\n\t\tfinalResults.sort(function (a, b) {\n\t\t\treturn self.sortAsc(distance[a[pk]], distance[b[pk]]);\n\t\t});\n\t}\n\n\t// Return data\n\treturn finalResults;\n};\n\nIndex2d.prototype.geoWithin = function (pathStr, query, options) {\n\treturn [];\n};\n\nIndex2d.prototype.distanceBetweenPoints = function (lat1, lng1, lat2, lng2) {\n\tvar R = 6371; // kilometres\n\tvar lat1Rad = this.toRadians(lat1);\n\tvar lat2Rad = this.toRadians(lat2);\n\tvar lat2MinusLat1Rad = this.toRadians(lat2-lat1);\n\tvar lng2MinusLng1Rad = this.toRadians(lng2-lng1);\n\n\tvar a = Math.sin(lat2MinusLat1Rad/2) * Math.sin(lat2MinusLat1Rad/2) +\n\t\t\tMath.cos(lat1Rad) * Math.cos(lat2Rad) *\n\t\t\tMath.sin(lng2MinusLng1Rad/2) * Math.sin(lng2MinusLng1Rad/2);\n\n\tvar c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1-a));\n\n\treturn R * c;\n};\n\nIndex2d.prototype.toRadians = function (degrees) {\n\treturn degrees * 0.01747722222222;\n};\n\nIndex2d.prototype.match = function (query, options) {\n\t// TODO: work out how to represent that this is a better match if the query has $near than\n\t// TODO: a basic btree index which will not be able to resolve a $near operator\n\treturn this._btree.match(query, options);\n};\n\nIndex2d.prototype._itemHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.value(item, pathData[k].path).join(':');\n\t}\n\n\treturn hash;\n};\n\nIndex2d.prototype._itemKeyHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.keyValue(item, pathData[k].path);\n\t}\n\n\treturn hash;\n};\n\nIndex2d.prototype._itemHashArr = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\t//hash = '',\n\t\thashArr = [],\n\t\tvalArr,\n\t\ti, k, j;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tvalArr = path.value(item, pathData[k].path);\n\n\t\tfor (i = 0; i < valArr.length; i++) {\n\t\t\tif (k === 0) {\n\t\t\t\t// Setup the initial hash array\n\t\t\t\thashArr.push(valArr[i]);\n\t\t\t} else {\n\t\t\t\t// Loop the hash array and concat the value to it\n\t\t\t\tfor (j = 0; j < hashArr.length; j++) {\n\t\t\t\t\thashArr[j] = hashArr[j] + '_' + valArr[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn hashArr;\n};\n\n// Register this index on the shared object\nShared.index['2d'] = Index2d;\n\nShared.finishModule('Index2d');\nmodule.exports = Index2d;\n},{\"./BinaryTree\":3,\"./GeoHash\":9,\"./Path\":27,\"./Shared\":33}],11:[function(_dereq_,module,exports){\n\"use strict\";\n\n/*\nname(string)\nid(string)\nrebuild(null)\nstate ?? needed?\nmatch(query, options)\nlookup(query, options)\ninsert(doc)\nremove(doc)\nprimaryKey(string)\ncollection(collection)\n*/\n\nvar Shared = _dereq_('./Shared'),\n\tPath = _dereq_('./Path'),\n\tBinaryTree = _dereq_('./BinaryTree');\n\n/**\n * The index class used to instantiate btree indexes that the database can\n * use to speed up queries on collections and views.\n * @constructor\n */\nvar IndexBinaryTree = function () {\n\tthis.init.apply(this, arguments);\n};\n\nIndexBinaryTree.prototype.init = function (keys, options, collection) {\n\tthis._btree = new BinaryTree();\n\tthis._btree.index(keys);\n\tthis._size = 0;\n\tthis._id = this._itemKeyHash(keys, keys);\n\tthis._debug = options && options.debug ? options.debug : false;\n\n\tthis.unique(options && options.unique ? options.unique : false);\n\n\tif (keys !== undefined) {\n\t\tthis.keys(keys);\n\t}\n\n\tif (collection !== undefined) {\n\t\tthis.collection(collection);\n\t\tthis._btree.primaryKey(collection.primaryKey());\n\t}\n\n\tthis.name(options && options.name ? options.name : this._id);\n\tthis._btree.debug(this._debug);\n};\n\nShared.addModule('IndexBinaryTree', IndexBinaryTree);\nShared.mixin(IndexBinaryTree.prototype, 'Mixin.ChainReactor');\nShared.mixin(IndexBinaryTree.prototype, 'Mixin.Sorting');\n\nIndexBinaryTree.prototype.id = function () {\n\treturn this._id;\n};\n\nIndexBinaryTree.prototype.state = function () {\n\treturn this._state;\n};\n\nIndexBinaryTree.prototype.size = function () {\n\treturn this._size;\n};\n\nShared.synthesize(IndexBinaryTree.prototype, 'data');\nShared.synthesize(IndexBinaryTree.prototype, 'name');\nShared.synthesize(IndexBinaryTree.prototype, 'collection');\nShared.synthesize(IndexBinaryTree.prototype, 'type');\nShared.synthesize(IndexBinaryTree.prototype, 'unique');\n\nIndexBinaryTree.prototype.keys = function (val) {\n\tif (val !== undefined) {\n\t\tthis._keys = val;\n\n\t\t// Count the keys\n\t\tthis._keyCount = (new Path()).parse(this._keys).length;\n\t\treturn this;\n\t}\n\n\treturn this._keys;\n};\n\nIndexBinaryTree.prototype.rebuild = function () {\n\t// Do we have a collection?\n\tif (this._collection) {\n\t\t// Get sorted data\n\t\tvar collection = this._collection.subset({}, {\n\t\t\t\t$decouple: false,\n\t\t\t\t$orderBy: this._keys\n\t\t\t}),\n\t\t\tcollectionData = collection.find(),\n\t\t\tdataIndex,\n\t\t\tdataCount = collectionData.length;\n\n\t\t// Clear the index data for the index\n\t\tthis._btree.clear();\n\t\tthis._size = 0;\n\n\t\tif (this._unique) {\n\t\t\tthis._uniqueLookup = {};\n\t\t}\n\n\t\t// Loop the collection data\n\t\tfor (dataIndex = 0; dataIndex < dataCount; dataIndex++) {\n\t\t\tthis.insert(collectionData[dataIndex]);\n\t\t}\n\t}\n\n\tthis._state = {\n\t\tname: this._name,\n\t\tkeys: this._keys,\n\t\tindexSize: this._size,\n\t\tbuilt: new Date(),\n\t\tupdated: new Date(),\n\t\tok: true\n\t};\n};\n\nIndexBinaryTree.prototype.insert = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash;\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tthis._uniqueLookup[uniqueHash] = dataItem;\n\t}\n\n\tif (this._btree.insert(dataItem)) {\n\t\tthis._size++;\n\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nIndexBinaryTree.prototype.remove = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash;\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tdelete this._uniqueLookup[uniqueHash];\n\t}\n\n\tif (this._btree.remove(dataItem)) {\n\t\tthis._size--;\n\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nIndexBinaryTree.prototype.violation = function (dataItem) {\n\t// Generate item hash\n\tvar uniqueHash = this._itemHash(dataItem, this._keys);\n\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndexBinaryTree.prototype.hashViolation = function (uniqueHash) {\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndexBinaryTree.prototype.lookup = function (query, options) {\n\treturn this._btree.lookup(query, options);\n};\n\nIndexBinaryTree.prototype.match = function (query, options) {\n\treturn this._btree.match(query, options);\n};\n\nIndexBinaryTree.prototype._itemHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.value(item, pathData[k].path).join(':');\n\t}\n\n\treturn hash;\n};\n\nIndexBinaryTree.prototype._itemKeyHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.keyValue(item, pathData[k].path);\n\t}\n\n\treturn hash;\n};\n\nIndexBinaryTree.prototype._itemHashArr = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\t//hash = '',\n\t\thashArr = [],\n\t\tvalArr,\n\t\ti, k, j;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tvalArr = path.value(item, pathData[k].path);\n\n\t\tfor (i = 0; i < valArr.length; i++) {\n\t\t\tif (k === 0) {\n\t\t\t\t// Setup the initial hash array\n\t\t\t\thashArr.push(valArr[i]);\n\t\t\t} else {\n\t\t\t\t// Loop the hash array and concat the value to it\n\t\t\t\tfor (j = 0; j < hashArr.length; j++) {\n\t\t\t\t\thashArr[j] = hashArr[j] + '_' + valArr[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn hashArr;\n};\n\n// Register this index on the shared object\nShared.index.btree = IndexBinaryTree;\n\nShared.finishModule('IndexBinaryTree');\nmodule.exports = IndexBinaryTree;\n},{\"./BinaryTree\":3,\"./Path\":27,\"./Shared\":33}],12:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tPath = _dereq_('./Path');\n\n/**\n * The index class used to instantiate hash map indexes that the database can\n * use to speed up queries on collections and views.\n * @constructor\n */\nvar IndexHashMap = function () {\n\tthis.init.apply(this, arguments);\n};\n\nIndexHashMap.prototype.init = function (keys, options, collection) {\n\tthis._crossRef = {};\n\tthis._size = 0;\n\tthis._id = this._itemKeyHash(keys, keys);\n\n\tthis.data({});\n\tthis.unique(options && options.unique ? options.unique : false);\n\n\tif (keys !== undefined) {\n\t\tthis.keys(keys);\n\t}\n\n\tif (collection !== undefined) {\n\t\tthis.collection(collection);\n\t}\n\n\tthis.name(options && options.name ? options.name : this._id);\n};\n\nShared.addModule('IndexHashMap', IndexHashMap);\nShared.mixin(IndexHashMap.prototype, 'Mixin.ChainReactor');\n\nIndexHashMap.prototype.id = function () {\n\treturn this._id;\n};\n\nIndexHashMap.prototype.state = function () {\n\treturn this._state;\n};\n\nIndexHashMap.prototype.size = function () {\n\treturn this._size;\n};\n\nShared.synthesize(IndexHashMap.prototype, 'data');\nShared.synthesize(IndexHashMap.prototype, 'name');\nShared.synthesize(IndexHashMap.prototype, 'collection');\nShared.synthesize(IndexHashMap.prototype, 'type');\nShared.synthesize(IndexHashMap.prototype, 'unique');\n\nIndexHashMap.prototype.keys = function (val) {\n\tif (val !== undefined) {\n\t\tthis._keys = val;\n\n\t\t// Count the keys\n\t\tthis._keyCount = (new Path()).parse(this._keys).length;\n\t\treturn this;\n\t}\n\n\treturn this._keys;\n};\n\nIndexHashMap.prototype.rebuild = function () {\n\t// Do we have a collection?\n\tif (this._collection) {\n\t\t// Get sorted data\n\t\tvar collection = this._collection.subset({}, {\n\t\t\t\t$decouple: false,\n\t\t\t\t$orderBy: this._keys\n\t\t\t}),\n\t\t\tcollectionData = collection.find(),\n\t\t\tdataIndex,\n\t\t\tdataCount = collectionData.length;\n\n\t\t// Clear the index data for the index\n\t\tthis._data = {};\n\t\tthis._size = 0;\n\n\t\tif (this._unique) {\n\t\t\tthis._uniqueLookup = {};\n\t\t}\n\n\t\t// Loop the collection data\n\t\tfor (dataIndex = 0; dataIndex < dataCount; dataIndex++) {\n\t\t\tthis.insert(collectionData[dataIndex]);\n\t\t}\n\t}\n\n\tthis._state = {\n\t\tname: this._name,\n\t\tkeys: this._keys,\n\t\tindexSize: this._size,\n\t\tbuilt: new Date(),\n\t\tupdated: new Date(),\n\t\tok: true\n\t};\n};\n\nIndexHashMap.prototype.insert = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash,\n\t\titemHashArr,\n\t\thashIndex;\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tthis._uniqueLookup[uniqueHash] = dataItem;\n\t}\n\n\t// Generate item hash\n\titemHashArr = this._itemHashArr(dataItem, this._keys);\n\n\t// Get the path search results and store them\n\tfor (hashIndex = 0; hashIndex < itemHashArr.length; hashIndex++) {\n\t\tthis.pushToPathValue(itemHashArr[hashIndex], dataItem);\n\t}\n};\n\nIndexHashMap.prototype.update = function (dataItem, options) {\n\t// TODO: Write updates to work\n\t// 1: Get uniqueHash for the dataItem primary key value (may need to generate a store for this)\n\t// 2: Remove the uniqueHash as it currently stands\n\t// 3: Generate a new uniqueHash for dataItem\n\t// 4: Insert the new uniqueHash\n};\n\nIndexHashMap.prototype.remove = function (dataItem, options) {\n\tvar uniqueFlag = this._unique,\n\t\tuniqueHash,\n\t\titemHashArr,\n\t\thashIndex;\n\n\tif (uniqueFlag) {\n\t\tuniqueHash = this._itemHash(dataItem, this._keys);\n\t\tdelete this._uniqueLookup[uniqueHash];\n\t}\n\n\t// Generate item hash\n\titemHashArr = this._itemHashArr(dataItem, this._keys);\n\n\t// Get the path search results and store them\n\tfor (hashIndex = 0; hashIndex < itemHashArr.length; hashIndex++) {\n\t\tthis.pullFromPathValue(itemHashArr[hashIndex], dataItem);\n\t}\n};\n\nIndexHashMap.prototype.violation = function (dataItem) {\n\t// Generate item hash\n\tvar uniqueHash = this._itemHash(dataItem, this._keys);\n\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndexHashMap.prototype.hashViolation = function (uniqueHash) {\n\t// Check if the item breaks the unique constraint\n\treturn Boolean(this._uniqueLookup[uniqueHash]);\n};\n\nIndexHashMap.prototype.pushToPathValue = function (hash, obj) {\n\tvar pathValArr = this._data[hash] = this._data[hash] || [];\n\n\t// Make sure we have not already indexed this object at this path/value\n\tif (pathValArr.indexOf(obj) === -1) {\n\t\t// Index the object\n\t\tpathValArr.push(obj);\n\n\t\t// Record the reference to this object in our index size\n\t\tthis._size++;\n\n\t\t// Cross-reference this association for later lookup\n\t\tthis.pushToCrossRef(obj, pathValArr);\n\t}\n};\n\nIndexHashMap.prototype.pullFromPathValue = function (hash, obj) {\n\tvar pathValArr = this._data[hash],\n\t\tindexOfObject;\n\n\t// Make sure we have already indexed this object at this path/value\n\tindexOfObject = pathValArr.indexOf(obj);\n\n\tif (indexOfObject > -1) {\n\t\t// Un-index the object\n\t\tpathValArr.splice(indexOfObject, 1);\n\n\t\t// Record the reference to this object in our index size\n\t\tthis._size--;\n\n\t\t// Remove object cross-reference\n\t\tthis.pullFromCrossRef(obj, pathValArr);\n\t}\n\n\t// Check if we should remove the path value array\n\tif (!pathValArr.length) {\n\t\t// Remove the array\n\t\tdelete this._data[hash];\n\t}\n};\n\nIndexHashMap.prototype.pull = function (obj) {\n\t// Get all places the object has been used and remove them\n\tvar id = obj[this._collection.primaryKey()],\n\t\tcrossRefArr = this._crossRef[id],\n\t\tarrIndex,\n\t\tarrCount = crossRefArr.length,\n\t\tarrItem;\n\n\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\tarrItem = crossRefArr[arrIndex];\n\n\t\t// Remove item from this index lookup array\n\t\tthis._pullFromArray(arrItem, obj);\n\t}\n\n\t// Record the reference to this object in our index size\n\tthis._size--;\n\n\t// Now remove the cross-reference entry for this object\n\tdelete this._crossRef[id];\n};\n\nIndexHashMap.prototype._pullFromArray = function (arr, obj) {\n\tvar arrCount = arr.length;\n\n\twhile (arrCount--) {\n\t\tif (arr[arrCount] === obj) {\n\t\t\tarr.splice(arrCount, 1);\n\t\t}\n\t}\n};\n\nIndexHashMap.prototype.pushToCrossRef = function (obj, pathValArr) {\n\tvar id = obj[this._collection.primaryKey()],\n\t\tcrObj;\n\n\tthis._crossRef[id] = this._crossRef[id] || [];\n\n\t// Check if the cross-reference to the pathVal array already exists\n\tcrObj = this._crossRef[id];\n\n\tif (crObj.indexOf(pathValArr) === -1) {\n\t\t// Add the cross-reference\n\t\tcrObj.push(pathValArr);\n\t}\n};\n\nIndexHashMap.prototype.pullFromCrossRef = function (obj, pathValArr) {\n\tvar id = obj[this._collection.primaryKey()];\n\n\tdelete this._crossRef[id];\n};\n\nIndexHashMap.prototype.lookup = function (query) {\n\treturn this._data[this._itemHash(query, this._keys)] || [];\n};\n\nIndexHashMap.prototype.match = function (query, options) {\n\t// Check if the passed query has data in the keys our index\n\t// operates on and if so, is the query sort matching our order\n\tvar pathSolver = new Path();\n\tvar indexKeyArr = pathSolver.parseArr(this._keys),\n\t\tqueryArr = pathSolver.parseArr(query),\n\t\tmatchedKeys = [],\n\t\tmatchedKeyCount = 0,\n\t\ti;\n\n\t// Loop the query array and check the order of keys against the\n\t// index key array to see if this index can be used\n\tfor (i = 0; i < indexKeyArr.length; i++) {\n\t\tif (queryArr[i] === indexKeyArr[i]) {\n\t\t\tmatchedKeyCount++;\n\t\t\tmatchedKeys.push(queryArr[i]);\n\t\t} else {\n\t\t\t// Query match failed - this is a hash map index so partial key match won't work\n\t\t\treturn {\n\t\t\t\tmatchedKeys: [],\n\t\t\t\ttotalKeyCount: queryArr.length,\n\t\t\t\tscore: 0\n\t\t\t};\n\t\t}\n\t}\n\n\treturn {\n\t\tmatchedKeys: matchedKeys,\n\t\ttotalKeyCount: queryArr.length,\n\t\tscore: matchedKeyCount\n\t};\n\n\t//return pathSolver.countObjectPaths(this._keys, query);\n};\n\nIndexHashMap.prototype._itemHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.value(item, pathData[k].path).join(':');\n\t}\n\n\treturn hash;\n};\n\nIndexHashMap.prototype._itemKeyHash = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\thash = '',\n\t\tk;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tif (hash) { hash += '_'; }\n\t\thash += path.keyValue(item, pathData[k].path);\n\t}\n\n\treturn hash;\n};\n\nIndexHashMap.prototype._itemHashArr = function (item, keys) {\n\tvar path = new Path(),\n\t\tpathData,\n\t\t//hash = '',\n\t\thashArr = [],\n\t\tvalArr,\n\t\ti, k, j;\n\n\tpathData = path.parse(keys);\n\n\tfor (k = 0; k < pathData.length; k++) {\n\t\tvalArr = path.value(item, pathData[k].path);\n\n\t\tfor (i = 0; i < valArr.length; i++) {\n\t\t\tif (k === 0) {\n\t\t\t\t// Setup the initial hash array\n\t\t\t\thashArr.push(valArr[i]);\n\t\t\t} else {\n\t\t\t\t// Loop the hash array and concat the value to it\n\t\t\t\tfor (j = 0; j < hashArr.length; j++) {\n\t\t\t\t\thashArr[j] = hashArr[j] + '_' + valArr[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn hashArr;\n};\n\n// Register this index on the shared object\nShared.index.hashed = IndexHashMap;\n\nShared.finishModule('IndexHashMap');\nmodule.exports = IndexHashMap;\n},{\"./Path\":27,\"./Shared\":33}],13:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared');\n\n/**\n * The key value store class used when storing basic in-memory KV data,\n * and can be queried for quick retrieval. Mostly used for collection\n * primary key indexes and lookups.\n * @param {String=} name Optional KV store name.\n * @constructor\n */\nvar KeyValueStore = function (name) {\n\tthis.init.apply(this, arguments);\n};\n\nKeyValueStore.prototype.init = function (name) {\n\tthis._name = name;\n\tthis._data = {};\n\tthis._primaryKey = '_id';\n};\n\nShared.addModule('KeyValueStore', KeyValueStore);\nShared.mixin(KeyValueStore.prototype, 'Mixin.ChainReactor');\n\n/**\n * Get / set the name of the key/value store.\n * @param {String} val The name to set.\n * @returns {*}\n */\nShared.synthesize(KeyValueStore.prototype, 'name');\n\n/**\n * Get / set the primary key.\n * @param {String} key The key to set.\n * @returns {*}\n */\nKeyValueStore.prototype.primaryKey = function (key) {\n\tif (key !== undefined) {\n\t\tthis._primaryKey = key;\n\t\treturn this;\n\t}\n\n\treturn this._primaryKey;\n};\n\n/**\n * Removes all data from the store.\n * @returns {*}\n */\nKeyValueStore.prototype.truncate = function () {\n\tthis._data = {};\n\treturn this;\n};\n\n/**\n * Sets data against a key in the store.\n * @param {String} key The key to set data for.\n * @param {*} value The value to assign to the key.\n * @returns {*}\n */\nKeyValueStore.prototype.set = function (key, value) {\n\tthis._data[key] = value ? value : true;\n\treturn this;\n};\n\n/**\n * Gets data stored for the passed key.\n * @param {String} key The key to get data for.\n * @returns {*}\n */\nKeyValueStore.prototype.get = function (key) {\n\treturn this._data[key];\n};\n\n/**\n * Get / set the primary key.\n * @param {*} val A lookup query.\n * @returns {*}\n */\nKeyValueStore.prototype.lookup = function (val) {\n\tvar pk = this._primaryKey,\n\t\tvalType = typeof val,\n\t\tarrIndex,\n\t\tarrCount,\n\t\tlookupItem,\n\t\tresult = [];\n\n\t// Check for early exit conditions\n\tif (valType === 'string' || valType === 'number') {\n\t\tlookupItem = this.get(val);\n\t\tif (lookupItem !== undefined) {\n\t\t\treturn [lookupItem];\n\t\t} else {\n\t\t\treturn [];\n\t\t}\n\t} else if (valType === 'object') {\n\t\tif (val instanceof Array) {\n\t\t\t// An array of primary keys, find all matches\n\t\t\tarrCount = val.length;\n\t\t\tresult = [];\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tlookupItem = this.lookup(val[arrIndex]);\n\n\t\t\t\tif (lookupItem) {\n\t\t\t\t\tif (lookupItem instanceof Array) {\n\t\t\t\t\t\tresult = result.concat(lookupItem);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresult.push(lookupItem);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t} else if (val[pk]) {\n\t\t\treturn this.lookup(val[pk]);\n\t\t}\n\t}\n\n\t// COMMENTED AS CODE WILL NEVER BE REACHED\n\t// Complex lookup\n\t/*lookupData = this._lookupKeys(val);\n\tkeys = lookupData.keys;\n\tnegate = lookupData.negate;\n\n\tif (!negate) {\n\t\t// Loop keys and return values\n\t\tfor (arrIndex = 0; arrIndex < keys.length; arrIndex++) {\n\t\t\tresult.push(this.get(keys[arrIndex]));\n\t\t}\n\t} else {\n\t\t// Loop data and return non-matching keys\n\t\tfor (arrIndex in this._data) {\n\t\t\tif (this._data.hasOwnProperty(arrIndex)) {\n\t\t\t\tif (keys.indexOf(arrIndex) === -1) {\n\t\t\t\t\tresult.push(this.get(arrIndex));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;*/\n};\n\n// COMMENTED AS WE ARE NOT CURRENTLY PASSING COMPLEX QUERIES TO KEYVALUESTORE INDEXES\n/*KeyValueStore.prototype._lookupKeys = function (val) {\n\tvar pk = this._primaryKey,\n\t\tvalType = typeof val,\n\t\tarrIndex,\n\t\tarrCount,\n\t\tlookupItem,\n\t\tbool,\n\t\tresult;\n\n\tif (valType === 'string' || valType === 'number') {\n\t\treturn {\n\t\t\tkeys: [val],\n\t\t\tnegate: false\n\t\t};\n\t} else if (valType === 'object') {\n\t\tif (val instanceof RegExp) {\n\t\t\t// Create new data\n\t\t\tresult = [];\n\n\t\t\tfor (arrIndex in this._data) {\n\t\t\t\tif (this._data.hasOwnProperty(arrIndex)) {\n\t\t\t\t\tif (val.test(arrIndex)) {\n\t\t\t\t\t\tresult.push(arrIndex);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tkeys: result,\n\t\t\t\tnegate: false\n\t\t\t};\n\t\t} else if (val instanceof Array) {\n\t\t\t// An array of primary keys, find all matches\n\t\t\tarrCount = val.length;\n\t\t\tresult = [];\n\n\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\tresult = result.concat(this._lookupKeys(val[arrIndex]).keys);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tkeys: result,\n\t\t\t\tnegate: false\n\t\t\t};\n\t\t} else if (val.$in && (val.$in instanceof Array)) {\n\t\t\treturn {\n\t\t\t\tkeys: this._lookupKeys(val.$in).keys,\n\t\t\t\tnegate: false\n\t\t\t};\n\t\t} else if (val.$nin && (val.$nin instanceof Array)) {\n\t\t\treturn {\n\t\t\t\tkeys: this._lookupKeys(val.$nin).keys,\n\t\t\t\tnegate: true\n\t\t\t};\n\t\t} else if (val.$ne) {\n\t\t\treturn {\n\t\t\t\tkeys: this._lookupKeys(val.$ne, true).keys,\n\t\t\t\tnegate: true\n\t\t\t};\n\t\t} else if (val.$or && (val.$or instanceof Array)) {\n\t\t\t// Create new data\n\t\t\tresult = [];\n\n\t\t\tfor (arrIndex = 0; arrIndex < val.$or.length; arrIndex++) {\n\t\t\t\tresult = result.concat(this._lookupKeys(val.$or[arrIndex]).keys);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tkeys: result,\n\t\t\t\tnegate: false\n\t\t\t};\n\t\t} else if (val[pk]) {\n\t\t\treturn this._lookupKeys(val[pk]);\n\t\t}\n\t}\n};*/\n\n/**\n * Removes data for the given key from the store.\n * @param {String} key The key to un-set.\n * @returns {*}\n */\nKeyValueStore.prototype.unSet = function (key) {\n\tdelete this._data[key];\n\treturn this;\n};\n\n/**\n * Sets data for the give key in the store only where the given key\n * does not already have a value in the store.\n * @param {String} key The key to set data for.\n * @param {*} value The value to assign to the key.\n * @returns {Boolean} True if data was set or false if data already\n * exists for the key.\n */\nKeyValueStore.prototype.uniqueSet = function (key, value) {\n\tif (this._data[key] === undefined) {\n\t\tthis._data[key] = value;\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\nShared.finishModule('KeyValueStore');\nmodule.exports = KeyValueStore;\n},{\"./Shared\":33}],14:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tOperation = _dereq_('./Operation');\n\n/**\n * The metrics class used to store details about operations.\n * @constructor\n */\nvar Metrics = function () {\n\tthis.init.apply(this, arguments);\n};\n\nMetrics.prototype.init = function () {\n\tthis._data = [];\n};\n\nShared.addModule('Metrics', Metrics);\nShared.mixin(Metrics.prototype, 'Mixin.ChainReactor');\n\n/**\n * Creates an operation within the metrics instance and if metrics\n * are currently enabled (by calling the start() method) the operation\n * is also stored in the metrics log.\n * @param {String} name The name of the operation.\n * @returns {Operation}\n */\nMetrics.prototype.create = function (name) {\n\tvar op = new Operation(name);\n\n\tif (this._enabled) {\n\t\tthis._data.push(op);\n\t}\n\n\treturn op;\n};\n\n/**\n * Starts logging operations.\n * @returns {Metrics}\n */\nMetrics.prototype.start = function () {\n\tthis._enabled = true;\n\treturn this;\n};\n\n/**\n * Stops logging operations.\n * @returns {Metrics}\n */\nMetrics.prototype.stop = function () {\n\tthis._enabled = false;\n\treturn this;\n};\n\n/**\n * Clears all logged operations.\n * @returns {Metrics}\n */\nMetrics.prototype.clear = function () {\n\tthis._data = [];\n\treturn this;\n};\n\n/**\n * Returns an array of all logged operations.\n * @returns {Array}\n */\nMetrics.prototype.list = function () {\n\treturn this._data;\n};\n\nShared.finishModule('Metrics');\nmodule.exports = Metrics;\n},{\"./Operation\":25,\"./Shared\":33}],15:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar CRUD = {\n\tpreSetData: function () {\n\t\t\n\t},\n\t\n\tpostSetData: function () {\n\t\t\n\t}\n};\n\nmodule.exports = CRUD;\n},{}],16:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * The chain reactor mixin, provides methods to the target object that allow chain\n * reaction events to propagate to the target and be handled, processed and passed\n * on down the chain.\n * @mixin\n */\nvar ChainReactor = {\n\t/**\n\t * Creates a chain link between the current reactor node and the passed\n\t * reactor node. Chain packets that are send by this reactor node will\n\t * then be propagated to the passed node for subsequent packets.\n\t * @param {*} obj The chain reactor node to link to.\n\t */\n\tchain: function (obj) {\n\t\tif (this.debug && this.debug()) {\n\t\t\tif (obj._reactorIn && obj._reactorOut) {\n\t\t\t\tconsole.log(obj._reactorIn.logIdentifier() + ' Adding target \"' + obj._reactorOut.instanceIdentifier() + '\" to the chain reactor target list');\n\t\t\t} else {\n\t\t\t\tconsole.log(this.logIdentifier() + ' Adding target \"' + obj.instanceIdentifier() + '\" to the chain reactor target list');\n\t\t\t}\n\t\t}\n\n\t\tthis._chain = this._chain || [];\n\t\tvar index = this._chain.indexOf(obj);\n\n\t\tif (index === -1) {\n\t\t\tthis._chain.push(obj);\n\t\t}\n\t},\n\n\t/**\n\t * Removes a chain link between the current reactor node and the passed\n\t * reactor node. Chain packets sent from this reactor node will no longer\n\t * be received by the passed node.\n\t * @param {*} obj The chain reactor node to unlink from.\n\t */\n\tunChain: function (obj) {\n\t\tif (this.debug && this.debug()) {\n\t\t\tif (obj._reactorIn && obj._reactorOut) {\n\t\t\t\tconsole.log(obj._reactorIn.logIdentifier() + ' Removing target \"' + obj._reactorOut.instanceIdentifier() + '\" from the chain reactor target list');\n\t\t\t} else {\n\t\t\t\tconsole.log(this.logIdentifier() + ' Removing target \"' + obj.instanceIdentifier() + '\" from the chain reactor target list');\n\t\t\t}\n\t\t}\n\n\t\tif (this._chain) {\n\t\t\tvar index = this._chain.indexOf(obj);\n\n\t\t\tif (index > -1) {\n\t\t\t\tthis._chain.splice(index, 1);\n\t\t\t}\n\t\t}\n\t},\n\n\t/**\n\t * Determines if this chain reactor node has any listeners downstream.\n\t * @returns {Boolean} True if there are nodes downstream of this node.\n\t */\n\tchainWillSend: function () {\n\t\treturn Boolean(this._chain);\n\t},\n\n\t/**\n\t * Sends a chain reactor packet downstream from this node to any of its\n\t * chained targets that were linked to this node via a call to chain().\n\t * @param {String} type The type of chain reactor packet to send. This\n\t * can be any string but the receiving reactor nodes will not react to\n\t * it unless they recognise the string. Built-in strings include: \"insert\",\n\t * \"update\", \"remove\", \"setData\" and \"debug\".\n\t * @param {Object} data A data object that usually contains a key called\n\t * \"dataSet\" which is an array of items to work on, and can contain other\n\t * custom keys that help describe the operation.\n\t * @param {Object=} options An options object. Can also contain custom\n\t * key/value pairs that your custom chain reactor code can operate on.\n\t */\n\tchainSend: function (type, data, options) {\n\t\tif (this._chain) {\n\t\t\tvar arr = this._chain,\n\t\t\t\tarrItem,\n\t\t\t\tcount = arr.length,\n\t\t\t\tindex,\n\t\t\t\tdataCopy = this.decouple(data, count);\n\n\t\t\tfor (index = 0; index < count; index++) {\n\t\t\t\tarrItem = arr[index];\n\n\t\t\t\tif (!arrItem._state || (arrItem._state && !arrItem.isDropped())) {\n\t\t\t\t\tif (this.debug && this.debug()) {\n\t\t\t\t\t\tif (arrItem._reactorIn && arrItem._reactorOut) {\n\t\t\t\t\t\t\tconsole.log(arrItem._reactorIn.logIdentifier() + ' Sending data down the chain reactor pipe to \"' + arrItem._reactorOut.instanceIdentifier() + '\"');\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tconsole.log(this.logIdentifier() + ' Sending data down the chain reactor pipe to \"' + arrItem.instanceIdentifier() + '\"');\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (arrItem.chainReceive) {\n\t\t\t\t\t\tarrItem.chainReceive(this, type, dataCopy[index], options);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tconsole.log('Reactor Data:', type, data, options);\n\t\t\t\t\tconsole.log('Reactor Node:', arrItem);\n\t\t\t\t\tthrow('Chain reactor attempting to send data to target reactor node that is in a dropped state!');\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t},\n\n\t/**\n\t * Handles receiving a chain reactor message that was sent via the chainSend()\n\t * method. Creates the chain packet object and then allows it to be processed.\n\t * @param {Object} sender The node that is sending the packet.\n\t * @param {String} type The type of packet.\n\t * @param {Object} data The data related to the packet.\n\t * @param {Object=} options An options object.\n\t */\n\tchainReceive: function (sender, type, data, options) {\n\t\tvar chainPacket = {\n\t\t\t\tsender: sender,\n\t\t\t\ttype: type,\n\t\t\t\tdata: data,\n\t\t\t\toptions: options\n\t\t\t},\n\t\t\tcancelPropagate = false;\n\n\t\tif (this.debug && this.debug()) {\n\t\t\tconsole.log(this.logIdentifier() + ' Received data from parent reactor node');\n\t\t}\n\n\t\t// Check if we have a chain handler method\n\t\tif (this._chainHandler) {\n\t\t\t// Fire our internal handler\n\t\t\tcancelPropagate = this._chainHandler(chainPacket);\n\t\t}\n\n\t\t// Check if we were told to cancel further propagation\n\t\tif (!cancelPropagate) {\n\t\t\t// Propagate the message down the chain\n\t\t\tthis.chainSend(chainPacket.type, chainPacket.data, chainPacket.options);\n\t\t}\n\t}\n};\n\nmodule.exports = ChainReactor;\n},{}],17:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar idCounter = 0,\n\tOverload = _dereq_('./Overload'),\n\tSerialiser = _dereq_('./Serialiser'),\n\tCommon,\n\tserialiser = new Serialiser();\n\n/**\n * Provides commonly used methods to most classes in ForerunnerDB.\n * @mixin\n */\nCommon = {\n\t// Expose the serialiser object so it can be extended with new data handlers.\n\tserialiser: serialiser,\n\n\t/**\n\t * Generates a JSON serialisation-compatible object instance. After the\n\t * instance has been passed through this method, it will be able to survive\n\t * a JSON.stringify() and JSON.parse() cycle and still end up as an\n\t * instance at the end. Further information about this process can be found\n\t * in the ForerunnerDB wiki at: https://github.com/Irrelon/ForerunnerDB/wiki/Serialiser-&-Performance-Benchmarks\n\t * @param {*} val The object instance such as \"new Date()\" or \"new RegExp()\".\n\t */\n\tmake: function (val) {\n\t\t// This is a conversion request, hand over to serialiser\n\t\treturn serialiser.convert(val);\n\t},\n\n\t/**\n\t * Gets / sets data in the item store. The store can be used to set and\n\t * retrieve data against a key. Useful for adding arbitrary key/value data\n\t * to a collection / view etc and retrieving it later.\n\t * @param {String|*} key The key under which to store the passed value or\n\t * retrieve the existing stored value.\n\t * @param {*=} val Optional value. If passed will overwrite the existing value\n\t * stored against the specified key if one currently exists.\n\t * @returns {*}\n\t */\n\tstore: function (key, val) {\n\t\tif (key !== undefined) {\n\t\t\tif (val !== undefined) {\n\t\t\t\t// Store the data\n\t\t\t\tthis._store = this._store || {};\n\t\t\t\tthis._store[key] = val;\n\n\t\t\t\treturn this;\n\t\t\t}\n\n\t\t\tif (this._store) {\n\t\t\t\treturn this._store[key];\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t},\n\n\t/**\n\t * Removes a previously stored key/value pair from the item store, set previously\n\t * by using the store() method.\n\t * @param {String|*} key The key of the key/value pair to remove;\n\t * @returns {Common} Returns this for chaining.\n\t */\n\tunStore: function (key) {\n\t\tif (key !== undefined) {\n\t\t\tdelete this._store[key];\n\t\t}\n\n\t\treturn this;\n\t},\n\n\t/**\n\t * Returns a non-referenced version of the passed object / array.\n\t * @param {Object} data The object or array to return as a non-referenced version.\n\t * @param {Number=} copies Optional number of copies to produce. If specified, the return\n\t * value will be an array of decoupled objects, each distinct from the other.\n\t * @returns {*}\n\t */\t\n\tdecouple: function (data, copies) {\n\t\tif (data !== undefined && data !== \"\") {\n\t\t\tif (!copies) {\n\t\t\t\treturn this.jParse(this.jStringify(data));\n\t\t\t} else {\n\t\t\t\tvar i,\n\t\t\t\t\tjson = this.jStringify(data),\n\t\t\t\t\tcopyArr = [];\n\n\t\t\t\tfor (i = 0; i < copies; i++) {\n\t\t\t\t\tcopyArr.push(this.jParse(json));\n\t\t\t\t}\n\n\t\t\t\treturn copyArr;\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t},\n\n\t/**\n\t * Parses and returns data from stringified version.\n\t * @param {String} data The stringified version of data to parse.\n\t * @returns {Object} The parsed JSON object from the data.\n\t */\n\tjParse: function (data) {\n\t\treturn JSON.parse(data, serialiser.reviver());\n\t},\n\n\t/**\n\t * Converts a JSON object into a stringified version.\n\t * @param {Object} data The data to stringify.\n\t * @returns {String} The stringified data.\n\t */\n\tjStringify: function (data) {\n\t\t//return serialiser.stringify(data);\n\t\treturn JSON.stringify(data);\n\t},\n\t\n\t/**\n\t * Generates a new 16-character hexadecimal unique ID or\n\t * generates a new 16-character hexadecimal ID based on\n\t * the passed string. Will always generate the same ID\n\t * for the same string.\n\t * @param {String=} str A string to generate the ID from.\n\t * @return {String}\n\t */\n\tobjectId: function (str) {\n\t\tvar id,\n\t\t\tpow = Math.pow(10, 17);\n\n\t\tif (!str) {\n\t\t\tidCounter++;\n\n\t\t\tid = (idCounter + (\n\t\t\t\tMath.random() * pow +\n\t\t\t\tMath.random() * pow +\n\t\t\t\tMath.random() * pow +\n\t\t\t\tMath.random() * pow\n\t\t\t)).toString(16);\n\t\t} else {\n\t\t\tvar val = 0,\n\t\t\t\tcount = str.length,\n\t\t\t\ti;\n\n\t\t\tfor (i = 0; i < count; i++) {\n\t\t\t\tval += str.charCodeAt(i) * pow;\n\t\t\t}\n\n\t\t\tid = val.toString(16);\n\t\t}\n\n\t\treturn id;\n\t},\n\n\t/**\n\t * Generates a unique hash for the passed object.\n\t * @param {Object} obj The object to generate a hash for.\n\t * @returns {String}\n\t */\n\thash: function (obj) {\n\t\treturn JSON.stringify(obj);\n\t},\n\n\t/**\n\t * Gets / sets debug flag that can enable debug message output to the\n\t * console if required.\n\t * @param {Boolean} val The value to set debug flag to.\n\t * @return {Boolean} True if enabled, false otherwise.\n\t */\n\t/**\n\t * Sets debug flag for a particular type that can enable debug message\n\t * output to the console if required.\n\t * @param {String} type The name of the debug type to set flag for.\n\t * @param {Boolean} val The value to set debug flag to.\n\t * @return {Boolean} True if enabled, false otherwise.\n\t */\n\tdebug: new Overload([\n\t\tfunction () {\n\t\t\treturn this._debug && this._debug.all;\n\t\t},\n\n\t\tfunction (val) {\n\t\t\tif (val !== undefined) {\n\t\t\t\tif (typeof val === 'boolean') {\n\t\t\t\t\tthis._debug = this._debug || {};\n\t\t\t\t\tthis._debug.all = val;\n\t\t\t\t\tthis.chainSend('debug', this._debug);\n\t\t\t\t\treturn this;\n\t\t\t\t} else {\n\t\t\t\t\treturn (this._debug && this._debug[val]) || (this._db && this._db._debug && this._db._debug[val]) || (this._debug && this._debug.all);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn this._debug && this._debug.all;\n\t\t},\n\n\t\tfunction (type, val) {\n\t\t\tif (type !== undefined) {\n\t\t\t\tif (val !== undefined) {\n\t\t\t\t\tthis._debug = this._debug || {};\n\t\t\t\t\tthis._debug[type] = val;\n\t\t\t\t\tthis.chainSend('debug', this._debug);\n\t\t\t\t\treturn this;\n\t\t\t\t}\n\n\t\t\t\treturn (this._debug && this._debug[val]) || (this._db && this._db._debug && this._db._debug[type]);\n\t\t\t}\n\n\t\t\treturn this._debug && this._debug.all;\n\t\t}\n\t]),\n\n\t/**\n\t * Returns a string describing the class this instance is derived from.\n\t * @returns {string}\n\t */\n\tclassIdentifier: function () {\n\t\treturn 'ForerunnerDB.' + this.className;\n\t},\n\n\t/**\n\t * Returns a string describing the instance by it's class name and instance\n\t * object name.\n\t * @returns {String} The instance identifier.\n\t */\n\tinstanceIdentifier: function () {\n\t\treturn '[' + this.className + ']' + this.name();\n\t},\n\n\t/**\n\t * Returns a string used to denote a console log against this instance,\n\t * consisting of the class identifier and instance identifier.\n\t * @returns {string} The log identifier.\n\t */\n\tlogIdentifier: function () {\n\t\treturn 'ForerunnerDB ' + this.instanceIdentifier();\n\t},\n\n\t/**\n\t * Converts a query object with MongoDB dot notation syntax\n\t * to Forerunner's object notation syntax.\n\t * @param {Object} obj The object to convert.\n\t */\n\tconvertToFdb: function (obj) {\n\t\tvar varName,\n\t\t\tsplitArr,\n\t\t\tobjCopy,\n\t\t\ti;\n\n\t\tfor (i in obj) {\n\t\t\tif (obj.hasOwnProperty(i)) {\n\t\t\t\tobjCopy = obj;\n\n\t\t\t\tif (i.indexOf('.') > -1) {\n\t\t\t\t\t// Replace .$ with a placeholder before splitting by . char\n\t\t\t\t\ti = i.replace('.$', '[|$|]');\n\t\t\t\t\tsplitArr = i.split('.');\n\n\t\t\t\t\twhile ((varName = splitArr.shift())) {\n\t\t\t\t\t\t// Replace placeholder back to original .$\n\t\t\t\t\t\tvarName = varName.replace('[|$|]', '.$');\n\n\t\t\t\t\t\tif (splitArr.length) {\n\t\t\t\t\t\t\tobjCopy[varName] = {};\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tobjCopy[varName] = obj[i];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tobjCopy = objCopy[varName];\n\t\t\t\t\t}\n\n\t\t\t\t\tdelete obj[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t},\n\n\t/**\n\t * Checks if the state is dropped.\n\t * @returns {boolean} True when dropped, false otherwise.\n\t */\n\tisDropped: function () {\n\t\treturn this._state === 'dropped';\n\t},\n\n\t/**\n\t * Registers a timed callback that will overwrite itself if\n\t * the same id is used within the timeout period. Useful\n\t * for de-bouncing fast-calls.\n\t * @param {String} id An ID for the call (use the same one\n\t * to debounce the same calls).\n\t * @param {Function} callback The callback method to call on\n\t * timeout.\n\t * @param {Number} timeout The timeout in milliseconds before\n\t * the callback is called.\n\t */\n\tdebounce: function (id, callback, timeout) {\n\t\tvar self = this,\n\t\t\tnewData;\n\n\t\tself._debounce = self._debounce || {};\n\n\t\tif (self._debounce[id]) {\n\t\t\t// Clear timeout for this item\n\t\t\tclearTimeout(self._debounce[id].timeout);\n\t\t}\n\n\t\tnewData = {\n\t\t\tcallback: callback,\n\t\t\ttimeout: setTimeout(function () {\n\t\t\t\t// Delete existing reference\n\t\t\t\tdelete self._debounce[id];\n\n\t\t\t\t// Call the callback\n\t\t\t\tcallback();\n\t\t\t}, timeout)\n\t\t};\n\n\t\t// Save current data\n\t\tself._debounce[id] = newData;\n\t}\n};\n\nmodule.exports = Common;\n},{\"./Overload\":26,\"./Serialiser\":32}],18:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Provides some database constants.\n * @mixin\n */\nvar Constants = {\n\tTYPE_INSERT: 0,\n\tTYPE_UPDATE: 1,\n\tTYPE_REMOVE: 2,\n\n\tPHASE_BEFORE: 0,\n\tPHASE_AFTER: 1\n};\n\nmodule.exports = Constants;\n},{}],19:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Overload = _dereq_('./Overload');\n\n/**\n * Provides event emitter functionality including the methods: on, off, once, emit, deferEmit.\n * @mixin\n */\nvar Events = {\n\ton: new Overload({\n\t\t/**\n\t\t * Attach an event listener to the passed event.\n\t\t * @param {String} event The name of the event to listen for.\n\t\t * @param {Function} listener The method to call when the event is fired.\n\t\t */\n\t\t'string, function': function (event, listener) {\n\t\t\tthis._listeners = this._listeners || {};\n\t\t\tthis._listeners[event] = this._listeners[event] || {};\n\t\t\tthis._listeners[event]['*'] = this._listeners[event]['*'] || [];\n\t\t\tthis._listeners[event]['*'].push(listener);\n\n\t\t\treturn this;\n\t\t},\n\n\t\t/**\n\t\t * Attach an event listener to the passed event only if the passed\n\t\t * id matches the document id for the event being fired.\n\t\t * @param {String} event The name of the event to listen for.\n\t\t * @param {*} id The document id to match against.\n\t\t * @param {Function} listener The method to call when the event is fired.\n\t\t */\n\t\t'string, *, function': function (event, id, listener) {\n\t\t\tthis._listeners = this._listeners || {};\n\t\t\tthis._listeners[event] = this._listeners[event] || {};\n\t\t\tthis._listeners[event][id] = this._listeners[event][id] || [];\n\t\t\tthis._listeners[event][id].push(listener);\n\n\t\t\treturn this;\n\t\t}\n\t}),\n\n\tonce: new Overload({\n\t\t'string, function': function (eventName, callback) {\n\t\t\tvar self = this,\n\t\t\t\tinternalCallback = function () {\n\t\t\t\t\tself.off(eventName, internalCallback);\n\t\t\t\t\tcallback.apply(self, arguments);\n\t\t\t\t};\n\n\t\t\treturn this.on(eventName, internalCallback);\n\t\t},\n\t\t\n\t\t'string, *, function': function (eventName, id, callback) {\n\t\t\tvar self = this,\n\t\t\t\tinternalCallback = function () {\n\t\t\t\t\tself.off(eventName, id, internalCallback);\n\t\t\t\t\tcallback.apply(self, arguments);\n\t\t\t\t};\n\n\t\t\treturn this.on(eventName, id, internalCallback);\n\t\t}\n\t}),\n\n\toff: new Overload({\n\t\t'string': function (event) {\n\t\t\tif (this._listeners && this._listeners[event] && event in this._listeners) {\n\t\t\t\tdelete this._listeners[event];\n\t\t\t}\n\n\t\t\treturn this;\n\t\t},\n\n\t\t'string, function': function (event, listener) {\n\t\t\tvar arr,\n\t\t\t\tindex;\n\n\t\t\tif (typeof(listener) === 'string') {\n\t\t\t\tif (this._listeners && this._listeners[event] && this._listeners[event][listener]) {\n\t\t\t\t\tdelete this._listeners[event][listener];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (this._listeners && event in this._listeners) {\n\t\t\t\t\tarr = this._listeners[event]['*'];\n\t\t\t\t\tindex = arr.indexOf(listener);\n\n\t\t\t\t\tif (index > -1) {\n\t\t\t\t\t\tarr.splice(index, 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn this;\n\t\t},\n\n\t\t'string, *, function': function (event, id, listener) {\n\t\t\tif (this._listeners && event in this._listeners && id in this.listeners[event]) {\n\t\t\t\tvar arr = this._listeners[event][id],\n\t\t\t\t\tindex = arr.indexOf(listener);\n\n\t\t\t\tif (index > -1) {\n\t\t\t\t\tarr.splice(index, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\n\t\t'string, *': function (event, id) {\n\t\t\tif (this._listeners && event in this._listeners && id in this._listeners[event]) {\n\t\t\t\t// Kill all listeners for this event id\n\t\t\t\tdelete this._listeners[event][id];\n\t\t\t}\n\t\t}\n\t}),\n\n\temit: function (event, data) {\n\t\tthis._listeners = this._listeners || {};\n\n\t\tif (event in this._listeners) {\n\t\t\tvar arrIndex,\n\t\t\t\tarrCount,\n\t\t\t\ttmpFunc,\n\t\t\t\tarr,\n\t\t\t\tlistenerIdArr,\n\t\t\t\tlistenerIdCount,\n\t\t\t\tlistenerIdIndex;\n\n\t\t\t// Handle global emit\n\t\t\tif (this._listeners[event]['*']) {\n\t\t\t\tarr = this._listeners[event]['*'];\n\t\t\t\tarrCount = arr.length;\n\n\t\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\t\t// Check we have a function to execute\n\t\t\t\t\ttmpFunc = arr[arrIndex];\n\n\t\t\t\t\tif (typeof tmpFunc === 'function') {\n\t\t\t\t\t\ttmpFunc.apply(this, Array.prototype.slice.call(arguments, 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Handle individual emit\n\t\t\tif (data instanceof Array) {\n\t\t\t\t// Check if the array is an array of objects in the collection\n\t\t\t\tif (data[0] && data[0][this._primaryKey]) {\n\t\t\t\t\t// Loop the array and check for listeners against the primary key\n\t\t\t\t\tlistenerIdArr = this._listeners[event];\n\t\t\t\t\tarrCount = data.length;\n\n\t\t\t\t\tfor (arrIndex = 0; arrIndex < arrCount; arrIndex++) {\n\t\t\t\t\t\tif (listenerIdArr[data[arrIndex][this._primaryKey]]) {\n\t\t\t\t\t\t\t// Emit for this id\n\t\t\t\t\t\t\tlistenerIdCount = listenerIdArr[data[arrIndex][this._primaryKey]].length;\n\t\t\t\t\t\t\tfor (listenerIdIndex = 0; listenerIdIndex < listenerIdCount; listenerIdIndex++) {\n\t\t\t\t\t\t\t\ttmpFunc = listenerIdArr[data[arrIndex][this._primaryKey]][listenerIdIndex];\n\n\t\t\t\t\t\t\t\tif (typeof tmpFunc === 'function') {\n\t\t\t\t\t\t\t\t\tlistenerIdArr[data[arrIndex][this._primaryKey]][listenerIdIndex].apply(this, Array.prototype.slice.call(arguments, 1));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t},\n\n\t/**\n\t * Queues an event to be fired. This has automatic de-bouncing so that any\n\t * events of the same type that occur within 100 milliseconds of a previous\n\t * one will all be wrapped into a single emit rather than emitting tons of\n\t * events for lots of chained inserts etc. Only the data from the last\n\t * de-bounced event will be emitted.\n\t * @param {String} eventName The name of the event to emit.\n\t * @param {*=} data Optional data to emit with the event.\n\t */\n\tdeferEmit: function (eventName, data) {\n\t\tvar self = this,\n\t\t\targs;\n\n\t\tif (!this._noEmitDefer && (!this._db || (this._db && !this._db._noEmitDefer))) {\n\t\t\targs = arguments;\n\n\t\t\t// Check for an existing timeout\n\t\t\tthis._deferTimeout = this._deferTimeout || {};\n\t\t\tif (this._deferTimeout[eventName]) {\n\t\t\t\tclearTimeout(this._deferTimeout[eventName]);\n\t\t\t}\n\n\t\t\t// Set a timeout\n\t\t\tthis._deferTimeout[eventName] = setTimeout(function () {\n\t\t\t\tif (self.debug()) {\n\t\t\t\t\tconsole.log(self.logIdentifier() + ' Emitting ' + args[0]);\n\t\t\t\t}\n\n\t\t\t\tself.emit.apply(self, args);\n\t\t\t}, 1);\n\t\t} else {\n\t\t\tthis.emit.apply(this, arguments);\n\t\t}\n\n\t\treturn this;\n\t}\n};\n\nmodule.exports = Events;\n},{\"./Overload\":26}],20:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Provides object matching algorithm methods.\n * @mixin\n */\nvar Matching = {\n\t/**\n\t * Internal method that checks a document against a test object.\n\t * @param {*} source The source object or value to test against.\n\t * @param {*} test The test object or value to test with.\n\t * @param {Object} queryOptions The options the query was passed with.\n\t * @param {String=} opToApply The special operation to apply to the test such\n\t * as 'and' or an 'or' operator.\n\t * @param {Object=} options An object containing options to apply to the\n\t * operation such as limiting the fields returned etc.\n\t * @returns {Boolean} True if the test was positive, false on negative.\n\t * @private\n\t */\n\t_match: function (source, test, queryOptions, opToApply, options) {\n\t\t// TODO: This method is quite long, break into smaller pieces\n\t\tvar operation,\n\t\t\tapplyOp = opToApply,\n\t\t\trecurseVal,\n\t\t\ttmpIndex,\n\t\t\tsourceType = typeof source,\n\t\t\ttestType = typeof test,\n\t\t\tmatchedAll = true,\n\t\t\topResult,\n\t\t\tsubstringCache,\n\t\t\ti;\n\n\t\toptions = options || {};\n\t\tqueryOptions = queryOptions || {};\n\n\t\t// Check if options currently holds a root query object\n\t\tif (!options.$rootQuery) {\n\t\t\t// Root query not assigned, hold the root query\n\t\t\toptions.$rootQuery = test;\n\t\t}\n\n\t\t// Check if options currently holds a root source object\n\t\tif (!options.$rootSource) {\n\t\t\t// Root query not assigned, hold the root query\n\t\t\toptions.$rootSource = source;\n\t\t}\n\n\t\t// Assign current query data\n\t\toptions.$currentQuery = test;\n\n\t\toptions.$rootData = options.$rootData || {};\n\n\t\t// Check if the comparison data are both strings or numbers\n\t\tif ((sourceType === 'string' || sourceType === 'number') && (testType === 'string' || testType === 'number')) {\n\t\t\t// The source and test data are flat types that do not require recursive searches,\n\t\t\t// so just compare them and return the result\n\t\t\tif (sourceType === 'number') {\n\t\t\t\t// Number comparison\n\t\t\t\tif (source !== test) {\n\t\t\t\t\tmatchedAll = false;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// String comparison\n\t\t\t\t// TODO: We can probably use a queryOptions.$locale as a second parameter here\n\t\t\t\t// TODO: to satisfy https://github.com/Irrelon/ForerunnerDB/issues/35\n\t\t\t\tif (source.localeCompare(test)) {\n\t\t\t\t\tmatchedAll = false;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if ((sourceType === 'string' || sourceType === 'number') && (testType === 'object' && test instanceof RegExp)) {\n\t\t\tif (!test.test(source)) {\n\t\t\t\tmatchedAll = false;\n\t\t\t}\n\t\t} else {\n\t\t\tfor (i in test) {\n\t\t\t\tif (test.hasOwnProperty(i)) {\n\t\t\t\t\t// Assign previous query data\n\t\t\t\t\toptions.$previousQuery = options.$parent;\n\n\t\t\t\t\t// Assign parent query data\n\t\t\t\t\toptions.$parent = {\n\t\t\t\t\t\tquery: test[i],\n\t\t\t\t\t\tkey: i,\n\t\t\t\t\t\tparent: options.$previousQuery\n\t\t\t\t\t};\n\n\t\t\t\t\t// Reset operation flag\n\t\t\t\t\toperation = false;\n\n\t\t\t\t\t// Grab first two chars of the key name to check for $\n\t\t\t\t\tsubstringCache = i.substr(0, 2);\n\n\t\t\t\t\t// Check if the property is a comment (ignorable)\n\t\t\t\t\tif (substringCache === '//') {\n\t\t\t\t\t\t// Skip this property\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check if the property starts with a dollar (function)\n\t\t\t\t\tif (substringCache.indexOf('$') === 0) {\n\t\t\t\t\t\t// Ask the _matchOp method to handle the operation\n\t\t\t\t\t\topResult = this._matchOp(i, source, test[i], queryOptions, options);\n\n\t\t\t\t\t\t// Check the result of the matchOp operation\n\t\t\t\t\t\t// If the result is -1 then no operation took place, otherwise the result\n\t\t\t\t\t\t// will be a boolean denoting a match (true) or no match (false)\n\t\t\t\t\t\tif (opResult > -1) {\n\t\t\t\t\t\t\tif (opResult) {\n\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t// Set the matchedAll flag to the result of the operation\n\t\t\t\t\t\t\t\t// because the operation did not return true\n\t\t\t\t\t\t\t\tmatchedAll = opResult;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Record that an operation was handled\n\t\t\t\t\t\t\toperation = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check for regex\n\t\t\t\t\tif (!operation && test[i] instanceof RegExp) {\n\t\t\t\t\t\toperation = true;\n\n\t\t\t\t\t\tif (sourceType === 'object' && source[i] !== undefined && test[i].test(source[i])) {\n\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!operation) {\n\t\t\t\t\t\t// Check if our query is an object\n\t\t\t\t\t\tif (typeof(test[i]) === 'object') {\n\t\t\t\t\t\t\t// Because test[i] is an object, source must also be an object\n\n\t\t\t\t\t\t\t// Check if our source data we are checking the test query against\n\t\t\t\t\t\t\t// is an object or an array\n\t\t\t\t\t\t\tif (source[i] !== undefined) {\n\t\t\t\t\t\t\t\tif (source[i] instanceof Array && !(test[i] instanceof Array)) {\n\t\t\t\t\t\t\t\t\t// The source data is an array, so check each item until a\n\t\t\t\t\t\t\t\t\t// match is found\n\t\t\t\t\t\t\t\t\trecurseVal = false;\n\t\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < source[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\t\trecurseVal = this._match(source[i][tmpIndex], test[i], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\t\t// One of the array items matched the query so we can\n\t\t\t\t\t\t\t\t\t\t\t// include this item in the results, so break now\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else if (!(source[i] instanceof Array) && test[i] instanceof Array) {\n\t\t\t\t\t\t\t\t\t// The test key data is an array and the source key data is not so check\n\t\t\t\t\t\t\t\t\t// each item in the test key data to see if the source item matches one\n\t\t\t\t\t\t\t\t\t// of them. This is effectively an $in search.\n\t\t\t\t\t\t\t\t\trecurseVal = false;\n\n\t\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < test[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\t\trecurseVal = this._match(source[i], test[i][tmpIndex], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\t\t// One of the array items matched the query so we can\n\t\t\t\t\t\t\t\t\t\t\t// include this item in the results, so break now\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else if (typeof(source) === 'object') {\n\t\t\t\t\t\t\t\t\t// Recurse down the object tree\n\t\t\t\t\t\t\t\t\trecurseVal = this._match(source[i], test[i], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\trecurseVal = this._match(undefined, test[i], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t// First check if the test match is an $exists\n\t\t\t\t\t\t\t\tif (test[i] && test[i].$exists !== undefined) {\n\t\t\t\t\t\t\t\t\t// Push the item through another match recurse\n\t\t\t\t\t\t\t\t\trecurseVal = this._match(undefined, test[i], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Check if the prop matches our test value\n\t\t\t\t\t\t\tif (source && source[i] === test[i]) {\n\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else if (source && source[i] && source[i] instanceof Array && test[i] && typeof(test[i]) !== \"object\") {\n\t\t\t\t\t\t\t\t// We are looking for a value inside an array\n\n\t\t\t\t\t\t\t\t// The source data is an array, so check each item until a\n\t\t\t\t\t\t\t\t// match is found\n\t\t\t\t\t\t\t\trecurseVal = false;\n\t\t\t\t\t\t\t\tfor (tmpIndex = 0; tmpIndex < source[i].length; tmpIndex++) {\n\t\t\t\t\t\t\t\t\trecurseVal = this._match(source[i][tmpIndex], test[i], queryOptions, applyOp, options);\n\n\t\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\t\t// One of the array items matched the query so we can\n\t\t\t\t\t\t\t\t\t\t// include this item in the results, so break now\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (recurseVal) {\n\t\t\t\t\t\t\t\t\tif (opToApply === 'or') {\n\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tmatchedAll = false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (opToApply === 'and' && !matchedAll) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn matchedAll;\n\t},\n\n\t/**\n\t * Internal method, performs a matching process against a query operator such as $gt or $nin.\n\t * @param {String} key The property name in the test that matches the operator to perform\n\t * matching against.\n\t * @param {*} source The source data to match the query against.\n\t * @param {*} test The query to match the source against.\n\t * @param {Object} queryOptions The options the query was passed with.\n\t * @param {Object=} options An options object.\n\t * @returns {*}\n\t * @private\n\t */\n\t_matchOp: function (key, source, test, queryOptions, options) {\n\t\t// Check for commands\n\t\tswitch (key) {\n\t\t\tcase '$gt':\n\t\t\t\t// Greater than\n\t\t\t\treturn source > test;\n\n\t\t\tcase '$gte':\n\t\t\t\t// Greater than or equal\n\t\t\t\treturn source >= test;\n\n\t\t\tcase '$lt':\n\t\t\t\t// Less than\n\t\t\t\treturn source < test;\n\n\t\t\tcase '$lte':\n\t\t\t\t// Less than or equal\n\t\t\t\treturn source <= test;\n\n\t\t\tcase '$exists':\n\t\t\t\t// Property exists\n\t\t\t\treturn (source === undefined) !== test;\n\n\t\t\tcase '$eq': // Equals\n\t\t\t\treturn source == test; // jshint ignore:line\n\n\t\t\tcase '$eeq': // Equals equals\n\t\t\t\treturn source === test;\n\n\t\t\tcase '$ne': // Not equals\n\t\t\t\treturn source != test; // jshint ignore:line\n\n\t\t\tcase '$nee': // Not equals equals\n\t\t\t\treturn source !== test;\n\n\t\t\tcase '$or':\n\t\t\t\t// Match true on ANY check to pass\n\t\t\t\tfor (var orIndex = 0; orIndex < test.length; orIndex++) {\n\t\t\t\t\tif (this._match(source, test[orIndex], queryOptions, 'and', options)) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\tcase '$and':\n\t\t\t\t// Match true on ALL checks to pass\n\t\t\t\tfor (var andIndex = 0; andIndex < test.length; andIndex++) {\n\t\t\t\t\tif (!this._match(source, test[andIndex], queryOptions, 'and', options)) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn true;\n\n\t\t\tcase '$in': // In\n\t\t\t\t// Check that the in test is an array\n\t\t\t\tif (test instanceof Array) {\n\t\t\t\t\tvar inArr = test,\n\t\t\t\t\t\tinArrCount = inArr.length,\n\t\t\t\t\t\tinArrIndex;\n\n\t\t\t\t\tfor (inArrIndex = 0; inArrIndex < inArrCount; inArrIndex++) {\n\t\t\t\t\t\tif (this._match(source, inArr[inArrIndex], queryOptions, 'and', options)) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn false;\n\t\t\t\t} else if (typeof test === 'object') {\n\t\t\t\t\treturn this._match(source, test, queryOptions, 'and', options);\n\t\t\t\t} else {\n\t\t\t\t\tconsole.log(this.logIdentifier() + ' Cannot use an $in operator on a non-array key: ' + key, options.$rootQuery);\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase '$nin': // Not in\n\t\t\t\t// Check that the not-in test is an array\n\t\t\t\tif (test instanceof Array) {\n\t\t\t\t\tvar notInArr = test,\n\t\t\t\t\t\tnotInArrCount = notInArr.length,\n\t\t\t\t\t\tnotInArrIndex;\n\n\t\t\t\t\tfor (notInArrIndex = 0; notInArrIndex < notInArrCount; notInArrIndex++) {\n\t\t\t\t\t\tif (this._match(source, notInArr[notInArrIndex], queryOptions, 'and', options)) {\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\t\t\t\t} else if (typeof test === 'object') {\n\t\t\t\t\treturn this._match(source, test, queryOptions, 'and', options);\n\t\t\t\t} else {\n\t\t\t\t\tconsole.log(this.logIdentifier() + ' Cannot use a $nin operator on a non-array key: ' + key, options.$rootQuery);\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase '$distinct':\n\t\t\t\t// Ensure options holds a distinct lookup\n\t\t\t\toptions.$rootData['//distinctLookup'] = options.$rootData['//distinctLookup'] || {};\n\n\t\t\t\tfor (var distinctProp in test) {\n\t\t\t\t\tif (test.hasOwnProperty(distinctProp)) {\n\t\t\t\t\t\toptions.$rootData['//distinctLookup'][distinctProp] = options.$rootData['//distinctLookup'][distinctProp] || {};\n\t\t\t\t\t\t// Check if the options distinct lookup has this field's value\n\t\t\t\t\t\tif (options.$rootData['//distinctLookup'][distinctProp][source[distinctProp]]) {\n\t\t\t\t\t\t\t// Value is already in use\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Set the value in the lookup\n\t\t\t\t\t\t\toptions.$rootData['//distinctLookup'][distinctProp][source[distinctProp]] = true;\n\n\t\t\t\t\t\t\t// Allow the item in the results\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase '$count':\n\t\t\t\tvar countKey,\n\t\t\t\t\tcountArr,\n\t\t\t\t\tcountVal;\n\n\t\t\t\t// Iterate the count object's keys\n\t\t\t\tfor (countKey in test) {\n\t\t\t\t\tif (test.hasOwnProperty(countKey)) {\n\t\t\t\t\t\t// Check the property exists and is an array. If the property being counted is not\n\t\t\t\t\t\t// an array (or doesn't exist) then use a value of zero in any further count logic\n\t\t\t\t\t\tcountArr = source[countKey];\n\t\t\t\t\t\tif (typeof countArr === 'object' && countArr instanceof Array) {\n\t\t\t\t\t\t\tcountVal = countArr.length;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tcountVal = 0;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Now recurse down the query chain further to satisfy the query for this key (countKey)\n\t\t\t\t\t\tif (!this._match(countVal, test[countKey], queryOptions, 'and', options)) {\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Allow the item in the results\n\t\t\t\treturn true;\n\n\t\t\tcase '$find':\n\t\t\tcase '$findOne':\n\t\t\tcase '$findSub':\n\t\t\t\tvar fromType = 'collection',\n\t\t\t\t\tfindQuery,\n\t\t\t\t\tfindOptions,\n\t\t\t\t\tsubQuery,\n\t\t\t\t\tsubOptions,\n\t\t\t\t\tsubPath,\n\t\t\t\t\tresult,\n\t\t\t\t\toperation = {};\n\n\t\t\t\t// Check all parts of the $find operation exist\n\t\t\t\tif (!test.$from) {\n\t\t\t\t\tthrow(key + ' missing $from property!');\n\t\t\t\t}\n\n\t\t\t\tif (test.$fromType) {\n\t\t\t\t\tfromType = test.$fromType;\n\n\t\t\t\t\t// Check the fromType exists as a method\n\t\t\t\t\tif (!this.db()[fromType] || typeof this.db()[fromType] !== 'function') {\n\t\t\t\t\t\tthrow(key + ' cannot operate against $fromType \"' + fromType + '\" because the database does not recognise this type of object!');\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Perform the find operation\n\t\t\t\tfindQuery = test.$query || {};\n\t\t\t\tfindOptions = test.$options || {};\n\n\t\t\t\tif (key === '$findSub') {\n\t\t\t\t\tif (!test.$path) {\n\t\t\t\t\t\tthrow(key + ' missing $path property!');\n\t\t\t\t\t}\n\n\t\t\t\t\tsubPath = test.$path;\n\t\t\t\t\tsubQuery = test.$subQuery || {};\n\t\t\t\t\tsubOptions = test.$subOptions || {};\n\n\t\t\t\t\tif (options.$parent && options.$parent.parent && options.$parent.parent.key) {\n\t\t\t\t\t\tresult = this.db()[fromType](test.$from).findSub(findQuery, subPath, subQuery, subOptions);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// This is a root $find* query\n\t\t\t\t\t\t// Test the source against the main findQuery\n\t\t\t\t\t\tif (this._match(source, findQuery, {}, 'and', options)) {\n\t\t\t\t\t\t\tresult = this._findSub([source], subPath, subQuery, subOptions);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn result && result.length > 0;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tresult = this.db()[fromType](test.$from)[key.substr(1)](findQuery, findOptions);\n\t\t\t\t}\n\n\t\t\t\toperation[options.$parent.parent.key] = result;\n\t\t\t\treturn this._match(source, operation, queryOptions, 'and', options);\n\t\t}\n\n\t\treturn -1;\n\t},\n\n\t/**\n\t *\n\t * @param {Array | Object} docArr An array of objects to run the join\n\t * operation against or a single object.\n\t * @param {Array} joinClause The join clause object array (the array in\n\t * the $join key of a normal join options object).\n\t * @param {Object} joinSource An object containing join source reference\n\t * data or a blank object if you are doing a bespoke join operation.\n\t * @param {Object} options An options object or blank object if no options.\n\t * @returns {Array}\n\t * @private\n\t */\n\tapplyJoin: function (docArr, joinClause, joinSource, options) {\n\t\tvar self = this,\n\t\t\tjoinSourceIndex,\n\t\t\tjoinSourceKey,\n\t\t\tjoinMatch,\n\t\t\tjoinSourceType,\n\t\t\tjoinSourceIdentifier,\n\t\t\tresultKeyName,\n\t\t\tjoinSourceInstance,\n\t\t\tresultIndex,\n\t\t\tjoinSearchQuery,\n\t\t\tjoinMulti,\n\t\t\tjoinRequire,\n\t\t\tjoinPrefix,\n\t\t\tjoinMatchIndex,\n\t\t\tjoinMatchData,\n\t\t\tjoinSearchOptions,\n\t\t\tjoinFindResults,\n\t\t\tjoinFindResult,\n\t\t\tjoinItem,\n\t\t\tresultRemove = [],\n\t\t\tl;\n\n\t\tif (!(docArr instanceof Array)) {\n\t\t\t// Turn the document into an array\n\t\t\tdocArr = [docArr];\n\t\t}\n\n\t\tfor (joinSourceIndex = 0; joinSourceIndex < joinClause.length; joinSourceIndex++) {\n\t\t\tfor (joinSourceKey in joinClause[joinSourceIndex]) {\n\t\t\t\tif (joinClause[joinSourceIndex].hasOwnProperty(joinSourceKey)) {\n\t\t\t\t\t// Get the match data for the join\n\t\t\t\t\tjoinMatch = joinClause[joinSourceIndex][joinSourceKey];\n\n\t\t\t\t\t// Check if the join is to a collection (default) or a specified source type\n\t\t\t\t\t// e.g 'view' or 'collection'\n\t\t\t\t\tjoinSourceType = joinMatch.$sourceType || 'collection';\n\t\t\t\t\tjoinSourceIdentifier = '$' + joinSourceType + '.' + joinSourceKey;\n\n\t\t\t\t\t// Set the key to store the join result in to the collection name by default\n\t\t\t\t\t// can be overridden by the '$as' clause in the join object\n\t\t\t\t\tresultKeyName = joinSourceKey;\n\n\t\t\t\t\t// Get the join collection instance from the DB\n\t\t\t\t\tif (joinSource[joinSourceIdentifier]) {\n\t\t\t\t\t\t// We have a joinSource for this identifier already (given to us by\n\t\t\t\t\t\t// an index when we analysed the query earlier on) and we can use\n\t\t\t\t\t\t// that source instead.\n\t\t\t\t\t\tjoinSourceInstance = joinSource[joinSourceIdentifier];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// We do not already have a joinSource so grab the instance from the db\n\t\t\t\t\t\tif (this._db[joinSourceType] && typeof this._db[joinSourceType] === 'function') {\n\t\t\t\t\t\t\tjoinSourceInstance = this._db[joinSourceType](joinSourceKey);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Loop our result data array\n\t\t\t\t\tfor (resultIndex = 0; resultIndex < docArr.length; resultIndex++) {\n\t\t\t\t\t\t// Loop the join conditions and build a search object from them\n\t\t\t\t\t\tjoinSearchQuery = {};\n\t\t\t\t\t\tjoinMulti = false;\n\t\t\t\t\t\tjoinRequire = false;\n\t\t\t\t\t\tjoinPrefix = '';\n\n\t\t\t\t\t\tfor (joinMatchIndex in joinMatch) {\n\t\t\t\t\t\t\tif (joinMatch.hasOwnProperty(joinMatchIndex)) {\n\t\t\t\t\t\t\t\tjoinMatchData = joinMatch[joinMatchIndex];\n\n\t\t\t\t\t\t\t\t// Check the join condition name for a special command operator\n\t\t\t\t\t\t\t\tif (joinMatchIndex.substr(0, 1) === '$') {\n\t\t\t\t\t\t\t\t\t// Special command\n\t\t\t\t\t\t\t\t\tswitch (joinMatchIndex) {\n\t\t\t\t\t\t\t\t\t\tcase '$where':\n\t\t\t\t\t\t\t\t\t\t\tif (joinMatchData.$query || joinMatchData.$options) {\n\t\t\t\t\t\t\t\t\t\t\t\tif (joinMatchData.$query) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t// Commented old code here, new one does dynamic reverse lookups\n\t\t\t\t\t\t\t\t\t\t\t\t\t//joinSearchQuery = joinMatchData.query;\n\t\t\t\t\t\t\t\t\t\t\t\t\tjoinSearchQuery = self.resolveDynamicQuery(joinMatchData.$query, docArr[resultIndex]);\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tif (joinMatchData.$options) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tjoinSearchOptions = joinMatchData.$options;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\tthrow('$join $where clause requires \"$query\" and / or \"$options\" keys to work!');\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tcase '$as':\n\t\t\t\t\t\t\t\t\t\t\t// Rename the collection when stored in the result document\n\t\t\t\t\t\t\t\t\t\t\tresultKeyName = joinMatchData;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tcase '$multi':\n\t\t\t\t\t\t\t\t\t\t\t// Return an array of documents instead of a single matching document\n\t\t\t\t\t\t\t\t\t\t\tjoinMulti = joinMatchData;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tcase '$require':\n\t\t\t\t\t\t\t\t\t\t\t// Remove the result item if no matching join data is found\n\t\t\t\t\t\t\t\t\t\t\tjoinRequire = joinMatchData;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tcase '$prefix':\n\t\t\t\t\t\t\t\t\t\t\t// Add a prefix to properties mixed in\n\t\t\t\t\t\t\t\t\t\t\tjoinPrefix = joinMatchData;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t// Get the data to match against and store in the search object\n\t\t\t\t\t\t\t\t\t// Resolve complex referenced query\n\t\t\t\t\t\t\t\t\tjoinSearchQuery[joinMatchIndex] = self.resolveDynamicQuery(joinMatchData, docArr[resultIndex]);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Do a find on the target collection against the match data\n\t\t\t\t\t\tjoinFindResults = joinSourceInstance.find(joinSearchQuery, joinSearchOptions);\n\n\t\t\t\t\t\t// Check if we require a joined row to allow the result item\n\t\t\t\t\t\tif (!joinRequire || (joinRequire && joinFindResults[0])) {\n\t\t\t\t\t\t\t// Join is not required or condition is met\n\t\t\t\t\t\t\tif (resultKeyName === '$root') {\n\t\t\t\t\t\t\t\t// The property name to store the join results in is $root\n\t\t\t\t\t\t\t\t// which means we need to mixin the results but this only\n\t\t\t\t\t\t\t\t// works if joinMulti is disabled\n\t\t\t\t\t\t\t\tif (joinMulti !== false) {\n\t\t\t\t\t\t\t\t\t// Throw an exception here as this join is not physically possible!\n\t\t\t\t\t\t\t\t\tthrow(this.logIdentifier() + ' Cannot combine [$as: \"$root\"] with [$multi: true] in $join clause!');\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t// Mixin the result\n\t\t\t\t\t\t\t\tjoinFindResult = joinFindResults[0];\n\t\t\t\t\t\t\t\tjoinItem = docArr[resultIndex];\n\n\t\t\t\t\t\t\t\tfor (l in joinFindResult) {\n\t\t\t\t\t\t\t\t\tif (joinFindResult.hasOwnProperty(l) && joinItem[joinPrefix + l] === undefined) {\n\t\t\t\t\t\t\t\t\t\t// Properties are only mixed in if they do not already exist\n\t\t\t\t\t\t\t\t\t\t// in the target item (are undefined). Using a prefix denoted via\n\t\t\t\t\t\t\t\t\t\t// $prefix is a good way to prevent property name conflicts\n\t\t\t\t\t\t\t\t\t\tjoinItem[joinPrefix + l] = joinFindResult[l];\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tdocArr[resultIndex][resultKeyName] = joinMulti === false ? joinFindResults[0] : joinFindResults;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Join required but condition not met, add item to removal queue\n\t\t\t\t\t\t\tresultRemove.push(resultIndex);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn resultRemove;\n\t},\n\n\t/**\n\t * Takes a query object with dynamic references and converts the references\n\t * into actual values from the references source.\n\t * @param {Object} query The query object with dynamic references.\n\t * @param {Object} item The document to apply the references to.\n\t * @returns {*}\n\t * @private\n\t */\n\tresolveDynamicQuery: function (query, item) {\n\t\tvar self = this,\n\t\t\tnewQuery,\n\t\t\tpropType,\n\t\t\tpropVal,\n\t\t\tpathResult,\n\t\t\ti;\n\n\t\t// Check for early exit conditions\n\t\tif (typeof query === 'string') {\n\t\t\t// Check if the property name starts with a back-reference\n\t\t\tif (query.substr(0, 3) === '$$.') {\n\t\t\t\t// Fill the query with a back-referenced value\n\t\t\t\tpathResult = this.sharedPathSolver.value(item, query.substr(3, query.length - 3));\n\t\t\t} else {\n\t\t\t\tpathResult = this.sharedPathSolver.value(item, query);\n\t\t\t}\n\n\t\t\tif (pathResult.length > 1) {\n\t\t\t\treturn {$in: pathResult};\n\t\t\t} else {\n\t\t\t\treturn pathResult[0];\n\t\t\t}\n\t\t}\n\n\t\tnewQuery = {};\n\n\t\tfor (i in query) {\n\t\t\tif (query.hasOwnProperty(i)) {\n\t\t\t\tpropType = typeof query[i];\n\t\t\t\tpropVal = query[i];\n\n\t\t\t\tswitch (propType) {\n\t\t\t\t\tcase 'string':\n\t\t\t\t\t\t// Check if the property name starts with a back-reference\n\t\t\t\t\t\tif (propVal.substr(0, 3) === '$$.') {\n\t\t\t\t\t\t\t// Fill the query with a back-referenced value\n\t\t\t\t\t\t\tnewQuery[i] = this.sharedPathSolver.value(item, propVal.substr(3, propVal.length - 3))[0];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tnewQuery[i] = propVal;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase 'object':\n\t\t\t\t\t\tnewQuery[i] = self.resolveDynamicQuery(propVal, item);\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tnewQuery[i] = propVal;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn newQuery;\n\t},\n\n\tspliceArrayByIndexList: function (arr, list) {\n\t\tvar i;\n\n\t\tfor (i = list.length - 1; i >= 0; i--) {\n\t\t\tarr.splice(list[i], 1);\n\t\t}\n\t}\n};\n\nmodule.exports = Matching;\n},{}],21:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Provides sorting methods.\n * @mixin\n */\nvar Sorting = {\n\t/**\n\t * Sorts the passed value a against the passed value b ascending.\n\t * @param {*} a The first value to compare.\n\t * @param {*} b The second value to compare.\n\t * @returns {*} 1 if a is sorted after b, -1 if a is sorted before b.\n\t */\n\tsortAsc: function (a, b) {\n\t\tif (typeof(a) === 'string' && typeof(b) === 'string') {\n\t\t\treturn a.localeCompare(b);\n\t\t} else {\n\t\t\tif (a > b) {\n\t\t\t\treturn 1;\n\t\t\t} else if (a < b) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t},\n\n\t/**\n\t * Sorts the passed value a against the passed value b descending.\n\t * @param {*} a The first value to compare.\n\t * @param {*} b The second value to compare.\n\t * @returns {*} 1 if a is sorted after b, -1 if a is sorted before b.\n\t */\n\tsortDesc: function (a, b) {\n\t\tif (typeof(a) === 'string' && typeof(b) === 'string') {\n\t\t\treturn b.localeCompare(a);\n\t\t} else {\n\t\t\tif (a > b) {\n\t\t\t\treturn -1;\n\t\t\t} else if (a < b) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n};\n\nmodule.exports = Sorting;\n},{}],22:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Tags,\n\ttagMap = {};\n\n/**\n * Provides class instance tagging and tag operation methods.\n * @mixin\n */\nTags = {\n\t/**\n\t * Tags a class instance for later lookup.\n\t * @param {String} name The tag to add.\n\t * @returns {boolean}\n\t */\n\ttagAdd: function (name) {\n\t\tvar i,\n\t\t\tself = this,\n\t\t\tmapArr = tagMap[name] = tagMap[name] || [];\n\n\t\tfor (i = 0; i < mapArr.length; i++) {\n\t\t\tif (mapArr[i] === self) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tmapArr.push(self);\n\n\t\t// Hook the drop event for this so we can react\n\t\tif (self.on) {\n\t\t\tself.on('drop', function () {\n\t\t\t\t// We've been dropped so remove ourselves from the tag map\n\t\t\t\tself.tagRemove(name);\n\t\t\t});\n\t\t}\n\n\t\treturn true;\n\t},\n\n\t/**\n\t * Removes a tag from a class instance.\n\t * @param {String} name The tag to remove.\n\t * @returns {boolean}\n\t */\n\ttagRemove: function (name) {\n\t\tvar i,\n\t\t\tmapArr = tagMap[name];\n\n\t\tif (mapArr) {\n\t\t\tfor (i = 0; i < mapArr.length; i++) {\n\t\t\t\tif (mapArr[i] === this) {\n\t\t\t\t\tmapArr.splice(i, 1);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t},\n\n\t/**\n\t * Gets an array of all instances tagged with the passed tag name.\n\t * @param {String} name The tag to lookup.\n\t * @returns {Array} The array of instances that have the passed tag.\n\t */\n\ttagLookup: function (name) {\n\t\treturn tagMap[name] || [];\n\t},\n\n\t/**\n\t * Drops all instances that are tagged with the passed tag name.\n\t * @param {String} name The tag to lookup.\n\t * @param {Function} callback Callback once dropping has completed\n\t * for all instances that match the passed tag name.\n\t * @returns {boolean}\n\t */\n\ttagDrop: function (name, callback) {\n\t\tvar arr = this.tagLookup(name),\n\t\t\tdropCb,\n\t\t\tdropCount,\n\t\t\ti;\n\n\t\tdropCb = function () {\n\t\t\tdropCount--;\n\n\t\t\tif (callback && dropCount === 0) {\n\t\t\t\tcallback(false);\n\t\t\t}\n\t\t};\n\n\t\tif (arr.length) {\n\t\t\tdropCount = arr.length;\n\n\t\t\t// Loop the array and drop all items\n\t\t\tfor (i = arr.length - 1; i >= 0; i--) {\n\t\t\t\tarr[i].drop(dropCb);\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n};\n\nmodule.exports = Tags;\n},{}],23:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Overload = _dereq_('./Overload');\n\n/**\n * Provides trigger functionality methods.\n * @mixin\n */\nvar Triggers = {\n\t/**\n\t * When called in a before phase the newDoc object can be directly altered\n\t * to modify the data in it before the operation is carried out.\n\t * @callback addTriggerCallback\n\t * @param {Object} operation The details about the operation.\n\t * @param {Object} oldDoc The document before the operation.\n\t * @param {Object} newDoc The document after the operation.\n\t */\n\n\t/**\n\t * Add a trigger by id.\n\t * @param {String} id The id of the trigger. This must be unique to the type and\n\t * phase of the trigger. Only one trigger may be added with this id per type and\n\t * phase.\n\t * @param {Constants} type The type of operation to apply the trigger to. See\n\t * Mixin.Constants for constants to use.\n\t * @param {Constants} phase The phase of an operation to fire the trigger on. See\n\t * Mixin.Constants for constants to use.\n\t * @param {addTriggerCallback} method The method to call when the trigger is fired.\n\t * @returns {boolean} True if the trigger was added successfully, false if not.\n\t */\n\taddTrigger: function (id, type, phase, method) {\n\t\tvar self = this,\n\t\t\ttriggerIndex;\n\n\t\t// Check if the trigger already exists\n\t\ttriggerIndex = self._triggerIndexOf(id, type, phase);\n\n\t\tif (triggerIndex === -1) {\n\t\t\t// The trigger does not exist, create it\n\t\t\tself._trigger = self._trigger || {};\n\t\t\tself._trigger[type] = self._trigger[type] || {};\n\t\t\tself._trigger[type][phase] = self._trigger[type][phase] || [];\n\n\t\t\tself._trigger[type][phase].push({\n\t\t\t\tid: id,\n\t\t\t\tmethod: method,\n\t\t\t\tenabled: true\n\t\t\t});\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t},\n\n\t/**\n\t *\n\t * @param {String} id The id of the trigger to remove.\n\t * @param {Number} type The type of operation to remove the trigger from. See\n\t * Mixin.Constants for constants to use.\n\t * @param {Number} phase The phase of the operation to remove the trigger from.\n\t * See Mixin.Constants for constants to use.\n\t * @returns {boolean} True if removed successfully, false if not.\n\t */\n\tremoveTrigger: function (id, type, phase) {\n\t\tvar self = this,\n\t\t\ttriggerIndex;\n\n\t\t// Check if the trigger already exists\n\t\ttriggerIndex = self._triggerIndexOf(id, type, phase);\n\n\t\tif (triggerIndex > -1) {\n\t\t\t// The trigger exists, remove it\n\t\t\tself._trigger[type][phase].splice(triggerIndex, 1);\n\t\t}\n\n\t\treturn false;\n\t},\n\n\tenableTrigger: new Overload({\n\t\t'string': function (id) {\n\t\t\t// Alter all triggers of this type\n\t\t\tvar self = this,\n\t\t\t\ttypes = self._trigger,\n\t\t\t\tphases,\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\ti, k, j;\n\n\t\t\tif (types) {\n\t\t\t\tfor (j in types) {\n\t\t\t\t\tif (types.hasOwnProperty(j)) {\n\t\t\t\t\t\tphases = types[j];\n\n\t\t\t\t\t\tif (phases) {\n\t\t\t\t\t\t\tfor (i in phases) {\n\t\t\t\t\t\t\t\tif (phases.hasOwnProperty(i)) {\n\t\t\t\t\t\t\t\t\ttriggers = phases[i];\n\n\t\t\t\t\t\t\t\t\t// Loop triggers and set enabled flag\n\t\t\t\t\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\t\t\t\t\tif (triggers[k].id === id) {\n\t\t\t\t\t\t\t\t\t\t\ttriggers[k].enabled = true;\n\t\t\t\t\t\t\t\t\t\t\tresult = true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'number': function (type) {\n\t\t\t// Alter all triggers of this type\n\t\t\tvar self = this,\n\t\t\t\tphases = self._trigger[type],\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\ti, k;\n\n\t\t\tif (phases) {\n\t\t\t\tfor (i in phases) {\n\t\t\t\t\tif (phases.hasOwnProperty(i)) {\n\t\t\t\t\t\ttriggers = phases[i];\n\n\t\t\t\t\t\t// Loop triggers and set to enabled\n\t\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\t\ttriggers[k].enabled = true;\n\t\t\t\t\t\t\tresult = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'number, number': function (type, phase) {\n\t\t\t// Alter all triggers of this type and phase\n\t\t\tvar self = this,\n\t\t\t\tphases = self._trigger[type],\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\tk;\n\n\t\t\tif (phases) {\n\t\t\t\ttriggers = phases[phase];\n\n\t\t\t\tif (triggers) {\n\t\t\t\t\t// Loop triggers and set to enabled\n\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\ttriggers[k].enabled = true;\n\t\t\t\t\t\tresult = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'string, number, number': function (id, type, phase) {\n\t\t\t// Check if the trigger already exists\n\t\t\tvar self = this,\n\t\t\t\ttriggerIndex = self._triggerIndexOf(id, type, phase);\n\n\t\t\tif (triggerIndex > -1) {\n\t\t\t\t// Update the trigger\n\t\t\t\tself._trigger[type][phase][triggerIndex].enabled = true;\n\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\t}),\n\n\tdisableTrigger: new Overload({\n\t\t'string': function (id) {\n\t\t\t// Alter all triggers of this type\n\t\t\tvar self = this,\n\t\t\t\ttypes = self._trigger,\n\t\t\t\tphases,\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\ti, k, j;\n\n\t\t\tif (types) {\n\t\t\t\tfor (j in types) {\n\t\t\t\t\tif (types.hasOwnProperty(j)) {\n\t\t\t\t\t\tphases = types[j];\n\n\t\t\t\t\t\tif (phases) {\n\t\t\t\t\t\t\tfor (i in phases) {\n\t\t\t\t\t\t\t\tif (phases.hasOwnProperty(i)) {\n\t\t\t\t\t\t\t\t\ttriggers = phases[i];\n\n\t\t\t\t\t\t\t\t\t// Loop triggers and set enabled flag\n\t\t\t\t\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\t\t\t\t\tif (triggers[k].id === id) {\n\t\t\t\t\t\t\t\t\t\t\ttriggers[k].enabled = false;\n\t\t\t\t\t\t\t\t\t\t\tresult = true;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'number': function (type) {\n\t\t\t// Alter all triggers of this type\n\t\t\tvar self = this,\n\t\t\t\tphases = self._trigger[type],\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\ti, k;\n\n\t\t\tif (phases) {\n\t\t\t\tfor (i in phases) {\n\t\t\t\t\tif (phases.hasOwnProperty(i)) {\n\t\t\t\t\t\ttriggers = phases[i];\n\n\t\t\t\t\t\t// Loop triggers and set to disabled\n\t\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\t\ttriggers[k].enabled = false;\n\t\t\t\t\t\t\tresult = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'number, number': function (type, phase) {\n\t\t\t// Alter all triggers of this type and phase\n\t\t\tvar self = this,\n\t\t\t\tphases = self._trigger[type],\n\t\t\t\ttriggers,\n\t\t\t\tresult = false,\n\t\t\t\tk;\n\n\t\t\tif (phases) {\n\t\t\t\ttriggers = phases[phase];\n\n\t\t\t\tif (triggers) {\n\t\t\t\t\t// Loop triggers and set to disabled\n\t\t\t\t\tfor (k = 0; k < triggers.length; k++) {\n\t\t\t\t\t\ttriggers[k].enabled = false;\n\t\t\t\t\t\tresult = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t},\n\n\t\t'string, number, number': function (id, type, phase) {\n\t\t\t// Check if the trigger already exists\n\t\t\tvar self = this,\n\t\t\t\ttriggerIndex = self._triggerIndexOf(id, type, phase);\n\n\t\t\tif (triggerIndex > -1) {\n\t\t\t\t// Update the trigger\n\t\t\t\tself._trigger[type][phase][triggerIndex].enabled = false;\n\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\t}),\n\n\t/**\n\t * Checks if a trigger will fire based on the type and phase provided.\n\t * @param {Number} type The type of operation. See Mixin.Constants for\n\t * constants to use.\n\t * @param {Number} phase The phase of the operation. See Mixin.Constants\n\t * for constants to use.\n\t * @returns {Boolean} True if the trigger will fire, false otherwise.\n\t */\n\twillTrigger: function (type, phase) {\n\t\tif (this._trigger && this._trigger[type] && this._trigger[type][phase] && this._trigger[type][phase].length) {\n\t\t\t// Check if a trigger in this array is enabled\n\t\t\tvar arr = this._trigger[type][phase],\n\t\t\t\ti;\n\n\t\t\tfor (i = 0; i < arr.length; i++) {\n\t\t\t\tif (arr[i].enabled) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t},\n\n\t/**\n\t * Processes trigger actions based on the operation, type and phase.\n\t * @param {Object} operation Operation data to pass to the trigger.\n\t * @param {Number} type The type of operation. See Mixin.Constants for\n\t * constants to use.\n\t * @param {Number} phase The phase of the operation. See Mixin.Constants\n\t * for constants to use.\n\t * @param {Object} oldDoc The document snapshot before operations are\n\t * carried out against the data.\n\t * @param {Object} newDoc The document snapshot after operations are\n\t * carried out against the data.\n\t * @returns {boolean}\n\t */\n\tprocessTrigger: function (operation, type, phase, oldDoc, newDoc) {\n\t\tvar self = this,\n\t\t\ttriggerArr,\n\t\t\ttriggerIndex,\n\t\t\ttriggerCount,\n\t\t\ttriggerItem,\n\t\t\tresponse;\n\n\t\tif (self._trigger && self._trigger[type] && self._trigger[type][phase]) {\n\t\t\ttriggerArr = self._trigger[type][phase];\n\t\t\ttriggerCount = triggerArr.length;\n\n\t\t\tfor (triggerIndex = 0; triggerIndex < triggerCount; triggerIndex++) {\n\t\t\t\ttriggerItem = triggerArr[triggerIndex];\n\n\t\t\t\t// Check if the trigger is enabled\n\t\t\t\tif (triggerItem.enabled) {\n\t\t\t\t\tif (this.debug()) {\n\t\t\t\t\t\tvar typeName,\n\t\t\t\t\t\t\tphaseName;\n\n\t\t\t\t\t\tswitch (type) {\n\t\t\t\t\t\t\tcase this.TYPE_INSERT:\n\t\t\t\t\t\t\t\ttypeName = 'insert';\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase this.TYPE_UPDATE:\n\t\t\t\t\t\t\t\ttypeName = 'update';\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase this.TYPE_REMOVE:\n\t\t\t\t\t\t\t\ttypeName = 'remove';\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\ttypeName = '';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tswitch (phase) {\n\t\t\t\t\t\t\tcase this.PHASE_BEFORE:\n\t\t\t\t\t\t\t\tphaseName = 'before';\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase this.PHASE_AFTER:\n\t\t\t\t\t\t\t\tphaseName = 'after';\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\tphaseName = '';\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t//console.log('Triggers: Processing trigger \"' + id + '\" for ' + typeName + ' in phase \"' + phaseName + '\"');\n\t\t\t\t\t}\n\n\t\t\t\t\t// Run the trigger's method and store the response\n\t\t\t\t\tresponse = triggerItem.method.call(self, operation, oldDoc, newDoc);\n\n\t\t\t\t\t// Check the response for a non-expected result (anything other than\n\t\t\t\t\t// undefined, true or false is considered a throwable error)\n\t\t\t\t\tif (response === false) {\n\t\t\t\t\t\t// The trigger wants us to cancel operations\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (response !== undefined && response !== true && response !== false) {\n\t\t\t\t\t\t// Trigger responded with error, throw the error\n\t\t\t\t\t\tthrow('ForerunnerDB.Mixin.Triggers: Trigger error: ' + response);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Triggers all ran without issue, return a success (true)\n\t\t\treturn true;\n\t\t}\n\t},\n\n\t/**\n\t * Returns the index of a trigger by id based on type and phase.\n\t * @param {String} id The id of the trigger to find the index of.\n\t * @param {Number} type The type of operation. See Mixin.Constants for\n\t * constants to use.\n\t * @param {Number} phase The phase of the operation. See Mixin.Constants\n\t * for constants to use.\n\t * @returns {number}\n\t * @private\n\t */\n\t_triggerIndexOf: function (id, type, phase) {\n\t\tvar self = this,\n\t\t\ttriggerArr,\n\t\t\ttriggerCount,\n\t\t\ttriggerIndex;\n\n\t\tif (self._trigger && self._trigger[type] && self._trigger[type][phase]) {\n\t\t\ttriggerArr = self._trigger[type][phase];\n\t\t\ttriggerCount = triggerArr.length;\n\n\t\t\tfor (triggerIndex = 0; triggerIndex < triggerCount; triggerIndex++) {\n\t\t\t\tif (triggerArr[triggerIndex].id === id) {\n\t\t\t\t\treturn triggerIndex;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn -1;\n\t}\n};\n\nmodule.exports = Triggers;\n},{\"./Overload\":26}],24:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Provides methods to handle object update operations.\n * @mixin\n */\nvar Updating = {\n\t/**\n\t * Updates a property on an object.\n\t * @param {Object} doc The object whose property is to be updated.\n\t * @param {String} prop The property to update.\n\t * @param {*} val The new value of the property.\n\t * @private\n\t */\n\t_updateProperty: function (doc, prop, val) {\n\t\tdoc[prop] = val;\n\n\t\tif (this.debug()) {\n\t\t\tconsole.log(this.logIdentifier() + ' Setting non-data-bound document property \"' + prop + '\" to val \"' + val + '\"');\n\t\t}\n\t},\n\n\t/**\n\t * Increments a value for a property on a document by the passed number.\n\t * @param {Object} doc The document to modify.\n\t * @param {String} prop The property to modify.\n\t * @param {Number} val The amount to increment by.\n\t * @private\n\t */\n\t_updateIncrement: function (doc, prop, val) {\n\t\tdoc[prop] += val;\n\t},\n\n\t/**\n\t * Changes the index of an item in the passed array.\n\t * @param {Array} arr The array to modify.\n\t * @param {Number} indexFrom The index to move the item from.\n\t * @param {Number} indexTo The index to move the item to.\n\t * @private\n\t */\n\t_updateSpliceMove: function (arr, indexFrom, indexTo) {\n\t\tarr.splice(indexTo, 0, arr.splice(indexFrom, 1)[0]);\n\n\t\tif (this.debug()) {\n\t\t\tconsole.log(this.logIdentifier() + ' Moving non-data-bound document array index from \"' + indexFrom + '\" to \"' + indexTo + '\"');\n\t\t}\n\t},\n\n\t/**\n\t * Inserts an item into the passed array at the specified index.\n\t * @param {Array} arr The array to insert into.\n\t * @param {Number} index The index to insert at.\n\t * @param {Object} doc The document to insert.\n\t * @private\n\t */\n\t_updateSplicePush: function (arr, index, doc) {\n\t\tif (arr.length > index) {\n\t\t\tarr.splice(index, 0, doc);\n\t\t} else {\n\t\t\tarr.push(doc);\n\t\t}\n\t},\n\n\t/**\n\t * Inserts an item at the end of an array.\n\t * @param {Array} arr The array to insert the item into.\n\t * @param {Object} doc The document to insert.\n\t * @private\n\t */\n\t_updatePush: function (arr, doc) {\n\t\tarr.push(doc);\n\t},\n\n\t/**\n\t * Removes an item from the passed array.\n\t * @param {Array} arr The array to modify.\n\t * @param {Number} index The index of the item in the array to remove.\n\t * @private\n\t */\n\t_updatePull: function (arr, index) {\n\t\tarr.splice(index, 1);\n\t},\n\n\t/**\n\t * Multiplies a value for a property on a document by the passed number.\n\t * @param {Object} doc The document to modify.\n\t * @param {String} prop The property to modify.\n\t * @param {Number} val The amount to multiply by.\n\t * @private\n\t */\n\t_updateMultiply: function (doc, prop, val) {\n\t\tdoc[prop] *= val;\n\t},\n\n\t/**\n\t * Renames a property on a document to the passed property.\n\t * @param {Object} doc The document to modify.\n\t * @param {String} prop The property to rename.\n\t * @param {Number} val The new property name.\n\t * @private\n\t */\n\t_updateRename: function (doc, prop, val) {\n\t\tdoc[val] = doc[prop];\n\t\tdelete doc[prop];\n\t},\n\n\t/**\n\t * Sets a property on a document to the passed value.\n\t * @param {Object} doc The document to modify.\n\t * @param {String} prop The property to set.\n\t * @param {*} val The new property value.\n\t * @private\n\t */\n\t_updateOverwrite: function (doc, prop, val) {\n\t\tdoc[prop] = val;\n\t},\n\n\t/**\n\t * Deletes a property on a document.\n\t * @param {Object} doc The document to modify.\n\t * @param {String} prop The property to delete.\n\t * @private\n\t */\n\t_updateUnset: function (doc, prop) {\n\t\tdelete doc[prop];\n\t},\n\n\t/**\n\t * Removes all properties from an object without destroying\n\t * the object instance, thereby maintaining data-bound linking.\n\t * @param {Object} doc The parent object to modify.\n\t * @param {String} prop The name of the child object to clear.\n\t * @private\n\t */\n\t_updateClear: function (doc, prop) {\n\t\tvar obj = doc[prop],\n\t\t\ti;\n\n\t\tif (obj && typeof obj === 'object') {\n\t\t\tfor (i in obj) {\n\t\t\t\tif (obj.hasOwnProperty(i)) {\n\t\t\t\t\tthis._updateUnset(obj, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t},\n\n\t/**\n\t * Pops an item or items from the array stack.\n\t * @param {Object} doc The document to modify.\n\t * @param {Number} val If set to a positive integer, will pop the number specified\n\t * from the stack, if set to a negative integer will shift the number specified\n\t * from the stack.\n\t * @return {Boolean}\n\t * @private\n\t */\n\t_updatePop: function (doc, val) {\n\t\tvar updated = false,\n\t\t\ti;\n\n\t\tif (doc.length > 0) {\n\t\t\tif (val > 0) {\n\t\t\t\tfor (i = 0; i < val; i++) {\n\t\t\t\t\tdoc.pop();\n\t\t\t\t}\n\t\t\t\tupdated = true;\n\t\t\t} else if (val < 0) {\n\t\t\t\tfor (i = 0; i > val; i--) {\n\t\t\t\t\tdoc.shift();\n\t\t\t\t}\n\t\t\t\tupdated = true;\n\t\t\t}\n\t\t}\n\n\t\treturn updated;\n\t}\n};\n\nmodule.exports = Updating;\n},{}],25:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tPath = _dereq_('./Path');\n\n/**\n * The operation class, used to store details about an operation being\n * performed by the database.\n * @param {String} name The name of the operation.\n * @constructor\n */\nvar Operation = function (name) {\n\tthis.pathSolver = new Path();\n\tthis.counter = 0;\n\tthis.init.apply(this, arguments);\n};\n\nOperation.prototype.init = function (name) {\n\tthis._data = {\n\t\toperation: name, // The name of the operation executed such as \"find\", \"update\" etc\n\t\tindex: {\n\t\t\tpotential: [], // Indexes that could have potentially been used\n\t\t\tused: false // The index that was picked to use\n\t\t},\n\t\tsteps: [], // The steps taken to generate the query results,\n\t\ttime: {\n\t\t\tstartMs: 0,\n\t\t\tstopMs: 0,\n\t\t\ttotalMs: 0,\n\t\t\tprocess: {}\n\t\t},\n\t\tflag: {}, // An object with flags that denote certain execution paths\n\t\tlog: [] // Any extra data that might be useful such as warnings or helpful hints\n\t};\n};\n\nShared.addModule('Operation', Operation);\nShared.mixin(Operation.prototype, 'Mixin.ChainReactor');\n\n/**\n * Starts the operation timer.\n */\nOperation.prototype.start = function () {\n\tthis._data.time.startMs = new Date().getTime();\n};\n\n/**\n * Adds an item to the operation log.\n * @param {String} event The item to log.\n * @returns {*}\n */\nOperation.prototype.log = function (event) {\n\tif (event) {\n\t\tvar lastLogTime = this._log.length > 0 ? this._data.log[this._data.log.length - 1].time : 0,\n\t\t\tlogObj = {\n\t\t\t\tevent: event,\n\t\t\t\ttime: new Date().getTime(),\n\t\t\t\tdelta: 0\n\t\t\t};\n\n\t\tthis._data.log.push(logObj);\n\n\t\tif (lastLogTime) {\n\t\t\tlogObj.delta = logObj.time - lastLogTime;\n\t\t}\n\n\t\treturn this;\n\t}\n\n\treturn this._data.log;\n};\n\n/**\n * Called when starting and ending a timed operation, used to time\n * internal calls within an operation's execution.\n * @param {String} section An operation name.\n * @returns {*}\n */\nOperation.prototype.time = function (section) {\n\tif (section !== undefined) {\n\t\tvar process = this._data.time.process,\n\t\t\tprocessObj = process[section] = process[section] || {};\n\n\t\tif (!processObj.startMs) {\n\t\t\t// Timer started\n\t\t\tprocessObj.startMs = new Date().getTime();\n\t\t\tprocessObj.stepObj = {\n\t\t\t\tname: section\n\t\t\t};\n\n\t\t\tthis._data.steps.push(processObj.stepObj);\n\t\t} else {\n\t\t\tprocessObj.stopMs = new Date().getTime();\n\t\t\tprocessObj.totalMs = processObj.stopMs - processObj.startMs;\n\t\t\tprocessObj.stepObj.totalMs = processObj.totalMs;\n\t\t\tdelete processObj.stepObj;\n\t\t}\n\n\t\treturn this;\n\t}\n\n\treturn this._data.time;\n};\n\n/**\n * Used to set key/value flags during operation execution.\n * @param {String} key\n * @param {String} val\n * @returns {*}\n */\nOperation.prototype.flag = function (key, val) {\n\tif (key !== undefined && val !== undefined) {\n\t\tthis._data.flag[key] = val;\n\t} else if (key !== undefined) {\n\t\treturn this._data.flag[key];\n\t} else {\n\t\treturn this._data.flag;\n\t}\n};\n\nOperation.prototype.data = function (path, val, noTime) {\n\tif (val !== undefined) {\n\t\t// Assign value to object path\n\t\tthis.pathSolver.set(this._data, path, val);\n\n\t\treturn this;\n\t}\n\n\treturn this.pathSolver.get(this._data, path);\n};\n\nOperation.prototype.pushData = function (path, val, noTime) {\n\t// Assign value to object path\n\tthis.pathSolver.push(this._data, path, val);\n};\n\n/**\n * Stops the operation timer.\n */\nOperation.prototype.stop = function () {\n\tthis._data.time.stopMs = new Date().getTime();\n\tthis._data.time.totalMs = this._data.time.stopMs - this._data.time.startMs;\n};\n\nShared.finishModule('Operation');\nmodule.exports = Operation;\n},{\"./Path\":27,\"./Shared\":33}],26:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Allows a method to accept overloaded calls with different parameters controlling\n * which passed overload function is called.\n * @param {String=} name A name to provide this overload to help identify\n * it if any errors occur during the resolving phase of the overload. This\n * is purely for debug purposes and serves no functional purpose.\n * @param {Object} def The overload definition.\n * @returns {Function}\n * @constructor\n */\nvar Overload = function (name, def) {\n\tif (!def) {\n\t\tdef = name;\n\t\tname = undefined;\n\t}\n\n\tif (def) {\n\t\tvar self = this,\n\t\t\tindex,\n\t\t\tcount,\n\t\t\ttmpDef,\n\t\t\tdefNewKey,\n\t\t\tsigIndex,\n\t\t\tsignatures;\n\n\t\tif (!(def instanceof Array)) {\n\t\t\ttmpDef = {};\n\n\t\t\t// Def is an object, make sure all prop names are devoid of spaces\n\t\t\tfor (index in def) {\n\t\t\t\tif (def.hasOwnProperty(index)) {\n\t\t\t\t\tdefNewKey = index.replace(/ /g, '');\n\n\t\t\t\t\t// Check if the definition array has a * string in it\n\t\t\t\t\tif (defNewKey.indexOf('*') === -1) {\n\t\t\t\t\t\t// No * found\n\t\t\t\t\t\ttmpDef[defNewKey] = def[index];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// A * was found, generate the different signatures that this\n\t\t\t\t\t\t// definition could represent\n\t\t\t\t\t\tsignatures = this.generateSignaturePermutations(defNewKey);\n\n\t\t\t\t\t\tfor (sigIndex = 0; sigIndex < signatures.length; sigIndex++) {\n\t\t\t\t\t\t\tif (!tmpDef[signatures[sigIndex]]) {\n\t\t\t\t\t\t\t\ttmpDef[signatures[sigIndex]] = def[index];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdef = tmpDef;\n\t\t}\n\n\t\treturn function () {\n\t\t\tvar arr = [],\n\t\t\t\tlookup,\n\t\t\t\ttype,\n\t\t\t\toverloadName;\n\n\t\t\t// Check if we are being passed a key/function object or an array of functions\n\t\t\tif (def instanceof Array) {\n\t\t\t\t// We were passed an array of functions\n\t\t\t\tcount = def.length;\n\t\t\t\tfor (index = 0; index < count; index++) {\n\t\t\t\t\tif (def[index].length === arguments.length) {\n\t\t\t\t\t\treturn self.callExtend(this, '$main', def, def[index], arguments);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Generate lookup key from arguments\n\t\t\t\t// Copy arguments to an array\n\t\t\t\tfor (index = 0; index < arguments.length; index++) {\n\t\t\t\t\ttype = typeof arguments[index];\n\n\t\t\t\t\t// Handle detecting arrays\n\t\t\t\t\tif (type === 'object' && arguments[index] instanceof Array) {\n\t\t\t\t\t\ttype = 'array';\n\t\t\t\t\t}\n\n\t\t\t\t\t// Handle been presented with a single undefined argument\n\t\t\t\t\tif (arguments.length === 1 && type === 'undefined') {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Add the type to the argument types array\n\t\t\t\t\tarr.push(type);\n\t\t\t\t}\n\n\t\t\t\tlookup = arr.join(',');\n\n\t\t\t\t// Check for an exact lookup match\n\t\t\t\tif (def[lookup]) {\n\t\t\t\t\treturn self.callExtend(this, '$main', def, def[lookup], arguments);\n\t\t\t\t} else {\n\t\t\t\t\tfor (index = arr.length; index >= 0; index--) {\n\t\t\t\t\t\t// Get the closest match\n\t\t\t\t\t\tlookup = arr.slice(0, index).join(',');\n\n\t\t\t\t\t\tif (def[lookup + ',...']) {\n\t\t\t\t\t\t\t// Matched against arguments + \"any other\"\n\t\t\t\t\t\t\treturn self.callExtend(this, '$main', def, def[lookup + ',...'], arguments);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\toverloadName = name !== undefined ? name : typeof this.name === 'function' ? this.name() : 'Unknown';\n\n\t\t\tconsole.log('Overload Definition:', def);\n\t\t\tthrow('ForerunnerDB.Overload \"' + overloadName + '\": Overloaded method does not have a matching signature \"' + lookup + '\" for the passed arguments: ' + this.jStringify(arr));\n\t\t};\n\t}\n\n\treturn function () {};\n};\n\n/**\n * Generates an array of all the different definition signatures that can be\n * created from the passed string with a catch-all wildcard *. E.g. it will\n * convert the signature: string,*,string to all potentials:\n * string,string,string\n * string,number,string\n * string,object,string,\n * string,function,string,\n * string,undefined,string\n *\n * @param {String} str Signature string with a wildcard in it.\n * @returns {Array} An array of signature strings that are generated.\n */\nOverload.prototype.generateSignaturePermutations = function (str) {\n\tvar signatures = [],\n\t\tnewSignature,\n\t\ttypes = ['array', 'string', 'object', 'number', 'function', 'undefined'],\n\t\tindex;\n\n\tif (str.indexOf('*') > -1) {\n\t\t// There is at least one \"any\" type, break out into multiple keys\n\t\t// We could do this at query time with regular expressions but\n\t\t// would be significantly slower\n\t\tfor (index = 0; index < types.length; index++) {\n\t\t\tnewSignature = str.replace('*', types[index]);\n\t\t\tsignatures = signatures.concat(this.generateSignaturePermutations(newSignature));\n\t\t}\n\t} else {\n\t\tsignatures.push(str);\n\t}\n\n\treturn signatures;\n};\n\nOverload.prototype.callExtend = function (context, prop, propContext, func, args) {\n\tvar tmp,\n\t\tret;\n\n\tif (context && propContext[prop]) {\n\t\ttmp = context[prop];\n\n\t\tcontext[prop] = propContext[prop];\n\t\tret = func.apply(context, args);\n\t\tcontext[prop] = tmp;\n\n\t\treturn ret;\n\t} else {\n\t\treturn func.apply(context, args);\n\t}\n};\n\nmodule.exports = Overload;\n},{}],27:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared');\n\n/**\n * Path object used to resolve object paths and retrieve data from\n * objects by using paths.\n * @param {String=} path The path to assign.\n * @constructor\n */\nvar Path = function (path) {\n\tthis.init.apply(this, arguments);\n};\n\nPath.prototype.init = function (path) {\n\tif (path) {\n\t\tthis.path(path);\n\t}\n};\n\nShared.addModule('Path', Path);\nShared.mixin(Path.prototype, 'Mixin.Common');\nShared.mixin(Path.prototype, 'Mixin.ChainReactor');\n\n/**\n * Gets / sets the given path for the Path instance.\n * @param {String=} path The path to assign.\n */\nPath.prototype.path = function (path) {\n\tif (path !== undefined) {\n\t\tthis._path = this.clean(path);\n\t\tthis._pathParts = this._path.split('.');\n\t\treturn this;\n\t}\n\n\treturn this._path;\n};\n\n/**\n * Tests if the passed object has the paths that are specified and that\n * a value exists in those paths.\n * @param {Object} testKeys The object describing the paths to test for.\n * @param {Object} testObj The object to test paths against.\n * @returns {Boolean} True if the object paths exist.\n */\nPath.prototype.hasObjectPaths = function (testKeys, testObj) {\n\tvar result = true,\n\t\ti;\n\n\tfor (i in testKeys) {\n\t\tif (testKeys.hasOwnProperty(i)) {\n\t\t\tif (testObj[i] === undefined) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tif (typeof testKeys[i] === 'object') {\n\t\t\t\t// Recurse object\n\t\t\t\tresult = this.hasObjectPaths(testKeys[i], testObj[i]);\n\n\t\t\t\t// Should we exit early?\n\t\t\t\tif (!result) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n};\n\n/**\n * Counts the total number of key endpoints in the passed object.\n * @param {Object} testObj The object to count key endpoints for.\n * @returns {Number} The number of endpoints.\n */\nPath.prototype.countKeys = function (testObj) {\n\tvar totalKeys = 0,\n\t\ti;\n\n\tfor (i in testObj) {\n\t\tif (testObj.hasOwnProperty(i)) {\n\t\t\tif (testObj[i] !== undefined) {\n\t\t\t\tif (typeof testObj[i] !== 'object') {\n\t\t\t\t\ttotalKeys++;\n\t\t\t\t} else {\n\t\t\t\t\ttotalKeys += this.countKeys(testObj[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn totalKeys;\n};\n\n/**\n * Tests if the passed object has the paths that are specified and that\n * a value exists in those paths and if so returns the number matched.\n * @param {Object} testKeys The object describing the paths to test for.\n * @param {Object} testObj The object to test paths against.\n * @returns {Object} Stats on the matched keys\n */\nPath.prototype.countObjectPaths = function (testKeys, testObj) {\n\tvar matchData,\n\t\tmatchedKeys = {},\n\t\tmatchedKeyCount = 0,\n\t\ttotalKeyCount = 0,\n\t\ti;\n\n\tfor (i in testObj) {\n\t\tif (testObj.hasOwnProperty(i)) {\n\t\t\tif (typeof testObj[i] === 'object') {\n\t\t\t\t// The test / query object key is an object, recurse\n\t\t\t\tmatchData = this.countObjectPaths(testKeys[i], testObj[i]);\n\n\t\t\t\tmatchedKeys[i] = matchData.matchedKeys;\n\t\t\t\ttotalKeyCount += matchData.totalKeyCount;\n\t\t\t\tmatchedKeyCount += matchData.matchedKeyCount;\n\t\t\t} else {\n\t\t\t\t// The test / query object has a property that is not an object so add it as a key\n\t\t\t\ttotalKeyCount++;\n\n\t\t\t\t// Check if the test keys also have this key and it is also not an object\n\t\t\t\tif (testKeys && testKeys[i] && typeof testKeys[i] !== 'object') {\n\t\t\t\t\tmatchedKeys[i] = true;\n\t\t\t\t\tmatchedKeyCount++;\n\t\t\t\t} else {\n\t\t\t\t\tmatchedKeys[i] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tmatchedKeys: matchedKeys,\n\t\tmatchedKeyCount: matchedKeyCount,\n\t\ttotalKeyCount: totalKeyCount\n\t};\n};\n\n/**\n * Takes a non-recursive object and converts the object hierarchy into\n * a path string.\n * @param {Object} obj The object to parse.\n * @param {Boolean=} withValue If true will include a 'value' key in the returned\n * object that represents the value the object path points to.\n * @returns {Object}\n */\nPath.prototype.parse = function (obj, withValue) {\n\tvar paths = [],\n\t\tpath = '',\n\t\tresultData,\n\t\ti, k;\n\n\tfor (i in obj) {\n\t\tif (obj.hasOwnProperty(i)) {\n\t\t\t// Set the path to the key\n\t\t\tpath = i;\n\n\t\t\tif (typeof(obj[i]) === 'object') {\n\t\t\t\tif (withValue) {\n\t\t\t\t\tresultData = this.parse(obj[i], withValue);\n\n\t\t\t\t\tfor (k = 0; k < resultData.length; k++) {\n\t\t\t\t\t\tpaths.push({\n\t\t\t\t\t\t\tpath: path + '.' + resultData[k].path,\n\t\t\t\t\t\t\tvalue: resultData[k].value\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tresultData = this.parse(obj[i]);\n\n\t\t\t\t\tfor (k = 0; k < resultData.length; k++) {\n\t\t\t\t\t\tpaths.push({\n\t\t\t\t\t\t\tpath: path + '.' + resultData[k].path\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (withValue) {\n\t\t\t\t\tpaths.push({\n\t\t\t\t\t\tpath: path,\n\t\t\t\t\t\tvalue: obj[i]\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\tpaths.push({\n\t\t\t\t\t\tpath: path\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn paths;\n};\n\n/**\n * Takes a non-recursive object and converts the object hierarchy into\n * an array of path strings that allow you to target all possible paths\n * in an object.\n *\n * The options object accepts an \"ignore\" field with a regular expression\n * as the value. If any key matches the expression it is not included in\n * the results.\n *\n * The options object accepts a boolean \"verbose\" field. If set to true\n * the results will include all paths leading up to endpoints as well as\n * they endpoints themselves.\n *\n * @returns {Array}\n */\nPath.prototype.parseArr = function (obj, options) {\n\toptions = options || {};\n\treturn this._parseArr(obj, '', [], options);\n};\n\nPath.prototype._parseArr = function (obj, path, paths, options) {\n\tvar i,\n\t\tnewPath = '';\n\n\tpath = path || '';\n\tpaths = paths || [];\n\n\tfor (i in obj) {\n\t\tif (obj.hasOwnProperty(i)) {\n\t\t\tif (!options.ignore || (options.ignore && !options.ignore.test(i))) {\n\t\t\t\tif (path) {\n\t\t\t\t\tnewPath = path + '.' + i;\n\t\t\t\t} else {\n\t\t\t\t\tnewPath = i;\n\t\t\t\t}\n\n\t\t\t\tif (typeof(obj[i]) === 'object') {\n\t\t\t\t\tif (options.verbose) {\n\t\t\t\t\t\tpaths.push(newPath);\n\t\t\t\t\t}\n\n\t\t\t\t\tthis._parseArr(obj[i], newPath, paths, options);\n\t\t\t\t} else {\n\t\t\t\t\tpaths.push(newPath);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn paths;\n};\n\n/**\n * Sets a value on an object for the specified path.\n * @param {Object} obj The object to update.\n * @param {String} path The path to update.\n * @param {*} val The value to set the object path to.\n * @returns {*}\n */\nPath.prototype.set = function (obj, path, val) {\n\tif (obj !== undefined && path !== undefined) {\n\t\tvar pathParts,\n\t\t\t\tpart;\n\n\t\tpath = this.clean(path);\n\t\tpathParts = path.split('.');\n\n\t\tpart = pathParts.shift();\n\n\t\tif (pathParts.length) {\n\t\t\t// Generate the path part in the object if it does not already exist\n\t\t\tobj[part] = obj[part] || {};\n\n\t\t\t// Recurse\n\t\t\tthis.set(obj[part], pathParts.join('.'), val);\n\t\t} else {\n\t\t\t// Set the value\n\t\t\tobj[part] = val;\n\t\t}\n\t}\n\n\treturn obj;\n};\n\n/**\n * Gets a single value from the passed object and given path.\n * @param {Object} obj The object to inspect.\n * @param {String} path The path to retrieve data from.\n * @returns {*}\n */\nPath.prototype.get = function (obj, path) {\n\treturn this.value(obj, path)[0];\n};\n\n/**\n * Gets the value(s) that the object contains for the currently assigned path string.\n * @param {Object} obj The object to evaluate the path against.\n * @param {String=} path A path to use instead of the existing one passed in path().\n * @param {Object=} options An optional options object.\n * @returns {Array} An array of values for the given path.\n */\nPath.prototype.value = function (obj, path, options) {\n\tvar pathParts,\n\t\tarr,\n\t\tarrCount,\n\t\tobjPart,\n\t\tobjPartParent,\n\t\tvaluesArr,\n\t\treturnArr,\n\t\ti, k;\n\n\t// Detect early exit\n\tif (path && path.indexOf('.') === -1) {\n\t\treturn [obj[path]];\n\t}\n\n\tif (obj !== undefined && typeof obj === 'object') {\n\t\tif (!options || options && !options.skipArrCheck) {\n\t\t\t// Check if we were passed an array of objects and if so,\n\t\t\t// iterate over the array and return the value from each\n\t\t\t// array item\n\t\t\tif (obj instanceof Array) {\n\t\t\t\treturnArr = [];\n\n\t\t\t\tfor (i = 0; i < obj.length; i++) {\n\t\t\t\t\treturnArr.push(this.get(obj[i], path));\n\t\t\t\t}\n\n\t\t\t\treturn returnArr;\n\t\t\t}\n\t\t}\n\n\t\tvaluesArr = [];\n\n\t\tif (path !== undefined) {\n\t\t\tpath = this.clean(path);\n\t\t\tpathParts = path.split('.');\n\t\t}\n\n\t\tarr = pathParts || this._pathParts;\n\t\tarrCount = arr.length;\n\t\tobjPart = obj;\n\n\t\tfor (i = 0; i < arrCount; i++) {\n\t\t\tobjPart = objPart[arr[i]];\n\n\t\t\tif (objPartParent instanceof Array) {\n\t\t\t\t// Search inside the array for the next key\n\t\t\t\tfor (k = 0; k < objPartParent.length; k++) {\n\t\t\t\t\tvaluesArr = valuesArr.concat(this.value(objPartParent, k + '.' + arr[i], {skipArrCheck: true}));\n\t\t\t\t}\n\n\t\t\t\treturn valuesArr;\n\t\t\t} else {\n\t\t\t\tif (!objPart || typeof(objPart) !== 'object') {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tobjPartParent = objPart;\n\t\t}\n\n\t\treturn [objPart];\n\t} else {\n\t\treturn [];\n\t}\n};\n\n/**\n * Push a value to an array on an object for the specified path.\n * @param {Object} obj The object to update.\n * @param {String} path The path to the array to push to.\n * @param {*} val The value to push to the array at the object path.\n * @returns {*}\n */\nPath.prototype.push = function (obj, path, val) {\n\tif (obj !== undefined && path !== undefined) {\n\t\tvar pathParts,\n\t\t\tpart;\n\n\t\tpath = this.clean(path);\n\t\tpathParts = path.split('.');\n\n\t\tpart = pathParts.shift();\n\n\t\tif (pathParts.length) {\n\t\t\t// Generate the path part in the object if it does not already exist\n\t\t\tobj[part] = obj[part] || {};\n\n\t\t\t// Recurse\n\t\t\tthis.set(obj[part], pathParts.join('.'), val);\n\t\t} else {\n\t\t\t// Set the value\n\t\t\tobj[part] = obj[part] || [];\n\n\t\t\tif (obj[part] instanceof Array) {\n\t\t\t\tobj[part].push(val);\n\t\t\t} else {\n\t\t\t\tthrow('ForerunnerDB.Path: Cannot push to a path whose endpoint is not an array!');\n\t\t\t}\n\t\t}\n\t}\n\n\treturn obj;\n};\n\n/**\n * Gets the value(s) that the object contains for the currently assigned path string\n * with their associated keys.\n * @param {Object} obj The object to evaluate the path against.\n * @param {String=} path A path to use instead of the existing one passed in path().\n * @returns {Array} An array of values for the given path with the associated key.\n */\nPath.prototype.keyValue = function (obj, path) {\n\tvar pathParts,\n\t\tarr,\n\t\tarrCount,\n\t\tobjPart,\n\t\tobjPartParent,\n\t\tobjPartHash,\n\t\ti;\n\n\tif (path !== undefined) {\n\t\tpath = this.clean(path);\n\t\tpathParts = path.split('.');\n\t}\n\n\tarr = pathParts || this._pathParts;\n\tarrCount = arr.length;\n\tobjPart = obj;\n\n\tfor (i = 0; i < arrCount; i++) {\n\t\tobjPart = objPart[arr[i]];\n\n\t\tif (!objPart || typeof(objPart) !== 'object') {\n\t\t\tobjPartHash = arr[i] + ':' + objPart;\n\t\t\tbreak;\n\t\t}\n\n\t\tobjPartParent = objPart;\n\t}\n\n\treturn objPartHash;\n};\n\n/**\n * Sets a value on an object for the specified path.\n * @param {Object} obj The object to update.\n * @param {String} path The path to update.\n * @param {*} val The value to set the object path to.\n * @returns {*}\n */\nPath.prototype.set = function (obj, path, val) {\n\tif (obj !== undefined && path !== undefined) {\n\t\tvar pathParts,\n\t\t\tpart;\n\n\t\tpath = this.clean(path);\n\t\tpathParts = path.split('.');\n\n\t\tpart = pathParts.shift();\n\n\t\tif (pathParts.length) {\n\t\t\t// Generate the path part in the object if it does not already exist\n\t\t\tobj[part] = obj[part] || {};\n\n\t\t\t// Recurse\n\t\t\tthis.set(obj[part], pathParts.join('.'), val);\n\t\t} else {\n\t\t\t// Set the value\n\t\t\tobj[part] = val;\n\t\t}\n\t}\n\n\treturn obj;\n};\n\n/**\n * Removes leading period (.) from string and returns it.\n * @param {String} str The string to clean.\n * @returns {*}\n */\nPath.prototype.clean = function (str) {\n\tif (str.substr(0, 1) === '.') {\n\t\tstr = str.substr(1, str.length -1);\n\t}\n\n\treturn str;\n};\n\nShared.finishModule('Path');\nmodule.exports = Path;\n},{\"./Shared\":33}],28:[function(_dereq_,module,exports){\n\"use strict\";\n\n// Import external names locally\nvar Shared = _dereq_('./Shared'),\n\tasync = _dereq_('async'),\n\tlocalforage = _dereq_('localforage'),\n\tFdbCompress = _dereq_('./PersistCompress'),// jshint ignore:line\n\tFdbCrypto = _dereq_('./PersistCrypto'),// jshint ignore:line\n\tDb,\n\tCollection,\n\tCollectionDrop,\n\tCollectionGroup,\n\tCollectionInit,\n\tDbInit,\n\tDbDrop,\n\tPersist,\n\tOverload;//,\n\t//DataVersion = '2.0';\n\n/**\n * The persistent storage class handles loading and saving data to browser\n * storage.\n * @constructor\n */\nPersist = function () {\n\tthis.init.apply(this, arguments);\n};\n\n/**\n * The local forage library.\n */\nPersist.prototype.localforage = localforage;\n\n/**\n * The init method that can be overridden or extended.\n * @param {Db} db The ForerunnerDB database instance.\n */\nPersist.prototype.init = function (db) {\n\tvar self = this;\n\n\tthis._encodeSteps = [\n\t\tfunction () { return self._encode.apply(self, arguments); }\n\t];\n\tthis._decodeSteps = [\n\t\tfunction () { return self._decode.apply(self, arguments); }\n\t];\n\n\t// Check environment\n\tif (db.isClient()) {\n\t\tif (window.Storage !== undefined) {\n\t\t\tthis.mode('localforage');\n\n\t\t\tlocalforage.config({\n\t\t\t\tdriver: [\n\t\t\t\t\tlocalforage.INDEXEDDB,\n\t\t\t\t\tlocalforage.WEBSQL,\n\t\t\t\t\tlocalforage.LOCALSTORAGE\n\t\t\t\t],\n\t\t\t\tname: String(db.core().name()),\n\t\t\t\tstoreName: 'FDB'\n\t\t\t});\n\t\t}\n\t}\n};\n\nShared.addModule('Persist', Persist);\nShared.mixin(Persist.prototype, 'Mixin.ChainReactor');\nShared.mixin(Persist.prototype, 'Mixin.Common');\n\nDb = Shared.modules.Db;\nCollection = _dereq_('./Collection');\nCollectionDrop = Collection.prototype.drop;\nCollectionGroup = _dereq_('./CollectionGroup');\nCollectionInit = Collection.prototype.init;\nDbInit = Db.prototype.init;\nDbDrop = Db.prototype.drop;\nOverload = Shared.overload;\n\n/**\n * Gets / sets the auto flag which determines if the persistence module\n * will automatically load data for collections the first time they are\n * accessed and save data whenever it changes. This is disabled by\n * default.\n * @param {Boolean} val Set to true to enable, false to disable\n * @returns {*}\n */\nShared.synthesize(Persist.prototype, 'auto', function (val) {\n\tvar self = this;\n\n\tif (val !== undefined) {\n\t\tif (val) {\n\t\t\t// Hook db events\n\t\t\tthis._db.on('create', function () { self._autoLoad.apply(self, arguments); });\n\t\t\tthis._db.on('change', function () { self._autoSave.apply(self, arguments); });\n\n\t\t\tif (this._db.debug()) {\n\t\t\t\tconsole.log(this._db.logIdentifier() + ' Automatic load/save enabled');\n\t\t\t}\n\t\t} else {\n\t\t\t// Un-hook db events\n\t\t\tthis._db.off('create', this._autoLoad);\n\t\t\tthis._db.off('change', this._autoSave);\n\n\t\t\tif (this._db.debug()) {\n\t\t\t\tconsole.log(this._db.logIdentifier() + ' Automatic load/save disbled');\n\t\t\t}\n\t\t}\n\t}\n\n\treturn this.$super.call(this, val);\n});\n\nPersist.prototype._autoLoad = function (obj, objType, name) {\n\tvar self = this;\n\n\tif (typeof obj.load === 'function') {\n\t\tif (self._db.debug()) {\n\t\t\tconsole.log(self._db.logIdentifier() + ' Auto-loading data for ' + objType + ':', name);\n\t\t}\n\n\t\tobj.load(function (err, data) {\n\t\t\tif (err && self._db.debug()) {\n\t\t\t\tconsole.log(self._db.logIdentifier() + ' Automatic load failed:', err);\n\t\t\t}\n\n\t\t\tself.emit('load', err, data);\n\t\t});\n\t} else {\n\t\tif (self._db.debug()) {\n\t\t\tconsole.log(self._db.logIdentifier() + ' Auto-load for ' + objType + ':', name, 'no load method, skipping');\n\t\t}\n\t}\n};\n\nPersist.prototype._autoSave = function (obj, objType, name) {\n\tvar self = this;\n\n\tif (typeof obj.save === 'function') {\n\t\tif (self._db.debug()) {\n\t\t\tconsole.log(self._db.logIdentifier() + ' Auto-saving data for ' + objType + ':', name);\n\t\t}\n\n\t\tobj.save(function (err, data) {\n\t\t\tif (err && self._db.debug()) {\n\t\t\t\tconsole.log(self._db.logIdentifier() + ' Automatic save failed:', err);\n\t\t\t}\n\n\t\t\tself.emit('save', err, data);\n\t\t});\n\t}\n};\n\n/**\n * Gets / sets the persistent storage mode (the library used\n * to persist data to the browser - defaults to localForage).\n * @param {String} type The library to use for storage. Defaults\n * to localForage.\n * @returns {*}\n */\nPersist.prototype.mode = function (type) {\n\tif (type !== undefined) {\n\t\tthis._mode = type;\n\t\treturn this;\n\t}\n\n\treturn this._mode;\n};\n\n/**\n * Gets / sets the driver used when persisting data.\n * @param {String} val Specify the driver type (LOCALSTORAGE,\n * WEBSQL or INDEXEDDB)\n * @returns {*}\n */\nPersist.prototype.driver = function (val) {\n\tif (val !== undefined) {\n\t\tswitch (val.toUpperCase()) {\n\t\t\tcase 'LOCALSTORAGE':\n\t\t\t\tlocalforage.setDriver(localforage.LOCALSTORAGE);\n\t\t\t\tbreak;\n\n\t\t\tcase 'WEBSQL':\n\t\t\t\tlocalforage.setDriver(localforage.WEBSQL);\n\t\t\t\tbreak;\n\n\t\t\tcase 'INDEXEDDB':\n\t\t\t\tlocalforage.setDriver(localforage.INDEXEDDB);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tthrow('ForerunnerDB.Persist: The persistence driver you have specified is not found. Please use either IndexedDB, WebSQL or LocalStorage!');\n\t\t}\n\n\t\treturn this;\n\t}\n\n\treturn localforage.driver();\n};\n\n/**\n * Starts a decode waterfall process.\n * @param {*} val The data to be decoded.\n * @param {Function} finished The callback to pass final data to.\n */\nPersist.prototype.decode = function (val, finished) {\n\tasync.waterfall([function (callback) {\n\t\tif (callback) { callback(false, val, {}); }\n\t}].concat(this._decodeSteps), finished);\n};\n\n/**\n * Starts an encode waterfall process.\n * @param {*} val The data to be encoded.\n * @param {Function} finished The callback to pass final data to.\n */\nPersist.prototype.encode = function (val, finished) {\n\tasync.waterfall([function (callback) {\n\t\tif (callback) { callback(false, val, {}); }\n\t}].concat(this._encodeSteps), finished);\n};\n\nShared.synthesize(Persist.prototype, 'encodeSteps');\nShared.synthesize(Persist.prototype, 'decodeSteps');\n\n/**\n * Adds an encode/decode step to the persistent storage system so\n * that you can add custom functionality.\n * @param {Function} encode The encode method called with the data from the\n * previous encode step. When your method is complete it MUST call the\n * callback method. If you provide anything other than false to the err\n * parameter the encoder will fail and throw an error.\n * @param {Function} decode The decode method called with the data from the\n * previous decode step. When your method is complete it MUST call the\n * callback method. If you provide anything other than false to the err\n * parameter the decoder will fail and throw an error.\n * @param {Number=} index Optional index to add the encoder step to. This\n * allows you to place a step before or after other existing steps. If not\n * provided your step is placed last in the list of steps. For instance if\n * you are providing an encryption step it makes sense to place this last\n * since all previous steps will then have their data encrypted by your\n * final step.\n */\nPersist.prototype.addStep = new Overload({\n\t'object': function (obj) {\n\t\tthis.$main.call(this, function objEncode () { obj.encode.apply(obj, arguments); }, function objDecode () { obj.decode.apply(obj, arguments); }, 0);\n\t},\n\n\t'function, function': function (encode, decode) {\n\t\tthis.$main.call(this, encode, decode, 0);\n\t},\n\n\t'function, function, number': function (encode, decode, index) {\n\t\tthis.$main.call(this, encode, decode, index);\n\t},\n\n\t$main: function (encode, decode, index) {\n\t\tif (index === 0 || index === undefined) {\n\t\t\tthis._encodeSteps.push(encode);\n\t\t\tthis._decodeSteps.unshift(decode);\n\t\t} else {\n\t\t\t// Place encoder step at index then work out correct\n\t\t\t// index to place decoder step\n\t\t\tthis._encodeSteps.splice(index, 0, encode);\n\t\t\tthis._decodeSteps.splice(this._decodeSteps.length - index, 0, decode);\n\t\t}\n\t}\n});\n\nPersist.prototype.unwrap = function (dataStr) {\n\tvar parts = dataStr.split('::fdb::'),\n\t\tdata;\n\n\tswitch (parts[0]) {\n\t\tcase 'json':\n\t\t\tdata = this.jParse(parts[1]);\n\t\t\tbreak;\n\n\t\tcase 'raw':\n\t\t\tdata = parts[1];\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tbreak;\n\t}\n};\n\n/**\n * Takes encoded data and decodes it for use as JS native objects and arrays.\n * @param {String} val The currently encoded string data.\n * @param {Object} meta Meta data object that can be used to pass back useful\n * supplementary data.\n * @param {Function} finished The callback method to call when decoding is\n * completed.\n * @private\n */\nPersist.prototype._decode = function (val, meta, finished) {\n\tvar parts,\n\t\tdata;\n\n\tif (val) {\n\t\tparts = val.split('::fdb::');\n\n\t\tswitch (parts[0]) {\n\t\t\tcase 'json':\n\t\t\t\tdata = this.jParse(parts[1]);\n\t\t\t\tbreak;\n\n\t\t\tcase 'raw':\n\t\t\t\tdata = parts[1];\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (data) {\n\t\t\tmeta.foundData = true;\n\t\t\tmeta.rowCount = data.length || 0;\n\t\t} else {\n\t\t\tmeta.foundData = false;\n\t\t\tmeta.rowCount = 0;\n\t\t}\n\n\t\tif (finished) {\n\t\t\tfinished(false, data, meta);\n\t\t}\n\t} else {\n\t\tmeta.foundData = false;\n\t\tmeta.rowCount = 0;\n\n\t\tif (finished) {\n\t\t\tfinished(false, val, meta);\n\t\t}\n\t}\n};\n\n/**\n * Takes native JS data and encodes it for for storage as a string.\n * @param {Object} val The current un-encoded data.\n * @param {Object} meta Meta data object that can be used to pass back useful\n * supplementary data.\n * @param {Function} finished The callback method to call when encoding is\n * completed.\n * @private\n */\nPersist.prototype._encode = function (val, meta, finished) {\n\tvar data = val;\n\n\tif (typeof val === 'object') {\n\t\tval = 'json::fdb::' + this.jStringify(val);\n\t} else {\n\t\tval = 'raw::fdb::' + val;\n\t}\n\n\tif (data) {\n\t\tmeta.foundData = true;\n\t\tmeta.rowCount = data.length || 0;\n\t} else {\n\t\tmeta.foundData = false;\n\t\tmeta.rowCount = 0;\n\t}\n\n\tif (finished) {\n\t\tfinished(false, val, meta);\n\t}\n};\n\n/**\n * Encodes passed data and then stores it in the browser's persistent\n * storage layer.\n * @param {String} key The key to store the data under in the persistent\n * storage.\n * @param {Object} data The data to store under the key.\n * @param {Function=} callback The method to call when the save process\n * has completed.\n */\nPersist.prototype.save = function (key, data, callback) {\n\tswitch (this.mode()) {\n\t\tcase 'localforage':\n\t\t\tthis.encode(data, function (err, data, tableStats) {\n\t\t\t\tlocalforage.setItem(key, data).then(function (data) {\n\t\t\t\t\tif (callback) { callback(false, data, tableStats); }\n\t\t\t\t}, function (err) {\n\t\t\t\t\tif (callback) { callback(err); }\n\t\t\t\t});\n\t\t\t});\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tif (callback) { callback('No data handler.'); }\n\t\t\tbreak;\n\t}\n};\n\n/**\n * Loads and decodes data from the passed key.\n * @param {String} key The key to retrieve data from in the persistent\n * storage.\n * @param {Function=} callback The method to call when the load process\n * has completed.\n */\nPersist.prototype.load = function (key, callback) {\n\tvar self = this;\n\n\tswitch (this.mode()) {\n\t\tcase 'localforage':\n\t\t\tlocalforage.getItem(key).then(function (val) {\n\t\t\t\tself.decode(val, callback);\n\t\t\t}, function (err) {\n\t\t\t\tif (callback) { callback(err); }\n\t\t\t});\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tif (callback) { callback('No data handler or unrecognised data type.');\t}\n\t\t\tbreak;\n\t}\n};\n\n/**\n * Deletes data in persistent storage stored under the passed key.\n * @param {String} key The key to drop data for in the storage.\n * @param {Function=} callback The method to call when the data is dropped.\n */\nPersist.prototype.drop = function (key, callback) {\n\tswitch (this.mode()) {\n\t\tcase 'localforage':\n\t\t\tlocalforage.removeItem(key).then(function () {\n\t\t\t\tif (callback) { callback(false); }\n\t\t\t}, function (err) {\n\t\t\t\tif (callback) { callback(err); }\n\t\t\t});\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tif (callback) { callback('No data handler or unrecognised data type.'); }\n\t\t\tbreak;\n\t}\n\n};\n\n// Extend the Collection prototype with persist methods\nCollection.prototype.drop = new Overload({\n\t/**\n\t * Drop collection and persistent storage.\n\t */\n\t'': function () {\n\t\tif (!this.isDropped()) {\n\t\t\tthis.drop(true);\n\t\t}\n\t},\n\n\t/**\n\t * Drop collection and persistent storage with callback.\n\t * @param {Function} callback Callback method.\n\t */\n\t'function': function (callback) {\n\t\tif (!this.isDropped()) {\n\t\t\tthis.drop(true, callback);\n\t\t}\n\t},\n\n\t/**\n\t * Drop collection and optionally drop persistent storage.\n\t * @param {Boolean} removePersistent True to drop persistent storage, false to keep it.\n\t */\n\t'boolean': function (removePersistent) {\n\t\tif (!this.isDropped()) {\n\t\t\t// Remove persistent storage\n\t\t\tif (removePersistent) {\n\t\t\t\tif (this._name) {\n\t\t\t\t\tif (this._db) {\n\t\t\t\t\t\t// Drop the collection data from storage\n\t\t\t\t\t\tthis._db.persist.drop(this._db._name + '-' + this._name);\n\t\t\t\t\t\tthis._db.persist.drop(this._db._name + '-' + this._name + '-metaData');\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tthrow('ForerunnerDB.Persist: Cannot drop a collection\\'s persistent storage when no name assigned to collection!');\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Call the original method\n\t\t\tCollectionDrop.call(this);\n\t\t}\n\t},\n\n\t/**\n\t * Drop collections and optionally drop persistent storage with callback.\n\t * @param {Boolean} removePersistent True to drop persistent storage, false to keep it.\n\t * @param {Function} callback Callback method.\n\t */\n\t'boolean, function': function (removePersistent, callback) {\n\t\tvar self = this;\n\n\t\tif (!this.isDropped()) {\n\t\t\t// Remove persistent storage\n\t\t\tif (removePersistent) {\n\t\t\t\tif (this._name) {\n\t\t\t\t\tif (this._db) {\n\t\t\t\t\t\t// Drop the collection data from storage\n\t\t\t\t\t\tthis._db.persist.drop(this._db._name + '-' + this._name, function () {\n\t\t\t\t\t\t\tself._db.persist.drop(self._db._name + '-' + self._name + '-metaData', callback);\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\treturn CollectionDrop.call(this);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (callback) { callback('Cannot drop a collection\\'s persistent storage when the collection is not attached to a database!'); }\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (callback) { callback('Cannot drop a collection\\'s persistent storage when no name assigned to collection!'); }\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Call the original method\n\t\t\t\treturn CollectionDrop.call(this, callback);\n\t\t\t}\n\t\t}\n\t}\n});\n\n/**\n * Saves an entire collection's data to persistent storage.\n * @param {Function=} callback The method to call when the save function\n * has completed.\n */\nCollection.prototype.save = function (callback) {\n\tvar self = this,\n\t\tprocessSave;\n\n\tif (self._name) {\n\t\tif (self._db) {\n\t\t\tprocessSave = function () {\n\t\t\t\t// Save the collection data\n\t\t\t\tself._db.persist.save(self._db._name + '-' + self._name, self._data, function (err, data, tableStats) {\n\t\t\t\t\tif (!err) {\n\t\t\t\t\t\tself._db.persist.save(self._db._name + '-' + self._name + '-metaData', self.metaData(), function (err, data, metaStats) {\n\t\t\t\t\t\t\tif (callback) { callback(err, data, tableStats, metaStats); }\n\t\t\t\t\t\t});\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (callback) { callback(err); }\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t};\n\n\t\t\t// Check for processing queues\n\t\t\tif (self.isProcessingQueue()) {\n\t\t\t\t// Hook queue complete to process save\n\t\t\t\tself.on('queuesComplete', function () {\n\t\t\t\t\tprocessSave();\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\t// Process save immediately\n\t\t\t\tprocessSave();\n\t\t\t}\n\t\t} else {\n\t\t\tif (callback) { callback('Cannot save a collection that is not attached to a database!'); }\n\t\t}\n\t} else {\n\t\tif (callback) { callback('Cannot save a collection with no assigned name!'); }\n\t}\n};\n\n/**\n * Loads an entire collection's data from persistent storage.\n * @param {Function=} callback The method to call when the load function\n * has completed.\n */\nCollection.prototype.load = function (callback) {\n\tvar self = this;\n\n\tif (self._name) {\n\t\tif (self._db) {\n\t\t\t// Load the collection data\n\t\t\tself._db.persist.load(self._db._name + '-' + self._name, function (err, data, tableStats) {\n\t\t\t\tif (!err) {\n\t\t\t\t\tif (data) {\n\t\t\t\t\t\t// Remove all previous data\n\t\t\t\t\t\tself.remove({});\n\t\t\t\t\t\tself.insert(data);\n\t\t\t\t\t\t//self.setData(data);\n\t\t\t\t\t}\n\n\t\t\t\t\t// Now load the collection's metadata\n\t\t\t\t\tself._db.persist.load(self._db._name + '-' + self._name + '-metaData', function (err, data, metaStats) {\n\t\t\t\t\t\tif (!err) {\n\t\t\t\t\t\t\tif (data) {\n\t\t\t\t\t\t\t\tself.metaData(data);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (callback) { callback(err, tableStats, metaStats); }\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\tif (callback) { callback(err); }\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\tif (callback) { callback('Cannot load a collection that is not attached to a database!'); }\n\t\t}\n\t} else {\n\t\tif (callback) { callback('Cannot load a collection with no assigned name!'); }\n\t}\n};\n\n/**\n * Gets the data that represents this collection for easy storage using\n * a third-party method / plugin instead of using the standard persistent\n * storage system.\n * @param {Function} callback The method to call with the data response.\n */\nCollection.prototype.saveCustom = function (callback) {\n\tvar self = this,\n\t\tmyData = {},\n\t\tprocessSave;\n\n\tif (self._name) {\n\t\tif (self._db) {\n\t\t\tprocessSave = function () {\n\t\t\t\tself.encode(self._data, function (err, data, tableStats) {\n\t\t\t\t\tif (!err) {\n\t\t\t\t\t\tmyData.data = {\n\t\t\t\t\t\t\tname: self._db._name + '-' + self._name,\n\t\t\t\t\t\t\tstore: data,\n\t\t\t\t\t\t\ttableStats: tableStats\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\tself.encode(self._data, function (err, data, tableStats) {\n\t\t\t\t\t\t\tif (!err) {\n\t\t\t\t\t\t\t\tmyData.metaData = {\n\t\t\t\t\t\t\t\t\tname: self._db._name + '-' + self._name + '-metaData',\n\t\t\t\t\t\t\t\t\tstore: data,\n\t\t\t\t\t\t\t\t\ttableStats: tableStats\n\t\t\t\t\t\t\t\t};\n\n\t\t\t\t\t\t\t\tcallback(false, myData);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tcallback(err);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcallback(err);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t};\n\n\t\t\t// Check for processing queues\n\t\t\tif (self.isProcessingQueue()) {\n\t\t\t\t// Hook queue complete to process save\n\t\t\t\tself.on('queuesComplete', function () {\n\t\t\t\t\tprocessSave();\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\t// Process save immediately\n\t\t\t\tprocessSave();\n\t\t\t}\n\t\t} else {\n\t\t\tif (callback) { callback('Cannot save a collection that is not attached to a database!'); }\n\t\t}\n\t} else {\n\t\tif (callback) { callback('Cannot save a collection with no assigned name!'); }\n\t}\n};\n\n/**\n * Loads custom data loaded by a third-party plugin into the collection.\n * @param {Object} myData Data object previously saved by using saveCustom()\n * @param {Function} callback A callback method to receive notification when\n * data has loaded.\n */\nCollection.prototype.loadCustom = function (myData, callback) {\n\tvar self = this;\n\n\tif (self._name) {\n\t\tif (self._db) {\n\t\t\tif (myData.data && myData.data.store) {\n\t\t\t\tif (myData.metaData && myData.metaData.store) {\n\t\t\t\t\tself.decode(myData.data.store, function (err, data, tableStats) {\n\t\t\t\t\t\tif (!err) {\n\t\t\t\t\t\t\tif (data) {\n\t\t\t\t\t\t\t\t// Remove all previous data\n\t\t\t\t\t\t\t\tself.remove({});\n\t\t\t\t\t\t\t\tself.insert(data);\n\n\t\t\t\t\t\t\t\tself.decode(myData.metaData.store, function (err, data, metaStats) {\n\t\t\t\t\t\t\t\t\tif (!err) {\n\t\t\t\t\t\t\t\t\t\tif (data) {\n\t\t\t\t\t\t\t\t\t\t\tself.metaData(data);\n\n\t\t\t\t\t\t\t\t\t\t\tif (callback) { callback(err, tableStats, metaStats); }\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tcallback(err);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tcallback(err);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\tcallback('No \"metaData\" key found in passed object!');\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcallback('No \"data\" key found in passed object!');\n\t\t\t}\n\t\t} else {\n\t\t\tif (callback) { callback('Cannot load a collection that is not attached to a database!'); }\n\t\t}\n\t} else {\n\t\tif (callback) { callback('Cannot load a collection with no assigned name!'); }\n\t}\n};\n\n// Override the DB init to instantiate the plugin\nDb.prototype.init = function () {\n\tDbInit.apply(this, arguments);\n\tthis.persist = new Persist(this);\n};\n\nDb.prototype.load = new Overload({\n\t/**\n\t * Loads an entire database's data from persistent storage.\n\t * @param {Function=} callback The method to call when the load function\n\t * has completed.\n\t */\n\t'function': function (callback) {\n\t\tthis.$main.call(this, {}, callback);\n\t},\n\n\t'object, function': function (myData, callback) {\n\t\tthis.$main.call(this, myData, callback);\n\t},\n\n\t'$main': function (myData, callback) {\n\t\t// Loop the collections in the database\n\t\tvar obj = this._collection,\n\t\t\tkeys = obj.keys(),\n\t\t\tkeyCount = keys.length,\n\t\t\tloadCallback,\n\t\t\tindex;\n\n\t\tloadCallback = function (err) {\n\t\t\tif (!err) {\n\t\t\t\tkeyCount--;\n\n\t\t\t\tif (keyCount === 0) {\n\t\t\t\t\tif (callback) {\n\t\t\t\t\t\tcallback(false);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (callback) {\n\t\t\t\t\tcallback(err);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\tfor (index in obj) {\n\t\t\tif (obj.hasOwnProperty(index)) {\n\t\t\t\t// Call the collection load method\n\t\t\t\tif (!myData) {\n\t\t\t\t\tobj[index].load(loadCallback);\n\t\t\t\t} else {\n\t\t\t\t\tobj[index].loadCustom(myData, loadCallback);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n});\n\nDb.prototype.save = new Overload({\n\t/**\n\t * Saves an entire database's data to persistent storage.\n\t * @param {Function=} callback The method to call when the save function\n\t * has completed.\n\t */\n\t'function': function (callback) {\n\t\tthis.$main.call(this, {}, callback);\n\t},\n\n\t'object, function': function (options, callback) {\n\t\tthis.$main.call(this, options, callback);\n\t},\n\n\t'$main': function (options, callback) {\n\t\t// Loop the collections in the database\n\t\tvar obj = this._collection,\n\t\t\tkeys = obj.keys(),\n\t\t\tkeyCount = keys.length,\n\t\t\tsaveCallback,\n\t\t\tindex;\n\n\t\tsaveCallback = function (err) {\n\t\t\tif (!err) {\n\t\t\t\tkeyCount--;\n\n\t\t\t\tif (keyCount === 0) {\n\t\t\t\t\tif (callback) { callback(false); }\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (callback) { callback(err); }\n\t\t\t}\n\t\t};\n\n\t\tfor (index in obj) {\n\t\t\tif (obj.hasOwnProperty(index)) {\n\t\t\t\t// Call the collection save method\n\t\t\t\tif (!options.custom) {\n\t\t\t\t\tobj[index].save(saveCallback);\n\t\t\t\t} else {\n\t\t\t\t\tobj[index].saveCustom(saveCallback);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n});\n\nShared.finishModule('Persist');\nmodule.exports = Persist;\n},{\"./Collection\":5,\"./CollectionGroup\":6,\"./PersistCompress\":29,\"./PersistCrypto\":30,\"./Shared\":33,\"async\":35,\"localforage\":71}],29:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tpako = _dereq_('pako');\n\nvar Plugin = function () {\n\tthis.init.apply(this, arguments);\n};\n\nPlugin.prototype.init = function (options) {\n\n};\n\nShared.mixin(Plugin.prototype, 'Mixin.Common');\n\nPlugin.prototype.encode = function (val, meta, finished) {\n\tvar wrapper = {\n\t\t\tdata: val,\n\t\t\ttype: 'fdbCompress',\n\t\t\tenabled: false\n\t\t},\n\t\tbefore,\n\t\tafter,\n\t\tcompressedVal;\n\n\t// Compress the data\n\tbefore = val.length;\n\tcompressedVal = pako.deflate(val, {to: 'string'});\n\tafter = compressedVal.length;\n\n\t// If the compressed version is smaller than the original, use it!\n\tif (after < before) {\n\t\twrapper.data = compressedVal;\n\t\twrapper.enabled = true;\n\t}\n\n\tmeta.compression = {\n\t\tenabled: wrapper.enabled,\n\t\tcompressedBytes: after,\n\t\tuncompressedBytes: before,\n\t\teffect: Math.round((100 / before) * after) + '%'\n\t};\n\n\tfinished(false, this.jStringify(wrapper), meta);\n};\n\nPlugin.prototype.decode = function (wrapper, meta, finished) {\n\tvar compressionEnabled = false,\n\t\tdata;\n\n\tif (wrapper) {\n\t\twrapper = this.jParse(wrapper);\n\n\t\t// Check if we need to decompress the string\n\t\tif (wrapper.enabled) {\n\t\t\tdata = pako.inflate(wrapper.data, {to: 'string'});\n\t\t\tcompressionEnabled = true;\n\t\t} else {\n\t\t\tdata = wrapper.data;\n\t\t\tcompressionEnabled = false;\n\t\t}\n\n\t\tmeta.compression = {\n\t\t\tenabled: compressionEnabled\n\t\t};\n\n\t\tif (finished) {\n\t\t\tfinished(false, data, meta);\n\t\t}\n\t} else {\n\t\tif (finished) {\n\t\t\tfinished(false, data, meta);\n\t\t}\n\t}\n};\n\n// Register this plugin with ForerunnerDB\nShared.plugins.FdbCompress = Plugin;\n\nmodule.exports = Plugin;\n},{\"./Shared\":33,\"pako\":72}],30:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared'),\n\tCryptoJS = _dereq_('crypto-js');\n\nvar Plugin = function () {\n\tthis.init.apply(this, arguments);\n};\n\nPlugin.prototype.init = function (options) {\n\t// Ensure at least a password is passed in options\n\tif (!options || !options.pass) {\n\t\tthrow('Cannot initialise persistent storage encryption without a passphrase provided in the passed options object as the \"pass\" field.');\n\t}\n\n\tthis._algo = options.algo || 'AES';\n\tthis._pass = options.pass;\n};\n\nShared.mixin(Plugin.prototype, 'Mixin.Common');\n\n/**\n * Gets / sets the current pass-phrase being used to encrypt / decrypt\n * data with the plugin.\n */\nShared.synthesize(Plugin.prototype, 'pass');\n\nPlugin.prototype.stringify = function (cipherParams) {\n\t// create json object with ciphertext\n\tvar jsonObj = {\n\t\tct: cipherParams.ciphertext.toString(CryptoJS.enc.Base64)\n\t};\n\n\t// optionally add iv and salt\n\tif (cipherParams.iv) {\n\t\tjsonObj.iv = cipherParams.iv.toString();\n\t}\n\tif (cipherParams.salt) {\n\t\tjsonObj.s = cipherParams.salt.toString();\n\t}\n\n\t// stringify json object\n\treturn this.jStringify(jsonObj);\n};\n\nPlugin.prototype.parse = function (jsonStr) {\n\t// parse json string\n\tvar jsonObj = this.jParse(jsonStr);\n\n\t// extract ciphertext from json object, and create cipher params object\n\tvar cipherParams = CryptoJS.lib.CipherParams.create({\n\t\tciphertext: CryptoJS.enc.Base64.parse(jsonObj.ct)\n\t});\n\n\t// optionally extract iv and salt\n\tif (jsonObj.iv) {\n\t\tcipherParams.iv = CryptoJS.enc.Hex.parse(jsonObj.iv);\n\t}\n\tif (jsonObj.s) {\n\t\tcipherParams.salt = CryptoJS.enc.Hex.parse(jsonObj.s);\n\t}\n\n\treturn cipherParams;\n};\n\nPlugin.prototype.encode = function (val, meta, finished) {\n\tvar self = this,\n\t\twrapper = {\n\t\t\ttype: 'fdbCrypto'\n\t\t},\n\t\tencryptedVal;\n\n\t// Encrypt the data\n\tencryptedVal = CryptoJS[this._algo].encrypt(val, this._pass, {\n\t\tformat: {\n\t\t\tstringify: function () { return self.stringify.apply(self, arguments); },\n\t\t\tparse: function () { return self.parse.apply(self, arguments); }\n\t\t}\n\t});\n\n\twrapper.data = encryptedVal.toString();\n\twrapper.enabled = true;\n\n\tmeta.encryption = {\n\t\tenabled: wrapper.enabled\n\t};\n\n\tif (finished) {\n\t\tfinished(false, this.jStringify(wrapper), meta);\n\t}\n};\n\nPlugin.prototype.decode = function (wrapper, meta, finished) {\n\tvar self = this,\n\t\tdata;\n\n\tif (wrapper) {\n\t\twrapper = this.jParse(wrapper);\n\n\t\tdata = CryptoJS[this._algo].decrypt(wrapper.data, this._pass, {\n\t\t\tformat: {\n\t\t\t\tstringify: function () { return self.stringify.apply(self, arguments); },\n\t\t\t\tparse: function () { return self.parse.apply(self, arguments); }\n\t\t\t}\n\t\t}).toString(CryptoJS.enc.Utf8);\n\n\t\tif (finished) {\n\t\t\tfinished(false, data, meta);\n\t\t}\n\t} else {\n\t\tif (finished) {\n\t\t\tfinished(false, wrapper, meta);\n\t\t}\n\t}\n};\n\n// Register this plugin with ForerunnerDB\nShared.plugins.FdbCrypto = Plugin;\n\nmodule.exports = Plugin;\n},{\"./Shared\":33,\"crypto-js\":44}],31:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Shared = _dereq_('./Shared');\n\n/**\n * Provides chain reactor node linking so that a chain reaction can propagate\n * down a node tree. Effectively creates a chain link between the reactorIn and\n * reactorOut objects where a chain reaction from the reactorIn is passed through\n * the reactorProcess before being passed to the reactorOut object. Reactor\n * packets are only passed through to the reactorOut if the reactor IO method\n * chainSend is used.\n * @param {*} reactorIn An object that has the Mixin.ChainReactor methods mixed\n * in to it. Chain reactions that occur inside this object will be passed through\n * to the reactorOut object.\n * @param {*} reactorOut An object that has the Mixin.ChainReactor methods mixed\n * in to it. Chain reactions that occur in the reactorIn object will be passed\n * through to this object.\n * @param {Function} reactorProcess The processing method to use when chain\n * reactions occur.\n * @constructor\n */\nvar ReactorIO = function (reactorIn, reactorOut, reactorProcess) {\n\tif (reactorIn && reactorOut && reactorProcess) {\n\t\tthis._reactorIn = reactorIn;\n\t\tthis._reactorOut = reactorOut;\n\t\tthis._chainHandler = reactorProcess;\n\n\t\tif (!reactorIn.chain) {\n\t\t\tthrow('ForerunnerDB.ReactorIO: ReactorIO requires passed in and out objects to implement the ChainReactor mixin!');\n\t\t}\n\n\t\t// Register the reactorIO with the input\n\t\treactorIn.chain(this);\n\n\t\t// Register the output with the reactorIO\n\t\tthis.chain(reactorOut);\n\t} else {\n\t\tthrow('ForerunnerDB.ReactorIO: ReactorIO requires in, out and process arguments to instantiate!');\n\t}\n};\n\nShared.addModule('ReactorIO', ReactorIO);\n\n/**\n * Drop a reactor IO object, breaking the reactor link between the in and out\n * reactor nodes.\n * @returns {boolean}\n */\nReactorIO.prototype.drop = function () {\n\tif (!this.isDropped()) {\n\t\tthis._state = 'dropped';\n\n\t\t// Remove links\n\t\tif (this._reactorIn) {\n\t\t\tthis._reactorIn.unChain(this);\n\t\t}\n\n\t\tif (this._reactorOut) {\n\t\t\tthis.unChain(this._reactorOut);\n\t\t}\n\n\t\tdelete this._reactorIn;\n\t\tdelete this._reactorOut;\n\t\tdelete this._chainHandler;\n\n\t\tthis.emit('drop', this);\n\n\t\tdelete this._listeners;\n\t}\n\n\treturn true;\n};\n\n/**\n * Gets / sets the current state.\n * @param {String=} val The name of the state to set.\n * @returns {*}\n */\nShared.synthesize(ReactorIO.prototype, 'state');\n\nShared.mixin(ReactorIO.prototype, 'Mixin.Common');\nShared.mixin(ReactorIO.prototype, 'Mixin.ChainReactor');\nShared.mixin(ReactorIO.prototype, 'Mixin.Events');\n\nShared.finishModule('ReactorIO');\nmodule.exports = ReactorIO;\n},{\"./Shared\":33}],32:[function(_dereq_,module,exports){\n\"use strict\";\n\n/**\n * Provides functionality to encode and decode JavaScript objects to strings\n * and back again. This differs from JSON.stringify and JSON.parse in that\n * special objects such as dates can be encoded to strings and back again\n * so that the reconstituted version of the string still contains a JavaScript\n * date object.\n * @constructor\n */\nvar Serialiser = function () {\n\tthis.init.apply(this, arguments);\n};\n\nSerialiser.prototype.init = function () {\n\tvar self = this;\n\n\tthis._encoder = [];\n\tthis._decoder = [];\n\n\t// Handler for Date() objects\n\tthis.registerHandler('$date', function (objInstance) {\n\t\tif (objInstance instanceof Date) {\n\t\t\t// Augment this date object with a new toJSON method\n\t\t\tobjInstance.toJSON = function () {\n\t\t\t\treturn \"$date:\" + this.toISOString();\n\t\t\t};\n\n\t\t\t// Tell the converter we have matched this object\n\t\t\treturn true;\n\t\t}\n\n\t\t// Tell converter to keep looking, we didn't match this object\n\t\treturn false;\n\t}, function (data) {\n\t\tif (typeof data === 'string' && data.indexOf('$date:') === 0) {\n\t\t\treturn self.convert(new Date(data.substr(6)));\n\t\t}\n\n\t\treturn undefined;\n\t});\n\n\t// Handler for RegExp() objects\n\tthis.registerHandler('$regexp', function (objInstance) {\n\t\tif (objInstance instanceof RegExp) {\n\t\t\tobjInstance.toJSON = function () {\n\t\t\t\treturn \"$regexp:\" + this.source.length + \":\" + this.source + \":\" + (this.global ? 'g' : '') + (this.ignoreCase ? 'i' : '');\n\t\t\t\t/*return {\n\t\t\t\t\tsource: this.source,\n\t\t\t\t\tparams: '' + (this.global ? 'g' : '') + (this.ignoreCase ? 'i' : '')\n\t\t\t\t};*/\n\t\t\t};\n\n\t\t\t// Tell the converter we have matched this object\n\t\t\treturn true;\n\t\t}\n\n\t\t// Tell converter to keep looking, we didn't match this object\n\t\treturn false;\n\t}, function (data) {\n\t\tif (typeof data === 'string' && data.indexOf('$regexp:') === 0) {\n\t\t\tvar dataStr = data.substr(8),//±\n\t\t\t\tlengthEnd = dataStr.indexOf(':'),\n\t\t\t\tsourceLength = Number(dataStr.substr(0, lengthEnd)),\n\t\t\t\tsource = dataStr.substr(lengthEnd + 1, sourceLength),\n\t\t\t\tparams = dataStr.substr(lengthEnd + sourceLength + 2);\n\n\t\t\treturn self.convert(new RegExp(source, params));\n\t\t}\n\n\t\treturn undefined;\n\t});\n};\n\nSerialiser.prototype.registerHandler = function (handles, encoder, decoder) {\n\tif (handles !== undefined) {\n\t\t// Register encoder\n\t\tthis._encoder.push(encoder);\n\n\t\t// Register decoder\n\t\tthis._decoder.push(decoder);\n\t}\n};\n\nSerialiser.prototype.convert = function (data) {\n\t// Run through converters and check for match\n\tvar arr = this._encoder,\n\t\ti;\n\n\tfor (i = 0; i < arr.length; i++) {\n\t\tif (arr[i](data)) {\n\t\t\t// The converter we called matched the object and converted it\n\t\t\t// so let's return it now.\n\t\t\treturn data;\n\t\t}\n\t}\n\n\t// No converter matched the object, return the unaltered one\n\treturn data;\n};\n\nSerialiser.prototype.reviver = function () {\n\tvar arr = this._decoder;\n\n\treturn function (key, value) {\n\t\t// Check if we have a decoder method for this key\n\t\tvar decodedData,\n\t\t\ti;\n\n\t\tfor (i = 0; i < arr.length; i++) {\n\t\t\tdecodedData = arr[i](value);\n\n\t\t\tif (decodedData !== undefined) {\n\t\t\t\t// The decoder we called matched the object and decoded it\n\t\t\t\t// so let's return it now.\n\t\t\t\treturn decodedData;\n\t\t\t}\n\t\t}\n\n\t\t// No decoder, return basic value\n\t\treturn value;\n\t};\n};\n\nmodule.exports = Serialiser;\n},{}],33:[function(_dereq_,module,exports){\n\"use strict\";\n\nvar Overload = _dereq_('./Overload');\n\n/**\n * A shared object that can be used to store arbitrary data between class\n * instances, and access helper methods.\n * @mixin\n */\nvar Shared = {\n\tversion: '1.3.716',\n\tmodules: {},\n\tplugins: {},\n\tindex: {},\n\n\t_synth: {},\n\n\t/**\n\t * Adds a module to ForerunnerDB.\n\t * @memberof Shared\n\t * @param {String} name The name of the module.\n\t * @param {Function} module The module class.\n\t */\n\taddModule: function (name, module) {\n\t\t// Store the module in the module registry\n\t\tthis.modules[name] = module;\n\n\t\t// Tell the universe we are loading this module\n\t\tthis.emit('moduleLoad', [name, module]);\n\t},\n\n\t/**\n\t * Called by the module once all processing has been completed. Used to determine\n\t * if the module is ready for use by other modules.\n\t * @memberof Shared\n\t * @param {String} name The name of the module.\n\t */\n\tfinishModule: function (name) {\n\t\tif (this.modules[name]) {\n\t\t\t// Set the finished loading flag to true\n\t\t\tthis.modules[name]._fdbFinished = true;\n\n\t\t\t// Assign the module name to itself so it knows what it\n\t\t\t// is called\n\t\t\tif (this.modules[name].prototype) {\n\t\t\t\tthis.modules[name].prototype.className = name;\n\t\t\t} else {\n\t\t\t\tthis.modules[name].className = name;\n\t\t\t}\n\n\t\t\tthis.emit('moduleFinished', [name, this.modules[name]]);\n\t\t} else {\n\t\t\tthrow('ForerunnerDB.Shared: finishModule called on a module that has not been registered with addModule(): ' + name);\n\t\t}\n\t},\n\n\t/**\n\t * Will call your callback method when the specified module has loaded. If the module\n\t * is already loaded the callback is called immediately.\n\t * @memberof Shared\n\t * @param {String} name The name of the module.\n\t * @param {Function} callback The callback method to call when the module is loaded.\n\t */\n\tmoduleFinished: function (name, callback) {\n\t\tif (this.modules[name] && this.modules[name]._fdbFinished) {\n\t\t\tif (callback) { callback(name, this.modules[name]); }\n\t\t} else {\n\t\t\tthis.on('moduleFinished', callback);\n\t\t}\n\t},\n\n\t/**\n\t * Determines if a module has been added to ForerunnerDB or not.\n\t * @memberof Shared\n\t * @param {String} name The name of the module.\n\t * @returns {Boolean} True if the module exists or false if not.\n\t */\n\tmoduleExists: function (name) {\n\t\treturn Boolean(this.modules[name]);\n\t},\n\n\tmixin: new Overload({\n\t\t/**\n\t\t * Adds the properties and methods defined in the mixin to the passed\n\t\t * object.\n\t\t * @memberof Shared\n\t\t * @name mixin\n\t\t * @param {Object} obj The target object to add mixin key/values to.\n\t\t * @param {String} mixinName The name of the mixin to add to the object.\n\t\t */\n\t\t'object, string': function (obj, mixinName) {\n\t\t\tvar mixinObj;\n\n\t\t\tif (typeof mixinName === 'string') {\n\t\t\t\tmixinObj = this.mixins[mixinName];\n\n\t\t\t\tif (!mixinObj) {\n\t\t\t\t\tthrow('ForerunnerDB.Shared: Cannot find mixin named: ' + mixinName);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn this.$main.call(this, obj, mixinObj);\n\t\t},\n\n\t\t/**\n\t\t * Adds the properties and methods defined in the mixin to the passed\n\t\t * object.\n\t\t * @memberof Shared\n\t\t * @name mixin\n\t\t * @param {Object} obj The target object to add mixin key/values to.\n\t\t * @param {Object} mixinObj The object containing the keys to mix into\n\t\t * the target object.\n\t\t */\n\t\t'object, *': function (obj, mixinObj) {\n\t\t\treturn this.$main.call(this, obj, mixinObj);\n\t\t},\n\n\t\t'$main': function (obj, mixinObj) {\n\t\t\tif (mixinObj && typeof mixinObj === 'object') {\n\t\t\t\tfor (var i in mixinObj) {\n\t\t\t\t\tif (mixinObj.hasOwnProperty(i)) {\n\t\t\t\t\t\tobj[i] = mixinObj[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn obj;\n\t\t}\n\t}),\n\n\t/**\n\t * Generates a generic getter/setter method for the passed method name.\n\t * @memberof Shared\n\t * @param {Object} obj The object to add the getter/setter to.\n\t * @param {String} name The name of the getter/setter to generate.\n\t * @param {Function=} extend A method to call before executing the getter/setter.\n\t * The existing getter/setter can be accessed from the extend method via the\n\t * $super e.g. this.$super();\n\t */\n\tsynthesize: function (obj, name, extend) {\n\t\tthis._synth[name] = this._synth[name] || function (val) {\n\t\t\tif (val !== undefined) {\n\t\t\t\tthis['_' + name] = val;\n\t\t\t\treturn this;\n\t\t\t}\n\n\t\t\treturn this['_' + name];\n\t\t};\n\n\t\tif (extend) {\n\t\t\tvar self = this;\n\n\t\t\tobj[name] = function () {\n\t\t\t\tvar tmp = this.$super,\n\t\t\t\t\tret;\n\n\t\t\t\tthis.$super = self._synth[name];\n\t\t\t\tret = extend.apply(this, arguments);\n\t\t\t\tthis.$super = tmp;\n\n\t\t\t\treturn ret;\n\t\t\t};\n\t\t} else {\n\t\t\tobj[name] = this._synth[name];\n\t\t}\n\t},\n\n\t/**\n\t * Allows a method to be overloaded.\n\t * @memberof Shared\n\t * @param arr\n\t * @returns {Function}\n\t * @constructor\n\t */\n\toverload: Overload,\n\n\t/**\n\t * Define the mixins that other modules can use as required.\n\t * @memberof Shared\n\t */\n\tmixins: {\n\t\t'Mixin.Common': _dereq_('./Mixin.Common'),\n\t\t'Mixin.Events': _dereq_('./Mixin.Events'),\n\t\t'Mixin.ChainReactor': _dereq_('./Mixin.ChainReactor'),\n\t\t'Mixin.CRUD': _dereq_('./Mixin.CRUD'),\n\t\t'Mixin.Constants': _dereq_('./Mixin.Constants'),\n\t\t'Mixin.Triggers': _dereq_('./Mixin.Triggers'),\n\t\t'Mixin.Sorting': _dereq_('./Mixin.Sorting'),\n\t\t'Mixin.Matching': _dereq_('./Mixin.Matching'),\n\t\t'Mixin.Updating': _dereq_('./Mixin.Updating'),\n\t\t'Mixin.Tags': _dereq_('./Mixin.Tags')\n\t}\n};\n\n// Add event handling to shared\nShared.mixin(Shared, 'Mixin.Events');\n\nmodule.exports = Shared;\n},{\"./Mixin.CRUD\":15,\"./Mixin.ChainReactor\":16,\"./Mixin.Common\":17,\"./Mixin.Constants\":18,\"./Mixin.Events\":19,\"./Mixin.Matching\":20,\"./Mixin.Sorting\":21,\"./Mixin.Tags\":22,\"./Mixin.Triggers\":23,\"./Mixin.Updating\":24,\"./Overload\":26}],34:[function(_dereq_,module,exports){\n/* jshint strict:false */\nif (!Array.prototype.filter) {\n\tArray.prototype.filter = function(fun/*, thisArg*/) {\n\n\t\tif (this === void 0 || this === null) {\n\t\t\tthrow new TypeError();\n\t\t}\n\n\t\tvar t = Object(this);\n\t\tvar len = t.length >>> 0; // jshint ignore:line\n\t\tif (typeof fun !== 'function') {\n\t\t\tthrow new TypeError();\n\t\t}\n\n\t\tvar res = [];\n\t\tvar thisArg = arguments.length >= 2 ? arguments[1] : void 0;\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tif (i in t) {\n\t\t\t\tvar val = t[i];\n\n\t\t\t\t// NOTE: Technically this should Object.defineProperty at\n\t\t\t\t// the next index, as push can be affected by\n\t\t\t\t// properties on Object.prototype and Array.prototype.\n\t\t\t\t// But that method's new, and collisions should be\n\t\t\t\t// rare, so use the more-compatible alternative.\n\t\t\t\tif (fun.call(thisArg, val, i, t)) {\n\t\t\t\t\tres.push(val);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn res;\n\t};\n}\n\nif (typeof Object.create !== 'function') {\n\tObject.create = (function() {\n\t\tvar Temp = function() {};\n\t\treturn function (prototype) {\n\t\t\tif (arguments.length > 1) {\n\t\t\t\tthrow Error('Second argument not supported');\n\t\t\t}\n\t\t\tif (typeof prototype !== 'object') {\n\t\t\t\tthrow TypeError('Argument must be an object');\n\t\t\t}\n\t\t\tTemp.prototype = prototype;\n\t\t\tvar result = new Temp();\n\t\t\tTemp.prototype = null;\n\t\t\treturn result;\n\t\t};\n\t})();\n}\n\n// Production steps of ECMA-262, Edition 5, 15.4.4.14\n// Reference: http://es5.github.io/#x15.4.4.14e\nif (!Array.prototype.indexOf) {\n\tArray.prototype.indexOf = function(searchElement, fromIndex) {\n\t\tvar k;\n\n\t\t// 1. Let O be the result of calling ToObject passing\n\t\t// the this value as the argument.\n\t\tif (this === null) {\n\t\t\tthrow new TypeError('\"this\" is null or not defined');\n\t\t}\n\n\t\tvar O = Object(this);\n\n\t\t// 2. Let lenValue be the result of calling the Get\n\t\t// internal method of O with the argument \"length\".\n\t\t// 3. Let len be ToUint32(lenValue).\n\t\tvar len = O.length >>> 0; // jshint ignore:line\n\n\t\t// 4. If len is 0, return -1.\n\t\tif (len === 0) {\n\t\t\treturn -1;\n\t\t}\n\n\t\t// 5. If argument fromIndex was passed let n be\n\t\t// ToInteger(fromIndex); else let n be 0.\n\t\tvar n = +fromIndex || 0;\n\n\t\tif (Math.abs(n) === Infinity) {\n\t\t\tn = 0;\n\t\t}\n\n\t\t// 6. If n >= len, return -1.\n\t\tif (n >= len) {\n\t\t\treturn -1;\n\t\t}\n\n\t\t// 7. If n >= 0, then Let k be n.\n\t\t// 8. Else, n<0, Let k be len - abs(n).\n\t\t// If k is less than 0, then let k be 0.\n\t\tk = Math.max(n >= 0 ? n : len - Math.abs(n), 0);\n\n\t\t// 9. Repeat, while k < len\n\t\twhile (k < len) {\n\t\t\t// a. Let Pk be ToString(k).\n\t\t\t// This is implicit for LHS operands of the in operator\n\t\t\t// b. Let kPresent be the result of calling the\n\t\t\t// HasProperty internal method of O with argument Pk.\n\t\t\t// This step can be combined with c\n\t\t\t// c. If kPresent is true, then\n\t\t\t// i. Let elementK be the result of calling the Get\n\t\t\t// internal method of O with the argument ToString(k).\n\t\t\t// ii. Let same be the result of applying the\n\t\t\t// Strict Equality Comparison Algorithm to\n\t\t\t// searchElement and elementK.\n\t\t\t// iii. If same is true, return k.\n\t\t\tif (k in O && O[k] === searchElement) {\n\t\t\t\treturn k;\n\t\t\t}\n\t\t\tk++;\n\t\t}\n\t\treturn -1;\n\t};\n}\n\nmodule.exports = {};\n},{}],35:[function(_dereq_,module,exports){\n(function (process,global){\n/*!\n * async\n * https://github.com/caolan/async\n *\n * Copyright 2010-2014 Caolan McMahon\n * Released under the MIT license\n */\n(function () {\n\n var async = {};\n function noop() {}\n function identity(v) {\n return v;\n }\n function toBool(v) {\n return !!v;\n }\n function notId(v) {\n return !v;\n }\n\n // global on the server, window in the browser\n var previous_async;\n\n // Establish the root object, `window` (`self`) in the browser, `global`\n // on the server, or `this` in some virtual machines. We use `self`\n // instead of `window` for `WebWorker` support.\n var root = typeof self === 'object' && self.self === self && self ||\n typeof global === 'object' && global.global === global && global ||\n this;\n\n if (root != null) {\n previous_async = root.async;\n }\n\n async.noConflict = function () {\n root.async = previous_async;\n return async;\n };\n\n function only_once(fn) {\n return function() {\n if (fn === null) throw new Error(\"Callback was already called.\");\n fn.apply(this, arguments);\n fn = null;\n };\n }\n\n function _once(fn) {\n return function() {\n if (fn === null) return;\n fn.apply(this, arguments);\n fn = null;\n };\n }\n\n //// cross-browser compatiblity functions ////\n\n var _toString = Object.prototype.toString;\n\n var _isArray = Array.isArray || function (obj) {\n return _toString.call(obj) === '[object Array]';\n };\n\n // Ported from underscore.js isObject\n var _isObject = function(obj) {\n var type = typeof obj;\n return type === 'function' || type === 'object' && !!obj;\n };\n\n function _isArrayLike(arr) {\n return _isArray(arr) || (\n // has a positive integer length property\n typeof arr.length === \"number\" &&\n arr.length >= 0 &&\n arr.length % 1 === 0\n );\n }\n\n function _arrayEach(arr, iterator) {\n var index = -1,\n length = arr.length;\n\n while (++index < length) {\n iterator(arr[index], index, arr);\n }\n }\n\n function _map(arr, iterator) {\n var index = -1,\n length = arr.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iterator(arr[index], index, arr);\n }\n return result;\n }\n\n function _range(count) {\n return _map(Array(count), function (v, i) { return i; });\n }\n\n function _reduce(arr, iterator, memo) {\n _arrayEach(arr, function (x, i, a) {\n memo = iterator(memo, x, i, a);\n });\n return memo;\n }\n\n function _forEachOf(object, iterator) {\n _arrayEach(_keys(object), function (key) {\n iterator(object[key], key);\n });\n }\n\n function _indexOf(arr, item) {\n for (var i = 0; i < arr.length; i++) {\n if (arr[i] === item) return i;\n }\n return -1;\n }\n\n var _keys = Object.keys || function (obj) {\n var keys = [];\n for (var k in obj) {\n if (obj.hasOwnProperty(k)) {\n keys.push(k);\n }\n }\n return keys;\n };\n\n function _keyIterator(coll) {\n var i = -1;\n var len;\n var keys;\n if (_isArrayLike(coll)) {\n len = coll.length;\n return function next() {\n i++;\n return i < len ? i : null;\n };\n } else {\n keys = _keys(coll);\n len = keys.length;\n return function next() {\n i++;\n return i < len ? keys[i] : null;\n };\n }\n }\n\n // Similar to ES6's rest param (http://ariya.ofilabs.com/2013/03/es6-and-rest-parameter.html)\n // This accumulates the arguments passed into an array, after a given index.\n // From underscore.js (https://github.com/jashkenas/underscore/pull/2140).\n function _restParam(func, startIndex) {\n startIndex = startIndex == null ? func.length - 1 : +startIndex;\n return function() {\n var length = Math.max(arguments.length - startIndex, 0);\n var rest = Array(length);\n for (var index = 0; index < length; index++) {\n rest[index] = arguments[index + startIndex];\n }\n switch (startIndex) {\n case 0: return func.call(this, rest);\n case 1: return func.call(this, arguments[0], rest);\n }\n // Currently unused but handle cases outside of the switch statement:\n // var args = Array(startIndex + 1);\n // for (index = 0; index < startIndex; index++) {\n // args[index] = arguments[index];\n // }\n // args[startIndex] = rest;\n // return func.apply(this, args);\n };\n }\n\n function _withoutIndex(iterator) {\n return function (value, index, callback) {\n return iterator(value, callback);\n };\n }\n\n //// exported async module functions ////\n\n //// nextTick implementation with browser-compatible fallback ////\n\n // capture the global reference to guard against fakeTimer mocks\n var _setImmediate = typeof setImmediate === 'function' && setImmediate;\n\n var _delay = _setImmediate ? function(fn) {\n // not a direct alias for IE10 compatibility\n _setImmediate(fn);\n } : function(fn) {\n setTimeout(fn, 0);\n };\n\n if (typeof process === 'object' && typeof process.nextTick === 'function') {\n async.nextTick = process.nextTick;\n } else {\n async.nextTick = _delay;\n }\n async.setImmediate = _setImmediate ? _delay : async.nextTick;\n\n\n async.forEach =\n async.each = function (arr, iterator, callback) {\n return async.eachOf(arr, _withoutIndex(iterator), callback);\n };\n\n async.forEachSeries =\n async.eachSeries = function (arr, iterator, callback) {\n return async.eachOfSeries(arr, _withoutIndex(iterator), callback);\n };\n\n\n async.forEachLimit =\n async.eachLimit = function (arr, limit, iterator, callback) {\n return _eachOfLimit(limit)(arr, _withoutIndex(iterator), callback);\n };\n\n async.forEachOf =\n async.eachOf = function (object, iterator, callback) {\n callback = _once(callback || noop);\n object = object || [];\n\n var iter = _keyIterator(object);\n var key, completed = 0;\n\n while ((key = iter()) != null) {\n completed += 1;\n iterator(object[key], key, only_once(done));\n }\n\n if (completed === 0) callback(null);\n\n function done(err) {\n completed--;\n if (err) {\n callback(err);\n }\n // Check key is null in case iterator isn't exhausted\n // and done resolved synchronously.\n else if (key === null && completed <= 0) {\n callback(null);\n }\n }\n };\n\n async.forEachOfSeries =\n async.eachOfSeries = function (obj, iterator, callback) {\n callback = _once(callback || noop);\n obj = obj || [];\n var nextKey = _keyIterator(obj);\n var key = nextKey();\n function iterate() {\n var sync = true;\n if (key === null) {\n return callback(null);\n }\n iterator(obj[key], key, only_once(function (err) {\n if (err) {\n callback(err);\n }\n else {\n key = nextKey();\n if (key === null) {\n return callback(null);\n } else {\n if (sync) {\n async.setImmediate(iterate);\n } else {\n iterate();\n }\n }\n }\n }));\n sync = false;\n }\n iterate();\n };\n\n\n\n async.forEachOfLimit =\n async.eachOfLimit = function (obj, limit, iterator, callback) {\n _eachOfLimit(limit)(obj, iterator, callback);\n };\n\n function _eachOfLimit(limit) {\n\n return function (obj, iterator, callback) {\n callback = _once(callback || noop);\n obj = obj || [];\n var nextKey = _keyIterator(obj);\n if (limit <= 0) {\n return callback(null);\n }\n var done = false;\n var running = 0;\n var errored = false;\n\n (function replenish () {\n if (done && running <= 0) {\n return callback(null);\n }\n\n while (running < limit && !errored) {\n var key = nextKey();\n if (key === null) {\n done = true;\n if (running <= 0) {\n callback(null);\n }\n return;\n }\n running += 1;\n iterator(obj[key], key, only_once(function (err) {\n running -= 1;\n if (err) {\n callback(err);\n errored = true;\n }\n else {\n replenish();\n }\n }));\n }\n })();\n };\n }\n\n\n function doParallel(fn) {\n return function (obj, iterator, callback) {\n return fn(async.eachOf, obj, iterator, callback);\n };\n }\n function doParallelLimit(fn) {\n return function (obj, limit, iterator, callback) {\n return fn(_eachOfLimit(limit), obj, iterator, callback);\n };\n }\n function doSeries(fn) {\n return function (obj, iterator, callback) {\n return fn(async.eachOfSeries, obj, iterator, callback);\n };\n }\n\n function _asyncMap(eachfn, arr, iterator, callback) {\n callback = _once(callback || noop);\n arr = arr || [];\n var results = _isArrayLike(arr) ? [] : {};\n eachfn(arr, function (value, index, callback) {\n iterator(value, function (err, v) {\n results[index] = v;\n callback(err);\n });\n }, function (err) {\n callback(err, results);\n });\n }\n\n async.map = doParallel(_asyncMap);\n async.mapSeries = doSeries(_asyncMap);\n async.mapLimit = doParallelLimit(_asyncMap);\n\n // reduce only has a series version, as doing reduce in parallel won't\n // work in many situations.\n async.inject =\n async.foldl =\n async.reduce = function (arr, memo, iterator, callback) {\n async.eachOfSeries(arr, function (x, i, callback) {\n iterator(memo, x, function (err, v) {\n memo = v;\n callback(err);\n });\n }, function (err) {\n callback(err, memo);\n });\n };\n\n async.foldr =\n async.reduceRight = function (arr, memo, iterator, callback) {\n var reversed = _map(arr, identity).reverse();\n async.reduce(reversed, memo, iterator, callback);\n };\n\n async.transform = function (arr, memo, iterator, callback) {\n if (arguments.length === 3) {\n callback = iterator;\n iterator = memo;\n memo = _isArray(arr) ? [] : {};\n }\n\n async.eachOf(arr, function(v, k, cb) {\n iterator(memo, v, k, cb);\n }, function(err) {\n callback(err, memo);\n });\n };\n\n function _filter(eachfn, arr, iterator, callback) {\n var results = [];\n eachfn(arr, function (x, index, callback) {\n iterator(x, function (v) {\n if (v) {\n results.push({index: index, value: x});\n }\n callback();\n });\n }, function () {\n callback(_map(results.sort(function (a, b) {\n return a.index - b.index;\n }), function (x) {\n return x.value;\n }));\n });\n }\n\n async.select =\n async.filter = doParallel(_filter);\n\n async.selectLimit =\n async.filterLimit = doParallelLimit(_filter);\n\n async.selectSeries =\n async.filterSeries = doSeries(_filter);\n\n function _reject(eachfn, arr, iterator, callback) {\n _filter(eachfn, arr, function(value, cb) {\n iterator(value, function(v) {\n cb(!v);\n });\n }, callback);\n }\n async.reject = doParallel(_reject);\n async.rejectLimit = doParallelLimit(_reject);\n async.rejectSeries = doSeries(_reject);\n\n function _createTester(eachfn, check, getResult) {\n return function(arr, limit, iterator, cb) {\n function done() {\n if (cb) cb(getResult(false, void 0));\n }\n function iteratee(x, _, callback) {\n if (!cb) return callback();\n iterator(x, function (v) {\n if (cb && check(v)) {\n cb(getResult(true, x));\n cb = iterator = false;\n }\n callback();\n });\n }\n if (arguments.length > 3) {\n eachfn(arr, limit, iteratee, done);\n } else {\n cb = iterator;\n iterator = limit;\n eachfn(arr, iteratee, done);\n }\n };\n }\n\n async.any =\n async.some = _createTester(async.eachOf, toBool, identity);\n\n async.someLimit = _createTester(async.eachOfLimit, toBool, identity);\n\n async.all =\n async.every = _createTester(async.eachOf, notId, notId);\n\n async.everyLimit = _createTester(async.eachOfLimit, notId, notId);\n\n function _findGetResult(v, x) {\n return x;\n }\n async.detect = _createTester(async.eachOf, identity, _findGetResult);\n async.detectSeries = _createTester(async.eachOfSeries, identity, _findGetResult);\n async.detectLimit = _createTester(async.eachOfLimit, identity, _findGetResult);\n\n async.sortBy = function (arr, iterator, callback) {\n async.map(arr, function (x, callback) {\n iterator(x, function (err, criteria) {\n if (err) {\n callback(err);\n }\n else {\n callback(null, {value: x, criteria: criteria});\n }\n });\n }, function (err, results) {\n if (err) {\n return callback(err);\n }\n else {\n callback(null, _map(results.sort(comparator), function (x) {\n return x.value;\n }));\n }\n\n });\n\n function comparator(left, right) {\n var a = left.criteria, b = right.criteria;\n return a < b ? -1 : a > b ? 1 : 0;\n }\n };\n\n async.auto = function (tasks, concurrency, callback) {\n if (!callback) {\n // concurrency is optional, shift the args.\n callback = concurrency;\n concurrency = null;\n }\n callback = _once(callback || noop);\n var keys = _keys(tasks);\n var remainingTasks = keys.length;\n if (!remainingTasks) {\n return callback(null);\n }\n if (!concurrency) {\n concurrency = remainingTasks;\n }\n\n var results = {};\n var runningTasks = 0;\n\n var listeners = [];\n function addListener(fn) {\n listeners.unshift(fn);\n }\n function removeListener(fn) {\n var idx = _indexOf(listeners, fn);\n if (idx >= 0) listeners.splice(idx, 1);\n }\n function taskComplete() {\n remainingTasks--;\n _arrayEach(listeners.slice(0), function (fn) {\n fn();\n });\n }\n\n addListener(function () {\n if (!remainingTasks) {\n callback(null, results);\n }\n });\n\n _arrayEach(keys, function (k) {\n var task = _isArray(tasks[k]) ? tasks[k]: [tasks[k]];\n var taskCallback = _restParam(function(err, args) {\n runningTasks--;\n if (args.length <= 1) {\n args = args[0];\n }\n if (err) {\n var safeResults = {};\n _forEachOf(results, function(val, rkey) {\n safeResults[rkey] = val;\n });\n safeResults[k] = args;\n callback(err, safeResults);\n }\n else {\n results[k] = args;\n async.setImmediate(taskComplete);\n }\n });\n var requires = task.slice(0, task.length - 1);\n // prevent dead-locks\n var len = requires.length;\n var dep;\n while (len--) {\n if (!(dep = tasks[requires[len]])) {\n throw new Error('Has inexistant dependency');\n }\n if (_isArray(dep) && _indexOf(dep, k) >= 0) {\n throw new Error('Has cyclic dependencies');\n }\n }\n function ready() {\n return runningTasks < concurrency && _reduce(requires, function (a, x) {\n return (a && results.hasOwnProperty(x));\n }, true) && !results.hasOwnProperty(k);\n }\n if (ready()) {\n runningTasks++;\n task[task.length - 1](taskCallback, results);\n }\n else {\n addListener(listener);\n }\n function listener() {\n if (ready()) {\n runningTasks++;\n removeListener(listener);\n task[task.length - 1](taskCallback, results);\n }\n }\n });\n };\n\n\n\n async.retry = function(times, task, callback) {\n var DEFAULT_TIMES = 5;\n var DEFAULT_INTERVAL = 0;\n\n var attempts = [];\n\n var opts = {\n times: DEFAULT_TIMES,\n interval: DEFAULT_INTERVAL\n };\n\n function parseTimes(acc, t){\n if(typeof t === 'number'){\n acc.times = parseInt(t, 10) || DEFAULT_TIMES;\n } else if(typeof t === 'object'){\n acc.times = parseInt(t.times, 10) || DEFAULT_TIMES;\n acc.interval = parseInt(t.interval, 10) || DEFAULT_INTERVAL;\n } else {\n throw new Error('Unsupported argument type for \\'times\\': ' + typeof t);\n }\n }\n\n var length = arguments.length;\n if (length < 1 || length > 3) {\n throw new Error('Invalid arguments - must be either (task), (task, callback), (times, task) or (times, task, callback)');\n } else if (length <= 2 && typeof times === 'function') {\n callback = task;\n task = times;\n }\n if (typeof times !== 'function') {\n parseTimes(opts, times);\n }\n opts.callback = callback;\n opts.task = task;\n\n function wrappedTask(wrappedCallback, wrappedResults) {\n function retryAttempt(task, finalAttempt) {\n return function(seriesCallback) {\n task(function(err, result){\n seriesCallback(!err || finalAttempt, {err: err, result: result});\n }, wrappedResults);\n };\n }\n\n function retryInterval(interval){\n return function(seriesCallback){\n setTimeout(function(){\n seriesCallback(null);\n }, interval);\n };\n }\n\n while (opts.times) {\n\n var finalAttempt = !(opts.times-=1);\n attempts.push(retryAttempt(opts.task, finalAttempt));\n if(!finalAttempt && opts.interval > 0){\n attempts.push(retryInterval(opts.interval));\n }\n }\n\n async.series(attempts, function(done, data){\n data = data[data.length - 1];\n (wrappedCallback || opts.callback)(data.err, data.result);\n });\n }\n\n // If a callback is passed, run this as a controll flow\n return opts.callback ? wrappedTask() : wrappedTask;\n };\n\n async.waterfall = function (tasks, callback) {\n callback = _once(callback || noop);\n if (!_isArray(tasks)) {\n var err = new Error('First argument to waterfall must be an array of functions');\n return callback(err);\n }\n if (!tasks.length) {\n return callback();\n }\n function wrapIterator(iterator) {\n return _restParam(function (err, args) {\n if (err) {\n callback.apply(null, [err].concat(args));\n }\n else {\n var next = iterator.next();\n if (next) {\n args.push(wrapIterator(next));\n }\n else {\n args.push(callback);\n }\n ensureAsync(iterator).apply(null, args);\n }\n });\n }\n wrapIterator(async.iterator(tasks))();\n };\n\n function _parallel(eachfn, tasks, callback) {\n callback = callback || noop;\n var results = _isArrayLike(tasks) ? [] : {};\n\n eachfn(tasks, function (task, key, callback) {\n task(_restParam(function (err, args) {\n if (args.length <= 1) {\n args = args[0];\n }\n results[key] = args;\n callback(err);\n }));\n }, function (err) {\n callback(err, results);\n });\n }\n\n async.parallel = function (tasks, callback) {\n _parallel(async.eachOf, tasks, callback);\n };\n\n async.parallelLimit = function(tasks, limit, callback) {\n _parallel(_eachOfLimit(limit), tasks, callback);\n };\n\n async.series = function(tasks, callback) {\n _parallel(async.eachOfSeries, tasks, callback);\n };\n\n async.iterator = function (tasks) {\n function makeCallback(index) {\n function fn() {\n if (tasks.length) {\n tasks[index].apply(null, arguments);\n }\n return fn.next();\n }\n fn.next = function () {\n return (index < tasks.length - 1) ? makeCallback(index + 1): null;\n };\n return fn;\n }\n return makeCallback(0);\n };\n\n async.apply = _restParam(function (fn, args) {\n return _restParam(function (callArgs) {\n return fn.apply(\n null, args.concat(callArgs)\n );\n });\n });\n\n function _concat(eachfn, arr, fn, callback) {\n var result = [];\n eachfn(arr, function (x, index, cb) {\n fn(x, function (err, y) {\n result = result.concat(y || []);\n cb(err);\n });\n }, function (err) {\n callback(err, result);\n });\n }\n async.concat = doParallel(_concat);\n async.concatSeries = doSeries(_concat);\n\n async.whilst = function (test, iterator, callback) {\n callback = callback || noop;\n if (test()) {\n var next = _restParam(function(err, args) {\n if (err) {\n callback(err);\n } else if (test.apply(this, args)) {\n iterator(next);\n } else {\n callback(null);\n }\n });\n iterator(next);\n } else {\n callback(null);\n }\n };\n\n async.doWhilst = function (iterator, test, callback) {\n var calls = 0;\n return async.whilst(function() {\n return ++calls <= 1 || test.apply(this, arguments);\n }, iterator, callback);\n };\n\n async.until = function (test, iterator, callback) {\n return async.whilst(function() {\n return !test.apply(this, arguments);\n }, iterator, callback);\n };\n\n async.doUntil = function (iterator, test, callback) {\n return async.doWhilst(iterator, function() {\n return !test.apply(this, arguments);\n }, callback);\n };\n\n async.during = function (test, iterator, callback) {\n callback = callback || noop;\n\n var next = _restParam(function(err, args) {\n if (err) {\n callback(err);\n } else {\n args.push(check);\n test.apply(this, args);\n }\n });\n\n var check = function(err, truth) {\n if (err) {\n callback(err);\n } else if (truth) {\n iterator(next);\n } else {\n callback(null);\n }\n };\n\n test(check);\n };\n\n async.doDuring = function (iterator, test, callback) {\n var calls = 0;\n async.during(function(next) {\n if (calls++ < 1) {\n next(null, true);\n } else {\n test.apply(this, arguments);\n }\n }, iterator, callback);\n };\n\n function _queue(worker, concurrency, payload) {\n if (concurrency == null) {\n concurrency = 1;\n }\n else if(concurrency === 0) {\n throw new Error('Concurrency must not be zero');\n }\n function _insert(q, data, pos, callback) {\n if (callback != null && typeof callback !== \"function\") {\n throw new Error(\"task callback must be a function\");\n }\n q.started = true;\n if (!_isArray(data)) {\n data = [data];\n }\n if(data.length === 0 && q.idle()) {\n // call drain immediately if there are no tasks\n return async.setImmediate(function() {\n q.drain();\n });\n }\n _arrayEach(data, function(task) {\n var item = {\n data: task,\n callback: callback || noop\n };\n\n if (pos) {\n q.tasks.unshift(item);\n } else {\n q.tasks.push(item);\n }\n\n if (q.tasks.length === q.concurrency) {\n q.saturated();\n }\n });\n async.setImmediate(q.process);\n }\n function _next(q, tasks) {\n return function(){\n workers -= 1;\n\n var removed = false;\n var args = arguments;\n _arrayEach(tasks, function (task) {\n _arrayEach(workersList, function (worker, index) {\n if (worker === task && !removed) {\n workersList.splice(index, 1);\n removed = true;\n }\n });\n\n task.callback.apply(task, args);\n });\n if (q.tasks.length + workers === 0) {\n q.drain();\n }\n q.process();\n };\n }\n\n var workers = 0;\n var workersList = [];\n var q = {\n tasks: [],\n concurrency: concurrency,\n payload: payload,\n saturated: noop,\n empty: noop,\n drain: noop,\n started: false,\n paused: false,\n push: function (data, callback) {\n _insert(q, data, false, callback);\n },\n kill: function () {\n q.drain = noop;\n q.tasks = [];\n },\n unshift: function (data, callback) {\n _insert(q, data, true, callback);\n },\n process: function () {\n if (!q.paused && workers < q.concurrency && q.tasks.length) {\n while(workers < q.concurrency && q.tasks.length){\n var tasks = q.payload ?\n q.tasks.splice(0, q.payload) :\n q.tasks.splice(0, q.tasks.length);\n\n var data = _map(tasks, function (task) {\n return task.data;\n });\n\n if (q.tasks.length === 0) {\n q.empty();\n }\n workers += 1;\n workersList.push(tasks[0]);\n var cb = only_once(_next(q, tasks));\n worker(data, cb);\n }\n }\n },\n length: function () {\n return q.tasks.length;\n },\n running: function () {\n return workers;\n },\n workersList: function () {\n return workersList;\n },\n idle: function() {\n return q.tasks.length + workers === 0;\n },\n pause: function () {\n q.paused = true;\n },\n resume: function () {\n if (q.paused === false) { return; }\n q.paused = false;\n var resumeCount = Math.min(q.concurrency, q.tasks.length);\n // Need to call q.process once per concurrent\n // worker to preserve full concurrency after pause\n for (var w = 1; w <= resumeCount; w++) {\n async.setImmediate(q.process);\n }\n }\n };\n return q;\n }\n\n async.queue = function (worker, concurrency) {\n var q = _queue(function (items, cb) {\n worker(items[0], cb);\n }, concurrency, 1);\n\n return q;\n };\n\n async.priorityQueue = function (worker, concurrency) {\n\n function _compareTasks(a, b){\n return a.priority - b.priority;\n }\n\n function _binarySearch(sequence, item, compare) {\n var beg = -1,\n end = sequence.length - 1;\n while (beg < end) {\n var mid = beg + ((end - beg + 1) >>> 1);\n if (compare(item, sequence[mid]) >= 0) {\n beg = mid;\n } else {\n end = mid - 1;\n }\n }\n return beg;\n }\n\n function _insert(q, data, priority, callback) {\n if (callback != null && typeof callback !== \"function\") {\n throw new Error(\"task callback must be a function\");\n }\n q.started = true;\n if (!_isArray(data)) {\n data = [data];\n }\n if(data.length === 0) {\n // call drain immediately if there are no tasks\n return async.setImmediate(function() {\n q.drain();\n });\n }\n _arrayEach(data, function(task) {\n var item = {\n data: task,\n priority: priority,\n callback: typeof callback === 'function' ? callback : noop\n };\n\n q.tasks.splice(_binarySearch(q.tasks, item, _compareTasks) + 1, 0, item);\n\n if (q.tasks.length === q.concurrency) {\n q.saturated();\n }\n async.setImmediate(q.process);\n });\n }\n\n // Start with a normal queue\n var q = async.queue(worker, concurrency);\n\n // Override push to accept second parameter representing priority\n q.push = function (data, priority, callback) {\n _insert(q, data, priority, callback);\n };\n\n // Remove unshift function\n delete q.unshift;\n\n return q;\n };\n\n async.cargo = function (worker, payload) {\n return _queue(worker, 1, payload);\n };\n\n function _console_fn(name) {\n return _restParam(function (fn, args) {\n fn.apply(null, args.concat([_restParam(function (err, args) {\n if (typeof console === 'object') {\n if (err) {\n if (console.error) {\n console.error(err);\n }\n }\n else if (console[name]) {\n _arrayEach(args, function (x) {\n console[name](x);\n });\n }\n }\n })]));\n });\n }\n async.log = _console_fn('log');\n async.dir = _console_fn('dir');\n /*async.info = _console_fn('info');\n async.warn = _console_fn('warn');\n async.error = _console_fn('error');*/\n\n async.memoize = function (fn, hasher) {\n var memo = {};\n var queues = {};\n hasher = hasher || identity;\n var memoized = _restParam(function memoized(args) {\n var callback = args.pop();\n var key = hasher.apply(null, args);\n if (key in memo) {\n async.setImmediate(function () {\n callback.apply(null, memo[key]);\n });\n }\n else if (key in queues) {\n queues[key].push(callback);\n }\n else {\n queues[key] = [callback];\n fn.apply(null, args.concat([_restParam(function (args) {\n memo[key] = args;\n var q = queues[key];\n delete queues[key];\n for (var i = 0, l = q.length; i < l; i++) {\n q[i].apply(null, args);\n }\n })]));\n }\n });\n memoized.memo = memo;\n memoized.unmemoized = fn;\n return memoized;\n };\n\n async.unmemoize = function (fn) {\n return function () {\n return (fn.unmemoized || fn).apply(null, arguments);\n };\n };\n\n function _times(mapper) {\n return function (count, iterator, callback) {\n mapper(_range(count), iterator, callback);\n };\n }\n\n async.times = _times(async.map);\n async.timesSeries = _times(async.mapSeries);\n async.timesLimit = function (count, limit, iterator, callback) {\n return async.mapLimit(_range(count), limit, iterator, callback);\n };\n\n async.seq = function (/* functions... */) {\n var fns = arguments;\n return _restParam(function (args) {\n var that = this;\n\n var callback = args[args.length - 1];\n if (typeof callback == 'function') {\n args.pop();\n } else {\n callback = noop;\n }\n\n async.reduce(fns, args, function (newargs, fn, cb) {\n fn.apply(that, newargs.concat([_restParam(function (err, nextargs) {\n cb(err, nextargs);\n })]));\n },\n function (err, results) {\n callback.apply(that, [err].concat(results));\n });\n });\n };\n\n async.compose = function (/* functions... */) {\n return async.seq.apply(null, Array.prototype.reverse.call(arguments));\n };\n\n\n function _applyEach(eachfn) {\n return _restParam(function(fns, args) {\n var go = _restParam(function(args) {\n var that = this;\n var callback = args.pop();\n return eachfn(fns, function (fn, _, cb) {\n fn.apply(that, args.concat([cb]));\n },\n callback);\n });\n if (args.length) {\n return go.apply(this, args);\n }\n else {\n return go;\n }\n });\n }\n\n async.applyEach = _applyEach(async.eachOf);\n async.applyEachSeries = _applyEach(async.eachOfSeries);\n\n\n async.forever = function (fn, callback) {\n var done = only_once(callback || noop);\n var task = ensureAsync(fn);\n function next(err) {\n if (err) {\n return done(err);\n }\n task(next);\n }\n next();\n };\n\n function ensureAsync(fn) {\n return _restParam(function (args) {\n var callback = args.pop();\n args.push(function () {\n var innerArgs = arguments;\n if (sync) {\n async.setImmediate(function () {\n callback.apply(null, innerArgs);\n });\n } else {\n callback.apply(null, innerArgs);\n }\n });\n var sync = true;\n fn.apply(this, args);\n sync = false;\n });\n }\n\n async.ensureAsync = ensureAsync;\n\n async.constant = _restParam(function(values) {\n var args = [null].concat(values);\n return function (callback) {\n return callback.apply(this, args);\n };\n });\n\n async.wrapSync =\n async.asyncify = function asyncify(func) {\n return _restParam(function (args) {\n var callback = args.pop();\n var result;\n try {\n result = func.apply(this, args);\n } catch (e) {\n return callback(e);\n }\n // if result is Promise object\n if (_isObject(result) && typeof result.then === \"function\") {\n result.then(function(value) {\n callback(null, value);\n })[\"catch\"](function(err) {\n callback(err.message ? err : new Error(err));\n });\n } else {\n callback(null, result);\n }\n });\n };\n\n // Node.js\n if (typeof module === 'object' && module.exports) {\n module.exports = async;\n }\n // AMD / RequireJS\n else if (typeof define === 'function' && define.amd) {\n define([], function () {\n return async;\n });\n }\n // included directly via <script> tag\n else {\n root.async = async;\n }\n\n}());\n\n}).call(this,_dereq_('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"_process\":70}],36:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var BlockCipher = C_lib.BlockCipher;\n\t var C_algo = C.algo;\n\n\t // Lookup tables\n\t var SBOX = [];\n\t var INV_SBOX = [];\n\t var SUB_MIX_0 = [];\n\t var SUB_MIX_1 = [];\n\t var SUB_MIX_2 = [];\n\t var SUB_MIX_3 = [];\n\t var INV_SUB_MIX_0 = [];\n\t var INV_SUB_MIX_1 = [];\n\t var INV_SUB_MIX_2 = [];\n\t var INV_SUB_MIX_3 = [];\n\n\t // Compute lookup tables\n\t (function () {\n\t // Compute double table\n\t var d = [];\n\t for (var i = 0; i < 256; i++) {\n\t if (i < 128) {\n\t d[i] = i << 1;\n\t } else {\n\t d[i] = (i << 1) ^ 0x11b;\n\t }\n\t }\n\n\t // Walk GF(2^8)\n\t var x = 0;\n\t var xi = 0;\n\t for (var i = 0; i < 256; i++) {\n\t // Compute sbox\n\t var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n\t sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;\n\t SBOX[x] = sx;\n\t INV_SBOX[sx] = x;\n\n\t // Compute multiplication\n\t var x2 = d[x];\n\t var x4 = d[x2];\n\t var x8 = d[x4];\n\n\t // Compute sub bytes, mix columns tables\n\t var t = (d[sx] * 0x101) ^ (sx * 0x1010100);\n\t SUB_MIX_0[x] = (t << 24) | (t >>> 8);\n\t SUB_MIX_1[x] = (t << 16) | (t >>> 16);\n\t SUB_MIX_2[x] = (t << 8) | (t >>> 24);\n\t SUB_MIX_3[x] = t;\n\n\t // Compute inv sub bytes, inv mix columns tables\n\t var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);\n\t INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);\n\t INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);\n\t INV_SUB_MIX_2[sx] = (t << 8) | (t >>> 24);\n\t INV_SUB_MIX_3[sx] = t;\n\n\t // Compute next counter\n\t if (!x) {\n\t x = xi = 1;\n\t } else {\n\t x = x2 ^ d[d[d[x8 ^ x2]]];\n\t xi ^= d[d[xi]];\n\t }\n\t }\n\t }());\n\n\t // Precomputed Rcon lookup\n\t var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];\n\n\t /**\n\t * AES block cipher algorithm.\n\t */\n\t var AES = C_algo.AES = BlockCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var key = this._key;\n\t var keyWords = key.words;\n\t var keySize = key.sigBytes / 4;\n\n\t // Compute number of rounds\n\t var nRounds = this._nRounds = keySize + 6\n\n\t // Compute number of key schedule rows\n\t var ksRows = (nRounds + 1) * 4;\n\n\t // Compute key schedule\n\t var keySchedule = this._keySchedule = [];\n\t for (var ksRow = 0; ksRow < ksRows; ksRow++) {\n\t if (ksRow < keySize) {\n\t keySchedule[ksRow] = keyWords[ksRow];\n\t } else {\n\t var t = keySchedule[ksRow - 1];\n\n\t if (!(ksRow % keySize)) {\n\t // Rot word\n\t t = (t << 8) | (t >>> 24);\n\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\n\t // Mix Rcon\n\t t ^= RCON[(ksRow / keySize) | 0] << 24;\n\t } else if (keySize > 6 && ksRow % keySize == 4) {\n\t // Sub word\n\t t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];\n\t }\n\n\t keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;\n\t }\n\t }\n\n\t // Compute inv key schedule\n\t var invKeySchedule = this._invKeySchedule = [];\n\t for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {\n\t var ksRow = ksRows - invKsRow;\n\n\t if (invKsRow % 4) {\n\t var t = keySchedule[ksRow];\n\t } else {\n\t var t = keySchedule[ksRow - 4];\n\t }\n\n\t if (invKsRow < 4 || ksRow <= 4) {\n\t invKeySchedule[invKsRow] = t;\n\t } else {\n\t invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^\n\t INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];\n\t }\n\t }\n\t },\n\n\t encryptBlock: function (M, offset) {\n\t this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);\n\t },\n\n\t decryptBlock: function (M, offset) {\n\t // Swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\n\t this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);\n\n\t // Inv swap 2nd and 4th rows\n\t var t = M[offset + 1];\n\t M[offset + 1] = M[offset + 3];\n\t M[offset + 3] = t;\n\t },\n\n\t _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {\n\t // Shortcut\n\t var nRounds = this._nRounds;\n\n\t // Get input, add round key\n\t var s0 = M[offset] ^ keySchedule[0];\n\t var s1 = M[offset + 1] ^ keySchedule[1];\n\t var s2 = M[offset + 2] ^ keySchedule[2];\n\t var s3 = M[offset + 3] ^ keySchedule[3];\n\n\t // Key schedule row counter\n\t var ksRow = 4;\n\n\t // Rounds\n\t for (var round = 1; round < nRounds; round++) {\n\t // Shift rows, sub bytes, mix columns, add round key\n\t var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];\n\t var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];\n\t var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];\n\t var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];\n\n\t // Update state\n\t s0 = t0;\n\t s1 = t1;\n\t s2 = t2;\n\t s3 = t3;\n\t }\n\n\t // Shift rows, sub bytes, add round key\n\t var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];\n\t var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];\n\t var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];\n\t var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];\n\n\t // Set output\n\t M[offset] = t0;\n\t M[offset + 1] = t1;\n\t M[offset + 2] = t2;\n\t M[offset + 3] = t3;\n\t },\n\n\t keySize: 256/32\n\t });\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.AES.decrypt(ciphertext, key, cfg);\n\t */\n\t C.AES = BlockCipher._createHelper(AES);\n\t}());\n\n\n\treturn CryptoJS.AES;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./evpkdf\":41,\"./md5\":46}],37:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Cipher core components.\n\t */\n\tCryptoJS.lib.Cipher || (function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var Base64 = C_enc.Base64;\n\t var C_algo = C.algo;\n\t var EvpKDF = C_algo.EvpKDF;\n\n\t /**\n\t * Abstract base cipher template.\n\t *\n\t * @property {number} keySize This cipher's key size. Default: 4 (128 bits)\n\t * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits)\n\t * @property {number} _ENC_XFORM_MODE A constant representing encryption mode.\n\t * @property {number} _DEC_XFORM_MODE A constant representing decryption mode.\n\t */\n\t var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {WordArray} iv The IV to use for this operation.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Creates this cipher in encryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createEncryptor: function (key, cfg) {\n\t return this.create(this._ENC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Creates this cipher in decryption mode.\n\t *\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {Cipher} A cipher instance.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });\n\t */\n\t createDecryptor: function (key, cfg) {\n\t return this.create(this._DEC_XFORM_MODE, key, cfg);\n\t },\n\n\t /**\n\t * Initializes a newly created cipher.\n\t *\n\t * @param {number} xformMode Either the encryption or decryption transormation mode constant.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @example\n\t *\n\t * var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });\n\t */\n\t init: function (xformMode, key, cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Store transform mode and key\n\t this._xformMode = xformMode;\n\t this._key = key;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this cipher to its initial state.\n\t *\n\t * @example\n\t *\n\t * cipher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-cipher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Adds data to be encrypted or decrypted.\n\t *\n\t * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.process('data');\n\t * var encrypted = cipher.process(wordArray);\n\t */\n\t process: function (dataUpdate) {\n\t // Append\n\t this._append(dataUpdate);\n\n\t // Process available blocks\n\t return this._process();\n\t },\n\n\t /**\n\t * Finalizes the encryption or decryption process.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.\n\t *\n\t * @return {WordArray} The data after final processing.\n\t *\n\t * @example\n\t *\n\t * var encrypted = cipher.finalize();\n\t * var encrypted = cipher.finalize('data');\n\t * var encrypted = cipher.finalize(wordArray);\n\t */\n\t finalize: function (dataUpdate) {\n\t // Final data update\n\t if (dataUpdate) {\n\t this._append(dataUpdate);\n\t }\n\n\t // Perform concrete-cipher logic\n\t var finalProcessedData = this._doFinalize();\n\n\t return finalProcessedData;\n\t },\n\n\t keySize: 128/32,\n\n\t ivSize: 128/32,\n\n\t _ENC_XFORM_MODE: 1,\n\n\t _DEC_XFORM_MODE: 2,\n\n\t /**\n\t * Creates shortcut functions to a cipher's object interface.\n\t *\n\t * @param {Cipher} cipher The cipher to create a helper for.\n\t *\n\t * @return {Object} An object with encrypt and decrypt shortcut functions.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);\n\t */\n\t _createHelper: (function () {\n\t function selectCipherStrategy(key) {\n\t if (typeof key == 'string') {\n\t return PasswordBasedCipher;\n\t } else {\n\t return SerializableCipher;\n\t }\n\t }\n\n\t return function (cipher) {\n\t return {\n\t encrypt: function (message, key, cfg) {\n\t return selectCipherStrategy(key).encrypt(cipher, message, key, cfg);\n\t },\n\n\t decrypt: function (ciphertext, key, cfg) {\n\t return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg);\n\t }\n\t };\n\t };\n\t }())\n\t });\n\n\t /**\n\t * Abstract base stream cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits)\n\t */\n\t var StreamCipher = C_lib.StreamCipher = Cipher.extend({\n\t _doFinalize: function () {\n\t // Process partial blocks\n\t var finalProcessedBlocks = this._process(!!'flush');\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 1\n\t });\n\n\t /**\n\t * Mode namespace.\n\t */\n\t var C_mode = C.mode = {};\n\n\t /**\n\t * Abstract base block cipher mode template.\n\t */\n\t var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({\n\t /**\n\t * Creates this mode for encryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);\n\t */\n\t createEncryptor: function (cipher, iv) {\n\t return this.Encryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Creates this mode for decryption.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);\n\t */\n\t createDecryptor: function (cipher, iv) {\n\t return this.Decryptor.create(cipher, iv);\n\t },\n\n\t /**\n\t * Initializes a newly created mode.\n\t *\n\t * @param {Cipher} cipher A block cipher instance.\n\t * @param {Array} iv The IV words.\n\t *\n\t * @example\n\t *\n\t * var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);\n\t */\n\t init: function (cipher, iv) {\n\t this._cipher = cipher;\n\t this._iv = iv;\n\t }\n\t });\n\n\t /**\n\t * Cipher Block Chaining mode.\n\t */\n\t var CBC = C_mode.CBC = (function () {\n\t /**\n\t * Abstract base CBC mode.\n\t */\n\t var CBC = BlockCipherMode.extend();\n\n\t /**\n\t * CBC encryptor.\n\t */\n\t CBC.Encryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // XOR and encrypt\n\t xorBlock.call(this, words, offset, blockSize);\n\t cipher.encryptBlock(words, offset);\n\n\t // Remember this block to use with next block\n\t this._prevBlock = words.slice(offset, offset + blockSize);\n\t }\n\t });\n\n\t /**\n\t * CBC decryptor.\n\t */\n\t CBC.Decryptor = CBC.extend({\n\t /**\n\t * Processes the data block at offset.\n\t *\n\t * @param {Array} words The data words to operate on.\n\t * @param {number} offset The offset where the block starts.\n\t *\n\t * @example\n\t *\n\t * mode.processBlock(data.words, offset);\n\t */\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // Remember this block to use with next block\n\t var thisBlock = words.slice(offset, offset + blockSize);\n\n\t // Decrypt and XOR\n\t cipher.decryptBlock(words, offset);\n\t xorBlock.call(this, words, offset, blockSize);\n\n\t // This block becomes the previous block\n\t this._prevBlock = thisBlock;\n\t }\n\t });\n\n\t function xorBlock(words, offset, blockSize) {\n\t // Shortcut\n\t var iv = this._iv;\n\n\t // Choose mixing block\n\t if (iv) {\n\t var block = iv;\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t } else {\n\t var block = this._prevBlock;\n\t }\n\n\t // XOR blocks\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= block[i];\n\t }\n\t }\n\n\t return CBC;\n\t }());\n\n\t /**\n\t * Padding namespace.\n\t */\n\t var C_pad = C.pad = {};\n\n\t /**\n\t * PKCS #5/7 padding strategy.\n\t */\n\t var Pkcs7 = C_pad.Pkcs7 = {\n\t /**\n\t * Pads data using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to pad.\n\t * @param {number} blockSize The multiple that the data should be padded to.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.pad(wordArray, 4);\n\t */\n\t pad: function (data, blockSize) {\n\t // Shortcut\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count padding bytes\n\t var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;\n\n\t // Create padding word\n\t var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes;\n\n\t // Create padding\n\t var paddingWords = [];\n\t for (var i = 0; i < nPaddingBytes; i += 4) {\n\t paddingWords.push(paddingWord);\n\t }\n\t var padding = WordArray.create(paddingWords, nPaddingBytes);\n\n\t // Add padding\n\t data.concat(padding);\n\t },\n\n\t /**\n\t * Unpads data that had been padded using the algorithm defined in PKCS #5/7.\n\t *\n\t * @param {WordArray} data The data to unpad.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * CryptoJS.pad.Pkcs7.unpad(wordArray);\n\t */\n\t unpad: function (data) {\n\t // Get number of padding bytes from last byte\n\t var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;\n\n\t // Remove padding\n\t data.sigBytes -= nPaddingBytes;\n\t }\n\t };\n\n\t /**\n\t * Abstract base block cipher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits)\n\t */\n\t var BlockCipher = C_lib.BlockCipher = Cipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Mode} mode The block mode to use. Default: CBC\n\t * @property {Padding} padding The padding strategy to use. Default: Pkcs7\n\t */\n\t cfg: Cipher.cfg.extend({\n\t mode: CBC,\n\t padding: Pkcs7\n\t }),\n\n\t reset: function () {\n\t // Reset cipher\n\t Cipher.reset.call(this);\n\n\t // Shortcuts\n\t var cfg = this.cfg;\n\t var iv = cfg.iv;\n\t var mode = cfg.mode;\n\n\t // Reset block mode\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t var modeCreator = mode.createEncryptor;\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t var modeCreator = mode.createDecryptor;\n\n\t // Keep at least one block in the buffer for unpadding\n\t this._minBufferSize = 1;\n\t }\n\t this._mode = modeCreator.call(mode, this, iv && iv.words);\n\t },\n\n\t _doProcessBlock: function (words, offset) {\n\t this._mode.processBlock(words, offset);\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcut\n\t var padding = this.cfg.padding;\n\n\t // Finalize\n\t if (this._xformMode == this._ENC_XFORM_MODE) {\n\t // Pad data\n\t padding.pad(this._data, this.blockSize);\n\n\t // Process final blocks\n\t var finalProcessedBlocks = this._process(!!'flush');\n\t } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {\n\t // Process final blocks\n\t var finalProcessedBlocks = this._process(!!'flush');\n\n\t // Unpad data\n\t padding.unpad(finalProcessedBlocks);\n\t }\n\n\t return finalProcessedBlocks;\n\t },\n\n\t blockSize: 128/32\n\t });\n\n\t /**\n\t * A collection of cipher parameters.\n\t *\n\t * @property {WordArray} ciphertext The raw ciphertext.\n\t * @property {WordArray} key The key to this ciphertext.\n\t * @property {WordArray} iv The IV used in the ciphering operation.\n\t * @property {WordArray} salt The salt used with a key derivation function.\n\t * @property {Cipher} algorithm The cipher algorithm.\n\t * @property {Mode} mode The block mode used in the ciphering operation.\n\t * @property {Padding} padding The padding scheme used in the ciphering operation.\n\t * @property {number} blockSize The block size of the cipher.\n\t * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string.\n\t */\n\t var CipherParams = C_lib.CipherParams = Base.extend({\n\t /**\n\t * Initializes a newly created cipher params object.\n\t *\n\t * @param {Object} cipherParams An object with any of the possible cipher parameters.\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.lib.CipherParams.create({\n\t * ciphertext: ciphertextWordArray,\n\t * key: keyWordArray,\n\t * iv: ivWordArray,\n\t * salt: saltWordArray,\n\t * algorithm: CryptoJS.algo.AES,\n\t * mode: CryptoJS.mode.CBC,\n\t * padding: CryptoJS.pad.PKCS7,\n\t * blockSize: 4,\n\t * formatter: CryptoJS.format.OpenSSL\n\t * });\n\t */\n\t init: function (cipherParams) {\n\t this.mixIn(cipherParams);\n\t },\n\n\t /**\n\t * Converts this cipher params object to a string.\n\t *\n\t * @param {Format} formatter (Optional) The formatting strategy to use.\n\t *\n\t * @return {string} The stringified cipher params.\n\t *\n\t * @throws Error If neither the formatter nor the default formatter is set.\n\t *\n\t * @example\n\t *\n\t * var string = cipherParams + '';\n\t * var string = cipherParams.toString();\n\t * var string = cipherParams.toString(CryptoJS.format.OpenSSL);\n\t */\n\t toString: function (formatter) {\n\t return (formatter || this.formatter).stringify(this);\n\t }\n\t });\n\n\t /**\n\t * Format namespace.\n\t */\n\t var C_format = C.format = {};\n\n\t /**\n\t * OpenSSL formatting strategy.\n\t */\n\t var OpenSSLFormatter = C_format.OpenSSL = {\n\t /**\n\t * Converts a cipher params object to an OpenSSL-compatible string.\n\t *\n\t * @param {CipherParams} cipherParams The cipher params object.\n\t *\n\t * @return {string} The OpenSSL-compatible string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);\n\t */\n\t stringify: function (cipherParams) {\n\t // Shortcuts\n\t var ciphertext = cipherParams.ciphertext;\n\t var salt = cipherParams.salt;\n\n\t // Format\n\t if (salt) {\n\t var wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext);\n\t } else {\n\t var wordArray = ciphertext;\n\t }\n\n\t return wordArray.toString(Base64);\n\t },\n\n\t /**\n\t * Converts an OpenSSL-compatible string to a cipher params object.\n\t *\n\t * @param {string} openSSLStr The OpenSSL-compatible string.\n\t *\n\t * @return {CipherParams} The cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);\n\t */\n\t parse: function (openSSLStr) {\n\t // Parse base64\n\t var ciphertext = Base64.parse(openSSLStr);\n\n\t // Shortcut\n\t var ciphertextWords = ciphertext.words;\n\n\t // Test for salt\n\t if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) {\n\t // Extract salt\n\t var salt = WordArray.create(ciphertextWords.slice(2, 4));\n\n\t // Remove salt from ciphertext\n\t ciphertextWords.splice(0, 4);\n\t ciphertext.sigBytes -= 16;\n\t }\n\n\t return CipherParams.create({ ciphertext: ciphertext, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A cipher wrapper that returns ciphertext as a serializable cipher params object.\n\t */\n\t var SerializableCipher = C_lib.SerializableCipher = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL\n\t */\n\t cfg: Base.extend({\n\t format: OpenSSLFormatter\n\t }),\n\n\t /**\n\t * Encrypts a message.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Encrypt\n\t var encryptor = cipher.createEncryptor(key, cfg);\n\t var ciphertext = encryptor.finalize(message);\n\n\t // Shortcut\n\t var cipherCfg = encryptor.cfg;\n\n\t // Create and return serializable cipher params\n\t return CipherParams.create({\n\t ciphertext: ciphertext,\n\t key: key,\n\t iv: cipherCfg.iv,\n\t algorithm: cipher,\n\t mode: cipherCfg.mode,\n\t padding: cipherCfg.padding,\n\t blockSize: cipher.blockSize,\n\t formatter: cfg.format\n\t });\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {WordArray} key The key.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, key, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Decrypt\n\t var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext);\n\n\t return plaintext;\n\t },\n\n\t /**\n\t * Converts serialized ciphertext to CipherParams,\n\t * else assumed CipherParams already and returns ciphertext unchanged.\n\t *\n\t * @param {CipherParams|string} ciphertext The ciphertext.\n\t * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.\n\t *\n\t * @return {CipherParams} The unserialized ciphertext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);\n\t */\n\t _parse: function (ciphertext, format) {\n\t if (typeof ciphertext == 'string') {\n\t return format.parse(ciphertext, this);\n\t } else {\n\t return ciphertext;\n\t }\n\t }\n\t });\n\n\t /**\n\t * Key derivation function namespace.\n\t */\n\t var C_kdf = C.kdf = {};\n\n\t /**\n\t * OpenSSL key derivation function.\n\t */\n\t var OpenSSLKdf = C_kdf.OpenSSL = {\n\t /**\n\t * Derives a key and IV from a password.\n\t *\n\t * @param {string} password The password to derive from.\n\t * @param {number} keySize The size in words of the key to generate.\n\t * @param {number} ivSize The size in words of the IV to generate.\n\t * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.\n\t *\n\t * @return {CipherParams} A cipher params object with the key, IV, and salt.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);\n\t * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');\n\t */\n\t execute: function (password, keySize, ivSize, salt) {\n\t // Generate random salt\n\t if (!salt) {\n\t salt = WordArray.random(64/8);\n\t }\n\n\t // Derive key and IV\n\t var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt);\n\n\t // Separate key and IV\n\t var iv = WordArray.create(key.words.slice(keySize), ivSize * 4);\n\t key.sigBytes = keySize * 4;\n\n\t // Return params\n\t return CipherParams.create({ key: key, iv: iv, salt: salt });\n\t }\n\t };\n\n\t /**\n\t * A serializable cipher wrapper that derives the key from a password,\n\t * and returns ciphertext as a serializable cipher params object.\n\t */\n\t var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL\n\t */\n\t cfg: SerializableCipher.cfg.extend({\n\t kdf: OpenSSLKdf\n\t }),\n\n\t /**\n\t * Encrypts a message using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {WordArray|string} message The message to encrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {CipherParams} A cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');\n\t * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t encrypt: function (cipher, message, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Encrypt\n\t var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg);\n\n\t // Mix in derived params\n\t ciphertext.mixIn(derivedParams);\n\n\t return ciphertext;\n\t },\n\n\t /**\n\t * Decrypts serialized ciphertext using a password.\n\t *\n\t * @param {Cipher} cipher The cipher algorithm to use.\n\t * @param {CipherParams|string} ciphertext The ciphertext to decrypt.\n\t * @param {string} password The password.\n\t * @param {Object} cfg (Optional) The configuration options to use for this operation.\n\t *\n\t * @return {WordArray} The plaintext.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });\n\t * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });\n\t */\n\t decrypt: function (cipher, ciphertext, password, cfg) {\n\t // Apply config defaults\n\t cfg = this.cfg.extend(cfg);\n\n\t // Convert string to CipherParams\n\t ciphertext = this._parse(ciphertext, cfg.format);\n\n\t // Derive key and other params\n\t var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt);\n\n\t // Add IV to config\n\t cfg.iv = derivedParams.iv;\n\n\t // Decrypt\n\t var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg);\n\n\t return plaintext;\n\t }\n\t });\n\t}());\n\n\n}));\n},{\"./core\":38}],38:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory();\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\troot.CryptoJS = factory();\n\t}\n}(this, function () {\n\n\t/**\n\t * CryptoJS core components.\n\t */\n\tvar CryptoJS = CryptoJS || (function (Math, undefined) {\n\t /**\n\t * CryptoJS namespace.\n\t */\n\t var C = {};\n\n\t /**\n\t * Library namespace.\n\t */\n\t var C_lib = C.lib = {};\n\n\t /**\n\t * Base object for prototypal inheritance.\n\t */\n\t var Base = C_lib.Base = (function () {\n\t function F() {}\n\n\t return {\n\t /**\n\t * Creates a new object that inherits from this object.\n\t *\n\t * @param {Object} overrides Properties to copy into the new object.\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * field: 'value',\n\t *\n\t * method: function () {\n\t * }\n\t * });\n\t */\n\t extend: function (overrides) {\n\t // Spawn\n\t F.prototype = this;\n\t var subtype = new F();\n\n\t // Augment\n\t if (overrides) {\n\t subtype.mixIn(overrides);\n\t }\n\n\t // Create default initializer\n\t if (!subtype.hasOwnProperty('init')) {\n\t subtype.init = function () {\n\t subtype.$super.init.apply(this, arguments);\n\t };\n\t }\n\n\t // Initializer's prototype is the subtype object\n\t subtype.init.prototype = subtype;\n\n\t // Reference supertype\n\t subtype.$super = this;\n\n\t return subtype;\n\t },\n\n\t /**\n\t * Extends this object and runs the init method.\n\t * Arguments to create() will be passed to init().\n\t *\n\t * @return {Object} The new object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var instance = MyType.create();\n\t */\n\t create: function () {\n\t var instance = this.extend();\n\t instance.init.apply(instance, arguments);\n\n\t return instance;\n\t },\n\n\t /**\n\t * Initializes a newly created object.\n\t * Override this method to add some logic when your objects are created.\n\t *\n\t * @example\n\t *\n\t * var MyType = CryptoJS.lib.Base.extend({\n\t * init: function () {\n\t * // ...\n\t * }\n\t * });\n\t */\n\t init: function () {\n\t },\n\n\t /**\n\t * Copies properties into this object.\n\t *\n\t * @param {Object} properties The properties to mix in.\n\t *\n\t * @example\n\t *\n\t * MyType.mixIn({\n\t * field: 'value'\n\t * });\n\t */\n\t mixIn: function (properties) {\n\t for (var propertyName in properties) {\n\t if (properties.hasOwnProperty(propertyName)) {\n\t this[propertyName] = properties[propertyName];\n\t }\n\t }\n\n\t // IE won't copy toString using the loop above\n\t if (properties.hasOwnProperty('toString')) {\n\t this.toString = properties.toString;\n\t }\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = instance.clone();\n\t */\n\t clone: function () {\n\t return this.init.prototype.extend(this);\n\t }\n\t };\n\t }());\n\n\t /**\n\t * An array of 32-bit words.\n\t *\n\t * @property {Array} words The array of 32-bit words.\n\t * @property {number} sigBytes The number of significant bytes in this word array.\n\t */\n\t var WordArray = C_lib.WordArray = Base.extend({\n\t /**\n\t * Initializes a newly created word array.\n\t *\n\t * @param {Array} words (Optional) An array of 32-bit words.\n\t * @param {number} sigBytes (Optional) The number of significant bytes in the words.\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.create();\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);\n\t * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);\n\t */\n\t init: function (words, sigBytes) {\n\t words = this.words = words || [];\n\n\t if (sigBytes != undefined) {\n\t this.sigBytes = sigBytes;\n\t } else {\n\t this.sigBytes = words.length * 4;\n\t }\n\t },\n\n\t /**\n\t * Converts this word array to a string.\n\t *\n\t * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex\n\t *\n\t * @return {string} The stringified word array.\n\t *\n\t * @example\n\t *\n\t * var string = wordArray + '';\n\t * var string = wordArray.toString();\n\t * var string = wordArray.toString(CryptoJS.enc.Utf8);\n\t */\n\t toString: function (encoder) {\n\t return (encoder || Hex).stringify(this);\n\t },\n\n\t /**\n\t * Concatenates a word array to this word array.\n\t *\n\t * @param {WordArray} wordArray The word array to append.\n\t *\n\t * @return {WordArray} This word array.\n\t *\n\t * @example\n\t *\n\t * wordArray1.concat(wordArray2);\n\t */\n\t concat: function (wordArray) {\n\t // Shortcuts\n\t var thisWords = this.words;\n\t var thatWords = wordArray.words;\n\t var thisSigBytes = this.sigBytes;\n\t var thatSigBytes = wordArray.sigBytes;\n\n\t // Clamp excess bits\n\t this.clamp();\n\n\t // Concat\n\t if (thisSigBytes % 4) {\n\t // Copy one byte at a time\n\t for (var i = 0; i < thatSigBytes; i++) {\n\t var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);\n\t }\n\t } else {\n\t // Copy one word at a time\n\t for (var i = 0; i < thatSigBytes; i += 4) {\n\t thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2];\n\t }\n\t }\n\t this.sigBytes += thatSigBytes;\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Removes insignificant bits.\n\t *\n\t * @example\n\t *\n\t * wordArray.clamp();\n\t */\n\t clamp: function () {\n\t // Shortcuts\n\t var words = this.words;\n\t var sigBytes = this.sigBytes;\n\n\t // Clamp\n\t words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);\n\t words.length = Math.ceil(sigBytes / 4);\n\t },\n\n\t /**\n\t * Creates a copy of this word array.\n\t *\n\t * @return {WordArray} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = wordArray.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone.words = this.words.slice(0);\n\n\t return clone;\n\t },\n\n\t /**\n\t * Creates a word array filled with random bytes.\n\t *\n\t * @param {number} nBytes The number of random bytes to generate.\n\t *\n\t * @return {WordArray} The random word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.lib.WordArray.random(16);\n\t */\n\t random: function (nBytes) {\n\t var words = [];\n\n\t var r = (function (m_w) {\n\t var m_w = m_w;\n\t var m_z = 0x3ade68b1;\n\t var mask = 0xffffffff;\n\n\t return function () {\n\t m_z = (0x9069 * (m_z & 0xFFFF) + (m_z >> 0x10)) & mask;\n\t m_w = (0x4650 * (m_w & 0xFFFF) + (m_w >> 0x10)) & mask;\n\t var result = ((m_z << 0x10) + m_w) & mask;\n\t result /= 0x100000000;\n\t result += 0.5;\n\t return result * (Math.random() > .5 ? 1 : -1);\n\t }\n\t });\n\n\t for (var i = 0, rcache; i < nBytes; i += 4) {\n\t var _r = r((rcache || Math.random()) * 0x100000000);\n\n\t rcache = _r() * 0x3ade67b7;\n\t words.push((_r() * 0x100000000) | 0);\n\t }\n\n\t return new WordArray.init(words, nBytes);\n\t }\n\t });\n\n\t /**\n\t * Encoder namespace.\n\t */\n\t var C_enc = C.enc = {};\n\n\t /**\n\t * Hex encoding strategy.\n\t */\n\t var Hex = C_enc.Hex = {\n\t /**\n\t * Converts a word array to a hex string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The hex string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hexString = CryptoJS.enc.Hex.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var hexChars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t hexChars.push((bite >>> 4).toString(16));\n\t hexChars.push((bite & 0x0f).toString(16));\n\t }\n\n\t return hexChars.join('');\n\t },\n\n\t /**\n\t * Converts a hex string to a word array.\n\t *\n\t * @param {string} hexStr The hex string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Hex.parse(hexString);\n\t */\n\t parse: function (hexStr) {\n\t // Shortcut\n\t var hexStrLength = hexStr.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < hexStrLength; i += 2) {\n\t words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);\n\t }\n\n\t return new WordArray.init(words, hexStrLength / 2);\n\t }\n\t };\n\n\t /**\n\t * Latin1 encoding strategy.\n\t */\n\t var Latin1 = C_enc.Latin1 = {\n\t /**\n\t * Converts a word array to a Latin1 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Latin1 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var latin1Chars = [];\n\t for (var i = 0; i < sigBytes; i++) {\n\t var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t latin1Chars.push(String.fromCharCode(bite));\n\t }\n\n\t return latin1Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Latin1 string to a word array.\n\t *\n\t * @param {string} latin1Str The Latin1 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Latin1.parse(latin1String);\n\t */\n\t parse: function (latin1Str) {\n\t // Shortcut\n\t var latin1StrLength = latin1Str.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < latin1StrLength; i++) {\n\t words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);\n\t }\n\n\t return new WordArray.init(words, latin1StrLength);\n\t }\n\t };\n\n\t /**\n\t * UTF-8 encoding strategy.\n\t */\n\t var Utf8 = C_enc.Utf8 = {\n\t /**\n\t * Converts a word array to a UTF-8 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The UTF-8 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t try {\n\t return decodeURIComponent(escape(Latin1.stringify(wordArray)));\n\t } catch (e) {\n\t throw new Error('Malformed UTF-8 data');\n\t }\n\t },\n\n\t /**\n\t * Converts a UTF-8 string to a word array.\n\t *\n\t * @param {string} utf8Str The UTF-8 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Utf8.parse(utf8String);\n\t */\n\t parse: function (utf8Str) {\n\t return Latin1.parse(unescape(encodeURIComponent(utf8Str)));\n\t }\n\t };\n\n\t /**\n\t * Abstract buffered block algorithm template.\n\t *\n\t * The property blockSize must be implemented in a concrete subtype.\n\t *\n\t * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0\n\t */\n\t var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({\n\t /**\n\t * Resets this block algorithm's data buffer to its initial state.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm.reset();\n\t */\n\t reset: function () {\n\t // Initial values\n\t this._data = new WordArray.init();\n\t this._nDataBytes = 0;\n\t },\n\n\t /**\n\t * Adds new data to this block algorithm's buffer.\n\t *\n\t * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.\n\t *\n\t * @example\n\t *\n\t * bufferedBlockAlgorithm._append('data');\n\t * bufferedBlockAlgorithm._append(wordArray);\n\t */\n\t _append: function (data) {\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof data == 'string') {\n\t data = Utf8.parse(data);\n\t }\n\n\t // Append\n\t this._data.concat(data);\n\t this._nDataBytes += data.sigBytes;\n\t },\n\n\t /**\n\t * Processes available data blocks.\n\t *\n\t * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.\n\t *\n\t * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.\n\t *\n\t * @return {WordArray} The processed data.\n\t *\n\t * @example\n\t *\n\t * var processedData = bufferedBlockAlgorithm._process();\n\t * var processedData = bufferedBlockAlgorithm._process(!!'flush');\n\t */\n\t _process: function (doFlush) {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\t var dataSigBytes = data.sigBytes;\n\t var blockSize = this.blockSize;\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count blocks ready\n\t var nBlocksReady = dataSigBytes / blockSizeBytes;\n\t if (doFlush) {\n\t // Round up to include partial blocks\n\t nBlocksReady = Math.ceil(nBlocksReady);\n\t } else {\n\t // Round down to include only full blocks,\n\t // less the number of blocks that must remain in the buffer\n\t nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);\n\t }\n\n\t // Count words ready\n\t var nWordsReady = nBlocksReady * blockSize;\n\n\t // Count bytes ready\n\t var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);\n\n\t // Process blocks\n\t if (nWordsReady) {\n\t for (var offset = 0; offset < nWordsReady; offset += blockSize) {\n\t // Perform concrete-algorithm logic\n\t this._doProcessBlock(dataWords, offset);\n\t }\n\n\t // Remove processed words\n\t var processedWords = dataWords.splice(0, nWordsReady);\n\t data.sigBytes -= nBytesReady;\n\t }\n\n\t // Return processed words\n\t return new WordArray.init(processedWords, nBytesReady);\n\t },\n\n\t /**\n\t * Creates a copy of this object.\n\t *\n\t * @return {Object} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = bufferedBlockAlgorithm.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\t clone._data = this._data.clone();\n\n\t return clone;\n\t },\n\n\t _minBufferSize: 0\n\t });\n\n\t /**\n\t * Abstract hasher template.\n\t *\n\t * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)\n\t */\n\t var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({\n\t /**\n\t * Configuration options.\n\t */\n\t cfg: Base.extend(),\n\n\t /**\n\t * Initializes a newly created hasher.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for this hash computation.\n\t *\n\t * @example\n\t *\n\t * var hasher = CryptoJS.algo.SHA256.create();\n\t */\n\t init: function (cfg) {\n\t // Apply config defaults\n\t this.cfg = this.cfg.extend(cfg);\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this hasher to its initial state.\n\t *\n\t * @example\n\t *\n\t * hasher.reset();\n\t */\n\t reset: function () {\n\t // Reset data buffer\n\t BufferedBlockAlgorithm.reset.call(this);\n\n\t // Perform concrete-hasher logic\n\t this._doReset();\n\t },\n\n\t /**\n\t * Updates this hasher with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {Hasher} This hasher.\n\t *\n\t * @example\n\t *\n\t * hasher.update('message');\n\t * hasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t // Append\n\t this._append(messageUpdate);\n\n\t // Update the hash\n\t this._process();\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the hash computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @example\n\t *\n\t * var hash = hasher.finalize();\n\t * var hash = hasher.finalize('message');\n\t * var hash = hasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Final message update\n\t if (messageUpdate) {\n\t this._append(messageUpdate);\n\t }\n\n\t // Perform concrete-hasher logic\n\t var hash = this._doFinalize();\n\n\t return hash;\n\t },\n\n\t blockSize: 512/32,\n\n\t /**\n\t * Creates a shortcut function to a hasher's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to create a helper for.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHelper: function (hasher) {\n\t return function (message, cfg) {\n\t return new hasher.init(cfg).finalize(message);\n\t };\n\t },\n\n\t /**\n\t * Creates a shortcut function to the HMAC's object interface.\n\t *\n\t * @param {Hasher} hasher The hasher to use in this HMAC helper.\n\t *\n\t * @return {Function} The shortcut function.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);\n\t */\n\t _createHmacHelper: function (hasher) {\n\t return function (message, key) {\n\t return new C_algo.HMAC.init(hasher, key).finalize(message);\n\t };\n\t }\n\t });\n\n\t /**\n\t * Algorithm namespace.\n\t */\n\t var C_algo = C.algo = {};\n\n\t return C;\n\t}(Math));\n\n\n\treturn CryptoJS;\n\n}));\n},{}],39:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var C_enc = C.enc;\n\n\t /**\n\t * Base64 encoding strategy.\n\t */\n\t var Base64 = C_enc.Base64 = {\n\t /**\n\t * Converts a word array to a Base64 string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The Base64 string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var base64String = CryptoJS.enc.Base64.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\t var map = this._map;\n\n\t // Clamp excess bits\n\t wordArray.clamp();\n\n\t // Convert\n\t var base64Chars = [];\n\t for (var i = 0; i < sigBytes; i += 3) {\n\t var byte1 = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;\n\t var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;\n\t var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;\n\n\t var triplet = (byte1 << 16) | (byte2 << 8) | byte3;\n\n\t for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {\n\t base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));\n\t }\n\t }\n\n\t // Add padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t while (base64Chars.length % 4) {\n\t base64Chars.push(paddingChar);\n\t }\n\t }\n\n\t return base64Chars.join('');\n\t },\n\n\t /**\n\t * Converts a Base64 string to a word array.\n\t *\n\t * @param {string} base64Str The Base64 string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Base64.parse(base64String);\n\t */\n\t parse: function (base64Str) {\n\t // Shortcuts\n\t var base64StrLength = base64Str.length;\n\t var map = this._map;\n\n\t // Ignore padding\n\t var paddingChar = map.charAt(64);\n\t if (paddingChar) {\n\t var paddingIndex = base64Str.indexOf(paddingChar);\n\t if (paddingIndex != -1) {\n\t base64StrLength = paddingIndex;\n\t }\n\t }\n\n\t // Convert\n\t var words = [];\n\t var nBytes = 0;\n\t for (var i = 0; i < base64StrLength; i++) {\n\t if (i % 4) {\n\t var bits1 = map.indexOf(base64Str.charAt(i - 1)) << ((i % 4) * 2);\n\t var bits2 = map.indexOf(base64Str.charAt(i)) >>> (6 - (i % 4) * 2);\n\t words[nBytes >>> 2] |= (bits1 | bits2) << (24 - (nBytes % 4) * 8);\n\t nBytes++;\n\t }\n\t }\n\n\t return WordArray.create(words, nBytes);\n\t },\n\n\t _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='\n\t };\n\t}());\n\n\n\treturn CryptoJS.enc.Base64;\n\n}));\n},{\"./core\":38}],40:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var C_enc = C.enc;\n\n\t /**\n\t * UTF-16 BE encoding strategy.\n\t */\n\t var Utf16BE = C_enc.Utf16 = C_enc.Utf16BE = {\n\t /**\n\t * Converts a word array to a UTF-16 BE string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The UTF-16 BE string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var utf16Chars = [];\n\t for (var i = 0; i < sigBytes; i += 2) {\n\t var codePoint = (words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff;\n\t utf16Chars.push(String.fromCharCode(codePoint));\n\t }\n\n\t return utf16Chars.join('');\n\t },\n\n\t /**\n\t * Converts a UTF-16 BE string to a word array.\n\t *\n\t * @param {string} utf16Str The UTF-16 BE string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Utf16.parse(utf16String);\n\t */\n\t parse: function (utf16Str) {\n\t // Shortcut\n\t var utf16StrLength = utf16Str.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < utf16StrLength; i++) {\n\t words[i >>> 1] |= utf16Str.charCodeAt(i) << (16 - (i % 2) * 16);\n\t }\n\n\t return WordArray.create(words, utf16StrLength * 2);\n\t }\n\t };\n\n\t /**\n\t * UTF-16 LE encoding strategy.\n\t */\n\t C_enc.Utf16LE = {\n\t /**\n\t * Converts a word array to a UTF-16 LE string.\n\t *\n\t * @param {WordArray} wordArray The word array.\n\t *\n\t * @return {string} The UTF-16 LE string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);\n\t */\n\t stringify: function (wordArray) {\n\t // Shortcuts\n\t var words = wordArray.words;\n\t var sigBytes = wordArray.sigBytes;\n\n\t // Convert\n\t var utf16Chars = [];\n\t for (var i = 0; i < sigBytes; i += 2) {\n\t var codePoint = swapEndian((words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff);\n\t utf16Chars.push(String.fromCharCode(codePoint));\n\t }\n\n\t return utf16Chars.join('');\n\t },\n\n\t /**\n\t * Converts a UTF-16 LE string to a word array.\n\t *\n\t * @param {string} utf16Str The UTF-16 LE string.\n\t *\n\t * @return {WordArray} The word array.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);\n\t */\n\t parse: function (utf16Str) {\n\t // Shortcut\n\t var utf16StrLength = utf16Str.length;\n\n\t // Convert\n\t var words = [];\n\t for (var i = 0; i < utf16StrLength; i++) {\n\t words[i >>> 1] |= swapEndian(utf16Str.charCodeAt(i) << (16 - (i % 2) * 16));\n\t }\n\n\t return WordArray.create(words, utf16StrLength * 2);\n\t }\n\t };\n\n\t function swapEndian(word) {\n\t return ((word << 8) & 0xff00ff00) | ((word >>> 8) & 0x00ff00ff);\n\t }\n\t}());\n\n\n\treturn CryptoJS.enc.Utf16;\n\n}));\n},{\"./core\":38}],41:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./sha1\"), _dereq_(\"./hmac\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./sha1\", \"./hmac\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var C_algo = C.algo;\n\t var MD5 = C_algo.MD5;\n\n\t /**\n\t * This key derivation function is meant to conform with EVP_BytesToKey.\n\t * www.openssl.org/docs/crypto/EVP_BytesToKey.html\n\t */\n\t var EvpKDF = C_algo.EvpKDF = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)\n\t * @property {Hasher} hasher The hash algorithm to use. Default: MD5\n\t * @property {number} iterations The number of iterations to perform. Default: 1\n\t */\n\t cfg: Base.extend({\n\t keySize: 128/32,\n\t hasher: MD5,\n\t iterations: 1\n\t }),\n\n\t /**\n\t * Initializes a newly created key derivation function.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for the derivation.\n\t *\n\t * @example\n\t *\n\t * var kdf = CryptoJS.algo.EvpKDF.create();\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });\n\t * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });\n\t */\n\t init: function (cfg) {\n\t this.cfg = this.cfg.extend(cfg);\n\t },\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @example\n\t *\n\t * var key = kdf.compute(password, salt);\n\t */\n\t compute: function (password, salt) {\n\t // Shortcut\n\t var cfg = this.cfg;\n\n\t // Init hasher\n\t var hasher = cfg.hasher.create();\n\n\t // Initial values\n\t var derivedKey = WordArray.create();\n\n\t // Shortcuts\n\t var derivedKeyWords = derivedKey.words;\n\t var keySize = cfg.keySize;\n\t var iterations = cfg.iterations;\n\n\t // Generate key\n\t while (derivedKeyWords.length < keySize) {\n\t if (block) {\n\t hasher.update(block);\n\t }\n\t var block = hasher.update(password).finalize(salt);\n\t hasher.reset();\n\n\t // Iterations\n\t for (var i = 1; i < iterations; i++) {\n\t block = hasher.finalize(block);\n\t hasher.reset();\n\t }\n\n\t derivedKey.concat(block);\n\t }\n\t derivedKey.sigBytes = keySize * 4;\n\n\t return derivedKey;\n\t }\n\t });\n\n\t /**\n\t * Derives a key from a password.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t * @param {Object} cfg (Optional) The configuration options to use for this computation.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var key = CryptoJS.EvpKDF(password, salt);\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 });\n\t * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 });\n\t */\n\t C.EvpKDF = function (password, salt, cfg) {\n\t return EvpKDF.create(cfg).compute(password, salt);\n\t };\n\t}());\n\n\n\treturn CryptoJS.EvpKDF;\n\n}));\n},{\"./core\":38,\"./hmac\":43,\"./sha1\":62}],42:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var CipherParams = C_lib.CipherParams;\n\t var C_enc = C.enc;\n\t var Hex = C_enc.Hex;\n\t var C_format = C.format;\n\n\t var HexFormatter = C_format.Hex = {\n\t /**\n\t * Converts the ciphertext of a cipher params object to a hexadecimally encoded string.\n\t *\n\t * @param {CipherParams} cipherParams The cipher params object.\n\t *\n\t * @return {string} The hexadecimally encoded string.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hexString = CryptoJS.format.Hex.stringify(cipherParams);\n\t */\n\t stringify: function (cipherParams) {\n\t return cipherParams.ciphertext.toString(Hex);\n\t },\n\n\t /**\n\t * Converts a hexadecimally encoded ciphertext string to a cipher params object.\n\t *\n\t * @param {string} input The hexadecimally encoded string.\n\t *\n\t * @return {CipherParams} The cipher params object.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var cipherParams = CryptoJS.format.Hex.parse(hexString);\n\t */\n\t parse: function (input) {\n\t var ciphertext = Hex.parse(input);\n\t return CipherParams.create({ ciphertext: ciphertext });\n\t }\n\t };\n\t}());\n\n\n\treturn CryptoJS.format.Hex;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],43:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var C_enc = C.enc;\n\t var Utf8 = C_enc.Utf8;\n\t var C_algo = C.algo;\n\n\t /**\n\t * HMAC algorithm.\n\t */\n\t var HMAC = C_algo.HMAC = Base.extend({\n\t /**\n\t * Initializes a newly created HMAC.\n\t *\n\t * @param {Hasher} hasher The hash algorithm to use.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @example\n\t *\n\t * var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);\n\t */\n\t init: function (hasher, key) {\n\t // Init hasher\n\t hasher = this._hasher = new hasher.init();\n\n\t // Convert string to WordArray, else assume WordArray already\n\t if (typeof key == 'string') {\n\t key = Utf8.parse(key);\n\t }\n\n\t // Shortcuts\n\t var hasherBlockSize = hasher.blockSize;\n\t var hasherBlockSizeBytes = hasherBlockSize * 4;\n\n\t // Allow arbitrary length keys\n\t if (key.sigBytes > hasherBlockSizeBytes) {\n\t key = hasher.finalize(key);\n\t }\n\n\t // Clamp excess bits\n\t key.clamp();\n\n\t // Clone key for inner and outer pads\n\t var oKey = this._oKey = key.clone();\n\t var iKey = this._iKey = key.clone();\n\n\t // Shortcuts\n\t var oKeyWords = oKey.words;\n\t var iKeyWords = iKey.words;\n\n\t // XOR keys with pad constants\n\t for (var i = 0; i < hasherBlockSize; i++) {\n\t oKeyWords[i] ^= 0x5c5c5c5c;\n\t iKeyWords[i] ^= 0x36363636;\n\t }\n\t oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes;\n\n\t // Set initial values\n\t this.reset();\n\t },\n\n\t /**\n\t * Resets this HMAC to its initial state.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.reset();\n\t */\n\t reset: function () {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Reset\n\t hasher.reset();\n\t hasher.update(this._iKey);\n\t },\n\n\t /**\n\t * Updates this HMAC with a message.\n\t *\n\t * @param {WordArray|string} messageUpdate The message to append.\n\t *\n\t * @return {HMAC} This HMAC instance.\n\t *\n\t * @example\n\t *\n\t * hmacHasher.update('message');\n\t * hmacHasher.update(wordArray);\n\t */\n\t update: function (messageUpdate) {\n\t this._hasher.update(messageUpdate);\n\n\t // Chainable\n\t return this;\n\t },\n\n\t /**\n\t * Finalizes the HMAC computation.\n\t * Note that the finalize operation is effectively a destructive, read-once operation.\n\t *\n\t * @param {WordArray|string} messageUpdate (Optional) A final message update.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @example\n\t *\n\t * var hmac = hmacHasher.finalize();\n\t * var hmac = hmacHasher.finalize('message');\n\t * var hmac = hmacHasher.finalize(wordArray);\n\t */\n\t finalize: function (messageUpdate) {\n\t // Shortcut\n\t var hasher = this._hasher;\n\n\t // Compute HMAC\n\t var innerHash = hasher.finalize(messageUpdate);\n\t hasher.reset();\n\t var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));\n\n\t return hmac;\n\t }\n\t });\n\t}());\n\n\n}));\n},{\"./core\":38}],44:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./x64-core\"), _dereq_(\"./lib-typedarrays\"), _dereq_(\"./enc-utf16\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./sha1\"), _dereq_(\"./sha256\"), _dereq_(\"./sha224\"), _dereq_(\"./sha512\"), _dereq_(\"./sha384\"), _dereq_(\"./sha3\"), _dereq_(\"./ripemd160\"), _dereq_(\"./hmac\"), _dereq_(\"./pbkdf2\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"), _dereq_(\"./mode-cfb\"), _dereq_(\"./mode-ctr\"), _dereq_(\"./mode-ctr-gladman\"), _dereq_(\"./mode-ofb\"), _dereq_(\"./mode-ecb\"), _dereq_(\"./pad-ansix923\"), _dereq_(\"./pad-iso10126\"), _dereq_(\"./pad-iso97971\"), _dereq_(\"./pad-zeropadding\"), _dereq_(\"./pad-nopadding\"), _dereq_(\"./format-hex\"), _dereq_(\"./aes\"), _dereq_(\"./tripledes\"), _dereq_(\"./rc4\"), _dereq_(\"./rabbit\"), _dereq_(\"./rabbit-legacy\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./x64-core\", \"./lib-typedarrays\", \"./enc-utf16\", \"./enc-base64\", \"./md5\", \"./sha1\", \"./sha256\", \"./sha224\", \"./sha512\", \"./sha384\", \"./sha3\", \"./ripemd160\", \"./hmac\", \"./pbkdf2\", \"./evpkdf\", \"./cipher-core\", \"./mode-cfb\", \"./mode-ctr\", \"./mode-ctr-gladman\", \"./mode-ofb\", \"./mode-ecb\", \"./pad-ansix923\", \"./pad-iso10126\", \"./pad-iso97971\", \"./pad-zeropadding\", \"./pad-nopadding\", \"./format-hex\", \"./aes\", \"./tripledes\", \"./rc4\", \"./rabbit\", \"./rabbit-legacy\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\troot.CryptoJS = factory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\treturn CryptoJS;\n\n}));\n},{\"./aes\":36,\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./enc-utf16\":40,\"./evpkdf\":41,\"./format-hex\":42,\"./hmac\":43,\"./lib-typedarrays\":45,\"./md5\":46,\"./mode-cfb\":47,\"./mode-ctr\":49,\"./mode-ctr-gladman\":48,\"./mode-ecb\":50,\"./mode-ofb\":51,\"./pad-ansix923\":52,\"./pad-iso10126\":53,\"./pad-iso97971\":54,\"./pad-nopadding\":55,\"./pad-zeropadding\":56,\"./pbkdf2\":57,\"./rabbit\":59,\"./rabbit-legacy\":58,\"./rc4\":60,\"./ripemd160\":61,\"./sha1\":62,\"./sha224\":63,\"./sha256\":64,\"./sha3\":65,\"./sha384\":66,\"./sha512\":67,\"./tripledes\":68,\"./x64-core\":69}],45:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Check if typed arrays are supported\n\t if (typeof ArrayBuffer != 'function') {\n\t return;\n\t }\n\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\n\t // Reference original init\n\t var superInit = WordArray.init;\n\n\t // Augment WordArray.init to handle typed arrays\n\t var subInit = WordArray.init = function (typedArray) {\n\t // Convert buffers to uint8\n\t if (typedArray instanceof ArrayBuffer) {\n\t typedArray = new Uint8Array(typedArray);\n\t }\n\n\t // Convert other array views to uint8\n\t if (\n\t typedArray instanceof Int8Array ||\n\t (typeof Uint8ClampedArray !== \"undefined\" && typedArray instanceof Uint8ClampedArray) ||\n\t typedArray instanceof Int16Array ||\n\t typedArray instanceof Uint16Array ||\n\t typedArray instanceof Int32Array ||\n\t typedArray instanceof Uint32Array ||\n\t typedArray instanceof Float32Array ||\n\t typedArray instanceof Float64Array\n\t ) {\n\t typedArray = new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength);\n\t }\n\n\t // Handle Uint8Array\n\t if (typedArray instanceof Uint8Array) {\n\t // Shortcut\n\t var typedArrayByteLength = typedArray.byteLength;\n\n\t // Extract bytes\n\t var words = [];\n\t for (var i = 0; i < typedArrayByteLength; i++) {\n\t words[i >>> 2] |= typedArray[i] << (24 - (i % 4) * 8);\n\t }\n\n\t // Initialize this word array\n\t superInit.call(this, words, typedArrayByteLength);\n\t } else {\n\t // Else call normal init\n\t superInit.apply(this, arguments);\n\t }\n\t };\n\n\t subInit.prototype = WordArray;\n\t}());\n\n\n\treturn CryptoJS.lib.WordArray;\n\n}));\n},{\"./core\":38}],46:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Constants table\n\t var T = [];\n\n\t // Compute constants\n\t (function () {\n\t for (var i = 0; i < 64; i++) {\n\t T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;\n\t }\n\t }());\n\n\t /**\n\t * MD5 hash algorithm.\n\t */\n\t var MD5 = C_algo.MD5 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Swap endian\n\t for (var i = 0; i < 16; i++) {\n\t // Shortcuts\n\t var offset_i = offset + i;\n\t var M_offset_i = M[offset_i];\n\n\t M[offset_i] = (\n\t (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |\n\t (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)\n\t );\n\t }\n\n\t // Shortcuts\n\t var H = this._hash.words;\n\n\t var M_offset_0 = M[offset + 0];\n\t var M_offset_1 = M[offset + 1];\n\t var M_offset_2 = M[offset + 2];\n\t var M_offset_3 = M[offset + 3];\n\t var M_offset_4 = M[offset + 4];\n\t var M_offset_5 = M[offset + 5];\n\t var M_offset_6 = M[offset + 6];\n\t var M_offset_7 = M[offset + 7];\n\t var M_offset_8 = M[offset + 8];\n\t var M_offset_9 = M[offset + 9];\n\t var M_offset_10 = M[offset + 10];\n\t var M_offset_11 = M[offset + 11];\n\t var M_offset_12 = M[offset + 12];\n\t var M_offset_13 = M[offset + 13];\n\t var M_offset_14 = M[offset + 14];\n\t var M_offset_15 = M[offset + 15];\n\n\t // Working varialbes\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\n\t // Computation\n\t a = FF(a, b, c, d, M_offset_0, 7, T[0]);\n\t d = FF(d, a, b, c, M_offset_1, 12, T[1]);\n\t c = FF(c, d, a, b, M_offset_2, 17, T[2]);\n\t b = FF(b, c, d, a, M_offset_3, 22, T[3]);\n\t a = FF(a, b, c, d, M_offset_4, 7, T[4]);\n\t d = FF(d, a, b, c, M_offset_5, 12, T[5]);\n\t c = FF(c, d, a, b, M_offset_6, 17, T[6]);\n\t b = FF(b, c, d, a, M_offset_7, 22, T[7]);\n\t a = FF(a, b, c, d, M_offset_8, 7, T[8]);\n\t d = FF(d, a, b, c, M_offset_9, 12, T[9]);\n\t c = FF(c, d, a, b, M_offset_10, 17, T[10]);\n\t b = FF(b, c, d, a, M_offset_11, 22, T[11]);\n\t a = FF(a, b, c, d, M_offset_12, 7, T[12]);\n\t d = FF(d, a, b, c, M_offset_13, 12, T[13]);\n\t c = FF(c, d, a, b, M_offset_14, 17, T[14]);\n\t b = FF(b, c, d, a, M_offset_15, 22, T[15]);\n\n\t a = GG(a, b, c, d, M_offset_1, 5, T[16]);\n\t d = GG(d, a, b, c, M_offset_6, 9, T[17]);\n\t c = GG(c, d, a, b, M_offset_11, 14, T[18]);\n\t b = GG(b, c, d, a, M_offset_0, 20, T[19]);\n\t a = GG(a, b, c, d, M_offset_5, 5, T[20]);\n\t d = GG(d, a, b, c, M_offset_10, 9, T[21]);\n\t c = GG(c, d, a, b, M_offset_15, 14, T[22]);\n\t b = GG(b, c, d, a, M_offset_4, 20, T[23]);\n\t a = GG(a, b, c, d, M_offset_9, 5, T[24]);\n\t d = GG(d, a, b, c, M_offset_14, 9, T[25]);\n\t c = GG(c, d, a, b, M_offset_3, 14, T[26]);\n\t b = GG(b, c, d, a, M_offset_8, 20, T[27]);\n\t a = GG(a, b, c, d, M_offset_13, 5, T[28]);\n\t d = GG(d, a, b, c, M_offset_2, 9, T[29]);\n\t c = GG(c, d, a, b, M_offset_7, 14, T[30]);\n\t b = GG(b, c, d, a, M_offset_12, 20, T[31]);\n\n\t a = HH(a, b, c, d, M_offset_5, 4, T[32]);\n\t d = HH(d, a, b, c, M_offset_8, 11, T[33]);\n\t c = HH(c, d, a, b, M_offset_11, 16, T[34]);\n\t b = HH(b, c, d, a, M_offset_14, 23, T[35]);\n\t a = HH(a, b, c, d, M_offset_1, 4, T[36]);\n\t d = HH(d, a, b, c, M_offset_4, 11, T[37]);\n\t c = HH(c, d, a, b, M_offset_7, 16, T[38]);\n\t b = HH(b, c, d, a, M_offset_10, 23, T[39]);\n\t a = HH(a, b, c, d, M_offset_13, 4, T[40]);\n\t d = HH(d, a, b, c, M_offset_0, 11, T[41]);\n\t c = HH(c, d, a, b, M_offset_3, 16, T[42]);\n\t b = HH(b, c, d, a, M_offset_6, 23, T[43]);\n\t a = HH(a, b, c, d, M_offset_9, 4, T[44]);\n\t d = HH(d, a, b, c, M_offset_12, 11, T[45]);\n\t c = HH(c, d, a, b, M_offset_15, 16, T[46]);\n\t b = HH(b, c, d, a, M_offset_2, 23, T[47]);\n\n\t a = II(a, b, c, d, M_offset_0, 6, T[48]);\n\t d = II(d, a, b, c, M_offset_7, 10, T[49]);\n\t c = II(c, d, a, b, M_offset_14, 15, T[50]);\n\t b = II(b, c, d, a, M_offset_5, 21, T[51]);\n\t a = II(a, b, c, d, M_offset_12, 6, T[52]);\n\t d = II(d, a, b, c, M_offset_3, 10, T[53]);\n\t c = II(c, d, a, b, M_offset_10, 15, T[54]);\n\t b = II(b, c, d, a, M_offset_1, 21, T[55]);\n\t a = II(a, b, c, d, M_offset_8, 6, T[56]);\n\t d = II(d, a, b, c, M_offset_15, 10, T[57]);\n\t c = II(c, d, a, b, M_offset_6, 15, T[58]);\n\t b = II(b, c, d, a, M_offset_13, 21, T[59]);\n\t a = II(a, b, c, d, M_offset_4, 6, T[60]);\n\t d = II(d, a, b, c, M_offset_11, 10, T[61]);\n\t c = II(c, d, a, b, M_offset_2, 15, T[62]);\n\t b = II(b, c, d, a, M_offset_9, 21, T[63]);\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\n\t var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);\n\t var nBitsTotalL = nBitsTotal;\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (\n\t (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)\n\t );\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (\n\t (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)\n\t );\n\n\t data.sigBytes = (dataWords.length + 1) * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Shortcuts\n\t var hash = this._hash;\n\t var H = hash.words;\n\n\t // Swap endian\n\t for (var i = 0; i < 4; i++) {\n\t // Shortcut\n\t var H_i = H[i];\n\n\t H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |\n\t (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);\n\t }\n\n\t // Return final computed hash\n\t return hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t function FF(a, b, c, d, x, s, t) {\n\t var n = a + ((b & c) | (~b & d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function GG(a, b, c, d, x, s, t) {\n\t var n = a + ((b & d) | (c & ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function HH(a, b, c, d, x, s, t) {\n\t var n = a + (b ^ c ^ d) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t function II(a, b, c, d, x, s, t) {\n\t var n = a + (c ^ (b | ~d)) + x + t;\n\t return ((n << s) | (n >>> (32 - s))) + b;\n\t }\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.MD5('message');\n\t * var hash = CryptoJS.MD5(wordArray);\n\t */\n\t C.MD5 = Hasher._createHelper(MD5);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacMD5(message, key);\n\t */\n\t C.HmacMD5 = Hasher._createHmacHelper(MD5);\n\t}(Math));\n\n\n\treturn CryptoJS.MD5;\n\n}));\n},{\"./core\":38}],47:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Cipher Feedback block mode.\n\t */\n\tCryptoJS.mode.CFB = (function () {\n\t var CFB = CryptoJS.lib.BlockCipherMode.extend();\n\n\t CFB.Encryptor = CFB.extend({\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);\n\n\t // Remember this block to use with next block\n\t this._prevBlock = words.slice(offset, offset + blockSize);\n\t }\n\t });\n\n\t CFB.Decryptor = CFB.extend({\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher;\n\t var blockSize = cipher.blockSize;\n\n\t // Remember this block to use with next block\n\t var thisBlock = words.slice(offset, offset + blockSize);\n\n\t generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);\n\n\t // This block becomes the previous block\n\t this._prevBlock = thisBlock;\n\t }\n\t });\n\n\t function generateKeystreamAndEncrypt(words, offset, blockSize, cipher) {\n\t // Shortcut\n\t var iv = this._iv;\n\n\t // Generate keystream\n\t if (iv) {\n\t var keystream = iv.slice(0);\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t } else {\n\t var keystream = this._prevBlock;\n\t }\n\t cipher.encryptBlock(keystream, 0);\n\n\t // Encrypt\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= keystream[i];\n\t }\n\t }\n\n\t return CFB;\n\t}());\n\n\n\treturn CryptoJS.mode.CFB;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],48:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/** @preserve\n\t * Counter block mode compatible with Dr Brian Gladman fileenc.c\n\t * derived from CryptoJS.mode.CTR\n\t * Jan Hruby jhruby.web@gmail.com\n\t */\n\tCryptoJS.mode.CTRGladman = (function () {\n\t var CTRGladman = CryptoJS.lib.BlockCipherMode.extend();\n\n\t\tfunction incWord(word)\n\t\t{\n\t\t\tif (((word >> 24) & 0xff) === 0xff) { //overflow\n\t\t\tvar b1 = (word >> 16)&0xff;\n\t\t\tvar b2 = (word >> 8)&0xff;\n\t\t\tvar b3 = word & 0xff;\n\n\t\t\tif (b1 === 0xff) // overflow b1\n\t\t\t{\n\t\t\tb1 = 0;\n\t\t\tif (b2 === 0xff)\n\t\t\t{\n\t\t\t\tb2 = 0;\n\t\t\t\tif (b3 === 0xff)\n\t\t\t\t{\n\t\t\t\t\tb3 = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t++b3;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++b2;\n\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t++b1;\n\t\t\t}\n\n\t\t\tword = 0;\n\t\t\tword += (b1 << 16);\n\t\t\tword += (b2 << 8);\n\t\t\tword += b3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\tword += (0x01 << 24);\n\t\t\t}\n\t\t\treturn word;\n\t\t}\n\n\t\tfunction incCounter(counter)\n\t\t{\n\t\t\tif ((counter[0] = incWord(counter[0])) === 0)\n\t\t\t{\n\t\t\t\t// encr_data in fileenc.c from Dr Brian Gladman's counts only with DWORD j < 8\n\t\t\t\tcounter[1] = incWord(counter[1]);\n\t\t\t}\n\t\t\treturn counter;\n\t\t}\n\n\t var Encryptor = CTRGladman.Encryptor = CTRGladman.extend({\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher\n\t var blockSize = cipher.blockSize;\n\t var iv = this._iv;\n\t var counter = this._counter;\n\n\t // Generate keystream\n\t if (iv) {\n\t counter = this._counter = iv.slice(0);\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t }\n\n\t\t\t\tincCounter(counter);\n\n\t\t\t\tvar keystream = counter.slice(0);\n\t cipher.encryptBlock(keystream, 0);\n\n\t // Encrypt\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= keystream[i];\n\t }\n\t }\n\t });\n\n\t CTRGladman.Decryptor = Encryptor;\n\n\t return CTRGladman;\n\t}());\n\n\n\n\n\treturn CryptoJS.mode.CTRGladman;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],49:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Counter block mode.\n\t */\n\tCryptoJS.mode.CTR = (function () {\n\t var CTR = CryptoJS.lib.BlockCipherMode.extend();\n\n\t var Encryptor = CTR.Encryptor = CTR.extend({\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher\n\t var blockSize = cipher.blockSize;\n\t var iv = this._iv;\n\t var counter = this._counter;\n\n\t // Generate keystream\n\t if (iv) {\n\t counter = this._counter = iv.slice(0);\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t }\n\t var keystream = counter.slice(0);\n\t cipher.encryptBlock(keystream, 0);\n\n\t // Increment counter\n\t counter[blockSize - 1] = (counter[blockSize - 1] + 1) | 0\n\n\t // Encrypt\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= keystream[i];\n\t }\n\t }\n\t });\n\n\t CTR.Decryptor = Encryptor;\n\n\t return CTR;\n\t}());\n\n\n\treturn CryptoJS.mode.CTR;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],50:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Electronic Codebook block mode.\n\t */\n\tCryptoJS.mode.ECB = (function () {\n\t var ECB = CryptoJS.lib.BlockCipherMode.extend();\n\n\t ECB.Encryptor = ECB.extend({\n\t processBlock: function (words, offset) {\n\t this._cipher.encryptBlock(words, offset);\n\t }\n\t });\n\n\t ECB.Decryptor = ECB.extend({\n\t processBlock: function (words, offset) {\n\t this._cipher.decryptBlock(words, offset);\n\t }\n\t });\n\n\t return ECB;\n\t}());\n\n\n\treturn CryptoJS.mode.ECB;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],51:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Output Feedback block mode.\n\t */\n\tCryptoJS.mode.OFB = (function () {\n\t var OFB = CryptoJS.lib.BlockCipherMode.extend();\n\n\t var Encryptor = OFB.Encryptor = OFB.extend({\n\t processBlock: function (words, offset) {\n\t // Shortcuts\n\t var cipher = this._cipher\n\t var blockSize = cipher.blockSize;\n\t var iv = this._iv;\n\t var keystream = this._keystream;\n\n\t // Generate keystream\n\t if (iv) {\n\t keystream = this._keystream = iv.slice(0);\n\n\t // Remove IV for subsequent blocks\n\t this._iv = undefined;\n\t }\n\t cipher.encryptBlock(keystream, 0);\n\n\t // Encrypt\n\t for (var i = 0; i < blockSize; i++) {\n\t words[offset + i] ^= keystream[i];\n\t }\n\t }\n\t });\n\n\t OFB.Decryptor = Encryptor;\n\n\t return OFB;\n\t}());\n\n\n\treturn CryptoJS.mode.OFB;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],52:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * ANSI X.923 padding strategy.\n\t */\n\tCryptoJS.pad.AnsiX923 = {\n\t pad: function (data, blockSize) {\n\t // Shortcuts\n\t var dataSigBytes = data.sigBytes;\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count padding bytes\n\t var nPaddingBytes = blockSizeBytes - dataSigBytes % blockSizeBytes;\n\n\t // Compute last byte position\n\t var lastBytePos = dataSigBytes + nPaddingBytes - 1;\n\n\t // Pad\n\t data.clamp();\n\t data.words[lastBytePos >>> 2] |= nPaddingBytes << (24 - (lastBytePos % 4) * 8);\n\t data.sigBytes += nPaddingBytes;\n\t },\n\n\t unpad: function (data) {\n\t // Get number of padding bytes from last byte\n\t var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;\n\n\t // Remove padding\n\t data.sigBytes -= nPaddingBytes;\n\t }\n\t};\n\n\n\treturn CryptoJS.pad.Ansix923;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],53:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * ISO 10126 padding strategy.\n\t */\n\tCryptoJS.pad.Iso10126 = {\n\t pad: function (data, blockSize) {\n\t // Shortcut\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Count padding bytes\n\t var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;\n\n\t // Pad\n\t data.concat(CryptoJS.lib.WordArray.random(nPaddingBytes - 1)).\n\t concat(CryptoJS.lib.WordArray.create([nPaddingBytes << 24], 1));\n\t },\n\n\t unpad: function (data) {\n\t // Get number of padding bytes from last byte\n\t var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;\n\n\t // Remove padding\n\t data.sigBytes -= nPaddingBytes;\n\t }\n\t};\n\n\n\treturn CryptoJS.pad.Iso10126;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],54:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * ISO/IEC 9797-1 Padding Method 2.\n\t */\n\tCryptoJS.pad.Iso97971 = {\n\t pad: function (data, blockSize) {\n\t // Add 0x80 byte\n\t data.concat(CryptoJS.lib.WordArray.create([0x80000000], 1));\n\n\t // Zero pad the rest\n\t CryptoJS.pad.ZeroPadding.pad(data, blockSize);\n\t },\n\n\t unpad: function (data) {\n\t // Remove zero padding\n\t CryptoJS.pad.ZeroPadding.unpad(data);\n\n\t // Remove one more byte -- the 0x80 byte\n\t data.sigBytes--;\n\t }\n\t};\n\n\n\treturn CryptoJS.pad.Iso97971;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],55:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * A noop padding strategy.\n\t */\n\tCryptoJS.pad.NoPadding = {\n\t pad: function () {\n\t },\n\n\t unpad: function () {\n\t }\n\t};\n\n\n\treturn CryptoJS.pad.NoPadding;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],56:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/**\n\t * Zero padding strategy.\n\t */\n\tCryptoJS.pad.ZeroPadding = {\n\t pad: function (data, blockSize) {\n\t // Shortcut\n\t var blockSizeBytes = blockSize * 4;\n\n\t // Pad\n\t data.clamp();\n\t data.sigBytes += blockSizeBytes - ((data.sigBytes % blockSizeBytes) || blockSizeBytes);\n\t },\n\n\t unpad: function (data) {\n\t // Shortcut\n\t var dataWords = data.words;\n\n\t // Unpad\n\t var i = data.sigBytes - 1;\n\t while (!((dataWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff)) {\n\t i--;\n\t }\n\t data.sigBytes = i + 1;\n\t }\n\t};\n\n\n\treturn CryptoJS.pad.ZeroPadding;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38}],57:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./sha1\"), _dereq_(\"./hmac\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./sha1\", \"./hmac\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var WordArray = C_lib.WordArray;\n\t var C_algo = C.algo;\n\t var SHA1 = C_algo.SHA1;\n\t var HMAC = C_algo.HMAC;\n\n\t /**\n\t * Password-Based Key Derivation Function 2 algorithm.\n\t */\n\t var PBKDF2 = C_algo.PBKDF2 = Base.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)\n\t * @property {Hasher} hasher The hasher to use. Default: SHA1\n\t * @property {number} iterations The number of iterations to perform. Default: 1\n\t */\n\t cfg: Base.extend({\n\t keySize: 128/32,\n\t hasher: SHA1,\n\t iterations: 1\n\t }),\n\n\t /**\n\t * Initializes a newly created key derivation function.\n\t *\n\t * @param {Object} cfg (Optional) The configuration options to use for the derivation.\n\t *\n\t * @example\n\t *\n\t * var kdf = CryptoJS.algo.PBKDF2.create();\n\t * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8 });\n\t * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8, iterations: 1000 });\n\t */\n\t init: function (cfg) {\n\t this.cfg = this.cfg.extend(cfg);\n\t },\n\n\t /**\n\t * Computes the Password-Based Key Derivation Function 2.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @example\n\t *\n\t * var key = kdf.compute(password, salt);\n\t */\n\t compute: function (password, salt) {\n\t // Shortcut\n\t var cfg = this.cfg;\n\n\t // Init HMAC\n\t var hmac = HMAC.create(cfg.hasher, password);\n\n\t // Initial values\n\t var derivedKey = WordArray.create();\n\t var blockIndex = WordArray.create([0x00000001]);\n\n\t // Shortcuts\n\t var derivedKeyWords = derivedKey.words;\n\t var blockIndexWords = blockIndex.words;\n\t var keySize = cfg.keySize;\n\t var iterations = cfg.iterations;\n\n\t // Generate key\n\t while (derivedKeyWords.length < keySize) {\n\t var block = hmac.update(salt).finalize(blockIndex);\n\t hmac.reset();\n\n\t // Shortcuts\n\t var blockWords = block.words;\n\t var blockWordsLength = blockWords.length;\n\n\t // Iterations\n\t var intermediate = block;\n\t for (var i = 1; i < iterations; i++) {\n\t intermediate = hmac.finalize(intermediate);\n\t hmac.reset();\n\n\t // Shortcut\n\t var intermediateWords = intermediate.words;\n\n\t // XOR intermediate with block\n\t for (var j = 0; j < blockWordsLength; j++) {\n\t blockWords[j] ^= intermediateWords[j];\n\t }\n\t }\n\n\t derivedKey.concat(block);\n\t blockIndexWords[0]++;\n\t }\n\t derivedKey.sigBytes = keySize * 4;\n\n\t return derivedKey;\n\t }\n\t });\n\n\t /**\n\t * Computes the Password-Based Key Derivation Function 2.\n\t *\n\t * @param {WordArray|string} password The password.\n\t * @param {WordArray|string} salt A salt.\n\t * @param {Object} cfg (Optional) The configuration options to use for this computation.\n\t *\n\t * @return {WordArray} The derived key.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var key = CryptoJS.PBKDF2(password, salt);\n\t * var key = CryptoJS.PBKDF2(password, salt, { keySize: 8 });\n\t * var key = CryptoJS.PBKDF2(password, salt, { keySize: 8, iterations: 1000 });\n\t */\n\t C.PBKDF2 = function (password, salt, cfg) {\n\t return PBKDF2.create(cfg).compute(password, salt);\n\t };\n\t}());\n\n\n\treturn CryptoJS.PBKDF2;\n\n}));\n},{\"./core\":38,\"./hmac\":43,\"./sha1\":62}],58:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var StreamCipher = C_lib.StreamCipher;\n\t var C_algo = C.algo;\n\n\t // Reusable objects\n\t var S = [];\n\t var C_ = [];\n\t var G = [];\n\n\t /**\n\t * Rabbit stream cipher algorithm.\n\t *\n\t * This is a legacy version that neglected to convert the key to little-endian.\n\t * This error doesn't affect the cipher's security,\n\t * but it does affect its compatibility with other implementations.\n\t */\n\t var RabbitLegacy = C_algo.RabbitLegacy = StreamCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var K = this._key.words;\n\t var iv = this.cfg.iv;\n\n\t // Generate initial state values\n\t var X = this._X = [\n\t K[0], (K[3] << 16) | (K[2] >>> 16),\n\t K[1], (K[0] << 16) | (K[3] >>> 16),\n\t K[2], (K[1] << 16) | (K[0] >>> 16),\n\t K[3], (K[2] << 16) | (K[1] >>> 16)\n\t ];\n\n\t // Generate initial counter values\n\t var C = this._C = [\n\t (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),\n\t (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),\n\t (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),\n\t (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)\n\t ];\n\n\t // Carry bit\n\t this._b = 0;\n\n\t // Iterate the system four times\n\t for (var i = 0; i < 4; i++) {\n\t nextState.call(this);\n\t }\n\n\t // Modify the counters\n\t for (var i = 0; i < 8; i++) {\n\t C[i] ^= X[(i + 4) & 7];\n\t }\n\n\t // IV setup\n\t if (iv) {\n\t // Shortcuts\n\t var IV = iv.words;\n\t var IV_0 = IV[0];\n\t var IV_1 = IV[1];\n\n\t // Generate four subvectors\n\t var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);\n\t var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);\n\t var i1 = (i0 >>> 16) | (i2 & 0xffff0000);\n\t var i3 = (i2 << 16) | (i0 & 0x0000ffff);\n\n\t // Modify counter values\n\t C[0] ^= i0;\n\t C[1] ^= i1;\n\t C[2] ^= i2;\n\t C[3] ^= i3;\n\t C[4] ^= i0;\n\t C[5] ^= i1;\n\t C[6] ^= i2;\n\t C[7] ^= i3;\n\n\t // Iterate the system four times\n\t for (var i = 0; i < 4; i++) {\n\t nextState.call(this);\n\t }\n\t }\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var X = this._X;\n\n\t // Iterate the system\n\t nextState.call(this);\n\n\t // Generate four keystream words\n\t S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);\n\t S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);\n\t S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);\n\t S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);\n\n\t for (var i = 0; i < 4; i++) {\n\t // Swap endian\n\t S[i] = (((S[i] << 8) | (S[i] >>> 24)) & 0x00ff00ff) |\n\t (((S[i] << 24) | (S[i] >>> 8)) & 0xff00ff00);\n\n\t // Encrypt\n\t M[offset + i] ^= S[i];\n\t }\n\t },\n\n\t blockSize: 128/32,\n\n\t ivSize: 64/32\n\t });\n\n\t function nextState() {\n\t // Shortcuts\n\t var X = this._X;\n\t var C = this._C;\n\n\t // Save old counter values\n\t for (var i = 0; i < 8; i++) {\n\t C_[i] = C[i];\n\t }\n\n\t // Calculate new counter values\n\t C[0] = (C[0] + 0x4d34d34d + this._b) | 0;\n\t C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;\n\t C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;\n\t C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;\n\t C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;\n\t C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;\n\t C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;\n\t C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;\n\t this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;\n\n\t // Calculate the g-values\n\t for (var i = 0; i < 8; i++) {\n\t var gx = X[i] + C[i];\n\n\t // Construct high and low argument for squaring\n\t var ga = gx & 0xffff;\n\t var gb = gx >>> 16;\n\n\t // Calculate high and low result of squaring\n\t var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;\n\t var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);\n\n\t // High XOR low\n\t G[i] = gh ^ gl;\n\t }\n\n\t // Calculate new state values\n\t X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;\n\t X[1] = (G[1] + ((G[0] << 8) | (G[0] >>> 24)) + G[7]) | 0;\n\t X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;\n\t X[3] = (G[3] + ((G[2] << 8) | (G[2] >>> 24)) + G[1]) | 0;\n\t X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;\n\t X[5] = (G[5] + ((G[4] << 8) | (G[4] >>> 24)) + G[3]) | 0;\n\t X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;\n\t X[7] = (G[7] + ((G[6] << 8) | (G[6] >>> 24)) + G[5]) | 0;\n\t }\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.RabbitLegacy.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.RabbitLegacy.decrypt(ciphertext, key, cfg);\n\t */\n\t C.RabbitLegacy = StreamCipher._createHelper(RabbitLegacy);\n\t}());\n\n\n\treturn CryptoJS.RabbitLegacy;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./evpkdf\":41,\"./md5\":46}],59:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var StreamCipher = C_lib.StreamCipher;\n\t var C_algo = C.algo;\n\n\t // Reusable objects\n\t var S = [];\n\t var C_ = [];\n\t var G = [];\n\n\t /**\n\t * Rabbit stream cipher algorithm\n\t */\n\t var Rabbit = C_algo.Rabbit = StreamCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var K = this._key.words;\n\t var iv = this.cfg.iv;\n\n\t // Swap endian\n\t for (var i = 0; i < 4; i++) {\n\t K[i] = (((K[i] << 8) | (K[i] >>> 24)) & 0x00ff00ff) |\n\t (((K[i] << 24) | (K[i] >>> 8)) & 0xff00ff00);\n\t }\n\n\t // Generate initial state values\n\t var X = this._X = [\n\t K[0], (K[3] << 16) | (K[2] >>> 16),\n\t K[1], (K[0] << 16) | (K[3] >>> 16),\n\t K[2], (K[1] << 16) | (K[0] >>> 16),\n\t K[3], (K[2] << 16) | (K[1] >>> 16)\n\t ];\n\n\t // Generate initial counter values\n\t var C = this._C = [\n\t (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),\n\t (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),\n\t (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),\n\t (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)\n\t ];\n\n\t // Carry bit\n\t this._b = 0;\n\n\t // Iterate the system four times\n\t for (var i = 0; i < 4; i++) {\n\t nextState.call(this);\n\t }\n\n\t // Modify the counters\n\t for (var i = 0; i < 8; i++) {\n\t C[i] ^= X[(i + 4) & 7];\n\t }\n\n\t // IV setup\n\t if (iv) {\n\t // Shortcuts\n\t var IV = iv.words;\n\t var IV_0 = IV[0];\n\t var IV_1 = IV[1];\n\n\t // Generate four subvectors\n\t var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);\n\t var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);\n\t var i1 = (i0 >>> 16) | (i2 & 0xffff0000);\n\t var i3 = (i2 << 16) | (i0 & 0x0000ffff);\n\n\t // Modify counter values\n\t C[0] ^= i0;\n\t C[1] ^= i1;\n\t C[2] ^= i2;\n\t C[3] ^= i3;\n\t C[4] ^= i0;\n\t C[5] ^= i1;\n\t C[6] ^= i2;\n\t C[7] ^= i3;\n\n\t // Iterate the system four times\n\t for (var i = 0; i < 4; i++) {\n\t nextState.call(this);\n\t }\n\t }\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var X = this._X;\n\n\t // Iterate the system\n\t nextState.call(this);\n\n\t // Generate four keystream words\n\t S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);\n\t S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);\n\t S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);\n\t S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);\n\n\t for (var i = 0; i < 4; i++) {\n\t // Swap endian\n\t S[i] = (((S[i] << 8) | (S[i] >>> 24)) & 0x00ff00ff) |\n\t (((S[i] << 24) | (S[i] >>> 8)) & 0xff00ff00);\n\n\t // Encrypt\n\t M[offset + i] ^= S[i];\n\t }\n\t },\n\n\t blockSize: 128/32,\n\n\t ivSize: 64/32\n\t });\n\n\t function nextState() {\n\t // Shortcuts\n\t var X = this._X;\n\t var C = this._C;\n\n\t // Save old counter values\n\t for (var i = 0; i < 8; i++) {\n\t C_[i] = C[i];\n\t }\n\n\t // Calculate new counter values\n\t C[0] = (C[0] + 0x4d34d34d + this._b) | 0;\n\t C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;\n\t C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;\n\t C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;\n\t C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;\n\t C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;\n\t C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;\n\t C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;\n\t this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;\n\n\t // Calculate the g-values\n\t for (var i = 0; i < 8; i++) {\n\t var gx = X[i] + C[i];\n\n\t // Construct high and low argument for squaring\n\t var ga = gx & 0xffff;\n\t var gb = gx >>> 16;\n\n\t // Calculate high and low result of squaring\n\t var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;\n\t var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);\n\n\t // High XOR low\n\t G[i] = gh ^ gl;\n\t }\n\n\t // Calculate new state values\n\t X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;\n\t X[1] = (G[1] + ((G[0] << 8) | (G[0] >>> 24)) + G[7]) | 0;\n\t X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;\n\t X[3] = (G[3] + ((G[2] << 8) | (G[2] >>> 24)) + G[1]) | 0;\n\t X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;\n\t X[5] = (G[5] + ((G[4] << 8) | (G[4] >>> 24)) + G[3]) | 0;\n\t X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;\n\t X[7] = (G[7] + ((G[6] << 8) | (G[6] >>> 24)) + G[5]) | 0;\n\t }\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.Rabbit.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.Rabbit.decrypt(ciphertext, key, cfg);\n\t */\n\t C.Rabbit = StreamCipher._createHelper(Rabbit);\n\t}());\n\n\n\treturn CryptoJS.Rabbit;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./evpkdf\":41,\"./md5\":46}],60:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var StreamCipher = C_lib.StreamCipher;\n\t var C_algo = C.algo;\n\n\t /**\n\t * RC4 stream cipher algorithm.\n\t */\n\t var RC4 = C_algo.RC4 = StreamCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var key = this._key;\n\t var keyWords = key.words;\n\t var keySigBytes = key.sigBytes;\n\n\t // Init sbox\n\t var S = this._S = [];\n\t for (var i = 0; i < 256; i++) {\n\t S[i] = i;\n\t }\n\n\t // Key setup\n\t for (var i = 0, j = 0; i < 256; i++) {\n\t var keyByteIndex = i % keySigBytes;\n\t var keyByte = (keyWords[keyByteIndex >>> 2] >>> (24 - (keyByteIndex % 4) * 8)) & 0xff;\n\n\t j = (j + S[i] + keyByte) % 256;\n\n\t // Swap\n\t var t = S[i];\n\t S[i] = S[j];\n\t S[j] = t;\n\t }\n\n\t // Counters\n\t this._i = this._j = 0;\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t M[offset] ^= generateKeystreamWord.call(this);\n\t },\n\n\t keySize: 256/32,\n\n\t ivSize: 0\n\t });\n\n\t function generateKeystreamWord() {\n\t // Shortcuts\n\t var S = this._S;\n\t var i = this._i;\n\t var j = this._j;\n\n\t // Generate keystream word\n\t var keystreamWord = 0;\n\t for (var n = 0; n < 4; n++) {\n\t i = (i + 1) % 256;\n\t j = (j + S[i]) % 256;\n\n\t // Swap\n\t var t = S[i];\n\t S[i] = S[j];\n\t S[j] = t;\n\n\t keystreamWord |= S[(S[i] + S[j]) % 256] << (24 - n * 8);\n\t }\n\n\t // Update counters\n\t this._i = i;\n\t this._j = j;\n\n\t return keystreamWord;\n\t }\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.RC4.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.RC4.decrypt(ciphertext, key, cfg);\n\t */\n\t C.RC4 = StreamCipher._createHelper(RC4);\n\n\t /**\n\t * Modified RC4 stream cipher algorithm.\n\t */\n\t var RC4Drop = C_algo.RC4Drop = RC4.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} drop The number of keystream words to drop. Default 192\n\t */\n\t cfg: RC4.cfg.extend({\n\t drop: 192\n\t }),\n\n\t _doReset: function () {\n\t RC4._doReset.call(this);\n\n\t // Drop\n\t for (var i = this.cfg.drop; i > 0; i--) {\n\t generateKeystreamWord.call(this);\n\t }\n\t }\n\t });\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.RC4Drop.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.RC4Drop.decrypt(ciphertext, key, cfg);\n\t */\n\t C.RC4Drop = StreamCipher._createHelper(RC4Drop);\n\t}());\n\n\n\treturn CryptoJS.RC4;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./evpkdf\":41,\"./md5\":46}],61:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t/** @preserve\n\t(c) 2012 by Cédric Mesnil. All rights reserved.\n\n\tRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n\t - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\t - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n\n\tTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\t*/\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Constants table\n\t var _zl = WordArray.create([\n\t 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n\t 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n\t 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n\t 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n\t 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]);\n\t var _zr = WordArray.create([\n\t 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n\t 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n\t 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n\t 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n\t 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]);\n\t var _sl = WordArray.create([\n\t 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n\t 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n\t 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n\t 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n\t 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ]);\n\t var _sr = WordArray.create([\n\t 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n\t 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n\t 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n\t 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n\t 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ]);\n\n\t var _hl = WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);\n\t var _hr = WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);\n\n\t /**\n\t * RIPEMD160 hash algorithm.\n\t */\n\t var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\n\t // Swap endian\n\t for (var i = 0; i < 16; i++) {\n\t // Shortcuts\n\t var offset_i = offset + i;\n\t var M_offset_i = M[offset_i];\n\n\t // Swap\n\t M[offset_i] = (\n\t (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |\n\t (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)\n\t );\n\t }\n\t // Shortcut\n\t var H = this._hash.words;\n\t var hl = _hl.words;\n\t var hr = _hr.words;\n\t var zl = _zl.words;\n\t var zr = _zr.words;\n\t var sl = _sl.words;\n\t var sr = _sr.words;\n\n\t // Working variables\n\t var al, bl, cl, dl, el;\n\t var ar, br, cr, dr, er;\n\n\t ar = al = H[0];\n\t br = bl = H[1];\n\t cr = cl = H[2];\n\t dr = dl = H[3];\n\t er = el = H[4];\n\t // Computation\n\t var t;\n\t for (var i = 0; i < 80; i += 1) {\n\t t = (al + M[offset+zl[i]])|0;\n\t if (i<16){\n\t\t t += f1(bl,cl,dl) + hl[0];\n\t } else if (i<32) {\n\t\t t += f2(bl,cl,dl) + hl[1];\n\t } else if (i<48) {\n\t\t t += f3(bl,cl,dl) + hl[2];\n\t } else if (i<64) {\n\t\t t += f4(bl,cl,dl) + hl[3];\n\t } else {// if (i<80) {\n\t\t t += f5(bl,cl,dl) + hl[4];\n\t }\n\t t = t|0;\n\t t = rotl(t,sl[i]);\n\t t = (t+el)|0;\n\t al = el;\n\t el = dl;\n\t dl = rotl(cl, 10);\n\t cl = bl;\n\t bl = t;\n\n\t t = (ar + M[offset+zr[i]])|0;\n\t if (i<16){\n\t\t t += f5(br,cr,dr) + hr[0];\n\t } else if (i<32) {\n\t\t t += f4(br,cr,dr) + hr[1];\n\t } else if (i<48) {\n\t\t t += f3(br,cr,dr) + hr[2];\n\t } else if (i<64) {\n\t\t t += f2(br,cr,dr) + hr[3];\n\t } else {// if (i<80) {\n\t\t t += f1(br,cr,dr) + hr[4];\n\t }\n\t t = t|0;\n\t t = rotl(t,sr[i]) ;\n\t t = (t+er)|0;\n\t ar = er;\n\t er = dr;\n\t dr = rotl(cr, 10);\n\t cr = br;\n\t br = t;\n\t }\n\t // Intermediate hash value\n\t t = (H[1] + cl + dr)|0;\n\t H[1] = (H[2] + dl + er)|0;\n\t H[2] = (H[3] + el + ar)|0;\n\t H[3] = (H[4] + al + br)|0;\n\t H[4] = (H[0] + bl + cr)|0;\n\t H[0] = t;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (\n\t (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |\n\t (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)\n\t );\n\t data.sigBytes = (dataWords.length + 1) * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Shortcuts\n\t var hash = this._hash;\n\t var H = hash.words;\n\n\t // Swap endian\n\t for (var i = 0; i < 5; i++) {\n\t // Shortcut\n\t var H_i = H[i];\n\n\t // Swap\n\t H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |\n\t (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);\n\t }\n\n\t // Return final computed hash\n\t return hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\n\t function f1(x, y, z) {\n\t return ((x) ^ (y) ^ (z));\n\n\t }\n\n\t function f2(x, y, z) {\n\t return (((x)&(y)) | ((~x)&(z)));\n\t }\n\n\t function f3(x, y, z) {\n\t return (((x) | (~(y))) ^ (z));\n\t }\n\n\t function f4(x, y, z) {\n\t return (((x) & (z)) | ((y)&(~(z))));\n\t }\n\n\t function f5(x, y, z) {\n\t return ((x) ^ ((y) |(~(z))));\n\n\t }\n\n\t function rotl(x,n) {\n\t return (x<<n) | (x>>>(32-n));\n\t }\n\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.RIPEMD160('message');\n\t * var hash = CryptoJS.RIPEMD160(wordArray);\n\t */\n\t C.RIPEMD160 = Hasher._createHelper(RIPEMD160);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacRIPEMD160(message, key);\n\t */\n\t C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160);\n\t}(Math));\n\n\n\treturn CryptoJS.RIPEMD160;\n\n}));\n},{\"./core\":38}],62:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Reusable object\n\t var W = [];\n\n\t /**\n\t * SHA-1 hash algorithm.\n\t */\n\t var SHA1 = C_algo.SHA1 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0x67452301, 0xefcdab89,\n\t 0x98badcfe, 0x10325476,\n\t 0xc3d2e1f0\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var H = this._hash.words;\n\n\t // Working variables\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\t var e = H[4];\n\n\t // Computation\n\t for (var i = 0; i < 80; i++) {\n\t if (i < 16) {\n\t W[i] = M[offset + i] | 0;\n\t } else {\n\t var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n\t W[i] = (n << 1) | (n >>> 31);\n\t }\n\n\t var t = ((a << 5) | (a >>> 27)) + e + W[i];\n\t if (i < 20) {\n\t t += ((b & c) | (~b & d)) + 0x5a827999;\n\t } else if (i < 40) {\n\t t += (b ^ c ^ d) + 0x6ed9eba1;\n\t } else if (i < 60) {\n\t t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;\n\t } else /* if (i < 80) */ {\n\t t += (b ^ c ^ d) - 0x359d3e2a;\n\t }\n\n\t e = d;\n\t d = c;\n\t c = (b << 30) | (b >>> 2);\n\t b = a;\n\t a = t;\n\t }\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t H[4] = (H[4] + e) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Return final computed hash\n\t return this._hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA1('message');\n\t * var hash = CryptoJS.SHA1(wordArray);\n\t */\n\t C.SHA1 = Hasher._createHelper(SHA1);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA1(message, key);\n\t */\n\t C.HmacSHA1 = Hasher._createHmacHelper(SHA1);\n\t}());\n\n\n\treturn CryptoJS.SHA1;\n\n}));\n},{\"./core\":38}],63:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./sha256\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./sha256\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var C_algo = C.algo;\n\t var SHA256 = C_algo.SHA256;\n\n\t /**\n\t * SHA-224 hash algorithm.\n\t */\n\t var SHA224 = C_algo.SHA224 = SHA256.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init([\n\t 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n\t 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4\n\t ]);\n\t },\n\n\t _doFinalize: function () {\n\t var hash = SHA256._doFinalize.call(this);\n\n\t hash.sigBytes -= 4;\n\n\t return hash;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA224('message');\n\t * var hash = CryptoJS.SHA224(wordArray);\n\t */\n\t C.SHA224 = SHA256._createHelper(SHA224);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA224(message, key);\n\t */\n\t C.HmacSHA224 = SHA256._createHmacHelper(SHA224);\n\t}());\n\n\n\treturn CryptoJS.SHA224;\n\n}));\n},{\"./core\":38,\"./sha256\":64}],64:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_algo = C.algo;\n\n\t // Initialization and round constants tables\n\t var H = [];\n\t var K = [];\n\n\t // Compute constants\n\t (function () {\n\t function isPrime(n) {\n\t var sqrtN = Math.sqrt(n);\n\t for (var factor = 2; factor <= sqrtN; factor++) {\n\t if (!(n % factor)) {\n\t return false;\n\t }\n\t }\n\n\t return true;\n\t }\n\n\t function getFractionalBits(n) {\n\t return ((n - (n | 0)) * 0x100000000) | 0;\n\t }\n\n\t var n = 2;\n\t var nPrime = 0;\n\t while (nPrime < 64) {\n\t if (isPrime(n)) {\n\t if (nPrime < 8) {\n\t H[nPrime] = getFractionalBits(Math.pow(n, 1 / 2));\n\t }\n\t K[nPrime] = getFractionalBits(Math.pow(n, 1 / 3));\n\n\t nPrime++;\n\t }\n\n\t n++;\n\t }\n\t }());\n\n\t // Reusable object\n\t var W = [];\n\n\t /**\n\t * SHA-256 hash algorithm.\n\t */\n\t var SHA256 = C_algo.SHA256 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new WordArray.init(H.slice(0));\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcut\n\t var H = this._hash.words;\n\n\t // Working variables\n\t var a = H[0];\n\t var b = H[1];\n\t var c = H[2];\n\t var d = H[3];\n\t var e = H[4];\n\t var f = H[5];\n\t var g = H[6];\n\t var h = H[7];\n\n\t // Computation\n\t for (var i = 0; i < 64; i++) {\n\t if (i < 16) {\n\t W[i] = M[offset + i] | 0;\n\t } else {\n\t var gamma0x = W[i - 15];\n\t var gamma0 = ((gamma0x << 25) | (gamma0x >>> 7)) ^\n\t ((gamma0x << 14) | (gamma0x >>> 18)) ^\n\t (gamma0x >>> 3);\n\n\t var gamma1x = W[i - 2];\n\t var gamma1 = ((gamma1x << 15) | (gamma1x >>> 17)) ^\n\t ((gamma1x << 13) | (gamma1x >>> 19)) ^\n\t (gamma1x >>> 10);\n\n\t W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16];\n\t }\n\n\t var ch = (e & f) ^ (~e & g);\n\t var maj = (a & b) ^ (a & c) ^ (b & c);\n\n\t var sigma0 = ((a << 30) | (a >>> 2)) ^ ((a << 19) | (a >>> 13)) ^ ((a << 10) | (a >>> 22));\n\t var sigma1 = ((e << 26) | (e >>> 6)) ^ ((e << 21) | (e >>> 11)) ^ ((e << 7) | (e >>> 25));\n\n\t var t1 = h + sigma1 + ch + K[i] + W[i];\n\t var t2 = sigma0 + maj;\n\n\t h = g;\n\t g = f;\n\t f = e;\n\t e = (d + t1) | 0;\n\t d = c;\n\t c = b;\n\t b = a;\n\t a = (t1 + t2) | 0;\n\t }\n\n\t // Intermediate hash value\n\t H[0] = (H[0] + a) | 0;\n\t H[1] = (H[1] + b) | 0;\n\t H[2] = (H[2] + c) | 0;\n\t H[3] = (H[3] + d) | 0;\n\t H[4] = (H[4] + e) | 0;\n\t H[5] = (H[5] + f) | 0;\n\t H[6] = (H[6] + g) | 0;\n\t H[7] = (H[7] + h) | 0;\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);\n\t dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Return final computed hash\n\t return this._hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA256('message');\n\t * var hash = CryptoJS.SHA256(wordArray);\n\t */\n\t C.SHA256 = Hasher._createHelper(SHA256);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA256(message, key);\n\t */\n\t C.HmacSHA256 = Hasher._createHmacHelper(SHA256);\n\t}(Math));\n\n\n\treturn CryptoJS.SHA256;\n\n}));\n},{\"./core\":38}],65:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./x64-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./x64-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (Math) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var Hasher = C_lib.Hasher;\n\t var C_x64 = C.x64;\n\t var X64Word = C_x64.Word;\n\t var C_algo = C.algo;\n\n\t // Constants tables\n\t var RHO_OFFSETS = [];\n\t var PI_INDEXES = [];\n\t var ROUND_CONSTANTS = [];\n\n\t // Compute Constants\n\t (function () {\n\t // Compute rho offset constants\n\t var x = 1, y = 0;\n\t for (var t = 0; t < 24; t++) {\n\t RHO_OFFSETS[x + 5 * y] = ((t + 1) * (t + 2) / 2) % 64;\n\n\t var newX = y % 5;\n\t var newY = (2 * x + 3 * y) % 5;\n\t x = newX;\n\t y = newY;\n\t }\n\n\t // Compute pi index constants\n\t for (var x = 0; x < 5; x++) {\n\t for (var y = 0; y < 5; y++) {\n\t PI_INDEXES[x + 5 * y] = y + ((2 * x + 3 * y) % 5) * 5;\n\t }\n\t }\n\n\t // Compute round constants\n\t var LFSR = 0x01;\n\t for (var i = 0; i < 24; i++) {\n\t var roundConstantMsw = 0;\n\t var roundConstantLsw = 0;\n\n\t for (var j = 0; j < 7; j++) {\n\t if (LFSR & 0x01) {\n\t var bitPosition = (1 << j) - 1;\n\t if (bitPosition < 32) {\n\t roundConstantLsw ^= 1 << bitPosition;\n\t } else /* if (bitPosition >= 32) */ {\n\t roundConstantMsw ^= 1 << (bitPosition - 32);\n\t }\n\t }\n\n\t // Compute next LFSR\n\t if (LFSR & 0x80) {\n\t // Primitive polynomial over GF(2): x^8 + x^6 + x^5 + x^4 + 1\n\t LFSR = (LFSR << 1) ^ 0x71;\n\t } else {\n\t LFSR <<= 1;\n\t }\n\t }\n\n\t ROUND_CONSTANTS[i] = X64Word.create(roundConstantMsw, roundConstantLsw);\n\t }\n\t }());\n\n\t // Reusable objects for temporary values\n\t var T = [];\n\t (function () {\n\t for (var i = 0; i < 25; i++) {\n\t T[i] = X64Word.create();\n\t }\n\t }());\n\n\t /**\n\t * SHA-3 hash algorithm.\n\t */\n\t var SHA3 = C_algo.SHA3 = Hasher.extend({\n\t /**\n\t * Configuration options.\n\t *\n\t * @property {number} outputLength\n\t * The desired number of bits in the output hash.\n\t * Only values permitted are: 224, 256, 384, 512.\n\t * Default: 512\n\t */\n\t cfg: Hasher.cfg.extend({\n\t outputLength: 512\n\t }),\n\n\t _doReset: function () {\n\t var state = this._state = []\n\t for (var i = 0; i < 25; i++) {\n\t state[i] = new X64Word.init();\n\t }\n\n\t this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcuts\n\t var state = this._state;\n\t var nBlockSizeLanes = this.blockSize / 2;\n\n\t // Absorb\n\t for (var i = 0; i < nBlockSizeLanes; i++) {\n\t // Shortcuts\n\t var M2i = M[offset + 2 * i];\n\t var M2i1 = M[offset + 2 * i + 1];\n\n\t // Swap endian\n\t M2i = (\n\t (((M2i << 8) | (M2i >>> 24)) & 0x00ff00ff) |\n\t (((M2i << 24) | (M2i >>> 8)) & 0xff00ff00)\n\t );\n\t M2i1 = (\n\t (((M2i1 << 8) | (M2i1 >>> 24)) & 0x00ff00ff) |\n\t (((M2i1 << 24) | (M2i1 >>> 8)) & 0xff00ff00)\n\t );\n\n\t // Absorb message into state\n\t var lane = state[i];\n\t lane.high ^= M2i1;\n\t lane.low ^= M2i;\n\t }\n\n\t // Rounds\n\t for (var round = 0; round < 24; round++) {\n\t // Theta\n\t for (var x = 0; x < 5; x++) {\n\t // Mix column lanes\n\t var tMsw = 0, tLsw = 0;\n\t for (var y = 0; y < 5; y++) {\n\t var lane = state[x + 5 * y];\n\t tMsw ^= lane.high;\n\t tLsw ^= lane.low;\n\t }\n\n\t // Temporary values\n\t var Tx = T[x];\n\t Tx.high = tMsw;\n\t Tx.low = tLsw;\n\t }\n\t for (var x = 0; x < 5; x++) {\n\t // Shortcuts\n\t var Tx4 = T[(x + 4) % 5];\n\t var Tx1 = T[(x + 1) % 5];\n\t var Tx1Msw = Tx1.high;\n\t var Tx1Lsw = Tx1.low;\n\n\t // Mix surrounding columns\n\t var tMsw = Tx4.high ^ ((Tx1Msw << 1) | (Tx1Lsw >>> 31));\n\t var tLsw = Tx4.low ^ ((Tx1Lsw << 1) | (Tx1Msw >>> 31));\n\t for (var y = 0; y < 5; y++) {\n\t var lane = state[x + 5 * y];\n\t lane.high ^= tMsw;\n\t lane.low ^= tLsw;\n\t }\n\t }\n\n\t // Rho Pi\n\t for (var laneIndex = 1; laneIndex < 25; laneIndex++) {\n\t // Shortcuts\n\t var lane = state[laneIndex];\n\t var laneMsw = lane.high;\n\t var laneLsw = lane.low;\n\t var rhoOffset = RHO_OFFSETS[laneIndex];\n\n\t // Rotate lanes\n\t if (rhoOffset < 32) {\n\t var tMsw = (laneMsw << rhoOffset) | (laneLsw >>> (32 - rhoOffset));\n\t var tLsw = (laneLsw << rhoOffset) | (laneMsw >>> (32 - rhoOffset));\n\t } else /* if (rhoOffset >= 32) */ {\n\t var tMsw = (laneLsw << (rhoOffset - 32)) | (laneMsw >>> (64 - rhoOffset));\n\t var tLsw = (laneMsw << (rhoOffset - 32)) | (laneLsw >>> (64 - rhoOffset));\n\t }\n\n\t // Transpose lanes\n\t var TPiLane = T[PI_INDEXES[laneIndex]];\n\t TPiLane.high = tMsw;\n\t TPiLane.low = tLsw;\n\t }\n\n\t // Rho pi at x = y = 0\n\t var T0 = T[0];\n\t var state0 = state[0];\n\t T0.high = state0.high;\n\t T0.low = state0.low;\n\n\t // Chi\n\t for (var x = 0; x < 5; x++) {\n\t for (var y = 0; y < 5; y++) {\n\t // Shortcuts\n\t var laneIndex = x + 5 * y;\n\t var lane = state[laneIndex];\n\t var TLane = T[laneIndex];\n\t var Tx1Lane = T[((x + 1) % 5) + 5 * y];\n\t var Tx2Lane = T[((x + 2) % 5) + 5 * y];\n\n\t // Mix rows\n\t lane.high = TLane.high ^ (~Tx1Lane.high & Tx2Lane.high);\n\t lane.low = TLane.low ^ (~Tx1Lane.low & Tx2Lane.low);\n\t }\n\t }\n\n\t // Iota\n\t var lane = state[0];\n\t var roundConstant = ROUND_CONSTANTS[round];\n\t lane.high ^= roundConstant.high;\n\t lane.low ^= roundConstant.low;;\n\t }\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\t var blockSizeBits = this.blockSize * 32;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x1 << (24 - nBitsLeft % 32);\n\t dataWords[((Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits) >>> 5) - 1] |= 0x80;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Shortcuts\n\t var state = this._state;\n\t var outputLengthBytes = this.cfg.outputLength / 8;\n\t var outputLengthLanes = outputLengthBytes / 8;\n\n\t // Squeeze\n\t var hashWords = [];\n\t for (var i = 0; i < outputLengthLanes; i++) {\n\t // Shortcuts\n\t var lane = state[i];\n\t var laneMsw = lane.high;\n\t var laneLsw = lane.low;\n\n\t // Swap endian\n\t laneMsw = (\n\t (((laneMsw << 8) | (laneMsw >>> 24)) & 0x00ff00ff) |\n\t (((laneMsw << 24) | (laneMsw >>> 8)) & 0xff00ff00)\n\t );\n\t laneLsw = (\n\t (((laneLsw << 8) | (laneLsw >>> 24)) & 0x00ff00ff) |\n\t (((laneLsw << 24) | (laneLsw >>> 8)) & 0xff00ff00)\n\t );\n\n\t // Squeeze state to retrieve hash\n\t hashWords.push(laneLsw);\n\t hashWords.push(laneMsw);\n\t }\n\n\t // Return final computed hash\n\t return new WordArray.init(hashWords, outputLengthBytes);\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\n\t var state = clone._state = this._state.slice(0);\n\t for (var i = 0; i < 25; i++) {\n\t state[i] = state[i].clone();\n\t }\n\n\t return clone;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA3('message');\n\t * var hash = CryptoJS.SHA3(wordArray);\n\t */\n\t C.SHA3 = Hasher._createHelper(SHA3);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA3(message, key);\n\t */\n\t C.HmacSHA3 = Hasher._createHmacHelper(SHA3);\n\t}(Math));\n\n\n\treturn CryptoJS.SHA3;\n\n}));\n},{\"./core\":38,\"./x64-core\":69}],66:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./x64-core\"), _dereq_(\"./sha512\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./x64-core\", \"./sha512\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_x64 = C.x64;\n\t var X64Word = C_x64.Word;\n\t var X64WordArray = C_x64.WordArray;\n\t var C_algo = C.algo;\n\t var SHA512 = C_algo.SHA512;\n\n\t /**\n\t * SHA-384 hash algorithm.\n\t */\n\t var SHA384 = C_algo.SHA384 = SHA512.extend({\n\t _doReset: function () {\n\t this._hash = new X64WordArray.init([\n\t new X64Word.init(0xcbbb9d5d, 0xc1059ed8), new X64Word.init(0x629a292a, 0x367cd507),\n\t new X64Word.init(0x9159015a, 0x3070dd17), new X64Word.init(0x152fecd8, 0xf70e5939),\n\t new X64Word.init(0x67332667, 0xffc00b31), new X64Word.init(0x8eb44a87, 0x68581511),\n\t new X64Word.init(0xdb0c2e0d, 0x64f98fa7), new X64Word.init(0x47b5481d, 0xbefa4fa4)\n\t ]);\n\t },\n\n\t _doFinalize: function () {\n\t var hash = SHA512._doFinalize.call(this);\n\n\t hash.sigBytes -= 16;\n\n\t return hash;\n\t }\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA384('message');\n\t * var hash = CryptoJS.SHA384(wordArray);\n\t */\n\t C.SHA384 = SHA512._createHelper(SHA384);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA384(message, key);\n\t */\n\t C.HmacSHA384 = SHA512._createHmacHelper(SHA384);\n\t}());\n\n\n\treturn CryptoJS.SHA384;\n\n}));\n},{\"./core\":38,\"./sha512\":67,\"./x64-core\":69}],67:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./x64-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./x64-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Hasher = C_lib.Hasher;\n\t var C_x64 = C.x64;\n\t var X64Word = C_x64.Word;\n\t var X64WordArray = C_x64.WordArray;\n\t var C_algo = C.algo;\n\n\t function X64Word_create() {\n\t return X64Word.create.apply(X64Word, arguments);\n\t }\n\n\t // Constants\n\t var K = [\n\t X64Word_create(0x428a2f98, 0xd728ae22), X64Word_create(0x71374491, 0x23ef65cd),\n\t X64Word_create(0xb5c0fbcf, 0xec4d3b2f), X64Word_create(0xe9b5dba5, 0x8189dbbc),\n\t X64Word_create(0x3956c25b, 0xf348b538), X64Word_create(0x59f111f1, 0xb605d019),\n\t X64Word_create(0x923f82a4, 0xaf194f9b), X64Word_create(0xab1c5ed5, 0xda6d8118),\n\t X64Word_create(0xd807aa98, 0xa3030242), X64Word_create(0x12835b01, 0x45706fbe),\n\t X64Word_create(0x243185be, 0x4ee4b28c), X64Word_create(0x550c7dc3, 0xd5ffb4e2),\n\t X64Word_create(0x72be5d74, 0xf27b896f), X64Word_create(0x80deb1fe, 0x3b1696b1),\n\t X64Word_create(0x9bdc06a7, 0x25c71235), X64Word_create(0xc19bf174, 0xcf692694),\n\t X64Word_create(0xe49b69c1, 0x9ef14ad2), X64Word_create(0xefbe4786, 0x384f25e3),\n\t X64Word_create(0x0fc19dc6, 0x8b8cd5b5), X64Word_create(0x240ca1cc, 0x77ac9c65),\n\t X64Word_create(0x2de92c6f, 0x592b0275), X64Word_create(0x4a7484aa, 0x6ea6e483),\n\t X64Word_create(0x5cb0a9dc, 0xbd41fbd4), X64Word_create(0x76f988da, 0x831153b5),\n\t X64Word_create(0x983e5152, 0xee66dfab), X64Word_create(0xa831c66d, 0x2db43210),\n\t X64Word_create(0xb00327c8, 0x98fb213f), X64Word_create(0xbf597fc7, 0xbeef0ee4),\n\t X64Word_create(0xc6e00bf3, 0x3da88fc2), X64Word_create(0xd5a79147, 0x930aa725),\n\t X64Word_create(0x06ca6351, 0xe003826f), X64Word_create(0x14292967, 0x0a0e6e70),\n\t X64Word_create(0x27b70a85, 0x46d22ffc), X64Word_create(0x2e1b2138, 0x5c26c926),\n\t X64Word_create(0x4d2c6dfc, 0x5ac42aed), X64Word_create(0x53380d13, 0x9d95b3df),\n\t X64Word_create(0x650a7354, 0x8baf63de), X64Word_create(0x766a0abb, 0x3c77b2a8),\n\t X64Word_create(0x81c2c92e, 0x47edaee6), X64Word_create(0x92722c85, 0x1482353b),\n\t X64Word_create(0xa2bfe8a1, 0x4cf10364), X64Word_create(0xa81a664b, 0xbc423001),\n\t X64Word_create(0xc24b8b70, 0xd0f89791), X64Word_create(0xc76c51a3, 0x0654be30),\n\t X64Word_create(0xd192e819, 0xd6ef5218), X64Word_create(0xd6990624, 0x5565a910),\n\t X64Word_create(0xf40e3585, 0x5771202a), X64Word_create(0x106aa070, 0x32bbd1b8),\n\t X64Word_create(0x19a4c116, 0xb8d2d0c8), X64Word_create(0x1e376c08, 0x5141ab53),\n\t X64Word_create(0x2748774c, 0xdf8eeb99), X64Word_create(0x34b0bcb5, 0xe19b48a8),\n\t X64Word_create(0x391c0cb3, 0xc5c95a63), X64Word_create(0x4ed8aa4a, 0xe3418acb),\n\t X64Word_create(0x5b9cca4f, 0x7763e373), X64Word_create(0x682e6ff3, 0xd6b2b8a3),\n\t X64Word_create(0x748f82ee, 0x5defb2fc), X64Word_create(0x78a5636f, 0x43172f60),\n\t X64Word_create(0x84c87814, 0xa1f0ab72), X64Word_create(0x8cc70208, 0x1a6439ec),\n\t X64Word_create(0x90befffa, 0x23631e28), X64Word_create(0xa4506ceb, 0xde82bde9),\n\t X64Word_create(0xbef9a3f7, 0xb2c67915), X64Word_create(0xc67178f2, 0xe372532b),\n\t X64Word_create(0xca273ece, 0xea26619c), X64Word_create(0xd186b8c7, 0x21c0c207),\n\t X64Word_create(0xeada7dd6, 0xcde0eb1e), X64Word_create(0xf57d4f7f, 0xee6ed178),\n\t X64Word_create(0x06f067aa, 0x72176fba), X64Word_create(0x0a637dc5, 0xa2c898a6),\n\t X64Word_create(0x113f9804, 0xbef90dae), X64Word_create(0x1b710b35, 0x131c471b),\n\t X64Word_create(0x28db77f5, 0x23047d84), X64Word_create(0x32caab7b, 0x40c72493),\n\t X64Word_create(0x3c9ebe0a, 0x15c9bebc), X64Word_create(0x431d67c4, 0x9c100d4c),\n\t X64Word_create(0x4cc5d4be, 0xcb3e42b6), X64Word_create(0x597f299c, 0xfc657e2a),\n\t X64Word_create(0x5fcb6fab, 0x3ad6faec), X64Word_create(0x6c44198c, 0x4a475817)\n\t ];\n\n\t // Reusable objects\n\t var W = [];\n\t (function () {\n\t for (var i = 0; i < 80; i++) {\n\t W[i] = X64Word_create();\n\t }\n\t }());\n\n\t /**\n\t * SHA-512 hash algorithm.\n\t */\n\t var SHA512 = C_algo.SHA512 = Hasher.extend({\n\t _doReset: function () {\n\t this._hash = new X64WordArray.init([\n\t new X64Word.init(0x6a09e667, 0xf3bcc908), new X64Word.init(0xbb67ae85, 0x84caa73b),\n\t new X64Word.init(0x3c6ef372, 0xfe94f82b), new X64Word.init(0xa54ff53a, 0x5f1d36f1),\n\t new X64Word.init(0x510e527f, 0xade682d1), new X64Word.init(0x9b05688c, 0x2b3e6c1f),\n\t new X64Word.init(0x1f83d9ab, 0xfb41bd6b), new X64Word.init(0x5be0cd19, 0x137e2179)\n\t ]);\n\t },\n\n\t _doProcessBlock: function (M, offset) {\n\t // Shortcuts\n\t var H = this._hash.words;\n\n\t var H0 = H[0];\n\t var H1 = H[1];\n\t var H2 = H[2];\n\t var H3 = H[3];\n\t var H4 = H[4];\n\t var H5 = H[5];\n\t var H6 = H[6];\n\t var H7 = H[7];\n\n\t var H0h = H0.high;\n\t var H0l = H0.low;\n\t var H1h = H1.high;\n\t var H1l = H1.low;\n\t var H2h = H2.high;\n\t var H2l = H2.low;\n\t var H3h = H3.high;\n\t var H3l = H3.low;\n\t var H4h = H4.high;\n\t var H4l = H4.low;\n\t var H5h = H5.high;\n\t var H5l = H5.low;\n\t var H6h = H6.high;\n\t var H6l = H6.low;\n\t var H7h = H7.high;\n\t var H7l = H7.low;\n\n\t // Working variables\n\t var ah = H0h;\n\t var al = H0l;\n\t var bh = H1h;\n\t var bl = H1l;\n\t var ch = H2h;\n\t var cl = H2l;\n\t var dh = H3h;\n\t var dl = H3l;\n\t var eh = H4h;\n\t var el = H4l;\n\t var fh = H5h;\n\t var fl = H5l;\n\t var gh = H6h;\n\t var gl = H6l;\n\t var hh = H7h;\n\t var hl = H7l;\n\n\t // Rounds\n\t for (var i = 0; i < 80; i++) {\n\t // Shortcut\n\t var Wi = W[i];\n\n\t // Extend message\n\t if (i < 16) {\n\t var Wih = Wi.high = M[offset + i * 2] | 0;\n\t var Wil = Wi.low = M[offset + i * 2 + 1] | 0;\n\t } else {\n\t // Gamma0\n\t var gamma0x = W[i - 15];\n\t var gamma0xh = gamma0x.high;\n\t var gamma0xl = gamma0x.low;\n\t var gamma0h = ((gamma0xh >>> 1) | (gamma0xl << 31)) ^ ((gamma0xh >>> 8) | (gamma0xl << 24)) ^ (gamma0xh >>> 7);\n\t var gamma0l = ((gamma0xl >>> 1) | (gamma0xh << 31)) ^ ((gamma0xl >>> 8) | (gamma0xh << 24)) ^ ((gamma0xl >>> 7) | (gamma0xh << 25));\n\n\t // Gamma1\n\t var gamma1x = W[i - 2];\n\t var gamma1xh = gamma1x.high;\n\t var gamma1xl = gamma1x.low;\n\t var gamma1h = ((gamma1xh >>> 19) | (gamma1xl << 13)) ^ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^ (gamma1xh >>> 6);\n\t var gamma1l = ((gamma1xl >>> 19) | (gamma1xh << 13)) ^ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^ ((gamma1xl >>> 6) | (gamma1xh << 26));\n\n\t // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n\t var Wi7 = W[i - 7];\n\t var Wi7h = Wi7.high;\n\t var Wi7l = Wi7.low;\n\n\t var Wi16 = W[i - 16];\n\t var Wi16h = Wi16.high;\n\t var Wi16l = Wi16.low;\n\n\t var Wil = gamma0l + Wi7l;\n\t var Wih = gamma0h + Wi7h + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0);\n\t var Wil = Wil + gamma1l;\n\t var Wih = Wih + gamma1h + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0);\n\t var Wil = Wil + Wi16l;\n\t var Wih = Wih + Wi16h + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0);\n\n\t Wi.high = Wih;\n\t Wi.low = Wil;\n\t }\n\n\t var chh = (eh & fh) ^ (~eh & gh);\n\t var chl = (el & fl) ^ (~el & gl);\n\t var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);\n\t var majl = (al & bl) ^ (al & cl) ^ (bl & cl);\n\n\t var sigma0h = ((ah >>> 28) | (al << 4)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));\n\t var sigma0l = ((al >>> 28) | (ah << 4)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));\n\t var sigma1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9));\n\t var sigma1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9));\n\n\t // t1 = h + sigma1 + ch + K[i] + W[i]\n\t var Ki = K[i];\n\t var Kih = Ki.high;\n\t var Kil = Ki.low;\n\n\t var t1l = hl + sigma1l;\n\t var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);\n\t var t1l = t1l + chl;\n\t var t1h = t1h + chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);\n\t var t1l = t1l + Kil;\n\t var t1h = t1h + Kih + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0);\n\t var t1l = t1l + Wil;\n\t var t1h = t1h + Wih + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0);\n\n\t // t2 = sigma0 + maj\n\t var t2l = sigma0l + majl;\n\t var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);\n\n\t // Update working variables\n\t hh = gh;\n\t hl = gl;\n\t gh = fh;\n\t gl = fl;\n\t fh = eh;\n\t fl = el;\n\t el = (dl + t1l) | 0;\n\t eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;\n\t dh = ch;\n\t dl = cl;\n\t ch = bh;\n\t cl = bl;\n\t bh = ah;\n\t bl = al;\n\t al = (t1l + t2l) | 0;\n\t ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;\n\t }\n\n\t // Intermediate hash value\n\t H0l = H0.low = (H0l + al);\n\t H0.high = (H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0));\n\t H1l = H1.low = (H1l + bl);\n\t H1.high = (H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0));\n\t H2l = H2.low = (H2l + cl);\n\t H2.high = (H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0));\n\t H3l = H3.low = (H3l + dl);\n\t H3.high = (H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0));\n\t H4l = H4.low = (H4l + el);\n\t H4.high = (H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0));\n\t H5l = H5.low = (H5l + fl);\n\t H5.high = (H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0));\n\t H6l = H6.low = (H6l + gl);\n\t H6.high = (H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0));\n\t H7l = H7.low = (H7l + hl);\n\t H7.high = (H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0));\n\t },\n\n\t _doFinalize: function () {\n\t // Shortcuts\n\t var data = this._data;\n\t var dataWords = data.words;\n\n\t var nBitsTotal = this._nDataBytes * 8;\n\t var nBitsLeft = data.sigBytes * 8;\n\n\t // Add padding\n\t dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);\n\t dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 30] = Math.floor(nBitsTotal / 0x100000000);\n\t dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 31] = nBitsTotal;\n\t data.sigBytes = dataWords.length * 4;\n\n\t // Hash final blocks\n\t this._process();\n\n\t // Convert hash to 32-bit word array before returning\n\t var hash = this._hash.toX32();\n\n\t // Return final computed hash\n\t return hash;\n\t },\n\n\t clone: function () {\n\t var clone = Hasher.clone.call(this);\n\t clone._hash = this._hash.clone();\n\n\t return clone;\n\t },\n\n\t blockSize: 1024/32\n\t });\n\n\t /**\n\t * Shortcut function to the hasher's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t *\n\t * @return {WordArray} The hash.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hash = CryptoJS.SHA512('message');\n\t * var hash = CryptoJS.SHA512(wordArray);\n\t */\n\t C.SHA512 = Hasher._createHelper(SHA512);\n\n\t /**\n\t * Shortcut function to the HMAC's object interface.\n\t *\n\t * @param {WordArray|string} message The message to hash.\n\t * @param {WordArray|string} key The secret key.\n\t *\n\t * @return {WordArray} The HMAC.\n\t *\n\t * @static\n\t *\n\t * @example\n\t *\n\t * var hmac = CryptoJS.HmacSHA512(message, key);\n\t */\n\t C.HmacSHA512 = Hasher._createHmacHelper(SHA512);\n\t}());\n\n\n\treturn CryptoJS.SHA512;\n\n}));\n},{\"./core\":38,\"./x64-core\":69}],68:[function(_dereq_,module,exports){\n;(function (root, factory, undef) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"), _dereq_(\"./enc-base64\"), _dereq_(\"./md5\"), _dereq_(\"./evpkdf\"), _dereq_(\"./cipher-core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\", \"./enc-base64\", \"./md5\", \"./evpkdf\", \"./cipher-core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function () {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var WordArray = C_lib.WordArray;\n\t var BlockCipher = C_lib.BlockCipher;\n\t var C_algo = C.algo;\n\n\t // Permuted Choice 1 constants\n\t var PC1 = [\n\t 57, 49, 41, 33, 25, 17, 9, 1,\n\t 58, 50, 42, 34, 26, 18, 10, 2,\n\t 59, 51, 43, 35, 27, 19, 11, 3,\n\t 60, 52, 44, 36, 63, 55, 47, 39,\n\t 31, 23, 15, 7, 62, 54, 46, 38,\n\t 30, 22, 14, 6, 61, 53, 45, 37,\n\t 29, 21, 13, 5, 28, 20, 12, 4\n\t ];\n\n\t // Permuted Choice 2 constants\n\t var PC2 = [\n\t 14, 17, 11, 24, 1, 5,\n\t 3, 28, 15, 6, 21, 10,\n\t 23, 19, 12, 4, 26, 8,\n\t 16, 7, 27, 20, 13, 2,\n\t 41, 52, 31, 37, 47, 55,\n\t 30, 40, 51, 45, 33, 48,\n\t 44, 49, 39, 56, 34, 53,\n\t 46, 42, 50, 36, 29, 32\n\t ];\n\n\t // Cumulative bit shift constants\n\t var BIT_SHIFTS = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28];\n\n\t // SBOXes and round permutation constants\n\t var SBOX_P = [\n\t {\n\t 0x0: 0x808200,\n\t 0x10000000: 0x8000,\n\t 0x20000000: 0x808002,\n\t 0x30000000: 0x2,\n\t 0x40000000: 0x200,\n\t 0x50000000: 0x808202,\n\t 0x60000000: 0x800202,\n\t 0x70000000: 0x800000,\n\t 0x80000000: 0x202,\n\t 0x90000000: 0x800200,\n\t 0xa0000000: 0x8200,\n\t 0xb0000000: 0x808000,\n\t 0xc0000000: 0x8002,\n\t 0xd0000000: 0x800002,\n\t 0xe0000000: 0x0,\n\t 0xf0000000: 0x8202,\n\t 0x8000000: 0x0,\n\t 0x18000000: 0x808202,\n\t 0x28000000: 0x8202,\n\t 0x38000000: 0x8000,\n\t 0x48000000: 0x808200,\n\t 0x58000000: 0x200,\n\t 0x68000000: 0x808002,\n\t 0x78000000: 0x2,\n\t 0x88000000: 0x800200,\n\t 0x98000000: 0x8200,\n\t 0xa8000000: 0x808000,\n\t 0xb8000000: 0x800202,\n\t 0xc8000000: 0x800002,\n\t 0xd8000000: 0x8002,\n\t 0xe8000000: 0x202,\n\t 0xf8000000: 0x800000,\n\t 0x1: 0x8000,\n\t 0x10000001: 0x2,\n\t 0x20000001: 0x808200,\n\t 0x30000001: 0x800000,\n\t 0x40000001: 0x808002,\n\t 0x50000001: 0x8200,\n\t 0x60000001: 0x200,\n\t 0x70000001: 0x800202,\n\t 0x80000001: 0x808202,\n\t 0x90000001: 0x808000,\n\t 0xa0000001: 0x800002,\n\t 0xb0000001: 0x8202,\n\t 0xc0000001: 0x202,\n\t 0xd0000001: 0x800200,\n\t 0xe0000001: 0x8002,\n\t 0xf0000001: 0x0,\n\t 0x8000001: 0x808202,\n\t 0x18000001: 0x808000,\n\t 0x28000001: 0x800000,\n\t 0x38000001: 0x200,\n\t 0x48000001: 0x8000,\n\t 0x58000001: 0x800002,\n\t 0x68000001: 0x2,\n\t 0x78000001: 0x8202,\n\t 0x88000001: 0x8002,\n\t 0x98000001: 0x800202,\n\t 0xa8000001: 0x202,\n\t 0xb8000001: 0x808200,\n\t 0xc8000001: 0x800200,\n\t 0xd8000001: 0x0,\n\t 0xe8000001: 0x8200,\n\t 0xf8000001: 0x808002\n\t },\n\t {\n\t 0x0: 0x40084010,\n\t 0x1000000: 0x4000,\n\t 0x2000000: 0x80000,\n\t 0x3000000: 0x40080010,\n\t 0x4000000: 0x40000010,\n\t 0x5000000: 0x40084000,\n\t 0x6000000: 0x40004000,\n\t 0x7000000: 0x10,\n\t 0x8000000: 0x84000,\n\t 0x9000000: 0x40004010,\n\t 0xa000000: 0x40000000,\n\t 0xb000000: 0x84010,\n\t 0xc000000: 0x80010,\n\t 0xd000000: 0x0,\n\t 0xe000000: 0x4010,\n\t 0xf000000: 0x40080000,\n\t 0x800000: 0x40004000,\n\t 0x1800000: 0x84010,\n\t 0x2800000: 0x10,\n\t 0x3800000: 0x40004010,\n\t 0x4800000: 0x40084010,\n\t 0x5800000: 0x40000000,\n\t 0x6800000: 0x80000,\n\t 0x7800000: 0x40080010,\n\t 0x8800000: 0x80010,\n\t 0x9800000: 0x0,\n\t 0xa800000: 0x4000,\n\t 0xb800000: 0x40080000,\n\t 0xc800000: 0x40000010,\n\t 0xd800000: 0x84000,\n\t 0xe800000: 0x40084000,\n\t 0xf800000: 0x4010,\n\t 0x10000000: 0x0,\n\t 0x11000000: 0x40080010,\n\t 0x12000000: 0x40004010,\n\t 0x13000000: 0x40084000,\n\t 0x14000000: 0x40080000,\n\t 0x15000000: 0x10,\n\t 0x16000000: 0x84010,\n\t 0x17000000: 0x4000,\n\t 0x18000000: 0x4010,\n\t 0x19000000: 0x80000,\n\t 0x1a000000: 0x80010,\n\t 0x1b000000: 0x40000010,\n\t 0x1c000000: 0x84000,\n\t 0x1d000000: 0x40004000,\n\t 0x1e000000: 0x40000000,\n\t 0x1f000000: 0x40084010,\n\t 0x10800000: 0x84010,\n\t 0x11800000: 0x80000,\n\t 0x12800000: 0x40080000,\n\t 0x13800000: 0x4000,\n\t 0x14800000: 0x40004000,\n\t 0x15800000: 0x40084010,\n\t 0x16800000: 0x10,\n\t 0x17800000: 0x40000000,\n\t 0x18800000: 0x40084000,\n\t 0x19800000: 0x40000010,\n\t 0x1a800000: 0x40004010,\n\t 0x1b800000: 0x80010,\n\t 0x1c800000: 0x0,\n\t 0x1d800000: 0x4010,\n\t 0x1e800000: 0x40080010,\n\t 0x1f800000: 0x84000\n\t },\n\t {\n\t 0x0: 0x104,\n\t 0x100000: 0x0,\n\t 0x200000: 0x4000100,\n\t 0x300000: 0x10104,\n\t 0x400000: 0x10004,\n\t 0x500000: 0x4000004,\n\t 0x600000: 0x4010104,\n\t 0x700000: 0x4010000,\n\t 0x800000: 0x4000000,\n\t 0x900000: 0x4010100,\n\t 0xa00000: 0x10100,\n\t 0xb00000: 0x4010004,\n\t 0xc00000: 0x4000104,\n\t 0xd00000: 0x10000,\n\t 0xe00000: 0x4,\n\t 0xf00000: 0x100,\n\t 0x80000: 0x4010100,\n\t 0x180000: 0x4010004,\n\t 0x280000: 0x0,\n\t 0x380000: 0x4000100,\n\t 0x480000: 0x4000004,\n\t 0x580000: 0x10000,\n\t 0x680000: 0x10004,\n\t 0x780000: 0x104,\n\t 0x880000: 0x4,\n\t 0x980000: 0x100,\n\t 0xa80000: 0x4010000,\n\t 0xb80000: 0x10104,\n\t 0xc80000: 0x10100,\n\t 0xd80000: 0x4000104,\n\t 0xe80000: 0x4010104,\n\t 0xf80000: 0x4000000,\n\t 0x1000000: 0x4010100,\n\t 0x1100000: 0x10004,\n\t 0x1200000: 0x10000,\n\t 0x1300000: 0x4000100,\n\t 0x1400000: 0x100,\n\t 0x1500000: 0x4010104,\n\t 0x1600000: 0x4000004,\n\t 0x1700000: 0x0,\n\t 0x1800000: 0x4000104,\n\t 0x1900000: 0x4000000,\n\t 0x1a00000: 0x4,\n\t 0x1b00000: 0x10100,\n\t 0x1c00000: 0x4010000,\n\t 0x1d00000: 0x104,\n\t 0x1e00000: 0x10104,\n\t 0x1f00000: 0x4010004,\n\t 0x1080000: 0x4000000,\n\t 0x1180000: 0x104,\n\t 0x1280000: 0x4010100,\n\t 0x1380000: 0x0,\n\t 0x1480000: 0x10004,\n\t 0x1580000: 0x4000100,\n\t 0x1680000: 0x100,\n\t 0x1780000: 0x4010004,\n\t 0x1880000: 0x10000,\n\t 0x1980000: 0x4010104,\n\t 0x1a80000: 0x10104,\n\t 0x1b80000: 0x4000004,\n\t 0x1c80000: 0x4000104,\n\t 0x1d80000: 0x4010000,\n\t 0x1e80000: 0x4,\n\t 0x1f80000: 0x10100\n\t },\n\t {\n\t 0x0: 0x80401000,\n\t 0x10000: 0x80001040,\n\t 0x20000: 0x401040,\n\t 0x30000: 0x80400000,\n\t 0x40000: 0x0,\n\t 0x50000: 0x401000,\n\t 0x60000: 0x80000040,\n\t 0x70000: 0x400040,\n\t 0x80000: 0x80000000,\n\t 0x90000: 0x400000,\n\t 0xa0000: 0x40,\n\t 0xb0000: 0x80001000,\n\t 0xc0000: 0x80400040,\n\t 0xd0000: 0x1040,\n\t 0xe0000: 0x1000,\n\t 0xf0000: 0x80401040,\n\t 0x8000: 0x80001040,\n\t 0x18000: 0x40,\n\t 0x28000: 0x80400040,\n\t 0x38000: 0x80001000,\n\t 0x48000: 0x401000,\n\t 0x58000: 0x80401040,\n\t 0x68000: 0x0,\n\t 0x78000: 0x80400000,\n\t 0x88000: 0x1000,\n\t 0x98000: 0x80401000,\n\t 0xa8000: 0x400000,\n\t 0xb8000: 0x1040,\n\t 0xc8000: 0x80000000,\n\t 0xd8000: 0x400040,\n\t 0xe8000: 0x401040,\n\t 0xf8000: 0x80000040,\n\t 0x100000: 0x400040,\n\t 0x110000: 0x401000,\n\t 0x120000: 0x80000040,\n\t 0x130000: 0x0,\n\t 0x140000: 0x1040,\n\t 0x150000: 0x80400040,\n\t 0x160000: 0x80401000,\n\t 0x170000: 0x80001040,\n\t 0x180000: 0x80401040,\n\t 0x190000: 0x80000000,\n\t 0x1a0000: 0x80400000,\n\t 0x1b0000: 0x401040,\n\t 0x1c0000: 0x80001000,\n\t 0x1d0000: 0x400000,\n\t 0x1e0000: 0x40,\n\t 0x1f0000: 0x1000,\n\t 0x108000: 0x80400000,\n\t 0x118000: 0x80401040,\n\t 0x128000: 0x0,\n\t 0x138000: 0x401000,\n\t 0x148000: 0x400040,\n\t 0x158000: 0x80000000,\n\t 0x168000: 0x80001040,\n\t 0x178000: 0x40,\n\t 0x188000: 0x80000040,\n\t 0x198000: 0x1000,\n\t 0x1a8000: 0x80001000,\n\t 0x1b8000: 0x80400040,\n\t 0x1c8000: 0x1040,\n\t 0x1d8000: 0x80401000,\n\t 0x1e8000: 0x400000,\n\t 0x1f8000: 0x401040\n\t },\n\t {\n\t 0x0: 0x80,\n\t 0x1000: 0x1040000,\n\t 0x2000: 0x40000,\n\t 0x3000: 0x20000000,\n\t 0x4000: 0x20040080,\n\t 0x5000: 0x1000080,\n\t 0x6000: 0x21000080,\n\t 0x7000: 0x40080,\n\t 0x8000: 0x1000000,\n\t 0x9000: 0x20040000,\n\t 0xa000: 0x20000080,\n\t 0xb000: 0x21040080,\n\t 0xc000: 0x21040000,\n\t 0xd000: 0x0,\n\t 0xe000: 0x1040080,\n\t 0xf000: 0x21000000,\n\t 0x800: 0x1040080,\n\t 0x1800: 0x21000080,\n\t 0x2800: 0x80,\n\t 0x3800: 0x1040000,\n\t 0x4800: 0x40000,\n\t 0x5800: 0x20040080,\n\t 0x6800: 0x21040000,\n\t 0x7800: 0x20000000,\n\t 0x8800: 0x20040000,\n\t 0x9800: 0x0,\n\t 0xa800: 0x21040080,\n\t 0xb800: 0x1000080,\n\t 0xc800: 0x20000080,\n\t 0xd800: 0x21000000,\n\t 0xe800: 0x1000000,\n\t 0xf800: 0x40080,\n\t 0x10000: 0x40000,\n\t 0x11000: 0x80,\n\t 0x12000: 0x20000000,\n\t 0x13000: 0x21000080,\n\t 0x14000: 0x1000080,\n\t 0x15000: 0x21040000,\n\t 0x16000: 0x20040080,\n\t 0x17000: 0x1000000,\n\t 0x18000: 0x21040080,\n\t 0x19000: 0x21000000,\n\t 0x1a000: 0x1040000,\n\t 0x1b000: 0x20040000,\n\t 0x1c000: 0x40080,\n\t 0x1d000: 0x20000080,\n\t 0x1e000: 0x0,\n\t 0x1f000: 0x1040080,\n\t 0x10800: 0x21000080,\n\t 0x11800: 0x1000000,\n\t 0x12800: 0x1040000,\n\t 0x13800: 0x20040080,\n\t 0x14800: 0x20000000,\n\t 0x15800: 0x1040080,\n\t 0x16800: 0x80,\n\t 0x17800: 0x21040000,\n\t 0x18800: 0x40080,\n\t 0x19800: 0x21040080,\n\t 0x1a800: 0x0,\n\t 0x1b800: 0x21000000,\n\t 0x1c800: 0x1000080,\n\t 0x1d800: 0x40000,\n\t 0x1e800: 0x20040000,\n\t 0x1f800: 0x20000080\n\t },\n\t {\n\t 0x0: 0x10000008,\n\t 0x100: 0x2000,\n\t 0x200: 0x10200000,\n\t 0x300: 0x10202008,\n\t 0x400: 0x10002000,\n\t 0x500: 0x200000,\n\t 0x600: 0x200008,\n\t 0x700: 0x10000000,\n\t 0x800: 0x0,\n\t 0x900: 0x10002008,\n\t 0xa00: 0x202000,\n\t 0xb00: 0x8,\n\t 0xc00: 0x10200008,\n\t 0xd00: 0x202008,\n\t 0xe00: 0x2008,\n\t 0xf00: 0x10202000,\n\t 0x80: 0x10200000,\n\t 0x180: 0x10202008,\n\t 0x280: 0x8,\n\t 0x380: 0x200000,\n\t 0x480: 0x202008,\n\t 0x580: 0x10000008,\n\t 0x680: 0x10002000,\n\t 0x780: 0x2008,\n\t 0x880: 0x200008,\n\t 0x980: 0x2000,\n\t 0xa80: 0x10002008,\n\t 0xb80: 0x10200008,\n\t 0xc80: 0x0,\n\t 0xd80: 0x10202000,\n\t 0xe80: 0x202000,\n\t 0xf80: 0x10000000,\n\t 0x1000: 0x10002000,\n\t 0x1100: 0x10200008,\n\t 0x1200: 0x10202008,\n\t 0x1300: 0x2008,\n\t 0x1400: 0x200000,\n\t 0x1500: 0x10000000,\n\t 0x1600: 0x10000008,\n\t 0x1700: 0x202000,\n\t 0x1800: 0x202008,\n\t 0x1900: 0x0,\n\t 0x1a00: 0x8,\n\t 0x1b00: 0x10200000,\n\t 0x1c00: 0x2000,\n\t 0x1d00: 0x10002008,\n\t 0x1e00: 0x10202000,\n\t 0x1f00: 0x200008,\n\t 0x1080: 0x8,\n\t 0x1180: 0x202000,\n\t 0x1280: 0x200000,\n\t 0x1380: 0x10000008,\n\t 0x1480: 0x10002000,\n\t 0x1580: 0x2008,\n\t 0x1680: 0x10202008,\n\t 0x1780: 0x10200000,\n\t 0x1880: 0x10202000,\n\t 0x1980: 0x10200008,\n\t 0x1a80: 0x2000,\n\t 0x1b80: 0x202008,\n\t 0x1c80: 0x200008,\n\t 0x1d80: 0x0,\n\t 0x1e80: 0x10000000,\n\t 0x1f80: 0x10002008\n\t },\n\t {\n\t 0x0: 0x100000,\n\t 0x10: 0x2000401,\n\t 0x20: 0x400,\n\t 0x30: 0x100401,\n\t 0x40: 0x2100401,\n\t 0x50: 0x0,\n\t 0x60: 0x1,\n\t 0x70: 0x2100001,\n\t 0x80: 0x2000400,\n\t 0x90: 0x100001,\n\t 0xa0: 0x2000001,\n\t 0xb0: 0x2100400,\n\t 0xc0: 0x2100000,\n\t 0xd0: 0x401,\n\t 0xe0: 0x100400,\n\t 0xf0: 0x2000000,\n\t 0x8: 0x2100001,\n\t 0x18: 0x0,\n\t 0x28: 0x2000401,\n\t 0x38: 0x2100400,\n\t 0x48: 0x100000,\n\t 0x58: 0x2000001,\n\t 0x68: 0x2000000,\n\t 0x78: 0x401,\n\t 0x88: 0x100401,\n\t 0x98: 0x2000400,\n\t 0xa8: 0x2100000,\n\t 0xb8: 0x100001,\n\t 0xc8: 0x400,\n\t 0xd8: 0x2100401,\n\t 0xe8: 0x1,\n\t 0xf8: 0x100400,\n\t 0x100: 0x2000000,\n\t 0x110: 0x100000,\n\t 0x120: 0x2000401,\n\t 0x130: 0x2100001,\n\t 0x140: 0x100001,\n\t 0x150: 0x2000400,\n\t 0x160: 0x2100400,\n\t 0x170: 0x100401,\n\t 0x180: 0x401,\n\t 0x190: 0x2100401,\n\t 0x1a0: 0x100400,\n\t 0x1b0: 0x1,\n\t 0x1c0: 0x0,\n\t 0x1d0: 0x2100000,\n\t 0x1e0: 0x2000001,\n\t 0x1f0: 0x400,\n\t 0x108: 0x100400,\n\t 0x118: 0x2000401,\n\t 0x128: 0x2100001,\n\t 0x138: 0x1,\n\t 0x148: 0x2000000,\n\t 0x158: 0x100000,\n\t 0x168: 0x401,\n\t 0x178: 0x2100400,\n\t 0x188: 0x2000001,\n\t 0x198: 0x2100000,\n\t 0x1a8: 0x0,\n\t 0x1b8: 0x2100401,\n\t 0x1c8: 0x100401,\n\t 0x1d8: 0x400,\n\t 0x1e8: 0x2000400,\n\t 0x1f8: 0x100001\n\t },\n\t {\n\t 0x0: 0x8000820,\n\t 0x1: 0x20000,\n\t 0x2: 0x8000000,\n\t 0x3: 0x20,\n\t 0x4: 0x20020,\n\t 0x5: 0x8020820,\n\t 0x6: 0x8020800,\n\t 0x7: 0x800,\n\t 0x8: 0x8020000,\n\t 0x9: 0x8000800,\n\t 0xa: 0x20800,\n\t 0xb: 0x8020020,\n\t 0xc: 0x820,\n\t 0xd: 0x0,\n\t 0xe: 0x8000020,\n\t 0xf: 0x20820,\n\t 0x80000000: 0x800,\n\t 0x80000001: 0x8020820,\n\t 0x80000002: 0x8000820,\n\t 0x80000003: 0x8000000,\n\t 0x80000004: 0x8020000,\n\t 0x80000005: 0x20800,\n\t 0x80000006: 0x20820,\n\t 0x80000007: 0x20,\n\t 0x80000008: 0x8000020,\n\t 0x80000009: 0x820,\n\t 0x8000000a: 0x20020,\n\t 0x8000000b: 0x8020800,\n\t 0x8000000c: 0x0,\n\t 0x8000000d: 0x8020020,\n\t 0x8000000e: 0x8000800,\n\t 0x8000000f: 0x20000,\n\t 0x10: 0x20820,\n\t 0x11: 0x8020800,\n\t 0x12: 0x20,\n\t 0x13: 0x800,\n\t 0x14: 0x8000800,\n\t 0x15: 0x8000020,\n\t 0x16: 0x8020020,\n\t 0x17: 0x20000,\n\t 0x18: 0x0,\n\t 0x19: 0x20020,\n\t 0x1a: 0x8020000,\n\t 0x1b: 0x8000820,\n\t 0x1c: 0x8020820,\n\t 0x1d: 0x20800,\n\t 0x1e: 0x820,\n\t 0x1f: 0x8000000,\n\t 0x80000010: 0x20000,\n\t 0x80000011: 0x800,\n\t 0x80000012: 0x8020020,\n\t 0x80000013: 0x20820,\n\t 0x80000014: 0x20,\n\t 0x80000015: 0x8020000,\n\t 0x80000016: 0x8000000,\n\t 0x80000017: 0x8000820,\n\t 0x80000018: 0x8020820,\n\t 0x80000019: 0x8000020,\n\t 0x8000001a: 0x8000800,\n\t 0x8000001b: 0x0,\n\t 0x8000001c: 0x20800,\n\t 0x8000001d: 0x820,\n\t 0x8000001e: 0x20020,\n\t 0x8000001f: 0x8020800\n\t }\n\t ];\n\n\t // Masks that select the SBOX input\n\t var SBOX_MASK = [\n\t 0xf8000001, 0x1f800000, 0x01f80000, 0x001f8000,\n\t 0x0001f800, 0x00001f80, 0x000001f8, 0x8000001f\n\t ];\n\n\t /**\n\t * DES block cipher algorithm.\n\t */\n\t var DES = C_algo.DES = BlockCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var key = this._key;\n\t var keyWords = key.words;\n\n\t // Select 56 bits according to PC1\n\t var keyBits = [];\n\t for (var i = 0; i < 56; i++) {\n\t var keyBitPos = PC1[i] - 1;\n\t keyBits[i] = (keyWords[keyBitPos >>> 5] >>> (31 - keyBitPos % 32)) & 1;\n\t }\n\n\t // Assemble 16 subkeys\n\t var subKeys = this._subKeys = [];\n\t for (var nSubKey = 0; nSubKey < 16; nSubKey++) {\n\t // Create subkey\n\t var subKey = subKeys[nSubKey] = [];\n\n\t // Shortcut\n\t var bitShift = BIT_SHIFTS[nSubKey];\n\n\t // Select 48 bits according to PC2\n\t for (var i = 0; i < 24; i++) {\n\t // Select from the left 28 key bits\n\t subKey[(i / 6) | 0] |= keyBits[((PC2[i] - 1) + bitShift) % 28] << (31 - i % 6);\n\n\t // Select from the right 28 key bits\n\t subKey[4 + ((i / 6) | 0)] |= keyBits[28 + (((PC2[i + 24] - 1) + bitShift) % 28)] << (31 - i % 6);\n\t }\n\n\t // Since each subkey is applied to an expanded 32-bit input,\n\t // the subkey can be broken into 8 values scaled to 32-bits,\n\t // which allows the key to be used without expansion\n\t subKey[0] = (subKey[0] << 1) | (subKey[0] >>> 31);\n\t for (var i = 1; i < 7; i++) {\n\t subKey[i] = subKey[i] >>> ((i - 1) * 4 + 3);\n\t }\n\t subKey[7] = (subKey[7] << 5) | (subKey[7] >>> 27);\n\t }\n\n\t // Compute inverse subkeys\n\t var invSubKeys = this._invSubKeys = [];\n\t for (var i = 0; i < 16; i++) {\n\t invSubKeys[i] = subKeys[15 - i];\n\t }\n\t },\n\n\t encryptBlock: function (M, offset) {\n\t this._doCryptBlock(M, offset, this._subKeys);\n\t },\n\n\t decryptBlock: function (M, offset) {\n\t this._doCryptBlock(M, offset, this._invSubKeys);\n\t },\n\n\t _doCryptBlock: function (M, offset, subKeys) {\n\t // Get input\n\t this._lBlock = M[offset];\n\t this._rBlock = M[offset + 1];\n\n\t // Initial permutation\n\t exchangeLR.call(this, 4, 0x0f0f0f0f);\n\t exchangeLR.call(this, 16, 0x0000ffff);\n\t exchangeRL.call(this, 2, 0x33333333);\n\t exchangeRL.call(this, 8, 0x00ff00ff);\n\t exchangeLR.call(this, 1, 0x55555555);\n\n\t // Rounds\n\t for (var round = 0; round < 16; round++) {\n\t // Shortcuts\n\t var subKey = subKeys[round];\n\t var lBlock = this._lBlock;\n\t var rBlock = this._rBlock;\n\n\t // Feistel function\n\t var f = 0;\n\t for (var i = 0; i < 8; i++) {\n\t f |= SBOX_P[i][((rBlock ^ subKey[i]) & SBOX_MASK[i]) >>> 0];\n\t }\n\t this._lBlock = rBlock;\n\t this._rBlock = lBlock ^ f;\n\t }\n\n\t // Undo swap from last round\n\t var t = this._lBlock;\n\t this._lBlock = this._rBlock;\n\t this._rBlock = t;\n\n\t // Final permutation\n\t exchangeLR.call(this, 1, 0x55555555);\n\t exchangeRL.call(this, 8, 0x00ff00ff);\n\t exchangeRL.call(this, 2, 0x33333333);\n\t exchangeLR.call(this, 16, 0x0000ffff);\n\t exchangeLR.call(this, 4, 0x0f0f0f0f);\n\n\t // Set output\n\t M[offset] = this._lBlock;\n\t M[offset + 1] = this._rBlock;\n\t },\n\n\t keySize: 64/32,\n\n\t ivSize: 64/32,\n\n\t blockSize: 64/32\n\t });\n\n\t // Swap bits across the left and right words\n\t function exchangeLR(offset, mask) {\n\t var t = ((this._lBlock >>> offset) ^ this._rBlock) & mask;\n\t this._rBlock ^= t;\n\t this._lBlock ^= t << offset;\n\t }\n\n\t function exchangeRL(offset, mask) {\n\t var t = ((this._rBlock >>> offset) ^ this._lBlock) & mask;\n\t this._lBlock ^= t;\n\t this._rBlock ^= t << offset;\n\t }\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.DES.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.DES.decrypt(ciphertext, key, cfg);\n\t */\n\t C.DES = BlockCipher._createHelper(DES);\n\n\t /**\n\t * Triple-DES block cipher algorithm.\n\t */\n\t var TripleDES = C_algo.TripleDES = BlockCipher.extend({\n\t _doReset: function () {\n\t // Shortcuts\n\t var key = this._key;\n\t var keyWords = key.words;\n\n\t // Create DES instances\n\t this._des1 = DES.createEncryptor(WordArray.create(keyWords.slice(0, 2)));\n\t this._des2 = DES.createEncryptor(WordArray.create(keyWords.slice(2, 4)));\n\t this._des3 = DES.createEncryptor(WordArray.create(keyWords.slice(4, 6)));\n\t },\n\n\t encryptBlock: function (M, offset) {\n\t this._des1.encryptBlock(M, offset);\n\t this._des2.decryptBlock(M, offset);\n\t this._des3.encryptBlock(M, offset);\n\t },\n\n\t decryptBlock: function (M, offset) {\n\t this._des3.decryptBlock(M, offset);\n\t this._des2.encryptBlock(M, offset);\n\t this._des1.decryptBlock(M, offset);\n\t },\n\n\t keySize: 192/32,\n\n\t ivSize: 64/32,\n\n\t blockSize: 64/32\n\t });\n\n\t /**\n\t * Shortcut functions to the cipher's object interface.\n\t *\n\t * @example\n\t *\n\t * var ciphertext = CryptoJS.TripleDES.encrypt(message, key, cfg);\n\t * var plaintext = CryptoJS.TripleDES.decrypt(ciphertext, key, cfg);\n\t */\n\t C.TripleDES = BlockCipher._createHelper(TripleDES);\n\t}());\n\n\n\treturn CryptoJS.TripleDES;\n\n}));\n},{\"./cipher-core\":37,\"./core\":38,\"./enc-base64\":39,\"./evpkdf\":41,\"./md5\":46}],69:[function(_dereq_,module,exports){\n;(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(_dereq_(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var X32WordArray = C_lib.WordArray;\n\n\t /**\n\t * x64 namespace.\n\t */\n\t var C_x64 = C.x64 = {};\n\n\t /**\n\t * A 64-bit word.\n\t */\n\t var X64Word = C_x64.Word = Base.extend({\n\t /**\n\t * Initializes a newly created 64-bit word.\n\t *\n\t * @param {number} high The high 32 bits.\n\t * @param {number} low The low 32 bits.\n\t *\n\t * @example\n\t *\n\t * var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);\n\t */\n\t init: function (high, low) {\n\t this.high = high;\n\t this.low = low;\n\t }\n\n\t /**\n\t * Bitwise NOTs this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after negating.\n\t *\n\t * @example\n\t *\n\t * var negated = x64Word.not();\n\t */\n\t // not: function () {\n\t // var high = ~this.high;\n\t // var low = ~this.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise ANDs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to AND with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after ANDing.\n\t *\n\t * @example\n\t *\n\t * var anded = x64Word.and(anotherX64Word);\n\t */\n\t // and: function (word) {\n\t // var high = this.high & word.high;\n\t // var low = this.low & word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise ORs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to OR with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after ORing.\n\t *\n\t * @example\n\t *\n\t * var ored = x64Word.or(anotherX64Word);\n\t */\n\t // or: function (word) {\n\t // var high = this.high | word.high;\n\t // var low = this.low | word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise XORs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to XOR with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after XORing.\n\t *\n\t * @example\n\t *\n\t * var xored = x64Word.xor(anotherX64Word);\n\t */\n\t // xor: function (word) {\n\t // var high = this.high ^ word.high;\n\t // var low = this.low ^ word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Shifts this word n bits to the left.\n\t *\n\t * @param {number} n The number of bits to shift.\n\t *\n\t * @return {X64Word} A new x64-Word object after shifting.\n\t *\n\t * @example\n\t *\n\t * var shifted = x64Word.shiftL(25);\n\t */\n\t // shiftL: function (n) {\n\t // if (n < 32) {\n\t // var high = (this.high << n) | (this.low >>> (32 - n));\n\t // var low = this.low << n;\n\t // } else {\n\t // var high = this.low << (n - 32);\n\t // var low = 0;\n\t // }\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Shifts this word n bits to the right.\n\t *\n\t * @param {number} n The number of bits to shift.\n\t *\n\t * @return {X64Word} A new x64-Word object after shifting.\n\t *\n\t * @example\n\t *\n\t * var shifted = x64Word.shiftR(7);\n\t */\n\t // shiftR: function (n) {\n\t // if (n < 32) {\n\t // var low = (this.low >>> n) | (this.high << (32 - n));\n\t // var high = this.high >>> n;\n\t // } else {\n\t // var low = this.high >>> (n - 32);\n\t // var high = 0;\n\t // }\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Rotates this word n bits to the left.\n\t *\n\t * @param {number} n The number of bits to rotate.\n\t *\n\t * @return {X64Word} A new x64-Word object after rotating.\n\t *\n\t * @example\n\t *\n\t * var rotated = x64Word.rotL(25);\n\t */\n\t // rotL: function (n) {\n\t // return this.shiftL(n).or(this.shiftR(64 - n));\n\t // },\n\n\t /**\n\t * Rotates this word n bits to the right.\n\t *\n\t * @param {number} n The number of bits to rotate.\n\t *\n\t * @return {X64Word} A new x64-Word object after rotating.\n\t *\n\t * @example\n\t *\n\t * var rotated = x64Word.rotR(7);\n\t */\n\t // rotR: function (n) {\n\t // return this.shiftR(n).or(this.shiftL(64 - n));\n\t // },\n\n\t /**\n\t * Adds this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to add with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after adding.\n\t *\n\t * @example\n\t *\n\t * var added = x64Word.add(anotherX64Word);\n\t */\n\t // add: function (word) {\n\t // var low = (this.low + word.low) | 0;\n\t // var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;\n\t // var high = (this.high + word.high + carry) | 0;\n\n\t // return X64Word.create(high, low);\n\t // }\n\t });\n\n\t /**\n\t * An array of 64-bit words.\n\t *\n\t * @property {Array} words The array of CryptoJS.x64.Word objects.\n\t * @property {number} sigBytes The number of significant bytes in this word array.\n\t */\n\t var X64WordArray = C_x64.WordArray = Base.extend({\n\t /**\n\t * Initializes a newly created word array.\n\t *\n\t * @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.\n\t * @param {number} sigBytes (Optional) The number of significant bytes in the words.\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create();\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create([\n\t * CryptoJS.x64.Word.create(0x00010203, 0x04050607),\n\t * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)\n\t * ]);\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create([\n\t * CryptoJS.x64.Word.create(0x00010203, 0x04050607),\n\t * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)\n\t * ], 10);\n\t */\n\t init: function (words, sigBytes) {\n\t words = this.words = words || [];\n\n\t if (sigBytes != undefined) {\n\t this.sigBytes = sigBytes;\n\t } else {\n\t this.sigBytes = words.length * 8;\n\t }\n\t },\n\n\t /**\n\t * Converts this 64-bit word array to a 32-bit word array.\n\t *\n\t * @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.\n\t *\n\t * @example\n\t *\n\t * var x32WordArray = x64WordArray.toX32();\n\t */\n\t toX32: function () {\n\t // Shortcuts\n\t var x64Words = this.words;\n\t var x64WordsLength = x64Words.length;\n\n\t // Convert\n\t var x32Words = [];\n\t for (var i = 0; i < x64WordsLength; i++) {\n\t var x64Word = x64Words[i];\n\t x32Words.push(x64Word.high);\n\t x32Words.push(x64Word.low);\n\t }\n\n\t return X32WordArray.create(x32Words, this.sigBytes);\n\t },\n\n\t /**\n\t * Creates a copy of this word array.\n\t *\n\t * @return {X64WordArray} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = x64WordArray.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\n\t // Clone \"words\" array\n\t var words = clone.words = this.words.slice(0);\n\n\t // Clone each X64Word object\n\t var wordsLength = words.length;\n\t for (var i = 0; i < wordsLength; i++) {\n\t words[i] = words[i].clone();\n\t }\n\n\t return clone;\n\t }\n\t });\n\t}());\n\n\n\treturn CryptoJS;\n\n}));\n},{\"./core\":38}],70:[function(_dereq_,module,exports){\n// shim for using process in browser\n\nvar process = module.exports = {};\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = setTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n clearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n setTimeout(drainQueue, 0);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n},{}],71:[function(_dereq_,module,exports){\n(function (process,global){\n/*!\n localForage -- Offline Storage, Improved\n Version 1.3.0\n https://mozilla.github.io/localForage\n (c) 2013-2015 Mozilla, Apache License 2.0\n*/\n(function() {\nvar define, requireModule, _dereq_, requirejs;\n\n(function() {\n var registry = {}, seen = {};\n\n define = function(name, deps, callback) {\n registry[name] = { deps: deps, callback: callback };\n };\n\n requirejs = _dereq_ = requireModule = function(name) {\n requirejs._eak_seen = registry;\n\n if (seen[name]) { return seen[name]; }\n seen[name] = {};\n\n if (!registry[name]) {\n throw new Error(\"Could not find module \" + name);\n }\n\n var mod = registry[name],\n deps = mod.deps,\n callback = mod.callback,\n reified = [],\n exports;\n\n for (var i=0, l=deps.length; i<l; i++) {\n if (deps[i] === 'exports') {\n reified.push(exports = {});\n } else {\n reified.push(requireModule(resolve(deps[i])));\n }\n }\n\n var value = callback.apply(this, reified);\n return seen[name] = exports || value;\n\n function resolve(child) {\n if (child.charAt(0) !== '.') { return child; }\n var parts = child.split(\"/\");\n var parentBase = name.split(\"/\").slice(0, -1);\n\n for (var i=0, l=parts.length; i<l; i++) {\n var part = parts[i];\n\n if (part === '..') { parentBase.pop(); }\n else if (part === '.') { continue; }\n else { parentBase.push(part); }\n }\n\n return parentBase.join(\"/\");\n }\n };\n})();\n\ndefine(\"promise/all\", \n [\"./utils\",\"exports\"],\n function(__dependency1__, __exports__) {\n \"use strict\";\n /* global toString */\n\n var isArray = __dependency1__.isArray;\n var isFunction = __dependency1__.isFunction;\n\n /**\n Returns a promise that is fulfilled when all the given promises have been\n fulfilled, or rejected if any of them become rejected. The return promise\n is fulfilled with an array that gives all the values in the order they were\n passed in the `promises` array argument.\n\n Example:\n\n ```javascript\n var promise1 = RSVP.resolve(1);\n var promise2 = RSVP.resolve(2);\n var promise3 = RSVP.resolve(3);\n var promises = [ promise1, promise2, promise3 ];\n\n RSVP.all(promises).then(function(array){\n // The array here would be [ 1, 2, 3 ];\n });\n ```\n\n If any of the `promises` given to `RSVP.all` are rejected, the first promise\n that is rejected will be given as an argument to the returned promises's\n rejection handler. For example:\n\n Example:\n\n ```javascript\n var promise1 = RSVP.resolve(1);\n var promise2 = RSVP.reject(new Error(\"2\"));\n var promise3 = RSVP.reject(new Error(\"3\"));\n var promises = [ promise1, promise2, promise3 ];\n\n RSVP.all(promises).then(function(array){\n // Code here never runs because there are rejected promises!\n }, function(error) {\n // error.message === \"2\"\n });\n ```\n\n @method all\n @for RSVP\n @param {Array} promises\n @param {String} label\n @return {Promise} promise that is fulfilled when all `promises` have been\n fulfilled, or rejected if any of them become rejected.\n */\n function all(promises) {\n /*jshint validthis:true */\n var Promise = this;\n\n if (!isArray(promises)) {\n throw new TypeError('You must pass an array to all.');\n }\n\n return new Promise(function(resolve, reject) {\n var results = [], remaining = promises.length,\n promise;\n\n if (remaining === 0) {\n resolve([]);\n }\n\n function resolver(index) {\n return function(value) {\n resolveAll(index, value);\n };\n }\n\n function resolveAll(index, value) {\n results[index] = value;\n if (--remaining === 0) {\n resolve(results);\n }\n }\n\n for (var i = 0; i < promises.length; i++) {\n promise = promises[i];\n\n if (promise && isFunction(promise.then)) {\n promise.then(resolver(i), reject);\n } else {\n resolveAll(i, promise);\n }\n }\n });\n }\n\n __exports__.all = all;\n });\ndefine(\"promise/asap\", \n [\"exports\"],\n function(__exports__) {\n \"use strict\";\n var browserGlobal = (typeof window !== 'undefined') ? window : {};\n var BrowserMutationObserver = browserGlobal.MutationObserver || browserGlobal.WebKitMutationObserver;\n var local = (typeof global !== 'undefined') ? global : (this === undefined? window:this);\n\n // node\n function useNextTick() {\n return function() {\n process.nextTick(flush);\n };\n }\n\n function useMutationObserver() {\n var iterations = 0;\n var observer = new BrowserMutationObserver(flush);\n var node = document.createTextNode('');\n observer.observe(node, { characterData: true });\n\n return function() {\n node.data = (iterations = ++iterations % 2);\n };\n }\n\n function useSetTimeout() {\n return function() {\n local.setTimeout(flush, 1);\n };\n }\n\n var queue = [];\n function flush() {\n for (var i = 0; i < queue.length; i++) {\n var tuple = queue[i];\n var callback = tuple[0], arg = tuple[1];\n callback(arg);\n }\n queue = [];\n }\n\n var scheduleFlush;\n\n // Decide what async method to use to triggering processing of queued callbacks:\n if (typeof process !== 'undefined' && {}.toString.call(process) === '[object process]') {\n scheduleFlush = useNextTick();\n } else if (BrowserMutationObserver) {\n scheduleFlush = useMutationObserver();\n } else {\n scheduleFlush = useSetTimeout();\n }\n\n function asap(callback, arg) {\n var length = queue.push([callback, arg]);\n if (length === 1) {\n // If length is 1, that means that we need to schedule an async flush.\n // If additional callbacks are queued before the queue is flushed, they\n // will be processed by this flush that we are scheduling.\n scheduleFlush();\n }\n }\n\n __exports__.asap = asap;\n });\ndefine(\"promise/config\", \n [\"exports\"],\n function(__exports__) {\n \"use strict\";\n var config = {\n instrument: false\n };\n\n function configure(name, value) {\n if (arguments.length === 2) {\n config[name] = value;\n } else {\n return config[name];\n }\n }\n\n __exports__.config = config;\n __exports__.configure = configure;\n });\ndefine(\"promise/polyfill\", \n [\"./promise\",\"./utils\",\"exports\"],\n function(__dependency1__, __dependency2__, __exports__) {\n \"use strict\";\n /*global self*/\n var RSVPPromise = __dependency1__.Promise;\n var isFunction = __dependency2__.isFunction;\n\n function polyfill() {\n var local;\n\n if (typeof global !== 'undefined') {\n local = global;\n } else if (typeof window !== 'undefined' && window.document) {\n local = window;\n } else {\n local = self;\n }\n\n var es6PromiseSupport = \n \"Promise\" in local &&\n // Some of these methods are missing from\n // Firefox/Chrome experimental implementations\n \"resolve\" in local.Promise &&\n \"reject\" in local.Promise &&\n \"all\" in local.Promise &&\n \"race\" in local.Promise &&\n // Older version of the spec had a resolver object\n // as the arg rather than a function\n (function() {\n var resolve;\n new local.Promise(function(r) { resolve = r; });\n return isFunction(resolve);\n }());\n\n if (!es6PromiseSupport) {\n local.Promise = RSVPPromise;\n }\n }\n\n __exports__.polyfill = polyfill;\n });\ndefine(\"promise/promise\", \n [\"./config\",\"./utils\",\"./all\",\"./race\",\"./resolve\",\"./reject\",\"./asap\",\"exports\"],\n function(__dependency1__, __dependency2__, __dependency3__, __dependency4__, __dependency5__, __dependency6__, __dependency7__, __exports__) {\n \"use strict\";\n var config = __dependency1__.config;\n var configure = __dependency1__.configure;\n var objectOrFunction = __dependency2__.objectOrFunction;\n var isFunction = __dependency2__.isFunction;\n var now = __dependency2__.now;\n var all = __dependency3__.all;\n var race = __dependency4__.race;\n var staticResolve = __dependency5__.resolve;\n var staticReject = __dependency6__.reject;\n var asap = __dependency7__.asap;\n\n var counter = 0;\n\n config.async = asap; // default async is asap;\n\n function Promise(resolver) {\n if (!isFunction(resolver)) {\n throw new TypeError('You must pass a resolver function as the first argument to the promise constructor');\n }\n\n if (!(this instanceof Promise)) {\n throw new TypeError(\"Failed to construct 'Promise': Please use the 'new' operator, this object constructor cannot be called as a function.\");\n }\n\n this._subscribers = [];\n\n invokeResolver(resolver, this);\n }\n\n function invokeResolver(resolver, promise) {\n function resolvePromise(value) {\n resolve(promise, value);\n }\n\n function rejectPromise(reason) {\n reject(promise, reason);\n }\n\n try {\n resolver(resolvePromise, rejectPromise);\n } catch(e) {\n rejectPromise(e);\n }\n }\n\n function invokeCallback(settled, promise, callback, detail) {\n var hasCallback = isFunction(callback),\n value, error, succeeded, failed;\n\n if (hasCallback) {\n try {\n value = callback(detail);\n succeeded = true;\n } catch(e) {\n failed = true;\n error = e;\n }\n } else {\n value = detail;\n succeeded = true;\n }\n\n if (handleThenable(promise, value)) {\n return;\n } else if (hasCallback && succeeded) {\n resolve(promise, value);\n } else if (failed) {\n reject(promise, error);\n } else if (settled === FULFILLED) {\n resolve(promise, value);\n } else if (settled === REJECTED) {\n reject(promise, value);\n }\n }\n\n var PENDING = void 0;\n var SEALED = 0;\n var FULFILLED = 1;\n var REJECTED = 2;\n\n function subscribe(parent, child, onFulfillment, onRejection) {\n var subscribers = parent._subscribers;\n var length = subscribers.length;\n\n subscribers[length] = child;\n subscribers[length + FULFILLED] = onFulfillment;\n subscribers[length + REJECTED] = onRejection;\n }\n\n function publish(promise, settled) {\n var child, callback, subscribers = promise._subscribers, detail = promise._detail;\n\n for (var i = 0; i < subscribers.length; i += 3) {\n child = subscribers[i];\n callback = subscribers[i + settled];\n\n invokeCallback(settled, child, callback, detail);\n }\n\n promise._subscribers = null;\n }\n\n Promise.prototype = {\n constructor: Promise,\n\n _state: undefined,\n _detail: undefined,\n _subscribers: undefined,\n\n then: function(onFulfillment, onRejection) {\n var promise = this;\n\n var thenPromise = new this.constructor(function() {});\n\n if (this._state) {\n var callbacks = arguments;\n config.async(function invokePromiseCallback() {\n invokeCallback(promise._state, thenPromise, callbacks[promise._state - 1], promise._detail);\n });\n } else {\n subscribe(this, thenPromise, onFulfillment, onRejection);\n }\n\n return thenPromise;\n },\n\n 'catch': function(onRejection) {\n return this.then(null, onRejection);\n }\n };\n\n Promise.all = all;\n Promise.race = race;\n Promise.resolve = staticResolve;\n Promise.reject = staticReject;\n\n function handleThenable(promise, value) {\n var then = null,\n resolved;\n\n try {\n if (promise === value) {\n throw new TypeError(\"A promises callback cannot return that same promise.\");\n }\n\n if (objectOrFunction(value)) {\n then = value.then;\n\n if (isFunction(then)) {\n then.call(value, function(val) {\n if (resolved) { return true; }\n resolved = true;\n\n if (value !== val) {\n resolve(promise, val);\n } else {\n fulfill(promise, val);\n }\n }, function(val) {\n if (resolved) { return true; }\n resolved = true;\n\n reject(promise, val);\n });\n\n return true;\n }\n }\n } catch (error) {\n if (resolved) { return true; }\n reject(promise, error);\n return true;\n }\n\n return false;\n }\n\n function resolve(promise, value) {\n if (promise === value) {\n fulfill(promise, value);\n } else if (!handleThenable(promise, value)) {\n fulfill(promise, value);\n }\n }\n\n function fulfill(promise, value) {\n if (promise._state !== PENDING) { return; }\n promise._state = SEALED;\n promise._detail = value;\n\n config.async(publishFulfillment, promise);\n }\n\n function reject(promise, reason) {\n if (promise._state !== PENDING) { return; }\n promise._state = SEALED;\n promise._detail = reason;\n\n config.async(publishRejection, promise);\n }\n\n function publishFulfillment(promise) {\n publish(promise, promise._state = FULFILLED);\n }\n\n function publishRejection(promise) {\n publish(promise, promise._state = REJECTED);\n }\n\n __exports__.Promise = Promise;\n });\ndefine(\"promise/race\", \n [\"./utils\",\"exports\"],\n function(__dependency1__, __exports__) {\n \"use strict\";\n /* global toString */\n var isArray = __dependency1__.isArray;\n\n /**\n `RSVP.race` allows you to watch a series of promises and act as soon as the\n first promise given to the `promises` argument fulfills or rejects.\n\n Example:\n\n ```javascript\n var promise1 = new RSVP.Promise(function(resolve, reject){\n setTimeout(function(){\n resolve(\"promise 1\");\n }, 200);\n });\n\n var promise2 = new RSVP.Promise(function(resolve, reject){\n setTimeout(function(){\n resolve(\"promise 2\");\n }, 100);\n });\n\n RSVP.race([promise1, promise2]).then(function(result){\n // result === \"promise 2\" because it was resolved before promise1\n // was resolved.\n });\n ```\n\n `RSVP.race` is deterministic in that only the state of the first completed\n promise matters. For example, even if other promises given to the `promises`\n array argument are resolved, but the first completed promise has become\n rejected before the other promises became fulfilled, the returned promise\n will become rejected:\n\n ```javascript\n var promise1 = new RSVP.Promise(function(resolve, reject){\n setTimeout(function(){\n resolve(\"promise 1\");\n }, 200);\n });\n\n var promise2 = new RSVP.Promise(function(resolve, reject){\n setTimeout(function(){\n reject(new Error(\"promise 2\"));\n }, 100);\n });\n\n RSVP.race([promise1, promise2]).then(function(result){\n // Code here never runs because there are rejected promises!\n }, function(reason){\n // reason.message === \"promise2\" because promise 2 became rejected before\n // promise 1 became fulfilled\n });\n ```\n\n @method race\n @for RSVP\n @param {Array} promises array of promises to observe\n @param {String} label optional string for describing the promise returned.\n Useful for tooling.\n @return {Promise} a promise that becomes fulfilled with the value the first\n completed promises is resolved with if the first completed promise was\n fulfilled, or rejected with the reason that the first completed promise\n was rejected with.\n */\n function race(promises) {\n /*jshint validthis:true */\n var Promise = this;\n\n if (!isArray(promises)) {\n throw new TypeError('You must pass an array to race.');\n }\n return new Promise(function(resolve, reject) {\n var results = [], promise;\n\n for (var i = 0; i < promises.length; i++) {\n promise = promises[i];\n\n if (promise && typeof promise.then === 'function') {\n promise.then(resolve, reject);\n } else {\n resolve(promise);\n }\n }\n });\n }\n\n __exports__.race = race;\n });\ndefine(\"promise/reject\", \n [\"exports\"],\n function(__exports__) {\n \"use strict\";\n /**\n `RSVP.reject` returns a promise that will become rejected with the passed\n `reason`. `RSVP.reject` is essentially shorthand for the following:\n\n ```javascript\n var promise = new RSVP.Promise(function(resolve, reject){\n reject(new Error('WHOOPS'));\n });\n\n promise.then(function(value){\n // Code here doesn't run because the promise is rejected!\n }, function(reason){\n // reason.message === 'WHOOPS'\n });\n ```\n\n Instead of writing the above, your code now simply becomes the following:\n\n ```javascript\n var promise = RSVP.reject(new Error('WHOOPS'));\n\n promise.then(function(value){\n // Code here doesn't run because the promise is rejected!\n }, function(reason){\n // reason.message === 'WHOOPS'\n });\n ```\n\n @method reject\n @for RSVP\n @param {Any} reason value that the returned promise will be rejected with.\n @param {String} label optional string for identifying the returned promise.\n Useful for tooling.\n @return {Promise} a promise that will become rejected with the given\n `reason`.\n */\n function reject(reason) {\n /*jshint validthis:true */\n var Promise = this;\n\n return new Promise(function (resolve, reject) {\n reject(reason);\n });\n }\n\n __exports__.reject = reject;\n });\ndefine(\"promise/resolve\", \n [\"exports\"],\n function(__exports__) {\n \"use strict\";\n function resolve(value) {\n /*jshint validthis:true */\n if (value && typeof value === 'object' && value.constructor === this) {\n return value;\n }\n\n var Promise = this;\n\n return new Promise(function(resolve) {\n resolve(value);\n });\n }\n\n __exports__.resolve = resolve;\n });\ndefine(\"promise/utils\", \n [\"exports\"],\n function(__exports__) {\n \"use strict\";\n function objectOrFunction(x) {\n return isFunction(x) || (typeof x === \"object\" && x !== null);\n }\n\n function isFunction(x) {\n return typeof x === \"function\";\n }\n\n function isArray(x) {\n return Object.prototype.toString.call(x) === \"[object Array]\";\n }\n\n // Date.now is not available in browsers < IE9\n // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/now#Compatibility\n var now = Date.now || function() { return new Date().getTime(); };\n\n\n __exports__.objectOrFunction = objectOrFunction;\n __exports__.isFunction = isFunction;\n __exports__.isArray = isArray;\n __exports__.now = now;\n });\nrequireModule('promise/polyfill').polyfill();\n}());(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"localforage\"] = factory();\n\telse\n\t\troot[\"localforage\"] = factory();\n})(this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId])\n/******/ \t\t\treturn installedModules[moduleId].exports;\n\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\texports: {},\n/******/ \t\t\tid: moduleId,\n/******/ \t\t\tloaded: false\n/******/ \t\t};\n\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.loaded = true;\n\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n\n\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(0);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t'use strict';\n\n\texports.__esModule = true;\n\n\tfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError('Cannot call a class as a function'); } }\n\n\t(function () {\n\t 'use strict';\n\n\t // Custom drivers are stored here when `defineDriver()` is called.\n\t // They are shared across all instances of localForage.\n\t var CustomDrivers = {};\n\n\t var DriverType = {\n\t INDEXEDDB: 'asyncStorage',\n\t LOCALSTORAGE: 'localStorageWrapper',\n\t WEBSQL: 'webSQLStorage'\n\t };\n\n\t var DefaultDriverOrder = [DriverType.INDEXEDDB, DriverType.WEBSQL, DriverType.LOCALSTORAGE];\n\n\t var LibraryMethods = ['clear', 'getItem', 'iterate', 'key', 'keys', 'length', 'removeItem', 'setItem'];\n\n\t var DefaultConfig = {\n\t description: '',\n\t driver: DefaultDriverOrder.slice(),\n\t name: 'localforage',\n\t // Default DB size is _JUST UNDER_ 5MB, as it's the highest size\n\t // we can use without a prompt.\n\t size: 4980736,\n\t storeName: 'keyvaluepairs',\n\t version: 1.0\n\t };\n\n\t // Check to see if IndexedDB is available and if it is the latest\n\t // implementation; it's our preferred backend library. We use \"_spec_test\"\n\t // as the name of the database because it's not the one we'll operate on,\n\t // but it's useful to make sure its using the right spec.\n\t // See: https://github.com/mozilla/localForage/issues/128\n\t var driverSupport = (function (self) {\n\t // Initialize IndexedDB; fall back to vendor-prefixed versions\n\t // if needed.\n\t var indexedDB = indexedDB || self.indexedDB || self.webkitIndexedDB || self.mozIndexedDB || self.OIndexedDB || self.msIndexedDB;\n\n\t var result = {};\n\n\t result[DriverType.WEBSQL] = !!self.openDatabase;\n\t result[DriverType.INDEXEDDB] = !!(function () {\n\t // We mimic PouchDB here; just UA test for Safari (which, as of\n\t // iOS 8/Yosemite, doesn't properly support IndexedDB).\n\t // IndexedDB support is broken and different from Blink's.\n\t // This is faster than the test case (and it's sync), so we just\n\t // do this. *SIGH*\n\t // http://bl.ocks.org/nolanlawson/raw/c83e9039edf2278047e9/\n\t //\n\t // We test for openDatabase because IE Mobile identifies itself\n\t // as Safari. Oh the lulz...\n\t if (typeof self.openDatabase !== 'undefined' && self.navigator && self.navigator.userAgent && /Safari/.test(self.navigator.userAgent) && !/Chrome/.test(self.navigator.userAgent)) {\n\t return false;\n\t }\n\t try {\n\t return indexedDB && typeof indexedDB.open === 'function' &&\n\t // Some Samsung/HTC Android 4.0-4.3 devices\n\t // have older IndexedDB specs; if this isn't available\n\t // their IndexedDB is too old for us to use.\n\t // (Replaces the onupgradeneeded test.)\n\t typeof self.IDBKeyRange !== 'undefined';\n\t } catch (e) {\n\t return false;\n\t }\n\t })();\n\n\t result[DriverType.LOCALSTORAGE] = !!(function () {\n\t try {\n\t return self.localStorage && 'setItem' in self.localStorage && self.localStorage.setItem;\n\t } catch (e) {\n\t return false;\n\t }\n\t })();\n\n\t return result;\n\t })(this);\n\n\t var isArray = Array.isArray || function (arg) {\n\t return Object.prototype.toString.call(arg) === '[object Array]';\n\t };\n\n\t function callWhenReady(localForageInstance, libraryMethod) {\n\t localForageInstance[libraryMethod] = function () {\n\t var _args = arguments;\n\t return localForageInstance.ready().then(function () {\n\t return localForageInstance[libraryMethod].apply(localForageInstance, _args);\n\t });\n\t };\n\t }\n\n\t function extend() {\n\t for (var i = 1; i < arguments.length; i++) {\n\t var arg = arguments[i];\n\n\t if (arg) {\n\t for (var key in arg) {\n\t if (arg.hasOwnProperty(key)) {\n\t if (isArray(arg[key])) {\n\t arguments[0][key] = arg[key].slice();\n\t } else {\n\t arguments[0][key] = arg[key];\n\t }\n\t }\n\t }\n\t }\n\t }\n\n\t return arguments[0];\n\t }\n\n\t function isLibraryDriver(driverName) {\n\t for (var driver in DriverType) {\n\t if (DriverType.hasOwnProperty(driver) && DriverType[driver] === driverName) {\n\t return true;\n\t }\n\t }\n\n\t return false;\n\t }\n\n\t var LocalForage = (function () {\n\t function LocalForage(options) {\n\t _classCallCheck(this, LocalForage);\n\n\t this.INDEXEDDB = DriverType.INDEXEDDB;\n\t this.LOCALSTORAGE = DriverType.LOCALSTORAGE;\n\t this.WEBSQL = DriverType.WEBSQL;\n\n\t this._defaultConfig = extend({}, DefaultConfig);\n\t this._config = extend({}, this._defaultConfig, options);\n\t this._driverSet = null;\n\t this._initDriver = null;\n\t this._ready = false;\n\t this._dbInfo = null;\n\n\t this._wrapLibraryMethodsWithReady();\n\t this.setDriver(this._config.driver);\n\t }\n\n\t // The actual localForage object that we expose as a module or via a\n\t // global. It's extended by pulling in one of our other libraries.\n\n\t // Set any config values for localForage; can be called anytime before\n\t // the first API call (e.g. `getItem`, `setItem`).\n\t // We loop through options so we don't overwrite existing config\n\t // values.\n\n\t LocalForage.prototype.config = function config(options) {\n\t // If the options argument is an object, we use it to set values.\n\t // Otherwise, we return either a specified config value or all\n\t // config values.\n\t if (typeof options === 'object') {\n\t // If localforage is ready and fully initialized, we can't set\n\t // any new configuration values. Instead, we return an error.\n\t if (this._ready) {\n\t return new Error(\"Can't call config() after localforage \" + 'has been used.');\n\t }\n\n\t for (var i in options) {\n\t if (i === 'storeName') {\n\t options[i] = options[i].replace(/\\W/g, '_');\n\t }\n\n\t this._config[i] = options[i];\n\t }\n\n\t // after all config options are set and\n\t // the driver option is used, try setting it\n\t if ('driver' in options && options.driver) {\n\t this.setDriver(this._config.driver);\n\t }\n\n\t return true;\n\t } else if (typeof options === 'string') {\n\t return this._config[options];\n\t } else {\n\t return this._config;\n\t }\n\t };\n\n\t // Used to define a custom driver, shared across all instances of\n\t // localForage.\n\n\t LocalForage.prototype.defineDriver = function defineDriver(driverObject, callback, errorCallback) {\n\t var promise = new Promise(function (resolve, reject) {\n\t try {\n\t var driverName = driverObject._driver;\n\t var complianceError = new Error('Custom driver not compliant; see ' + 'https://mozilla.github.io/localForage/#definedriver');\n\t var namingError = new Error('Custom driver name already in use: ' + driverObject._driver);\n\n\t // A driver name should be defined and not overlap with the\n\t // library-defined, default drivers.\n\t if (!driverObject._driver) {\n\t reject(complianceError);\n\t return;\n\t }\n\t if (isLibraryDriver(driverObject._driver)) {\n\t reject(namingError);\n\t return;\n\t }\n\n\t var customDriverMethods = LibraryMethods.concat('_initStorage');\n\t for (var i = 0; i < customDriverMethods.length; i++) {\n\t var customDriverMethod = customDriverMethods[i];\n\t if (!customDriverMethod || !driverObject[customDriverMethod] || typeof driverObject[customDriverMethod] !== 'function') {\n\t reject(complianceError);\n\t return;\n\t }\n\t }\n\n\t var supportPromise = Promise.resolve(true);\n\t if ('_support' in driverObject) {\n\t if (driverObject._support && typeof driverObject._support === 'function') {\n\t supportPromise = driverObject._support();\n\t } else {\n\t supportPromise = Promise.resolve(!!driverObject._support);\n\t }\n\t }\n\n\t supportPromise.then(function (supportResult) {\n\t driverSupport[driverName] = supportResult;\n\t CustomDrivers[driverName] = driverObject;\n\t resolve();\n\t }, reject);\n\t } catch (e) {\n\t reject(e);\n\t }\n\t });\n\n\t promise.then(callback, errorCallback);\n\t return promise;\n\t };\n\n\t LocalForage.prototype.driver = function driver() {\n\t return this._driver || null;\n\t };\n\n\t LocalForage.prototype.getDriver = function getDriver(driverName, callback, errorCallback) {\n\t var self = this;\n\t var getDriverPromise = (function () {\n\t if (isLibraryDriver(driverName)) {\n\t switch (driverName) {\n\t case self.INDEXEDDB:\n\t return new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(1));\n\t });\n\t case self.LOCALSTORAGE:\n\t return new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(2));\n\t });\n\t case self.WEBSQL:\n\t return new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(4));\n\t });\n\t }\n\t } else if (CustomDrivers[driverName]) {\n\t return Promise.resolve(CustomDrivers[driverName]);\n\t }\n\n\t return Promise.reject(new Error('Driver not found.'));\n\t })();\n\n\t getDriverPromise.then(callback, errorCallback);\n\t return getDriverPromise;\n\t };\n\n\t LocalForage.prototype.getSerializer = function getSerializer(callback) {\n\t var serializerPromise = new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(3));\n\t });\n\t if (callback && typeof callback === 'function') {\n\t serializerPromise.then(function (result) {\n\t callback(result);\n\t });\n\t }\n\t return serializerPromise;\n\t };\n\n\t LocalForage.prototype.ready = function ready(callback) {\n\t var self = this;\n\n\t var promise = self._driverSet.then(function () {\n\t if (self._ready === null) {\n\t self._ready = self._initDriver();\n\t }\n\n\t return self._ready;\n\t });\n\n\t promise.then(callback, callback);\n\t return promise;\n\t };\n\n\t LocalForage.prototype.setDriver = function setDriver(drivers, callback, errorCallback) {\n\t var self = this;\n\n\t if (!isArray(drivers)) {\n\t drivers = [drivers];\n\t }\n\n\t var supportedDrivers = this._getSupportedDrivers(drivers);\n\n\t function setDriverToConfig() {\n\t self._config.driver = self.driver();\n\t }\n\n\t function initDriver(supportedDrivers) {\n\t return function () {\n\t var currentDriverIndex = 0;\n\n\t function driverPromiseLoop() {\n\t while (currentDriverIndex < supportedDrivers.length) {\n\t var driverName = supportedDrivers[currentDriverIndex];\n\t currentDriverIndex++;\n\n\t self._dbInfo = null;\n\t self._ready = null;\n\n\t return self.getDriver(driverName).then(function (driver) {\n\t self._extend(driver);\n\t setDriverToConfig();\n\n\t self._ready = self._initStorage(self._config);\n\t return self._ready;\n\t })['catch'](driverPromiseLoop);\n\t }\n\n\t setDriverToConfig();\n\t var error = new Error('No available storage method found.');\n\t self._driverSet = Promise.reject(error);\n\t return self._driverSet;\n\t }\n\n\t return driverPromiseLoop();\n\t };\n\t }\n\n\t // There might be a driver initialization in progress\n\t // so wait for it to finish in order to avoid a possible\n\t // race condition to set _dbInfo\n\t var oldDriverSetDone = this._driverSet !== null ? this._driverSet['catch'](function () {\n\t return Promise.resolve();\n\t }) : Promise.resolve();\n\n\t this._driverSet = oldDriverSetDone.then(function () {\n\t var driverName = supportedDrivers[0];\n\t self._dbInfo = null;\n\t self._ready = null;\n\n\t return self.getDriver(driverName).then(function (driver) {\n\t self._driver = driver._driver;\n\t setDriverToConfig();\n\t self._wrapLibraryMethodsWithReady();\n\t self._initDriver = initDriver(supportedDrivers);\n\t });\n\t })['catch'](function () {\n\t setDriverToConfig();\n\t var error = new Error('No available storage method found.');\n\t self._driverSet = Promise.reject(error);\n\t return self._driverSet;\n\t });\n\n\t this._driverSet.then(callback, errorCallback);\n\t return this._driverSet;\n\t };\n\n\t LocalForage.prototype.supports = function supports(driverName) {\n\t return !!driverSupport[driverName];\n\t };\n\n\t LocalForage.prototype._extend = function _extend(libraryMethodsAndProperties) {\n\t extend(this, libraryMethodsAndProperties);\n\t };\n\n\t LocalForage.prototype._getSupportedDrivers = function _getSupportedDrivers(drivers) {\n\t var supportedDrivers = [];\n\t for (var i = 0, len = drivers.length; i < len; i++) {\n\t var driverName = drivers[i];\n\t if (this.supports(driverName)) {\n\t supportedDrivers.push(driverName);\n\t }\n\t }\n\t return supportedDrivers;\n\t };\n\n\t LocalForage.prototype._wrapLibraryMethodsWithReady = function _wrapLibraryMethodsWithReady() {\n\t // Add a stub for each driver API method that delays the call to the\n\t // corresponding driver method until localForage is ready. These stubs\n\t // will be replaced by the driver methods as soon as the driver is\n\t // loaded, so there is no performance impact.\n\t for (var i = 0; i < LibraryMethods.length; i++) {\n\t callWhenReady(this, LibraryMethods[i]);\n\t }\n\t };\n\n\t LocalForage.prototype.createInstance = function createInstance(options) {\n\t return new LocalForage(options);\n\t };\n\n\t return LocalForage;\n\t })();\n\n\t var localForage = new LocalForage();\n\n\t exports['default'] = localForage;\n\t}).call(typeof window !== 'undefined' ? window : self);\n\tmodule.exports = exports['default'];\n\n/***/ },\n/* 1 */\n/***/ function(module, exports) {\n\n\t// Some code originally from async_storage.js in\n\t// [Gaia](https://github.com/mozilla-b2g/gaia).\n\t'use strict';\n\n\texports.__esModule = true;\n\t(function () {\n\t 'use strict';\n\n\t var globalObject = this;\n\t // Initialize IndexedDB; fall back to vendor-prefixed versions if needed.\n\t var indexedDB = indexedDB || this.indexedDB || this.webkitIndexedDB || this.mozIndexedDB || this.OIndexedDB || this.msIndexedDB;\n\n\t // If IndexedDB isn't available, we get outta here!\n\t if (!indexedDB) {\n\t return;\n\t }\n\n\t var DETECT_BLOB_SUPPORT_STORE = 'local-forage-detect-blob-support';\n\t var supportsBlobs;\n\t var dbContexts;\n\n\t // Abstracts constructing a Blob object, so it also works in older\n\t // browsers that don't support the native Blob constructor. (i.e.\n\t // old QtWebKit versions, at least).\n\t function _createBlob(parts, properties) {\n\t parts = parts || [];\n\t properties = properties || {};\n\t try {\n\t return new Blob(parts, properties);\n\t } catch (e) {\n\t if (e.name !== 'TypeError') {\n\t throw e;\n\t }\n\t var BlobBuilder = globalObject.BlobBuilder || globalObject.MSBlobBuilder || globalObject.MozBlobBuilder || globalObject.WebKitBlobBuilder;\n\t var builder = new BlobBuilder();\n\t for (var i = 0; i < parts.length; i += 1) {\n\t builder.append(parts[i]);\n\t }\n\t return builder.getBlob(properties.type);\n\t }\n\t }\n\n\t // Transform a binary string to an array buffer, because otherwise\n\t // weird stuff happens when you try to work with the binary string directly.\n\t // It is known.\n\t // From http://stackoverflow.com/questions/14967647/ (continues on next line)\n\t // encode-decode-image-with-base64-breaks-image (2013-04-21)\n\t function _binStringToArrayBuffer(bin) {\n\t var length = bin.length;\n\t var buf = new ArrayBuffer(length);\n\t var arr = new Uint8Array(buf);\n\t for (var i = 0; i < length; i++) {\n\t arr[i] = bin.charCodeAt(i);\n\t }\n\t return buf;\n\t }\n\n\t // Fetch a blob using ajax. This reveals bugs in Chrome < 43.\n\t // For details on all this junk:\n\t // https://github.com/nolanlawson/state-of-binary-data-in-the-browser#readme\n\t function _blobAjax(url) {\n\t return new Promise(function (resolve, reject) {\n\t var xhr = new XMLHttpRequest();\n\t xhr.open('GET', url);\n\t xhr.withCredentials = true;\n\t xhr.responseType = 'arraybuffer';\n\n\t xhr.onreadystatechange = function () {\n\t if (xhr.readyState !== 4) {\n\t return;\n\t }\n\t if (xhr.status === 200) {\n\t return resolve({\n\t response: xhr.response,\n\t type: xhr.getResponseHeader('Content-Type')\n\t });\n\t }\n\t reject({ status: xhr.status, response: xhr.response });\n\t };\n\t xhr.send();\n\t });\n\t }\n\n\t //\n\t // Detect blob support. Chrome didn't support it until version 38.\n\t // In version 37 they had a broken version where PNGs (and possibly\n\t // other binary types) aren't stored correctly, because when you fetch\n\t // them, the content type is always null.\n\t //\n\t // Furthermore, they have some outstanding bugs where blobs occasionally\n\t // are read by FileReader as null, or by ajax as 404s.\n\t //\n\t // Sadly we use the 404 bug to detect the FileReader bug, so if they\n\t // get fixed independently and released in different versions of Chrome,\n\t // then the bug could come back. So it's worthwhile to watch these issues:\n\t // 404 bug: https://code.google.com/p/chromium/issues/detail?id=447916\n\t // FileReader bug: https://code.google.com/p/chromium/issues/detail?id=447836\n\t //\n\t function _checkBlobSupportWithoutCaching(idb) {\n\t return new Promise(function (resolve, reject) {\n\t var blob = _createBlob([''], { type: 'image/png' });\n\t var txn = idb.transaction([DETECT_BLOB_SUPPORT_STORE], 'readwrite');\n\t txn.objectStore(DETECT_BLOB_SUPPORT_STORE).put(blob, 'key');\n\t txn.oncomplete = function () {\n\t // have to do it in a separate transaction, else the correct\n\t // content type is always returned\n\t var blobTxn = idb.transaction([DETECT_BLOB_SUPPORT_STORE], 'readwrite');\n\t var getBlobReq = blobTxn.objectStore(DETECT_BLOB_SUPPORT_STORE).get('key');\n\t getBlobReq.onerror = reject;\n\t getBlobReq.onsuccess = function (e) {\n\n\t var storedBlob = e.target.result;\n\t var url = URL.createObjectURL(storedBlob);\n\n\t _blobAjax(url).then(function (res) {\n\t resolve(!!(res && res.type === 'image/png'));\n\t }, function () {\n\t resolve(false);\n\t }).then(function () {\n\t URL.revokeObjectURL(url);\n\t });\n\t };\n\t };\n\t })['catch'](function () {\n\t return false; // error, so assume unsupported\n\t });\n\t }\n\n\t function _checkBlobSupport(idb) {\n\t if (typeof supportsBlobs === 'boolean') {\n\t return Promise.resolve(supportsBlobs);\n\t }\n\t return _checkBlobSupportWithoutCaching(idb).then(function (value) {\n\t supportsBlobs = value;\n\t return supportsBlobs;\n\t });\n\t }\n\n\t // encode a blob for indexeddb engines that don't support blobs\n\t function _encodeBlob(blob) {\n\t return new Promise(function (resolve, reject) {\n\t var reader = new FileReader();\n\t reader.onerror = reject;\n\t reader.onloadend = function (e) {\n\t var base64 = btoa(e.target.result || '');\n\t resolve({\n\t __local_forage_encoded_blob: true,\n\t data: base64,\n\t type: blob.type\n\t });\n\t };\n\t reader.readAsBinaryString(blob);\n\t });\n\t }\n\n\t // decode an encoded blob\n\t function _decodeBlob(encodedBlob) {\n\t var arrayBuff = _binStringToArrayBuffer(atob(encodedBlob.data));\n\t return _createBlob([arrayBuff], { type: encodedBlob.type });\n\t }\n\n\t // is this one of our fancy encoded blobs?\n\t function _isEncodedBlob(value) {\n\t return value && value.__local_forage_encoded_blob;\n\t }\n\n\t // Open the IndexedDB database (automatically creates one if one didn't\n\t // previously exist), using any options set in the config.\n\t function _initStorage(options) {\n\t var self = this;\n\t var dbInfo = {\n\t db: null\n\t };\n\n\t if (options) {\n\t for (var i in options) {\n\t dbInfo[i] = options[i];\n\t }\n\t }\n\n\t // Initialize a singleton container for all running localForages.\n\t if (!dbContexts) {\n\t dbContexts = {};\n\t }\n\n\t // Get the current context of the database;\n\t var dbContext = dbContexts[dbInfo.name];\n\n\t // ...or create a new context.\n\t if (!dbContext) {\n\t dbContext = {\n\t // Running localForages sharing a database.\n\t forages: [],\n\t // Shared database.\n\t db: null\n\t };\n\t // Register the new context in the global container.\n\t dbContexts[dbInfo.name] = dbContext;\n\t }\n\n\t // Register itself as a running localForage in the current context.\n\t dbContext.forages.push(this);\n\n\t // Create an array of readiness of the related localForages.\n\t var readyPromises = [];\n\n\t function ignoreErrors() {\n\t // Don't handle errors here,\n\t // just makes sure related localForages aren't pending.\n\t return Promise.resolve();\n\t }\n\n\t for (var j = 0; j < dbContext.forages.length; j++) {\n\t var forage = dbContext.forages[j];\n\t if (forage !== this) {\n\t // Don't wait for itself...\n\t readyPromises.push(forage.ready()['catch'](ignoreErrors));\n\t }\n\t }\n\n\t // Take a snapshot of the related localForages.\n\t var forages = dbContext.forages.slice(0);\n\n\t // Initialize the connection process only when\n\t // all the related localForages aren't pending.\n\t return Promise.all(readyPromises).then(function () {\n\t dbInfo.db = dbContext.db;\n\t // Get the connection or open a new one without upgrade.\n\t return _getOriginalConnection(dbInfo);\n\t }).then(function (db) {\n\t dbInfo.db = db;\n\t if (_isUpgradeNeeded(dbInfo, self._defaultConfig.version)) {\n\t // Reopen the database for upgrading.\n\t return _getUpgradedConnection(dbInfo);\n\t }\n\t return db;\n\t }).then(function (db) {\n\t dbInfo.db = dbContext.db = db;\n\t self._dbInfo = dbInfo;\n\t // Share the final connection amongst related localForages.\n\t for (var k in forages) {\n\t var forage = forages[k];\n\t if (forage !== self) {\n\t // Self is already up-to-date.\n\t forage._dbInfo.db = dbInfo.db;\n\t forage._dbInfo.version = dbInfo.version;\n\t }\n\t }\n\t });\n\t }\n\n\t function _getOriginalConnection(dbInfo) {\n\t return _getConnection(dbInfo, false);\n\t }\n\n\t function _getUpgradedConnection(dbInfo) {\n\t return _getConnection(dbInfo, true);\n\t }\n\n\t function _getConnection(dbInfo, upgradeNeeded) {\n\t return new Promise(function (resolve, reject) {\n\t if (dbInfo.db) {\n\t if (upgradeNeeded) {\n\t dbInfo.db.close();\n\t } else {\n\t return resolve(dbInfo.db);\n\t }\n\t }\n\n\t var dbArgs = [dbInfo.name];\n\n\t if (upgradeNeeded) {\n\t dbArgs.push(dbInfo.version);\n\t }\n\n\t var openreq = indexedDB.open.apply(indexedDB, dbArgs);\n\n\t if (upgradeNeeded) {\n\t openreq.onupgradeneeded = function (e) {\n\t var db = openreq.result;\n\t try {\n\t db.createObjectStore(dbInfo.storeName);\n\t if (e.oldVersion <= 1) {\n\t // Added when support for blob shims was added\n\t db.createObjectStore(DETECT_BLOB_SUPPORT_STORE);\n\t }\n\t } catch (ex) {\n\t if (ex.name === 'ConstraintError') {\n\t globalObject.console.warn('The database \"' + dbInfo.name + '\"' + ' has been upgraded from version ' + e.oldVersion + ' to version ' + e.newVersion + ', but the storage \"' + dbInfo.storeName + '\" already exists.');\n\t } else {\n\t throw ex;\n\t }\n\t }\n\t };\n\t }\n\n\t openreq.onerror = function () {\n\t reject(openreq.error);\n\t };\n\n\t openreq.onsuccess = function () {\n\t resolve(openreq.result);\n\t };\n\t });\n\t }\n\n\t function _isUpgradeNeeded(dbInfo, defaultVersion) {\n\t if (!dbInfo.db) {\n\t return true;\n\t }\n\n\t var isNewStore = !dbInfo.db.objectStoreNames.contains(dbInfo.storeName);\n\t var isDowngrade = dbInfo.version < dbInfo.db.version;\n\t var isUpgrade = dbInfo.version > dbInfo.db.version;\n\n\t if (isDowngrade) {\n\t // If the version is not the default one\n\t // then warn for impossible downgrade.\n\t if (dbInfo.version !== defaultVersion) {\n\t globalObject.console.warn('The database \"' + dbInfo.name + '\"' + ' can\\'t be downgraded from version ' + dbInfo.db.version + ' to version ' + dbInfo.version + '.');\n\t }\n\t // Align the versions to prevent errors.\n\t dbInfo.version = dbInfo.db.version;\n\t }\n\n\t if (isUpgrade || isNewStore) {\n\t // If the store is new then increment the version (if needed).\n\t // This will trigger an \"upgradeneeded\" event which is required\n\t // for creating a store.\n\t if (isNewStore) {\n\t var incVersion = dbInfo.db.version + 1;\n\t if (incVersion > dbInfo.version) {\n\t dbInfo.version = incVersion;\n\t }\n\t }\n\n\t return true;\n\t }\n\n\t return false;\n\t }\n\n\t function getItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var store = dbInfo.db.transaction(dbInfo.storeName, 'readonly').objectStore(dbInfo.storeName);\n\t var req = store.get(key);\n\n\t req.onsuccess = function () {\n\t var value = req.result;\n\t if (value === undefined) {\n\t value = null;\n\t }\n\t if (_isEncodedBlob(value)) {\n\t value = _decodeBlob(value);\n\t }\n\t resolve(value);\n\t };\n\n\t req.onerror = function () {\n\t reject(req.error);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Iterate over all items stored in database.\n\t function iterate(iterator, callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var store = dbInfo.db.transaction(dbInfo.storeName, 'readonly').objectStore(dbInfo.storeName);\n\n\t var req = store.openCursor();\n\t var iterationNumber = 1;\n\n\t req.onsuccess = function () {\n\t var cursor = req.result;\n\n\t if (cursor) {\n\t var value = cursor.value;\n\t if (_isEncodedBlob(value)) {\n\t value = _decodeBlob(value);\n\t }\n\t var result = iterator(value, cursor.key, iterationNumber++);\n\n\t if (result !== void 0) {\n\t resolve(result);\n\t } else {\n\t cursor['continue']();\n\t }\n\t } else {\n\t resolve();\n\t }\n\t };\n\n\t req.onerror = function () {\n\t reject(req.error);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\n\t return promise;\n\t }\n\n\t function setItem(key, value, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t var dbInfo;\n\t self.ready().then(function () {\n\t dbInfo = self._dbInfo;\n\t return _checkBlobSupport(dbInfo.db);\n\t }).then(function (blobSupport) {\n\t if (!blobSupport && value instanceof Blob) {\n\t return _encodeBlob(value);\n\t }\n\t return value;\n\t }).then(function (value) {\n\t var transaction = dbInfo.db.transaction(dbInfo.storeName, 'readwrite');\n\t var store = transaction.objectStore(dbInfo.storeName);\n\n\t // The reason we don't _save_ null is because IE 10 does\n\t // not support saving the `null` type in IndexedDB. How\n\t // ironic, given the bug below!\n\t // See: https://github.com/mozilla/localForage/issues/161\n\t if (value === null) {\n\t value = undefined;\n\t }\n\n\t var req = store.put(value, key);\n\t transaction.oncomplete = function () {\n\t // Cast to undefined so the value passed to\n\t // callback/promise is the same as what one would get out\n\t // of `getItem()` later. This leads to some weirdness\n\t // (setItem('foo', undefined) will return `null`), but\n\t // it's not my fault localStorage is our baseline and that\n\t // it's weird.\n\t if (value === undefined) {\n\t value = null;\n\t }\n\n\t resolve(value);\n\t };\n\t transaction.onabort = transaction.onerror = function () {\n\t var err = req.error ? req.error : req.transaction.error;\n\t reject(err);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function removeItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var transaction = dbInfo.db.transaction(dbInfo.storeName, 'readwrite');\n\t var store = transaction.objectStore(dbInfo.storeName);\n\n\t // We use a Grunt task to make this safe for IE and some\n\t // versions of Android (including those used by Cordova).\n\t // Normally IE won't like `['delete']()` and will insist on\n\t // using `['delete']()`, but we have a build step that\n\t // fixes this for us now.\n\t var req = store['delete'](key);\n\t transaction.oncomplete = function () {\n\t resolve();\n\t };\n\n\t transaction.onerror = function () {\n\t reject(req.error);\n\t };\n\n\t // The request will be also be aborted if we've exceeded our storage\n\t // space.\n\t transaction.onabort = function () {\n\t var err = req.error ? req.error : req.transaction.error;\n\t reject(err);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function clear(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var transaction = dbInfo.db.transaction(dbInfo.storeName, 'readwrite');\n\t var store = transaction.objectStore(dbInfo.storeName);\n\t var req = store.clear();\n\n\t transaction.oncomplete = function () {\n\t resolve();\n\t };\n\n\t transaction.onabort = transaction.onerror = function () {\n\t var err = req.error ? req.error : req.transaction.error;\n\t reject(err);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function length(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var store = dbInfo.db.transaction(dbInfo.storeName, 'readonly').objectStore(dbInfo.storeName);\n\t var req = store.count();\n\n\t req.onsuccess = function () {\n\t resolve(req.result);\n\t };\n\n\t req.onerror = function () {\n\t reject(req.error);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function key(n, callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t if (n < 0) {\n\t resolve(null);\n\n\t return;\n\t }\n\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var store = dbInfo.db.transaction(dbInfo.storeName, 'readonly').objectStore(dbInfo.storeName);\n\n\t var advanced = false;\n\t var req = store.openCursor();\n\t req.onsuccess = function () {\n\t var cursor = req.result;\n\t if (!cursor) {\n\t // this means there weren't enough keys\n\t resolve(null);\n\n\t return;\n\t }\n\n\t if (n === 0) {\n\t // We have the first key, return it if that's what they\n\t // wanted.\n\t resolve(cursor.key);\n\t } else {\n\t if (!advanced) {\n\t // Otherwise, ask the cursor to skip ahead n\n\t // records.\n\t advanced = true;\n\t cursor.advance(n);\n\t } else {\n\t // When we get here, we've got the nth key.\n\t resolve(cursor.key);\n\t }\n\t }\n\t };\n\n\t req.onerror = function () {\n\t reject(req.error);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function keys(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var store = dbInfo.db.transaction(dbInfo.storeName, 'readonly').objectStore(dbInfo.storeName);\n\n\t var req = store.openCursor();\n\t var keys = [];\n\n\t req.onsuccess = function () {\n\t var cursor = req.result;\n\n\t if (!cursor) {\n\t resolve(keys);\n\t return;\n\t }\n\n\t keys.push(cursor.key);\n\t cursor['continue']();\n\t };\n\n\t req.onerror = function () {\n\t reject(req.error);\n\t };\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function executeCallback(promise, callback) {\n\t if (callback) {\n\t promise.then(function (result) {\n\t callback(null, result);\n\t }, function (error) {\n\t callback(error);\n\t });\n\t }\n\t }\n\n\t var asyncStorage = {\n\t _driver: 'asyncStorage',\n\t _initStorage: _initStorage,\n\t iterate: iterate,\n\t getItem: getItem,\n\t setItem: setItem,\n\t removeItem: removeItem,\n\t clear: clear,\n\t length: length,\n\t key: key,\n\t keys: keys\n\t };\n\n\t exports['default'] = asyncStorage;\n\t}).call(typeof window !== 'undefined' ? window : self);\n\tmodule.exports = exports['default'];\n\n/***/ },\n/* 2 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// If IndexedDB isn't available, we'll fall back to localStorage.\n\t// Note that this will have considerable performance and storage\n\t// side-effects (all data will be serialized on save and only data that\n\t// can be converted to a string via `JSON.stringify()` will be saved).\n\t'use strict';\n\n\texports.__esModule = true;\n\t(function () {\n\t 'use strict';\n\n\t var globalObject = this;\n\t var localStorage = null;\n\n\t // If the app is running inside a Google Chrome packaged webapp, or some\n\t // other context where localStorage isn't available, we don't use\n\t // localStorage. This feature detection is preferred over the old\n\t // `if (window.chrome && window.chrome.runtime)` code.\n\t // See: https://github.com/mozilla/localForage/issues/68\n\t try {\n\t // If localStorage isn't available, we get outta here!\n\t // This should be inside a try catch\n\t if (!this.localStorage || !('setItem' in this.localStorage)) {\n\t return;\n\t }\n\t // Initialize localStorage and create a variable to use throughout\n\t // the code.\n\t localStorage = this.localStorage;\n\t } catch (e) {\n\t return;\n\t }\n\n\t // Config the localStorage backend, using options set in the config.\n\t function _initStorage(options) {\n\t var self = this;\n\t var dbInfo = {};\n\t if (options) {\n\t for (var i in options) {\n\t dbInfo[i] = options[i];\n\t }\n\t }\n\n\t dbInfo.keyPrefix = dbInfo.name + '/';\n\n\t if (dbInfo.storeName !== self._defaultConfig.storeName) {\n\t dbInfo.keyPrefix += dbInfo.storeName + '/';\n\t }\n\n\t self._dbInfo = dbInfo;\n\n\t return new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(3));\n\t }).then(function (lib) {\n\t dbInfo.serializer = lib;\n\t return Promise.resolve();\n\t });\n\t }\n\n\t // Remove all keys from the datastore, effectively destroying all data in\n\t // the app's key/value store!\n\t function clear(callback) {\n\t var self = this;\n\t var promise = self.ready().then(function () {\n\t var keyPrefix = self._dbInfo.keyPrefix;\n\n\t for (var i = localStorage.length - 1; i >= 0; i--) {\n\t var key = localStorage.key(i);\n\n\t if (key.indexOf(keyPrefix) === 0) {\n\t localStorage.removeItem(key);\n\t }\n\t }\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Retrieve an item from the store. Unlike the original async_storage\n\t // library in Gaia, we don't modify return values at all. If a key's value\n\t // is `undefined`, we pass that value to the callback function.\n\t function getItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var result = localStorage.getItem(dbInfo.keyPrefix + key);\n\n\t // If a result was found, parse it from the serialized\n\t // string into a JS object. If result isn't truthy, the key\n\t // is likely undefined and we'll pass it straight to the\n\t // callback.\n\t if (result) {\n\t result = dbInfo.serializer.deserialize(result);\n\t }\n\n\t return result;\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Iterate over all items in the store.\n\t function iterate(iterator, callback) {\n\t var self = this;\n\n\t var promise = self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var keyPrefix = dbInfo.keyPrefix;\n\t var keyPrefixLength = keyPrefix.length;\n\t var length = localStorage.length;\n\n\t // We use a dedicated iterator instead of the `i` variable below\n\t // so other keys we fetch in localStorage aren't counted in\n\t // the `iterationNumber` argument passed to the `iterate()`\n\t // callback.\n\t //\n\t // See: github.com/mozilla/localForage/pull/435#discussion_r38061530\n\t var iterationNumber = 1;\n\n\t for (var i = 0; i < length; i++) {\n\t var key = localStorage.key(i);\n\t if (key.indexOf(keyPrefix) !== 0) {\n\t continue;\n\t }\n\t var value = localStorage.getItem(key);\n\n\t // If a result was found, parse it from the serialized\n\t // string into a JS object. If result isn't truthy, the\n\t // key is likely undefined and we'll pass it straight\n\t // to the iterator.\n\t if (value) {\n\t value = dbInfo.serializer.deserialize(value);\n\t }\n\n\t value = iterator(value, key.substring(keyPrefixLength), iterationNumber++);\n\n\t if (value !== void 0) {\n\t return value;\n\t }\n\t }\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Same as localStorage's key() method, except takes a callback.\n\t function key(n, callback) {\n\t var self = this;\n\t var promise = self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var result;\n\t try {\n\t result = localStorage.key(n);\n\t } catch (error) {\n\t result = null;\n\t }\n\n\t // Remove the prefix from the key, if a key is found.\n\t if (result) {\n\t result = result.substring(dbInfo.keyPrefix.length);\n\t }\n\n\t return result;\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function keys(callback) {\n\t var self = this;\n\t var promise = self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t var length = localStorage.length;\n\t var keys = [];\n\n\t for (var i = 0; i < length; i++) {\n\t if (localStorage.key(i).indexOf(dbInfo.keyPrefix) === 0) {\n\t keys.push(localStorage.key(i).substring(dbInfo.keyPrefix.length));\n\t }\n\t }\n\n\t return keys;\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Supply the number of keys in the datastore to the callback function.\n\t function length(callback) {\n\t var self = this;\n\t var promise = self.keys().then(function (keys) {\n\t return keys.length;\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Remove an item from the store, nice and simple.\n\t function removeItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t localStorage.removeItem(dbInfo.keyPrefix + key);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Set a key's value and run an optional callback once the value is set.\n\t // Unlike Gaia's implementation, the callback function is passed the value,\n\t // in case you want to operate on that value only after you're sure it\n\t // saved, or something like that.\n\t function setItem(key, value, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = self.ready().then(function () {\n\t // Convert undefined values to null.\n\t // https://github.com/mozilla/localForage/pull/42\n\t if (value === undefined) {\n\t value = null;\n\t }\n\n\t // Save the original value to pass to the callback.\n\t var originalValue = value;\n\n\t return new Promise(function (resolve, reject) {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.serializer.serialize(value, function (value, error) {\n\t if (error) {\n\t reject(error);\n\t } else {\n\t try {\n\t localStorage.setItem(dbInfo.keyPrefix + key, value);\n\t resolve(originalValue);\n\t } catch (e) {\n\t // localStorage capacity exceeded.\n\t // TODO: Make this a specific error/event.\n\t if (e.name === 'QuotaExceededError' || e.name === 'NS_ERROR_DOM_QUOTA_REACHED') {\n\t reject(e);\n\t }\n\t reject(e);\n\t }\n\t }\n\t });\n\t });\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function executeCallback(promise, callback) {\n\t if (callback) {\n\t promise.then(function (result) {\n\t callback(null, result);\n\t }, function (error) {\n\t callback(error);\n\t });\n\t }\n\t }\n\n\t var localStorageWrapper = {\n\t _driver: 'localStorageWrapper',\n\t _initStorage: _initStorage,\n\t // Default API, from Gaia/localStorage.\n\t iterate: iterate,\n\t getItem: getItem,\n\t setItem: setItem,\n\t removeItem: removeItem,\n\t clear: clear,\n\t length: length,\n\t key: key,\n\t keys: keys\n\t };\n\n\t exports['default'] = localStorageWrapper;\n\t}).call(typeof window !== 'undefined' ? window : self);\n\tmodule.exports = exports['default'];\n\n/***/ },\n/* 3 */\n/***/ function(module, exports) {\n\n\t'use strict';\n\n\texports.__esModule = true;\n\t(function () {\n\t 'use strict';\n\n\t // Sadly, the best way to save binary data in WebSQL/localStorage is serializing\n\t // it to Base64, so this is how we store it to prevent very strange errors with less\n\t // verbose ways of binary <-> string data storage.\n\t var BASE_CHARS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n\n\t var BLOB_TYPE_PREFIX = '~~local_forage_type~';\n\t var BLOB_TYPE_PREFIX_REGEX = /^~~local_forage_type~([^~]+)~/;\n\n\t var SERIALIZED_MARKER = '__lfsc__:';\n\t var SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER.length;\n\n\t // OMG the serializations!\n\t var TYPE_ARRAYBUFFER = 'arbf';\n\t var TYPE_BLOB = 'blob';\n\t var TYPE_INT8ARRAY = 'si08';\n\t var TYPE_UINT8ARRAY = 'ui08';\n\t var TYPE_UINT8CLAMPEDARRAY = 'uic8';\n\t var TYPE_INT16ARRAY = 'si16';\n\t var TYPE_INT32ARRAY = 'si32';\n\t var TYPE_UINT16ARRAY = 'ur16';\n\t var TYPE_UINT32ARRAY = 'ui32';\n\t var TYPE_FLOAT32ARRAY = 'fl32';\n\t var TYPE_FLOAT64ARRAY = 'fl64';\n\t var TYPE_SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER_LENGTH + TYPE_ARRAYBUFFER.length;\n\n\t // Get out of our habit of using `window` inline, at least.\n\t var globalObject = this;\n\n\t // Abstracts constructing a Blob object, so it also works in older\n\t // browsers that don't support the native Blob constructor. (i.e.\n\t // old QtWebKit versions, at least).\n\t function _createBlob(parts, properties) {\n\t parts = parts || [];\n\t properties = properties || {};\n\n\t try {\n\t return new Blob(parts, properties);\n\t } catch (err) {\n\t if (err.name !== 'TypeError') {\n\t throw err;\n\t }\n\n\t var BlobBuilder = globalObject.BlobBuilder || globalObject.MSBlobBuilder || globalObject.MozBlobBuilder || globalObject.WebKitBlobBuilder;\n\n\t var builder = new BlobBuilder();\n\t for (var i = 0; i < parts.length; i += 1) {\n\t builder.append(parts[i]);\n\t }\n\n\t return builder.getBlob(properties.type);\n\t }\n\t }\n\n\t // Serialize a value, afterwards executing a callback (which usually\n\t // instructs the `setItem()` callback/promise to be executed). This is how\n\t // we store binary data with localStorage.\n\t function serialize(value, callback) {\n\t var valueString = '';\n\t if (value) {\n\t valueString = value.toString();\n\t }\n\n\t // Cannot use `value instanceof ArrayBuffer` or such here, as these\n\t // checks fail when running the tests using casper.js...\n\t //\n\t // TODO: See why those tests fail and use a better solution.\n\t if (value && (value.toString() === '[object ArrayBuffer]' || value.buffer && value.buffer.toString() === '[object ArrayBuffer]')) {\n\t // Convert binary arrays to a string and prefix the string with\n\t // a special marker.\n\t var buffer;\n\t var marker = SERIALIZED_MARKER;\n\n\t if (value instanceof ArrayBuffer) {\n\t buffer = value;\n\t marker += TYPE_ARRAYBUFFER;\n\t } else {\n\t buffer = value.buffer;\n\n\t if (valueString === '[object Int8Array]') {\n\t marker += TYPE_INT8ARRAY;\n\t } else if (valueString === '[object Uint8Array]') {\n\t marker += TYPE_UINT8ARRAY;\n\t } else if (valueString === '[object Uint8ClampedArray]') {\n\t marker += TYPE_UINT8CLAMPEDARRAY;\n\t } else if (valueString === '[object Int16Array]') {\n\t marker += TYPE_INT16ARRAY;\n\t } else if (valueString === '[object Uint16Array]') {\n\t marker += TYPE_UINT16ARRAY;\n\t } else if (valueString === '[object Int32Array]') {\n\t marker += TYPE_INT32ARRAY;\n\t } else if (valueString === '[object Uint32Array]') {\n\t marker += TYPE_UINT32ARRAY;\n\t } else if (valueString === '[object Float32Array]') {\n\t marker += TYPE_FLOAT32ARRAY;\n\t } else if (valueString === '[object Float64Array]') {\n\t marker += TYPE_FLOAT64ARRAY;\n\t } else {\n\t callback(new Error('Failed to get type for BinaryArray'));\n\t }\n\t }\n\n\t callback(marker + bufferToString(buffer));\n\t } else if (valueString === '[object Blob]') {\n\t // Conver the blob to a binaryArray and then to a string.\n\t var fileReader = new FileReader();\n\n\t fileReader.onload = function () {\n\t // Backwards-compatible prefix for the blob type.\n\t var str = BLOB_TYPE_PREFIX + value.type + '~' + bufferToString(this.result);\n\n\t callback(SERIALIZED_MARKER + TYPE_BLOB + str);\n\t };\n\n\t fileReader.readAsArrayBuffer(value);\n\t } else {\n\t try {\n\t callback(JSON.stringify(value));\n\t } catch (e) {\n\t console.error(\"Couldn't convert value into a JSON string: \", value);\n\n\t callback(null, e);\n\t }\n\t }\n\t }\n\n\t // Deserialize data we've inserted into a value column/field. We place\n\t // special markers into our strings to mark them as encoded; this isn't\n\t // as nice as a meta field, but it's the only sane thing we can do whilst\n\t // keeping localStorage support intact.\n\t //\n\t // Oftentimes this will just deserialize JSON content, but if we have a\n\t // special marker (SERIALIZED_MARKER, defined above), we will extract\n\t // some kind of arraybuffer/binary data/typed array out of the string.\n\t function deserialize(value) {\n\t // If we haven't marked this string as being specially serialized (i.e.\n\t // something other than serialized JSON), we can just return it and be\n\t // done with it.\n\t if (value.substring(0, SERIALIZED_MARKER_LENGTH) !== SERIALIZED_MARKER) {\n\t return JSON.parse(value);\n\t }\n\n\t // The following code deals with deserializing some kind of Blob or\n\t // TypedArray. First we separate out the type of data we're dealing\n\t // with from the data itself.\n\t var serializedString = value.substring(TYPE_SERIALIZED_MARKER_LENGTH);\n\t var type = value.substring(SERIALIZED_MARKER_LENGTH, TYPE_SERIALIZED_MARKER_LENGTH);\n\n\t var blobType;\n\t // Backwards-compatible blob type serialization strategy.\n\t // DBs created with older versions of localForage will simply not have the blob type.\n\t if (type === TYPE_BLOB && BLOB_TYPE_PREFIX_REGEX.test(serializedString)) {\n\t var matcher = serializedString.match(BLOB_TYPE_PREFIX_REGEX);\n\t blobType = matcher[1];\n\t serializedString = serializedString.substring(matcher[0].length);\n\t }\n\t var buffer = stringToBuffer(serializedString);\n\n\t // Return the right type based on the code/type set during\n\t // serialization.\n\t switch (type) {\n\t case TYPE_ARRAYBUFFER:\n\t return buffer;\n\t case TYPE_BLOB:\n\t return _createBlob([buffer], { type: blobType });\n\t case TYPE_INT8ARRAY:\n\t return new Int8Array(buffer);\n\t case TYPE_UINT8ARRAY:\n\t return new Uint8Array(buffer);\n\t case TYPE_UINT8CLAMPEDARRAY:\n\t return new Uint8ClampedArray(buffer);\n\t case TYPE_INT16ARRAY:\n\t return new Int16Array(buffer);\n\t case TYPE_UINT16ARRAY:\n\t return new Uint16Array(buffer);\n\t case TYPE_INT32ARRAY:\n\t return new Int32Array(buffer);\n\t case TYPE_UINT32ARRAY:\n\t return new Uint32Array(buffer);\n\t case TYPE_FLOAT32ARRAY:\n\t return new Float32Array(buffer);\n\t case TYPE_FLOAT64ARRAY:\n\t return new Float64Array(buffer);\n\t default:\n\t throw new Error('Unkown type: ' + type);\n\t }\n\t }\n\n\t function stringToBuffer(serializedString) {\n\t // Fill the string into a ArrayBuffer.\n\t var bufferLength = serializedString.length * 0.75;\n\t var len = serializedString.length;\n\t var i;\n\t var p = 0;\n\t var encoded1, encoded2, encoded3, encoded4;\n\n\t if (serializedString[serializedString.length - 1] === '=') {\n\t bufferLength--;\n\t if (serializedString[serializedString.length - 2] === '=') {\n\t bufferLength--;\n\t }\n\t }\n\n\t var buffer = new ArrayBuffer(bufferLength);\n\t var bytes = new Uint8Array(buffer);\n\n\t for (i = 0; i < len; i += 4) {\n\t encoded1 = BASE_CHARS.indexOf(serializedString[i]);\n\t encoded2 = BASE_CHARS.indexOf(serializedString[i + 1]);\n\t encoded3 = BASE_CHARS.indexOf(serializedString[i + 2]);\n\t encoded4 = BASE_CHARS.indexOf(serializedString[i + 3]);\n\n\t /*jslint bitwise: true */\n\t bytes[p++] = encoded1 << 2 | encoded2 >> 4;\n\t bytes[p++] = (encoded2 & 15) << 4 | encoded3 >> 2;\n\t bytes[p++] = (encoded3 & 3) << 6 | encoded4 & 63;\n\t }\n\t return buffer;\n\t }\n\n\t // Converts a buffer to a string to store, serialized, in the backend\n\t // storage library.\n\t function bufferToString(buffer) {\n\t // base64-arraybuffer\n\t var bytes = new Uint8Array(buffer);\n\t var base64String = '';\n\t var i;\n\n\t for (i = 0; i < bytes.length; i += 3) {\n\t /*jslint bitwise: true */\n\t base64String += BASE_CHARS[bytes[i] >> 2];\n\t base64String += BASE_CHARS[(bytes[i] & 3) << 4 | bytes[i + 1] >> 4];\n\t base64String += BASE_CHARS[(bytes[i + 1] & 15) << 2 | bytes[i + 2] >> 6];\n\t base64String += BASE_CHARS[bytes[i + 2] & 63];\n\t }\n\n\t if (bytes.length % 3 === 2) {\n\t base64String = base64String.substring(0, base64String.length - 1) + '=';\n\t } else if (bytes.length % 3 === 1) {\n\t base64String = base64String.substring(0, base64String.length - 2) + '==';\n\t }\n\n\t return base64String;\n\t }\n\n\t var localforageSerializer = {\n\t serialize: serialize,\n\t deserialize: deserialize,\n\t stringToBuffer: stringToBuffer,\n\t bufferToString: bufferToString\n\t };\n\n\t exports['default'] = localforageSerializer;\n\t}).call(typeof window !== 'undefined' ? window : self);\n\tmodule.exports = exports['default'];\n\n/***/ },\n/* 4 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t/*\n\t * Includes code from:\n\t *\n\t * base64-arraybuffer\n\t * https://github.com/niklasvh/base64-arraybuffer\n\t *\n\t * Copyright (c) 2012 Niklas von Hertzen\n\t * Licensed under the MIT license.\n\t */\n\t'use strict';\n\n\texports.__esModule = true;\n\t(function () {\n\t 'use strict';\n\n\t var globalObject = this;\n\t var openDatabase = this.openDatabase;\n\n\t // If WebSQL methods aren't available, we can stop now.\n\t if (!openDatabase) {\n\t return;\n\t }\n\n\t // Open the WebSQL database (automatically creates one if one didn't\n\t // previously exist), using any options set in the config.\n\t function _initStorage(options) {\n\t var self = this;\n\t var dbInfo = {\n\t db: null\n\t };\n\n\t if (options) {\n\t for (var i in options) {\n\t dbInfo[i] = typeof options[i] !== 'string' ? options[i].toString() : options[i];\n\t }\n\t }\n\n\t var dbInfoPromise = new Promise(function (resolve, reject) {\n\t // Open the database; the openDatabase API will automatically\n\t // create it for us if it doesn't exist.\n\t try {\n\t dbInfo.db = openDatabase(dbInfo.name, String(dbInfo.version), dbInfo.description, dbInfo.size);\n\t } catch (e) {\n\t return self.setDriver(self.LOCALSTORAGE).then(function () {\n\t return self._initStorage(options);\n\t }).then(resolve)['catch'](reject);\n\t }\n\n\t // Create our key/value table if it doesn't exist.\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('CREATE TABLE IF NOT EXISTS ' + dbInfo.storeName + ' (id INTEGER PRIMARY KEY, key unique, value)', [], function () {\n\t self._dbInfo = dbInfo;\n\t resolve();\n\t }, function (t, error) {\n\t reject(error);\n\t });\n\t });\n\t });\n\n\t return new Promise(function (resolve, reject) {\n\t resolve(__webpack_require__(3));\n\t }).then(function (lib) {\n\t dbInfo.serializer = lib;\n\t return dbInfoPromise;\n\t });\n\t }\n\n\t function getItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('SELECT * FROM ' + dbInfo.storeName + ' WHERE key = ? LIMIT 1', [key], function (t, results) {\n\t var result = results.rows.length ? results.rows.item(0).value : null;\n\n\t // Check to see if this is serialized content we need to\n\t // unpack.\n\t if (result) {\n\t result = dbInfo.serializer.deserialize(result);\n\t }\n\n\t resolve(result);\n\t }, function (t, error) {\n\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function iterate(iterator, callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('SELECT * FROM ' + dbInfo.storeName, [], function (t, results) {\n\t var rows = results.rows;\n\t var length = rows.length;\n\n\t for (var i = 0; i < length; i++) {\n\t var item = rows.item(i);\n\t var result = item.value;\n\n\t // Check to see if this is serialized content\n\t // we need to unpack.\n\t if (result) {\n\t result = dbInfo.serializer.deserialize(result);\n\t }\n\n\t result = iterator(result, item.key, i + 1);\n\n\t // void(0) prevents problems with redefinition\n\t // of `undefined`.\n\t if (result !== void 0) {\n\t resolve(result);\n\t return;\n\t }\n\t }\n\n\t resolve();\n\t }, function (t, error) {\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function setItem(key, value, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t // The localStorage API doesn't return undefined values in an\n\t // \"expected\" way, so undefined is always cast to null in all\n\t // drivers. See: https://github.com/mozilla/localForage/pull/42\n\t if (value === undefined) {\n\t value = null;\n\t }\n\n\t // Save the original value to pass to the callback.\n\t var originalValue = value;\n\n\t var dbInfo = self._dbInfo;\n\t dbInfo.serializer.serialize(value, function (value, error) {\n\t if (error) {\n\t reject(error);\n\t } else {\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('INSERT OR REPLACE INTO ' + dbInfo.storeName + ' (key, value) VALUES (?, ?)', [key, value], function () {\n\t resolve(originalValue);\n\t }, function (t, error) {\n\t reject(error);\n\t });\n\t }, function (sqlError) {\n\t // The transaction failed; check\n\t // to see if it's a quota error.\n\t if (sqlError.code === sqlError.QUOTA_ERR) {\n\t // We reject the callback outright for now, but\n\t // it's worth trying to re-run the transaction.\n\t // Even if the user accepts the prompt to use\n\t // more storage on Safari, this error will\n\t // be called.\n\t //\n\t // TODO: Try to re-run the transaction.\n\t reject(sqlError);\n\t }\n\t });\n\t }\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function removeItem(key, callback) {\n\t var self = this;\n\n\t // Cast the key to a string, as that's all we can set as a key.\n\t if (typeof key !== 'string') {\n\t globalObject.console.warn(key + ' used as a key, but it is not a string.');\n\t key = String(key);\n\t }\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('DELETE FROM ' + dbInfo.storeName + ' WHERE key = ?', [key], function () {\n\t resolve();\n\t }, function (t, error) {\n\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Deletes every item in the table.\n\t // TODO: Find out if this resets the AUTO_INCREMENT number.\n\t function clear(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('DELETE FROM ' + dbInfo.storeName, [], function () {\n\t resolve();\n\t }, function (t, error) {\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Does a simple `COUNT(key)` to get the number of items stored in\n\t // localForage.\n\t function length(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t // Ahhh, SQL makes this one soooooo easy.\n\t t.executeSql('SELECT COUNT(key) as c FROM ' + dbInfo.storeName, [], function (t, results) {\n\t var result = results.rows.item(0).c;\n\n\t resolve(result);\n\t }, function (t, error) {\n\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t // Return the key located at key index X; essentially gets the key from a\n\t // `WHERE id = ?`. This is the most efficient way I can think to implement\n\t // this rarely-used (in my experience) part of the API, but it can seem\n\t // inconsistent, because we do `INSERT OR REPLACE INTO` on `setItem()`, so\n\t // the ID of each key will change every time it's updated. Perhaps a stored\n\t // procedure for the `setItem()` SQL would solve this problem?\n\t // TODO: Don't change ID on `setItem()`.\n\t function key(n, callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('SELECT key FROM ' + dbInfo.storeName + ' WHERE id = ? LIMIT 1', [n + 1], function (t, results) {\n\t var result = results.rows.length ? results.rows.item(0).key : null;\n\t resolve(result);\n\t }, function (t, error) {\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function keys(callback) {\n\t var self = this;\n\n\t var promise = new Promise(function (resolve, reject) {\n\t self.ready().then(function () {\n\t var dbInfo = self._dbInfo;\n\t dbInfo.db.transaction(function (t) {\n\t t.executeSql('SELECT key FROM ' + dbInfo.storeName, [], function (t, results) {\n\t var keys = [];\n\n\t for (var i = 0; i < results.rows.length; i++) {\n\t keys.push(results.rows.item(i).key);\n\t }\n\n\t resolve(keys);\n\t }, function (t, error) {\n\n\t reject(error);\n\t });\n\t });\n\t })['catch'](reject);\n\t });\n\n\t executeCallback(promise, callback);\n\t return promise;\n\t }\n\n\t function executeCallback(promise, callback) {\n\t if (callback) {\n\t promise.then(function (result) {\n\t callback(null, result);\n\t }, function (error) {\n\t callback(error);\n\t });\n\t }\n\t }\n\n\t var webSQLStorage = {\n\t _driver: 'webSQLStorage',\n\t _initStorage: _initStorage,\n\t iterate: iterate,\n\t getItem: getItem,\n\t setItem: setItem,\n\t removeItem: removeItem,\n\t clear: clear,\n\t length: length,\n\t key: key,\n\t keys: keys\n\t };\n\n\t exports['default'] = webSQLStorage;\n\t}).call(typeof window !== 'undefined' ? window : self);\n\tmodule.exports = exports['default'];\n\n/***/ }\n/******/ ])\n});\n;\n}).call(this,_dereq_('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"_process\":70}],72:[function(_dereq_,module,exports){\n// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign = _dereq_('./lib/utils/common').assign;\n\nvar deflate = _dereq_('./lib/deflate');\nvar inflate = _dereq_('./lib/inflate');\nvar constants = _dereq_('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n\n},{\"./lib/deflate\":73,\"./lib/inflate\":74,\"./lib/utils/common\":75,\"./lib/zlib/constants\":78}],73:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar zlib_deflate = _dereq_('./zlib/deflate.js');\nvar utils = _dereq_('./utils/common');\nvar strings = _dereq_('./utils/strings');\nvar msg = _dereq_('./zlib/messages');\nvar zstream = _dereq_('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH = 0;\nvar Z_FINISH = 4;\n\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_SYNC_FLUSH = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY = 0;\n\nvar Z_DEFLATED = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overriden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nvar Deflate = function(options) {\n\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n var status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n};\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function(data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n\n if (this.ended) { return false; }\n\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n status = zlib_deflate.deflate(strm, _mode); /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n // Finalize on the last chunk.\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === Z_SYNC_FLUSH) {\n this.onEnd(Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): ouput data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function(chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function(status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate alrorythm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n var deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n\n},{\"./utils/common\":75,\"./utils/strings\":76,\"./zlib/deflate.js\":80,\"./zlib/messages\":85,\"./zlib/zstream\":87}],74:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar zlib_inflate = _dereq_('./zlib/inflate.js');\nvar utils = _dereq_('./utils/common');\nvar strings = _dereq_('./utils/strings');\nvar c = _dereq_('./zlib/constants');\nvar msg = _dereq_('./zlib/messages');\nvar zstream = _dereq_('./zlib/zstream');\nvar gzheader = _dereq_('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overriden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nvar Inflate = function(options) {\n\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n var status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new gzheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n};\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function(data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n var next_out_utf8, tail, utf8str;\n\n // Flag to properly process Z_BUF_ERROR on testing inflate call\n // when we check that all output data was flushed.\n var allowBufError = false;\n\n if (this.ended) { return false; }\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */\n\n if (status === c.Z_BUF_ERROR && allowBufError === true) {\n status = c.Z_OK;\n allowBufError = false;\n }\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n if (this.options.to === 'string') {\n\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n this.onData(utf8str);\n\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n\n // When no more input data, we should check that internal inflate buffers\n // are flushed. The only way to do it when avail_out = 0 - run one more\n // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n // Here we set flag to process this error properly.\n //\n // NOTE. Deflate does not return error in this case and does not needs such\n // logic.\n if (strm.avail_in === 0 && strm.avail_out === 0) {\n allowBufError = true;\n }\n\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n }\n\n // Finalize on the last chunk.\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === c.Z_SYNC_FLUSH) {\n this.onEnd(c.Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): ouput data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function(chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function(status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 alligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n var inflator = new Inflate(options);\n\n inflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) { throw inflator.msg; }\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip = inflate;\n\n},{\"./utils/common\":75,\"./utils/strings\":76,\"./zlib/constants\":78,\"./zlib/gzheader\":81,\"./zlib/inflate.js\":83,\"./zlib/messages\":85,\"./zlib/zstream\":87}],75:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (source.hasOwnProperty(p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs+len), dest_offs);\n return;\n }\n // Fallback to ordinary array\n for (var i=0; i<len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function(chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i=0, l=chunks.length; i<l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\n for (i=0, l=chunks.length; i<l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\n\nvar fnUntyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n for (var i=0; i<len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function(chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);\n\n},{}],76:[function(_dereq_,module,exports){\n// String encode/decode helpers\n'use strict';\n\n\nvar utils = _dereq_('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safary\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [0]); } catch(__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch(__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q=0; q<256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254]=_utf8len[254]=1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {\n c2 = str.charCodeAt(m_pos+1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new utils.Buf8(buf_len);\n\n // convert\n for (i=0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {\n c2 = str.charCodeAt(m_pos+1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n // use fallback for big arrays to avoid stack overflow\n if (len < 65537) {\n if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n for (var i=0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function(buf) {\n return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function(str) {\n var buf = new utils.Buf8(str.length);\n for (var i=0, len=buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n var utf16buf = new Array(len*2);\n\n for (out=0, i=0; i<len;) {\n c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nexports.utf8border = function(buf, max) {\n var pos;\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n pos = max-1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Fuckup - very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means vuffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\n},{\"./common\":75}],77:[function(_dereq_,module,exports){\n'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It doesn't worth to make additional optimizationa as in original.\n// Small size is preferable.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n\n},{}],78:[function(_dereq_,module,exports){\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n\n},{}],79:[function(_dereq_,module,exports){\n'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n =0; n < 256; n++) {\n c = n;\n for (var k =0; k < 8; k++) {\n c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\n crc = crc ^ (-1);\n\n for (var i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n\n},{}],80:[function(_dereq_,module,exports){\n'use strict';\n\nvar utils = _dereq_('../utils/common');\nvar trees = _dereq_('./trees');\nvar adler32 = _dereq_('./adler32');\nvar crc32 = _dereq_('./crc32');\nvar msg = _dereq_('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY = 0;\n//var Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2*L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction flush_block_only (s, last) {\n trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n// put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH-1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// var curr = s.strstart + s.lookahead;\n// var init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH-1)) ? s.strstart : MIN_MATCH-1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH-1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH-1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length-1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH-1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nvar Config = function (good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n};\n\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2*D_CODES+1) * 2);\n this.bl_tree = new utils.Buf16((2*BL_CODES+1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS+1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2*L_CODES+1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2*L_CODES+1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nfunction deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n s.d_buf = s.lit_bufsize >> 1;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n/* =========================================================================\n * Copy the source state to the destination state\n */\n//function deflateCopy(dest, source) {\n//\n//}\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n\n},{\"../utils/common\":75,\"./adler32\":77,\"./crc32\":79,\"./messages\":85,\"./trees\":86}],81:[function(_dereq_,module,exports){\n'use strict';\n\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n\n},{}],82:[function(_dereq_,module,exports){\n'use strict';\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defailts,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n\n},{}],83:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar utils = _dereq_('../utils/common');\nvar adler32 = _dereq_('./adler32');\nvar crc32 = _dereq_('./crc32');\nvar inflate_fast = _dereq_('./inffast');\nvar inflate_table = _dereq_('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction ZSWAP32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {bits: 9});\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {bits: 5});\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window,src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window,src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window,src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more conveniend processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0 /*crc32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = ZSWAP32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n utils.arraySet(output, input, next, copy, put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = {bits: state.lenbits};\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = {bits: state.lenbits};\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = {bits: state.distbits};\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) -1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) -1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defailts,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' insdead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, ZSWAP32 returns signed too\n if ((state.flags ? hold : ZSWAP32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n\n},{\"../utils/common\":75,\"./adler32\":77,\"./crc32\":79,\"./inffast\":82,\"./inftrees\":84}],84:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar utils = _dereq_('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n var i=0;\n /* process all codes and make table entries */\n for (;;) {\n i++;\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n},{\"../utils/common\":75}],85:[function(_dereq_,module,exports){\n'use strict';\n\nmodule.exports = {\n '2': 'need dictionary', /* Z_NEED_DICT 2 */\n '1': 'stream end', /* Z_STREAM_END 1 */\n '0': '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n},{}],86:[function(_dereq_,module,exports){\n'use strict';\n\n\nvar utils = _dereq_('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2*L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\nvar extra_lbits = /* extra bits for each length code */\n [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits = /* extra bits for each distance code */\n [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES+2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code = new Array(MAX_MATCH-MIN_MATCH+1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nvar StaticTreeDesc = function (static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n};\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nvar TreeDesc = function(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n};\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short (s, w) {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n}\n\n\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c*2]/*.Code*/, tree[c*2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max]*2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max+1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n*2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n-base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n*2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length-1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits+1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m*2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;\n tree[m*2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n var next_code = new Array(MAX_BITS+1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = (code + bl_count[bits-1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n*2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS+1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES-1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1<<extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length-1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0 ; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1<<extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n*2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n*2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n*2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n*2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES+1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n*2 + 1]/*.Len*/ = 5;\n static_dtree[n*2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc =new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n*2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n*2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n*2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK*2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n*2;\n var _m2 = m*2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n var v = s.heap[k];\n var j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j+1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx*2] << 8) | (s.pending_buf[s.d_buf + lx*2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code+LITERALS+1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n*2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node*2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6*2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10*2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138*2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3*(max_blindex+1) + 5+5+4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n*2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK<<1)+(last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n send_bits(s, STATIC_TREES<<1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc*2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc]+LITERALS+1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defailts,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize-1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}\n\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n\n},{\"../utils/common\":75}],87:[function(_dereq_,module,exports){\n'use strict';\n\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n\n},{}]},{},[1]);\n"}}},{"rowIdx":789378,"cells":{"path":{"kind":"string","value":"src/components/messages/parts/Outbox.js"},"repo_name":{"kind":"string","value":"platejan/HeroCamp"},"content":{"kind":"string","value":"import React, {PropTypes} from 'react';\nimport {connect} from 'react-redux';\nimport {bindActionCreators} from 'redux';\nimport {loadMessages} from '../../../actions/messagesActions';\nimport Message from './Message';\n\nclass Outbox extends React.Component {\n constructor(props, context) {\n super(props, context);\n this.state = {\n messages: Object.assign({}, this.props.messagesOutbox)\n };\n this.showDetail = this.showDetail.bind(this);\n }\n\n componentWillMount() {\n }\n\n componentWillReceiveProps(nextProps) {\n let state = this.state;\n state.messages = Object.assign({}, nextProps.messagesOutbox)\n this.setState(state);\n }\n\n showDetail(key) {\n this.props.showDetail('outbox', key);\n }\n\n render() {\n console.log(this.state.messages);\n let messages = \"\";\n let data = this.state.messages;\n let dataArray = [];\n if (data) {\n Object.keys(data).forEach(function (key, index) {\n dataArray.push({ItemKey: key, ItemContent: data[key]});\n });\n }\n if (dataArray.length > 0) {\n messages = dataArray.map((Item, index) => {\n\n const itemKey = Item.ItemKey;\n const itemContent = Item.ItemContent;\n\n if (!itemContent.delete) {\n return (\n <Message key={itemKey}\n itemKey={itemKey}\n itemContent={itemContent}\n showDetail={this.showDetail}/>\n );\n }\n });\n }\n\n return (\n <div>\n {messages}\n </div>\n );\n }\n}\nOutbox.propTypes = {};\n\nOutbox.contextTypes = {};\n\nfunction mapStateToProps(state, ownProps) {\n return {\n currentUID: state.auth.currentUserUID,\n messagesOutbox: state.messages.outbox\n };\n}\n\nfunction mapDispatchToProps(dispatch) {\n return {\n actions: bindActionCreators({}, dispatch)\n\n };\n}\n\nexport default connect(mapStateToProps, mapDispatchToProps)(Outbox);\n"}}},{"rowIdx":789379,"cells":{"path":{"kind":"string","value":"ajax/libs/yui/3.9.0/simpleyui/simpleyui-debug.js"},"repo_name":{"kind":"string","value":"humbletim/cdnjs"},"content":{"kind":"string","value":"/**\nThe YUI module contains the components required for building the YUI seed file.\nThis includes the script loading mechanism, a simple queue, and the core\nutilities for the library.\n\n@module yui\n@main yui\n@submodule yui-base\n**/\n\n/*jshint eqeqeq: false*/\nif (typeof YUI != 'undefined') {\n YUI._YUI = YUI;\n}\n\n/**\nThe YUI global namespace object. This is the constructor for all YUI instances.\n\nThis is a self-instantiable factory function, meaning you don't need to precede\nit with the `new` operator. You can invoke it directly like this:\n\n YUI().use('*', function (Y) {\n // Y is a new YUI instance.\n });\n\nBut it also works like this:\n\n var Y = YUI();\n\nThe `YUI` constructor accepts an optional config object, like this:\n\n YUI({\n debug: true,\n combine: false\n }).use('node', function (Y) {\n // Y.Node is ready to use.\n });\n\nSee the API docs for the <a href=\"config.html\">Config</a> class for the complete\nlist of supported configuration properties accepted by the YUI constuctor.\n\nIf a global `YUI` object is already defined, the existing YUI object will not be\noverwritten, to ensure that defined namespaces are preserved.\n\nEach YUI instance has full custom event support, but only if the event system is\navailable.\n\n@class YUI\n@uses EventTarget\n@constructor\n@global\n@param {Object} [config]* Zero or more optional configuration objects. Config\n values are stored in the `Y.config` property. See the\n <a href=\"config.html\">Config</a> docs for the list of supported properties.\n**/\n\n /*global YUI*/\n /*global YUI_config*/\n var YUI = function() {\n var i = 0,\n Y = this,\n args = arguments,\n l = args.length,\n instanceOf = function(o, type) {\n return (o && o.hasOwnProperty && (o instanceof type));\n },\n gconf = (typeof YUI_config !== 'undefined') && YUI_config;\n\n if (!(instanceOf(Y, YUI))) {\n Y = new YUI();\n } else {\n // set up the core environment\n Y._init();\n\n /**\n Master configuration that might span multiple contexts in a non-\n browser environment. It is applied first to all instances in all\n contexts.\n\n @example\n\n YUI.GlobalConfig = {\n filter: 'debug'\n };\n\n YUI().use('node', function (Y) {\n // debug files used here\n });\n\n YUI({\n filter: 'min'\n }).use('node', function (Y) {\n // min files used here\n });\n\n @property {Object} GlobalConfig\n @global\n @static\n **/\n if (YUI.GlobalConfig) {\n Y.applyConfig(YUI.GlobalConfig);\n }\n\n /**\n Page-level config applied to all YUI instances created on the\n current page. This is applied after `YUI.GlobalConfig` and before\n any instance-level configuration.\n\n @example\n\n // Single global var to include before YUI seed file\n YUI_config = {\n filter: 'debug'\n };\n\n YUI().use('node', function (Y) {\n // debug files used here\n });\n\n YUI({\n filter: 'min'\n }).use('node', function (Y) {\n // min files used here\n });\n\n @property {Object} YUI_config\n @global\n **/\n if (gconf) {\n Y.applyConfig(gconf);\n }\n\n // bind the specified additional modules for this instance\n if (!l) {\n Y._setup();\n }\n }\n\n if (l) {\n // Each instance can accept one or more configuration objects.\n // These are applied after YUI.GlobalConfig and YUI_Config,\n // overriding values set in those config files if there is a\n // matching property.\n for (; i < l; i++) {\n Y.applyConfig(args[i]);\n }\n\n Y._setup();\n }\n\n Y.instanceOf = instanceOf;\n\n return Y;\n };\n\n(function() {\n\n var proto, prop,\n VERSION = '@VERSION@',\n PERIOD = '.',\n BASE = 'http://yui.yahooapis.com/',\n /*\n These CSS class names can't be generated by\n getClassName since it is not available at the\n time they are being used.\n */\n DOC_LABEL = 'yui3-js-enabled',\n CSS_STAMP_EL = 'yui3-css-stamp',\n NOOP = function() {},\n SLICE = Array.prototype.slice,\n APPLY_TO_AUTH = { 'io.xdrReady': 1, // the functions applyTo\n 'io.xdrResponse': 1, // can call. this should\n 'SWF.eventHandler': 1 }, // be done at build time\n hasWin = (typeof window != 'undefined'),\n win = (hasWin) ? window : null,\n doc = (hasWin) ? win.document : null,\n docEl = doc && doc.documentElement,\n docClass = docEl && docEl.className,\n instances = {},\n time = new Date().getTime(),\n add = function(el, type, fn, capture) {\n if (el && el.addEventListener) {\n el.addEventListener(type, fn, capture);\n } else if (el && el.attachEvent) {\n el.attachEvent('on' + type, fn);\n }\n },\n remove = function(el, type, fn, capture) {\n if (el && el.removeEventListener) {\n // this can throw an uncaught exception in FF\n try {\n el.removeEventListener(type, fn, capture);\n } catch (ex) {}\n } else if (el && el.detachEvent) {\n el.detachEvent('on' + type, fn);\n }\n },\n handleLoad = function() {\n YUI.Env.windowLoaded = true;\n YUI.Env.DOMReady = true;\n if (hasWin) {\n remove(window, 'load', handleLoad);\n }\n },\n getLoader = function(Y, o) {\n var loader = Y.Env._loader,\n lCore = [ 'loader-base' ],\n G_ENV = YUI.Env,\n mods = G_ENV.mods;\n\n if (loader) {\n //loader._config(Y.config);\n loader.ignoreRegistered = false;\n loader.onEnd = null;\n loader.data = null;\n loader.required = [];\n loader.loadType = null;\n } else {\n loader = new Y.Loader(Y.config);\n Y.Env._loader = loader;\n }\n if (mods && mods.loader) {\n lCore = [].concat(lCore, YUI.Env.loaderExtras);\n }\n YUI.Env.core = Y.Array.dedupe([].concat(YUI.Env.core, lCore));\n\n return loader;\n },\n\n clobber = function(r, s) {\n for (var i in s) {\n if (s.hasOwnProperty(i)) {\n r[i] = s[i];\n }\n }\n },\n\n ALREADY_DONE = { success: true };\n\n// Stamp the documentElement (HTML) with a class of \"yui-loaded\" to\n// enable styles that need to key off of JS being enabled.\nif (docEl && docClass.indexOf(DOC_LABEL) == -1) {\n if (docClass) {\n docClass += ' ';\n }\n docClass += DOC_LABEL;\n docEl.className = docClass;\n}\n\nif (VERSION.indexOf('@') > -1) {\n VERSION = '3.5.0'; // dev time hack for cdn test\n}\n\nproto = {\n /**\n Applies a new configuration object to the config of this YUI instance. This\n will merge new group/module definitions, and will also update the loader\n cache if necessary. Updating `Y.config` directly will not update the cache.\n\n @method applyConfig\n @param {Object} o the configuration object.\n @since 3.2.0\n **/\n applyConfig: function(o) {\n\n o = o || NOOP;\n\n var attr,\n name,\n // detail,\n config = this.config,\n mods = config.modules,\n groups = config.groups,\n aliases = config.aliases,\n loader = this.Env._loader;\n\n for (name in o) {\n if (o.hasOwnProperty(name)) {\n attr = o[name];\n if (mods && name == 'modules') {\n clobber(mods, attr);\n } else if (aliases && name == 'aliases') {\n clobber(aliases, attr);\n } else if (groups && name == 'groups') {\n clobber(groups, attr);\n } else if (name == 'win') {\n config[name] = (attr && attr.contentWindow) || attr;\n config.doc = config[name] ? config[name].document : null;\n } else if (name == '_yuid') {\n // preserve the guid\n } else {\n config[name] = attr;\n }\n }\n }\n\n if (loader) {\n loader._config(o);\n }\n\n },\n\n /**\n Old way to apply a config to this instance (calls `applyConfig` under the\n hood).\n\n @private\n @method _config\n @param {Object} o The config to apply\n **/\n _config: function(o) {\n this.applyConfig(o);\n },\n\n /**\n Initializes this YUI instance.\n\n @private\n @method _init\n **/\n _init: function() {\n var filter, el,\n Y = this,\n G_ENV = YUI.Env,\n Env = Y.Env,\n prop;\n\n /**\n The version number of this YUI instance.\n\n This value is typically updated by a script when a YUI release is built,\n so it may not reflect the correct version number when YUI is run from\n the development source tree.\n\n @property {String} version\n **/\n Y.version = VERSION;\n\n if (!Env) {\n Y.Env = {\n core: ['get', 'features', 'intl-base', 'yui-log', 'yui-later'],\n loaderExtras: ['loader-rollup', 'loader-yui3'],\n mods: {}, // flat module map\n versions: {}, // version module map\n base: BASE,\n cdn: BASE + VERSION + '/build/',\n // bootstrapped: false,\n _idx: 0,\n _used: {},\n _attached: {},\n _missed: [],\n _yidx: 0,\n _uidx: 0,\n _guidp: 'y',\n _loaded: {},\n // serviced: {},\n // Regex in English:\n // I'll start at the \\b(simpleyui).\n // 1. Look in the test string for \"simpleyui\" or \"yui\" or\n // \"yui-base\" or \"yui-davglass\" or \"yui-foobar\" that comes after a word break. That is, it\n // can't match \"foyui\" or \"i_heart_simpleyui\". This can be anywhere in the string.\n // 2. After #1 must come a forward slash followed by the string matched in #1, so\n // \"yui-base/yui-base\" or \"simpleyui/simpleyui\" or \"yui-pants/yui-pants\".\n // 3. The second occurence of the #1 token can optionally be followed by \"-debug\" or \"-min\",\n // so \"yui/yui-min\", \"yui/yui-debug\", \"yui-base/yui-base-debug\". NOT \"yui/yui-tshirt\".\n // 4. This is followed by \".js\", so \"yui/yui.js\", \"simpleyui/simpleyui-min.js\"\n // 0. Going back to the beginning, now. If all that stuff in 1-4 comes after a \"?\" in the string,\n // then capture the junk between the LAST \"&\" and the string in 1-4. So\n // \"blah?foo/yui/yui.js\" will capture \"foo/\" and \"blah?some/thing.js&3.3.0/build/yui-davglass/yui-davglass.js\"\n // will capture \"3.3.0/build/\"\n //\n // Regex Exploded:\n // (?:\\? Find a ?\n // (?:[^&]*&) followed by 0..n characters followed by an &\n // * in fact, find as many sets of characters followed by a & as you can\n // ([^&]*) capture the stuff after the last & in \\1\n // )? but it's ok if all this ?junk&more_junk stuff isn't even there\n // \\b(simpleyui| after a word break find either the string \"simpleyui\" or\n // yui(?:-\\w+)? the string \"yui\" optionally followed by a -, then more characters\n // ) and store the simpleyui or yui-* string in \\2\n // \\/\\2 then comes a / followed by the simpleyui or yui-* string in \\2\n // (?:-(min|debug))? optionally followed by \"-min\" or \"-debug\"\n // .js and ending in \".js\"\n _BASE_RE: /(?:\\?(?:[^&]*&)*([^&]*))?\\b(simpleyui|yui(?:-\\w+)?)\\/\\2(?:-(min|debug))?\\.js/,\n parseBasePath: function(src, pattern) {\n var match = src.match(pattern),\n path, filter;\n\n if (match) {\n path = RegExp.leftContext || src.slice(0, src.indexOf(match[0]));\n\n // this is to set up the path to the loader. The file\n // filter for loader should match the yui include.\n filter = match[3];\n\n // extract correct path for mixed combo urls\n // http://yuilibrary.com/projects/yui3/ticket/2528423\n if (match[1]) {\n path += '?' + match[1];\n }\n path = {\n filter: filter,\n path: path\n };\n }\n return path;\n },\n getBase: G_ENV && G_ENV.getBase ||\n function(pattern) {\n var nodes = (doc && doc.getElementsByTagName('script')) || [],\n path = Env.cdn, parsed,\n i, len, src;\n\n for (i = 0, len = nodes.length; i < len; ++i) {\n src = nodes[i].src;\n if (src) {\n parsed = Y.Env.parseBasePath(src, pattern);\n if (parsed) {\n filter = parsed.filter;\n path = parsed.path;\n break;\n }\n }\n }\n\n // use CDN default\n return path;\n }\n\n };\n\n Env = Y.Env;\n\n Env._loaded[VERSION] = {};\n\n if (G_ENV && Y !== YUI) {\n Env._yidx = ++G_ENV._yidx;\n Env._guidp = ('yui_' + VERSION + '_' +\n Env._yidx + '_' + time).replace(/[^a-z0-9_]+/g, '_');\n } else if (YUI._YUI) {\n\n G_ENV = YUI._YUI.Env;\n Env._yidx += G_ENV._yidx;\n Env._uidx += G_ENV._uidx;\n\n for (prop in G_ENV) {\n if (!(prop in Env)) {\n Env[prop] = G_ENV[prop];\n }\n }\n\n delete YUI._YUI;\n }\n\n Y.id = Y.stamp(Y);\n instances[Y.id] = Y;\n\n }\n\n Y.constructor = YUI;\n\n // configuration defaults\n Y.config = Y.config || {\n bootstrap: true,\n cacheUse: true,\n debug: true,\n doc: doc,\n fetchCSS: true,\n throwFail: true,\n useBrowserConsole: true,\n useNativeES5: true,\n win: win,\n global: Function('return this')()\n };\n\n //Register the CSS stamp element\n if (doc && !doc.getElementById(CSS_STAMP_EL)) {\n el = doc.createElement('div');\n el.innerHTML = '<div id=\"' + CSS_STAMP_EL + '\" style=\"position: absolute !important; visibility: hidden !important\"></div>';\n YUI.Env.cssStampEl = el.firstChild;\n if (doc.body) {\n doc.body.appendChild(YUI.Env.cssStampEl);\n } else {\n docEl.insertBefore(YUI.Env.cssStampEl, docEl.firstChild);\n }\n } else if (doc && doc.getElementById(CSS_STAMP_EL) && !YUI.Env.cssStampEl) {\n YUI.Env.cssStampEl = doc.getElementById(CSS_STAMP_EL);\n }\n\n Y.config.lang = Y.config.lang || 'en-US';\n\n Y.config.base = YUI.config.base || Y.Env.getBase(Y.Env._BASE_RE);\n\n if (!filter || (!('mindebug').indexOf(filter))) {\n filter = 'min';\n }\n filter = (filter) ? '-' + filter : filter;\n Y.config.loaderPath = YUI.config.loaderPath || 'loader/loader' + filter + '.js';\n\n },\n\n /**\n Finishes the instance setup. Attaches whatever YUI modules were defined\n at the time that this instance was created.\n\n @method _setup\n @private\n **/\n _setup: function() {\n var i, Y = this,\n core = [],\n mods = YUI.Env.mods,\n extras = Y.config.core || [].concat(YUI.Env.core); //Clone it..\n\n for (i = 0; i < extras.length; i++) {\n if (mods[extras[i]]) {\n core.push(extras[i]);\n }\n }\n\n Y._attach(['yui-base']);\n Y._attach(core);\n\n if (Y.Loader) {\n getLoader(Y);\n }\n\n // Y.log(Y.id + ' initialized', 'info', 'yui');\n },\n\n /**\n Executes the named method on the specified YUI instance if that method is\n whitelisted.\n\n @method applyTo\n @param {String} id YUI instance id.\n @param {String} method Name of the method to execute. For example:\n 'Object.keys'.\n @param {Array} args Arguments to apply to the method.\n @return {Mixed} Return value from the applied method, or `null` if the\n specified instance was not found or the method was not whitelisted.\n **/\n applyTo: function(id, method, args) {\n if (!(method in APPLY_TO_AUTH)) {\n this.log(method + ': applyTo not allowed', 'warn', 'yui');\n return null;\n }\n\n var instance = instances[id], nest, m, i;\n if (instance) {\n nest = method.split('.');\n m = instance;\n for (i = 0; i < nest.length; i = i + 1) {\n m = m[nest[i]];\n if (!m) {\n this.log('applyTo not found: ' + method, 'warn', 'yui');\n }\n }\n return m && m.apply(instance, args);\n }\n\n return null;\n },\n\n/**\nRegisters a YUI module and makes it available for use in a `YUI().use()` call or\nas a dependency for other modules.\n\nThe easiest way to create a first-class YUI module is to use\n<a href=\"http://yui.github.com/shifter/\">Shifter</a>, the YUI component build\ntool.\n\nShifter will automatically wrap your module code in a `YUI.add()` call along\nwith any configuration info required for the module.\n\n@example\n\n YUI.add('davglass', function (Y) {\n Y.davglass = function () {\n Y.log('Dav was here!');\n };\n }, '3.4.0', {\n requires: ['harley-davidson', 'mt-dew']\n });\n\n@method add\n@param {String} name Module name.\n@param {Function} fn Function containing module code. This function will be\n executed whenever the module is attached to a specific YUI instance.\n\n @param {YUI} fn.Y The YUI instance to which this module is attached.\n @param {String} fn.name Name of the module\n\n@param {String} version Module version number. This is currently used only for\n informational purposes, and is not used internally by YUI.\n\n@param {Object} [config] Module config.\n @param {Array} [config.requires] Array of other module names that must be\n attached before this module can be attached.\n @param {Array} [config.optional] Array of optional module names that should\n be attached before this module is attached if they've already been\n loaded. If the `loadOptional` YUI option is `true`, optional modules\n that have not yet been loaded will be loaded just as if they were hard\n requirements.\n @param {Array} [config.use] Array of module names that are included within\n or otherwise provided by this module, and which should be attached\n automatically when this module is attached. This makes it possible to\n create \"virtual rollup\" modules that simply attach a collection of other\n modules or submodules.\n\n@return {YUI} This YUI instance.\n**/\n add: function(name, fn, version, details) {\n details = details || {};\n var env = YUI.Env,\n mod = {\n name: name,\n fn: fn,\n version: version,\n details: details\n },\n //Instance hash so we don't apply it to the same instance twice\n applied = {},\n loader, inst,\n i, versions = env.versions;\n\n env.mods[name] = mod;\n versions[version] = versions[version] || {};\n versions[version][name] = mod;\n\n for (i in instances) {\n if (instances.hasOwnProperty(i)) {\n inst = instances[i];\n if (!applied[inst.id]) {\n applied[inst.id] = true;\n loader = inst.Env._loader;\n if (loader) {\n if (!loader.moduleInfo[name] || loader.moduleInfo[name].temp) {\n loader.addModule(details, name);\n }\n }\n }\n }\n }\n\n return this;\n },\n\n /**\n Executes the callback function associated with each required module,\n attaching the module to this YUI instance.\n\n @method _attach\n @param {Array} r The array of modules to attach\n @param {Boolean} [moot=false] If `true`, don't throw a warning if the module\n is not attached.\n @private\n **/\n _attach: function(r, moot) {\n var i, name, mod, details, req, use, after,\n mods = YUI.Env.mods,\n aliases = YUI.Env.aliases,\n Y = this, j,\n cache = YUI.Env._renderedMods,\n loader = Y.Env._loader,\n done = Y.Env._attached,\n len = r.length, loader, def, go,\n c = [];\n\n //Check for conditional modules (in a second+ instance) and add their requirements\n //TODO I hate this entire method, it needs to be fixed ASAP (3.5.0) ^davglass\n for (i = 0; i < len; i++) {\n name = r[i];\n mod = mods[name];\n c.push(name);\n if (loader && loader.conditions[name]) {\n for (j in loader.conditions[name]) {\n if (loader.conditions[name].hasOwnProperty(j)) {\n def = loader.conditions[name][j];\n go = def && ((def.ua && Y.UA[def.ua]) || (def.test && def.test(Y)));\n if (go) {\n c.push(def.name);\n }\n }\n }\n }\n }\n r = c;\n len = r.length;\n\n for (i = 0; i < len; i++) {\n if (!done[r[i]]) {\n name = r[i];\n mod = mods[name];\n\n if (aliases && aliases[name] && !mod) {\n Y._attach(aliases[name]);\n continue;\n }\n if (!mod) {\n if (loader && loader.moduleInfo[name]) {\n mod = loader.moduleInfo[name];\n moot = true;\n }\n\n // Y.log('no js def for: ' + name, 'info', 'yui');\n\n //if (!loader || !loader.moduleInfo[name]) {\n //if ((!loader || !loader.moduleInfo[name]) && !moot) {\n if (!moot && name) {\n if ((name.indexOf('skin-') === -1) && (name.indexOf('css') === -1)) {\n Y.Env._missed.push(name);\n Y.Env._missed = Y.Array.dedupe(Y.Env._missed);\n Y.message('NOT loaded: ' + name, 'warn', 'yui');\n }\n }\n } else {\n done[name] = true;\n //Don't like this, but in case a mod was asked for once, then we fetch it\n //We need to remove it from the missed list ^davglass\n for (j = 0; j < Y.Env._missed.length; j++) {\n if (Y.Env._missed[j] === name) {\n Y.message('Found: ' + name + ' (was reported as missing earlier)', 'warn', 'yui');\n Y.Env._missed.splice(j, 1);\n }\n }\n /*\n If it's a temp module, we need to redo it's requirements if it's already loaded\n since it may have been loaded by another instance and it's dependencies might\n have been redefined inside the fetched file.\n */\n if (loader && cache && cache[name] && cache[name].temp) {\n loader.getRequires(cache[name]);\n req = [];\n for (j in loader.moduleInfo[name].expanded_map) {\n if (loader.moduleInfo[name].expanded_map.hasOwnProperty(j)) {\n req.push(j);\n }\n }\n Y._attach(req);\n }\n\n details = mod.details;\n req = details.requires;\n use = details.use;\n after = details.after;\n //Force Intl load if there is a language (Loader logic) @todo fix this shit\n if (details.lang) {\n req = req || [];\n req.unshift('intl');\n }\n\n if (req) {\n for (j = 0; j < req.length; j++) {\n if (!done[req[j]]) {\n if (!Y._attach(req)) {\n return false;\n }\n break;\n }\n }\n }\n\n if (after) {\n for (j = 0; j < after.length; j++) {\n if (!done[after[j]]) {\n if (!Y._attach(after, true)) {\n return false;\n }\n break;\n }\n }\n }\n\n if (mod.fn) {\n if (Y.config.throwFail) {\n mod.fn(Y, name);\n } else {\n try {\n mod.fn(Y, name);\n } catch (e) {\n Y.error('Attach error: ' + name, e, name);\n return false;\n }\n }\n }\n\n if (use) {\n for (j = 0; j < use.length; j++) {\n if (!done[use[j]]) {\n if (!Y._attach(use)) {\n return false;\n }\n break;\n }\n }\n }\n\n\n\n }\n }\n }\n\n return true;\n },\n\n /**\n Delays the `use` callback until another event has taken place such as\n `window.onload`, `domready`, `contentready`, or `available`.\n\n @private\n @method _delayCallback\n @param {Function} cb The original `use` callback.\n @param {String|Object} until Either an event name ('load', 'domready', etc.)\n or an object containing event/args keys for contentready/available.\n @return {Function}\n **/\n _delayCallback: function(cb, until) {\n\n var Y = this,\n mod = ['event-base'];\n\n until = (Y.Lang.isObject(until) ? until : { event: until });\n\n if (until.event === 'load') {\n mod.push('event-synthetic');\n }\n\n Y.log('Delaying use callback until: ' + until.event, 'info', 'yui');\n return function() {\n Y.log('Use callback fired, waiting on delay', 'info', 'yui');\n var args = arguments;\n Y._use(mod, function() {\n Y.log('Delayed use wrapper callback after dependencies', 'info', 'yui');\n Y.on(until.event, function() {\n args[1].delayUntil = until.event;\n Y.log('Delayed use callback done after ' + until.event, 'info', 'yui');\n cb.apply(Y, args);\n }, until.args);\n });\n };\n },\n\n /**\n Attaches one or more modules to this YUI instance. When this is executed,\n the requirements of the desired modules are analyzed, and one of several\n things can happen:\n\n\n * All required modules have already been loaded, and just need to be\n attached to this YUI instance. In this case, the `use()` callback will\n be executed synchronously after the modules are attached.\n\n * One or more modules have not yet been loaded, or the Get utility is not\n available, or the `bootstrap` config option is `false`. In this case,\n a warning is issued indicating that modules are missing, but all\n available modules will still be attached and the `use()` callback will\n be executed synchronously.\n\n * One or more modules are missing and the Loader is not available but the\n Get utility is, and `bootstrap` is not `false`. In this case, the Get\n utility will be used to load the Loader, and we will then proceed to\n the following state:\n\n * One or more modules are missing and the Loader is available. In this\n case, the Loader will be used to resolve the dependency tree for the\n missing modules and load them and their dependencies. When the Loader is\n finished loading modules, the `use()` callback will be executed\n asynchronously.\n\n @example\n\n // Loads and attaches dd and its dependencies.\n YUI().use('dd', function (Y) {\n // ...\n });\n\n // Loads and attaches dd and node as well as all of their dependencies.\n YUI().use(['dd', 'node'], function (Y) {\n // ...\n });\n\n // Attaches all modules that have already been loaded.\n YUI().use('*', function (Y) {\n // ...\n });\n\n // Attaches a gallery module.\n YUI().use('gallery-yql', function (Y) {\n // ...\n });\n\n // Attaches a YUI 2in3 module.\n YUI().use('yui2-datatable', function (Y) {\n // ...\n });\n\n @method use\n @param {String|Array} modules* One or more module names to attach.\n @param {Function} [callback] Callback function to be executed once all\n specified modules and their dependencies have been attached.\n @param {YUI} callback.Y The YUI instance created for this sandbox.\n @param {Object} callback.status Object containing `success`, `msg` and\n `data` properties.\n @chainable\n **/\n use: function() {\n var args = SLICE.call(arguments, 0),\n callback = args[args.length - 1],\n Y = this,\n i = 0,\n name,\n Env = Y.Env,\n provisioned = true;\n\n // The last argument supplied to use can be a load complete callback\n if (Y.Lang.isFunction(callback)) {\n args.pop();\n if (Y.config.delayUntil) {\n callback = Y._delayCallback(callback, Y.config.delayUntil);\n }\n } else {\n callback = null;\n }\n if (Y.Lang.isArray(args[0])) {\n args = args[0];\n }\n\n if (Y.config.cacheUse) {\n while ((name = args[i++])) {\n if (!Env._attached[name]) {\n provisioned = false;\n break;\n }\n }\n\n if (provisioned) {\n if (args.length) {\n Y.log('already provisioned: ' + args, 'info', 'yui');\n }\n Y._notify(callback, ALREADY_DONE, args);\n return Y;\n }\n }\n\n if (Y._loading) {\n Y._useQueue = Y._useQueue || new Y.Queue();\n Y._useQueue.add([args, callback]);\n } else {\n Y._use(args, function(Y, response) {\n Y._notify(callback, response, args);\n });\n }\n\n return Y;\n },\n\n /**\n Handles Loader notifications about attachment/load errors.\n\n @method _notify\n @param {Function} callback Callback to pass to `Y.config.loadErrorFn`.\n @param {Object} response Response returned from Loader.\n @param {Array} args Arguments passed from Loader.\n @private\n **/\n _notify: function(callback, response, args) {\n if (!response.success && this.config.loadErrorFn) {\n this.config.loadErrorFn.call(this, this, callback, response, args);\n } else if (callback) {\n if (this.Env._missed && this.Env._missed.length) {\n response.msg = 'Missing modules: ' + this.Env._missed.join();\n response.success = false;\n }\n if (this.config.throwFail) {\n callback(this, response);\n } else {\n try {\n callback(this, response);\n } catch (e) {\n this.error('use callback error', e, args);\n }\n }\n }\n },\n\n /**\n Called from the `use` method queue to ensure that only one set of loading\n logic is performed at a time.\n\n @method _use\n @param {String} args* One or more modules to attach.\n @param {Function} [callback] Function to call once all required modules have\n been attached.\n @private\n **/\n _use: function(args, callback) {\n\n if (!this.Array) {\n this._attach(['yui-base']);\n }\n\n var len, loader, handleBoot,\n Y = this,\n G_ENV = YUI.Env,\n mods = G_ENV.mods,\n Env = Y.Env,\n used = Env._used,\n aliases = G_ENV.aliases,\n queue = G_ENV._loaderQueue,\n firstArg = args[0],\n YArray = Y.Array,\n config = Y.config,\n boot = config.bootstrap,\n missing = [],\n i,\n r = [],\n ret = true,\n fetchCSS = config.fetchCSS,\n process = function(names, skip) {\n\n var i = 0, a = [], name, len, m, req, use;\n\n if (!names.length) {\n return;\n }\n\n if (aliases) {\n len = names.length;\n for (i = 0; i < len; i++) {\n if (aliases[names[i]] && !mods[names[i]]) {\n a = [].concat(a, aliases[names[i]]);\n } else {\n a.push(names[i]);\n }\n }\n names = a;\n }\n\n len = names.length;\n\n for (i = 0; i < len; i++) {\n name = names[i];\n if (!skip) {\n r.push(name);\n }\n\n // only attach a module once\n if (used[name]) {\n continue;\n }\n\n m = mods[name];\n req = null;\n use = null;\n\n if (m) {\n used[name] = true;\n req = m.details.requires;\n use = m.details.use;\n } else {\n // CSS files don't register themselves, see if it has\n // been loaded\n if (!G_ENV._loaded[VERSION][name]) {\n missing.push(name);\n } else {\n used[name] = true; // probably css\n }\n }\n\n // make sure requirements are attached\n if (req && req.length) {\n process(req);\n }\n\n // make sure we grab the submodule dependencies too\n if (use && use.length) {\n process(use, 1);\n }\n }\n\n },\n\n handleLoader = function(fromLoader) {\n var response = fromLoader || {\n success: true,\n msg: 'not dynamic'\n },\n redo, origMissing,\n ret = true,\n data = response.data;\n\n Y._loading = false;\n\n if (data) {\n origMissing = missing;\n missing = [];\n r = [];\n process(data);\n redo = missing.length;\n if (redo) {\n if ([].concat(missing).sort().join() ==\n origMissing.sort().join()) {\n redo = false;\n }\n }\n }\n\n if (redo && data) {\n Y._loading = true;\n Y._use(missing, function() {\n Y.log('Nested use callback: ' + data, 'info', 'yui');\n if (Y._attach(data)) {\n Y._notify(callback, response, data);\n }\n });\n } else {\n if (data) {\n // Y.log('attaching from loader: ' + data, 'info', 'yui');\n ret = Y._attach(data);\n }\n if (ret) {\n Y._notify(callback, response, args);\n }\n }\n\n if (Y._useQueue && Y._useQueue.size() && !Y._loading) {\n Y._use.apply(Y, Y._useQueue.next());\n }\n\n };\n\n// Y.log(Y.id + ': use called: ' + a + ' :: ' + callback, 'info', 'yui');\n\n // YUI().use('*'); // bind everything available\n if (firstArg === '*') {\n args = [];\n for (i in mods) {\n if (mods.hasOwnProperty(i)) {\n args.push(i);\n }\n }\n ret = Y._attach(args);\n if (ret) {\n handleLoader();\n }\n return Y;\n }\n\n if ((mods.loader || mods['loader-base']) && !Y.Loader) {\n Y.log('Loader was found in meta, but it is not attached. Attaching..', 'info', 'yui');\n Y._attach(['loader' + ((!mods.loader) ? '-base' : '')]);\n }\n\n // Y.log('before loader requirements: ' + args, 'info', 'yui');\n\n // use loader to expand dependencies and sort the\n // requirements if it is available.\n if (boot && Y.Loader && args.length) {\n Y.log('Using loader to expand dependencies', 'info', 'yui');\n loader = getLoader(Y);\n loader.require(args);\n loader.ignoreRegistered = true;\n loader._boot = true;\n loader.calculate(null, (fetchCSS) ? null : 'js');\n args = loader.sorted;\n loader._boot = false;\n }\n\n process(args);\n\n len = missing.length;\n\n\n if (len) {\n missing = YArray.dedupe(missing);\n len = missing.length;\nY.log('Modules missing: ' + missing + ', ' + missing.length, 'info', 'yui');\n }\n\n\n // dynamic load\n if (boot && len && Y.Loader) {\n// Y.log('Using loader to fetch missing deps: ' + missing, 'info', 'yui');\n Y.log('Using Loader', 'info', 'yui');\n Y._loading = true;\n loader = getLoader(Y);\n loader.onEnd = handleLoader;\n loader.context = Y;\n loader.data = args;\n loader.ignoreRegistered = false;\n loader.require(missing);\n loader.insert(null, (fetchCSS) ? null : 'js');\n\n } else if (boot && len && Y.Get && !Env.bootstrapped) {\n\n Y._loading = true;\n\n handleBoot = function() {\n Y._loading = false;\n queue.running = false;\n Env.bootstrapped = true;\n G_ENV._bootstrapping = false;\n if (Y._attach(['loader'])) {\n Y._use(args, callback);\n }\n };\n\n if (G_ENV._bootstrapping) {\nY.log('Waiting for loader', 'info', 'yui');\n queue.add(handleBoot);\n } else {\n G_ENV._bootstrapping = true;\nY.log('Fetching loader: ' + config.base + config.loaderPath, 'info', 'yui');\n Y.Get.script(config.base + config.loaderPath, {\n onEnd: handleBoot\n });\n }\n\n } else {\n Y.log('Attaching available dependencies: ' + args, 'info', 'yui');\n ret = Y._attach(args);\n if (ret) {\n handleLoader();\n }\n }\n\n return Y;\n },\n\n\n /**\n Utility method for safely creating namespaces if they don't already exist.\n May be called statically on the YUI global object or as a method on a YUI\n instance.\n\n When called statically, a namespace will be created on the YUI global\n object:\n\n // Create `YUI.your.namespace.here` as nested objects, preserving any\n // objects that already exist instead of overwriting them.\n YUI.namespace('your.namespace.here');\n\n When called as a method on a YUI instance, a namespace will be created on\n that instance:\n\n // Creates `Y.property.package`.\n Y.namespace('property.package');\n\n Dots in the input string cause `namespace` to create nested objects for each\n token. If any part of the requested namespace already exists, the current\n object will be left in place and will not be overwritten. This allows\n multiple calls to `namespace` to preserve existing namespaced properties.\n\n If the first token in the namespace string is \"YAHOO\", that token is\n discarded. This is legacy behavior for backwards compatibility with YUI 2.\n\n Be careful with namespace tokens. Reserved words may work in some browsers\n and not others. For instance, the following will fail in some browsers\n because the supported version of JavaScript reserves the word \"long\":\n\n Y.namespace('really.long.nested.namespace');\n\n Note: If you pass multiple arguments to create multiple namespaces, only the\n last one created is returned from this function.\n\n @method namespace\n @param {String} namespace* One or more namespaces to create.\n @return {Object} Reference to the last namespace object created.\n **/\n namespace: function() {\n var a = arguments, o, i = 0, j, d, arg;\n\n for (; i < a.length; i++) {\n o = this; //Reset base object per argument or it will get reused from the last\n arg = a[i];\n if (arg.indexOf(PERIOD) > -1) { //Skip this if no \".\" is present\n d = arg.split(PERIOD);\n for (j = (d[0] == 'YAHOO') ? 1 : 0; j < d.length; j++) {\n o[d[j]] = o[d[j]] || {};\n o = o[d[j]];\n }\n } else {\n o[arg] = o[arg] || {};\n o = o[arg]; //Reset base object to the new object so it's returned\n }\n }\n return o;\n },\n\n // this is replaced if the log module is included\n log: NOOP,\n message: NOOP,\n // this is replaced if the dump module is included\n dump: function (o) { return ''+o; },\n\n /**\n Reports an error.\n\n The reporting mechanism is controlled by the `throwFail` configuration\n attribute. If `throwFail` is falsy, the message is logged. If `throwFail` is\n truthy, a JS exception is thrown.\n\n If an `errorFn` is specified in the config it must return `true` to indicate\n that the exception was handled and keep it from being thrown.\n\n @method error\n @param {String} msg Error message.\n @param {Error|String} [e] JavaScript error object or an error string.\n @param {String} [src] Source of the error (such as the name of the module in\n which the error occurred).\n @chainable\n **/\n error: function(msg, e, src) {\n //TODO Add check for window.onerror here\n\n var Y = this, ret;\n\n if (Y.config.errorFn) {\n ret = Y.config.errorFn.apply(Y, arguments);\n }\n\n if (!ret) {\n throw (e || new Error(msg));\n } else {\n Y.message(msg, 'error', ''+src); // don't scrub this one\n }\n\n return Y;\n },\n\n /**\n Generates an id string that is unique among all YUI instances in this\n execution context.\n\n @method guid\n @param {String} [pre] Prefix.\n @return {String} Unique id.\n **/\n guid: function(pre) {\n var id = this.Env._guidp + '_' + (++this.Env._uidx);\n return (pre) ? (pre + id) : id;\n },\n\n /**\n Returns a unique id associated with the given object and (if *readOnly* is\n falsy) stamps the object with that id so it can be identified in the future.\n\n Stamping an object involves adding a `_yuid` property to it that contains\n the object's id. One exception to this is that in Internet Explorer, DOM\n nodes have a `uniqueID` property that contains a browser-generated unique\n id, which will be used instead of a YUI-generated id when available.\n\n @method stamp\n @param {Object} o Object to stamp.\n @param {Boolean} readOnly If truthy and the given object has not already\n been stamped, the object will not be modified and `null` will be\n returned.\n @return {String} Object's unique id, or `null` if *readOnly* was truthy and\n the given object was not already stamped.\n **/\n stamp: function(o, readOnly) {\n var uid;\n if (!o) {\n return o;\n }\n\n // IE generates its own unique ID for dom nodes\n // The uniqueID property of a document node returns a new ID\n if (o.uniqueID && o.nodeType && o.nodeType !== 9) {\n uid = o.uniqueID;\n } else {\n uid = (typeof o === 'string') ? o : o._yuid;\n }\n\n if (!uid) {\n uid = this.guid();\n if (!readOnly) {\n try {\n o._yuid = uid;\n } catch (e) {\n uid = null;\n }\n }\n }\n return uid;\n },\n\n /**\n Destroys this YUI instance.\n\n @method destroy\n @since 3.3.0\n **/\n destroy: function() {\n var Y = this;\n if (Y.Event) {\n Y.Event._unload();\n }\n delete instances[Y.id];\n delete Y.Env;\n delete Y.config;\n }\n\n /**\n Safe `instanceof` wrapper that works around a memory leak in IE when the\n object being tested is `window` or `document`.\n\n Unless you are testing objects that may be `window` or `document`, you\n should use the native `instanceof` operator instead of this method.\n\n @method instanceOf\n @param {Object} o Object to check.\n @param {Object} type Class to check against.\n @since 3.3.0\n **/\n};\n\n YUI.prototype = proto;\n\n // inheritance utilities are not available yet\n for (prop in proto) {\n if (proto.hasOwnProperty(prop)) {\n YUI[prop] = proto[prop];\n }\n }\n\n /**\n Applies a configuration to all YUI instances in this execution context.\n\n The main use case for this method is in \"mashups\" where several third-party\n scripts need to write to a global YUI config, but cannot share a single\n centrally-managed config object. This way they can all call\n `YUI.applyConfig({})` instead of overwriting the single global config.\n\n @example\n\n YUI.applyConfig({\n modules: {\n davglass: {\n fullpath: './davglass.js'\n }\n }\n });\n\n YUI.applyConfig({\n modules: {\n foo: {\n fullpath: './foo.js'\n }\n }\n });\n\n YUI().use('davglass', function (Y) {\n // Module davglass will be available here.\n });\n\n @method applyConfig\n @param {Object} o Configuration object to apply.\n @static\n @since 3.5.0\n **/\n YUI.applyConfig = function(o) {\n if (!o) {\n return;\n }\n //If there is a GlobalConfig, apply it first to set the defaults\n if (YUI.GlobalConfig) {\n this.prototype.applyConfig.call(this, YUI.GlobalConfig);\n }\n //Apply this config to it\n this.prototype.applyConfig.call(this, o);\n //Reset GlobalConfig to the combined config\n YUI.GlobalConfig = this.config;\n };\n\n // set up the environment\n YUI._init();\n\n if (hasWin) {\n // add a window load event at load time so we can capture\n // the case where it fires before dynamic loading is\n // complete.\n add(window, 'load', handleLoad);\n } else {\n handleLoad();\n }\n\n YUI.Env.add = add;\n YUI.Env.remove = remove;\n\n /*global exports*/\n // Support the CommonJS method for exporting our single global\n if (typeof exports == 'object') {\n exports.YUI = YUI;\n /**\n * Set a method to be called when `Get.script` is called in Node.js\n * `Get` will open the file, then pass it's content and it's path\n * to this method before attaching it. Commonly used for code coverage\n * instrumentation. <strong>Calling this multiple times will only\n * attach the last hook method</strong>. This method is only\n * available in Node.js.\n * @method setLoadHook\n * @static\n * @param {Function} fn The function to set\n * @param {String} fn.data The content of the file\n * @param {String} fn.path The file path of the file\n */\n YUI.setLoadHook = function(fn) {\n YUI._getLoadHook = fn;\n };\n /**\n * Load hook for `Y.Get.script` in Node.js, see `YUI.setLoadHook`\n * @method _getLoadHook\n * @private\n * @param {String} data The content of the file\n * @param {String} path The file path of the file\n */\n YUI._getLoadHook = null;\n }\n\n}());\n\n\n/**\nConfig object that contains all of the configuration options for\nthis `YUI` instance.\n\nThis object is supplied by the implementer when instantiating YUI. Some\nproperties have default values if they are not supplied by the implementer.\n\nThis object should not be updated directly because some values are cached. Use\n`applyConfig()` to update the config object on a YUI instance that has already\nbeen configured.\n\n@class config\n@static\n**/\n\n/**\nIf `true` (the default), YUI will \"bootstrap\" the YUI Loader and module metadata\nif they're needed to load additional dependencies and aren't already available.\n\nSetting this to `false` will prevent YUI from automatically loading the Loader\nand module metadata, so you will need to manually ensure that they're available\nor handle dependency resolution yourself.\n\n@property {Boolean} bootstrap\n@default true\n**/\n\n/**\nIf `true`, `Y.log()` messages will be written to the browser's debug console\nwhen available and when `useBrowserConsole` is also `true`.\n\n@property {Boolean} debug\n@default true\n**/\n\n/**\nLog messages to the browser console if `debug` is `true` and the browser has a\nsupported console.\n\n@property {Boolean} useBrowserConsole\n@default true\n**/\n\n/**\nA hash of log sources that should be logged. If specified, only messages from\nthese sources will be logged. Others will be discarded.\n\n@property {Object} logInclude\n@type object\n**/\n\n/**\nA hash of log sources that should be not be logged. If specified, all sources\nwill be logged *except* those on this list.\n\n@property {Object} logExclude\n**/\n\n/**\nWhen the YUI seed file is dynamically loaded after the `window.onload` event has\nfired, set this to `true` to tell YUI that it shouldn't wait for `window.onload`\nto occur.\n\nThis ensures that components that rely on `window.onload` and the `domready`\ncustom event will work as expected even when YUI is dynamically injected.\n\n@property {Boolean} injected\n@default false\n**/\n\n/**\nIf `true`, `Y.error()` will generate or re-throw a JavaScript error. Otherwise,\nerrors are merely logged silently.\n\n@property {Boolean} throwFail\n@default true\n**/\n\n/**\nReference to the global object for this execution context.\n\nIn a browser, this is the current `window` object. In Node.js, this is the\nNode.js `global` object.\n\n@property {Object} global\n**/\n\n/**\nThe browser window or frame that this YUI instance should operate in.\n\nWhen running in Node.js, this property is `undefined`, since there is no\n`window` object. Use `global` to get a reference to the global object that will\nwork in both browsers and Node.js.\n\n@property {Window} win\n**/\n\n/**\nThe browser `document` object associated with this YUI instance's `win` object.\n\nWhen running in Node.js, this property is `undefined`, since there is no\n`document` object.\n\n@property {Document} doc\n**/\n\n/**\nA list of modules that defines the YUI core (overrides the default list).\n\n@property {Array} core\n@type Array\n@default ['get', 'features', 'intl-base', 'yui-log', 'yui-later', 'loader-base', 'loader-rollup', 'loader-yui3']\n**/\n\n/**\nA list of languages to use in order of preference.\n\nThis list is matched against the list of available languages in modules that the\nYUI instance uses to determine the best possible localization of language\nsensitive modules.\n\nLanguages are represented using BCP 47 language tags, such as \"en-GB\" for\nEnglish as used in the United Kingdom, or \"zh-Hans-CN\" for simplified Chinese as\nused in China. The list may be provided as a comma-separated string or as an\narray.\n\n@property {String|String[]} lang\n**/\n\n/**\nDefault date format.\n\n@property {String} dateFormat\n@deprecated Use configuration in `DataType.Date.format()` instead.\n**/\n\n/**\nDefault locale.\n\n@property {String} locale\n@deprecated Use `config.lang` instead.\n**/\n\n/**\nDefault generic polling interval in milliseconds.\n\n@property {Number} pollInterval\n@default 20\n**/\n\n/**\nThe number of dynamic `<script>` nodes to insert by default before automatically\nremoving them when loading scripts.\n\nThis applies only to script nodes because removing the node will not make the\nevaluated script unavailable. Dynamic CSS nodes are not auto purged, because\nremoving a linked style sheet will also remove the style definitions.\n\n@property {Number} purgethreshold\n@default 20\n**/\n\n/**\nDelay in milliseconds to wait after a window `resize` event before firing the\nevent. If another `resize` event occurs before this delay has elapsed, the\ndelay will start over to ensure that `resize` events are throttled.\n\n@property {Number} windowResizeDelay\n@default 40\n**/\n\n/**\nBase directory for dynamic loading.\n\n@property {String} base\n**/\n\n/**\nBase URL for a dynamic combo handler. This will be used to make combo-handled\nmodule requests if `combine` is set to `true.\n\n@property {String} comboBase\n@default \"http://yui.yahooapis.com/combo?\"\n**/\n\n/**\nRoot path to prepend to each module path when creating a combo-handled request.\n\nThis is updated for each YUI release to point to a specific version of the\nlibrary; for example: \"3.8.0/build/\".\n\n@property {String} root\n**/\n\n/**\nFilter to apply to module urls. This filter will modify the default path for all\nmodules.\n\nThe default path for the YUI library is the minified version of the files (e.g.,\nevent-min.js). The filter property can be a predefined filter or a custom\nfilter. The valid predefined filters are:\n\n - **debug**: Loads debug versions of modules (e.g., event-debug.js).\n - **raw**: Loads raw, non-minified versions of modules without debug logging\n (e.g., event.js).\n\nYou can also define a custom filter, which must be an object literal containing\na search regular expression and a replacement string:\n\n myFilter: {\n searchExp : \"-min\\\\.js\",\n replaceStr: \"-debug.js\"\n }\n\n@property {Object|String} filter\n**/\n\n/**\nSkin configuration and customizations.\n\n@property {Object} skin\n@param {String} [skin.defaultSkin='sam'] Default skin name. This skin will be\n applied automatically to skinnable components if not overridden by a\n component-specific skin name.\n@param {String} [skin.base='assets/skins/'] Default base path for a skin,\n relative to Loader's `base` path.\n@param {Object} [skin.overrides] Component-specific skin name overrides. Specify\n a component name as the key and, as the value, a string or array of strings\n for a skin or skins that should be loaded for that component instead of the\n `defaultSkin`.\n**/\n\n/**\nHash of per-component filter specifications. If specified for a given component,\nthis overrides the global `filter` config.\n\n@property {Object} filters\n**/\n\n/**\nIf `true`, YUI will use a combo handler to load multiple modules in as few\nrequests as possible.\n\nThe YUI CDN (which YUI uses by default) supports combo handling, but other\nservers may not. If the server from which you're loading YUI does not support\ncombo handling, set this to `false`.\n\nProviding a value for the `base` config property will cause `combine` to default\nto `false` instead of `true`.\n\n@property {Boolean} combine\n@default true\n*/\n\n/**\nArray of module names that should never be dynamically loaded.\n\n@property {String[]} ignore\n**/\n\n/**\nArray of module names that should always be loaded when required, even if\nalready present on the page.\n\n@property {String[]} force\n**/\n\n/**\nDOM element or id that should be used as the insertion point for dynamically\nadded `<script>` and `<link>` nodes.\n\n@property {HTMLElement|String} insertBefore\n**/\n\n/**\nObject hash containing attributes to add to dynamically added `<script>` nodes.\n\n@property {Object} jsAttributes\n**/\n\n/**\nObject hash containing attributes to add to dynamically added `<link>` nodes.\n\n@property {Object} cssAttributes\n**/\n\n/**\nTimeout in milliseconds before a dynamic JS or CSS request will be considered a\nfailure. If not set, no timeout will be enforced.\n\n@property {Number} timeout\n**/\n\n/**\nCallback for the 'CSSComplete' event. When dynamically loading YUI components\nwith CSS, this property fires when the CSS is finished loading.\n\nThis provides an opportunity to enhance the presentation of a loading page a\nlittle bit before the entire loading process is done.\n\n@property {Function} onCSS\n**/\n\n/**\nA hash of module definitions to add to the list of available YUI modules. These\nmodules can then be dynamically loaded via the `use()` method.\n\nThis is a hash in which keys are module names and values are objects containing\nmodule metadata.\n\nSee `Loader.addModule()` for the supported module metadata fields. Also see\n`groups`, which provides a way to configure the base and combo spec for a set of\nmodules.\n\n@example\n\n modules: {\n mymod1: {\n requires: ['node'],\n fullpath: '/mymod1/mymod1.js'\n },\n\n mymod2: {\n requires: ['mymod1'],\n fullpath: '/mymod2/mymod2.js'\n },\n\n mymod3: '/js/mymod3.js',\n mycssmod: '/css/mycssmod.css'\n }\n\n@property {Object} modules\n**/\n\n/**\nAliases are dynamic groups of modules that can be used as shortcuts.\n\n@example\n\n YUI({\n aliases: {\n davglass: [ 'node', 'yql', 'dd' ],\n mine: [ 'davglass', 'autocomplete']\n }\n }).use('mine', function (Y) {\n // Node, YQL, DD & AutoComplete available here.\n });\n\n@property {Object} aliases\n**/\n\n/**\nA hash of module group definitions.\n\nFor each group you can specify a list of modules and the base path and\ncombo spec to use when dynamically loading the modules.\n\n@example\n\n groups: {\n yui2: {\n // specify whether or not this group has a combo service\n combine: true,\n\n // The comboSeperator to use with this group's combo handler\n comboSep: ';',\n\n // The maxURLLength for this server\n maxURLLength: 500,\n\n // the base path for non-combo paths\n base: 'http://yui.yahooapis.com/2.8.0r4/build/',\n\n // the path to the combo service\n comboBase: 'http://yui.yahooapis.com/combo?',\n\n // a fragment to prepend to the path attribute when\n // when building combo urls\n root: '2.8.0r4/build/',\n\n // the module definitions\n modules: {\n yui2_yde: {\n path: \"yahoo-dom-event/yahoo-dom-event.js\"\n },\n yui2_anim: {\n path: \"animation/animation.js\",\n requires: ['yui2_yde']\n }\n }\n }\n }\n\n@property {Object} groups\n**/\n\n/**\nPath to the Loader JS file, relative to the `base` path.\n\nThis is used to dynamically bootstrap the Loader when it's needed and isn't yet\navailable.\n\n@property {String} loaderPath\n@default \"loader/loader-min.js\"\n**/\n\n/**\nIf `true`, YUI will attempt to load CSS dependencies and skins. Set this to\n`false` to prevent YUI from loading any CSS, or set it to the string `\"force\"`\nto force CSS dependencies to be loaded even if their associated JS modules are\nalready loaded.\n\n@property {Boolean|String} fetchCSS\n@default true\n**/\n\n/**\nDefault gallery version used to build gallery module urls.\n\n@property {String} gallery\n@since 3.1.0\n**/\n\n/**\nDefault YUI 2 version used to build YUI 2 module urls.\n\nThis is used for intrinsic YUI 2 support via the 2in3 project. Also see the\n`2in3` config for pulling different revisions of the wrapped YUI 2 modules.\n\n@property {String} yui2\n@default \"2.9.0\"\n@since 3.1.0\n**/\n\n/**\nRevision number of YUI 2in3 modules that should be used when loading YUI 2in3.\n\n@property {String} 2in3\n@default \"4\"\n@since 3.1.0\n**/\n\n/**\nAlternate console log function that should be used in environments without a\nsupported native console. This function is executed with the YUI instance as its\n`this` object.\n\n@property {Function} logFn\n@since 3.1.0\n**/\n\n/**\nCallback to execute when `Y.error()` is called. It receives the error message\nand a JavaScript error object if one was provided.\n\nThis function is executed with the YUI instance as its `this` object.\n\nReturning `true` from this function will prevent an exception from being thrown.\n\n@property {Function} errorFn\n@param {String} errorFn.msg Error message\n@param {Object} [errorFn.err] Error object (if one was provided).\n@since 3.2.0\n**/\n\n/**\nA callback to execute when Loader fails to load one or more resources.\n\nThis could be because of a script load failure. It could also be because a\nmodule fails to register itself when the `requireRegistration` config is `true`.\n\nIf this function is defined, the `use()` callback will only be called when the\nloader succeeds. Otherwise, `use()` will always executes unless there was a\nJavaScript error when attaching a module.\n\n@property {Function} loadErrorFn\n@since 3.3.0\n**/\n\n/**\nIf `true`, Loader will expect all loaded scripts to be first-class YUI modules\nthat register themselves with the YUI global, and will trigger a failure if a\nloaded script does not register a YUI module.\n\n@property {Boolean} requireRegistration\n@default false\n@since 3.3.0\n**/\n\n/**\nCache serviced use() requests.\n\n@property {Boolean} cacheUse\n@default true\n@since 3.3.0\n@deprecated No longer used.\n**/\n\n/**\nWhether or not YUI should use native ES5 functionality when available for\nfeatures like `Y.Array.each()`, `Y.Object()`, etc.\n\nWhen `false`, YUI will always use its own fallback implementations instead of\nrelying on ES5 functionality, even when ES5 functionality is available.\n\n@property {Boolean} useNativeES5\n@default true\n@since 3.5.0\n**/\n\n/**\n * Leverage native JSON stringify if the browser has a native\n * implementation. In general, this is a good idea. See the Known Issues\n * section in the JSON user guide for caveats. The default value is true\n * for browsers with native JSON support.\n *\n * @property useNativeJSONStringify\n * @type Boolean\n * @default true\n * @since 3.8.0\n */\n\n /**\n * Leverage native JSON parse if the browser has a native implementation.\n * In general, this is a good idea. See the Known Issues section in the\n * JSON user guide for caveats. The default value is true for browsers with\n * native JSON support.\n *\n * @property useNativeJSONParse\n * @type Boolean\n * @default true\n * @since 3.8.0\n */\n\n/**\nDelay the `use` callback until a specific event has passed (`load`, `domready`, `contentready` or `available`)\n@property delayUntil\n@type String|Object\n@since 3.6.0\n@example\n\nYou can use `load` or `domready` strings by default:\n\n YUI({\n delayUntil: 'domready'\n }, function (Y) {\n // This will not execute until 'domeready' occurs.\n });\n\nOr you can delay until a node is available (with `available` or `contentready`):\n\n YUI({\n delayUntil: {\n event: 'available',\n args : '#foo'\n }\n }, function (Y) {\n // This will not execute until a node matching the selector \"#foo\" is\n // available in the DOM.\n });\n\n@property {Object|String} delayUntil\n@since 3.6.0\n**/\nYUI.add('yui-base', function (Y, NAME) {\n\n/*\n * YUI stub\n * @module yui\n * @submodule yui-base\n */\n/**\n * The YUI module contains the components required for building the YUI\n * seed file. This includes the script loading mechanism, a simple queue,\n * and the core utilities for the library.\n * @module yui\n * @submodule yui-base\n */\n\n/**\n * Provides core language utilites and extensions used throughout YUI.\n *\n * @class Lang\n * @static\n */\n\nvar L = Y.Lang || (Y.Lang = {}),\n\nSTRING_PROTO = String.prototype,\nTOSTRING = Object.prototype.toString,\n\nTYPES = {\n 'undefined' : 'undefined',\n 'number' : 'number',\n 'boolean' : 'boolean',\n 'string' : 'string',\n '[object Function]': 'function',\n '[object RegExp]' : 'regexp',\n '[object Array]' : 'array',\n '[object Date]' : 'date',\n '[object Error]' : 'error'\n},\n\nSUBREGEX = /\\{\\s*([^|}]+?)\\s*(?:\\|([^}]*))?\\s*\\}/g,\nTRIMREGEX = /^\\s+|\\s+$/g,\nNATIVE_FN_REGEX = /\\{\\s*\\[(?:native code|function)\\]\\s*\\}/i;\n\n// -- Protected Methods --------------------------------------------------------\n\n/**\nReturns `true` if the given function appears to be implemented in native code,\n`false` otherwise. Will always return `false` -- even in ES5-capable browsers --\nif the `useNativeES5` YUI config option is set to `false`.\n\nThis isn't guaranteed to be 100% accurate and won't work for anything other than\nfunctions, but it can be useful for determining whether a function like\n`Array.prototype.forEach` is native or a JS shim provided by another library.\n\nThere's a great article by @kangax discussing certain flaws with this technique:\n<http://perfectionkills.com/detecting-built-in-host-methods/>\n\nWhile his points are valid, it's still possible to benefit from this function\nas long as it's used carefully and sparingly, and in such a way that false\nnegatives have minimal consequences. It's used internally to avoid using\npotentially broken non-native ES5 shims that have been added to the page by\nother libraries.\n\n@method _isNative\n@param {Function} fn Function to test.\n@return {Boolean} `true` if _fn_ appears to be native, `false` otherwise.\n@static\n@protected\n@since 3.5.0\n**/\nL._isNative = function (fn) {\n return !!(Y.config.useNativeES5 && fn && NATIVE_FN_REGEX.test(fn));\n};\n\n// -- Public Methods -----------------------------------------------------------\n\n/**\n * Determines whether or not the provided item is an array.\n *\n * Returns `false` for array-like collections such as the function `arguments`\n * collection or `HTMLElement` collections. Use `Y.Array.test()` if you want to\n * test for an array-like collection.\n *\n * @method isArray\n * @param o The object to test.\n * @return {boolean} true if o is an array.\n * @static\n */\nL.isArray = L._isNative(Array.isArray) ? Array.isArray : function (o) {\n return L.type(o) === 'array';\n};\n\n/**\n * Determines whether or not the provided item is a boolean.\n * @method isBoolean\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is a boolean.\n */\nL.isBoolean = function(o) {\n return typeof o === 'boolean';\n};\n\n/**\n * Determines whether or not the supplied item is a date instance.\n * @method isDate\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is a date.\n */\nL.isDate = function(o) {\n return L.type(o) === 'date' && o.toString() !== 'Invalid Date' && !isNaN(o);\n};\n\n/**\n * <p>\n * Determines whether or not the provided item is a function.\n * Note: Internet Explorer thinks certain functions are objects:\n * </p>\n *\n * <pre>\n * var obj = document.createElement(\"object\");\n * Y.Lang.isFunction(obj.getAttribute) // reports false in IE\n * \n * var input = document.createElement(\"input\"); // append to body\n * Y.Lang.isFunction(input.focus) // reports false in IE\n * </pre>\n *\n * <p>\n * You will have to implement additional tests if these functions\n * matter to you.\n * </p>\n *\n * @method isFunction\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is a function.\n */\nL.isFunction = function(o) {\n return L.type(o) === 'function';\n};\n\n/**\n * Determines whether or not the provided item is null.\n * @method isNull\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is null.\n */\nL.isNull = function(o) {\n return o === null;\n};\n\n/**\n * Determines whether or not the provided item is a legal number.\n * @method isNumber\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is a number.\n */\nL.isNumber = function(o) {\n return typeof o === 'number' && isFinite(o);\n};\n\n/**\n * Determines whether or not the provided item is of type object\n * or function. Note that arrays are also objects, so\n * <code>Y.Lang.isObject([]) === true</code>.\n * @method isObject\n * @static\n * @param o The object to test.\n * @param failfn {boolean} fail if the input is a function.\n * @return {boolean} true if o is an object.\n * @see isPlainObject\n */\nL.isObject = function(o, failfn) {\n var t = typeof o;\n return (o && (t === 'object' ||\n (!failfn && (t === 'function' || L.isFunction(o))))) || false;\n};\n\n/**\n * Determines whether or not the provided item is a string.\n * @method isString\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is a string.\n */\nL.isString = function(o) {\n return typeof o === 'string';\n};\n\n/**\n * Determines whether or not the provided item is undefined.\n * @method isUndefined\n * @static\n * @param o The object to test.\n * @return {boolean} true if o is undefined.\n */\nL.isUndefined = function(o) {\n return typeof o === 'undefined';\n};\n\n/**\n * A convenience method for detecting a legitimate non-null value.\n * Returns false for null/undefined/NaN, true for other values,\n * including 0/false/''\n * @method isValue\n * @static\n * @param o The item to test.\n * @return {boolean} true if it is not null/undefined/NaN || false.\n */\nL.isValue = function(o) {\n var t = L.type(o);\n\n switch (t) {\n case 'number':\n return isFinite(o);\n\n case 'null': // fallthru\n case 'undefined':\n return false;\n\n default:\n return !!t;\n }\n};\n\n/**\n * Returns the current time in milliseconds.\n *\n * @method now\n * @return {Number} Current time in milliseconds.\n * @static\n * @since 3.3.0\n */\nL.now = Date.now || function () {\n return new Date().getTime();\n};\n\n/**\n * Lightweight version of <code>Y.substitute</code>. Uses the same template\n * structure as <code>Y.substitute</code>, but doesn't support recursion,\n * auto-object coersion, or formats.\n * @method sub\n * @param {string} s String to be modified.\n * @param {object} o Object containing replacement values.\n * @return {string} the substitute result.\n * @static\n * @since 3.2.0\n */\nL.sub = function(s, o) {\n return s.replace ? s.replace(SUBREGEX, function (match, key) {\n return L.isUndefined(o[key]) ? match : o[key];\n }) : s;\n};\n\n/**\n * Returns a string without any leading or trailing whitespace. If\n * the input is not a string, the input will be returned untouched.\n * @method trim\n * @static\n * @param s {string} the string to trim.\n * @return {string} the trimmed string.\n */\nL.trim = STRING_PROTO.trim ? function(s) {\n return s && s.trim ? s.trim() : s;\n} : function (s) {\n try {\n return s.replace(TRIMREGEX, '');\n } catch (e) {\n return s;\n }\n};\n\n/**\n * Returns a string without any leading whitespace.\n * @method trimLeft\n * @static\n * @param s {string} the string to trim.\n * @return {string} the trimmed string.\n */\nL.trimLeft = STRING_PROTO.trimLeft ? function (s) {\n return s.trimLeft();\n} : function (s) {\n return s.replace(/^\\s+/, '');\n};\n\n/**\n * Returns a string without any trailing whitespace.\n * @method trimRight\n * @static\n * @param s {string} the string to trim.\n * @return {string} the trimmed string.\n */\nL.trimRight = STRING_PROTO.trimRight ? function (s) {\n return s.trimRight();\n} : function (s) {\n return s.replace(/\\s+$/, '');\n};\n\n/**\nReturns one of the following strings, representing the type of the item passed\nin:\n\n * \"array\"\n * \"boolean\"\n * \"date\"\n * \"error\"\n * \"function\"\n * \"null\"\n * \"number\"\n * \"object\"\n * \"regexp\"\n * \"string\"\n * \"undefined\"\n\nKnown issues:\n\n * `typeof HTMLElementCollection` returns function in Safari, but\n `Y.Lang.type()` reports \"object\", which could be a good thing --\n but it actually caused the logic in <code>Y.Lang.isObject</code> to fail.\n\n@method type\n@param o the item to test.\n@return {string} the detected type.\n@static\n**/\nL.type = function(o) {\n return TYPES[typeof o] || TYPES[TOSTRING.call(o)] || (o ? 'object' : 'null');\n};\n/**\n@module yui\n@submodule yui-base\n*/\n\nvar Lang = Y.Lang,\n Native = Array.prototype,\n\n hasOwn = Object.prototype.hasOwnProperty;\n\n/**\nProvides utility methods for working with arrays. Additional array helpers can\nbe found in the `collection` and `array-extras` modules.\n\n`Y.Array(thing)` returns a native array created from _thing_. Depending on\n_thing_'s type, one of the following will happen:\n\n * Arrays are returned unmodified unless a non-zero _startIndex_ is\n specified.\n * Array-like collections (see `Array.test()`) are converted to arrays.\n * For everything else, a new array is created with _thing_ as the sole\n item.\n\nNote: elements that are also collections, such as `<form>` and `<select>`\nelements, are not automatically converted to arrays. To force a conversion,\npass `true` as the value of the _force_ parameter.\n\n@class Array\n@constructor\n@param {Any} thing The thing to arrayify.\n@param {Number} [startIndex=0] If non-zero and _thing_ is an array or array-like\n collection, a subset of items starting at the specified index will be\n returned.\n@param {Boolean} [force=false] If `true`, _thing_ will be treated as an\n array-like collection no matter what.\n@return {Array} A native array created from _thing_, according to the rules\n described above.\n**/\nfunction YArray(thing, startIndex, force) {\n var len, result;\n\n /*jshint expr: true*/\n startIndex || (startIndex = 0);\n\n if (force || YArray.test(thing)) {\n // IE throws when trying to slice HTMLElement collections.\n try {\n return Native.slice.call(thing, startIndex);\n } catch (ex) {\n result = [];\n\n for (len = thing.length; startIndex < len; ++startIndex) {\n result.push(thing[startIndex]);\n }\n\n return result;\n }\n }\n\n return [thing];\n}\n\nY.Array = YArray;\n\n/**\nDedupes an array of strings, returning an array that's guaranteed to contain\nonly one copy of a given string.\n\nThis method differs from `Array.unique()` in that it's optimized for use only\nwith strings, whereas `unique` may be used with other types (but is slower).\nUsing `dedupe()` with non-string values may result in unexpected behavior.\n\n@method dedupe\n@param {String[]} array Array of strings to dedupe.\n@return {Array} Deduped copy of _array_.\n@static\n@since 3.4.0\n**/\nYArray.dedupe = function (array) {\n var hash = {},\n results = [],\n i, item, len;\n\n for (i = 0, len = array.length; i < len; ++i) {\n item = array[i];\n\n if (!hasOwn.call(hash, item)) {\n hash[item] = 1;\n results.push(item);\n }\n }\n\n return results;\n};\n\n/**\nExecutes the supplied function on each item in the array. This method wraps\nthe native ES5 `Array.forEach()` method if available.\n\n@method each\n@param {Array} array Array to iterate.\n@param {Function} fn Function to execute on each item in the array. The function\n will receive the following arguments:\n @param {Any} fn.item Current array item.\n @param {Number} fn.index Current array index.\n @param {Array} fn.array Array being iterated.\n@param {Object} [thisObj] `this` object to use when calling _fn_.\n@return {YUI} The YUI instance.\n@static\n**/\nYArray.each = YArray.forEach = Lang._isNative(Native.forEach) ? function (array, fn, thisObj) {\n Native.forEach.call(array || [], fn, thisObj || Y);\n return Y;\n} : function (array, fn, thisObj) {\n for (var i = 0, len = (array && array.length) || 0; i < len; ++i) {\n if (i in array) {\n fn.call(thisObj || Y, array[i], i, array);\n }\n }\n\n return Y;\n};\n\n/**\nAlias for `each()`.\n\n@method forEach\n@static\n**/\n\n/**\nReturns an object using the first array as keys and the second as values. If\nthe second array is not provided, or if it doesn't contain the same number of\nvalues as the first array, then `true` will be used in place of the missing\nvalues.\n\n@example\n\n Y.Array.hash(['a', 'b', 'c'], ['foo', 'bar']);\n // => {a: 'foo', b: 'bar', c: true}\n\n@method hash\n@param {String[]} keys Array of strings to use as keys.\n@param {Array} [values] Array to use as values.\n@return {Object} Hash using the first array as keys and the second as values.\n@static\n**/\nYArray.hash = function (keys, values) {\n var hash = {},\n vlen = (values && values.length) || 0,\n i, len;\n\n for (i = 0, len = keys.length; i < len; ++i) {\n if (i in keys) {\n hash[keys[i]] = vlen > i && i in values ? values[i] : true;\n }\n }\n\n return hash;\n};\n\n/**\nReturns the index of the first item in the array that's equal (using a strict\nequality check) to the specified _value_, or `-1` if the value isn't found.\n\nThis method wraps the native ES5 `Array.indexOf()` method if available.\n\n@method indexOf\n@param {Array} array Array to search.\n@param {Any} value Value to search for.\n@param {Number} [from=0] The index at which to begin the search.\n@return {Number} Index of the item strictly equal to _value_, or `-1` if not\n found.\n@static\n**/\nYArray.indexOf = Lang._isNative(Native.indexOf) ? function (array, value, from) {\n return Native.indexOf.call(array, value, from);\n} : function (array, value, from) {\n // http://es5.github.com/#x15.4.4.14\n var len = array.length;\n\n from = +from || 0;\n from = (from > 0 || -1) * Math.floor(Math.abs(from));\n\n if (from < 0) {\n from += len;\n\n if (from < 0) {\n from = 0;\n }\n }\n\n for (; from < len; ++from) {\n if (from in array && array[from] === value) {\n return from;\n }\n }\n\n return -1;\n};\n\n/**\nNumeric sort convenience function.\n\nThe native `Array.prototype.sort()` function converts values to strings and\nsorts them in lexicographic order, which is unsuitable for sorting numeric\nvalues. Provide `Array.numericSort` as a custom sort function when you want\nto sort values in numeric order.\n\n@example\n\n [42, 23, 8, 16, 4, 15].sort(Y.Array.numericSort);\n // => [4, 8, 15, 16, 23, 42]\n\n@method numericSort\n@param {Number} a First value to compare.\n@param {Number} b Second value to compare.\n@return {Number} Difference between _a_ and _b_.\n@static\n**/\nYArray.numericSort = function (a, b) {\n return a - b;\n};\n\n/**\nExecutes the supplied function on each item in the array. Returning a truthy\nvalue from the function will stop the processing of remaining items.\n\n@method some\n@param {Array} array Array to iterate over.\n@param {Function} fn Function to execute on each item. The function will receive\n the following arguments:\n @param {Any} fn.value Current array item.\n @param {Number} fn.index Current array index.\n @param {Array} fn.array Array being iterated over.\n@param {Object} [thisObj] `this` object to use when calling _fn_.\n@return {Boolean} `true` if the function returns a truthy value on any of the\n items in the array; `false` otherwise.\n@static\n**/\nYArray.some = Lang._isNative(Native.some) ? function (array, fn, thisObj) {\n return Native.some.call(array, fn, thisObj);\n} : function (array, fn, thisObj) {\n for (var i = 0, len = array.length; i < len; ++i) {\n if (i in array && fn.call(thisObj, array[i], i, array)) {\n return true;\n }\n }\n\n return false;\n};\n\n/**\nEvaluates _obj_ to determine if it's an array, an array-like collection, or\nsomething else. This is useful when working with the function `arguments`\ncollection and `HTMLElement` collections.\n\nNote: This implementation doesn't consider elements that are also\ncollections, such as `<form>` and `<select>`, to be array-like.\n\n@method test\n@param {Object} obj Object to test.\n@return {Number} A number indicating the results of the test:\n\n * 0: Neither an array nor an array-like collection.\n * 1: Real array.\n * 2: Array-like collection.\n\n@static\n**/\nYArray.test = function (obj) {\n var result = 0;\n\n if (Lang.isArray(obj)) {\n result = 1;\n } else if (Lang.isObject(obj)) {\n try {\n // indexed, but no tagName (element) or scrollTo/document (window. From DOM.isWindow test which we can't use here),\n // or functions without apply/call (Safari\n // HTMLElementCollection bug).\n if ('length' in obj && !obj.tagName && !(obj.scrollTo && obj.document) && !obj.apply) {\n result = 2;\n }\n } catch (ex) {}\n }\n\n return result;\n};\n/**\n * The YUI module contains the components required for building the YUI\n * seed file. This includes the script loading mechanism, a simple queue,\n * and the core utilities for the library.\n * @module yui\n * @submodule yui-base\n */\n\n/**\n * A simple FIFO queue. Items are added to the Queue with add(1..n items) and\n * removed using next().\n *\n * @class Queue\n * @constructor\n * @param {MIXED} item* 0..n items to seed the queue.\n */\nfunction Queue() {\n this._init();\n this.add.apply(this, arguments);\n}\n\nQueue.prototype = {\n /**\n * Initialize the queue\n *\n * @method _init\n * @protected\n */\n _init: function() {\n /**\n * The collection of enqueued items\n *\n * @property _q\n * @type Array\n * @protected\n */\n this._q = [];\n },\n\n /**\n * Get the next item in the queue. FIFO support\n *\n * @method next\n * @return {MIXED} the next item in the queue.\n */\n next: function() {\n return this._q.shift();\n },\n\n /**\n * Get the last in the queue. LIFO support.\n *\n * @method last\n * @return {MIXED} the last item in the queue.\n */\n last: function() {\n return this._q.pop();\n },\n\n /**\n * Add 0..n items to the end of the queue.\n *\n * @method add\n * @param {MIXED} item* 0..n items.\n * @return {object} this queue.\n */\n add: function() {\n this._q.push.apply(this._q, arguments);\n\n return this;\n },\n\n /**\n * Returns the current number of queued items.\n *\n * @method size\n * @return {Number} The size.\n */\n size: function() {\n return this._q.length;\n }\n};\n\nY.Queue = Queue;\n\nYUI.Env._loaderQueue = YUI.Env._loaderQueue || new Queue();\n\n/**\nThe YUI module contains the components required for building the YUI seed file.\nThis includes the script loading mechanism, a simple queue, and the core\nutilities for the library.\n\n@module yui\n@submodule yui-base\n**/\n\nvar CACHED_DELIMITER = '__',\n\n hasOwn = Object.prototype.hasOwnProperty,\n isObject = Y.Lang.isObject;\n\n/**\nReturns a wrapper for a function which caches the return value of that function,\nkeyed off of the combined string representation of the argument values provided\nwhen the wrapper is called.\n\nCalling this function again with the same arguments will return the cached value\nrather than executing the wrapped function.\n\nNote that since the cache is keyed off of the string representation of arguments\npassed to the wrapper function, arguments that aren't strings and don't provide\na meaningful `toString()` method may result in unexpected caching behavior. For\nexample, the objects `{}` and `{foo: 'bar'}` would both be converted to the\nstring `[object Object]` when used as a cache key.\n\n@method cached\n@param {Function} source The function to memoize.\n@param {Object} [cache={}] Object in which to store cached values. You may seed\n this object with pre-existing cached values if desired.\n@param {any} [refetch] If supplied, this value is compared with the cached value\n using a `==` comparison. If the values are equal, the wrapped function is\n executed again even though a cached value exists.\n@return {Function} Wrapped function.\n@for YUI\n**/\nY.cached = function (source, cache, refetch) {\n /*jshint expr: true*/\n cache || (cache = {});\n\n return function (arg) {\n var key = arguments.length > 1 ?\n Array.prototype.join.call(arguments, CACHED_DELIMITER) :\n String(arg);\n \n /*jshint eqeqeq: false*/\n if (!(key in cache) || (refetch && cache[key] == refetch)) {\n cache[key] = source.apply(source, arguments);\n }\n\n return cache[key];\n };\n};\n\n/**\nReturns the `location` object from the window/frame in which this YUI instance\noperates, or `undefined` when executing in a non-browser environment\n(e.g. Node.js).\n\nIt is _not_ recommended to hold references to the `window.location` object\noutside of the scope of a function in which its properties are being accessed or\nits methods are being called. This is because of a nasty bug/issue that exists\nin both Safari and MobileSafari browsers:\n[WebKit Bug 34679](https://bugs.webkit.org/show_bug.cgi?id=34679).\n\n@method getLocation\n@return {location} The `location` object from the window/frame in which this YUI\n instance operates.\n@since 3.5.0\n**/\nY.getLocation = function () {\n // It is safer to look this up every time because yui-base is attached to a\n // YUI instance before a user's config is applied; i.e. `Y.config.win` does\n // not point the correct window object when this file is loaded.\n var win = Y.config.win;\n\n // It is not safe to hold a reference to the `location` object outside the\n // scope in which it is being used. The WebKit engine used in Safari and\n // MobileSafari will \"disconnect\" the `location` object from the `window`\n // when a page is restored from back/forward history cache.\n return win && win.location;\n};\n\n/**\nReturns a new object containing all of the properties of all the supplied\nobjects. The properties from later objects will overwrite those in earlier\nobjects.\n\nPassing in a single object will create a shallow copy of it. For a deep copy,\nuse `clone()`.\n\n@method merge\n@param {Object} objects* One or more objects to merge.\n@return {Object} A new merged object.\n**/\nY.merge = function () {\n var i = 0,\n len = arguments.length,\n result = {},\n key,\n obj;\n\n for (; i < len; ++i) {\n obj = arguments[i];\n\n for (key in obj) {\n if (hasOwn.call(obj, key)) {\n result[key] = obj[key];\n }\n }\n }\n\n return result;\n};\n\n/**\nMixes _supplier_'s properties into _receiver_.\n\nProperties on _receiver_ or _receiver_'s prototype will not be overwritten or\nshadowed unless the _overwrite_ parameter is `true`, and will not be merged\nunless the _merge_ parameter is `true`.\n\nIn the default mode (0), only properties the supplier owns are copied (prototype\nproperties are not copied). The following copying modes are available:\n\n * `0`: _Default_. Object to object.\n * `1`: Prototype to prototype.\n * `2`: Prototype to prototype and object to object.\n * `3`: Prototype to object.\n * `4`: Object to prototype.\n\n@method mix\n@param {Function|Object} receiver The object or function to receive the mixed\n properties.\n@param {Function|Object} supplier The object or function supplying the\n properties to be mixed.\n@param {Boolean} [overwrite=false] If `true`, properties that already exist\n on the receiver will be overwritten with properties from the supplier.\n@param {String[]} [whitelist] An array of property names to copy. If\n specified, only the whitelisted properties will be copied, and all others\n will be ignored.\n@param {Number} [mode=0] Mix mode to use. See above for available modes.\n@param {Boolean} [merge=false] If `true`, objects and arrays that already\n exist on the receiver will have the corresponding object/array from the\n supplier merged into them, rather than being skipped or overwritten. When\n both _overwrite_ and _merge_ are `true`, _merge_ takes precedence.\n@return {Function|Object|YUI} The receiver, or the YUI instance if the\n specified receiver is falsy.\n**/\nY.mix = function(receiver, supplier, overwrite, whitelist, mode, merge) {\n var alwaysOverwrite, exists, from, i, key, len, to;\n\n // If no supplier is given, we return the receiver. If no receiver is given,\n // we return Y. Returning Y doesn't make much sense to me, but it's\n // grandfathered in for backcompat reasons.\n if (!receiver || !supplier) {\n return receiver || Y;\n }\n\n if (mode) {\n // In mode 2 (prototype to prototype and object to object), we recurse\n // once to do the proto to proto mix. The object to object mix will be\n // handled later on.\n if (mode === 2) {\n Y.mix(receiver.prototype, supplier.prototype, overwrite,\n whitelist, 0, merge);\n }\n\n // Depending on which mode is specified, we may be copying from or to\n // the prototypes of the supplier and receiver.\n from = mode === 1 || mode === 3 ? supplier.prototype : supplier;\n to = mode === 1 || mode === 4 ? receiver.prototype : receiver;\n\n // If either the supplier or receiver doesn't actually have a\n // prototype property, then we could end up with an undefined `from`\n // or `to`. If that happens, we abort and return the receiver.\n if (!from || !to) {\n return receiver;\n }\n } else {\n from = supplier;\n to = receiver;\n }\n\n // If `overwrite` is truthy and `merge` is falsy, then we can skip a\n // property existence check on each iteration and save some time.\n alwaysOverwrite = overwrite && !merge;\n\n if (whitelist) {\n for (i = 0, len = whitelist.length; i < len; ++i) {\n key = whitelist[i];\n\n // We call `Object.prototype.hasOwnProperty` instead of calling\n // `hasOwnProperty` on the object itself, since the object's\n // `hasOwnProperty` method may have been overridden or removed.\n // Also, some native objects don't implement a `hasOwnProperty`\n // method.\n if (!hasOwn.call(from, key)) {\n continue;\n }\n\n // The `key in to` check here is (sadly) intentional for backwards\n // compatibility reasons. It prevents undesired shadowing of\n // prototype members on `to`.\n exists = alwaysOverwrite ? false : key in to;\n\n if (merge && exists && isObject(to[key], true)\n && isObject(from[key], true)) {\n // If we're in merge mode, and the key is present on both\n // objects, and the value on both objects is either an object or\n // an array (but not a function), then we recurse to merge the\n // `from` value into the `to` value instead of overwriting it.\n //\n // Note: It's intentional that the whitelist isn't passed to the\n // recursive call here. This is legacy behavior that lots of\n // code still depends on.\n Y.mix(to[key], from[key], overwrite, null, 0, merge);\n } else if (overwrite || !exists) {\n // We're not in merge mode, so we'll only copy the `from` value\n // to the `to` value if we're in overwrite mode or if the\n // current key doesn't exist on the `to` object.\n to[key] = from[key];\n }\n }\n } else {\n for (key in from) {\n // The code duplication here is for runtime performance reasons.\n // Combining whitelist and non-whitelist operations into a single\n // loop or breaking the shared logic out into a function both result\n // in worse performance, and Y.mix is critical enough that the byte\n // tradeoff is worth it.\n if (!hasOwn.call(from, key)) {\n continue;\n }\n\n // The `key in to` check here is (sadly) intentional for backwards\n // compatibility reasons. It prevents undesired shadowing of\n // prototype members on `to`.\n exists = alwaysOverwrite ? false : key in to;\n\n if (merge && exists && isObject(to[key], true)\n && isObject(from[key], true)) {\n Y.mix(to[key], from[key], overwrite, null, 0, merge);\n } else if (overwrite || !exists) {\n to[key] = from[key];\n }\n }\n\n // If this is an IE browser with the JScript enumeration bug, force\n // enumeration of the buggy properties by making a recursive call with\n // the buggy properties as the whitelist.\n if (Y.Object._hasEnumBug) {\n Y.mix(to, from, overwrite, Y.Object._forceEnum, mode, merge);\n }\n }\n\n return receiver;\n};\n/**\n * The YUI module contains the components required for building the YUI\n * seed file. This includes the script loading mechanism, a simple queue,\n * and the core utilities for the library.\n * @module yui\n * @submodule yui-base\n */\n\n/**\n * Adds utilities to the YUI instance for working with objects.\n *\n * @class Object\n */\n\nvar Lang = Y.Lang,\n hasOwn = Object.prototype.hasOwnProperty,\n\n UNDEFINED, // <-- Note the comma. We're still declaring vars.\n\n/**\n * Returns a new object that uses _obj_ as its prototype. This method wraps the\n * native ES5 `Object.create()` method if available, but doesn't currently\n * pass through `Object.create()`'s second argument (properties) in order to\n * ensure compatibility with older browsers.\n *\n * @method ()\n * @param {Object} obj Prototype object.\n * @return {Object} New object using _obj_ as its prototype.\n * @static\n */\nO = Y.Object = Lang._isNative(Object.create) ? function (obj) {\n // We currently wrap the native Object.create instead of simply aliasing it\n // to ensure consistency with our fallback shim, which currently doesn't\n // support Object.create()'s second argument (properties). Once we have a\n // safe fallback for the properties arg, we can stop wrapping\n // Object.create().\n return Object.create(obj);\n} : (function () {\n // Reusable constructor function for the Object.create() shim.\n function F() {}\n\n // The actual shim.\n return function (obj) {\n F.prototype = obj;\n return new F();\n };\n}()),\n\n/**\n * Property names that IE doesn't enumerate in for..in loops, even when they\n * should be enumerable. When `_hasEnumBug` is `true`, it's necessary to\n * manually enumerate these properties.\n *\n * @property _forceEnum\n * @type String[]\n * @protected\n * @static\n */\nforceEnum = O._forceEnum = [\n 'hasOwnProperty',\n 'isPrototypeOf',\n 'propertyIsEnumerable',\n 'toString',\n 'toLocaleString',\n 'valueOf'\n],\n\n/**\n * `true` if this browser has the JScript enumeration bug that prevents\n * enumeration of the properties named in the `_forceEnum` array, `false`\n * otherwise.\n *\n * See:\n * - <https://developer.mozilla.org/en/ECMAScript_DontEnum_attribute#JScript_DontEnum_Bug>\n * - <http://whattheheadsaid.com/2010/10/a-safer-object-keys-compatibility-implementation>\n *\n * @property _hasEnumBug\n * @type Boolean\n * @protected\n * @static\n */\nhasEnumBug = O._hasEnumBug = !{valueOf: 0}.propertyIsEnumerable('valueOf'),\n\n/**\n * `true` if this browser incorrectly considers the `prototype` property of\n * functions to be enumerable. Currently known to affect Opera 11.50.\n *\n * @property _hasProtoEnumBug\n * @type Boolean\n * @protected\n * @static\n */\nhasProtoEnumBug = O._hasProtoEnumBug = (function () {}).propertyIsEnumerable('prototype'),\n\n/**\n * Returns `true` if _key_ exists on _obj_, `false` if _key_ doesn't exist or\n * exists only on _obj_'s prototype. This is essentially a safer version of\n * `obj.hasOwnProperty()`.\n *\n * @method owns\n * @param {Object} obj Object to test.\n * @param {String} key Property name to look for.\n * @return {Boolean} `true` if _key_ exists on _obj_, `false` otherwise.\n * @static\n */\nowns = O.owns = function (obj, key) {\n return !!obj && hasOwn.call(obj, key);\n}; // <-- End of var declarations.\n\n/**\n * Alias for `owns()`.\n *\n * @method hasKey\n * @param {Object} obj Object to test.\n * @param {String} key Property name to look for.\n * @return {Boolean} `true` if _key_ exists on _obj_, `false` otherwise.\n * @static\n */\nO.hasKey = owns;\n\n/**\n * Returns an array containing the object's enumerable keys. Does not include\n * prototype keys or non-enumerable keys.\n *\n * Note that keys are returned in enumeration order (that is, in the same order\n * that they would be enumerated by a `for-in` loop), which may not be the same\n * as the order in which they were defined.\n *\n * This method is an alias for the native ES5 `Object.keys()` method if\n * available.\n *\n * @example\n *\n * Y.Object.keys({a: 'foo', b: 'bar', c: 'baz'});\n * // => ['a', 'b', 'c']\n *\n * @method keys\n * @param {Object} obj An object.\n * @return {String[]} Array of keys.\n * @static\n */\nO.keys = Lang._isNative(Object.keys) ? Object.keys : function (obj) {\n if (!Lang.isObject(obj)) {\n throw new TypeError('Object.keys called on a non-object');\n }\n\n var keys = [],\n i, key, len;\n\n if (hasProtoEnumBug && typeof obj === 'function') {\n for (key in obj) {\n if (owns(obj, key) && key !== 'prototype') {\n keys.push(key);\n }\n }\n } else {\n for (key in obj) {\n if (owns(obj, key)) {\n keys.push(key);\n }\n }\n }\n\n if (hasEnumBug) {\n for (i = 0, len = forceEnum.length; i < len; ++i) {\n key = forceEnum[i];\n\n if (owns(obj, key)) {\n keys.push(key);\n }\n }\n }\n\n return keys;\n};\n\n/**\n * Returns an array containing the values of the object's enumerable keys.\n *\n * Note that values are returned in enumeration order (that is, in the same\n * order that they would be enumerated by a `for-in` loop), which may not be the\n * same as the order in which they were defined.\n *\n * @example\n *\n * Y.Object.values({a: 'foo', b: 'bar', c: 'baz'});\n * // => ['foo', 'bar', 'baz']\n *\n * @method values\n * @param {Object} obj An object.\n * @return {Array} Array of values.\n * @static\n */\nO.values = function (obj) {\n var keys = O.keys(obj),\n i = 0,\n len = keys.length,\n values = [];\n\n for (; i < len; ++i) {\n values.push(obj[keys[i]]);\n }\n\n return values;\n};\n\n/**\n * Returns the number of enumerable keys owned by an object.\n *\n * @method size\n * @param {Object} obj An object.\n * @return {Number} The object's size.\n * @static\n */\nO.size = function (obj) {\n try {\n return O.keys(obj).length;\n } catch (ex) {\n return 0; // Legacy behavior for non-objects.\n }\n};\n\n/**\n * Returns `true` if the object owns an enumerable property with the specified\n * value.\n *\n * @method hasValue\n * @param {Object} obj An object.\n * @param {any} value The value to search for.\n * @return {Boolean} `true` if _obj_ contains _value_, `false` otherwise.\n * @static\n */\nO.hasValue = function (obj, value) {\n return Y.Array.indexOf(O.values(obj), value) > -1;\n};\n\n/**\n * Executes a function on each enumerable property in _obj_. The function\n * receives the value, the key, and the object itself as parameters (in that\n * order).\n *\n * By default, only properties owned by _obj_ are enumerated. To include\n * prototype properties, set the _proto_ parameter to `true`.\n *\n * @method each\n * @param {Object} obj Object to enumerate.\n * @param {Function} fn Function to execute on each enumerable property.\n * @param {mixed} fn.value Value of the current property.\n * @param {String} fn.key Key of the current property.\n * @param {Object} fn.obj Object being enumerated.\n * @param {Object} [thisObj] `this` object to use when calling _fn_.\n * @param {Boolean} [proto=false] Include prototype properties.\n * @return {YUI} the YUI instance.\n * @chainable\n * @static\n */\nO.each = function (obj, fn, thisObj, proto) {\n var key;\n\n for (key in obj) {\n if (proto || owns(obj, key)) {\n fn.call(thisObj || Y, obj[key], key, obj);\n }\n }\n\n return Y;\n};\n\n/**\n * Executes a function on each enumerable property in _obj_, but halts if the\n * function returns a truthy value. The function receives the value, the key,\n * and the object itself as paramters (in that order).\n *\n * By default, only properties owned by _obj_ are enumerated. To include\n * prototype properties, set the _proto_ parameter to `true`.\n *\n * @method some\n * @param {Object} obj Object to enumerate.\n * @param {Function} fn Function to execute on each enumerable property.\n * @param {mixed} fn.value Value of the current property.\n * @param {String} fn.key Key of the current property.\n * @param {Object} fn.obj Object being enumerated.\n * @param {Object} [thisObj] `this` object to use when calling _fn_.\n * @param {Boolean} [proto=false] Include prototype properties.\n * @return {Boolean} `true` if any execution of _fn_ returns a truthy value,\n * `false` otherwise.\n * @static\n */\nO.some = function (obj, fn, thisObj, proto) {\n var key;\n\n for (key in obj) {\n if (proto || owns(obj, key)) {\n if (fn.call(thisObj || Y, obj[key], key, obj)) {\n return true;\n }\n }\n }\n\n return false;\n};\n\n/**\n * Retrieves the sub value at the provided path,\n * from the value object provided.\n *\n * @method getValue\n * @static\n * @param o The object from which to extract the property value.\n * @param path {Array} A path array, specifying the object traversal path\n * from which to obtain the sub value.\n * @return {Any} The value stored in the path, undefined if not found,\n * undefined if the source is not an object. Returns the source object\n * if an empty path is provided.\n */\nO.getValue = function(o, path) {\n if (!Lang.isObject(o)) {\n return UNDEFINED;\n }\n\n var i,\n p = Y.Array(path),\n l = p.length;\n\n for (i = 0; o !== UNDEFINED && i < l; i++) {\n o = o[p[i]];\n }\n\n return o;\n};\n\n/**\n * Sets the sub-attribute value at the provided path on the\n * value object. Returns the modified value object, or\n * undefined if the path is invalid.\n *\n * @method setValue\n * @static\n * @param o The object on which to set the sub value.\n * @param path {Array} A path array, specifying the object traversal path\n * at which to set the sub value.\n * @param val {Any} The new value for the sub-attribute.\n * @return {Object} The modified object, with the new sub value set, or\n * undefined, if the path was invalid.\n */\nO.setValue = function(o, path, val) {\n var i,\n p = Y.Array(path),\n leafIdx = p.length - 1,\n ref = o;\n\n if (leafIdx >= 0) {\n for (i = 0; ref !== UNDEFINED && i < leafIdx; i++) {\n ref = ref[p[i]];\n }\n\n if (ref !== UNDEFINED) {\n ref[p[i]] = val;\n } else {\n return UNDEFINED;\n }\n }\n\n return o;\n};\n\n/**\n * Returns `true` if the object has no enumerable properties of its own.\n *\n * @method isEmpty\n * @param {Object} obj An object.\n * @return {Boolean} `true` if the object is empty.\n * @static\n * @since 3.2.0\n */\nO.isEmpty = function (obj) {\n return !O.keys(Object(obj)).length;\n};\n/**\n * The YUI module contains the components required for building the YUI seed\n * file. This includes the script loading mechanism, a simple queue, and the\n * core utilities for the library.\n * @module yui\n * @submodule yui-base\n */\n\n/**\n * YUI user agent detection.\n * Do not fork for a browser if it can be avoided. Use feature detection when\n * you can. Use the user agent as a last resort. For all fields listed\n * as @type float, UA stores a version number for the browser engine,\n * 0 otherwise. This value may or may not map to the version number of\n * the browser using the engine. The value is presented as a float so\n * that it can easily be used for boolean evaluation as well as for\n * looking for a particular range of versions. Because of this,\n * some of the granularity of the version info may be lost. The fields that\n * are @type string default to null. The API docs list the values that\n * these fields can have.\n * @class UA\n * @static\n */\n\n/**\n* Static method on `YUI.Env` for parsing a UA string. Called at instantiation\n* to populate `Y.UA`.\n*\n* @static\n* @method parseUA\n* @param {String} [subUA=navigator.userAgent] UA string to parse\n* @return {Object} The Y.UA object\n*/\nYUI.Env.parseUA = function(subUA) {\n\n var numberify = function(s) {\n var c = 0;\n return parseFloat(s.replace(/\\./g, function() {\n return (c++ === 1) ? '' : '.';\n }));\n },\n\n win = Y.config.win,\n\n nav = win && win.navigator,\n\n o = {\n\n /**\n * Internet Explorer version number or 0. Example: 6\n * @property ie\n * @type float\n * @static\n */\n ie: 0,\n\n /**\n * Opera version number or 0. Example: 9.2\n * @property opera\n * @type float\n * @static\n */\n opera: 0,\n\n /**\n * Gecko engine revision number. Will evaluate to 1 if Gecko\n * is detected but the revision could not be found. Other browsers\n * will be 0. Example: 1.8\n * <pre>\n * Firefox 1.0.0.4: 1.7.8 <-- Reports 1.7\n * Firefox 1.5.0.9: 1.8.0.9 <-- 1.8\n * Firefox 2.0.0.3: 1.8.1.3 <-- 1.81\n * Firefox 3.0 <-- 1.9\n * Firefox 3.5 <-- 1.91\n * </pre>\n * @property gecko\n * @type float\n * @static\n */\n gecko: 0,\n\n /**\n * AppleWebKit version. KHTML browsers that are not WebKit browsers\n * will evaluate to 1, other browsers 0. Example: 418.9\n * <pre>\n * Safari 1.3.2 (312.6): 312.8.1 <-- Reports 312.8 -- currently the\n * latest available for Mac OSX 10.3.\n * Safari 2.0.2: 416 <-- hasOwnProperty introduced\n * Safari 2.0.4: 418 <-- preventDefault fixed\n * Safari 2.0.4 (419.3): 418.9.1 <-- One version of Safari may run\n * different versions of webkit\n * Safari 2.0.4 (419.3): 419 <-- Tiger installations that have been\n * updated, but not updated\n * to the latest patch.\n * Webkit 212 nightly: 522+ <-- Safari 3.0 precursor (with native\n * SVG and many major issues fixed).\n * Safari 3.0.4 (523.12) 523.12 <-- First Tiger release - automatic\n * update from 2.x via the 10.4.11 OS patch.\n * Webkit nightly 1/2008:525+ <-- Supports DOMContentLoaded event.\n * yahoo.com user agent hack removed.\n * </pre>\n * http://en.wikipedia.org/wiki/Safari_version_history\n * @property webkit\n * @type float\n * @static\n */\n webkit: 0,\n\n /**\n * Safari will be detected as webkit, but this property will also\n * be populated with the Safari version number\n * @property safari\n * @type float\n * @static\n */\n safari: 0,\n\n /**\n * Chrome will be detected as webkit, but this property will also\n * be populated with the Chrome version number\n * @property chrome\n * @type float\n * @static\n */\n chrome: 0,\n\n /**\n * The mobile property will be set to a string containing any relevant\n * user agent information when a modern mobile browser is detected.\n * Currently limited to Safari on the iPhone/iPod Touch, Nokia N-series\n * devices with the WebKit-based browser, and Opera Mini.\n * @property mobile\n * @type string\n * @default null\n * @static\n */\n mobile: null,\n\n /**\n * Adobe AIR version number or 0. Only populated if webkit is detected.\n * Example: 1.0\n * @property air\n * @type float\n */\n air: 0,\n /**\n * PhantomJS version number or 0. Only populated if webkit is detected.\n * Example: 1.0\n * @property phantomjs\n * @type float\n */\n phantomjs: 0,\n /**\n * Detects Apple iPad's OS version\n * @property ipad\n * @type float\n * @static\n */\n ipad: 0,\n /**\n * Detects Apple iPhone's OS version\n * @property iphone\n * @type float\n * @static\n */\n iphone: 0,\n /**\n * Detects Apples iPod's OS version\n * @property ipod\n * @type float\n * @static\n */\n ipod: 0,\n /**\n * General truthy check for iPad, iPhone or iPod\n * @property ios\n * @type Boolean\n * @default null\n * @static\n */\n ios: null,\n /**\n * Detects Googles Android OS version\n * @property android\n * @type float\n * @static\n */\n android: 0,\n /**\n * Detects Kindle Silk\n * @property silk\n * @type float\n * @static\n */\n silk: 0,\n /**\n * Detects Kindle Silk Acceleration\n * @property accel\n * @type Boolean\n * @static\n */\n accel: false,\n /**\n * Detects Palms WebOS version\n * @property webos\n * @type float\n * @static\n */\n webos: 0,\n\n /**\n * Google Caja version number or 0.\n * @property caja\n * @type float\n */\n caja: nav && nav.cajaVersion,\n\n /**\n * Set to true if the page appears to be in SSL\n * @property secure\n * @type boolean\n * @static\n */\n secure: false,\n\n /**\n * The operating system. Currently only detecting windows or macintosh\n * @property os\n * @type string\n * @default null\n * @static\n */\n os: null,\n\n /**\n * The Nodejs Version\n * @property nodejs\n * @type float\n * @default 0\n * @static\n */\n nodejs: 0,\n /**\n * Window8/IE10 Application host environment\n * @property winjs\n * @type Boolean\n * @static\n */\n winjs: !!((typeof Windows !== \"undefined\") && Windows.System),\n /**\n * Are touch/msPointer events available on this device\n * @property touchEnabled\n * @type Boolean\n * @static\n */\n touchEnabled: false\n },\n\n ua = subUA || nav && nav.userAgent,\n\n loc = win && win.location,\n\n href = loc && loc.href,\n\n m;\n\n /**\n * The User Agent string that was parsed\n * @property userAgent\n * @type String\n * @static\n */\n o.userAgent = ua;\n\n\n o.secure = href && (href.toLowerCase().indexOf('https') === 0);\n\n if (ua) {\n\n if ((/windows|win32/i).test(ua)) {\n o.os = 'windows';\n } else if ((/macintosh|mac_powerpc/i).test(ua)) {\n o.os = 'macintosh';\n } else if ((/android/i).test(ua)) {\n o.os = 'android';\n } else if ((/symbos/i).test(ua)) {\n o.os = 'symbos';\n } else if ((/linux/i).test(ua)) {\n o.os = 'linux';\n } else if ((/rhino/i).test(ua)) {\n o.os = 'rhino';\n }\n\n // Modern KHTML browsers should qualify as Safari X-Grade\n if ((/KHTML/).test(ua)) {\n o.webkit = 1;\n }\n if ((/IEMobile|XBLWP7/).test(ua)) {\n o.mobile = 'windows';\n }\n if ((/Fennec/).test(ua)) {\n o.mobile = 'gecko';\n }\n // Modern WebKit browsers are at least X-Grade\n m = ua.match(/AppleWebKit\\/([^\\s]*)/);\n if (m && m[1]) {\n o.webkit = numberify(m[1]);\n o.safari = o.webkit;\n\n if (/PhantomJS/.test(ua)) {\n m = ua.match(/PhantomJS\\/([^\\s]*)/);\n if (m && m[1]) {\n o.phantomjs = numberify(m[1]);\n }\n }\n\n // Mobile browser check\n if (/ Mobile\\//.test(ua) || (/iPad|iPod|iPhone/).test(ua)) {\n o.mobile = 'Apple'; // iPhone or iPod Touch\n\n m = ua.match(/OS ([^\\s]*)/);\n if (m && m[1]) {\n m = numberify(m[1].replace('_', '.'));\n }\n o.ios = m;\n o.os = 'ios';\n o.ipad = o.ipod = o.iphone = 0;\n\n m = ua.match(/iPad|iPod|iPhone/);\n if (m && m[0]) {\n o[m[0].toLowerCase()] = o.ios;\n }\n } else {\n m = ua.match(/NokiaN[^\\/]*|webOS\\/\\d\\.\\d/);\n if (m) {\n // Nokia N-series, webOS, ex: NokiaN95\n o.mobile = m[0];\n }\n if (/webOS/.test(ua)) {\n o.mobile = 'WebOS';\n m = ua.match(/webOS\\/([^\\s]*);/);\n if (m && m[1]) {\n o.webos = numberify(m[1]);\n }\n }\n if (/ Android/.test(ua)) {\n if (/Mobile/.test(ua)) {\n o.mobile = 'Android';\n }\n m = ua.match(/Android ([^\\s]*);/);\n if (m && m[1]) {\n o.android = numberify(m[1]);\n }\n\n }\n if (/Silk/.test(ua)) {\n m = ua.match(/Silk\\/([^\\s]*)\\)/);\n if (m && m[1]) {\n o.silk = numberify(m[1]);\n }\n if (!o.android) {\n o.android = 2.34; //Hack for desktop mode in Kindle\n o.os = 'Android';\n }\n if (/Accelerated=true/.test(ua)) {\n o.accel = true;\n }\n }\n }\n\n m = ua.match(/(Chrome|CrMo|CriOS)\\/([^\\s]*)/);\n if (m && m[1] && m[2]) {\n o.chrome = numberify(m[2]); // Chrome\n o.safari = 0; //Reset safari back to 0\n if (m[1] === 'CrMo') {\n o.mobile = 'chrome';\n }\n } else {\n m = ua.match(/AdobeAIR\\/([^\\s]*)/);\n if (m) {\n o.air = m[0]; // Adobe AIR 1.0 or better\n }\n }\n }\n\n if (!o.webkit) { // not webkit\n// @todo check Opera/8.01 (J2ME/MIDP; Opera Mini/2.0.4509/1316; fi; U; ssr)\n if (/Opera/.test(ua)) {\n m = ua.match(/Opera[\\s\\/]([^\\s]*)/);\n if (m && m[1]) {\n o.opera = numberify(m[1]);\n }\n m = ua.match(/Version\\/([^\\s]*)/);\n if (m && m[1]) {\n o.opera = numberify(m[1]); // opera 10+\n }\n\n if (/Opera Mobi/.test(ua)) {\n o.mobile = 'opera';\n m = ua.replace('Opera Mobi', '').match(/Opera ([^\\s]*)/);\n if (m && m[1]) {\n o.opera = numberify(m[1]);\n }\n }\n m = ua.match(/Opera Mini[^;]*/);\n\n if (m) {\n o.mobile = m[0]; // ex: Opera Mini/2.0.4509/1316\n }\n } else { // not opera or webkit\n m = ua.match(/MSIE\\s([^;]*)/);\n if (m && m[1]) {\n o.ie = numberify(m[1]);\n } else { // not opera, webkit, or ie\n m = ua.match(/Gecko\\/([^\\s]*)/);\n if (m) {\n o.gecko = 1; // Gecko detected, look for revision\n m = ua.match(/rv:([^\\s\\)]*)/);\n if (m && m[1]) {\n o.gecko = numberify(m[1]);\n }\n }\n }\n }\n }\n }\n\n //Check for known properties to tell if touch events are enabled on this device or if\n //the number of MSPointer touchpoints on this device is greater than 0.\n if (win && nav && !(o.chrome && o.chrome < 6)) {\n o.touchEnabled = ((\"ontouchstart\" in win) || ((\"msMaxTouchPoints\" in nav) && (nav.msMaxTouchPoints > 0)));\n }\n\n //It was a parsed UA, do not assign the global value.\n if (!subUA) {\n\n if (typeof process === 'object') {\n\n if (process.versions && process.versions.node) {\n //NodeJS\n o.os = process.platform;\n o.nodejs = numberify(process.versions.node);\n }\n }\n\n YUI.Env.UA = o;\n\n }\n\n return o;\n};\n\n\nY.UA = YUI.Env.UA || YUI.Env.parseUA();\n\n/**\nPerforms a simple comparison between two version numbers, accounting for\nstandard versioning logic such as the fact that \"535.8\" is a lower version than\n\"535.24\", even though a simple numerical comparison would indicate that it's\ngreater. Also accounts for cases such as \"1.1\" vs. \"1.1.0\", which are\nconsidered equivalent.\n\nReturns -1 if version _a_ is lower than version _b_, 0 if they're equivalent,\n1 if _a_ is higher than _b_.\n\nVersions may be numbers or strings containing numbers and dots. For example,\nboth `535` and `\"535.8.10\"` are acceptable. A version string containing\nnon-numeric characters, like `\"535.8.beta\"`, may produce unexpected results.\n\n@method compareVersions\n@param {Number|String} a First version number to compare.\n@param {Number|String} b Second version number to compare.\n@return -1 if _a_ is lower than _b_, 0 if they're equivalent, 1 if _a_ is\n higher than _b_.\n**/\nY.UA.compareVersions = function (a, b) {\n var aPart, aParts, bPart, bParts, i, len;\n\n if (a === b) {\n return 0;\n }\n\n aParts = (a + '').split('.');\n bParts = (b + '').split('.');\n\n for (i = 0, len = Math.max(aParts.length, bParts.length); i < len; ++i) {\n aPart = parseInt(aParts[i], 10);\n bPart = parseInt(bParts[i], 10);\n\n /*jshint expr: true*/\n isNaN(aPart) && (aPart = 0);\n isNaN(bPart) && (bPart = 0);\n\n if (aPart < bPart) {\n return -1;\n }\n\n if (aPart > bPart) {\n return 1;\n }\n }\n\n return 0;\n};\nYUI.Env.aliases = {\n \"anim\": [\"anim-base\",\"anim-color\",\"anim-curve\",\"anim-easing\",\"anim-node-plugin\",\"anim-scroll\",\"anim-xy\"],\n \"anim-shape-transform\": [\"anim-shape\"],\n \"app\": [\"app-base\",\"app-content\",\"app-transitions\",\"lazy-model-list\",\"model\",\"model-list\",\"model-sync-rest\",\"router\",\"view\",\"view-node-map\"],\n \"attribute\": [\"attribute-base\",\"attribute-complex\"],\n \"attribute-events\": [\"attribute-observable\"],\n \"autocomplete\": [\"autocomplete-base\",\"autocomplete-sources\",\"autocomplete-list\",\"autocomplete-plugin\"],\n \"axes\": [\"axis-numeric\",\"axis-category\",\"axis-time\",\"axis-stacked\"],\n \"axes-base\": [\"axis-numeric-base\",\"axis-category-base\",\"axis-time-base\",\"axis-stacked-base\"],\n \"base\": [\"base-base\",\"base-pluginhost\",\"base-build\"],\n \"cache\": [\"cache-base\",\"cache-offline\",\"cache-plugin\"],\n \"charts\": [\"charts-base\"],\n \"collection\": [\"array-extras\",\"arraylist\",\"arraylist-add\",\"arraylist-filter\",\"array-invoke\"],\n \"color\": [\"color-base\",\"color-hsl\",\"color-harmony\"],\n \"controller\": [\"router\"],\n \"dataschema\": [\"dataschema-base\",\"dataschema-json\",\"dataschema-xml\",\"dataschema-array\",\"dataschema-text\"],\n \"datasource\": [\"datasource-local\",\"datasource-io\",\"datasource-get\",\"datasource-function\",\"datasource-cache\",\"datasource-jsonschema\",\"datasource-xmlschema\",\"datasource-arrayschema\",\"datasource-textschema\",\"datasource-polling\"],\n \"datatable\": [\"datatable-core\",\"datatable-table\",\"datatable-head\",\"datatable-body\",\"datatable-base\",\"datatable-column-widths\",\"datatable-message\",\"datatable-mutable\",\"datatable-sort\",\"datatable-datasource\"],\n \"datatype\": [\"datatype-date\",\"datatype-number\",\"datatype-xml\"],\n \"datatype-date\": [\"datatype-date-parse\",\"datatype-date-format\",\"datatype-date-math\"],\n \"datatype-number\": [\"datatype-number-parse\",\"datatype-number-format\"],\n \"datatype-xml\": [\"datatype-xml-parse\",\"datatype-xml-format\"],\n \"dd\": [\"dd-ddm-base\",\"dd-ddm\",\"dd-ddm-drop\",\"dd-drag\",\"dd-proxy\",\"dd-constrain\",\"dd-drop\",\"dd-scroll\",\"dd-delegate\"],\n \"dom\": [\"dom-base\",\"dom-screen\",\"dom-style\",\"selector-native\",\"selector\"],\n \"editor\": [\"frame\",\"editor-selection\",\"exec-command\",\"editor-base\",\"editor-para\",\"editor-br\",\"editor-bidi\",\"editor-tab\",\"createlink-base\"],\n \"event\": [\"event-base\",\"event-delegate\",\"event-synthetic\",\"event-mousewheel\",\"event-mouseenter\",\"event-key\",\"event-focus\",\"event-resize\",\"event-hover\",\"event-outside\",\"event-touch\",\"event-move\",\"event-flick\",\"event-valuechange\",\"event-tap\"],\n \"event-custom\": [\"event-custom-base\",\"event-custom-complex\"],\n \"event-gestures\": [\"event-flick\",\"event-move\"],\n \"handlebars\": [\"handlebars-compiler\"],\n \"highlight\": [\"highlight-base\",\"highlight-accentfold\"],\n \"history\": [\"history-base\",\"history-hash\",\"history-hash-ie\",\"history-html5\"],\n \"io\": [\"io-base\",\"io-xdr\",\"io-form\",\"io-upload-iframe\",\"io-queue\"],\n \"json\": [\"json-parse\",\"json-stringify\"],\n \"loader\": [\"loader-base\",\"loader-rollup\",\"loader-yui3\"],\n \"node\": [\"node-base\",\"node-event-delegate\",\"node-pluginhost\",\"node-screen\",\"node-style\"],\n \"pluginhost\": [\"pluginhost-base\",\"pluginhost-config\"],\n \"querystring\": [\"querystring-parse\",\"querystring-stringify\"],\n \"recordset\": [\"recordset-base\",\"recordset-sort\",\"recordset-filter\",\"recordset-indexer\"],\n \"resize\": [\"resize-base\",\"resize-proxy\",\"resize-constrain\"],\n \"slider\": [\"slider-base\",\"slider-value-range\",\"clickable-rail\",\"range-slider\"],\n \"template\": [\"template-base\",\"template-micro\"],\n \"text\": [\"text-accentfold\",\"text-wordbreak\"],\n \"widget\": [\"widget-base\",\"widget-htmlparser\",\"widget-skin\",\"widget-uievents\"]\n};\n\n\n}, '@VERSION@', {\"use\": [\"get\", \"features\", \"intl-base\", \"yui-log\", \"yui-later\"]});\nYUI.add('get', function (Y, NAME) {\n\n/*jslint boss:true, expr:true, laxbreak: true */\n\n/**\nProvides dynamic loading of remote JavaScript and CSS resources.\n\n@module get\n@class Get\n@static\n**/\n\nvar Lang = Y.Lang,\n\n CUSTOM_ATTRS, // defined lazily in Y.Get.Transaction._createNode()\n\n Get, Transaction;\n\nY.Get = Get = {\n // -- Public Properties ----------------------------------------------------\n\n /**\n Default options for CSS requests. Options specified here will override\n global defaults for CSS requests.\n\n See the `options` property for all available options.\n\n @property cssOptions\n @type Object\n @static\n @since 3.5.0\n **/\n cssOptions: {\n attributes: {\n rel: 'stylesheet'\n },\n\n doc : Y.config.linkDoc || Y.config.doc,\n pollInterval: 50\n },\n\n /**\n Default options for JS requests. Options specified here will override global\n defaults for JS requests.\n\n See the `options` property for all available options.\n\n @property jsOptions\n @type Object\n @static\n @since 3.5.0\n **/\n jsOptions: {\n autopurge: true,\n doc : Y.config.scriptDoc || Y.config.doc\n },\n\n /**\n Default options to use for all requests.\n\n Note that while all available options are documented here for ease of\n discovery, some options (like callback functions) only make sense at the\n transaction level.\n\n Callback functions specified via the options object or the `options`\n parameter of the `css()`, `js()`, or `load()` methods will receive the\n transaction object as a parameter. See `Y.Get.Transaction` for details on\n the properties and methods available on transactions.\n\n @static\n @since 3.5.0\n @property {Object} options\n\n @property {Boolean} [options.async=false] Whether or not to load scripts\n asynchronously, meaning they're requested in parallel and execution\n order is not guaranteed. Has no effect on CSS, since CSS is always\n loaded asynchronously.\n\n @property {Object} [options.attributes] HTML attribute name/value pairs that\n should be added to inserted nodes. By default, the `charset` attribute\n will be set to \"utf-8\" and nodes will be given an auto-generated `id`\n attribute, but you can override these with your own values if desired.\n\n @property {Boolean} [options.autopurge] Whether or not to automatically\n purge inserted nodes after the purge threshold is reached. This is\n `true` by default for JavaScript, but `false` for CSS since purging a\n CSS node will also remove any styling applied by the referenced file.\n\n @property {Object} [options.context] `this` object to use when calling\n callback functions. Defaults to the transaction object.\n\n @property {Mixed} [options.data] Arbitrary data object to pass to \"on*\"\n callbacks.\n\n @property {Document} [options.doc] Document into which nodes should be\n inserted. By default, the current document is used.\n\n @property {HTMLElement|String} [options.insertBefore] HTML element or id\n string of an element before which all generated nodes should be\n inserted. If not specified, Get will automatically determine the best\n place to insert nodes for maximum compatibility.\n\n @property {Function} [options.onEnd] Callback to execute after a transaction\n is complete, regardless of whether it succeeded or failed.\n\n @property {Function} [options.onFailure] Callback to execute after a\n transaction fails, times out, or is aborted.\n\n @property {Function} [options.onProgress] Callback to execute after each\n individual request in a transaction either succeeds or fails.\n\n @property {Function} [options.onSuccess] Callback to execute after a\n transaction completes successfully with no errors. Note that in browsers\n that don't support the `error` event on CSS `<link>` nodes, a failed CSS\n request may still be reported as a success because in these browsers\n it can be difficult or impossible to distinguish between success and\n failure for CSS resources.\n\n @property {Function} [options.onTimeout] Callback to execute after a\n transaction times out.\n\n @property {Number} [options.pollInterval=50] Polling interval (in\n milliseconds) for detecting CSS load completion in browsers that don't\n support the `load` event on `<link>` nodes. This isn't used for\n JavaScript.\n\n @property {Number} [options.purgethreshold=20] Number of nodes to insert\n before triggering an automatic purge when `autopurge` is `true`.\n\n @property {Number} [options.timeout] Number of milliseconds to wait before\n aborting a transaction. When a timeout occurs, the `onTimeout` callback\n is called, followed by `onFailure` and finally `onEnd`. By default,\n there is no timeout.\n\n @property {String} [options.type] Resource type (\"css\" or \"js\"). This option\n is set automatically by the `css()` and `js()` functions and will be\n ignored there, but may be useful when using the `load()` function. If\n not specified, the type will be inferred from the URL, defaulting to\n \"js\" if the URL doesn't contain a recognizable file extension.\n **/\n options: {\n attributes: {\n charset: 'utf-8'\n },\n\n purgethreshold: 20\n },\n\n // -- Protected Properties -------------------------------------------------\n\n /**\n Regex that matches a CSS URL. Used to guess the file type when it's not\n specified.\n\n @property REGEX_CSS\n @type RegExp\n @final\n @protected\n @static\n @since 3.5.0\n **/\n REGEX_CSS: /\\.css(?:[?;].*)?$/i,\n\n /**\n Regex that matches a JS URL. Used to guess the file type when it's not\n specified.\n\n @property REGEX_JS\n @type RegExp\n @final\n @protected\n @static\n @since 3.5.0\n **/\n REGEX_JS : /\\.js(?:[?;].*)?$/i,\n\n /**\n Contains information about the current environment, such as what script and\n link injection features it supports.\n\n This object is created and populated the first time the `_getEnv()` method\n is called.\n\n @property _env\n @type Object\n @protected\n @static\n @since 3.5.0\n **/\n\n /**\n Mapping of document _yuid strings to <head> or <base> node references so we\n don't have to look the node up each time we want to insert a request node.\n\n @property _insertCache\n @type Object\n @protected\n @static\n @since 3.5.0\n **/\n _insertCache: {},\n\n /**\n Information about the currently pending transaction, if any.\n\n This is actually an object with two properties: `callback`, containing the\n optional callback passed to `css()`, `load()`, or `js()`; and `transaction`,\n containing the actual transaction instance.\n\n @property _pending\n @type Object\n @protected\n @static\n @since 3.5.0\n **/\n _pending: null,\n\n /**\n HTML nodes eligible to be purged next time autopurge is triggered.\n\n @property _purgeNodes\n @type HTMLElement[]\n @protected\n @static\n @since 3.5.0\n **/\n _purgeNodes: [],\n\n /**\n Queued transactions and associated callbacks.\n\n @property _queue\n @type Object[]\n @protected\n @static\n @since 3.5.0\n **/\n _queue: [],\n\n // -- Public Methods -------------------------------------------------------\n\n /**\n Aborts the specified transaction.\n\n This will cause the transaction's `onFailure` callback to be called and\n will prevent any new script and link nodes from being added to the document,\n but any resources that have already been requested will continue loading\n (there's no safe way to prevent this, unfortunately).\n\n *Note:* This method is deprecated as of 3.5.0, and will be removed in a\n future version of YUI. Use the transaction-level `abort()` method instead.\n\n @method abort\n @param {Get.Transaction} transaction Transaction to abort.\n @deprecated Use the `abort()` method on the transaction instead.\n @static\n **/\n abort: function (transaction) {\n var i, id, item, len, pending;\n\n Y.log('`Y.Get.abort()` is deprecated as of 3.5.0. Use the `abort()` method on the transaction instead.', 'warn', 'get');\n\n if (!transaction.abort) {\n id = transaction;\n pending = this._pending;\n transaction = null;\n\n if (pending && pending.transaction.id === id) {\n transaction = pending.transaction;\n this._pending = null;\n } else {\n for (i = 0, len = this._queue.length; i < len; ++i) {\n item = this._queue[i].transaction;\n\n if (item.id === id) {\n transaction = item;\n this._queue.splice(i, 1);\n break;\n }\n }\n }\n }\n\n transaction && transaction.abort();\n },\n\n /**\n Loads one or more CSS files.\n\n The _urls_ parameter may be provided as a URL string, a request object,\n or an array of URL strings and/or request objects.\n\n A request object is just an object that contains a `url` property and zero\n or more options that should apply specifically to that request.\n Request-specific options take priority over transaction-level options and\n default options.\n\n URLs may be relative or absolute, and do not have to have the same origin\n as the current page.\n\n The `options` parameter may be omitted completely and a callback passed in\n its place, if desired.\n\n @example\n\n // Load a single CSS file and log a message on completion.\n Y.Get.css('foo.css', function (err) {\n if (err) {\n Y.log('foo.css failed to load!');\n } else {\n Y.log('foo.css was loaded successfully');\n }\n });\n\n // Load multiple CSS files and log a message when all have finished\n // loading.\n var urls = ['foo.css', 'http://example.com/bar.css', 'baz/quux.css'];\n\n Y.Get.css(urls, function (err) {\n if (err) {\n Y.log('one or more files failed to load!');\n } else {\n Y.log('all files loaded successfully');\n }\n });\n\n // Specify transaction-level options, which will apply to all requests\n // within the transaction.\n Y.Get.css(urls, {\n attributes: {'class': 'my-css'},\n timeout : 5000\n });\n\n // Specify per-request options, which override transaction-level and\n // default options.\n Y.Get.css([\n {url: 'foo.css', attributes: {id: 'foo'}},\n {url: 'bar.css', attributes: {id: 'bar', charset: 'iso-8859-1'}}\n ]);\n\n @method css\n @param {String|Object|Array} urls URL string, request object, or array\n of URLs and/or request objects to load.\n @param {Object} [options] Options for this transaction. See the\n `Y.Get.options` property for a complete list of available options.\n @param {Function} [callback] Callback function to be called on completion.\n This is a general callback and will be called before any more granular\n callbacks (`onSuccess`, `onFailure`, etc.) specified in the `options`\n object.\n\n @param {Array|null} callback.err Array of errors that occurred during\n the transaction, or `null` on success.\n @param {Get.Transaction} callback.transaction Transaction object.\n\n @return {Get.Transaction} Transaction object.\n @static\n **/\n css: function (urls, options, callback) {\n return this._load('css', urls, options, callback);\n },\n\n /**\n Loads one or more JavaScript resources.\n\n The _urls_ parameter may be provided as a URL string, a request object,\n or an array of URL strings and/or request objects.\n\n A request object is just an object that contains a `url` property and zero\n or more options that should apply specifically to that request.\n Request-specific options take priority over transaction-level options and\n default options.\n\n URLs may be relative or absolute, and do not have to have the same origin\n as the current page.\n\n The `options` parameter may be omitted completely and a callback passed in\n its place, if desired.\n\n Scripts will be executed in the order they're specified unless the `async`\n option is `true`, in which case they'll be loaded in parallel and executed\n in whatever order they finish loading.\n\n @example\n\n // Load a single JS file and log a message on completion.\n Y.Get.js('foo.js', function (err) {\n if (err) {\n Y.log('foo.js failed to load!');\n } else {\n Y.log('foo.js was loaded successfully');\n }\n });\n\n // Load multiple JS files, execute them in order, and log a message when\n // all have finished loading.\n var urls = ['foo.js', 'http://example.com/bar.js', 'baz/quux.js'];\n\n Y.Get.js(urls, function (err) {\n if (err) {\n Y.log('one or more files failed to load!');\n } else {\n Y.log('all files loaded successfully');\n }\n });\n\n // Specify transaction-level options, which will apply to all requests\n // within the transaction.\n Y.Get.js(urls, {\n attributes: {'class': 'my-js'},\n timeout : 5000\n });\n\n // Specify per-request options, which override transaction-level and\n // default options.\n Y.Get.js([\n {url: 'foo.js', attributes: {id: 'foo'}},\n {url: 'bar.js', attributes: {id: 'bar', charset: 'iso-8859-1'}}\n ]);\n\n @method js\n @param {String|Object|Array} urls URL string, request object, or array\n of URLs and/or request objects to load.\n @param {Object} [options] Options for this transaction. See the\n `Y.Get.options` property for a complete list of available options.\n @param {Function} [callback] Callback function to be called on completion.\n This is a general callback and will be called before any more granular\n callbacks (`onSuccess`, `onFailure`, etc.) specified in the `options`\n object.\n\n @param {Array|null} callback.err Array of errors that occurred during\n the transaction, or `null` on success.\n @param {Get.Transaction} callback.transaction Transaction object.\n\n @return {Get.Transaction} Transaction object.\n @since 3.5.0\n @static\n **/\n js: function (urls, options, callback) {\n return this._load('js', urls, options, callback);\n },\n\n /**\n Loads one or more CSS and/or JavaScript resources in the same transaction.\n\n Use this method when you want to load both CSS and JavaScript in a single\n transaction and be notified when all requested URLs have finished loading,\n regardless of type.\n\n Behavior and options are the same as for the `css()` and `js()` methods. If\n a resource type isn't specified in per-request options or transaction-level\n options, Get will guess the file type based on the URL's extension (`.css`\n or `.js`, with or without a following query string). If the file type can't\n be guessed from the URL, a warning will be logged and Get will assume the\n URL is a JavaScript resource.\n\n @example\n\n // Load both CSS and JS files in a single transaction, and log a message\n // when all files have finished loading.\n Y.Get.load(['foo.css', 'bar.js', 'baz.css'], function (err) {\n if (err) {\n Y.log('one or more files failed to load!');\n } else {\n Y.log('all files loaded successfully');\n }\n });\n\n @method load\n @param {String|Object|Array} urls URL string, request object, or array\n of URLs and/or request objects to load.\n @param {Object} [options] Options for this transaction. See the\n `Y.Get.options` property for a complete list of available options.\n @param {Function} [callback] Callback function to be called on completion.\n This is a general callback and will be called before any more granular\n callbacks (`onSuccess`, `onFailure`, etc.) specified in the `options`\n object.\n\n @param {Array|null} err Array of errors that occurred during the\n transaction, or `null` on success.\n @param {Get.Transaction} Transaction object.\n\n @return {Get.Transaction} Transaction object.\n @since 3.5.0\n @static\n **/\n load: function (urls, options, callback) {\n return this._load(null, urls, options, callback);\n },\n\n // -- Protected Methods ----------------------------------------------------\n\n /**\n Triggers an automatic purge if the purge threshold has been reached.\n\n @method _autoPurge\n @param {Number} threshold Purge threshold to use, in milliseconds.\n @protected\n @since 3.5.0\n @static\n **/\n _autoPurge: function (threshold) {\n if (threshold && this._purgeNodes.length >= threshold) {\n Y.log('autopurge triggered after ' + this._purgeNodes.length + ' nodes', 'info', 'get');\n this._purge(this._purgeNodes);\n }\n },\n\n /**\n Populates the `_env` property with information about the current\n environment.\n\n @method _getEnv\n @return {Object} Environment information.\n @protected\n @since 3.5.0\n @static\n **/\n _getEnv: function () {\n var doc = Y.config.doc,\n ua = Y.UA;\n\n // Note: some of these checks require browser sniffs since it's not\n // feasible to load test files on every pageview just to perform a\n // feature test. I'm sorry if this makes you sad.\n return (this._env = {\n\n // True if this is a browser that supports disabling async mode on\n // dynamically created script nodes. See\n // https://developer.mozilla.org/En/HTML/Element/Script#Attributes\n\n // IE10 doesn't return true for the MDN feature test, so setting it explicitly,\n // because it is async by default, and allows you to disable async by setting it to false\n async: (doc && doc.createElement('script').async === true) || (ua.ie >= 10),\n\n // True if this browser fires an event when a dynamically injected\n // link node fails to load. This is currently true for Firefox 9+\n // and WebKit 535.24+\n cssFail: ua.gecko >= 9 || ua.compareVersions(ua.webkit, 535.24) >= 0,\n\n // True if this browser fires an event when a dynamically injected\n // link node finishes loading. This is currently true for IE, Opera,\n // Firefox 9+, and WebKit 535.24+. Note that IE versions <9 fire the\n // DOM 0 \"onload\" event, but not \"load\". All versions of IE fire\n // \"onload\".\n // davglass: Seems that Chrome on Android needs this to be false.\n cssLoad: (\n (!ua.gecko && !ua.webkit) || ua.gecko >= 9 ||\n ua.compareVersions(ua.webkit, 535.24) >= 0\n ) && !(ua.chrome && ua.chrome <= 18),\n\n // True if this browser preserves script execution order while\n // loading scripts in parallel as long as the script node's `async`\n // attribute is set to false to explicitly disable async execution.\n preservesScriptOrder: !!(ua.gecko || ua.opera || (ua.ie && ua.ie >= 10))\n });\n },\n\n _getTransaction: function (urls, options) {\n var requests = [],\n i, len, req, url;\n\n if (!Lang.isArray(urls)) {\n urls = [urls];\n }\n\n options = Y.merge(this.options, options);\n\n // Clone the attributes object so we don't end up modifying it by ref.\n options.attributes = Y.merge(this.options.attributes,\n options.attributes);\n\n for (i = 0, len = urls.length; i < len; ++i) {\n url = urls[i];\n req = {attributes: {}};\n\n // If `url` is a string, we create a URL object for it, then mix in\n // global options and request-specific options. If it's an object\n // with a \"url\" property, we assume it's a request object containing\n // URL-specific options.\n if (typeof url === 'string') {\n req.url = url;\n } else if (url.url) {\n // URL-specific options override both global defaults and\n // request-specific options.\n Y.mix(req, url, false, null, 0, true);\n url = url.url; // Make url a string so we can use it later.\n } else {\n Y.log('URL must be a string or an object with a `url` property.', 'error', 'get');\n continue;\n }\n\n Y.mix(req, options, false, null, 0, true);\n\n // If we didn't get an explicit type for this URL either in the\n // request options or the URL-specific options, try to determine\n // one from the file extension.\n if (!req.type) {\n if (this.REGEX_CSS.test(url)) {\n req.type = 'css';\n } else {\n if (!this.REGEX_JS.test(url)) {\n Y.log(\"Can't guess file type from URL. Assuming JS: \" + url, 'warn', 'get');\n }\n\n req.type = 'js';\n }\n }\n\n // Mix in type-specific default options, but don't overwrite any\n // options that have already been set.\n Y.mix(req, req.type === 'js' ? this.jsOptions : this.cssOptions,\n false, null, 0, true);\n\n // Give the node an id attribute if it doesn't already have one.\n req.attributes.id || (req.attributes.id = Y.guid());\n\n // Backcompat for <3.5.0 behavior.\n if (req.win) {\n Y.log('The `win` option is deprecated as of 3.5.0. Use `doc` instead.', 'warn', 'get');\n req.doc = req.win.document;\n } else {\n req.win = req.doc.defaultView || req.doc.parentWindow;\n }\n\n if (req.charset) {\n Y.log('The `charset` option is deprecated as of 3.5.0. Set `attributes.charset` instead.', 'warn', 'get');\n req.attributes.charset = req.charset;\n }\n\n requests.push(req);\n }\n\n return new Transaction(requests, options);\n },\n\n _load: function (type, urls, options, callback) {\n var transaction;\n\n // Allow callback as third param.\n if (typeof options === 'function') {\n callback = options;\n options = {};\n }\n\n options || (options = {});\n options.type = type;\n\n options._onFinish = Get._onTransactionFinish;\n\n if (!this._env) {\n this._getEnv();\n }\n\n transaction = this._getTransaction(urls, options);\n\n this._queue.push({\n callback : callback,\n transaction: transaction\n });\n\n this._next();\n\n return transaction;\n },\n\n _onTransactionFinish : function() {\n Get._pending = null;\n Get._next();\n },\n\n _next: function () {\n var item;\n\n if (this._pending) {\n return;\n }\n\n item = this._queue.shift();\n\n if (item) {\n this._pending = item;\n item.transaction.execute(item.callback);\n }\n },\n\n _purge: function (nodes) {\n var purgeNodes = this._purgeNodes,\n isTransaction = nodes !== purgeNodes,\n index, node;\n\n while (node = nodes.pop()) { // assignment\n // Don't purge nodes that haven't finished loading (or errored out),\n // since this can hang the transaction.\n if (!node._yuiget_finished) {\n continue;\n }\n\n node.parentNode && node.parentNode.removeChild(node);\n\n // If this is a transaction-level purge and this node also exists in\n // the Get-level _purgeNodes array, we need to remove it from\n // _purgeNodes to avoid creating a memory leak. The indexOf lookup\n // sucks, but until we get WeakMaps, this is the least troublesome\n // way to do this (we can't just hold onto node ids because they may\n // not be in the same document).\n if (isTransaction) {\n index = Y.Array.indexOf(purgeNodes, node);\n\n if (index > -1) {\n purgeNodes.splice(index, 1);\n }\n }\n }\n }\n};\n\n/**\nAlias for `js()`.\n\n@method script\n@static\n**/\nGet.script = Get.js;\n\n/**\nRepresents a Get transaction, which may contain requests for one or more JS or\nCSS files.\n\nThis class should not be instantiated manually. Instances will be created and\nreturned as needed by Y.Get's `css()`, `js()`, and `load()` methods.\n\n@class Get.Transaction\n@constructor\n@since 3.5.0\n**/\nGet.Transaction = Transaction = function (requests, options) {\n var self = this;\n\n self.id = Transaction._lastId += 1;\n self.data = options.data;\n self.errors = [];\n self.nodes = [];\n self.options = options;\n self.requests = requests;\n\n self._callbacks = []; // callbacks to call after execution finishes\n self._queue = [];\n self._reqsWaiting = 0;\n\n // Deprecated pre-3.5.0 properties.\n self.tId = self.id; // Use `id` instead.\n self.win = options.win || Y.config.win;\n};\n\n/**\nArbitrary data object associated with this transaction.\n\nThis object comes from the options passed to `Get.css()`, `Get.js()`, or\n`Get.load()`, and will be `undefined` if no data object was specified.\n\n@property {Object} data\n**/\n\n/**\nArray of errors that have occurred during this transaction, if any.\n\n@since 3.5.0\n@property {Object[]} errors\n@property {String} errors.error Error message.\n@property {Object} errors.request Request object related to the error.\n**/\n\n/**\nNumeric id for this transaction, unique among all transactions within the same\nYUI sandbox in the current pageview.\n\n@property {Number} id\n@since 3.5.0\n**/\n\n/**\nHTMLElement nodes (native ones, not YUI Node instances) that have been inserted\nduring the current transaction.\n\n@property {HTMLElement[]} nodes\n**/\n\n/**\nOptions associated with this transaction.\n\nSee `Get.options` for the full list of available options.\n\n@property {Object} options\n@since 3.5.0\n**/\n\n/**\nRequest objects contained in this transaction. Each request object represents\none CSS or JS URL that will be (or has been) requested and loaded into the page.\n\n@property {Object} requests\n@since 3.5.0\n**/\n\n/**\nId of the most recent transaction.\n\n@property _lastId\n@type Number\n@protected\n@static\n**/\nTransaction._lastId = 0;\n\nTransaction.prototype = {\n // -- Public Properties ----------------------------------------------------\n\n /**\n Current state of this transaction. One of \"new\", \"executing\", or \"done\".\n\n @property _state\n @type String\n @protected\n **/\n _state: 'new', // \"new\", \"executing\", or \"done\"\n\n // -- Public Methods -------------------------------------------------------\n\n /**\n Aborts this transaction.\n\n This will cause the transaction's `onFailure` callback to be called and\n will prevent any new script and link nodes from being added to the document,\n but any resources that have already been requested will continue loading\n (there's no safe way to prevent this, unfortunately).\n\n @method abort\n @param {String} [msg=\"Aborted.\"] Optional message to use in the `errors`\n array describing why the transaction was aborted.\n **/\n abort: function (msg) {\n this._pending = null;\n this._pendingCSS = null;\n this._pollTimer = clearTimeout(this._pollTimer);\n this._queue = [];\n this._reqsWaiting = 0;\n\n this.errors.push({error: msg || 'Aborted'});\n this._finish();\n },\n\n /**\n Begins execting the transaction.\n\n There's usually no reason to call this manually, since Get will call it\n automatically when other pending transactions have finished. If you really\n want to execute your transaction before Get does, you can, but be aware that\n this transaction's scripts may end up executing before the scripts in other\n pending transactions.\n\n If the transaction is already executing, the specified callback (if any)\n will be queued and called after execution finishes. If the transaction has\n already finished, the callback will be called immediately (the transaction\n will not be executed again).\n\n @method execute\n @param {Function} callback Callback function to execute after all requests\n in the transaction are complete, or after the transaction is aborted.\n **/\n execute: function (callback) {\n var self = this,\n requests = self.requests,\n state = self._state,\n i, len, queue, req;\n\n if (state === 'done') {\n callback && callback(self.errors.length ? self.errors : null, self);\n return;\n } else {\n callback && self._callbacks.push(callback);\n\n if (state === 'executing') {\n return;\n }\n }\n\n self._state = 'executing';\n self._queue = queue = [];\n\n if (self.options.timeout) {\n self._timeout = setTimeout(function () {\n self.abort('Timeout');\n }, self.options.timeout);\n }\n\n self._reqsWaiting = requests.length;\n\n for (i = 0, len = requests.length; i < len; ++i) {\n req = requests[i];\n\n if (req.async || req.type === 'css') {\n // No need to queue CSS or fully async JS.\n self._insert(req);\n } else {\n queue.push(req);\n }\n }\n\n self._next();\n },\n\n /**\n Manually purges any `<script>` or `<link>` nodes this transaction has\n created.\n\n Be careful when purging a transaction that contains CSS requests, since\n removing `<link>` nodes will also remove any styles they applied.\n\n @method purge\n **/\n purge: function () {\n Get._purge(this.nodes);\n },\n\n // -- Protected Methods ----------------------------------------------------\n _createNode: function (name, attrs, doc) {\n var node = doc.createElement(name),\n attr, testEl;\n\n if (!CUSTOM_ATTRS) {\n // IE6 and IE7 expect property names rather than attribute names for\n // certain attributes. Rather than sniffing, we do a quick feature\n // test the first time _createNode() runs to determine whether we\n // need to provide a workaround.\n testEl = doc.createElement('div');\n testEl.setAttribute('class', 'a');\n\n CUSTOM_ATTRS = testEl.className === 'a' ? {} : {\n 'for' : 'htmlFor',\n 'class': 'className'\n };\n }\n\n for (attr in attrs) {\n if (attrs.hasOwnProperty(attr)) {\n node.setAttribute(CUSTOM_ATTRS[attr] || attr, attrs[attr]);\n }\n }\n\n return node;\n },\n\n _finish: function () {\n var errors = this.errors.length ? this.errors : null,\n options = this.options,\n thisObj = options.context || this,\n data, i, len;\n\n if (this._state === 'done') {\n return;\n }\n\n this._state = 'done';\n\n for (i = 0, len = this._callbacks.length; i < len; ++i) {\n this._callbacks[i].call(thisObj, errors, this);\n }\n\n data = this._getEventData();\n\n if (errors) {\n if (options.onTimeout && errors[errors.length - 1].error === 'Timeout') {\n options.onTimeout.call(thisObj, data);\n }\n\n if (options.onFailure) {\n options.onFailure.call(thisObj, data);\n }\n } else if (options.onSuccess) {\n options.onSuccess.call(thisObj, data);\n }\n\n if (options.onEnd) {\n options.onEnd.call(thisObj, data);\n }\n\n if (options._onFinish) {\n options._onFinish();\n }\n },\n\n _getEventData: function (req) {\n if (req) {\n // This merge is necessary for backcompat. I hate it.\n return Y.merge(this, {\n abort : this.abort, // have to copy these because the prototype isn't preserved\n purge : this.purge,\n request: req,\n url : req.url,\n win : req.win\n });\n } else {\n return this;\n }\n },\n\n _getInsertBefore: function (req) {\n var doc = req.doc,\n el = req.insertBefore,\n cache, docStamp;\n\n if (el) {\n return typeof el === 'string' ? doc.getElementById(el) : el;\n }\n\n cache = Get._insertCache;\n docStamp = Y.stamp(doc);\n\n if ((el = cache[docStamp])) { // assignment\n return el;\n }\n\n // Inserting before a <base> tag apparently works around an IE bug\n // (according to a comment from pre-3.5.0 Y.Get), but I'm not sure what\n // bug that is, exactly. Better safe than sorry?\n if ((el = doc.getElementsByTagName('base')[0])) { // assignment\n return (cache[docStamp] = el);\n }\n\n // Look for a <head> element.\n el = doc.head || doc.getElementsByTagName('head')[0];\n\n if (el) {\n // Create a marker node at the end of <head> to use as an insertion\n // point. Inserting before this node will ensure that all our CSS\n // gets inserted in the correct order, to maintain style precedence.\n el.appendChild(doc.createTextNode(''));\n return (cache[docStamp] = el.lastChild);\n }\n\n // If all else fails, just insert before the first script node on the\n // page, which is virtually guaranteed to exist.\n return (cache[docStamp] = doc.getElementsByTagName('script')[0]);\n },\n\n _insert: function (req) {\n var env = Get._env,\n insertBefore = this._getInsertBefore(req),\n isScript = req.type === 'js',\n node = req.node,\n self = this,\n ua = Y.UA,\n cssTimeout, nodeType;\n\n if (!node) {\n if (isScript) {\n nodeType = 'script';\n } else if (!env.cssLoad && ua.gecko) {\n nodeType = 'style';\n } else {\n nodeType = 'link';\n }\n\n node = req.node = this._createNode(nodeType, req.attributes,\n req.doc);\n }\n\n function onError() {\n self._progress('Failed to load ' + req.url, req);\n }\n\n function onLoad() {\n if (cssTimeout) {\n clearTimeout(cssTimeout);\n }\n\n self._progress(null, req);\n }\n\n // Deal with script asynchronicity.\n if (isScript) {\n node.setAttribute('src', req.url);\n\n if (req.async) {\n // Explicitly indicate that we want the browser to execute this\n // script asynchronously. This is necessary for older browsers\n // like Firefox <4.\n node.async = true;\n } else {\n if (env.async) {\n // This browser treats injected scripts as async by default\n // (standard HTML5 behavior) but asynchronous loading isn't\n // desired, so tell the browser not to mark this script as\n // async.\n node.async = false;\n }\n\n // If this browser doesn't preserve script execution order based\n // on insertion order, we'll need to avoid inserting other\n // scripts until this one finishes loading.\n if (!env.preservesScriptOrder) {\n this._pending = req;\n }\n }\n } else {\n if (!env.cssLoad && ua.gecko) {\n // In Firefox <9, we can import the requested URL into a <style>\n // node and poll for the existence of node.sheet.cssRules. This\n // gives us a reliable way to determine CSS load completion that\n // also works for cross-domain stylesheets.\n //\n // Props to Zach Leatherman for calling my attention to this\n // technique.\n node.innerHTML = (req.attributes.charset ?\n '@charset \"' + req.attributes.charset + '\";' : '') +\n '@import \"' + req.url + '\";';\n } else {\n node.setAttribute('href', req.url);\n }\n }\n\n // Inject the node.\n if (isScript && ua.ie && (ua.ie < 9 || (document.documentMode && document.documentMode < 9))) {\n // Script on IE < 9, and IE 9+ when in IE 8 or older modes, including quirks mode.\n node.onreadystatechange = function () {\n if (/loaded|complete/.test(node.readyState)) {\n node.onreadystatechange = null;\n onLoad();\n }\n };\n } else if (!isScript && !env.cssLoad) {\n // CSS on Firefox <9 or WebKit.\n this._poll(req);\n } else {\n // Script or CSS on everything else. Using DOM 0 events because that\n // evens the playing field with older IEs.\n\n if (ua.ie >= 10) {\n\n // We currently need to introduce a timeout for IE10, since it\n // calls onerror/onload synchronously for 304s - messing up existing\n // program flow.\n\n // Remove this block if the following bug gets fixed by GA\n /*jshint maxlen: 1500 */\n // https://connect.microsoft.com/IE/feedback/details/763871/dynamically-loaded-scripts-with-304s-responses-interrupt-the-currently-executing-js-thread-onload\n node.onerror = function() { setTimeout(onError, 0); };\n node.onload = function() { setTimeout(onLoad, 0); };\n } else {\n node.onerror = onError;\n node.onload = onLoad;\n }\n\n // If this browser doesn't fire an event when CSS fails to load,\n // fail after a timeout to avoid blocking the transaction queue.\n if (!env.cssFail && !isScript) {\n cssTimeout = setTimeout(onError, req.timeout || 3000);\n }\n }\n\n this.nodes.push(node);\n insertBefore.parentNode.insertBefore(node, insertBefore);\n },\n\n _next: function () {\n if (this._pending) {\n return;\n }\n\n // If there are requests in the queue, insert the next queued request.\n // Otherwise, if we're waiting on already-inserted requests to finish,\n // wait longer. If there are no queued requests and we're not waiting\n // for anything to load, then we're done!\n if (this._queue.length) {\n this._insert(this._queue.shift());\n } else if (!this._reqsWaiting) {\n this._finish();\n }\n },\n\n _poll: function (newReq) {\n var self = this,\n pendingCSS = self._pendingCSS,\n isWebKit = Y.UA.webkit,\n i, hasRules, j, nodeHref, req, sheets;\n\n if (newReq) {\n pendingCSS || (pendingCSS = self._pendingCSS = []);\n pendingCSS.push(newReq);\n\n if (self._pollTimer) {\n // A poll timeout is already pending, so no need to create a\n // new one.\n return;\n }\n }\n\n self._pollTimer = null;\n\n // Note: in both the WebKit and Gecko hacks below, a CSS URL that 404s\n // will still be treated as a success. There's no good workaround for\n // this.\n\n for (i = 0; i < pendingCSS.length; ++i) {\n req = pendingCSS[i];\n\n if (isWebKit) {\n // Look for a stylesheet matching the pending URL.\n sheets = req.doc.styleSheets;\n j = sheets.length;\n nodeHref = req.node.href;\n\n while (--j >= 0) {\n if (sheets[j].href === nodeHref) {\n pendingCSS.splice(i, 1);\n i -= 1;\n self._progress(null, req);\n break;\n }\n }\n } else {\n // Many thanks to Zach Leatherman for calling my attention to\n // the @import-based cross-domain technique used here, and to\n // Oleg Slobodskoi for an earlier same-domain implementation.\n //\n // See Zach's blog for more details:\n // http://www.zachleat.com/web/2010/07/29/load-css-dynamically/\n try {\n // We don't really need to store this value since we never\n // use it again, but if we don't store it, Closure Compiler\n // assumes the code is useless and removes it.\n hasRules = !!req.node.sheet.cssRules;\n\n // If we get here, the stylesheet has loaded.\n pendingCSS.splice(i, 1);\n i -= 1;\n self._progress(null, req);\n } catch (ex) {\n // An exception means the stylesheet is still loading.\n }\n }\n }\n\n if (pendingCSS.length) {\n self._pollTimer = setTimeout(function () {\n self._poll.call(self);\n }, self.options.pollInterval);\n }\n },\n\n _progress: function (err, req) {\n var options = this.options;\n\n if (err) {\n req.error = err;\n\n this.errors.push({\n error : err,\n request: req\n });\n\n Y.log(err, 'error', 'get');\n }\n\n req.node._yuiget_finished = req.finished = true;\n\n if (options.onProgress) {\n options.onProgress.call(options.context || this,\n this._getEventData(req));\n }\n\n if (req.autopurge) {\n // Pre-3.5.0 Get always excludes the most recent node from an\n // autopurge. I find this odd, but I'm keeping that behavior for\n // the sake of backcompat.\n Get._autoPurge(this.options.purgethreshold);\n Get._purgeNodes.push(req.node);\n }\n\n if (this._pending === req) {\n this._pending = null;\n }\n\n this._reqsWaiting -= 1;\n\n this._next();\n }\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('features', function (Y, NAME) {\n\nvar feature_tests = {};\n\n/**\nContains the core of YUI's feature test architecture.\n@module features\n*/\n\n/**\n* Feature detection\n* @class Features\n* @static\n*/\n\nY.mix(Y.namespace('Features'), {\n\n /**\n * Object hash of all registered feature tests\n * @property tests\n * @type Object\n */\n tests: feature_tests,\n\n /**\n * Add a test to the system\n *\n * ```\n * Y.Features.add(\"load\", \"1\", {});\n * ```\n *\n * @method add\n * @param {String} cat The category, right now only 'load' is supported\n * @param {String} name The number sequence of the test, how it's reported in the URL or config: 1, 2, 3\n * @param {Object} o Object containing test properties\n * @param {String} o.name The name of the test\n * @param {Function} o.test The test function to execute, the only argument to the function is the `Y` instance\n * @param {String} o.trigger The module that triggers this test.\n */\n add: function(cat, name, o) {\n feature_tests[cat] = feature_tests[cat] || {};\n feature_tests[cat][name] = o;\n },\n /**\n * Execute all tests of a given category and return the serialized results\n *\n * ```\n * caps=1:1;2:1;3:0\n * ```\n * @method all\n * @param {String} cat The category to execute\n * @param {Array} args The arguments to pass to the test function\n * @return {String} A semi-colon separated string of tests and their success/failure: 1:1;2:1;3:0\n */\n all: function(cat, args) {\n var cat_o = feature_tests[cat],\n // results = {};\n result = [];\n if (cat_o) {\n Y.Object.each(cat_o, function(v, k) {\n result.push(k + ':' + (Y.Features.test(cat, k, args) ? 1 : 0));\n });\n }\n\n return (result.length) ? result.join(';') : '';\n },\n /**\n * Run a sepecific test and return a Boolean response.\n *\n * ```\n * Y.Features.test(\"load\", \"1\");\n * ```\n *\n * @method test\n * @param {String} cat The category of the test to run\n * @param {String} name The name of the test to run\n * @param {Array} args The arguments to pass to the test function\n * @return {Boolean} True or false if the test passed/failed.\n */\n test: function(cat, name, args) {\n args = args || [];\n var result, ua, test,\n cat_o = feature_tests[cat],\n feature = cat_o && cat_o[name];\n\n if (!feature) {\n Y.log('Feature test ' + cat + ', ' + name + ' not found');\n } else {\n\n result = feature.result;\n\n if (Y.Lang.isUndefined(result)) {\n\n ua = feature.ua;\n if (ua) {\n result = (Y.UA[ua]);\n }\n\n test = feature.test;\n if (test && ((!ua) || result)) {\n result = test.apply(Y, args);\n }\n\n feature.result = result;\n }\n }\n\n return result;\n }\n});\n\n// Y.Features.add(\"load\", \"1\", {});\n// Y.Features.test(\"load\", \"1\");\n// caps=1:1;2:0;3:1;\n\n/* This file is auto-generated by (yogi loader --yes --mix --start ../) */\n/*jshint maxlen:900, eqeqeq: false */\nvar add = Y.Features.add;\n// app-transitions-native\nadd('load', '0', {\n \"name\": \"app-transitions-native\",\n \"test\": function (Y) {\n var doc = Y.config.doc,\n node = doc ? doc.documentElement : null;\n\n if (node && node.style) {\n return ('MozTransition' in node.style || 'WebkitTransition' in node.style || 'transition' in node.style);\n }\n\n return false;\n},\n \"trigger\": \"app-transitions\"\n});\n// autocomplete-list-keys\nadd('load', '1', {\n \"name\": \"autocomplete-list-keys\",\n \"test\": function (Y) {\n // Only add keyboard support to autocomplete-list if this doesn't appear to\n // be an iOS or Android-based mobile device.\n //\n // There's currently no feasible way to actually detect whether a device has\n // a hardware keyboard, so this sniff will have to do. It can easily be\n // overridden by manually loading the autocomplete-list-keys module.\n //\n // Worth noting: even though iOS supports bluetooth keyboards, Mobile Safari\n // doesn't fire the keyboard events used by AutoCompleteList, so there's\n // no point loading the -keys module even when a bluetooth keyboard may be\n // available.\n return !(Y.UA.ios || Y.UA.android);\n},\n \"trigger\": \"autocomplete-list\"\n});\n// dd-gestures\nadd('load', '2', {\n \"name\": \"dd-gestures\",\n \"trigger\": \"dd-drag\",\n \"ua\": \"touchEnabled\"\n});\n// dom-style-ie\nadd('load', '3', {\n \"name\": \"dom-style-ie\",\n \"test\": function (Y) {\n\n var testFeature = Y.Features.test,\n addFeature = Y.Features.add,\n WINDOW = Y.config.win,\n DOCUMENT = Y.config.doc,\n DOCUMENT_ELEMENT = 'documentElement',\n ret = false;\n\n addFeature('style', 'computedStyle', {\n test: function() {\n return WINDOW && 'getComputedStyle' in WINDOW;\n }\n });\n\n addFeature('style', 'opacity', {\n test: function() {\n return DOCUMENT && 'opacity' in DOCUMENT[DOCUMENT_ELEMENT].style;\n }\n });\n\n ret = (!testFeature('style', 'opacity') &&\n !testFeature('style', 'computedStyle'));\n\n return ret;\n},\n \"trigger\": \"dom-style\"\n});\n// editor-para-ie\nadd('load', '4', {\n \"name\": \"editor-para-ie\",\n \"trigger\": \"editor-para\",\n \"ua\": \"ie\",\n \"when\": \"instead\"\n});\n// event-base-ie\nadd('load', '5', {\n \"name\": \"event-base-ie\",\n \"test\": function(Y) {\n var imp = Y.config.doc && Y.config.doc.implementation;\n return (imp && (!imp.hasFeature('Events', '2.0')));\n},\n \"trigger\": \"node-base\"\n});\n// graphics-canvas\nadd('load', '6', {\n \"name\": \"graphics-canvas\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useCanvas = Y.config.defaultGraphicEngine && Y.config.defaultGraphicEngine == \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n return (!svg || useCanvas) && (canvas && canvas.getContext && canvas.getContext(\"2d\"));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-canvas-default\nadd('load', '7', {\n \"name\": \"graphics-canvas-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useCanvas = Y.config.defaultGraphicEngine && Y.config.defaultGraphicEngine == \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n return (!svg || useCanvas) && (canvas && canvas.getContext && canvas.getContext(\"2d\"));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-svg\nadd('load', '8', {\n \"name\": \"graphics-svg\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useSVG = !Y.config.defaultGraphicEngine || Y.config.defaultGraphicEngine != \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n \n return svg && (useSVG || !canvas);\n},\n \"trigger\": \"graphics\"\n});\n// graphics-svg-default\nadd('load', '9', {\n \"name\": \"graphics-svg-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useSVG = !Y.config.defaultGraphicEngine || Y.config.defaultGraphicEngine != \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n \n return svg && (useSVG || !canvas);\n},\n \"trigger\": \"graphics\"\n});\n// graphics-vml\nadd('load', '10', {\n \"name\": \"graphics-vml\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\");\n return (DOCUMENT && !DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\") && (!canvas || !canvas.getContext || !canvas.getContext(\"2d\")));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-vml-default\nadd('load', '11', {\n \"name\": \"graphics-vml-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\");\n return (DOCUMENT && !DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\") && (!canvas || !canvas.getContext || !canvas.getContext(\"2d\")));\n},\n \"trigger\": \"graphics\"\n});\n// history-hash-ie\nadd('load', '12', {\n \"name\": \"history-hash-ie\",\n \"test\": function (Y) {\n var docMode = Y.config.doc && Y.config.doc.documentMode;\n\n return Y.UA.ie && (!('onhashchange' in Y.config.win) ||\n !docMode || docMode < 8);\n},\n \"trigger\": \"history-hash\"\n});\n// io-nodejs\nadd('load', '13', {\n \"name\": \"io-nodejs\",\n \"trigger\": \"io-base\",\n \"ua\": \"nodejs\"\n});\n// json-parse-shim\nadd('load', '14', {\n \"name\": \"json-parse-shim\",\n \"test\": function (Y) {\n var _JSON = Y.config.global.JSON,\n Native = Object.prototype.toString.call(_JSON) === '[object JSON]' && _JSON,\n nativeSupport = Y.config.useNativeJSONParse !== false && !!Native;\n\n function workingNative( k, v ) {\n return k === \"ok\" ? true : v;\n }\n \n // Double check basic functionality. This is mainly to catch early broken\n // implementations of the JSON API in Firefox 3.1 beta1 and beta2\n if ( nativeSupport ) {\n try {\n nativeSupport = ( Native.parse( '{\"ok\":false}', workingNative ) ).ok;\n }\n catch ( e ) {\n nativeSupport = false;\n }\n }\n\n return !nativeSupport;\n},\n \"trigger\": \"json-parse\"\n});\n// json-stringify-shim\nadd('load', '15', {\n \"name\": \"json-stringify-shim\",\n \"test\": function (Y) {\n var _JSON = Y.config.global.JSON,\n Native = Object.prototype.toString.call(_JSON) === '[object JSON]' && _JSON,\n nativeSupport = Y.config.useNativeJSONStringify !== false && !!Native;\n\n // Double check basic native functionality. This is primarily to catch broken\n // early JSON API implementations in Firefox 3.1 beta1 and beta2.\n if ( nativeSupport ) {\n try {\n nativeSupport = ( '0' === Native.stringify(0) );\n } catch ( e ) {\n nativeSupport = false;\n }\n }\n\n\n return !nativeSupport;\n},\n \"trigger\": \"json-stringify\"\n});\n// scrollview-base-ie\nadd('load', '16', {\n \"name\": \"scrollview-base-ie\",\n \"trigger\": \"scrollview-base\",\n \"ua\": \"ie\"\n});\n// selector-css2\nadd('load', '17', {\n \"name\": \"selector-css2\",\n \"test\": function (Y) {\n var DOCUMENT = Y.config.doc,\n ret = DOCUMENT && !('querySelectorAll' in DOCUMENT);\n\n return ret;\n},\n \"trigger\": \"selector\"\n});\n// transition-timer\nadd('load', '18', {\n \"name\": \"transition-timer\",\n \"test\": function (Y) {\n var DOCUMENT = Y.config.doc,\n node = (DOCUMENT) ? DOCUMENT.documentElement: null,\n ret = true;\n\n if (node && node.style) {\n ret = !('MozTransition' in node.style || 'WebkitTransition' in node.style || 'transition' in node.style);\n }\n\n return ret;\n},\n \"trigger\": \"transition\"\n});\n// widget-base-ie\nadd('load', '19', {\n \"name\": \"widget-base-ie\",\n \"trigger\": \"widget-base\",\n \"ua\": \"ie\"\n});\n// yql-jsonp\nadd('load', '20', {\n \"name\": \"yql-jsonp\",\n \"test\": function (Y) {\n /* Only load the JSONP module when not in nodejs or winjs\n TODO Make the winjs module a CORS module\n */\n return (!Y.UA.nodejs && !Y.UA.winjs);\n},\n \"trigger\": \"yql\",\n \"when\": \"after\"\n});\n// yql-nodejs\nadd('load', '21', {\n \"name\": \"yql-nodejs\",\n \"trigger\": \"yql\",\n \"ua\": \"nodejs\",\n \"when\": \"after\"\n});\n// yql-winjs\nadd('load', '22', {\n \"name\": \"yql-winjs\",\n \"trigger\": \"yql\",\n \"ua\": \"winjs\",\n \"when\": \"after\"\n});\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('intl-base', function (Y, NAME) {\n\n/**\n * The Intl utility provides a central location for managing sets of\n * localized resources (strings and formatting patterns).\n *\n * @class Intl\n * @uses EventTarget\n * @static\n */\n\nvar SPLIT_REGEX = /[, ]/;\n\nY.mix(Y.namespace('Intl'), {\n\n /**\n * Returns the language among those available that\n * best matches the preferred language list, using the Lookup\n * algorithm of BCP 47.\n * If none of the available languages meets the user's preferences,\n * then \"\" is returned.\n * Extended language ranges are not supported.\n *\n * @method lookupBestLang\n * @param {String[] | String} preferredLanguages The list of preferred\n * languages in descending preference order, represented as BCP 47\n * language tags. A string array or a comma-separated list.\n * @param {String[]} availableLanguages The list of languages\n * that the application supports, represented as BCP 47 language\n * tags.\n *\n * @return {String} The available language that best matches the\n * preferred language list, or \"\".\n * @since 3.1.0\n */\n lookupBestLang: function(preferredLanguages, availableLanguages) {\n\n var i, language, result, index;\n\n // check whether the list of available languages contains language;\n // if so return it\n function scan(language) {\n var i;\n for (i = 0; i < availableLanguages.length; i += 1) {\n if (language.toLowerCase() ===\n availableLanguages[i].toLowerCase()) {\n return availableLanguages[i];\n }\n }\n }\n\n if (Y.Lang.isString(preferredLanguages)) {\n preferredLanguages = preferredLanguages.split(SPLIT_REGEX);\n }\n\n for (i = 0; i < preferredLanguages.length; i += 1) {\n language = preferredLanguages[i];\n if (!language || language === '*') {\n continue;\n }\n // check the fallback sequence for one language\n while (language.length > 0) {\n result = scan(language);\n if (result) {\n return result;\n } else {\n index = language.lastIndexOf('-');\n if (index >= 0) {\n language = language.substring(0, index);\n // one-character subtags get cut along with the\n // following subtag\n if (index >= 2 && language.charAt(index - 2) === '-') {\n language = language.substring(0, index - 2);\n }\n } else {\n // nothing available for this language\n break;\n }\n }\n }\n }\n\n return '';\n }\n});\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('yui-log', function (Y, NAME) {\n\n/**\n * Provides console log capability and exposes a custom event for\n * console implementations. This module is a `core` YUI module,\n * <a href=\"../classes/YUI.html#method_log\">it's documentation is located under the YUI class</a>.\n *\n * @module yui\n * @submodule yui-log\n */\n\nvar INSTANCE = Y,\n LOGEVENT = 'yui:log',\n UNDEFINED = 'undefined',\n LEVELS = { debug: 1,\n info: 1,\n warn: 1,\n error: 1 };\n\n/**\n * If the 'debug' config is true, a 'yui:log' event will be\n * dispatched, which the Console widget and anything else\n * can consume. If the 'useBrowserConsole' config is true, it will\n * write to the browser console if available. YUI-specific log\n * messages will only be present in the -debug versions of the\n * JS files. The build system is supposed to remove log statements\n * from the raw and minified versions of the files.\n *\n * @method log\n * @for YUI\n * @param {String} msg The message to log.\n * @param {String} cat The log category for the message. Default\n * categories are \"info\", \"warn\", \"error\", time\".\n * Custom categories can be used as well. (opt).\n * @param {String} src The source of the the message (opt).\n * @param {boolean} silent If true, the log event won't fire.\n * @return {YUI} YUI instance.\n */\nINSTANCE.log = function(msg, cat, src, silent) {\n var bail, excl, incl, m, f,\n Y = INSTANCE,\n c = Y.config,\n publisher = (Y.fire) ? Y : YUI.Env.globalEvents;\n // suppress log message if the config is off or the event stack\n // or the event call stack contains a consumer of the yui:log event\n if (c.debug) {\n // apply source filters\n src = src || \"\";\n if (typeof src !== \"undefined\") {\n excl = c.logExclude;\n incl = c.logInclude;\n if (incl && !(src in incl)) {\n bail = 1;\n } else if (incl && (src in incl)) {\n bail = !incl[src];\n } else if (excl && (src in excl)) {\n bail = excl[src];\n }\n }\n if (!bail) {\n if (c.useBrowserConsole) {\n m = (src) ? src + ': ' + msg : msg;\n if (Y.Lang.isFunction(c.logFn)) {\n c.logFn.call(Y, msg, cat, src);\n } else if (typeof console !== UNDEFINED && console.log) {\n f = (cat && console[cat] && (cat in LEVELS)) ? cat : 'log';\n console[f](m);\n } else if (typeof opera !== UNDEFINED) {\n opera.postError(m);\n }\n }\n\n if (publisher && !silent) {\n\n if (publisher === Y && (!publisher.getEvent(LOGEVENT))) {\n publisher.publish(LOGEVENT, {\n broadcast: 2\n });\n }\n\n publisher.fire(LOGEVENT, {\n msg: msg,\n cat: cat,\n src: src\n });\n }\n }\n }\n\n return Y;\n};\n\n/**\n * Write a system message. This message will be preserved in the\n * minified and raw versions of the YUI files, unlike log statements.\n * @method message\n * @for YUI\n * @param {String} msg The message to log.\n * @param {String} cat The log category for the message. Default\n * categories are \"info\", \"warn\", \"error\", time\".\n * Custom categories can be used as well. (opt).\n * @param {String} src The source of the the message (opt).\n * @param {boolean} silent If true, the log event won't fire.\n * @return {YUI} YUI instance.\n */\nINSTANCE.message = function() {\n return INSTANCE.log.apply(INSTANCE, arguments);\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('yui-later', function (Y, NAME) {\n\n/**\n * Provides a setTimeout/setInterval wrapper. This module is a `core` YUI module,\n * <a href=\"../classes/YUI.html#method_later\">it's documentation is located under the YUI class</a>.\n *\n * @module yui\n * @submodule yui-later\n */\n\nvar NO_ARGS = [];\n\n/**\n * Executes the supplied function in the context of the supplied\n * object 'when' milliseconds later. Executes the function a\n * single time unless periodic is set to true.\n * @for YUI\n * @method later\n * @param when {int} the number of milliseconds to wait until the fn\n * is executed.\n * @param o the context object.\n * @param fn {Function|String} the function to execute or the name of\n * the method in the 'o' object to execute.\n * @param data [Array] data that is provided to the function. This\n * accepts either a single item or an array. If an array is provided,\n * the function is executed with one parameter for each array item.\n * If you need to pass a single array parameter, it needs to be wrapped\n * in an array [myarray].\n *\n * Note: native methods in IE may not have the call and apply methods.\n * In this case, it will work, but you are limited to four arguments.\n *\n * @param periodic {boolean} if true, executes continuously at supplied\n * interval until canceled.\n * @return {object} a timer object. Call the cancel() method on this\n * object to stop the timer.\n */\nY.later = function(when, o, fn, data, periodic) {\n when = when || 0;\n data = (!Y.Lang.isUndefined(data)) ? Y.Array(data) : NO_ARGS;\n o = o || Y.config.win || Y;\n\n var cancelled = false,\n method = (o && Y.Lang.isString(fn)) ? o[fn] : fn,\n wrapper = function() {\n // IE 8- may execute a setInterval callback one last time\n // after clearInterval was called, so in order to preserve\n // the cancel() === no more runny-run, we have to jump through\n // an extra hoop.\n if (!cancelled) {\n if (!method.apply) {\n method(data[0], data[1], data[2], data[3]);\n } else {\n method.apply(o, data || NO_ARGS);\n }\n }\n },\n id = (periodic) ? setInterval(wrapper, when) : setTimeout(wrapper, when);\n\n return {\n id: id,\n interval: periodic,\n cancel: function() {\n cancelled = true;\n if (this.interval) {\n clearInterval(id);\n } else {\n clearTimeout(id);\n }\n }\n };\n};\n\nY.Lang.later = Y.later;\n\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('yui', function (Y, NAME) {}, '@VERSION@', {\"use\": [\"get\", \"features\", \"intl-base\", \"yui-log\", \"yui-later\"]});\nYUI.add('oop', function (Y, NAME) {\n\n/**\nAdds object inheritance and manipulation utilities to the YUI instance. This\nmodule is required by most YUI components.\n\n@module oop\n**/\n\nvar L = Y.Lang,\n A = Y.Array,\n OP = Object.prototype,\n CLONE_MARKER = '_~yuim~_',\n\n hasOwn = OP.hasOwnProperty,\n toString = OP.toString;\n\nfunction dispatch(o, f, c, proto, action) {\n if (o && o[action] && o !== Y) {\n return o[action].call(o, f, c);\n } else {\n switch (A.test(o)) {\n case 1:\n return A[action](o, f, c);\n case 2:\n return A[action](Y.Array(o, 0, true), f, c);\n default:\n return Y.Object[action](o, f, c, proto);\n }\n }\n}\n\n/**\nAugments the _receiver_ with prototype properties from the _supplier_. The\nreceiver may be a constructor function or an object. The supplier must be a\nconstructor function.\n\nIf the _receiver_ is an object, then the _supplier_ constructor will be called\nimmediately after _receiver_ is augmented, with _receiver_ as the `this` object.\n\nIf the _receiver_ is a constructor function, then all prototype methods of\n_supplier_ that are copied to _receiver_ will be sequestered, and the\n_supplier_ constructor will not be called immediately. The first time any\nsequestered method is called on the _receiver_'s prototype, all sequestered\nmethods will be immediately copied to the _receiver_'s prototype, the\n_supplier_'s constructor will be executed, and finally the newly unsequestered\nmethod that was called will be executed.\n\nThis sequestering logic sounds like a bunch of complicated voodoo, but it makes\nit cheap to perform frequent augmentation by ensuring that suppliers'\nconstructors are only called if a supplied method is actually used. If none of\nthe supplied methods is ever used, then there's no need to take the performance\nhit of calling the _supplier_'s constructor.\n\n@method augment\n@param {Function|Object} receiver Object or function to be augmented.\n@param {Function} supplier Function that supplies the prototype properties with\n which to augment the _receiver_.\n@param {Boolean} [overwrite=false] If `true`, properties already on the receiver\n will be overwritten if found on the supplier's prototype.\n@param {String[]} [whitelist] An array of property names. If specified,\n only the whitelisted prototype properties will be applied to the receiver, and\n all others will be ignored.\n@param {Array|any} [args] Argument or array of arguments to pass to the\n supplier's constructor when initializing.\n@return {Function} Augmented object.\n@for YUI\n**/\nY.augment = function (receiver, supplier, overwrite, whitelist, args) {\n var rProto = receiver.prototype,\n sequester = rProto && supplier,\n sProto = supplier.prototype,\n to = rProto || receiver,\n\n copy,\n newPrototype,\n replacements,\n sequestered,\n unsequester;\n\n args = args ? Y.Array(args) : [];\n\n if (sequester) {\n newPrototype = {};\n replacements = {};\n sequestered = {};\n\n copy = function (value, key) {\n if (overwrite || !(key in rProto)) {\n if (toString.call(value) === '[object Function]') {\n sequestered[key] = value;\n\n newPrototype[key] = replacements[key] = function () {\n return unsequester(this, value, arguments);\n };\n } else {\n newPrototype[key] = value;\n }\n }\n };\n\n unsequester = function (instance, fn, fnArgs) {\n // Unsequester all sequestered functions.\n for (var key in sequestered) {\n if (hasOwn.call(sequestered, key)\n && instance[key] === replacements[key]) {\n\n instance[key] = sequestered[key];\n }\n }\n\n // Execute the supplier constructor.\n supplier.apply(instance, args);\n\n // Finally, execute the original sequestered function.\n return fn.apply(instance, fnArgs);\n };\n\n if (whitelist) {\n Y.Array.each(whitelist, function (name) {\n if (name in sProto) {\n copy(sProto[name], name);\n }\n });\n } else {\n Y.Object.each(sProto, copy, null, true);\n }\n }\n\n Y.mix(to, newPrototype || sProto, overwrite, whitelist);\n\n if (!sequester) {\n supplier.apply(to, args);\n }\n\n return receiver;\n};\n\n/**\n * Copies object properties from the supplier to the receiver. If the target has\n * the property, and the property is an object, the target object will be\n * augmented with the supplier's value.\n *\n * @method aggregate\n * @param {Object} receiver Object to receive the augmentation.\n * @param {Object} supplier Object that supplies the properties with which to\n * augment the receiver.\n * @param {Boolean} [overwrite=false] If `true`, properties already on the receiver\n * will be overwritten if found on the supplier.\n * @param {String[]} [whitelist] Whitelist. If supplied, only properties in this\n * list will be applied to the receiver.\n * @return {Object} Augmented object.\n */\nY.aggregate = function(r, s, ov, wl) {\n return Y.mix(r, s, ov, wl, 0, true);\n};\n\n/**\n * Utility to set up the prototype, constructor and superclass properties to\n * support an inheritance strategy that can chain constructors and methods.\n * Static members will not be inherited.\n *\n * @method extend\n * @param {function} r the object to modify.\n * @param {function} s the object to inherit.\n * @param {object} px prototype properties to add/override.\n * @param {object} sx static properties to add/override.\n * @return {object} the extended object.\n */\nY.extend = function(r, s, px, sx) {\n if (!s || !r) {\n Y.error('extend failed, verify dependencies');\n }\n\n var sp = s.prototype, rp = Y.Object(sp);\n r.prototype = rp;\n\n rp.constructor = r;\n r.superclass = sp;\n\n // assign constructor property\n if (s != Object && sp.constructor == OP.constructor) {\n sp.constructor = s;\n }\n\n // add prototype overrides\n if (px) {\n Y.mix(rp, px, true);\n }\n\n // add object overrides\n if (sx) {\n Y.mix(r, sx, true);\n }\n\n return r;\n};\n\n/**\n * Executes the supplied function for each item in\n * a collection. Supports arrays, objects, and\n * NodeLists\n * @method each\n * @param {object} o the object to iterate.\n * @param {function} f the function to execute. This function\n * receives the value, key, and object as parameters.\n * @param {object} c the execution context for the function.\n * @param {boolean} proto if true, prototype properties are\n * iterated on objects.\n * @return {YUI} the YUI instance.\n */\nY.each = function(o, f, c, proto) {\n return dispatch(o, f, c, proto, 'each');\n};\n\n/**\n * Executes the supplied function for each item in\n * a collection. The operation stops if the function\n * returns true. Supports arrays, objects, and\n * NodeLists.\n * @method some\n * @param {object} o the object to iterate.\n * @param {function} f the function to execute. This function\n * receives the value, key, and object as parameters.\n * @param {object} c the execution context for the function.\n * @param {boolean} proto if true, prototype properties are\n * iterated on objects.\n * @return {boolean} true if the function ever returns true,\n * false otherwise.\n */\nY.some = function(o, f, c, proto) {\n return dispatch(o, f, c, proto, 'some');\n};\n\n/**\n * Deep object/array copy. Function clones are actually\n * wrappers around the original function.\n * Array-like objects are treated as arrays.\n * Primitives are returned untouched. Optionally, a\n * function can be provided to handle other data types,\n * filter keys, validate values, etc.\n *\n * NOTE: Cloning a non-trivial object is a reasonably heavy operation, due to\n * the need to recurrsively iterate down non-primitive properties. Clone\n * should be used only when a deep clone down to leaf level properties\n * is explicitly required.\n *\n * In many cases (for example, when trying to isolate objects used as \n * hashes for configuration properties), a shallow copy, using Y.merge is \n * normally sufficient. If more than one level of isolation is required, \n * Y.merge can be used selectively at each level which needs to be \n * isolated from the original without going all the way to leaf properties.\n *\n * @method clone\n * @param {object} o what to clone.\n * @param {boolean} safe if true, objects will not have prototype\n * items from the source. If false, they will. In this case, the\n * original is initially protected, but the clone is not completely\n * immune from changes to the source object prototype. Also, cloned\n * prototype items that are deleted from the clone will result\n * in the value of the source prototype being exposed. If operating\n * on a non-safe clone, items should be nulled out rather than deleted.\n * @param {function} f optional function to apply to each item in a\n * collection; it will be executed prior to applying the value to\n * the new object. Return false to prevent the copy.\n * @param {object} c optional execution context for f.\n * @param {object} owner Owner object passed when clone is iterating\n * an object. Used to set up context for cloned functions.\n * @param {object} cloned hash of previously cloned objects to avoid\n * multiple clones.\n * @return {Array|Object} the cloned object.\n */\nY.clone = function(o, safe, f, c, owner, cloned) {\n\n if (!L.isObject(o)) {\n return o;\n }\n\n // @todo cloning YUI instances doesn't currently work\n if (Y.instanceOf(o, YUI)) {\n return o;\n }\n\n var o2, marked = cloned || {}, stamp,\n yeach = Y.each;\n\n switch (L.type(o)) {\n case 'date':\n return new Date(o);\n case 'regexp':\n // if we do this we need to set the flags too\n // return new RegExp(o.source);\n return o;\n case 'function':\n // o2 = Y.bind(o, owner);\n // break;\n return o;\n case 'array':\n o2 = [];\n break;\n default:\n\n // #2528250 only one clone of a given object should be created.\n if (o[CLONE_MARKER]) {\n return marked[o[CLONE_MARKER]];\n }\n\n stamp = Y.guid();\n\n o2 = (safe) ? {} : Y.Object(o);\n\n o[CLONE_MARKER] = stamp;\n marked[stamp] = o;\n }\n\n // #2528250 don't try to clone element properties\n if (!o.addEventListener && !o.attachEvent) {\n yeach(o, function(v, k) {\nif ((k || k === 0) && (!f || (f.call(c || this, v, k, this, o) !== false))) {\n if (k !== CLONE_MARKER) {\n if (k == 'prototype') {\n // skip the prototype\n // } else if (o[k] === o) {\n // this[k] = this;\n } else {\n this[k] =\n Y.clone(v, safe, f, c, owner || o, marked);\n }\n }\n }\n }, o2);\n }\n\n if (!cloned) {\n Y.Object.each(marked, function(v, k) {\n if (v[CLONE_MARKER]) {\n try {\n delete v[CLONE_MARKER];\n } catch (e) {\n v[CLONE_MARKER] = null;\n }\n }\n }, this);\n marked = null;\n }\n\n return o2;\n};\n\n\n/**\n * Returns a function that will execute the supplied function in the\n * supplied object's context, optionally adding any additional\n * supplied parameters to the beginning of the arguments collection the\n * supplied to the function.\n *\n * @method bind\n * @param {Function|String} f the function to bind, or a function name\n * to execute on the context object.\n * @param {object} c the execution context.\n * @param {any} args* 0..n arguments to include before the arguments the\n * function is executed with.\n * @return {function} the wrapped function.\n */\nY.bind = function(f, c) {\n var xargs = arguments.length > 2 ?\n Y.Array(arguments, 2, true) : null;\n return function() {\n var fn = L.isString(f) ? c[f] : f,\n args = (xargs) ?\n xargs.concat(Y.Array(arguments, 0, true)) : arguments;\n return fn.apply(c || fn, args);\n };\n};\n\n/**\n * Returns a function that will execute the supplied function in the\n * supplied object's context, optionally adding any additional\n * supplied parameters to the end of the arguments the function\n * is executed with.\n *\n * @method rbind\n * @param {Function|String} f the function to bind, or a function name\n * to execute on the context object.\n * @param {object} c the execution context.\n * @param {any} args* 0..n arguments to append to the end of\n * arguments collection supplied to the function.\n * @return {function} the wrapped function.\n */\nY.rbind = function(f, c) {\n var xargs = arguments.length > 2 ? Y.Array(arguments, 2, true) : null;\n return function() {\n var fn = L.isString(f) ? c[f] : f,\n args = (xargs) ?\n Y.Array(arguments, 0, true).concat(xargs) : arguments;\n return fn.apply(c || fn, args);\n };\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('features', function (Y, NAME) {\n\nvar feature_tests = {};\n\n/**\nContains the core of YUI's feature test architecture.\n@module features\n*/\n\n/**\n* Feature detection\n* @class Features\n* @static\n*/\n\nY.mix(Y.namespace('Features'), {\n\n /**\n * Object hash of all registered feature tests\n * @property tests\n * @type Object\n */\n tests: feature_tests,\n\n /**\n * Add a test to the system\n *\n * ```\n * Y.Features.add(\"load\", \"1\", {});\n * ```\n *\n * @method add\n * @param {String} cat The category, right now only 'load' is supported\n * @param {String} name The number sequence of the test, how it's reported in the URL or config: 1, 2, 3\n * @param {Object} o Object containing test properties\n * @param {String} o.name The name of the test\n * @param {Function} o.test The test function to execute, the only argument to the function is the `Y` instance\n * @param {String} o.trigger The module that triggers this test.\n */\n add: function(cat, name, o) {\n feature_tests[cat] = feature_tests[cat] || {};\n feature_tests[cat][name] = o;\n },\n /**\n * Execute all tests of a given category and return the serialized results\n *\n * ```\n * caps=1:1;2:1;3:0\n * ```\n * @method all\n * @param {String} cat The category to execute\n * @param {Array} args The arguments to pass to the test function\n * @return {String} A semi-colon separated string of tests and their success/failure: 1:1;2:1;3:0\n */\n all: function(cat, args) {\n var cat_o = feature_tests[cat],\n // results = {};\n result = [];\n if (cat_o) {\n Y.Object.each(cat_o, function(v, k) {\n result.push(k + ':' + (Y.Features.test(cat, k, args) ? 1 : 0));\n });\n }\n\n return (result.length) ? result.join(';') : '';\n },\n /**\n * Run a sepecific test and return a Boolean response.\n *\n * ```\n * Y.Features.test(\"load\", \"1\");\n * ```\n *\n * @method test\n * @param {String} cat The category of the test to run\n * @param {String} name The name of the test to run\n * @param {Array} args The arguments to pass to the test function\n * @return {Boolean} True or false if the test passed/failed.\n */\n test: function(cat, name, args) {\n args = args || [];\n var result, ua, test,\n cat_o = feature_tests[cat],\n feature = cat_o && cat_o[name];\n\n if (!feature) {\n Y.log('Feature test ' + cat + ', ' + name + ' not found');\n } else {\n\n result = feature.result;\n\n if (Y.Lang.isUndefined(result)) {\n\n ua = feature.ua;\n if (ua) {\n result = (Y.UA[ua]);\n }\n\n test = feature.test;\n if (test && ((!ua) || result)) {\n result = test.apply(Y, args);\n }\n\n feature.result = result;\n }\n }\n\n return result;\n }\n});\n\n// Y.Features.add(\"load\", \"1\", {});\n// Y.Features.test(\"load\", \"1\");\n// caps=1:1;2:0;3:1;\n\n/* This file is auto-generated by (yogi loader --yes --mix --start ../) */\n/*jshint maxlen:900, eqeqeq: false */\nvar add = Y.Features.add;\n// app-transitions-native\nadd('load', '0', {\n \"name\": \"app-transitions-native\",\n \"test\": function (Y) {\n var doc = Y.config.doc,\n node = doc ? doc.documentElement : null;\n\n if (node && node.style) {\n return ('MozTransition' in node.style || 'WebkitTransition' in node.style || 'transition' in node.style);\n }\n\n return false;\n},\n \"trigger\": \"app-transitions\"\n});\n// autocomplete-list-keys\nadd('load', '1', {\n \"name\": \"autocomplete-list-keys\",\n \"test\": function (Y) {\n // Only add keyboard support to autocomplete-list if this doesn't appear to\n // be an iOS or Android-based mobile device.\n //\n // There's currently no feasible way to actually detect whether a device has\n // a hardware keyboard, so this sniff will have to do. It can easily be\n // overridden by manually loading the autocomplete-list-keys module.\n //\n // Worth noting: even though iOS supports bluetooth keyboards, Mobile Safari\n // doesn't fire the keyboard events used by AutoCompleteList, so there's\n // no point loading the -keys module even when a bluetooth keyboard may be\n // available.\n return !(Y.UA.ios || Y.UA.android);\n},\n \"trigger\": \"autocomplete-list\"\n});\n// dd-gestures\nadd('load', '2', {\n \"name\": \"dd-gestures\",\n \"trigger\": \"dd-drag\",\n \"ua\": \"touchEnabled\"\n});\n// dom-style-ie\nadd('load', '3', {\n \"name\": \"dom-style-ie\",\n \"test\": function (Y) {\n\n var testFeature = Y.Features.test,\n addFeature = Y.Features.add,\n WINDOW = Y.config.win,\n DOCUMENT = Y.config.doc,\n DOCUMENT_ELEMENT = 'documentElement',\n ret = false;\n\n addFeature('style', 'computedStyle', {\n test: function() {\n return WINDOW && 'getComputedStyle' in WINDOW;\n }\n });\n\n addFeature('style', 'opacity', {\n test: function() {\n return DOCUMENT && 'opacity' in DOCUMENT[DOCUMENT_ELEMENT].style;\n }\n });\n\n ret = (!testFeature('style', 'opacity') &&\n !testFeature('style', 'computedStyle'));\n\n return ret;\n},\n \"trigger\": \"dom-style\"\n});\n// editor-para-ie\nadd('load', '4', {\n \"name\": \"editor-para-ie\",\n \"trigger\": \"editor-para\",\n \"ua\": \"ie\",\n \"when\": \"instead\"\n});\n// event-base-ie\nadd('load', '5', {\n \"name\": \"event-base-ie\",\n \"test\": function(Y) {\n var imp = Y.config.doc && Y.config.doc.implementation;\n return (imp && (!imp.hasFeature('Events', '2.0')));\n},\n \"trigger\": \"node-base\"\n});\n// graphics-canvas\nadd('load', '6', {\n \"name\": \"graphics-canvas\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useCanvas = Y.config.defaultGraphicEngine && Y.config.defaultGraphicEngine == \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n return (!svg || useCanvas) && (canvas && canvas.getContext && canvas.getContext(\"2d\"));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-canvas-default\nadd('load', '7', {\n \"name\": \"graphics-canvas-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useCanvas = Y.config.defaultGraphicEngine && Y.config.defaultGraphicEngine == \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n return (!svg || useCanvas) && (canvas && canvas.getContext && canvas.getContext(\"2d\"));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-svg\nadd('load', '8', {\n \"name\": \"graphics-svg\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useSVG = !Y.config.defaultGraphicEngine || Y.config.defaultGraphicEngine != \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n \n return svg && (useSVG || !canvas);\n},\n \"trigger\": \"graphics\"\n});\n// graphics-svg-default\nadd('load', '9', {\n \"name\": \"graphics-svg-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n useSVG = !Y.config.defaultGraphicEngine || Y.config.defaultGraphicEngine != \"canvas\",\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\"),\n svg = (DOCUMENT && DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\"));\n \n return svg && (useSVG || !canvas);\n},\n \"trigger\": \"graphics\"\n});\n// graphics-vml\nadd('load', '10', {\n \"name\": \"graphics-vml\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\");\n return (DOCUMENT && !DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\") && (!canvas || !canvas.getContext || !canvas.getContext(\"2d\")));\n},\n \"trigger\": \"graphics\"\n});\n// graphics-vml-default\nadd('load', '11', {\n \"name\": \"graphics-vml-default\",\n \"test\": function(Y) {\n var DOCUMENT = Y.config.doc,\n\t\tcanvas = DOCUMENT && DOCUMENT.createElement(\"canvas\");\n return (DOCUMENT && !DOCUMENT.implementation.hasFeature(\"http://www.w3.org/TR/SVG11/feature#BasicStructure\", \"1.1\") && (!canvas || !canvas.getContext || !canvas.getContext(\"2d\")));\n},\n \"trigger\": \"graphics\"\n});\n// history-hash-ie\nadd('load', '12', {\n \"name\": \"history-hash-ie\",\n \"test\": function (Y) {\n var docMode = Y.config.doc && Y.config.doc.documentMode;\n\n return Y.UA.ie && (!('onhashchange' in Y.config.win) ||\n !docMode || docMode < 8);\n},\n \"trigger\": \"history-hash\"\n});\n// io-nodejs\nadd('load', '13', {\n \"name\": \"io-nodejs\",\n \"trigger\": \"io-base\",\n \"ua\": \"nodejs\"\n});\n// json-parse-shim\nadd('load', '14', {\n \"name\": \"json-parse-shim\",\n \"test\": function (Y) {\n var _JSON = Y.config.global.JSON,\n Native = Object.prototype.toString.call(_JSON) === '[object JSON]' && _JSON,\n nativeSupport = Y.config.useNativeJSONParse !== false && !!Native;\n\n function workingNative( k, v ) {\n return k === \"ok\" ? true : v;\n }\n \n // Double check basic functionality. This is mainly to catch early broken\n // implementations of the JSON API in Firefox 3.1 beta1 and beta2\n if ( nativeSupport ) {\n try {\n nativeSupport = ( Native.parse( '{\"ok\":false}', workingNative ) ).ok;\n }\n catch ( e ) {\n nativeSupport = false;\n }\n }\n\n return !nativeSupport;\n},\n \"trigger\": \"json-parse\"\n});\n// json-stringify-shim\nadd('load', '15', {\n \"name\": \"json-stringify-shim\",\n \"test\": function (Y) {\n var _JSON = Y.config.global.JSON,\n Native = Object.prototype.toString.call(_JSON) === '[object JSON]' && _JSON,\n nativeSupport = Y.config.useNativeJSONStringify !== false && !!Native;\n\n // Double check basic native functionality. This is primarily to catch broken\n // early JSON API implementations in Firefox 3.1 beta1 and beta2.\n if ( nativeSupport ) {\n try {\n nativeSupport = ( '0' === Native.stringify(0) );\n } catch ( e ) {\n nativeSupport = false;\n }\n }\n\n\n return !nativeSupport;\n},\n \"trigger\": \"json-stringify\"\n});\n// scrollview-base-ie\nadd('load', '16', {\n \"name\": \"scrollview-base-ie\",\n \"trigger\": \"scrollview-base\",\n \"ua\": \"ie\"\n});\n// selector-css2\nadd('load', '17', {\n \"name\": \"selector-css2\",\n \"test\": function (Y) {\n var DOCUMENT = Y.config.doc,\n ret = DOCUMENT && !('querySelectorAll' in DOCUMENT);\n\n return ret;\n},\n \"trigger\": \"selector\"\n});\n// transition-timer\nadd('load', '18', {\n \"name\": \"transition-timer\",\n \"test\": function (Y) {\n var DOCUMENT = Y.config.doc,\n node = (DOCUMENT) ? DOCUMENT.documentElement: null,\n ret = true;\n\n if (node && node.style) {\n ret = !('MozTransition' in node.style || 'WebkitTransition' in node.style || 'transition' in node.style);\n }\n\n return ret;\n},\n \"trigger\": \"transition\"\n});\n// widget-base-ie\nadd('load', '19', {\n \"name\": \"widget-base-ie\",\n \"trigger\": \"widget-base\",\n \"ua\": \"ie\"\n});\n// yql-jsonp\nadd('load', '20', {\n \"name\": \"yql-jsonp\",\n \"test\": function (Y) {\n /* Only load the JSONP module when not in nodejs or winjs\n TODO Make the winjs module a CORS module\n */\n return (!Y.UA.nodejs && !Y.UA.winjs);\n},\n \"trigger\": \"yql\",\n \"when\": \"after\"\n});\n// yql-nodejs\nadd('load', '21', {\n \"name\": \"yql-nodejs\",\n \"trigger\": \"yql\",\n \"ua\": \"nodejs\",\n \"when\": \"after\"\n});\n// yql-winjs\nadd('load', '22', {\n \"name\": \"yql-winjs\",\n \"trigger\": \"yql\",\n \"ua\": \"winjs\",\n \"when\": \"after\"\n});\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('dom-core', function (Y, NAME) {\n\nvar NODE_TYPE = 'nodeType',\n OWNER_DOCUMENT = 'ownerDocument',\n DOCUMENT_ELEMENT = 'documentElement',\n DEFAULT_VIEW = 'defaultView',\n PARENT_WINDOW = 'parentWindow',\n TAG_NAME = 'tagName',\n PARENT_NODE = 'parentNode',\n PREVIOUS_SIBLING = 'previousSibling',\n NEXT_SIBLING = 'nextSibling',\n CONTAINS = 'contains',\n COMPARE_DOCUMENT_POSITION = 'compareDocumentPosition',\n EMPTY_ARRAY = [],\n \n // IE < 8 throws on node.contains(textNode)\n supportsContainsTextNode = (function() {\n var node = Y.config.doc.createElement('div'),\n textNode = node.appendChild(Y.config.doc.createTextNode('')),\n result = false;\n \n try {\n result = node.contains(textNode);\n } catch(e) {}\n\n return result;\n })(),\n\n/** \n * The DOM utility provides a cross-browser abtraction layer\n * normalizing DOM tasks, and adds extra helper functionality\n * for other common tasks. \n * @module dom\n * @main dom\n * @submodule dom-base\n * @for DOM\n *\n */\n\n/**\n * Provides DOM helper methods.\n * @class DOM\n *\n */\n \nY_DOM = {\n /**\n * Returns the HTMLElement with the given ID (Wrapper for document.getElementById).\n * @method byId \n * @param {String} id the id attribute \n * @param {Object} doc optional The document to search. Defaults to current document \n * @return {HTMLElement | null} The HTMLElement with the id, or null if none found. \n */\n byId: function(id, doc) {\n // handle dupe IDs and IE name collision\n return Y_DOM.allById(id, doc)[0] || null;\n },\n\n getId: function(node) {\n var id;\n // HTMLElement returned from FORM when INPUT name === \"id\"\n // IE < 8: HTMLCollection returned when INPUT id === \"id\"\n // via both getAttribute and form.id \n if (node.id && !node.id.tagName && !node.id.item) {\n id = node.id;\n } else if (node.attributes && node.attributes.id) {\n id = node.attributes.id.value;\n }\n\n return id;\n },\n\n setId: function(node, id) {\n if (node.setAttribute) {\n node.setAttribute('id', id);\n } else {\n node.id = id;\n }\n },\n\n /*\n * Finds the ancestor of the element.\n * @method ancestor\n * @param {HTMLElement} element The html element.\n * @param {Function} fn optional An optional boolean test to apply.\n * The optional function is passed the current DOM node being tested as its only argument.\n * If no function is given, the parentNode is returned.\n * @param {Boolean} testSelf optional Whether or not to include the element in the scan \n * @return {HTMLElement | null} The matching DOM node or null if none found. \n */\n ancestor: function(element, fn, testSelf, stopFn) {\n var ret = null;\n if (testSelf) {\n ret = (!fn || fn(element)) ? element : null;\n\n }\n return ret || Y_DOM.elementByAxis(element, PARENT_NODE, fn, null, stopFn);\n },\n\n /*\n * Finds the ancestors of the element.\n * @method ancestors\n * @param {HTMLElement} element The html element.\n * @param {Function} fn optional An optional boolean test to apply.\n * The optional function is passed the current DOM node being tested as its only argument.\n * If no function is given, all ancestors are returned.\n * @param {Boolean} testSelf optional Whether or not to include the element in the scan \n * @return {Array} An array containing all matching DOM nodes.\n */\n ancestors: function(element, fn, testSelf, stopFn) {\n var ancestor = element,\n ret = [];\n\n while ((ancestor = Y_DOM.ancestor(ancestor, fn, testSelf, stopFn))) {\n testSelf = false;\n if (ancestor) {\n ret.unshift(ancestor);\n\n if (stopFn && stopFn(ancestor)) {\n return ret;\n }\n }\n }\n\n return ret;\n },\n\n /**\n * Searches the element by the given axis for the first matching element.\n * @method elementByAxis\n * @param {HTMLElement} element The html element.\n * @param {String} axis The axis to search (parentNode, nextSibling, previousSibling).\n * @param {Function} fn optional An optional boolean test to apply.\n * @param {Boolean} all optional Whether all node types should be returned, or just element nodes.\n * The optional function is passed the current HTMLElement being tested as its only argument.\n * If no function is given, the first element is returned.\n * @return {HTMLElement | null} The matching element or null if none found.\n */\n elementByAxis: function(element, axis, fn, all, stopAt) {\n while (element && (element = element[axis])) { // NOTE: assignment\n if ( (all || element[TAG_NAME]) && (!fn || fn(element)) ) {\n return element;\n }\n\n if (stopAt && stopAt(element)) {\n return null;\n }\n }\n return null;\n },\n\n /**\n * Determines whether or not one HTMLElement is or contains another HTMLElement.\n * @method contains\n * @param {HTMLElement} element The containing html element.\n * @param {HTMLElement} needle The html element that may be contained.\n * @return {Boolean} Whether or not the element is or contains the needle.\n */\n contains: function(element, needle) {\n var ret = false;\n\n if ( !needle || !element || !needle[NODE_TYPE] || !element[NODE_TYPE]) {\n ret = false;\n } else if (element[CONTAINS] &&\n // IE < 8 throws on node.contains(textNode) so fall back to brute.\n // Falling back for other nodeTypes as well.\n (needle[NODE_TYPE] === 1 || supportsContainsTextNode)) {\n ret = element[CONTAINS](needle);\n } else if (element[COMPARE_DOCUMENT_POSITION]) {\n // Match contains behavior (node.contains(node) === true).\n // Needed for Firefox < 4.\n if (element === needle || !!(element[COMPARE_DOCUMENT_POSITION](needle) & 16)) { \n ret = true;\n }\n } else {\n ret = Y_DOM._bruteContains(element, needle);\n }\n\n return ret;\n },\n\n /**\n * Determines whether or not the HTMLElement is part of the document.\n * @method inDoc\n * @param {HTMLElement} element The containing html element.\n * @param {HTMLElement} doc optional The document to check.\n * @return {Boolean} Whether or not the element is attached to the document. \n */\n inDoc: function(element, doc) {\n var ret = false,\n rootNode;\n\n if (element && element.nodeType) {\n (doc) || (doc = element[OWNER_DOCUMENT]);\n\n rootNode = doc[DOCUMENT_ELEMENT];\n\n // contains only works with HTML_ELEMENT\n if (rootNode && rootNode.contains && element.tagName) {\n ret = rootNode.contains(element);\n } else {\n ret = Y_DOM.contains(rootNode, element);\n }\n }\n\n return ret;\n\n },\n\n allById: function(id, root) {\n root = root || Y.config.doc;\n var nodes = [],\n ret = [],\n i,\n node;\n\n if (root.querySelectorAll) {\n ret = root.querySelectorAll('[id=\"' + id + '\"]');\n } else if (root.all) {\n nodes = root.all(id);\n\n if (nodes) {\n // root.all may return HTMLElement or HTMLCollection.\n // some elements are also HTMLCollection (FORM, SELECT).\n if (nodes.nodeName) {\n if (nodes.id === id) { // avoid false positive on name\n ret.push(nodes);\n nodes = EMPTY_ARRAY; // done, no need to filter\n } else { // prep for filtering\n nodes = [nodes];\n }\n }\n\n if (nodes.length) {\n // filter out matches on node.name\n // and element.id as reference to element with id === 'id'\n for (i = 0; node = nodes[i++];) {\n if (node.id === id || \n (node.attributes && node.attributes.id &&\n node.attributes.id.value === id)) { \n ret.push(node);\n }\n }\n }\n }\n } else {\n ret = [Y_DOM._getDoc(root).getElementById(id)];\n }\n \n return ret;\n },\n\n\n isWindow: function(obj) {\n return !!(obj && obj.scrollTo && obj.document);\n },\n\n _removeChildNodes: function(node) {\n while (node.firstChild) {\n node.removeChild(node.firstChild);\n }\n },\n\n siblings: function(node, fn) {\n var nodes = [],\n sibling = node;\n\n while ((sibling = sibling[PREVIOUS_SIBLING])) {\n if (sibling[TAG_NAME] && (!fn || fn(sibling))) {\n nodes.unshift(sibling);\n }\n }\n\n sibling = node;\n while ((sibling = sibling[NEXT_SIBLING])) {\n if (sibling[TAG_NAME] && (!fn || fn(sibling))) {\n nodes.push(sibling);\n }\n }\n\n return nodes;\n },\n\n /**\n * Brute force version of contains.\n * Used for browsers without contains support for non-HTMLElement Nodes (textNodes, etc).\n * @method _bruteContains\n * @private\n * @param {HTMLElement} element The containing html element.\n * @param {HTMLElement} needle The html element that may be contained.\n * @return {Boolean} Whether or not the element is or contains the needle.\n */\n _bruteContains: function(element, needle) {\n while (needle) {\n if (element === needle) {\n return true;\n }\n needle = needle.parentNode;\n }\n return false;\n },\n\n// TODO: move to Lang?\n /**\n * Memoizes dynamic regular expressions to boost runtime performance. \n * @method _getRegExp\n * @private\n * @param {String} str The string to convert to a regular expression.\n * @param {String} flags optional An optinal string of flags.\n * @return {RegExp} An instance of RegExp\n */\n _getRegExp: function(str, flags) {\n flags = flags || '';\n Y_DOM._regexCache = Y_DOM._regexCache || {};\n if (!Y_DOM._regexCache[str + flags]) {\n Y_DOM._regexCache[str + flags] = new RegExp(str, flags);\n }\n return Y_DOM._regexCache[str + flags];\n },\n\n// TODO: make getDoc/Win true privates?\n /**\n * returns the appropriate document.\n * @method _getDoc\n * @private\n * @param {HTMLElement} element optional Target element.\n * @return {Object} The document for the given element or the default document. \n */\n _getDoc: function(element) {\n var doc = Y.config.doc;\n if (element) {\n doc = (element[NODE_TYPE] === 9) ? element : // element === document\n element[OWNER_DOCUMENT] || // element === DOM node\n element.document || // element === window\n Y.config.doc; // default\n }\n\n return doc;\n },\n\n /**\n * returns the appropriate window.\n * @method _getWin\n * @private\n * @param {HTMLElement} element optional Target element.\n * @return {Object} The window for the given element or the default window. \n */\n _getWin: function(element) {\n var doc = Y_DOM._getDoc(element);\n return doc[DEFAULT_VIEW] || doc[PARENT_WINDOW] || Y.config.win;\n },\n\n _batch: function(nodes, fn, arg1, arg2, arg3, etc) {\n fn = (typeof fn === 'string') ? Y_DOM[fn] : fn;\n var result,\n i = 0,\n node,\n ret;\n\n if (fn && nodes) {\n while ((node = nodes[i++])) {\n result = result = fn.call(Y_DOM, node, arg1, arg2, arg3, etc);\n if (typeof result !== 'undefined') {\n (ret) || (ret = []);\n ret.push(result);\n }\n }\n }\n\n return (typeof ret !== 'undefined') ? ret : nodes;\n },\n\n generateID: function(el) {\n var id = el.id;\n\n if (!id) {\n id = Y.stamp(el);\n el.id = id; \n } \n\n return id; \n }\n};\n\n\nY.DOM = Y_DOM;\n\n\n}, '@VERSION@', {\"requires\": [\"oop\", \"features\"]});\nYUI.add('dom-base', function (Y, NAME) {\n\n/**\n* @for DOM\n* @module dom\n*/\nvar documentElement = Y.config.doc.documentElement,\n Y_DOM = Y.DOM,\n TAG_NAME = 'tagName',\n OWNER_DOCUMENT = 'ownerDocument',\n EMPTY_STRING = '',\n addFeature = Y.Features.add,\n testFeature = Y.Features.test;\n\nY.mix(Y_DOM, {\n /**\n * Returns the text content of the HTMLElement. \n * @method getText \n * @param {HTMLElement} element The html element. \n * @return {String} The text content of the element (includes text of any descending elements).\n */\n getText: (documentElement.textContent !== undefined) ?\n function(element) {\n var ret = '';\n if (element) {\n ret = element.textContent;\n }\n return ret || '';\n } : function(element) {\n var ret = '';\n if (element) {\n ret = element.innerText || element.nodeValue; // might be a textNode\n }\n return ret || '';\n },\n\n /**\n * Sets the text content of the HTMLElement. \n * @method setText \n * @param {HTMLElement} element The html element. \n * @param {String} content The content to add. \n */\n setText: (documentElement.textContent !== undefined) ?\n function(element, content) {\n if (element) {\n element.textContent = content;\n }\n } : function(element, content) {\n if ('innerText' in element) {\n element.innerText = content;\n } else if ('nodeValue' in element) {\n element.nodeValue = content;\n }\n },\n\n CUSTOM_ATTRIBUTES: (!documentElement.hasAttribute) ? { // IE < 8\n 'for': 'htmlFor',\n 'class': 'className'\n } : { // w3c\n 'htmlFor': 'for',\n 'className': 'class'\n },\n\n /**\n * Provides a normalized attribute interface. \n * @method setAttribute\n * @param {HTMLElement} el The target element for the attribute.\n * @param {String} attr The attribute to set.\n * @param {String} val The value of the attribute.\n */\n setAttribute: function(el, attr, val, ieAttr) {\n if (el && attr && el.setAttribute) {\n attr = Y_DOM.CUSTOM_ATTRIBUTES[attr] || attr;\n el.setAttribute(attr, val, ieAttr);\n }\n else { Y.log('bad input to setAttribute', 'warn', 'dom'); }\n },\n\n\n /**\n * Provides a normalized attribute interface. \n * @method getAttribute\n * @param {HTMLElement} el The target element for the attribute.\n * @param {String} attr The attribute to get.\n * @return {String} The current value of the attribute. \n */\n getAttribute: function(el, attr, ieAttr) {\n ieAttr = (ieAttr !== undefined) ? ieAttr : 2;\n var ret = '';\n if (el && attr && el.getAttribute) {\n attr = Y_DOM.CUSTOM_ATTRIBUTES[attr] || attr;\n ret = el.getAttribute(attr, ieAttr);\n\n if (ret === null) {\n ret = ''; // per DOM spec\n }\n }\n else { Y.log('bad input to getAttribute', 'warn', 'dom'); }\n return ret;\n },\n\n VALUE_SETTERS: {},\n\n VALUE_GETTERS: {},\n\n getValue: function(node) {\n var ret = '', // TODO: return null?\n getter;\n\n if (node && node[TAG_NAME]) {\n getter = Y_DOM.VALUE_GETTERS[node[TAG_NAME].toLowerCase()];\n\n if (getter) {\n ret = getter(node);\n } else {\n ret = node.value;\n }\n }\n\n // workaround for IE8 JSON stringify bug\n // which converts empty string values to null\n if (ret === EMPTY_STRING) {\n ret = EMPTY_STRING; // for real\n }\n\n return (typeof ret === 'string') ? ret : '';\n },\n\n setValue: function(node, val) {\n var setter;\n\n if (node && node[TAG_NAME]) {\n setter = Y_DOM.VALUE_SETTERS[node[TAG_NAME].toLowerCase()];\n\n if (setter) {\n setter(node, val);\n } else {\n node.value = val;\n }\n }\n },\n\n creators: {}\n});\n\naddFeature('value-set', 'select', {\n test: function() {\n var node = Y.config.doc.createElement('select');\n node.innerHTML = '<option>1</option><option>2</option>';\n node.value = '2';\n return (node.value && node.value === '2');\n }\n});\n\nif (!testFeature('value-set', 'select')) {\n Y_DOM.VALUE_SETTERS.select = function(node, val) {\n for (var i = 0, options = node.getElementsByTagName('option'), option;\n option = options[i++];) {\n if (Y_DOM.getValue(option) === val) {\n option.selected = true;\n //Y_DOM.setAttribute(option, 'selected', 'selected');\n break;\n }\n }\n };\n}\n\nY.mix(Y_DOM.VALUE_GETTERS, {\n button: function(node) {\n return (node.attributes && node.attributes.value) ? node.attributes.value.value : '';\n }\n});\n\nY.mix(Y_DOM.VALUE_SETTERS, {\n // IE: node.value changes the button text, which should be handled via innerHTML\n button: function(node, val) {\n var attr = node.attributes.value;\n if (!attr) {\n attr = node[OWNER_DOCUMENT].createAttribute('value');\n node.setAttributeNode(attr);\n }\n\n attr.value = val;\n }\n});\n\n\nY.mix(Y_DOM.VALUE_GETTERS, {\n option: function(node) {\n var attrs = node.attributes;\n return (attrs.value && attrs.value.specified) ? node.value : node.text;\n },\n\n select: function(node) {\n var val = node.value,\n options = node.options;\n\n if (options && options.length) {\n // TODO: implement multipe select\n if (node.multiple) {\n Y.log('multiple select normalization not implemented', 'warn', 'DOM');\n } else if (node.selectedIndex > -1) {\n val = Y_DOM.getValue(options[node.selectedIndex]);\n }\n }\n\n return val;\n }\n});\nvar addClass, hasClass, removeClass;\n\nY.mix(Y.DOM, {\n /**\n * Determines whether a DOM element has the given className.\n * @method hasClass\n * @for DOM\n * @param {HTMLElement} element The DOM element. \n * @param {String} className the class name to search for\n * @return {Boolean} Whether or not the element has the given class. \n */\n hasClass: function(node, className) {\n var re = Y.DOM._getRegExp('(?:^|\\\\s+)' + className + '(?:\\\\s+|$)');\n return re.test(node.className);\n },\n\n /**\n * Adds a class name to a given DOM element.\n * @method addClass \n * @for DOM\n * @param {HTMLElement} element The DOM element. \n * @param {String} className the class name to add to the class attribute\n */\n addClass: function(node, className) {\n if (!Y.DOM.hasClass(node, className)) { // skip if already present \n node.className = Y.Lang.trim([node.className, className].join(' '));\n }\n },\n\n /**\n * Removes a class name from a given element.\n * @method removeClass \n * @for DOM\n * @param {HTMLElement} element The DOM element. \n * @param {String} className the class name to remove from the class attribute\n */\n removeClass: function(node, className) {\n if (className && hasClass(node, className)) {\n node.className = Y.Lang.trim(node.className.replace(Y.DOM._getRegExp('(?:^|\\\\s+)' +\n className + '(?:\\\\s+|$)'), ' '));\n\n if ( hasClass(node, className) ) { // in case of multiple adjacent\n removeClass(node, className);\n }\n } \n },\n\n /**\n * Replace a class with another class for a given element.\n * If no oldClassName is present, the newClassName is simply added.\n * @method replaceClass \n * @for DOM\n * @param {HTMLElement} element The DOM element \n * @param {String} oldClassName the class name to be replaced\n * @param {String} newClassName the class name that will be replacing the old class name\n */\n replaceClass: function(node, oldC, newC) {\n //Y.log('replaceClass replacing ' + oldC + ' with ' + newC, 'info', 'Node');\n removeClass(node, oldC); // remove first in case oldC === newC\n addClass(node, newC);\n },\n\n /**\n * If the className exists on the node it is removed, if it doesn't exist it is added.\n * @method toggleClass \n * @for DOM\n * @param {HTMLElement} element The DOM element\n * @param {String} className the class name to be toggled\n * @param {Boolean} addClass optional boolean to indicate whether class\n * should be added or removed regardless of current state\n */\n toggleClass: function(node, className, force) {\n var add = (force !== undefined) ? force :\n !(hasClass(node, className));\n\n if (add) {\n addClass(node, className);\n } else {\n removeClass(node, className);\n }\n }\n});\n\nhasClass = Y.DOM.hasClass;\nremoveClass = Y.DOM.removeClass;\naddClass = Y.DOM.addClass;\n\nvar re_tag = /<([a-z]+)/i,\n\n Y_DOM = Y.DOM,\n\n addFeature = Y.Features.add,\n testFeature = Y.Features.test,\n\n creators = {},\n\n createFromDIV = function(html, tag) {\n var div = Y.config.doc.createElement('div'),\n ret = true;\n\n div.innerHTML = html;\n if (!div.firstChild || div.firstChild.tagName !== tag.toUpperCase()) {\n ret = false;\n }\n\n return ret;\n },\n\n re_tbody = /(?:\\/(?:thead|tfoot|tbody|caption|col|colgroup)>)+\\s*<tbody/,\n\n TABLE_OPEN = '<table>',\n TABLE_CLOSE = '</table>';\n\nY.mix(Y.DOM, {\n _fragClones: {},\n\n _create: function(html, doc, tag) {\n tag = tag || 'div';\n\n var frag = Y_DOM._fragClones[tag];\n if (frag) {\n frag = frag.cloneNode(false);\n } else {\n frag = Y_DOM._fragClones[tag] = doc.createElement(tag);\n }\n frag.innerHTML = html;\n return frag;\n },\n\n _children: function(node, tag) {\n var i = 0,\n children = node.children,\n childNodes,\n hasComments,\n child;\n\n if (children && children.tags) { // use tags filter when possible\n if (tag) {\n children = node.children.tags(tag);\n } else { // IE leaks comments into children\n hasComments = children.tags('!').length;\n }\n }\n \n if (!children || (!children.tags && tag) || hasComments) {\n childNodes = children || node.childNodes;\n children = [];\n while ((child = childNodes[i++])) {\n if (child.nodeType === 1) {\n if (!tag || tag === child.tagName) {\n children.push(child);\n }\n }\n }\n }\n\n return children || [];\n },\n\n /**\n * Creates a new dom node using the provided markup string. \n * @method create\n * @param {String} html The markup used to create the element\n * @param {HTMLDocument} doc An optional document context \n * @return {HTMLElement|DocumentFragment} returns a single HTMLElement \n * when creating one node, and a documentFragment when creating\n * multiple nodes.\n */\n create: function(html, doc) {\n if (typeof html === 'string') {\n html = Y.Lang.trim(html); // match IE which trims whitespace from innerHTML\n\n }\n\n doc = doc || Y.config.doc;\n var m = re_tag.exec(html),\n create = Y_DOM._create,\n custom = creators,\n ret = null,\n creator,\n tag, nodes;\n\n if (html != undefined) { // not undefined or null\n if (m && m[1]) {\n creator = custom[m[1].toLowerCase()];\n if (typeof creator === 'function') {\n create = creator; \n } else {\n tag = creator;\n }\n }\n\n nodes = create(html, doc, tag).childNodes;\n\n if (nodes.length === 1) { // return single node, breaking parentNode ref from \"fragment\"\n ret = nodes[0].parentNode.removeChild(nodes[0]);\n } else if (nodes[0] && nodes[0].className === 'yui3-big-dummy') { // using dummy node to preserve some attributes (e.g. OPTION not selected)\n if (nodes.length === 2) {\n ret = nodes[0].nextSibling;\n } else {\n nodes[0].parentNode.removeChild(nodes[0]); \n ret = Y_DOM._nl2frag(nodes, doc);\n }\n } else { // return multiple nodes as a fragment\n ret = Y_DOM._nl2frag(nodes, doc);\n }\n\n }\n\n return ret;\n },\n\n _nl2frag: function(nodes, doc) {\n var ret = null,\n i, len;\n\n if (nodes && (nodes.push || nodes.item) && nodes[0]) {\n doc = doc || nodes[0].ownerDocument; \n ret = doc.createDocumentFragment();\n\n if (nodes.item) { // convert live list to static array\n nodes = Y.Array(nodes, 0, true);\n }\n\n for (i = 0, len = nodes.length; i < len; i++) {\n ret.appendChild(nodes[i]); \n }\n } // else inline with log for minification\n return ret;\n },\n\n /**\n * Inserts content in a node at the given location \n * @method addHTML\n * @param {HTMLElement} node The node to insert into\n * @param {HTMLElement | Array | HTMLCollection} content The content to be inserted \n * @param {HTMLElement} where Where to insert the content\n * If no \"where\" is given, content is appended to the node\n * Possible values for \"where\"\n * <dl>\n * <dt>HTMLElement</dt>\n * <dd>The element to insert before</dd>\n * <dt>\"replace\"</dt>\n * <dd>Replaces the existing HTML</dd>\n * <dt>\"before\"</dt>\n * <dd>Inserts before the existing HTML</dd>\n * <dt>\"before\"</dt>\n * <dd>Inserts content before the node</dd>\n * <dt>\"after\"</dt>\n * <dd>Inserts content after the node</dd>\n * </dl>\n */\n addHTML: function(node, content, where) {\n var nodeParent = node.parentNode,\n i = 0,\n item,\n ret = content,\n newNode;\n \n\n if (content != undefined) { // not null or undefined (maybe 0)\n if (content.nodeType) { // DOM node, just add it\n newNode = content;\n } else if (typeof content == 'string' || typeof content == 'number') {\n ret = newNode = Y_DOM.create(content);\n } else if (content[0] && content[0].nodeType) { // array or collection \n newNode = Y.config.doc.createDocumentFragment();\n while ((item = content[i++])) {\n newNode.appendChild(item); // append to fragment for insertion\n }\n }\n }\n\n if (where) {\n if (newNode && where.parentNode) { // insert regardless of relationship to node\n where.parentNode.insertBefore(newNode, where);\n } else {\n switch (where) {\n case 'replace':\n while (node.firstChild) {\n node.removeChild(node.firstChild);\n }\n if (newNode) { // allow empty content to clear node\n node.appendChild(newNode);\n }\n break;\n case 'before':\n if (newNode) {\n nodeParent.insertBefore(newNode, node);\n }\n break;\n case 'after':\n if (newNode) {\n if (node.nextSibling) { // IE errors if refNode is null\n nodeParent.insertBefore(newNode, node.nextSibling);\n } else {\n nodeParent.appendChild(newNode);\n }\n }\n break;\n default:\n if (newNode) {\n node.appendChild(newNode);\n }\n }\n }\n } else if (newNode) {\n node.appendChild(newNode);\n }\n\n return ret;\n },\n\n wrap: function(node, html) {\n var parent = (html && html.nodeType) ? html : Y.DOM.create(html),\n nodes = parent.getElementsByTagName('*');\n\n if (nodes.length) {\n parent = nodes[nodes.length - 1];\n }\n\n if (node.parentNode) { \n node.parentNode.replaceChild(parent, node);\n }\n parent.appendChild(node);\n },\n\n unwrap: function(node) {\n var parent = node.parentNode,\n lastChild = parent.lastChild,\n next = node,\n grandparent;\n\n if (parent) {\n grandparent = parent.parentNode;\n if (grandparent) {\n node = parent.firstChild;\n while (node !== lastChild) {\n next = node.nextSibling;\n grandparent.insertBefore(node, parent);\n node = next;\n }\n grandparent.replaceChild(lastChild, parent);\n } else {\n parent.removeChild(node);\n }\n }\n }\n});\n\naddFeature('innerhtml', 'table', {\n test: function() {\n var node = Y.config.doc.createElement('table');\n try {\n node.innerHTML = '<tbody></tbody>';\n } catch(e) {\n return false;\n }\n return (node.firstChild && node.firstChild.nodeName === 'TBODY');\n }\n});\n\naddFeature('innerhtml-div', 'tr', {\n test: function() {\n return createFromDIV('<tr></tr>', 'tr');\n }\n});\n\naddFeature('innerhtml-div', 'script', {\n test: function() {\n return createFromDIV('<script></script>', 'script');\n }\n});\n\nif (!testFeature('innerhtml', 'table')) {\n // TODO: thead/tfoot with nested tbody\n // IE adds TBODY when creating TABLE elements (which may share this impl)\n creators.tbody = function(html, doc) {\n var frag = Y_DOM.create(TABLE_OPEN + html + TABLE_CLOSE, doc),\n tb = Y.DOM._children(frag, 'tbody')[0];\n\n if (frag.children.length > 1 && tb && !re_tbody.test(html)) {\n tb.parentNode.removeChild(tb); // strip extraneous tbody\n }\n return frag;\n };\n}\n\nif (!testFeature('innerhtml-div', 'script')) {\n creators.script = function(html, doc) {\n var frag = doc.createElement('div');\n\n frag.innerHTML = '-' + html;\n frag.removeChild(frag.firstChild);\n return frag;\n };\n\n creators.link = creators.style = creators.script;\n}\n\nif (!testFeature('innerhtml-div', 'tr')) {\n Y.mix(creators, {\n option: function(html, doc) {\n return Y_DOM.create('<select><option class=\"yui3-big-dummy\" selected></option>' + html + '</select>', doc);\n },\n\n tr: function(html, doc) {\n return Y_DOM.create('<tbody>' + html + '</tbody>', doc);\n },\n\n td: function(html, doc) {\n return Y_DOM.create('<tr>' + html + '</tr>', doc);\n }, \n\n col: function(html, doc) {\n return Y_DOM.create('<colgroup>' + html + '</colgroup>', doc);\n }, \n\n tbody: 'table'\n });\n\n Y.mix(creators, {\n legend: 'fieldset',\n th: creators.td,\n thead: creators.tbody,\n tfoot: creators.tbody,\n caption: creators.tbody,\n colgroup: creators.tbody,\n optgroup: creators.option\n });\n}\n\nY_DOM.creators = creators;\nY.mix(Y.DOM, {\n /**\n * Sets the width of the element to the given size, regardless\n * of box model, border, padding, etc.\n * @method setWidth\n * @param {HTMLElement} element The DOM element. \n * @param {String|Number} size The pixel height to size to\n */\n\n setWidth: function(node, size) {\n Y.DOM._setSize(node, 'width', size);\n },\n\n /**\n * Sets the height of the element to the given size, regardless\n * of box model, border, padding, etc.\n * @method setHeight\n * @param {HTMLElement} element The DOM element. \n * @param {String|Number} size The pixel height to size to\n */\n\n setHeight: function(node, size) {\n Y.DOM._setSize(node, 'height', size);\n },\n\n _setSize: function(node, prop, val) {\n val = (val > 0) ? val : 0;\n var size = 0;\n\n node.style[prop] = val + 'px';\n size = (prop === 'height') ? node.offsetHeight : node.offsetWidth;\n\n if (size > val) {\n val = val - (size - val);\n\n if (val < 0) {\n val = 0;\n }\n\n node.style[prop] = val + 'px';\n }\n }\n});\n\n\n}, '@VERSION@', {\"requires\": [\"dom-core\"]});\nYUI.add('dom-style', function (Y, NAME) {\n\n(function(Y) {\n/** \n * Add style management functionality to DOM.\n * @module dom\n * @submodule dom-style\n * @for DOM\n */\n\nvar DOCUMENT_ELEMENT = 'documentElement',\n DEFAULT_VIEW = 'defaultView',\n OWNER_DOCUMENT = 'ownerDocument',\n STYLE = 'style',\n FLOAT = 'float',\n CSS_FLOAT = 'cssFloat',\n STYLE_FLOAT = 'styleFloat',\n TRANSPARENT = 'transparent',\n GET_COMPUTED_STYLE = 'getComputedStyle',\n GET_BOUNDING_CLIENT_RECT = 'getBoundingClientRect',\n\n WINDOW = Y.config.win,\n DOCUMENT = Y.config.doc,\n UNDEFINED = undefined,\n\n Y_DOM = Y.DOM,\n\n TRANSFORM = 'transform',\n TRANSFORMORIGIN = 'transformOrigin',\n VENDOR_TRANSFORM = [\n 'WebkitTransform',\n 'MozTransform',\n 'OTransform',\n 'msTransform'\n ],\n\n re_color = /color$/i,\n re_unit = /width|height|top|left|right|bottom|margin|padding/i;\n\nY.Array.each(VENDOR_TRANSFORM, function(val) {\n if (val in DOCUMENT[DOCUMENT_ELEMENT].style) {\n TRANSFORM = val;\n TRANSFORMORIGIN = val + \"Origin\";\n }\n});\n\nY.mix(Y_DOM, {\n DEFAULT_UNIT: 'px',\n\n CUSTOM_STYLES: {\n },\n\n\n /**\n * Sets a style property for a given element.\n * @method setStyle\n * @param {HTMLElement} An HTMLElement to apply the style to.\n * @param {String} att The style property to set. \n * @param {String|Number} val The value. \n */\n setStyle: function(node, att, val, style) {\n style = style || node.style;\n var CUSTOM_STYLES = Y_DOM.CUSTOM_STYLES;\n\n if (style) {\n if (val === null || val === '') { // normalize unsetting\n val = '';\n } else if (!isNaN(new Number(val)) && re_unit.test(att)) { // number values may need a unit\n val += Y_DOM.DEFAULT_UNIT;\n }\n\n if (att in CUSTOM_STYLES) {\n if (CUSTOM_STYLES[att].set) {\n CUSTOM_STYLES[att].set(node, val, style);\n return; // NOTE: return\n } else if (typeof CUSTOM_STYLES[att] === 'string') {\n att = CUSTOM_STYLES[att];\n }\n } else if (att === '') { // unset inline styles\n att = 'cssText';\n val = '';\n }\n style[att] = val; \n }\n },\n\n /**\n * Returns the current style value for the given property.\n * @method getStyle\n * @param {HTMLElement} An HTMLElement to get the style from.\n * @param {String} att The style property to get. \n */\n getStyle: function(node, att, style) {\n style = style || node.style;\n var CUSTOM_STYLES = Y_DOM.CUSTOM_STYLES,\n val = '';\n\n if (style) {\n if (att in CUSTOM_STYLES) {\n if (CUSTOM_STYLES[att].get) {\n return CUSTOM_STYLES[att].get(node, att, style); // NOTE: return\n } else if (typeof CUSTOM_STYLES[att] === 'string') {\n att = CUSTOM_STYLES[att];\n }\n }\n val = style[att];\n if (val === '') { // TODO: is empty string sufficient?\n val = Y_DOM[GET_COMPUTED_STYLE](node, att);\n }\n }\n\n return val;\n },\n\n /**\n * Sets multiple style properties.\n * @method setStyles\n * @param {HTMLElement} node An HTMLElement to apply the styles to. \n * @param {Object} hash An object literal of property:value pairs. \n */\n setStyles: function(node, hash) {\n var style = node.style;\n Y.each(hash, function(v, n) {\n Y_DOM.setStyle(node, n, v, style);\n }, Y_DOM);\n },\n\n /**\n * Returns the computed style for the given node.\n * @method getComputedStyle\n * @param {HTMLElement} An HTMLElement to get the style from.\n * @param {String} att The style property to get. \n * @return {String} The computed value of the style property. \n */\n getComputedStyle: function(node, att) {\n var val = '',\n doc = node[OWNER_DOCUMENT],\n computed;\n\n if (node[STYLE] && doc[DEFAULT_VIEW] && doc[DEFAULT_VIEW][GET_COMPUTED_STYLE]) {\n computed = doc[DEFAULT_VIEW][GET_COMPUTED_STYLE](node, null);\n if (computed) { // FF may be null in some cases (ticket #2530548)\n val = computed[att];\n }\n }\n return val;\n }\n});\n\n// normalize reserved word float alternatives (\"cssFloat\" or \"styleFloat\")\nif (DOCUMENT[DOCUMENT_ELEMENT][STYLE][CSS_FLOAT] !== UNDEFINED) {\n Y_DOM.CUSTOM_STYLES[FLOAT] = CSS_FLOAT;\n} else if (DOCUMENT[DOCUMENT_ELEMENT][STYLE][STYLE_FLOAT] !== UNDEFINED) {\n Y_DOM.CUSTOM_STYLES[FLOAT] = STYLE_FLOAT;\n}\n\n// fix opera computedStyle default color unit (convert to rgb)\nif (Y.UA.opera) {\n Y_DOM[GET_COMPUTED_STYLE] = function(node, att) {\n var view = node[OWNER_DOCUMENT][DEFAULT_VIEW],\n val = view[GET_COMPUTED_STYLE](node, '')[att];\n\n if (re_color.test(att)) {\n val = Y.Color.toRGB(val);\n }\n\n return val;\n };\n\n}\n\n// safari converts transparent to rgba(), others use \"transparent\"\nif (Y.UA.webkit) {\n Y_DOM[GET_COMPUTED_STYLE] = function(node, att) {\n var view = node[OWNER_DOCUMENT][DEFAULT_VIEW],\n val = view[GET_COMPUTED_STYLE](node, '')[att];\n\n if (val === 'rgba(0, 0, 0, 0)') {\n val = TRANSPARENT; \n }\n\n return val;\n };\n\n}\n\nY.DOM._getAttrOffset = function(node, attr) {\n var val = Y.DOM[GET_COMPUTED_STYLE](node, attr),\n offsetParent = node.offsetParent,\n position,\n parentOffset,\n offset;\n\n if (val === 'auto') {\n position = Y.DOM.getStyle(node, 'position');\n if (position === 'static' || position === 'relative') {\n val = 0; \n } else if (offsetParent && offsetParent[GET_BOUNDING_CLIENT_RECT]) {\n parentOffset = offsetParent[GET_BOUNDING_CLIENT_RECT]()[attr];\n offset = node[GET_BOUNDING_CLIENT_RECT]()[attr];\n if (attr === 'left' || attr === 'top') {\n val = offset - parentOffset;\n } else {\n val = parentOffset - node[GET_BOUNDING_CLIENT_RECT]()[attr];\n }\n }\n }\n\n return val;\n};\n\nY.DOM._getOffset = function(node) {\n var pos,\n xy = null;\n\n if (node) {\n pos = Y_DOM.getStyle(node, 'position');\n xy = [\n parseInt(Y_DOM[GET_COMPUTED_STYLE](node, 'left'), 10),\n parseInt(Y_DOM[GET_COMPUTED_STYLE](node, 'top'), 10)\n ];\n\n if ( isNaN(xy[0]) ) { // in case of 'auto'\n xy[0] = parseInt(Y_DOM.getStyle(node, 'left'), 10); // try inline\n if ( isNaN(xy[0]) ) { // default to offset value\n xy[0] = (pos === 'relative') ? 0 : node.offsetLeft || 0;\n }\n } \n\n if ( isNaN(xy[1]) ) { // in case of 'auto'\n xy[1] = parseInt(Y_DOM.getStyle(node, 'top'), 10); // try inline\n if ( isNaN(xy[1]) ) { // default to offset value\n xy[1] = (pos === 'relative') ? 0 : node.offsetTop || 0;\n }\n } \n }\n\n return xy;\n\n};\n\nY_DOM.CUSTOM_STYLES.transform = {\n set: function(node, val, style) {\n style[TRANSFORM] = val;\n },\n\n get: function(node, style) {\n return Y_DOM[GET_COMPUTED_STYLE](node, TRANSFORM);\n }\n};\n\nY_DOM.CUSTOM_STYLES.transformOrigin = {\n set: function(node, val, style) {\n style[TRANSFORMORIGIN] = val;\n },\n\n get: function(node, style) {\n return Y_DOM[GET_COMPUTED_STYLE](node, TRANSFORMORIGIN);\n }\n};\n\n\n})(Y);\n(function(Y) {\nvar PARSE_INT = parseInt,\n RE = RegExp;\n\nY.Color = {\n KEYWORDS: {\n black: '000',\n silver: 'c0c0c0',\n gray: '808080',\n white: 'fff',\n maroon: '800000',\n red: 'f00',\n purple: '800080',\n fuchsia: 'f0f',\n green: '008000',\n lime: '0f0',\n olive: '808000',\n yellow: 'ff0',\n navy: '000080',\n blue: '00f',\n teal: '008080',\n aqua: '0ff'\n },\n\n re_RGB: /^rgb\\(([0-9]+)\\s*,\\s*([0-9]+)\\s*,\\s*([0-9]+)\\)$/i,\n re_hex: /^#?([0-9A-F]{2})([0-9A-F]{2})([0-9A-F]{2})$/i,\n re_hex3: /([0-9A-F])/gi,\n\n toRGB: function(val) {\n if (!Y.Color.re_RGB.test(val)) {\n val = Y.Color.toHex(val);\n }\n\n if(Y.Color.re_hex.exec(val)) {\n val = 'rgb(' + [\n PARSE_INT(RE.$1, 16),\n PARSE_INT(RE.$2, 16),\n PARSE_INT(RE.$3, 16)\n ].join(', ') + ')';\n }\n return val;\n },\n\n toHex: function(val) {\n val = Y.Color.KEYWORDS[val] || val;\n if (Y.Color.re_RGB.exec(val)) {\n val = [\n Number(RE.$1).toString(16),\n Number(RE.$2).toString(16),\n Number(RE.$3).toString(16)\n ];\n\n for (var i = 0; i < val.length; i++) {\n if (val[i].length < 2) {\n val[i] = '0' + val[i];\n }\n }\n\n val = val.join('');\n }\n\n if (val.length < 6) {\n val = val.replace(Y.Color.re_hex3, '$1$1');\n }\n\n if (val !== 'transparent' && val.indexOf('#') < 0) {\n val = '#' + val;\n }\n\n return val.toUpperCase();\n }\n};\n})(Y);\n\n\n\n}, '@VERSION@', {\"requires\": [\"dom-base\"]});\nYUI.add('dom-style-ie', function (Y, NAME) {\n\n(function(Y) {\nvar HAS_LAYOUT = 'hasLayout',\n PX = 'px',\n FILTER = 'filter',\n FILTERS = 'filters',\n OPACITY = 'opacity',\n AUTO = 'auto',\n\n BORDER_WIDTH = 'borderWidth',\n BORDER_TOP_WIDTH = 'borderTopWidth',\n BORDER_RIGHT_WIDTH = 'borderRightWidth',\n BORDER_BOTTOM_WIDTH = 'borderBottomWidth',\n BORDER_LEFT_WIDTH = 'borderLeftWidth',\n WIDTH = 'width',\n HEIGHT = 'height',\n TRANSPARENT = 'transparent',\n VISIBLE = 'visible',\n GET_COMPUTED_STYLE = 'getComputedStyle',\n UNDEFINED = undefined,\n documentElement = Y.config.doc.documentElement,\n\n testFeature = Y.Features.test,\n addFeature = Y.Features.add,\n\n // TODO: unit-less lineHeight (e.g. 1.22)\n re_unit = /^(\\d[.\\d]*)+(em|ex|px|gd|rem|vw|vh|vm|ch|mm|cm|in|pt|pc|deg|rad|ms|s|hz|khz|%){1}?/i,\n\n isIE8 = (Y.UA.ie >= 8),\n\n _getStyleObj = function(node) {\n return node.currentStyle || node.style;\n },\n\n ComputedStyle = {\n CUSTOM_STYLES: {},\n\n get: function(el, property) {\n var value = '',\n current;\n\n if (el) {\n current = _getStyleObj(el)[property];\n\n if (property === OPACITY && Y.DOM.CUSTOM_STYLES[OPACITY]) {\n value = Y.DOM.CUSTOM_STYLES[OPACITY].get(el); \n } else if (!current || (current.indexOf && current.indexOf(PX) > -1)) { // no need to convert\n value = current;\n } else if (Y.DOM.IE.COMPUTED[property]) { // use compute function\n value = Y.DOM.IE.COMPUTED[property](el, property);\n } else if (re_unit.test(current)) { // convert to pixel\n value = ComputedStyle.getPixel(el, property) + PX;\n } else {\n value = current;\n }\n }\n\n return value;\n },\n\n sizeOffsets: {\n width: ['Left', 'Right'],\n height: ['Top', 'Bottom'],\n top: ['Top'],\n bottom: ['Bottom']\n },\n\n getOffset: function(el, prop) {\n var current = _getStyleObj(el)[prop], // value of \"width\", \"top\", etc.\n capped = prop.charAt(0).toUpperCase() + prop.substr(1), // \"Width\", \"Top\", etc.\n offset = 'offset' + capped, // \"offsetWidth\", \"offsetTop\", etc.\n pixel = 'pixel' + capped, // \"pixelWidth\", \"pixelTop\", etc.\n sizeOffsets = ComputedStyle.sizeOffsets[prop], \n mode = el.ownerDocument.compatMode,\n value = '';\n\n // IE pixelWidth incorrect for percent\n // manually compute by subtracting padding and border from offset size\n // NOTE: clientWidth/Height (size minus border) is 0 when current === AUTO so offsetHeight is used\n // reverting to auto from auto causes position stacking issues (old impl)\n if (current === AUTO || current.indexOf('%') > -1) {\n value = el['offset' + capped];\n\n if (mode !== 'BackCompat') {\n if (sizeOffsets[0]) {\n value -= ComputedStyle.getPixel(el, 'padding' + sizeOffsets[0]);\n value -= ComputedStyle.getBorderWidth(el, 'border' + sizeOffsets[0] + 'Width', 1);\n }\n\n if (sizeOffsets[1]) {\n value -= ComputedStyle.getPixel(el, 'padding' + sizeOffsets[1]);\n value -= ComputedStyle.getBorderWidth(el, 'border' + sizeOffsets[1] + 'Width', 1);\n }\n }\n\n } else { // use style.pixelWidth, etc. to convert to pixels\n // need to map style.width to currentStyle (no currentStyle.pixelWidth)\n if (!el.style[pixel] && !el.style[prop]) {\n el.style[prop] = current;\n }\n value = el.style[pixel];\n \n }\n return value + PX;\n },\n\n borderMap: {\n thin: (isIE8) ? '1px' : '2px',\n medium: (isIE8) ? '3px': '4px', \n thick: (isIE8) ? '5px' : '6px'\n },\n\n getBorderWidth: function(el, property, omitUnit) {\n var unit = omitUnit ? '' : PX,\n current = el.currentStyle[property];\n\n if (current.indexOf(PX) < 0) { // look up keywords if a border exists\n if (ComputedStyle.borderMap[current] &&\n el.currentStyle.borderStyle !== 'none') {\n current = ComputedStyle.borderMap[current];\n } else { // otherwise no border (default is \"medium\")\n current = 0;\n }\n }\n return (omitUnit) ? parseFloat(current) : current;\n },\n\n getPixel: function(node, att) {\n // use pixelRight to convert to px\n var val = null,\n style = _getStyleObj(node),\n styleRight = style.right,\n current = style[att];\n\n node.style.right = current;\n val = node.style.pixelRight;\n node.style.right = styleRight; // revert\n\n return val;\n },\n\n getMargin: function(node, att) {\n var val,\n style = _getStyleObj(node);\n\n if (style[att] == AUTO) {\n val = 0;\n } else {\n val = ComputedStyle.getPixel(node, att);\n }\n return val + PX;\n },\n\n getVisibility: function(node, att) {\n var current;\n while ( (current = node.currentStyle) && current[att] == 'inherit') { // NOTE: assignment in test\n node = node.parentNode;\n }\n return (current) ? current[att] : VISIBLE;\n },\n\n getColor: function(node, att) {\n var current = _getStyleObj(node)[att];\n\n if (!current || current === TRANSPARENT) {\n Y.DOM.elementByAxis(node, 'parentNode', null, function(parent) {\n current = _getStyleObj(parent)[att];\n if (current && current !== TRANSPARENT) {\n node = parent;\n return true;\n }\n });\n }\n\n return Y.Color.toRGB(current);\n },\n\n getBorderColor: function(node, att) {\n var current = _getStyleObj(node),\n val = current[att] || current.color;\n return Y.Color.toRGB(Y.Color.toHex(val));\n }\n },\n\n //fontSize: getPixelFont,\n IEComputed = {};\n\naddFeature('style', 'computedStyle', {\n test: function() {\n return 'getComputedStyle' in Y.config.win;\n }\n});\n\naddFeature('style', 'opacity', {\n test: function() {\n return 'opacity' in documentElement.style;\n }\n});\n\naddFeature('style', 'filter', {\n test: function() {\n return 'filters' in documentElement;\n }\n});\n\n// use alpha filter for IE opacity\nif (!testFeature('style', 'opacity') && testFeature('style', 'filter')) {\n Y.DOM.CUSTOM_STYLES[OPACITY] = {\n get: function(node) {\n var val = 100;\n try { // will error if no DXImageTransform\n val = node[FILTERS]['DXImageTransform.Microsoft.Alpha'][OPACITY];\n\n } catch(e) {\n try { // make sure its in the document\n val = node[FILTERS]('alpha')[OPACITY];\n } catch(err) {\n Y.log('getStyle: IE opacity filter not found; returning 1', 'warn', 'dom-style');\n }\n }\n return val / 100;\n },\n\n set: function(node, val, style) {\n var current,\n styleObj = _getStyleObj(node),\n currentFilter = styleObj[FILTER];\n\n style = style || node.style;\n if (val === '') { // normalize inline style behavior\n current = (OPACITY in styleObj) ? styleObj[OPACITY] : 1; // revert to original opacity\n val = current;\n }\n\n if (typeof currentFilter == 'string') { // in case not appended\n style[FILTER] = currentFilter.replace(/alpha([^)]*\\))/gi, '') +\n ((val < 1) ? 'alpha(' + OPACITY + '=' + val * 100 + ')' : '');\n\n if (!style[FILTER]) {\n style.removeAttribute(FILTER);\n }\n\n if (!styleObj[HAS_LAYOUT]) {\n style.zoom = 1; // needs layout \n }\n }\n }\n };\n}\n\ntry {\n Y.config.doc.createElement('div').style.height = '-1px';\n} catch(e) { // IE throws error on invalid style set; trap common cases\n Y.DOM.CUSTOM_STYLES.height = {\n set: function(node, val, style) {\n var floatVal = parseFloat(val);\n if (floatVal >= 0 || val === 'auto' || val === '') {\n style.height = val;\n } else {\n Y.log('invalid style value for height: ' + val, 'warn', 'dom-style');\n }\n }\n };\n\n Y.DOM.CUSTOM_STYLES.width = {\n set: function(node, val, style) {\n var floatVal = parseFloat(val);\n if (floatVal >= 0 || val === 'auto' || val === '') {\n style.width = val;\n } else {\n Y.log('invalid style value for width: ' + val, 'warn', 'dom-style');\n }\n }\n };\n}\n\nif (!testFeature('style', 'computedStyle')) {\n // TODO: top, right, bottom, left\n IEComputed[WIDTH] = IEComputed[HEIGHT] = ComputedStyle.getOffset;\n\n IEComputed.color = IEComputed.backgroundColor = ComputedStyle.getColor;\n\n IEComputed[BORDER_WIDTH] = IEComputed[BORDER_TOP_WIDTH] = IEComputed[BORDER_RIGHT_WIDTH] =\n IEComputed[BORDER_BOTTOM_WIDTH] = IEComputed[BORDER_LEFT_WIDTH] =\n ComputedStyle.getBorderWidth;\n\n IEComputed.marginTop = IEComputed.marginRight = IEComputed.marginBottom =\n IEComputed.marginLeft = ComputedStyle.getMargin;\n\n IEComputed.visibility = ComputedStyle.getVisibility;\n IEComputed.borderColor = IEComputed.borderTopColor =\n IEComputed.borderRightColor = IEComputed.borderBottomColor =\n IEComputed.borderLeftColor = ComputedStyle.getBorderColor;\n\n Y.DOM[GET_COMPUTED_STYLE] = ComputedStyle.get; \n\n Y.namespace('DOM.IE');\n Y.DOM.IE.COMPUTED = IEComputed;\n Y.DOM.IE.ComputedStyle = ComputedStyle;\n}\n\n})(Y);\n\n\n}, '@VERSION@', {\"requires\": [\"dom-style\"]});\nYUI.add('dom-screen', function (Y, NAME) {\n\n(function(Y) {\n\n/**\n * Adds position and region management functionality to DOM.\n * @module dom\n * @submodule dom-screen\n * @for DOM\n */\n\nvar DOCUMENT_ELEMENT = 'documentElement',\n COMPAT_MODE = 'compatMode',\n POSITION = 'position',\n FIXED = 'fixed',\n RELATIVE = 'relative',\n LEFT = 'left',\n TOP = 'top',\n _BACK_COMPAT = 'BackCompat',\n MEDIUM = 'medium',\n BORDER_LEFT_WIDTH = 'borderLeftWidth',\n BORDER_TOP_WIDTH = 'borderTopWidth',\n GET_BOUNDING_CLIENT_RECT = 'getBoundingClientRect',\n GET_COMPUTED_STYLE = 'getComputedStyle',\n\n Y_DOM = Y.DOM,\n\n // TODO: how about thead/tbody/tfoot/tr?\n // TODO: does caption matter?\n RE_TABLE = /^t(?:able|d|h)$/i,\n\n SCROLL_NODE;\n\nif (Y.UA.ie) {\n if (Y.config.doc[COMPAT_MODE] !== 'BackCompat') {\n SCROLL_NODE = DOCUMENT_ELEMENT; \n } else {\n SCROLL_NODE = 'body';\n }\n}\n\nY.mix(Y_DOM, {\n /**\n * Returns the inner height of the viewport (exludes scrollbar). \n * @method winHeight\n * @return {Number} The current height of the viewport.\n */\n winHeight: function(node) {\n var h = Y_DOM._getWinSize(node).height;\n Y.log('winHeight returning ' + h, 'info', 'dom-screen');\n return h;\n },\n\n /**\n * Returns the inner width of the viewport (exludes scrollbar). \n * @method winWidth\n * @return {Number} The current width of the viewport.\n */\n winWidth: function(node) {\n var w = Y_DOM._getWinSize(node).width;\n Y.log('winWidth returning ' + w, 'info', 'dom-screen');\n return w;\n },\n\n /**\n * Document height \n * @method docHeight\n * @return {Number} The current height of the document.\n */\n docHeight: function(node) {\n var h = Y_DOM._getDocSize(node).height;\n Y.log('docHeight returning ' + h, 'info', 'dom-screen');\n return Math.max(h, Y_DOM._getWinSize(node).height);\n },\n\n /**\n * Document width \n * @method docWidth\n * @return {Number} The current width of the document.\n */\n docWidth: function(node) {\n var w = Y_DOM._getDocSize(node).width;\n Y.log('docWidth returning ' + w, 'info', 'dom-screen');\n return Math.max(w, Y_DOM._getWinSize(node).width);\n },\n\n /**\n * Amount page has been scroll horizontally \n * @method docScrollX\n * @return {Number} The current amount the screen is scrolled horizontally.\n */\n docScrollX: function(node, doc) {\n doc = doc || (node) ? Y_DOM._getDoc(node) : Y.config.doc; // perf optimization\n var dv = doc.defaultView,\n pageOffset = (dv) ? dv.pageXOffset : 0;\n return Math.max(doc[DOCUMENT_ELEMENT].scrollLeft, doc.body.scrollLeft, pageOffset);\n },\n\n /**\n * Amount page has been scroll vertically \n * @method docScrollY\n * @return {Number} The current amount the screen is scrolled vertically.\n */\n docScrollY: function(node, doc) {\n doc = doc || (node) ? Y_DOM._getDoc(node) : Y.config.doc; // perf optimization\n var dv = doc.defaultView,\n pageOffset = (dv) ? dv.pageYOffset : 0;\n return Math.max(doc[DOCUMENT_ELEMENT].scrollTop, doc.body.scrollTop, pageOffset);\n },\n\n /**\n * Gets the current position of an element based on page coordinates. \n * Element must be part of the DOM tree to have page coordinates\n * (display:none or elements not appended return false).\n * @method getXY\n * @param element The target element\n * @return {Array} The XY position of the element\n\n TODO: test inDocument/display?\n */\n getXY: function() {\n if (Y.config.doc[DOCUMENT_ELEMENT][GET_BOUNDING_CLIENT_RECT]) {\n return function(node) {\n var xy = null,\n scrollLeft,\n scrollTop,\n mode,\n box,\n offX,\n offY,\n doc,\n win,\n inDoc,\n rootNode;\n\n if (node && node.tagName) {\n doc = node.ownerDocument;\n mode = doc[COMPAT_MODE];\n\n if (mode !== _BACK_COMPAT) {\n rootNode = doc[DOCUMENT_ELEMENT];\n } else {\n rootNode = doc.body;\n }\n\n // inline inDoc check for perf\n if (rootNode.contains) {\n inDoc = rootNode.contains(node); \n } else {\n inDoc = Y.DOM.contains(rootNode, node);\n }\n\n if (inDoc) {\n win = doc.defaultView;\n\n // inline scroll calc for perf\n if (win && 'pageXOffset' in win) {\n scrollLeft = win.pageXOffset;\n scrollTop = win.pageYOffset;\n } else {\n scrollLeft = (SCROLL_NODE) ? doc[SCROLL_NODE].scrollLeft : Y_DOM.docScrollX(node, doc);\n scrollTop = (SCROLL_NODE) ? doc[SCROLL_NODE].scrollTop : Y_DOM.docScrollY(node, doc);\n }\n\n if (Y.UA.ie) { // IE < 8, quirks, or compatMode\n if (!doc.documentMode || doc.documentMode < 8 || mode === _BACK_COMPAT) {\n offX = rootNode.clientLeft;\n offY = rootNode.clientTop;\n }\n }\n box = node[GET_BOUNDING_CLIENT_RECT]();\n xy = [box.left, box.top];\n\n if (offX || offY) {\n xy[0] -= offX;\n xy[1] -= offY;\n \n }\n if ((scrollTop || scrollLeft)) {\n if (!Y.UA.ios || (Y.UA.ios >= 4.2)) {\n xy[0] += scrollLeft;\n xy[1] += scrollTop;\n }\n \n }\n } else {\n xy = Y_DOM._getOffset(node); \n }\n }\n return xy; \n };\n } else {\n return function(node) { // manually calculate by crawling up offsetParents\n //Calculate the Top and Left border sizes (assumes pixels)\n var xy = null,\n doc,\n parentNode,\n bCheck,\n scrollTop,\n scrollLeft;\n\n if (node) {\n if (Y_DOM.inDoc(node)) {\n xy = [node.offsetLeft, node.offsetTop];\n doc = node.ownerDocument;\n parentNode = node;\n // TODO: refactor with !! or just falsey\n bCheck = ((Y.UA.gecko || Y.UA.webkit > 519) ? true : false);\n\n // TODO: worth refactoring for TOP/LEFT only?\n while ((parentNode = parentNode.offsetParent)) {\n xy[0] += parentNode.offsetLeft;\n xy[1] += parentNode.offsetTop;\n if (bCheck) {\n xy = Y_DOM._calcBorders(parentNode, xy);\n }\n }\n\n // account for any scrolled ancestors\n if (Y_DOM.getStyle(node, POSITION) != FIXED) {\n parentNode = node;\n\n while ((parentNode = parentNode.parentNode)) {\n scrollTop = parentNode.scrollTop;\n scrollLeft = parentNode.scrollLeft;\n\n //Firefox does something funky with borders when overflow is not visible.\n if (Y.UA.gecko && (Y_DOM.getStyle(parentNode, 'overflow') !== 'visible')) {\n xy = Y_DOM._calcBorders(parentNode, xy);\n }\n \n\n if (scrollTop || scrollLeft) {\n xy[0] -= scrollLeft;\n xy[1] -= scrollTop;\n }\n }\n xy[0] += Y_DOM.docScrollX(node, doc);\n xy[1] += Y_DOM.docScrollY(node, doc);\n\n } else {\n //Fix FIXED position -- add scrollbars\n xy[0] += Y_DOM.docScrollX(node, doc);\n xy[1] += Y_DOM.docScrollY(node, doc);\n }\n } else {\n xy = Y_DOM._getOffset(node);\n }\n }\n\n return xy; \n };\n }\n }(),// NOTE: Executing for loadtime branching\n\n /**\n Gets the width of vertical scrollbars on overflowed containers in the body\n content.\n\n @method getScrollbarWidth\n @return {Number} Pixel width of a scrollbar in the current browser\n **/\n getScrollbarWidth: Y.cached(function () {\n var doc = Y.config.doc,\n testNode = doc.createElement('div'),\n body = doc.getElementsByTagName('body')[0],\n // 0.1 because cached doesn't support falsy refetch values\n width = 0.1;\n \n if (body) {\n testNode.style.cssText = \"position:absolute;visibility:hidden;overflow:scroll;width:20px;\";\n testNode.appendChild(doc.createElement('p')).style.height = '1px';\n body.insertBefore(testNode, body.firstChild);\n width = testNode.offsetWidth - testNode.clientWidth;\n\n body.removeChild(testNode);\n }\n\n return width;\n }, null, 0.1),\n\n /**\n * Gets the current X position of an element based on page coordinates. \n * Element must be part of the DOM tree to have page coordinates\n * (display:none or elements not appended return false).\n * @method getX\n * @param element The target element\n * @return {Number} The X position of the element\n */\n\n getX: function(node) {\n return Y_DOM.getXY(node)[0];\n },\n\n /**\n * Gets the current Y position of an element based on page coordinates. \n * Element must be part of the DOM tree to have page coordinates\n * (display:none or elements not appended return false).\n * @method getY\n * @param element The target element\n * @return {Number} The Y position of the element\n */\n\n getY: function(node) {\n return Y_DOM.getXY(node)[1];\n },\n\n /**\n * Set the position of an html element in page coordinates.\n * The element must be part of the DOM tree to have page coordinates (display:none or elements not appended return false).\n * @method setXY\n * @param element The target element\n * @param {Array} xy Contains X & Y values for new position (coordinates are page-based)\n * @param {Boolean} noRetry By default we try and set the position a second time if the first fails\n */\n setXY: function(node, xy, noRetry) {\n var setStyle = Y_DOM.setStyle,\n pos,\n delta,\n newXY,\n currentXY;\n\n if (node && xy) {\n pos = Y_DOM.getStyle(node, POSITION);\n\n delta = Y_DOM._getOffset(node); \n if (pos == 'static') { // default to relative\n pos = RELATIVE;\n setStyle(node, POSITION, pos);\n }\n currentXY = Y_DOM.getXY(node);\n\n if (xy[0] !== null) {\n setStyle(node, LEFT, xy[0] - currentXY[0] + delta[0] + 'px');\n }\n\n if (xy[1] !== null) {\n setStyle(node, TOP, xy[1] - currentXY[1] + delta[1] + 'px');\n }\n\n if (!noRetry) {\n newXY = Y_DOM.getXY(node);\n if (newXY[0] !== xy[0] || newXY[1] !== xy[1]) {\n Y_DOM.setXY(node, xy, true); \n }\n }\n \n Y.log('setXY setting position to ' + xy, 'info', 'dom-screen');\n } else {\n Y.log('setXY failed to set ' + node + ' to ' + xy, 'info', 'dom-screen');\n }\n },\n\n /**\n * Set the X position of an html element in page coordinates, regardless of how the element is positioned.\n * The element(s) must be part of the DOM tree to have page coordinates (display:none or elements not appended return false).\n * @method setX\n * @param element The target element\n * @param {Number} x The X values for new position (coordinates are page-based)\n */\n setX: function(node, x) {\n return Y_DOM.setXY(node, [x, null]);\n },\n\n /**\n * Set the Y position of an html element in page coordinates, regardless of how the element is positioned.\n * The element(s) must be part of the DOM tree to have page coordinates (display:none or elements not appended return false).\n * @method setY\n * @param element The target element\n * @param {Number} y The Y values for new position (coordinates are page-based)\n */\n setY: function(node, y) {\n return Y_DOM.setXY(node, [null, y]);\n },\n\n /**\n * @method swapXY\n * @description Swap the xy position with another node\n * @param {Node} node The node to swap with\n * @param {Node} otherNode The other node to swap with\n * @return {Node}\n */\n swapXY: function(node, otherNode) {\n var xy = Y_DOM.getXY(node);\n Y_DOM.setXY(node, Y_DOM.getXY(otherNode));\n Y_DOM.setXY(otherNode, xy);\n },\n\n _calcBorders: function(node, xy2) {\n var t = parseInt(Y_DOM[GET_COMPUTED_STYLE](node, BORDER_TOP_WIDTH), 10) || 0,\n l = parseInt(Y_DOM[GET_COMPUTED_STYLE](node, BORDER_LEFT_WIDTH), 10) || 0;\n if (Y.UA.gecko) {\n if (RE_TABLE.test(node.tagName)) {\n t = 0;\n l = 0;\n }\n }\n xy2[0] += l;\n xy2[1] += t;\n return xy2;\n },\n\n _getWinSize: function(node, doc) {\n doc = doc || (node) ? Y_DOM._getDoc(node) : Y.config.doc;\n var win = doc.defaultView || doc.parentWindow,\n mode = doc[COMPAT_MODE],\n h = win.innerHeight,\n w = win.innerWidth,\n root = doc[DOCUMENT_ELEMENT];\n\n if ( mode && !Y.UA.opera ) { // IE, Gecko\n if (mode != 'CSS1Compat') { // Quirks\n root = doc.body; \n }\n h = root.clientHeight;\n w = root.clientWidth;\n }\n return { height: h, width: w };\n },\n\n _getDocSize: function(node) {\n var doc = (node) ? Y_DOM._getDoc(node) : Y.config.doc,\n root = doc[DOCUMENT_ELEMENT];\n\n if (doc[COMPAT_MODE] != 'CSS1Compat') {\n root = doc.body;\n }\n\n return { height: root.scrollHeight, width: root.scrollWidth };\n }\n});\n\n})(Y);\n(function(Y) {\nvar TOP = 'top',\n RIGHT = 'right',\n BOTTOM = 'bottom',\n LEFT = 'left',\n\n getOffsets = function(r1, r2) {\n var t = Math.max(r1[TOP], r2[TOP]),\n r = Math.min(r1[RIGHT], r2[RIGHT]),\n b = Math.min(r1[BOTTOM], r2[BOTTOM]),\n l = Math.max(r1[LEFT], r2[LEFT]),\n ret = {};\n \n ret[TOP] = t;\n ret[RIGHT] = r;\n ret[BOTTOM] = b;\n ret[LEFT] = l;\n return ret;\n },\n\n DOM = Y.DOM;\n\nY.mix(DOM, {\n /**\n * Returns an Object literal containing the following about this element: (top, right, bottom, left)\n * @for DOM\n * @method region\n * @param {HTMLElement} element The DOM element. \n * @return {Object} Object literal containing the following about this element: (top, right, bottom, left)\n */\n region: function(node) {\n var xy = DOM.getXY(node),\n ret = false;\n \n if (node && xy) {\n ret = DOM._getRegion(\n xy[1], // top\n xy[0] + node.offsetWidth, // right\n xy[1] + node.offsetHeight, // bottom\n xy[0] // left\n );\n }\n\n return ret;\n },\n\n /**\n * Find the intersect information for the passed nodes.\n * @method intersect\n * @for DOM\n * @param {HTMLElement} element The first element \n * @param {HTMLElement | Object} element2 The element or region to check the interect with\n * @param {Object} altRegion An object literal containing the region for the first element if we already have the data (for performance e.g. DragDrop)\n * @return {Object} Object literal containing the following intersection data: (top, right, bottom, left, area, yoff, xoff, inRegion)\n */\n intersect: function(node, node2, altRegion) {\n var r = altRegion || DOM.region(node), region = {},\n n = node2,\n off;\n\n if (n.tagName) {\n region = DOM.region(n);\n } else if (Y.Lang.isObject(node2)) {\n region = node2;\n } else {\n return false;\n }\n \n off = getOffsets(region, r);\n return {\n top: off[TOP],\n right: off[RIGHT],\n bottom: off[BOTTOM],\n left: off[LEFT],\n area: ((off[BOTTOM] - off[TOP]) * (off[RIGHT] - off[LEFT])),\n yoff: ((off[BOTTOM] - off[TOP])),\n xoff: (off[RIGHT] - off[LEFT]),\n inRegion: DOM.inRegion(node, node2, false, altRegion)\n };\n \n },\n /**\n * Check if any part of this node is in the passed region\n * @method inRegion\n * @for DOM\n * @param {Object} node The node to get the region from\n * @param {Object} node2 The second node to get the region from or an Object literal of the region\n * @param {Boolean} all Should all of the node be inside the region\n * @param {Object} altRegion An object literal containing the region for this node if we already have the data (for performance e.g. DragDrop)\n * @return {Boolean} True if in region, false if not.\n */\n inRegion: function(node, node2, all, altRegion) {\n var region = {},\n r = altRegion || DOM.region(node),\n n = node2,\n off;\n\n if (n.tagName) {\n region = DOM.region(n);\n } else if (Y.Lang.isObject(node2)) {\n region = node2;\n } else {\n return false;\n }\n \n if (all) {\n return (\n r[LEFT] >= region[LEFT] &&\n r[RIGHT] <= region[RIGHT] && \n r[TOP] >= region[TOP] && \n r[BOTTOM] <= region[BOTTOM] );\n } else {\n off = getOffsets(region, r);\n if (off[BOTTOM] >= off[TOP] && off[RIGHT] >= off[LEFT]) {\n return true;\n } else {\n return false;\n }\n \n }\n },\n\n /**\n * Check if any part of this element is in the viewport\n * @method inViewportRegion\n * @for DOM\n * @param {HTMLElement} element The DOM element. \n * @param {Boolean} all Should all of the node be inside the region\n * @param {Object} altRegion An object literal containing the region for this node if we already have the data (for performance e.g. DragDrop)\n * @return {Boolean} True if in region, false if not.\n */\n inViewportRegion: function(node, all, altRegion) {\n return DOM.inRegion(node, DOM.viewportRegion(node), all, altRegion);\n \n },\n\n _getRegion: function(t, r, b, l) {\n var region = {};\n\n region[TOP] = region[1] = t;\n region[LEFT] = region[0] = l;\n region[BOTTOM] = b;\n region[RIGHT] = r;\n region.width = region[RIGHT] - region[LEFT];\n region.height = region[BOTTOM] - region[TOP];\n\n return region;\n },\n\n /**\n * Returns an Object literal containing the following about the visible region of viewport: (top, right, bottom, left)\n * @method viewportRegion\n * @for DOM\n * @return {Object} Object literal containing the following about the visible region of the viewport: (top, right, bottom, left)\n */\n viewportRegion: function(node) {\n node = node || Y.config.doc.documentElement;\n var ret = false,\n scrollX,\n scrollY;\n\n if (node) {\n scrollX = DOM.docScrollX(node);\n scrollY = DOM.docScrollY(node);\n\n ret = DOM._getRegion(scrollY, // top\n DOM.winWidth(node) + scrollX, // right\n scrollY + DOM.winHeight(node), // bottom\n scrollX); // left\n }\n\n return ret;\n }\n});\n})(Y);\n\n\n}, '@VERSION@', {\"requires\": [\"dom-base\", \"dom-style\"]});\nYUI.add('selector-native', function (Y, NAME) {\n\n(function(Y) {\n/**\n * The selector-native module provides support for native querySelector\n * @module dom\n * @submodule selector-native\n * @for Selector\n */\n\n/**\n * Provides support for using CSS selectors to query the DOM \n * @class Selector \n * @static\n * @for Selector\n */\n\nY.namespace('Selector'); // allow native module to standalone\n\nvar COMPARE_DOCUMENT_POSITION = 'compareDocumentPosition',\n OWNER_DOCUMENT = 'ownerDocument';\n\nvar Selector = {\n _types: {\n esc: {\n token: '\\uE000',\n re: /\\\\[:\\[\\]\\(\\)#\\.\\'\\>+~\"]/gi\n },\n\n attr: {\n token: '\\uE001',\n re: /(\\[[^\\]]*\\])/g\n },\n\n pseudo: {\n token: '\\uE002',\n re: /(\\([^\\)]*\\))/g\n }\n },\n\n useNative: true,\n\n _escapeId: function(id) {\n if (id) {\n id = id.replace(/([:\\[\\]\\(\\)#\\.'<>+~\"])/g,'\\\\$1');\n }\n return id;\n },\n\n _compare: ('sourceIndex' in Y.config.doc.documentElement) ?\n function(nodeA, nodeB) {\n var a = nodeA.sourceIndex,\n b = nodeB.sourceIndex;\n\n if (a === b) {\n return 0;\n } else if (a > b) {\n return 1;\n }\n\n return -1;\n\n } : (Y.config.doc.documentElement[COMPARE_DOCUMENT_POSITION] ?\n function(nodeA, nodeB) {\n if (nodeA[COMPARE_DOCUMENT_POSITION](nodeB) & 4) {\n return -1;\n } else {\n return 1;\n }\n } :\n function(nodeA, nodeB) {\n var rangeA, rangeB, compare;\n if (nodeA && nodeB) {\n rangeA = nodeA[OWNER_DOCUMENT].createRange();\n rangeA.setStart(nodeA, 0);\n rangeB = nodeB[OWNER_DOCUMENT].createRange();\n rangeB.setStart(nodeB, 0);\n compare = rangeA.compareBoundaryPoints(1, rangeB); // 1 === Range.START_TO_END\n }\n\n return compare;\n \n }),\n\n _sort: function(nodes) {\n if (nodes) {\n nodes = Y.Array(nodes, 0, true);\n if (nodes.sort) {\n nodes.sort(Selector._compare);\n }\n }\n\n return nodes;\n },\n\n _deDupe: function(nodes) {\n var ret = [],\n i, node;\n\n for (i = 0; (node = nodes[i++]);) {\n if (!node._found) {\n ret[ret.length] = node;\n node._found = true;\n }\n }\n\n for (i = 0; (node = ret[i++]);) {\n node._found = null;\n node.removeAttribute('_found');\n }\n\n return ret;\n },\n\n /**\n * Retrieves a set of nodes based on a given CSS selector. \n * @method query\n *\n * @param {string} selector The CSS Selector to test the node against.\n * @param {HTMLElement} root optional An HTMLElement to start the query from. Defaults to Y.config.doc\n * @param {Boolean} firstOnly optional Whether or not to return only the first match.\n * @return {Array} An array of nodes that match the given selector.\n * @static\n */\n query: function(selector, root, firstOnly, skipNative) {\n root = root || Y.config.doc;\n var ret = [],\n useNative = (Y.Selector.useNative && Y.config.doc.querySelector && !skipNative),\n queries = [[selector, root]],\n query,\n result,\n i,\n fn = (useNative) ? Y.Selector._nativeQuery : Y.Selector._bruteQuery;\n\n if (selector && fn) {\n // split group into seperate queries\n if (!skipNative && // already done if skipping\n (!useNative || root.tagName)) { // split native when element scoping is needed\n queries = Selector._splitQueries(selector, root);\n }\n\n for (i = 0; (query = queries[i++]);) {\n result = fn(query[0], query[1], firstOnly);\n if (!firstOnly) { // coerce DOM Collection to Array\n result = Y.Array(result, 0, true);\n }\n if (result) {\n ret = ret.concat(result);\n }\n }\n\n if (queries.length > 1) { // remove dupes and sort by doc order \n ret = Selector._sort(Selector._deDupe(ret));\n }\n }\n\n Y.log('query: ' + selector + ' returning: ' + ret.length, 'info', 'Selector');\n return (firstOnly) ? (ret[0] || null) : ret;\n\n },\n\n _replaceSelector: function(selector) {\n var esc = Y.Selector._parse('esc', selector), // pull escaped colon, brackets, etc. \n attrs,\n pseudos;\n\n // first replace escaped chars, which could be present in attrs or pseudos\n selector = Y.Selector._replace('esc', selector);\n\n // then replace pseudos before attrs to avoid replacing :not([foo])\n pseudos = Y.Selector._parse('pseudo', selector);\n selector = Selector._replace('pseudo', selector);\n\n attrs = Y.Selector._parse('attr', selector);\n selector = Y.Selector._replace('attr', selector);\n\n return {\n esc: esc,\n attrs: attrs,\n pseudos: pseudos,\n selector: selector\n };\n },\n\n _restoreSelector: function(replaced) {\n var selector = replaced.selector;\n selector = Y.Selector._restore('attr', selector, replaced.attrs);\n selector = Y.Selector._restore('pseudo', selector, replaced.pseudos);\n selector = Y.Selector._restore('esc', selector, replaced.esc);\n return selector;\n },\n\n _replaceCommas: function(selector) {\n var replaced = Y.Selector._replaceSelector(selector),\n selector = replaced.selector;\n\n if (selector) {\n selector = selector.replace(/,/g, '\\uE007');\n replaced.selector = selector;\n selector = Y.Selector._restoreSelector(replaced);\n }\n return selector;\n },\n\n // allows element scoped queries to begin with combinator\n // e.g. query('> p', document.body) === query('body > p')\n _splitQueries: function(selector, node) {\n if (selector.indexOf(',') > -1) {\n selector = Y.Selector._replaceCommas(selector);\n }\n\n var groups = selector.split('\\uE007'), // split on replaced comma token\n queries = [],\n prefix = '',\n id,\n i,\n len;\n\n if (node) {\n // enforce for element scoping\n if (node.nodeType === 1) { // Elements only\n id = Y.Selector._escapeId(Y.DOM.getId(node));\n\n if (!id) {\n id = Y.guid();\n Y.DOM.setId(node, id);\n }\n \n prefix = '[id=\"' + id + '\"] ';\n }\n\n for (i = 0, len = groups.length; i < len; ++i) {\n selector = prefix + groups[i];\n queries.push([selector, node]);\n }\n }\n\n return queries;\n },\n\n _nativeQuery: function(selector, root, one) {\n if (Y.UA.webkit && selector.indexOf(':checked') > -1 &&\n (Y.Selector.pseudos && Y.Selector.pseudos.checked)) { // webkit (chrome, safari) fails to pick up \"selected\" with \"checked\"\n return Y.Selector.query(selector, root, one, true); // redo with skipNative true to try brute query\n }\n try {\n //Y.log('trying native query with: ' + selector, 'info', 'selector-native');\n return root['querySelector' + (one ? '' : 'All')](selector);\n } catch(e) { // fallback to brute if available\n //Y.log('native query error; reverting to brute query with: ' + selector, 'info', 'selector-native');\n return Y.Selector.query(selector, root, one, true); // redo with skipNative true\n }\n },\n\n filter: function(nodes, selector) {\n var ret = [],\n i, node;\n\n if (nodes && selector) {\n for (i = 0; (node = nodes[i++]);) {\n if (Y.Selector.test(node, selector)) {\n ret[ret.length] = node;\n }\n }\n } else {\n Y.log('invalid filter input (nodes: ' + nodes +\n ', selector: ' + selector + ')', 'warn', 'Selector');\n }\n\n return ret;\n },\n\n test: function(node, selector, root) {\n var ret = false,\n useFrag = false,\n groups,\n parent,\n item,\n items,\n frag,\n id,\n i, j, group;\n\n if (node && node.tagName) { // only test HTMLElements\n\n if (typeof selector == 'function') { // test with function\n ret = selector.call(node, node);\n } else { // test with query\n // we need a root if off-doc\n groups = selector.split(',');\n if (!root && !Y.DOM.inDoc(node)) {\n parent = node.parentNode;\n if (parent) { \n root = parent;\n } else { // only use frag when no parent to query\n frag = node[OWNER_DOCUMENT].createDocumentFragment();\n frag.appendChild(node);\n root = frag;\n useFrag = true;\n }\n }\n root = root || node[OWNER_DOCUMENT];\n\n id = Y.Selector._escapeId(Y.DOM.getId(node));\n if (!id) {\n id = Y.guid();\n Y.DOM.setId(node, id);\n }\n\n for (i = 0; (group = groups[i++]);) { // TODO: off-dom test\n group += '[id=\"' + id + '\"]';\n items = Y.Selector.query(group, root);\n\n for (j = 0; item = items[j++];) {\n if (item === node) {\n ret = true;\n break;\n }\n }\n if (ret) {\n break;\n }\n }\n\n if (useFrag) { // cleanup\n frag.removeChild(node);\n }\n };\n }\n\n return ret;\n },\n\n /**\n * A convenience function to emulate Y.Node's aNode.ancestor(selector).\n * @param {HTMLElement} element An HTMLElement to start the query from.\n * @param {String} selector The CSS selector to test the node against.\n * @return {HTMLElement} The ancestor node matching the selector, or null.\n * @param {Boolean} testSelf optional Whether or not to include the element in the scan \n * @static\n * @method ancestor\n */\n ancestor: function (element, selector, testSelf) {\n return Y.DOM.ancestor(element, function(n) {\n return Y.Selector.test(n, selector);\n }, testSelf);\n },\n\n _parse: function(name, selector) {\n return selector.match(Y.Selector._types[name].re);\n },\n\n _replace: function(name, selector) {\n var o = Y.Selector._types[name];\n return selector.replace(o.re, o.token);\n },\n\n _restore: function(name, selector, items) {\n if (items) {\n var token = Y.Selector._types[name].token,\n i, len;\n for (i = 0, len = items.length; i < len; ++i) {\n selector = selector.replace(token, items[i]);\n }\n }\n return selector;\n }\n};\n\nY.mix(Y.Selector, Selector, true);\n\n})(Y);\n\n\n}, '@VERSION@', {\"requires\": [\"dom-base\"]});\nYUI.add('selector', function (Y, NAME) {\n\n\n\n}, '@VERSION@', {\"requires\": [\"selector-native\"]});\nYUI.add('event-custom-base', function (Y, NAME) {\n\n/**\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event-custom\n */\n\nY.Env.evt = {\n handles: {},\n plugins: {}\n};\n\n\n/**\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event-custom\n * @submodule event-custom-base\n */\n\n/**\n * Allows for the insertion of methods that are executed before or after\n * a specified method\n * @class Do\n * @static\n */\n\nvar DO_BEFORE = 0,\n DO_AFTER = 1,\n\nDO = {\n\n /**\n * Cache of objects touched by the utility\n * @property objs\n * @static\n * @deprecated Since 3.6.0. The `_yuiaop` property on the AOP'd object \n * replaces the role of this property, but is considered to be private, and \n * is only mentioned to provide a migration path.\n * \n * If you have a use case which warrants migration to the _yuiaop property, \n * please file a ticket to let us know what it's used for and we can see if \n * we need to expose hooks for that functionality more formally.\n */\n objs: null,\n\n /**\n * <p>Execute the supplied method before the specified function. Wrapping\n * function may optionally return an instance of the following classes to\n * further alter runtime behavior:</p>\n * <dl>\n * <dt></code>Y.Do.Halt(message, returnValue)</code></dt>\n * <dd>Immediatly stop execution and return\n * <code>returnValue</code>. No other wrapping functions will be\n * executed.</dd>\n * <dt></code>Y.Do.AlterArgs(message, newArgArray)</code></dt>\n * <dd>Replace the arguments that the original function will be\n * called with.</dd>\n * <dt></code>Y.Do.Prevent(message)</code></dt>\n * <dd>Don't execute the wrapped function. Other before phase\n * wrappers will be executed.</dd>\n * </dl>\n *\n * @method before\n * @param fn {Function} the function to execute\n * @param obj the object hosting the method to displace\n * @param sFn {string} the name of the method to displace\n * @param c The execution context for fn\n * @param arg* {mixed} 0..n additional arguments to supply to the subscriber\n * when the event fires.\n * @return {string} handle for the subscription\n * @static\n */\n before: function(fn, obj, sFn, c) {\n // Y.log('Do before: ' + sFn, 'info', 'event');\n var f = fn, a;\n if (c) {\n a = [fn, c].concat(Y.Array(arguments, 4, true));\n f = Y.rbind.apply(Y, a);\n }\n\n return this._inject(DO_BEFORE, f, obj, sFn);\n },\n\n /**\n * <p>Execute the supplied method after the specified function. Wrapping\n * function may optionally return an instance of the following classes to\n * further alter runtime behavior:</p>\n * <dl>\n * <dt></code>Y.Do.Halt(message, returnValue)</code></dt>\n * <dd>Immediatly stop execution and return\n * <code>returnValue</code>. No other wrapping functions will be\n * executed.</dd>\n * <dt></code>Y.Do.AlterReturn(message, returnValue)</code></dt>\n * <dd>Return <code>returnValue</code> instead of the wrapped\n * method's original return value. This can be further altered by\n * other after phase wrappers.</dd>\n * </dl>\n *\n * <p>The static properties <code>Y.Do.originalRetVal</code> and\n * <code>Y.Do.currentRetVal</code> will be populated for reference.</p>\n *\n * @method after\n * @param fn {Function} the function to execute\n * @param obj the object hosting the method to displace\n * @param sFn {string} the name of the method to displace\n * @param c The execution context for fn\n * @param arg* {mixed} 0..n additional arguments to supply to the subscriber\n * @return {string} handle for the subscription\n * @static\n */\n after: function(fn, obj, sFn, c) {\n var f = fn, a;\n if (c) {\n a = [fn, c].concat(Y.Array(arguments, 4, true));\n f = Y.rbind.apply(Y, a);\n }\n\n return this._inject(DO_AFTER, f, obj, sFn);\n },\n\n /**\n * Execute the supplied method before or after the specified function.\n * Used by <code>before</code> and <code>after</code>.\n *\n * @method _inject\n * @param when {string} before or after\n * @param fn {Function} the function to execute\n * @param obj the object hosting the method to displace\n * @param sFn {string} the name of the method to displace\n * @param c The execution context for fn\n * @return {string} handle for the subscription\n * @private\n * @static\n */\n _inject: function(when, fn, obj, sFn) {\n // object id\n var id = Y.stamp(obj), o, sid;\n\n if (!obj._yuiaop) {\n // create a map entry for the obj if it doesn't exist, to hold overridden methods\n obj._yuiaop = {};\n }\n\n o = obj._yuiaop;\n\n if (!o[sFn]) {\n // create a map entry for the method if it doesn't exist\n o[sFn] = new Y.Do.Method(obj, sFn);\n\n // re-route the method to our wrapper\n obj[sFn] = function() {\n return o[sFn].exec.apply(o[sFn], arguments);\n };\n }\n\n // subscriber id\n sid = id + Y.stamp(fn) + sFn;\n\n // register the callback\n o[sFn].register(sid, fn, when);\n\n return new Y.EventHandle(o[sFn], sid);\n },\n\n /**\n * Detach a before or after subscription.\n *\n * @method detach\n * @param handle {string} the subscription handle\n * @static\n */\n detach: function(handle) {\n if (handle.detach) {\n handle.detach();\n }\n },\n\n _unload: function(e, me) {\n }\n};\n\nY.Do = DO;\n\n//////////////////////////////////////////////////////////////////////////\n\n/**\n * Contains the return value from the wrapped method, accessible\n * by 'after' event listeners.\n *\n * @property originalRetVal\n * @static\n * @since 3.2.0\n */\n\n/**\n * Contains the current state of the return value, consumable by\n * 'after' event listeners, and updated if an after subscriber\n * changes the return value generated by the wrapped function.\n *\n * @property currentRetVal\n * @static\n * @since 3.2.0\n */\n\n//////////////////////////////////////////////////////////////////////////\n\n/**\n * Wrapper for a displaced method with aop enabled\n * @class Do.Method\n * @constructor\n * @param obj The object to operate on\n * @param sFn The name of the method to displace\n */\nDO.Method = function(obj, sFn) {\n this.obj = obj;\n this.methodName = sFn;\n this.method = obj[sFn];\n this.before = {};\n this.after = {};\n};\n\n/**\n * Register a aop subscriber\n * @method register\n * @param sid {string} the subscriber id\n * @param fn {Function} the function to execute\n * @param when {string} when to execute the function\n */\nDO.Method.prototype.register = function (sid, fn, when) {\n if (when) {\n this.after[sid] = fn;\n } else {\n this.before[sid] = fn;\n }\n};\n\n/**\n * Unregister a aop subscriber\n * @method delete\n * @param sid {string} the subscriber id\n * @param fn {Function} the function to execute\n * @param when {string} when to execute the function\n */\nDO.Method.prototype._delete = function (sid) {\n // Y.log('Y.Do._delete: ' + sid, 'info', 'Event');\n delete this.before[sid];\n delete this.after[sid];\n};\n\n/**\n * <p>Execute the wrapped method. All arguments are passed into the wrapping\n * functions. If any of the before wrappers return an instance of\n * <code>Y.Do.Halt</code> or <code>Y.Do.Prevent</code>, neither the wrapped\n * function nor any after phase subscribers will be executed.</p>\n *\n * <p>The return value will be the return value of the wrapped function or one\n * provided by a wrapper function via an instance of <code>Y.Do.Halt</code> or\n * <code>Y.Do.AlterReturn</code>.\n *\n * @method exec\n * @param arg* {any} Arguments are passed to the wrapping and wrapped functions\n * @return {any} Return value of wrapped function unless overwritten (see above)\n */\nDO.Method.prototype.exec = function () {\n\n var args = Y.Array(arguments, 0, true),\n i, ret, newRet,\n bf = this.before,\n af = this.after,\n prevented = false;\n\n // execute before\n for (i in bf) {\n if (bf.hasOwnProperty(i)) {\n ret = bf[i].apply(this.obj, args);\n if (ret) {\n switch (ret.constructor) {\n case DO.Halt:\n return ret.retVal;\n case DO.AlterArgs:\n args = ret.newArgs;\n break;\n case DO.Prevent:\n prevented = true;\n break;\n default:\n }\n }\n }\n }\n\n // execute method\n if (!prevented) {\n ret = this.method.apply(this.obj, args);\n }\n\n DO.originalRetVal = ret;\n DO.currentRetVal = ret;\n\n // execute after methods.\n for (i in af) {\n if (af.hasOwnProperty(i)) {\n newRet = af[i].apply(this.obj, args);\n // Stop processing if a Halt object is returned\n if (newRet && newRet.constructor == DO.Halt) {\n return newRet.retVal;\n // Check for a new return value\n } else if (newRet && newRet.constructor == DO.AlterReturn) {\n ret = newRet.newRetVal;\n // Update the static retval state\n DO.currentRetVal = ret;\n }\n }\n }\n\n return ret;\n};\n\n//////////////////////////////////////////////////////////////////////////\n\n/**\n * Return an AlterArgs object when you want to change the arguments that\n * were passed into the function. Useful for Do.before subscribers. An\n * example would be a service that scrubs out illegal characters prior to\n * executing the core business logic.\n * @class Do.AlterArgs\n * @constructor\n * @param msg {String} (optional) Explanation of the altered return value\n * @param newArgs {Array} Call parameters to be used for the original method\n * instead of the arguments originally passed in.\n */\nDO.AlterArgs = function(msg, newArgs) {\n this.msg = msg;\n this.newArgs = newArgs;\n};\n\n/**\n * Return an AlterReturn object when you want to change the result returned\n * from the core method to the caller. Useful for Do.after subscribers.\n * @class Do.AlterReturn\n * @constructor\n * @param msg {String} (optional) Explanation of the altered return value\n * @param newRetVal {any} Return value passed to code that invoked the wrapped\n * function.\n */\nDO.AlterReturn = function(msg, newRetVal) {\n this.msg = msg;\n this.newRetVal = newRetVal;\n};\n\n/**\n * Return a Halt object when you want to terminate the execution\n * of all subsequent subscribers as well as the wrapped method\n * if it has not exectued yet. Useful for Do.before subscribers.\n * @class Do.Halt\n * @constructor\n * @param msg {String} (optional) Explanation of why the termination was done\n * @param retVal {any} Return value passed to code that invoked the wrapped\n * function.\n */\nDO.Halt = function(msg, retVal) {\n this.msg = msg;\n this.retVal = retVal;\n};\n\n/**\n * Return a Prevent object when you want to prevent the wrapped function\n * from executing, but want the remaining listeners to execute. Useful\n * for Do.before subscribers.\n * @class Do.Prevent\n * @constructor\n * @param msg {String} (optional) Explanation of why the termination was done\n */\nDO.Prevent = function(msg) {\n this.msg = msg;\n};\n\n/**\n * Return an Error object when you want to terminate the execution\n * of all subsequent method calls.\n * @class Do.Error\n * @constructor\n * @param msg {String} (optional) Explanation of the altered return value\n * @param retVal {any} Return value passed to code that invoked the wrapped\n * function.\n * @deprecated use Y.Do.Halt or Y.Do.Prevent\n */\nDO.Error = DO.Halt;\n\n\n//////////////////////////////////////////////////////////////////////////\n\n// Y[\"Event\"] && Y.Event.addListener(window, \"unload\", Y.Do._unload, Y.Do);\n\n\n/**\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event-custom\n * @submodule event-custom-base\n */\n\n\n// var onsubscribeType = \"_event:onsub\",\nvar YArray = Y.Array,\n\n AFTER = 'after',\n CONFIGS = [\n 'broadcast',\n 'monitored',\n 'bubbles',\n 'context',\n 'contextFn',\n 'currentTarget',\n 'defaultFn',\n 'defaultTargetOnly',\n 'details',\n 'emitFacade',\n 'fireOnce',\n 'async',\n 'host',\n 'preventable',\n 'preventedFn',\n 'queuable',\n 'silent',\n 'stoppedFn',\n 'target',\n 'type'\n ],\n\n CONFIGS_HASH = YArray.hash(CONFIGS),\n\n nativeSlice = Array.prototype.slice, \n\n YUI3_SIGNATURE = 9,\n YUI_LOG = 'yui:log',\n\n mixConfigs = function(r, s, ov) {\n var p;\n\n for (p in s) {\n if (CONFIGS_HASH[p] && (ov || !(p in r))) { \n r[p] = s[p];\n }\n }\n\n return r;\n };\n\n/**\n * The CustomEvent class lets you define events for your application\n * that can be subscribed to by one or more independent component.\n *\n * @param {String} type The type of event, which is passed to the callback\n * when the event fires.\n * @param {object} o configuration object.\n * @class CustomEvent\n * @constructor\n */\nY.CustomEvent = function(type, o) {\n\n this._kds = Y.CustomEvent.keepDeprecatedSubs;\n\n o = o || {};\n\n this.id = Y.stamp(this);\n\n /**\n * The type of event, returned to subscribers when the event fires\n * @property type\n * @type string\n */\n this.type = type;\n\n /**\n * The context the the event will fire from by default. Defaults to the YUI\n * instance.\n * @property context\n * @type object\n */\n this.context = Y;\n\n /**\n * Monitor when an event is attached or detached.\n *\n * @property monitored\n * @type boolean\n */\n // this.monitored = false;\n\n this.logSystem = (type == YUI_LOG);\n\n /**\n * If 0, this event does not broadcast. If 1, the YUI instance is notified\n * every time this event fires. If 2, the YUI instance and the YUI global\n * (if event is enabled on the global) are notified every time this event\n * fires.\n * @property broadcast\n * @type int\n */\n // this.broadcast = 0;\n\n /**\n * By default all custom events are logged in the debug build, set silent\n * to true to disable debug outpu for this event.\n * @property silent\n * @type boolean\n */\n this.silent = this.logSystem;\n\n /**\n * Specifies whether this event should be queued when the host is actively\n * processing an event. This will effect exectution order of the callbacks\n * for the various events.\n * @property queuable\n * @type boolean\n * @default false\n */\n // this.queuable = false;\n\n /**\n * The subscribers to this event\n * @property subscribers\n * @type Subscriber {}\n * @deprecated\n */\n if (this._kds) {\n this.subscribers = {};\n }\n\n /**\n * The subscribers to this event\n * @property _subscribers\n * @type Subscriber []\n * @private\n */\n this._subscribers = [];\n\n /**\n * 'After' subscribers\n * @property afters\n * @type Subscriber {}\n */\n if (this._kds) {\n this.afters = {};\n }\n\n /**\n * 'After' subscribers\n * @property _afters\n * @type Subscriber []\n * @private\n */\n this._afters = [];\n\n /**\n * This event has fired if true\n *\n * @property fired\n * @type boolean\n * @default false;\n */\n // this.fired = false;\n\n /**\n * An array containing the arguments the custom event\n * was last fired with.\n * @property firedWith\n * @type Array\n */\n // this.firedWith;\n\n /**\n * This event should only fire one time if true, and if\n * it has fired, any new subscribers should be notified\n * immediately.\n *\n * @property fireOnce\n * @type boolean\n * @default false;\n */\n // this.fireOnce = false;\n\n /**\n * fireOnce listeners will fire syncronously unless async\n * is set to true\n * @property async\n * @type boolean\n * @default false\n */\n //this.async = false;\n\n /**\n * Flag for stopPropagation that is modified during fire()\n * 1 means to stop propagation to bubble targets. 2 means\n * to also stop additional subscribers on this target.\n * @property stopped\n * @type int\n */\n // this.stopped = 0;\n\n /**\n * Flag for preventDefault that is modified during fire().\n * if it is not 0, the default behavior for this event\n * @property prevented\n * @type int\n */\n // this.prevented = 0;\n\n /**\n * Specifies the host for this custom event. This is used\n * to enable event bubbling\n * @property host\n * @type EventTarget\n */\n // this.host = null;\n\n /**\n * The default function to execute after event listeners\n * have fire, but only if the default action was not\n * prevented.\n * @property defaultFn\n * @type Function\n */\n // this.defaultFn = null;\n\n /**\n * The function to execute if a subscriber calls\n * stopPropagation or stopImmediatePropagation\n * @property stoppedFn\n * @type Function\n */\n // this.stoppedFn = null;\n\n /**\n * The function to execute if a subscriber calls\n * preventDefault\n * @property preventedFn\n * @type Function\n */\n // this.preventedFn = null;\n\n /**\n * Specifies whether or not this event's default function\n * can be cancelled by a subscriber by executing preventDefault()\n * on the event facade\n * @property preventable\n * @type boolean\n * @default true\n */\n this.preventable = true;\n\n /**\n * Specifies whether or not a subscriber can stop the event propagation\n * via stopPropagation(), stopImmediatePropagation(), or halt()\n *\n * Events can only bubble if emitFacade is true.\n *\n * @property bubbles\n * @type boolean\n * @default true\n */\n this.bubbles = true;\n\n /**\n * Supports multiple options for listener signatures in order to\n * port YUI 2 apps.\n * @property signature\n * @type int\n * @default 9\n */\n this.signature = YUI3_SIGNATURE;\n\n // this.subCount = 0;\n // this.afterCount = 0;\n\n // this.hasSubscribers = false;\n // this.hasAfters = false;\n\n /**\n * If set to true, the custom event will deliver an EventFacade object\n * that is similar to a DOM event object.\n * @property emitFacade\n * @type boolean\n * @default false\n */\n // this.emitFacade = false;\n\n this.applyConfig(o, true);\n\n // this.log(\"Creating \" + this.type);\n\n};\n\n/**\n * Static flag to enable population of the <a href=\"#property_subscribers\">`subscribers`</a>\n * and <a href=\"#property_subscribers\">`afters`</a> properties held on a `CustomEvent` instance.\n * \n * These properties were changed to private properties (`_subscribers` and `_afters`), and \n * converted from objects to arrays for performance reasons. \n *\n * Setting this property to true will populate the deprecated `subscribers` and `afters` \n * properties for people who may be using them (which is expected to be rare). There will\n * be a performance hit, compared to the new array based implementation.\n *\n * If you are using these deprecated properties for a use case which the public API\n * does not support, please file an enhancement request, and we can provide an alternate \n * public implementation which doesn't have the performance cost required to maintiain the\n * properties as objects.\n *\n * @property keepDeprecatedSubs\n * @static\n * @for CustomEvent\n * @type boolean\n * @default false\n * @deprecated\n */\nY.CustomEvent.keepDeprecatedSubs = false;\n\nY.CustomEvent.mixConfigs = mixConfigs;\n\nY.CustomEvent.prototype = {\n\n constructor: Y.CustomEvent,\n\n /**\n * Returns the number of subscribers for this event as the sum of the on()\n * subscribers and after() subscribers.\n *\n * @method hasSubs\n * @return Number\n */\n hasSubs: function(when) {\n var s = this._subscribers.length, a = this._afters.length, sib = this.sibling;\n\n if (sib) {\n s += sib._subscribers.length;\n a += sib._afters.length;\n }\n\n if (when) {\n return (when == 'after') ? a : s;\n }\n\n return (s + a);\n },\n\n /**\n * Monitor the event state for the subscribed event. The first parameter\n * is what should be monitored, the rest are the normal parameters when\n * subscribing to an event.\n * @method monitor\n * @param what {string} what to monitor ('detach', 'attach', 'publish').\n * @return {EventHandle} return value from the monitor event subscription.\n */\n monitor: function(what) {\n this.monitored = true;\n var type = this.id + '|' + this.type + '_' + what,\n args = nativeSlice.call(arguments, 0);\n args[0] = type;\n return this.host.on.apply(this.host, args);\n },\n\n /**\n * Get all of the subscribers to this event and any sibling event\n * @method getSubs\n * @return {Array} first item is the on subscribers, second the after.\n */\n getSubs: function() {\n var s = this._subscribers, a = this._afters, sib = this.sibling;\n\n s = (sib) ? s.concat(sib._subscribers) : s.concat();\n a = (sib) ? a.concat(sib._afters) : a.concat();\n\n return [s, a];\n },\n\n /**\n * Apply configuration properties. Only applies the CONFIG whitelist\n * @method applyConfig\n * @param o hash of properties to apply.\n * @param force {boolean} if true, properties that exist on the event\n * will be overwritten.\n */\n applyConfig: function(o, force) {\n mixConfigs(this, o, force);\n },\n\n /**\n * Create the Subscription for subscribing function, context, and bound\n * arguments. If this is a fireOnce event, the subscriber is immediately \n * notified.\n *\n * @method _on\n * @param fn {Function} Subscription callback\n * @param [context] {Object} Override `this` in the callback\n * @param [args] {Array} bound arguments that will be passed to the callback after the arguments generated by fire()\n * @param [when] {String} \"after\" to slot into after subscribers\n * @return {EventHandle}\n * @protected\n */\n _on: function(fn, context, args, when) {\n\n if (!fn) { this.log('Invalid callback for CE: ' + this.type); }\n\n var s = new Y.Subscriber(fn, context, args, when);\n\n if (this.fireOnce && this.fired) {\n if (this.async) {\n setTimeout(Y.bind(this._notify, this, s, this.firedWith), 0);\n } else {\n this._notify(s, this.firedWith);\n }\n }\n\n if (when == AFTER) {\n this._afters.push(s);\n } else {\n this._subscribers.push(s);\n }\n\n if (this._kds) {\n if (when == AFTER) {\n this.afters[s.id] = s;\n } else {\n this.subscribers[s.id] = s;\n }\n }\n\n return new Y.EventHandle(this, s);\n },\n\n /**\n * Listen for this event\n * @method subscribe\n * @param {Function} fn The function to execute.\n * @return {EventHandle} Unsubscribe handle.\n * @deprecated use on.\n */\n subscribe: function(fn, context) {\n Y.log('ce.subscribe deprecated, use \"on\"', 'warn', 'deprecated');\n var a = (arguments.length > 2) ? nativeSlice.call(arguments, 2) : null;\n return this._on(fn, context, a, true);\n },\n \n /**\n * Listen for this event\n * @method on\n * @param {Function} fn The function to execute.\n * @param {object} context optional execution context.\n * @param {mixed} arg* 0..n additional arguments to supply to the subscriber\n * when the event fires.\n * @return {EventHandle} An object with a detach method to detch the handler(s).\n */\n on: function(fn, context) {\n var a = (arguments.length > 2) ? nativeSlice.call(arguments, 2) : null;\n\n if (this.monitored && this.host) {\n this.host._monitor('attach', this, {\n args: arguments\n });\n }\n return this._on(fn, context, a, true);\n },\n\n /**\n * Listen for this event after the normal subscribers have been notified and\n * the default behavior has been applied. If a normal subscriber prevents the\n * default behavior, it also prevents after listeners from firing.\n * @method after\n * @param {Function} fn The function to execute.\n * @param {object} context optional execution context.\n * @param {mixed} arg* 0..n additional arguments to supply to the subscriber\n * when the event fires.\n * @return {EventHandle} handle Unsubscribe handle.\n */\n after: function(fn, context) {\n var a = (arguments.length > 2) ? nativeSlice.call(arguments, 2) : null;\n return this._on(fn, context, a, AFTER);\n },\n\n /**\n * Detach listeners.\n * @method detach\n * @param {Function} fn The subscribed function to remove, if not supplied\n * all will be removed.\n * @param {Object} context The context object passed to subscribe.\n * @return {int} returns the number of subscribers unsubscribed.\n */\n detach: function(fn, context) {\n // unsubscribe handle\n if (fn && fn.detach) {\n return fn.detach();\n }\n \n var i, s,\n found = 0,\n subs = this._subscribers,\n afters = this._afters;\n\n for (i = subs.length; i >= 0; i--) {\n s = subs[i];\n if (s && (!fn || fn === s.fn)) {\n this._delete(s, subs, i);\n found++;\n }\n }\n\n for (i = afters.length; i >= 0; i--) {\n s = afters[i];\n if (s && (!fn || fn === s.fn)) {\n this._delete(s, afters, i);\n found++;\n }\n }\n\n return found;\n },\n\n /**\n * Detach listeners.\n * @method unsubscribe\n * @param {Function} fn The subscribed function to remove, if not supplied\n * all will be removed.\n * @param {Object} context The context object passed to subscribe.\n * @return {int|undefined} returns the number of subscribers unsubscribed.\n * @deprecated use detach.\n */\n unsubscribe: function() {\n return this.detach.apply(this, arguments);\n },\n\n /**\n * Notify a single subscriber\n * @method _notify\n * @param {Subscriber} s the subscriber.\n * @param {Array} args the arguments array to apply to the listener.\n * @protected\n */\n _notify: function(s, args, ef) {\n\n this.log(this.type + '->' + 'sub: ' + s.id);\n\n var ret;\n\n ret = s.notify(args, this);\n\n if (false === ret || this.stopped > 1) {\n this.log(this.type + ' cancelled by subscriber');\n return false;\n }\n\n return true;\n },\n\n /**\n * Logger abstraction to centralize the application of the silent flag\n * @method log\n * @param {string} msg message to log.\n * @param {string} cat log category.\n */\n log: function(msg, cat) {\n if (!this.silent) { Y.log(this.id + ': ' + msg, cat || 'info', 'event'); }\n },\n\n /**\n * Notifies the subscribers. The callback functions will be executed\n * from the context specified when the event was created, and with the\n * following parameters:\n * <ul>\n * <li>The type of event</li>\n * <li>All of the arguments fire() was executed with as an array</li>\n * <li>The custom object (if any) that was passed into the subscribe()\n * method</li>\n * </ul>\n * @method fire\n * @param {Object*} arguments an arbitrary set of parameters to pass to\n * the handler.\n * @return {boolean} false if one of the subscribers returned false,\n * true otherwise.\n *\n */\n fire: function() {\n if (this.fireOnce && this.fired) {\n this.log('fireOnce event: ' + this.type + ' already fired');\n return true;\n } else {\n\n var args = nativeSlice.call(arguments, 0);\n\n // this doesn't happen if the event isn't published\n // this.host._monitor('fire', this.type, args);\n\n this.fired = true;\n\n if (this.fireOnce) {\n this.firedWith = args;\n }\n\n if (this.emitFacade) {\n return this.fireComplex(args);\n } else {\n return this.fireSimple(args);\n }\n }\n },\n\n /**\n * Set up for notifying subscribers of non-emitFacade events.\n *\n * @method fireSimple\n * @param args {Array} Arguments passed to fire()\n * @return Boolean false if a subscriber returned false\n * @protected\n */\n fireSimple: function(args) {\n this.stopped = 0;\n this.prevented = 0;\n if (this.hasSubs()) {\n var subs = this.getSubs();\n this._procSubs(subs[0], args);\n this._procSubs(subs[1], args);\n }\n this._broadcast(args);\n return this.stopped ? false : true;\n },\n\n // Requires the event-custom-complex module for full funcitonality.\n fireComplex: function(args) {\n this.log('Missing event-custom-complex needed to emit a facade for: ' + this.type);\n args[0] = args[0] || {};\n return this.fireSimple(args);\n },\n\n /**\n * Notifies a list of subscribers.\n *\n * @method _procSubs\n * @param subs {Array} List of subscribers\n * @param args {Array} Arguments passed to fire()\n * @param ef {}\n * @return Boolean false if a subscriber returns false or stops the event\n * propagation via e.stopPropagation(),\n * e.stopImmediatePropagation(), or e.halt()\n * @private\n */\n _procSubs: function(subs, args, ef) {\n var s, i, l;\n\n for (i = 0, l = subs.length; i < l; i++) {\n s = subs[i];\n if (s && s.fn) {\n if (false === this._notify(s, args, ef)) {\n this.stopped = 2;\n }\n if (this.stopped == 2) {\n return false;\n }\n }\n }\n\n return true;\n },\n\n /**\n * Notifies the YUI instance if the event is configured with broadcast = 1,\n * and both the YUI instance and Y.Global if configured with broadcast = 2.\n *\n * @method _broadcast\n * @param args {Array} Arguments sent to fire()\n * @private\n */\n _broadcast: function(args) {\n if (!this.stopped && this.broadcast) {\n\n var a = args.concat();\n a.unshift(this.type);\n\n if (this.host !== Y) {\n Y.fire.apply(Y, a);\n }\n\n if (this.broadcast == 2) {\n Y.Global.fire.apply(Y.Global, a);\n }\n }\n },\n\n /**\n * Removes all listeners\n * @method unsubscribeAll\n * @return {int} The number of listeners unsubscribed.\n * @deprecated use detachAll.\n */\n unsubscribeAll: function() {\n return this.detachAll.apply(this, arguments);\n },\n\n /**\n * Removes all listeners\n * @method detachAll\n * @return {int} The number of listeners unsubscribed.\n */\n detachAll: function() {\n return this.detach();\n },\n\n /**\n * Deletes the subscriber from the internal store of on() and after()\n * subscribers.\n *\n * @method _delete\n * @param s subscriber object.\n * @param subs (optional) on or after subscriber array\n * @param index (optional) The index found.\n * @private\n */\n _delete: function(s, subs, i) {\n var when = s._when;\n\n if (!subs) {\n subs = (when === AFTER) ? this._afters : this._subscribers; \n i = YArray.indexOf(subs, s, 0);\n }\n\n if (s && subs[i] === s) {\n subs.splice(i, 1);\n }\n\n if (this._kds) {\n if (when === AFTER) {\n delete this.afters[s.id];\n } else {\n delete this.subscribers[s.id];\n }\n }\n\n if (this.monitored && this.host) {\n this.host._monitor('detach', this, {\n ce: this,\n sub: s\n });\n }\n\n if (s) {\n s.deleted = true;\n }\n }\n};\n/**\n * Stores the subscriber information to be used when the event fires.\n * @param {Function} fn The wrapped function to execute.\n * @param {Object} context The value of the keyword 'this' in the listener.\n * @param {Array} args* 0..n additional arguments to supply the listener.\n *\n * @class Subscriber\n * @constructor\n */\nY.Subscriber = function(fn, context, args, when) {\n\n /**\n * The callback that will be execute when the event fires\n * This is wrapped by Y.rbind if obj was supplied.\n * @property fn\n * @type Function\n */\n this.fn = fn;\n\n /**\n * Optional 'this' keyword for the listener\n * @property context\n * @type Object\n */\n this.context = context;\n\n /**\n * Unique subscriber id\n * @property id\n * @type String\n */\n this.id = Y.stamp(this);\n\n /**\n * Additional arguments to propagate to the subscriber\n * @property args\n * @type Array\n */\n this.args = args;\n\n this._when = when;\n\n /**\n * Custom events for a given fire transaction.\n * @property events\n * @type {EventTarget}\n */\n // this.events = null;\n\n /**\n * This listener only reacts to the event once\n * @property once\n */\n // this.once = false;\n\n};\n\nY.Subscriber.prototype = {\n constructor: Y.Subscriber,\n\n _notify: function(c, args, ce) {\n if (this.deleted && !this.postponed) {\n if (this.postponed) {\n delete this.fn;\n delete this.context;\n } else {\n delete this.postponed;\n return null;\n }\n }\n var a = this.args, ret;\n switch (ce.signature) {\n case 0:\n ret = this.fn.call(c, ce.type, args, c);\n break;\n case 1:\n ret = this.fn.call(c, args[0] || null, c);\n break;\n default:\n if (a || args) {\n args = args || [];\n a = (a) ? args.concat(a) : args;\n ret = this.fn.apply(c, a);\n } else {\n ret = this.fn.call(c);\n }\n }\n\n if (this.once) {\n ce._delete(this);\n }\n\n return ret;\n },\n\n /**\n * Executes the subscriber.\n * @method notify\n * @param args {Array} Arguments array for the subscriber.\n * @param ce {CustomEvent} The custom event that sent the notification.\n */\n notify: function(args, ce) {\n var c = this.context,\n ret = true;\n\n if (!c) {\n c = (ce.contextFn) ? ce.contextFn() : ce.context;\n }\n\n // only catch errors if we will not re-throw them.\n if (Y.config && Y.config.throwFail) {\n ret = this._notify(c, args, ce);\n } else {\n try {\n ret = this._notify(c, args, ce);\n } catch (e) {\n Y.error(this + ' failed: ' + e.message, e);\n }\n }\n\n return ret;\n },\n\n /**\n * Returns true if the fn and obj match this objects properties.\n * Used by the unsubscribe method to match the right subscriber.\n *\n * @method contains\n * @param {Function} fn the function to execute.\n * @param {Object} context optional 'this' keyword for the listener.\n * @return {boolean} true if the supplied arguments match this\n * subscriber's signature.\n */\n contains: function(fn, context) {\n if (context) {\n return ((this.fn == fn) && this.context == context);\n } else {\n return (this.fn == fn);\n }\n },\n \n valueOf : function() {\n return this.id;\n }\n\n};\n/**\n * Return value from all subscribe operations\n * @class EventHandle\n * @constructor\n * @param {CustomEvent} evt the custom event.\n * @param {Subscriber} sub the subscriber.\n */\nY.EventHandle = function(evt, sub) {\n\n /**\n * The custom event\n *\n * @property evt\n * @type CustomEvent\n */\n this.evt = evt;\n\n /**\n * The subscriber object\n *\n * @property sub\n * @type Subscriber\n */\n this.sub = sub;\n};\n\nY.EventHandle.prototype = {\n batch: function(f, c) {\n f.call(c || this, this);\n if (Y.Lang.isArray(this.evt)) {\n Y.Array.each(this.evt, function(h) {\n h.batch.call(c || h, f);\n });\n }\n },\n\n /**\n * Detaches this subscriber\n * @method detach\n * @return {int} the number of detached listeners\n */\n detach: function() {\n var evt = this.evt, detached = 0, i;\n if (evt) {\n // Y.log('EventHandle.detach: ' + this.sub, 'info', 'Event');\n if (Y.Lang.isArray(evt)) {\n for (i = 0; i < evt.length; i++) {\n detached += evt[i].detach();\n }\n } else {\n evt._delete(this.sub);\n detached = 1;\n }\n\n }\n\n return detached;\n },\n\n /**\n * Monitor the event state for the subscribed event. The first parameter\n * is what should be monitored, the rest are the normal parameters when\n * subscribing to an event.\n * @method monitor\n * @param what {string} what to monitor ('attach', 'detach', 'publish').\n * @return {EventHandle} return value from the monitor event subscription.\n */\n monitor: function(what) {\n return this.evt.monitor.apply(this.evt, arguments);\n }\n};\n\n/**\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event-custom\n * @submodule event-custom-base\n */\n\n/**\n * EventTarget provides the implementation for any object to\n * publish, subscribe and fire to custom events, and also\n * alows other EventTargets to target the object with events\n * sourced from the other object.\n * EventTarget is designed to be used with Y.augment to wrap\n * EventCustom in an interface that allows events to be listened to\n * and fired by name. This makes it possible for implementing code to\n * subscribe to an event that either has not been created yet, or will\n * not be created at all.\n * @class EventTarget\n * @param opts a configuration object\n * @config emitFacade {boolean} if true, all events will emit event\n * facade payloads by default (default false)\n * @config prefix {String} the prefix to apply to non-prefixed event names\n */\n\nvar L = Y.Lang,\n PREFIX_DELIMITER = ':',\n CATEGORY_DELIMITER = '|',\n AFTER_PREFIX = '~AFTER~',\n WILD_TYPE_RE = /(.*?)(:)(.*?)/,\n\n _wildType = Y.cached(function(type) {\n return type.replace(WILD_TYPE_RE, \"*$2$3\");\n }),\n\n /**\n * If the instance has a prefix attribute and the\n * event type is not prefixed, the instance prefix is\n * applied to the supplied type.\n * @method _getType\n * @private\n */\n _getType = Y.cached(function(type, pre) {\n\n if (!pre || (typeof type !== \"string\") || type.indexOf(PREFIX_DELIMITER) > -1) {\n return type;\n }\n\n return pre + PREFIX_DELIMITER + type;\n }),\n\n /**\n * Returns an array with the detach key (if provided),\n * and the prefixed event name from _getType\n * Y.on('detachcategory| menu:click', fn)\n * @method _parseType\n * @private\n */\n _parseType = Y.cached(function(type, pre) {\n\n var t = type, detachcategory, after, i;\n\n if (!L.isString(t)) {\n return t;\n }\n\n i = t.indexOf(AFTER_PREFIX);\n\n if (i > -1) {\n after = true;\n t = t.substr(AFTER_PREFIX.length);\n // Y.log(t);\n }\n\n i = t.indexOf(CATEGORY_DELIMITER);\n\n if (i > -1) {\n detachcategory = t.substr(0, (i));\n t = t.substr(i+1);\n if (t == '*') {\n t = null;\n }\n }\n\n // detach category, full type with instance prefix, is this an after listener, short type\n return [detachcategory, (pre) ? _getType(t, pre) : t, after, t];\n }),\n\n ET = function(opts) {\n\n // Y.log('EventTarget constructor executed: ' + this._yuid);\n\n var o = (L.isObject(opts)) ? opts : {};\n\n this._yuievt = this._yuievt || {\n\n id: Y.guid(),\n\n events: {},\n\n targets: {},\n\n config: o,\n\n chain: ('chain' in o) ? o.chain : Y.config.chain,\n\n bubbling: false,\n\n defaults: {\n context: o.context || this,\n host: this,\n emitFacade: o.emitFacade,\n fireOnce: o.fireOnce,\n queuable: o.queuable,\n monitored: o.monitored,\n broadcast: o.broadcast,\n defaultTargetOnly: o.defaultTargetOnly,\n bubbles: ('bubbles' in o) ? o.bubbles : true\n }\n };\n };\n\n\nET.prototype = {\n constructor: ET,\n\n /**\n * Listen to a custom event hosted by this object one time.\n * This is the equivalent to <code>on</code> except the\n * listener is immediatelly detached when it is executed.\n * @method once\n * @param {String} type The name of the event\n * @param {Function} fn The callback to execute in response to the event\n * @param {Object} [context] Override `this` object in callback\n * @param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n * @return {EventHandle} A subscription handle capable of detaching the\n * subscription\n */\n once: function() {\n var handle = this.on.apply(this, arguments);\n handle.batch(function(hand) {\n if (hand.sub) {\n hand.sub.once = true;\n }\n });\n return handle;\n },\n\n /**\n * Listen to a custom event hosted by this object one time.\n * This is the equivalent to <code>after</code> except the\n * listener is immediatelly detached when it is executed.\n * @method onceAfter\n * @param {String} type The name of the event\n * @param {Function} fn The callback to execute in response to the event\n * @param {Object} [context] Override `this` object in callback\n * @param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n * @return {EventHandle} A subscription handle capable of detaching that\n * subscription\n */\n onceAfter: function() {\n var handle = this.after.apply(this, arguments);\n handle.batch(function(hand) {\n if (hand.sub) {\n hand.sub.once = true;\n }\n });\n return handle;\n },\n\n /**\n * Takes the type parameter passed to 'on' and parses out the\n * various pieces that could be included in the type. If the\n * event type is passed without a prefix, it will be expanded\n * to include the prefix one is supplied or the event target\n * is configured with a default prefix.\n * @method parseType\n * @param {String} type the type\n * @param {String} [pre=this._yuievt.config.prefix] the prefix\n * @since 3.3.0\n * @return {Array} an array containing:\n * * the detach category, if supplied,\n * * the prefixed event type,\n * * whether or not this is an after listener,\n * * the supplied event type\n */\n parseType: function(type, pre) {\n return _parseType(type, pre || this._yuievt.config.prefix);\n },\n\n /**\n * Subscribe a callback function to a custom event fired by this object or\n * from an object that bubbles its events to this object.\n *\n * Callback functions for events published with `emitFacade = true` will\n * receive an `EventFacade` as the first argument (typically named \"e\").\n * These callbacks can then call `e.preventDefault()` to disable the\n * behavior published to that event's `defaultFn`. See the `EventFacade`\n * API for all available properties and methods. Subscribers to\n * non-`emitFacade` events will receive the arguments passed to `fire()`\n * after the event name.\n *\n * To subscribe to multiple events at once, pass an object as the first\n * argument, where the key:value pairs correspond to the eventName:callback,\n * or pass an array of event names as the first argument to subscribe to\n * all listed events with the same callback.\n *\n * Returning `false` from a callback is supported as an alternative to\n * calling `e.preventDefault(); e.stopPropagation();`. However, it is\n * recommended to use the event methods whenever possible.\n *\n * @method on\n * @param {String} type The name of the event\n * @param {Function} fn The callback to execute in response to the event\n * @param {Object} [context] Override `this` object in callback\n * @param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n * @return {EventHandle} A subscription handle capable of detaching that\n * subscription\n */\n on: function(type, fn, context) {\n\n var yuievt = this._yuievt,\n parts = _parseType(type, yuievt.config.prefix), f, c, args, ret, ce,\n detachcategory, handle, store = Y.Env.evt.handles, after, adapt, shorttype,\n Node = Y.Node, n, domevent, isArr;\n\n // full name, args, detachcategory, after\n this._monitor('attach', parts[1], {\n args: arguments,\n category: parts[0],\n after: parts[2]\n });\n\n if (L.isObject(type)) {\n\n if (L.isFunction(type)) {\n return Y.Do.before.apply(Y.Do, arguments);\n }\n\n f = fn;\n c = context;\n args = nativeSlice.call(arguments, 0);\n ret = [];\n\n if (L.isArray(type)) {\n isArr = true;\n }\n\n after = type._after;\n delete type._after;\n\n Y.each(type, function(v, k) {\n\n if (L.isObject(v)) {\n f = v.fn || ((L.isFunction(v)) ? v : f);\n c = v.context || c;\n }\n\n var nv = (after) ? AFTER_PREFIX : '';\n\n args[0] = nv + ((isArr) ? v : k);\n args[1] = f;\n args[2] = c;\n\n ret.push(this.on.apply(this, args));\n\n }, this);\n\n return (yuievt.chain) ? this : new Y.EventHandle(ret);\n }\n\n detachcategory = parts[0];\n after = parts[2];\n shorttype = parts[3];\n\n // extra redirection so we catch adaptor events too. take a look at this.\n if (Node && Y.instanceOf(this, Node) && (shorttype in Node.DOM_EVENTS)) {\n args = nativeSlice.call(arguments, 0);\n args.splice(2, 0, Node.getDOMNode(this));\n // Y.log(\"Node detected, redirecting with these args: \" + args);\n return Y.on.apply(Y, args);\n }\n\n type = parts[1];\n\n if (Y.instanceOf(this, YUI)) {\n\n adapt = Y.Env.evt.plugins[type];\n args = nativeSlice.call(arguments, 0);\n args[0] = shorttype;\n\n if (Node) {\n n = args[2];\n\n if (Y.instanceOf(n, Y.NodeList)) {\n n = Y.NodeList.getDOMNodes(n);\n } else if (Y.instanceOf(n, Node)) {\n n = Node.getDOMNode(n);\n }\n\n domevent = (shorttype in Node.DOM_EVENTS);\n\n // Captures both DOM events and event plugins.\n if (domevent) {\n args[2] = n;\n }\n }\n\n // check for the existance of an event adaptor\n if (adapt) {\n Y.log('Using adaptor for ' + shorttype + ', ' + n, 'info', 'event');\n handle = adapt.on.apply(Y, args);\n } else if ((!type) || domevent) {\n handle = Y.Event._attach(args);\n }\n\n }\n\n if (!handle) {\n ce = yuievt.events[type] || this.publish(type);\n handle = ce._on(fn, context, (arguments.length > 3) ? nativeSlice.call(arguments, 3) : null, (after) ? 'after' : true);\n }\n\n if (detachcategory) {\n store[detachcategory] = store[detachcategory] || {};\n store[detachcategory][type] = store[detachcategory][type] || [];\n store[detachcategory][type].push(handle);\n }\n\n return (yuievt.chain) ? this : handle;\n\n },\n\n /**\n * subscribe to an event\n * @method subscribe\n * @deprecated use on\n */\n subscribe: function() {\n Y.log('EventTarget subscribe() is deprecated, use on()', 'warn', 'deprecated');\n return this.on.apply(this, arguments);\n },\n\n /**\n * Detach one or more listeners the from the specified event\n * @method detach\n * @param type {string|Object} Either the handle to the subscriber or the\n * type of event. If the type\n * is not specified, it will attempt to remove\n * the listener from all hosted events.\n * @param fn {Function} The subscribed function to unsubscribe, if not\n * supplied, all subscribers will be removed.\n * @param context {Object} The custom object passed to subscribe. This is\n * optional, but if supplied will be used to\n * disambiguate multiple listeners that are the same\n * (e.g., you subscribe many object using a function\n * that lives on the prototype)\n * @return {EventTarget} the host\n */\n detach: function(type, fn, context) {\n var evts = this._yuievt.events, i,\n Node = Y.Node, isNode = Node && (Y.instanceOf(this, Node));\n\n // detachAll disabled on the Y instance.\n if (!type && (this !== Y)) {\n for (i in evts) {\n if (evts.hasOwnProperty(i)) {\n evts[i].detach(fn, context);\n }\n }\n if (isNode) {\n Y.Event.purgeElement(Node.getDOMNode(this));\n }\n\n return this;\n }\n\n var parts = _parseType(type, this._yuievt.config.prefix),\n detachcategory = L.isArray(parts) ? parts[0] : null,\n shorttype = (parts) ? parts[3] : null,\n adapt, store = Y.Env.evt.handles, detachhost, cat, args,\n ce,\n\n keyDetacher = function(lcat, ltype, host) {\n var handles = lcat[ltype], ce, i;\n if (handles) {\n for (i = handles.length - 1; i >= 0; --i) {\n ce = handles[i].evt;\n if (ce.host === host || ce.el === host) {\n handles[i].detach();\n }\n }\n }\n };\n\n if (detachcategory) {\n\n cat = store[detachcategory];\n type = parts[1];\n detachhost = (isNode) ? Y.Node.getDOMNode(this) : this;\n\n if (cat) {\n if (type) {\n keyDetacher(cat, type, detachhost);\n } else {\n for (i in cat) {\n if (cat.hasOwnProperty(i)) {\n keyDetacher(cat, i, detachhost);\n }\n }\n }\n\n return this;\n }\n\n // If this is an event handle, use it to detach\n } else if (L.isObject(type) && type.detach) {\n type.detach();\n return this;\n // extra redirection so we catch adaptor events too. take a look at this.\n } else if (isNode && ((!shorttype) || (shorttype in Node.DOM_EVENTS))) {\n args = nativeSlice.call(arguments, 0);\n args[2] = Node.getDOMNode(this);\n Y.detach.apply(Y, args);\n return this;\n }\n\n adapt = Y.Env.evt.plugins[shorttype];\n\n // The YUI instance handles DOM events and adaptors\n if (Y.instanceOf(this, YUI)) {\n args = nativeSlice.call(arguments, 0);\n // use the adaptor specific detach code if\n if (adapt && adapt.detach) {\n adapt.detach.apply(Y, args);\n return this;\n // DOM event fork\n } else if (!type || (!adapt && Node && (type in Node.DOM_EVENTS))) {\n args[0] = type;\n Y.Event.detach.apply(Y.Event, args);\n return this;\n }\n }\n\n // ce = evts[type];\n ce = evts[parts[1]];\n if (ce) {\n ce.detach(fn, context);\n }\n\n return this;\n },\n\n /**\n * detach a listener\n * @method unsubscribe\n * @deprecated use detach\n */\n unsubscribe: function() {\nY.log('EventTarget unsubscribe() is deprecated, use detach()', 'warn', 'deprecated');\n return this.detach.apply(this, arguments);\n },\n\n /**\n * Removes all listeners from the specified event. If the event type\n * is not specified, all listeners from all hosted custom events will\n * be removed.\n * @method detachAll\n * @param type {String} The type, or name of the event\n */\n detachAll: function(type) {\n return this.detach(type);\n },\n\n /**\n * Removes all listeners from the specified event. If the event type\n * is not specified, all listeners from all hosted custom events will\n * be removed.\n * @method unsubscribeAll\n * @param type {String} The type, or name of the event\n * @deprecated use detachAll\n */\n unsubscribeAll: function() {\nY.log('EventTarget unsubscribeAll() is deprecated, use detachAll()', 'warn', 'deprecated');\n return this.detachAll.apply(this, arguments);\n },\n\n /**\n * Creates a new custom event of the specified type. If a custom event\n * by that name already exists, it will not be re-created. In either\n * case the custom event is returned.\n *\n * @method publish\n *\n * @param type {String} the type, or name of the event\n * @param opts {object} optional config params. Valid properties are:\n *\n * <ul>\n * <li>\n * 'broadcast': whether or not the YUI instance and YUI global are notified when the event is fired (false)\n * </li>\n * <li>\n * 'bubbles': whether or not this event bubbles (true)\n * Events can only bubble if emitFacade is true.\n * </li>\n * <li>\n * 'context': the default execution context for the listeners (this)\n * </li>\n * <li>\n * 'defaultFn': the default function to execute when this event fires if preventDefault was not called\n * </li>\n * <li>\n * 'emitFacade': whether or not this event emits a facade (false)\n * </li>\n * <li>\n * 'prefix': the prefix for this targets events, e.g., 'menu' in 'menu:click'\n * </li>\n * <li>\n * 'fireOnce': if an event is configured to fire once, new subscribers after\n * the fire will be notified immediately.\n * </li>\n * <li>\n * 'async': fireOnce event listeners will fire synchronously if the event has already\n * fired unless async is true.\n * </li>\n * <li>\n * 'preventable': whether or not preventDefault() has an effect (true)\n * </li>\n * <li>\n * 'preventedFn': a function that is executed when preventDefault is called\n * </li>\n * <li>\n * 'queuable': whether or not this event can be queued during bubbling (false)\n * </li>\n * <li>\n * 'silent': if silent is true, debug messages are not provided for this event.\n * </li>\n * <li>\n * 'stoppedFn': a function that is executed when stopPropagation is called\n * </li>\n *\n * <li>\n * 'monitored': specifies whether or not this event should send notifications about\n * when the event has been attached, detached, or published.\n * </li>\n * <li>\n * 'type': the event type (valid option if not provided as the first parameter to publish)\n * </li>\n * </ul>\n *\n * @return {CustomEvent} the custom event\n *\n */\n publish: function(type, opts) {\n var events, ce, ret, defaults,\n edata = this._yuievt,\n pre = edata.config.prefix;\n\n if (L.isObject(type)) {\n ret = {};\n Y.each(type, function(v, k) {\n ret[k] = this.publish(k, v || opts);\n }, this);\n\n return ret;\n }\n\n type = (pre) ? _getType(type, pre) : type;\n\n events = edata.events;\n ce = events[type];\n\n this._monitor('publish', type, {\n args: arguments\n });\n\n if (ce) {\n // ce.log(\"publish applying new config to published event: '\"+type+\"' exists\", 'info', 'event');\n if (opts) {\n ce.applyConfig(opts, true);\n }\n } else {\n // TODO: Lazy publish goes here.\n defaults = edata.defaults;\n\n // apply defaults\n ce = new Y.CustomEvent(type, defaults);\n if (opts) {\n ce.applyConfig(opts, true);\n }\n\n events[type] = ce;\n }\n\n // make sure we turn the broadcast flag off if this\n // event was published as a result of bubbling\n // if (opts instanceof Y.CustomEvent) {\n // events[type].broadcast = false;\n // }\n\n return events[type];\n },\n\n /**\n * This is the entry point for the event monitoring system.\n * You can monitor 'attach', 'detach', 'fire', and 'publish'.\n * When configured, these events generate an event. click ->\n * click_attach, click_detach, click_publish -- these can\n * be subscribed to like other events to monitor the event\n * system. Inividual published events can have monitoring\n * turned on or off (publish can't be turned off before it\n * it published) by setting the events 'monitor' config.\n *\n * @method _monitor\n * @param what {String} 'attach', 'detach', 'fire', or 'publish'\n * @param eventType {String|CustomEvent} The prefixed name of the event being monitored, or the CustomEvent object.\n * @param o {Object} Information about the event interaction, such as\n * fire() args, subscription category, publish config\n * @private\n */\n _monitor: function(what, eventType, o) {\n var monitorevt, ce, type;\n\n if (eventType) {\n if (typeof eventType === \"string\") {\n type = eventType;\n ce = this.getEvent(eventType, true);\n } else {\n ce = eventType;\n type = eventType.type;\n }\n\n if ((this._yuievt.config.monitored && (!ce || ce.monitored)) || (ce && ce.monitored)) {\n monitorevt = type + '_' + what;\n o.monitored = what;\n this.fire.call(this, monitorevt, o);\n }\n }\n },\n\n /**\n * Fire a custom event by name. The callback functions will be executed\n * from the context specified when the event was created, and with the\n * following parameters.\n *\n * If the custom event object hasn't been created, then the event hasn't\n * been published and it has no subscribers. For performance sake, we\n * immediate exit in this case. This means the event won't bubble, so\n * if the intention is that a bubble target be notified, the event must\n * be published on this object first.\n *\n * The first argument is the event type, and any additional arguments are\n * passed to the listeners as parameters. If the first of these is an\n * object literal, and the event is configured to emit an event facade,\n * that object is mixed into the event facade and the facade is provided\n * in place of the original object.\n *\n * @method fire\n * @param type {String|Object} The type of the event, or an object that contains\n * a 'type' property.\n * @param arguments {Object*} an arbitrary set of parameters to pass to\n * the handler. If the first of these is an object literal and the event is\n * configured to emit an event facade, the event facade will replace that\n * parameter after the properties the object literal contains are copied to\n * the event facade.\n * @return {EventTarget} the event host\n */\n fire: function(type) {\n\n var typeIncluded = L.isString(type),\n t = (typeIncluded) ? type : (type && type.type),\n yuievt = this._yuievt,\n pre = yuievt.config.prefix, \n ce, ret, \n ce2,\n args = (typeIncluded) ? nativeSlice.call(arguments, 1) : arguments;\n\n t = (pre) ? _getType(t, pre) : t;\n\n ce = this.getEvent(t, true);\n ce2 = this.getSibling(t, ce);\n\n if (ce2 && !ce) {\n ce = this.publish(t);\n }\n\n this._monitor('fire', (ce || t), {\n args: args\n });\n\n // this event has not been published or subscribed to\n if (!ce) {\n if (yuievt.hasTargets) {\n return this.bubble({ type: t }, args, this);\n }\n\n // otherwise there is nothing to be done\n ret = true;\n } else {\n ce.sibling = ce2;\n ret = ce.fire.apply(ce, args);\n }\n\n return (yuievt.chain) ? this : ret;\n },\n\n getSibling: function(type, ce) {\n var ce2;\n // delegate to *:type events if there are subscribers\n if (type.indexOf(PREFIX_DELIMITER) > -1) {\n type = _wildType(type);\n // console.log(type);\n ce2 = this.getEvent(type, true);\n if (ce2) {\n // console.log(\"GOT ONE: \" + type);\n ce2.applyConfig(ce);\n ce2.bubbles = false;\n ce2.broadcast = 0;\n // ret = ce2.fire.apply(ce2, a);\n }\n }\n\n return ce2;\n },\n\n /**\n * Returns the custom event of the provided type has been created, a\n * falsy value otherwise\n * @method getEvent\n * @param type {String} the type, or name of the event\n * @param prefixed {String} if true, the type is prefixed already\n * @return {CustomEvent} the custom event or null\n */\n getEvent: function(type, prefixed) {\n var pre, e;\n if (!prefixed) {\n pre = this._yuievt.config.prefix;\n type = (pre) ? _getType(type, pre) : type;\n }\n e = this._yuievt.events;\n return e[type] || null;\n },\n\n /**\n * Subscribe to a custom event hosted by this object. The\n * supplied callback will execute after any listeners add\n * via the subscribe method, and after the default function,\n * if configured for the event, has executed.\n *\n * @method after\n * @param {String} type The name of the event\n * @param {Function} fn The callback to execute in response to the event\n * @param {Object} [context] Override `this` object in callback\n * @param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n * @return {EventHandle} A subscription handle capable of detaching the\n * subscription\n */\n after: function(type, fn) {\n\n var a = nativeSlice.call(arguments, 0);\n\n switch (L.type(type)) {\n case 'function':\n return Y.Do.after.apply(Y.Do, arguments);\n case 'array':\n // YArray.each(a[0], function(v) {\n // v = AFTER_PREFIX + v;\n // });\n // break;\n case 'object':\n a[0]._after = true;\n break;\n default:\n a[0] = AFTER_PREFIX + type;\n }\n\n return this.on.apply(this, a);\n\n },\n\n /**\n * Executes the callback before a DOM event, custom event\n * or method. If the first argument is a function, it\n * is assumed the target is a method. For DOM and custom\n * events, this is an alias for Y.on.\n *\n * For DOM and custom events:\n * type, callback, context, 0-n arguments\n *\n * For methods:\n * callback, object (method host), methodName, context, 0-n arguments\n *\n * @method before\n * @return detach handle\n */\n before: function() {\n return this.on.apply(this, arguments);\n }\n\n};\n\nY.EventTarget = ET;\n\n// make Y an event target\nY.mix(Y, ET.prototype);\nET.call(Y, { bubbles: false });\n\nYUI.Env.globalEvents = YUI.Env.globalEvents || new ET();\n\n/**\n * Hosts YUI page level events. This is where events bubble to\n * when the broadcast config is set to 2. This property is\n * only available if the custom event module is loaded.\n * @property Global\n * @type EventTarget\n * @for YUI\n */\nY.Global = YUI.Env.globalEvents;\n\n// @TODO implement a global namespace function on Y.Global?\n\n/**\n`Y.on()` can do many things:\n\n<ul>\n <li>Subscribe to custom events `publish`ed and `fire`d from Y</li>\n <li>Subscribe to custom events `publish`ed with `broadcast` 1 or 2 and\n `fire`d from any object in the YUI instance sandbox</li>\n <li>Subscribe to DOM events</li>\n <li>Subscribe to the execution of a method on any object, effectively\n treating that method as an event</li>\n</ul>\n\nFor custom event subscriptions, pass the custom event name as the first argument and callback as the second. The `this` object in the callback will be `Y` unless an override is passed as the third argument.\n\n Y.on('io:complete', function () {\n Y.MyApp.updateStatus('Transaction complete');\n });\n\nTo subscribe to DOM events, pass the name of a DOM event as the first argument\nand a CSS selector string as the third argument after the callback function.\nAlternately, the third argument can be a `Node`, `NodeList`, `HTMLElement`,\narray, or simply omitted (the default is the `window` object).\n\n Y.on('click', function (e) {\n e.preventDefault();\n\n // proceed with ajax form submission\n var url = this.get('action');\n ...\n }, '#my-form');\n\nThe `this` object in DOM event callbacks will be the `Node` targeted by the CSS\nselector or other identifier.\n\n`on()` subscribers for DOM events or custom events `publish`ed with a\n`defaultFn` can prevent the default behavior with `e.preventDefault()` from the\nevent object passed as the first parameter to the subscription callback.\n\nTo subscribe to the execution of an object method, pass arguments corresponding to the call signature for \n<a href=\"../classes/Do.html#methods_before\">`Y.Do.before(...)`</a>.\n\nNOTE: The formal parameter list below is for events, not for function\ninjection. See `Y.Do.before` for that signature.\n\n@method on\n@param {String} type DOM or custom event name\n@param {Function} fn The callback to execute in response to the event\n@param {Object} [context] Override `this` object in callback\n@param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n@return {EventHandle} A subscription handle capable of detaching the\n subscription\n@see Do.before\n@for YUI\n**/\n\n/**\nListen for an event one time. Equivalent to `on()`, except that\nthe listener is immediately detached when executed.\n\nSee the <a href=\"#methods_on\">`on()` method</a> for additional subscription\noptions.\n\n@see on\n@method once\n@param {String} type DOM or custom event name\n@param {Function} fn The callback to execute in response to the event\n@param {Object} [context] Override `this` object in callback\n@param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n@return {EventHandle} A subscription handle capable of detaching the\n subscription\n@for YUI\n**/\n\n/**\nListen for an event one time. Equivalent to `once()`, except, like `after()`,\nthe subscription callback executes after all `on()` subscribers and the event's\n`defaultFn` (if configured) have executed. Like `after()` if any `on()` phase\nsubscriber calls `e.preventDefault()`, neither the `defaultFn` nor the `after()`\nsubscribers will execute.\n\nThe listener is immediately detached when executed.\n\nSee the <a href=\"#methods_on\">`on()` method</a> for additional subscription\noptions.\n\n@see once\n@method onceAfter\n@param {String} type The custom event name\n@param {Function} fn The callback to execute in response to the event\n@param {Object} [context] Override `this` object in callback\n@param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n@return {EventHandle} A subscription handle capable of detaching the\n subscription\n@for YUI\n**/\n\n/**\nLike `on()`, this method creates a subscription to a custom event or to the\nexecution of a method on an object.\n\nFor events, `after()` subscribers are executed after the event's\n`defaultFn` unless `e.preventDefault()` was called from an `on()` subscriber.\n\nSee the <a href=\"#methods_on\">`on()` method</a> for additional subscription\noptions.\n\nNOTE: The subscription signature shown is for events, not for function\ninjection. See <a href=\"../classes/Do.html#methods_after\">`Y.Do.after`</a>\nfor that signature.\n\n@see on\n@see Do.after\n@method after\n@param {String} type The custom event name\n@param {Function} fn The callback to execute in response to the event\n@param {Object} [context] Override `this` object in callback\n@param {Any} [args*] 0..n additional arguments to supply to the subscriber\n@return {EventHandle} A subscription handle capable of detaching the\n subscription\n@for YUI\n**/\n\n\n}, '@VERSION@', {\"requires\": [\"oop\"]});\nYUI.add('event-custom-complex', function (Y, NAME) {\n\n\n/**\n * Adds event facades, preventable default behavior, and bubbling.\n * events.\n * @module event-custom\n * @submodule event-custom-complex\n */\n\nvar FACADE,\n FACADE_KEYS,\n key,\n EMPTY = {},\n CEProto = Y.CustomEvent.prototype,\n ETProto = Y.EventTarget.prototype, \n\n mixFacadeProps = function(facade, payload) {\n var p;\n\n for (p in payload) {\n if (!(FACADE_KEYS.hasOwnProperty(p))) {\n facade[p] = payload[p];\n }\n }\n };\n\n/**\n * Wraps and protects a custom event for use when emitFacade is set to true.\n * Requires the event-custom-complex module\n * @class EventFacade\n * @param e {Event} the custom event\n * @param currentTarget {HTMLElement} the element the listener was attached to\n */\n\nY.EventFacade = function(e, currentTarget) {\n\n e = e || EMPTY;\n\n this._event = e;\n\n /**\n * The arguments passed to fire\n * @property details\n * @type Array\n */\n this.details = e.details;\n\n /**\n * The event type, this can be overridden by the fire() payload\n * @property type\n * @type string\n */\n this.type = e.type;\n\n /**\n * The real event type\n * @property _type\n * @type string\n * @private\n */\n this._type = e.type;\n\n //////////////////////////////////////////////////////\n\n /**\n * Node reference for the targeted eventtarget\n * @property target\n * @type Node\n */\n this.target = e.target;\n\n /**\n * Node reference for the element that the listener was attached to.\n * @property currentTarget\n * @type Node\n */\n this.currentTarget = currentTarget;\n\n /**\n * Node reference to the relatedTarget\n * @property relatedTarget\n * @type Node\n */\n this.relatedTarget = e.relatedTarget;\n\n};\n\nY.mix(Y.EventFacade.prototype, {\n\n /**\n * Stops the propagation to the next bubble target\n * @method stopPropagation\n */\n stopPropagation: function() {\n this._event.stopPropagation();\n this.stopped = 1;\n },\n\n /**\n * Stops the propagation to the next bubble target and\n * prevents any additional listeners from being exectued\n * on the current target.\n * @method stopImmediatePropagation\n */\n stopImmediatePropagation: function() {\n this._event.stopImmediatePropagation();\n this.stopped = 2;\n },\n\n /**\n * Prevents the event's default behavior\n * @method preventDefault\n */\n preventDefault: function() {\n this._event.preventDefault();\n this.prevented = 1;\n },\n\n /**\n * Stops the event propagation and prevents the default\n * event behavior.\n * @method halt\n * @param immediate {boolean} if true additional listeners\n * on the current target will not be executed\n */\n halt: function(immediate) {\n this._event.halt(immediate);\n this.prevented = 1;\n this.stopped = (immediate) ? 2 : 1;\n }\n\n});\n\nCEProto.fireComplex = function(args) {\n\n var es, ef, q, queue, ce, ret, events, subs, postponed,\n self = this, host = self.host || self, next, oldbubble;\n\n if (self.stack) {\n // queue this event if the current item in the queue bubbles\n if (self.queuable && self.type != self.stack.next.type) {\n self.log('queue ' + self.type);\n self.stack.queue.push([self, args]);\n return true;\n }\n }\n\n es = self.stack || {\n // id of the first event in the stack\n id: self.id,\n next: self,\n silent: self.silent,\n stopped: 0,\n prevented: 0,\n bubbling: null,\n type: self.type,\n // defaultFnQueue: new Y.Queue(),\n afterQueue: new Y.Queue(),\n defaultTargetOnly: self.defaultTargetOnly,\n queue: []\n };\n\n subs = self.getSubs();\n\n self.stopped = (self.type !== es.type) ? 0 : es.stopped;\n self.prevented = (self.type !== es.type) ? 0 : es.prevented;\n\n self.target = self.target || host;\n\n if (self.stoppedFn) {\n events = new Y.EventTarget({\n fireOnce: true,\n context: host\n });\n \n self.events = events;\n\n events.on('stopped', self.stoppedFn);\n }\n\n self.currentTarget = host;\n\n self.details = args.slice(); // original arguments in the details\n\n // self.log(\"Firing \" + self + \", \" + \"args: \" + args);\n self.log(\"Firing \" + self.type);\n\n self._facade = null; // kill facade to eliminate stale properties\n\n ef = self._getFacade(args);\n\n if (Y.Lang.isObject(args[0])) {\n args[0] = ef;\n } else {\n args.unshift(ef);\n }\n\n if (subs[0]) {\n self._procSubs(subs[0], args, ef);\n }\n\n // bubble if this is hosted in an event target and propagation has not been stopped\n if (self.bubbles && host.bubble && !self.stopped) {\n\n oldbubble = es.bubbling;\n\n es.bubbling = self.type;\n\n if (es.type != self.type) {\n es.stopped = 0;\n es.prevented = 0;\n }\n\n ret = host.bubble(self, args, null, es);\n\n self.stopped = Math.max(self.stopped, es.stopped);\n self.prevented = Math.max(self.prevented, es.prevented);\n\n es.bubbling = oldbubble;\n }\n\n if (self.prevented) {\n if (self.preventedFn) {\n self.preventedFn.apply(host, args);\n }\n } else if (self.defaultFn &&\n ((!self.defaultTargetOnly && !es.defaultTargetOnly) ||\n host === ef.target)) {\n self.defaultFn.apply(host, args);\n }\n\n // broadcast listeners are fired as discreet events on the\n // YUI instance and potentially the YUI global.\n self._broadcast(args);\n\n // Queue the after\n if (subs[1] && !self.prevented && self.stopped < 2) {\n if (es.id === self.id || self.type != host._yuievt.bubbling) {\n self._procSubs(subs[1], args, ef);\n while ((next = es.afterQueue.last())) {\n next();\n }\n } else {\n postponed = subs[1];\n if (es.execDefaultCnt) {\n postponed = Y.merge(postponed);\n Y.each(postponed, function(s) {\n s.postponed = true;\n });\n }\n\n es.afterQueue.add(function() {\n self._procSubs(postponed, args, ef);\n });\n }\n }\n\n self.target = null;\n\n if (es.id === self.id) {\n queue = es.queue;\n\n while (queue.length) {\n q = queue.pop();\n ce = q[0];\n // set up stack to allow the next item to be processed\n es.next = ce;\n ce.fire.apply(ce, q[1]);\n }\n\n self.stack = null;\n }\n\n ret = !(self.stopped);\n\n if (self.type != host._yuievt.bubbling) {\n es.stopped = 0;\n es.prevented = 0;\n self.stopped = 0;\n self.prevented = 0;\n }\n\n // Kill the cached facade to free up memory.\n // Otherwise we have the facade from the last fire, sitting around forever.\n self._facade = null;\n\n return ret;\n};\n\nCEProto._getFacade = function() {\n\n var ef = this._facade, o,\n args = this.details;\n\n if (!ef) {\n ef = new Y.EventFacade(this, this.currentTarget);\n }\n\n // if the first argument is an object literal, apply the\n // properties to the event facade\n o = args && args[0];\n\n if (Y.Lang.isObject(o, true)) {\n\n // protect the event facade properties\n mixFacadeProps(ef, o);\n\n // Allow the event type to be faked\n // http://yuilibrary.com/projects/yui3/ticket/2528376\n ef.type = o.type || ef.type;\n }\n\n // update the details field with the arguments\n // ef.type = this.type;\n ef.details = this.details;\n\n // use the original target when the event bubbled to this target\n ef.target = this.originalTarget || this.target;\n\n ef.currentTarget = this.currentTarget;\n ef.stopped = 0;\n ef.prevented = 0;\n\n this._facade = ef;\n\n return this._facade;\n};\n\n/**\n * Stop propagation to bubble targets\n * @for CustomEvent\n * @method stopPropagation\n */\nCEProto.stopPropagation = function() {\n this.stopped = 1;\n if (this.stack) {\n this.stack.stopped = 1;\n }\n if (this.events) {\n this.events.fire('stopped', this);\n }\n};\n\n/**\n * Stops propagation to bubble targets, and prevents any remaining\n * subscribers on the current target from executing.\n * @method stopImmediatePropagation\n */\nCEProto.stopImmediatePropagation = function() {\n this.stopped = 2;\n if (this.stack) {\n this.stack.stopped = 2;\n }\n if (this.events) {\n this.events.fire('stopped', this);\n }\n};\n\n/**\n * Prevents the execution of this event's defaultFn\n * @method preventDefault\n */\nCEProto.preventDefault = function() {\n if (this.preventable) {\n this.prevented = 1;\n if (this.stack) {\n this.stack.prevented = 1;\n }\n }\n};\n\n/**\n * Stops the event propagation and prevents the default\n * event behavior.\n * @method halt\n * @param immediate {boolean} if true additional listeners\n * on the current target will not be executed\n */\nCEProto.halt = function(immediate) {\n if (immediate) {\n this.stopImmediatePropagation();\n } else {\n this.stopPropagation();\n }\n this.preventDefault();\n};\n\n/**\n * Registers another EventTarget as a bubble target. Bubble order\n * is determined by the order registered. Multiple targets can\n * be specified.\n *\n * Events can only bubble if emitFacade is true.\n *\n * Included in the event-custom-complex submodule.\n *\n * @method addTarget\n * @param o {EventTarget} the target to add\n * @for EventTarget\n */\nETProto.addTarget = function(o) {\n this._yuievt.targets[Y.stamp(o)] = o;\n this._yuievt.hasTargets = true;\n};\n\n/**\n * Returns an array of bubble targets for this object.\n * @method getTargets\n * @return EventTarget[]\n */\nETProto.getTargets = function() {\n return Y.Object.values(this._yuievt.targets);\n};\n\n/**\n * Removes a bubble target\n * @method removeTarget\n * @param o {EventTarget} the target to remove\n * @for EventTarget\n */\nETProto.removeTarget = function(o) {\n delete this._yuievt.targets[Y.stamp(o)];\n};\n\n/**\n * Propagate an event. Requires the event-custom-complex module.\n * @method bubble\n * @param evt {CustomEvent} the custom event to propagate\n * @return {boolean} the aggregated return value from Event.Custom.fire\n * @for EventTarget\n */\nETProto.bubble = function(evt, args, target, es) {\n\n var targs = this._yuievt.targets, ret = true,\n t, type = evt && evt.type, ce, i, bc, ce2,\n originalTarget = target || (evt && evt.target) || this,\n oldbubble;\n\n if (!evt || ((!evt.stopped) && targs)) {\n\n // Y.log('Bubbling ' + evt.type);\n for (i in targs) {\n if (targs.hasOwnProperty(i)) {\n t = targs[i];\n ce = t.getEvent(type, true);\n ce2 = t.getSibling(type, ce);\n\n if (ce2 && !ce) {\n ce = t.publish(type);\n }\n\n oldbubble = t._yuievt.bubbling;\n t._yuievt.bubbling = type;\n\n // if this event was not published on the bubble target,\n // continue propagating the event.\n if (!ce) {\n if (t._yuievt.hasTargets) {\n t.bubble(evt, args, originalTarget, es);\n }\n } else {\n\n ce.sibling = ce2;\n\n // set the original target to that the target payload on the\n // facade is correct.\n ce.target = originalTarget;\n ce.originalTarget = originalTarget;\n ce.currentTarget = t;\n bc = ce.broadcast;\n ce.broadcast = false;\n\n // default publish may not have emitFacade true -- that\n // shouldn't be what the implementer meant to do\n ce.emitFacade = true;\n\n ce.stack = es;\n\n ret = ret && ce.fire.apply(ce, args || evt.details || []);\n ce.broadcast = bc;\n ce.originalTarget = null;\n\n // stopPropagation() was called\n if (ce.stopped) {\n break;\n }\n }\n\n t._yuievt.bubbling = oldbubble;\n }\n }\n }\n\n return ret;\n};\n\nFACADE = new Y.EventFacade();\nFACADE_KEYS = {};\n\n// Flatten whitelist\nfor (key in FACADE) {\n FACADE_KEYS[key] = true;\n}\n\n}, '@VERSION@', {\"requires\": [\"event-custom-base\"]});\nYUI.add('node-core', function (Y, NAME) {\n\n/**\n * The Node Utility provides a DOM-like interface for interacting with DOM nodes.\n * @module node\n * @main node\n * @submodule node-core\n */\n\n/**\n * The Node class provides a wrapper for manipulating DOM Nodes.\n * Node properties can be accessed via the set/get methods.\n * Use `Y.one()` to retrieve Node instances.\n *\n * <strong>NOTE:</strong> Node properties are accessed using\n * the <code>set</code> and <code>get</code> methods.\n *\n * @class Node\n * @constructor\n * @param {DOMNode} node the DOM node to be mapped to the Node instance.\n * @uses EventTarget\n */\n\n// \"globals\"\nvar DOT = '.',\n NODE_NAME = 'nodeName',\n NODE_TYPE = 'nodeType',\n OWNER_DOCUMENT = 'ownerDocument',\n TAG_NAME = 'tagName',\n UID = '_yuid',\n EMPTY_OBJ = {},\n\n _slice = Array.prototype.slice,\n\n Y_DOM = Y.DOM,\n\n Y_Node = function(node) {\n if (!this.getDOMNode) { // support optional \"new\"\n return new Y_Node(node);\n }\n\n if (typeof node == 'string') {\n node = Y_Node._fromString(node);\n if (!node) {\n return null; // NOTE: return\n }\n }\n\n var uid = (node.nodeType !== 9) ? node.uniqueID : node[UID];\n\n if (uid && Y_Node._instances[uid] && Y_Node._instances[uid]._node !== node) {\n node[UID] = null; // unset existing uid to prevent collision (via clone or hack)\n }\n\n uid = uid || Y.stamp(node);\n if (!uid) { // stamp failed; likely IE non-HTMLElement\n uid = Y.guid();\n }\n\n this[UID] = uid;\n\n /**\n * The underlying DOM node bound to the Y.Node instance\n * @property _node\n * @type DOMNode\n * @private\n */\n this._node = node;\n\n this._stateProxy = node; // when augmented with Attribute\n\n if (this._initPlugins) { // when augmented with Plugin.Host\n this._initPlugins();\n }\n },\n\n // used with previous/next/ancestor tests\n _wrapFn = function(fn) {\n var ret = null;\n if (fn) {\n ret = (typeof fn == 'string') ?\n function(n) {\n return Y.Selector.test(n, fn);\n } :\n function(n) {\n return fn(Y.one(n));\n };\n }\n\n return ret;\n };\n// end \"globals\"\n\nY_Node.ATTRS = {};\nY_Node.DOM_EVENTS = {};\n\nY_Node._fromString = function(node) {\n if (node) {\n if (node.indexOf('doc') === 0) { // doc OR document\n node = Y.config.doc;\n } else if (node.indexOf('win') === 0) { // win OR window\n node = Y.config.win;\n } else {\n node = Y.Selector.query(node, null, true);\n }\n }\n\n return node || null;\n};\n\n/**\n * The name of the component\n * @static\n * @type String\n * @property NAME\n */\nY_Node.NAME = 'node';\n\n/*\n * The pattern used to identify ARIA attributes\n */\nY_Node.re_aria = /^(?:role$|aria-)/;\n\nY_Node.SHOW_TRANSITION = 'fadeIn';\nY_Node.HIDE_TRANSITION = 'fadeOut';\n\n/**\n * A list of Node instances that have been created\n * @private\n * @type Object\n * @property _instances\n * @static\n *\n */\nY_Node._instances = {};\n\n/**\n * Retrieves the DOM node bound to a Node instance\n * @method getDOMNode\n * @static\n *\n * @param {Node | HTMLNode} node The Node instance or an HTMLNode\n * @return {HTMLNode} The DOM node bound to the Node instance. If a DOM node is passed\n * as the node argument, it is simply returned.\n */\nY_Node.getDOMNode = function(node) {\n if (node) {\n return (node.nodeType) ? node : node._node || null;\n }\n return null;\n};\n\n/**\n * Checks Node return values and wraps DOM Nodes as Y.Node instances\n * and DOM Collections / Arrays as Y.NodeList instances.\n * Other return values just pass thru. If undefined is returned (e.g. no return)\n * then the Node instance is returned for chainability.\n * @method scrubVal\n * @static\n *\n * @param {any} node The Node instance or an HTMLNode\n * @return {Node | NodeList | Any} Depends on what is returned from the DOM node.\n */\nY_Node.scrubVal = function(val, node) {\n if (val) { // only truthy values are risky\n if (typeof val == 'object' || typeof val == 'function') { // safari nodeList === function\n if (NODE_TYPE in val || Y_DOM.isWindow(val)) {// node || window\n val = Y.one(val);\n } else if ((val.item && !val._nodes) || // dom collection or Node instance\n (val[0] && val[0][NODE_TYPE])) { // array of DOM Nodes\n val = Y.all(val);\n }\n }\n } else if (typeof val === 'undefined') {\n val = node; // for chaining\n } else if (val === null) {\n val = null; // IE: DOM null not the same as null\n }\n\n return val;\n};\n\n/**\n * Adds methods to the Y.Node prototype, routing through scrubVal.\n * @method addMethod\n * @static\n *\n * @param {String} name The name of the method to add\n * @param {Function} fn The function that becomes the method\n * @param {Object} context An optional context to call the method with\n * (defaults to the Node instance)\n * @return {any} Depends on what is returned from the DOM node.\n */\nY_Node.addMethod = function(name, fn, context) {\n if (name && fn && typeof fn == 'function') {\n Y_Node.prototype[name] = function() {\n var args = _slice.call(arguments),\n node = this,\n ret;\n\n if (args[0] && args[0]._node) {\n args[0] = args[0]._node;\n }\n\n if (args[1] && args[1]._node) {\n args[1] = args[1]._node;\n }\n args.unshift(node._node);\n\n ret = fn.apply(node, args);\n\n if (ret) { // scrub truthy\n ret = Y_Node.scrubVal(ret, node);\n }\n\n (typeof ret != 'undefined') || (ret = node);\n return ret;\n };\n } else {\n Y.log('unable to add method: ' + name, 'warn', 'Node');\n }\n};\n\n/**\n * Imports utility methods to be added as Y.Node methods.\n * @method importMethod\n * @static\n *\n * @param {Object} host The object that contains the method to import.\n * @param {String} name The name of the method to import\n * @param {String} altName An optional name to use in place of the host name\n * @param {Object} context An optional context to call the method with\n */\nY_Node.importMethod = function(host, name, altName) {\n if (typeof name == 'string') {\n altName = altName || name;\n Y_Node.addMethod(altName, host[name], host);\n } else {\n Y.Array.each(name, function(n) {\n Y_Node.importMethod(host, n);\n });\n }\n};\n\n/**\n * Retrieves a NodeList based on the given CSS selector.\n * @method all\n *\n * @param {string} selector The CSS selector to test against.\n * @return {NodeList} A NodeList instance for the matching HTMLCollection/Array.\n * @for YUI\n */\n\n/**\n * Returns a single Node instance bound to the node or the\n * first element matching the given selector. Returns null if no match found.\n * <strong>Note:</strong> For chaining purposes you may want to\n * use <code>Y.all</code>, which returns a NodeList when no match is found.\n * @method one\n * @param {String | HTMLElement} node a node or Selector\n * @return {Node | null} a Node instance or null if no match found.\n * @for YUI\n */\n\n/**\n * Returns a single Node instance bound to the node or the\n * first element matching the given selector. Returns null if no match found.\n * <strong>Note:</strong> For chaining purposes you may want to\n * use <code>Y.all</code>, which returns a NodeList when no match is found.\n * @method one\n * @static\n * @param {String | HTMLElement} node a node or Selector\n * @return {Node | null} a Node instance or null if no match found.\n * @for Node\n */\nY_Node.one = function(node) {\n var instance = null,\n cachedNode,\n uid;\n\n if (node) {\n if (typeof node == 'string') {\n node = Y_Node._fromString(node);\n if (!node) {\n return null; // NOTE: return\n }\n } else if (node.getDOMNode) {\n return node; // NOTE: return\n }\n\n if (node.nodeType || Y.DOM.isWindow(node)) { // avoid bad input (numbers, boolean, etc)\n uid = (node.uniqueID && node.nodeType !== 9) ? node.uniqueID : node._yuid;\n instance = Y_Node._instances[uid]; // reuse exising instances\n cachedNode = instance ? instance._node : null;\n if (!instance || (cachedNode && node !== cachedNode)) { // new Node when nodes don't match\n instance = new Y_Node(node);\n if (node.nodeType != 11) { // dont cache document fragment\n Y_Node._instances[instance[UID]] = instance; // cache node\n }\n }\n }\n }\n\n return instance;\n};\n\n/**\n * The default setter for DOM properties\n * Called with instance context (this === the Node instance)\n * @method DEFAULT_SETTER\n * @static\n * @param {String} name The attribute/property being set\n * @param {any} val The value to be set\n * @return {any} The value\n */\nY_Node.DEFAULT_SETTER = function(name, val) {\n var node = this._stateProxy,\n strPath;\n\n if (name.indexOf(DOT) > -1) {\n strPath = name;\n name = name.split(DOT);\n // only allow when defined on node\n Y.Object.setValue(node, name, val);\n } else if (typeof node[name] != 'undefined') { // pass thru DOM properties\n node[name] = val;\n }\n\n return val;\n};\n\n/**\n * The default getter for DOM properties\n * Called with instance context (this === the Node instance)\n * @method DEFAULT_GETTER\n * @static\n * @param {String} name The attribute/property to look up\n * @return {any} The current value\n */\nY_Node.DEFAULT_GETTER = function(name) {\n var node = this._stateProxy,\n val;\n\n if (name.indexOf && name.indexOf(DOT) > -1) {\n val = Y.Object.getValue(node, name.split(DOT));\n } else if (typeof node[name] != 'undefined') { // pass thru from DOM\n val = node[name];\n }\n\n return val;\n};\n\nY.mix(Y_Node.prototype, {\n DATA_PREFIX: 'data-',\n\n /**\n * The method called when outputting Node instances as strings\n * @method toString\n * @return {String} A string representation of the Node instance\n */\n toString: function() {\n var str = this[UID] + ': not bound to a node',\n node = this._node,\n attrs, id, className;\n\n if (node) {\n attrs = node.attributes;\n id = (attrs && attrs.id) ? node.getAttribute('id') : null;\n className = (attrs && attrs.className) ? node.getAttribute('className') : null;\n str = node[NODE_NAME];\n\n if (id) {\n str += '#' + id;\n }\n\n if (className) {\n str += '.' + className.replace(' ', '.');\n }\n\n // TODO: add yuid?\n str += ' ' + this[UID];\n }\n return str;\n },\n\n /**\n * Returns an attribute value on the Node instance.\n * Unless pre-configured (via `Node.ATTRS`), get hands\n * off to the underlying DOM node. Only valid\n * attributes/properties for the node will be queried.\n * @method get\n * @param {String} attr The attribute\n * @return {any} The current value of the attribute\n */\n get: function(attr) {\n var val;\n\n if (this._getAttr) { // use Attribute imple\n val = this._getAttr(attr);\n } else {\n val = this._get(attr);\n }\n\n if (val) {\n val = Y_Node.scrubVal(val, this);\n } else if (val === null) {\n val = null; // IE: DOM null is not true null (even though they ===)\n }\n return val;\n },\n\n /**\n * Helper method for get.\n * @method _get\n * @private\n * @param {String} attr The attribute\n * @return {any} The current value of the attribute\n */\n _get: function(attr) {\n var attrConfig = Y_Node.ATTRS[attr],\n val;\n\n if (attrConfig && attrConfig.getter) {\n val = attrConfig.getter.call(this);\n } else if (Y_Node.re_aria.test(attr)) {\n val = this._node.getAttribute(attr, 2);\n } else {\n val = Y_Node.DEFAULT_GETTER.apply(this, arguments);\n }\n\n return val;\n },\n\n /**\n * Sets an attribute on the Node instance.\n * Unless pre-configured (via Node.ATTRS), set hands\n * off to the underlying DOM node. Only valid\n * attributes/properties for the node will be set.\n * To set custom attributes use setAttribute.\n * @method set\n * @param {String} attr The attribute to be set.\n * @param {any} val The value to set the attribute to.\n * @chainable\n */\n set: function(attr, val) {\n var attrConfig = Y_Node.ATTRS[attr];\n\n if (this._setAttr) { // use Attribute imple\n this._setAttr.apply(this, arguments);\n } else { // use setters inline\n if (attrConfig && attrConfig.setter) {\n attrConfig.setter.call(this, val, attr);\n } else if (Y_Node.re_aria.test(attr)) { // special case Aria\n this._node.setAttribute(attr, val);\n } else {\n Y_Node.DEFAULT_SETTER.apply(this, arguments);\n }\n }\n\n return this;\n },\n\n /**\n * Sets multiple attributes.\n * @method setAttrs\n * @param {Object} attrMap an object of name/value pairs to set\n * @chainable\n */\n setAttrs: function(attrMap) {\n if (this._setAttrs) { // use Attribute imple\n this._setAttrs(attrMap);\n } else { // use setters inline\n Y.Object.each(attrMap, function(v, n) {\n this.set(n, v);\n }, this);\n }\n\n return this;\n },\n\n /**\n * Returns an object containing the values for the requested attributes.\n * @method getAttrs\n * @param {Array} attrs an array of attributes to get values\n * @return {Object} An object with attribute name/value pairs.\n */\n getAttrs: function(attrs) {\n var ret = {};\n if (this._getAttrs) { // use Attribute imple\n this._getAttrs(attrs);\n } else { // use setters inline\n Y.Array.each(attrs, function(v, n) {\n ret[v] = this.get(v);\n }, this);\n }\n\n return ret;\n },\n\n /**\n * Compares nodes to determine if they match.\n * Node instances can be compared to each other and/or HTMLElements.\n * @method compareTo\n * @param {HTMLElement | Node} refNode The reference node to compare to the node.\n * @return {Boolean} True if the nodes match, false if they do not.\n */\n compareTo: function(refNode) {\n var node = this._node;\n\n if (refNode && refNode._node) {\n refNode = refNode._node;\n }\n return node === refNode;\n },\n\n /**\n * Determines whether the node is appended to the document.\n * @method inDoc\n * @param {Node|HTMLElement} doc optional An optional document to check against.\n * Defaults to current document.\n * @return {Boolean} Whether or not this node is appended to the document.\n */\n inDoc: function(doc) {\n var node = this._node;\n doc = (doc) ? doc._node || doc : node[OWNER_DOCUMENT];\n if (doc.documentElement) {\n return Y_DOM.contains(doc.documentElement, node);\n }\n },\n\n getById: function(id) {\n var node = this._node,\n ret = Y_DOM.byId(id, node[OWNER_DOCUMENT]);\n if (ret && Y_DOM.contains(node, ret)) {\n ret = Y.one(ret);\n } else {\n ret = null;\n }\n return ret;\n },\n\n /**\n * Returns the nearest ancestor that passes the test applied by supplied boolean method.\n * @method ancestor\n * @param {String | Function} fn A selector string or boolean method for testing elements.\n * If a function is used, it receives the current node being tested as the only argument.\n * If fn is not passed as an argument, the parent node will be returned.\n * @param {Boolean} testSelf optional Whether or not to include the element in the scan\n * @param {String | Function} stopFn optional A selector string or boolean\n * method to indicate when the search should stop. The search bails when the function\n * returns true or the selector matches.\n * If a function is used, it receives the current node being tested as the only argument.\n * @return {Node} The matching Node instance or null if not found\n */\n ancestor: function(fn, testSelf, stopFn) {\n // testSelf is optional, check for stopFn as 2nd arg\n if (arguments.length === 2 &&\n (typeof testSelf == 'string' || typeof testSelf == 'function')) {\n stopFn = testSelf;\n }\n\n return Y.one(Y_DOM.ancestor(this._node, _wrapFn(fn), testSelf, _wrapFn(stopFn)));\n },\n\n /**\n * Returns the ancestors that pass the test applied by supplied boolean method.\n * @method ancestors\n * @param {String | Function} fn A selector string or boolean method for testing elements.\n * @param {Boolean} testSelf optional Whether or not to include the element in the scan\n * If a function is used, it receives the current node being tested as the only argument.\n * @return {NodeList} A NodeList instance containing the matching elements\n */\n ancestors: function(fn, testSelf, stopFn) {\n if (arguments.length === 2 &&\n (typeof testSelf == 'string' || typeof testSelf == 'function')) {\n stopFn = testSelf;\n }\n return Y.all(Y_DOM.ancestors(this._node, _wrapFn(fn), testSelf, _wrapFn(stopFn)));\n },\n\n /**\n * Returns the previous matching sibling.\n * Returns the nearest element node sibling if no method provided.\n * @method previous\n * @param {String | Function} fn A selector or boolean method for testing elements.\n * If a function is used, it receives the current node being tested as the only argument.\n * @return {Node} Node instance or null if not found\n */\n previous: function(fn, all) {\n return Y.one(Y_DOM.elementByAxis(this._node, 'previousSibling', _wrapFn(fn), all));\n },\n\n /**\n * Returns the next matching sibling.\n * Returns the nearest element node sibling if no method provided.\n * @method next\n * @param {String | Function} fn A selector or boolean method for testing elements.\n * If a function is used, it receives the current node being tested as the only argument.\n * @return {Node} Node instance or null if not found\n */\n next: function(fn, all) {\n return Y.one(Y_DOM.elementByAxis(this._node, 'nextSibling', _wrapFn(fn), all));\n },\n\n /**\n * Returns all matching siblings.\n * Returns all siblings if no method provided.\n * @method siblings\n * @param {String | Function} fn A selector or boolean method for testing elements.\n * If a function is used, it receives the current node being tested as the only argument.\n * @return {NodeList} NodeList instance bound to found siblings\n */\n siblings: function(fn) {\n return Y.all(Y_DOM.siblings(this._node, _wrapFn(fn)));\n },\n\n /**\n * Retrieves a single Node instance, the first element matching the given \n * CSS selector.\n * Returns null if no match found.\n * @method one\n *\n * @param {string} selector The CSS selector to test against.\n * @return {Node | null} A Node instance for the matching HTMLElement or null \n * if no match found.\n */\n one: function(selector) {\n return Y.one(Y.Selector.query(selector, this._node, true));\n },\n\n /**\n * Retrieves a NodeList based on the given CSS selector.\n * @method all\n *\n * @param {string} selector The CSS selector to test against.\n * @return {NodeList} A NodeList instance for the matching HTMLCollection/Array.\n */\n all: function(selector) {\n var nodelist = Y.all(Y.Selector.query(selector, this._node));\n nodelist._query = selector;\n nodelist._queryRoot = this._node;\n return nodelist;\n },\n\n // TODO: allow fn test\n /**\n * Test if the supplied node matches the supplied selector.\n * @method test\n *\n * @param {string} selector The CSS selector to test against.\n * @return {boolean} Whether or not the node matches the selector.\n */\n test: function(selector) {\n return Y.Selector.test(this._node, selector);\n },\n\n /**\n * Removes the node from its parent.\n * Shortcut for myNode.get('parentNode').removeChild(myNode);\n * @method remove\n * @param {Boolean} destroy whether or not to call destroy() on the node\n * after removal.\n * @chainable\n *\n */\n remove: function(destroy) {\n var node = this._node;\n\n if (node && node.parentNode) {\n node.parentNode.removeChild(node);\n }\n\n if (destroy) {\n this.destroy();\n }\n\n return this;\n },\n\n /**\n * Replace the node with the other node. This is a DOM update only\n * and does not change the node bound to the Node instance.\n * Shortcut for myNode.get('parentNode').replaceChild(newNode, myNode);\n * @method replace\n * @param {Node | HTMLNode} newNode Node to be inserted\n * @chainable\n *\n */\n replace: function(newNode) {\n var node = this._node;\n if (typeof newNode == 'string') {\n newNode = Y_Node.create(newNode);\n }\n node.parentNode.replaceChild(Y_Node.getDOMNode(newNode), node);\n return this;\n },\n\n /**\n * @method replaceChild\n * @for Node\n * @param {String | HTMLElement | Node} node Node to be inserted\n * @param {HTMLElement | Node} refNode Node to be replaced\n * @return {Node} The replaced node\n */\n replaceChild: function(node, refNode) {\n if (typeof node == 'string') {\n node = Y_DOM.create(node);\n }\n\n return Y.one(this._node.replaceChild(Y_Node.getDOMNode(node), Y_Node.getDOMNode(refNode)));\n },\n\n /**\n * Nulls internal node references, removes any plugins and event listeners.\n * Note that destroy() will not remove the node from its parent or from the DOM. For that\n * functionality, call remove(true).\n * @method destroy\n * @param {Boolean} recursivePurge (optional) Whether or not to remove listeners from the\n * node's subtree (default is false)\n *\n */\n destroy: function(recursive) {\n var UID = Y.config.doc.uniqueID ? 'uniqueID' : '_yuid',\n instance;\n\n this.purge(); // TODO: only remove events add via this Node\n\n if (this.unplug) { // may not be a PluginHost\n this.unplug();\n }\n\n this.clearData();\n\n if (recursive) {\n Y.NodeList.each(this.all('*'), function(node) {\n instance = Y_Node._instances[node[UID]];\n if (instance) {\n instance.destroy();\n } else { // purge in case added by other means\n Y.Event.purgeElement(node);\n }\n });\n }\n\n this._node = null;\n this._stateProxy = null;\n\n delete Y_Node._instances[this._yuid];\n },\n\n /**\n * Invokes a method on the Node instance\n * @method invoke\n * @param {String} method The name of the method to invoke\n * @param {Any} a, b, c, etc. Arguments to invoke the method with.\n * @return Whatever the underly method returns.\n * DOM Nodes and Collections return values\n * are converted to Node/NodeList instances.\n *\n */\n invoke: function(method, a, b, c, d, e) {\n var node = this._node,\n ret;\n\n if (a && a._node) {\n a = a._node;\n }\n\n if (b && b._node) {\n b = b._node;\n }\n\n ret = node[method](a, b, c, d, e);\n return Y_Node.scrubVal(ret, this);\n },\n\n /**\n * @method swap\n * @description Swap DOM locations with the given node.\n * This does not change which DOM node each Node instance refers to.\n * @param {Node} otherNode The node to swap with\n * @chainable\n */\n swap: Y.config.doc.documentElement.swapNode ?\n function(otherNode) {\n this._node.swapNode(Y_Node.getDOMNode(otherNode));\n } :\n function(otherNode) {\n otherNode = Y_Node.getDOMNode(otherNode);\n var node = this._node,\n parent = otherNode.parentNode,\n nextSibling = otherNode.nextSibling;\n\n if (nextSibling === node) {\n parent.insertBefore(node, otherNode);\n } else if (otherNode === node.nextSibling) {\n parent.insertBefore(otherNode, node);\n } else {\n node.parentNode.replaceChild(otherNode, node);\n Y_DOM.addHTML(parent, node, nextSibling);\n }\n return this;\n },\n\n\n hasMethod: function(method) {\n var node = this._node;\n return !!(node && method in node &&\n typeof node[method] != 'unknown' &&\n (typeof node[method] == 'function' ||\n String(node[method]).indexOf('function') === 1)); // IE reports as object, prepends space\n },\n\n isFragment: function() {\n return (this.get('nodeType') === 11);\n },\n\n /**\n * Removes and destroys all of the nodes within the node.\n * @method empty\n * @chainable\n */\n empty: function() {\n this.get('childNodes').remove().destroy(true);\n return this;\n },\n\n /**\n * Returns the DOM node bound to the Node instance\n * @method getDOMNode\n * @return {DOMNode}\n */\n getDOMNode: function() {\n return this._node;\n }\n}, true);\n\nY.Node = Y_Node;\nY.one = Y_Node.one;\n/**\n * The NodeList module provides support for managing collections of Nodes.\n * @module node\n * @submodule node-core\n */\n\n/**\n * The NodeList class provides a wrapper for manipulating DOM NodeLists.\n * NodeList properties can be accessed via the set/get methods.\n * Use Y.all() to retrieve NodeList instances.\n *\n * @class NodeList\n * @constructor\n * @param nodes {String|element|Node|Array} A selector, DOM element, Node, list of DOM elements, or list of Nodes with which to populate this NodeList.\n */\n\nvar NodeList = function(nodes) {\n var tmp = [];\n\n if (nodes) {\n if (typeof nodes === 'string') { // selector query\n this._query = nodes;\n nodes = Y.Selector.query(nodes);\n } else if (nodes.nodeType || Y_DOM.isWindow(nodes)) { // domNode || window\n nodes = [nodes];\n } else if (nodes._node) { // Y.Node\n nodes = [nodes._node];\n } else if (nodes[0] && nodes[0]._node) { // allow array of Y.Nodes\n Y.Array.each(nodes, function(node) {\n if (node._node) {\n tmp.push(node._node);\n }\n });\n nodes = tmp;\n } else { // array of domNodes or domNodeList (no mixed array of Y.Node/domNodes)\n nodes = Y.Array(nodes, 0, true);\n }\n }\n\n /**\n * The underlying array of DOM nodes bound to the Y.NodeList instance\n * @property _nodes\n * @private\n */\n this._nodes = nodes || [];\n};\n\nNodeList.NAME = 'NodeList';\n\n/**\n * Retrieves the DOM nodes bound to a NodeList instance\n * @method getDOMNodes\n * @static\n *\n * @param {NodeList} nodelist The NodeList instance\n * @return {Array} The array of DOM nodes bound to the NodeList\n */\nNodeList.getDOMNodes = function(nodelist) {\n return (nodelist && nodelist._nodes) ? nodelist._nodes : nodelist;\n};\n\nNodeList.each = function(instance, fn, context) {\n var nodes = instance._nodes;\n if (nodes && nodes.length) {\n Y.Array.each(nodes, fn, context || instance);\n } else {\n Y.log('no nodes bound to ' + this, 'warn', 'NodeList');\n }\n};\n\nNodeList.addMethod = function(name, fn, context) {\n if (name && fn) {\n NodeList.prototype[name] = function() {\n var ret = [],\n args = arguments;\n\n Y.Array.each(this._nodes, function(node) {\n var UID = (node.uniqueID && node.nodeType !== 9 ) ? 'uniqueID' : '_yuid',\n instance = Y.Node._instances[node[UID]],\n ctx,\n result;\n\n if (!instance) {\n instance = NodeList._getTempNode(node);\n }\n ctx = context || instance;\n result = fn.apply(ctx, args);\n if (result !== undefined && result !== instance) {\n ret[ret.length] = result;\n }\n });\n\n // TODO: remove tmp pointer\n return ret.length ? ret : this;\n };\n } else {\n Y.log('unable to add method: ' + name + ' to NodeList', 'warn', 'node');\n }\n};\n\nNodeList.importMethod = function(host, name, altName) {\n if (typeof name === 'string') {\n altName = altName || name;\n NodeList.addMethod(name, host[name]);\n } else {\n Y.Array.each(name, function(n) {\n NodeList.importMethod(host, n);\n });\n }\n};\n\nNodeList._getTempNode = function(node) {\n var tmp = NodeList._tempNode;\n if (!tmp) {\n tmp = Y.Node.create('<div></div>');\n NodeList._tempNode = tmp;\n }\n\n tmp._node = node;\n tmp._stateProxy = node;\n return tmp;\n};\n\nY.mix(NodeList.prototype, {\n _invoke: function(method, args, getter) {\n var ret = (getter) ? [] : this;\n\n this.each(function(node) {\n var val = node[method].apply(node, args);\n if (getter) {\n ret.push(val);\n }\n });\n\n return ret;\n },\n\n /**\n * Retrieves the Node instance at the given index.\n * @method item\n *\n * @param {Number} index The index of the target Node.\n * @return {Node} The Node instance at the given index.\n */\n item: function(index) {\n return Y.one((this._nodes || [])[index]);\n },\n\n /**\n * Applies the given function to each Node in the NodeList.\n * @method each\n * @param {Function} fn The function to apply. It receives 3 arguments:\n * the current node instance, the node's index, and the NodeList instance\n * @param {Object} context optional An optional context to apply the function with\n * Default context is the current Node instance\n * @chainable\n */\n each: function(fn, context) {\n var instance = this;\n Y.Array.each(this._nodes, function(node, index) {\n node = Y.one(node);\n return fn.call(context || node, node, index, instance);\n });\n return instance;\n },\n\n batch: function(fn, context) {\n var nodelist = this;\n\n Y.Array.each(this._nodes, function(node, index) {\n var instance = Y.Node._instances[node[UID]];\n if (!instance) {\n instance = NodeList._getTempNode(node);\n }\n\n return fn.call(context || instance, instance, index, nodelist);\n });\n return nodelist;\n },\n\n /**\n * Executes the function once for each node until a true value is returned.\n * @method some\n * @param {Function} fn The function to apply. It receives 3 arguments:\n * the current node instance, the node's index, and the NodeList instance\n * @param {Object} context optional An optional context to execute the function from.\n * Default context is the current Node instance\n * @return {Boolean} Whether or not the function returned true for any node.\n */\n some: function(fn, context) {\n var instance = this;\n return Y.Array.some(this._nodes, function(node, index) {\n node = Y.one(node);\n context = context || node;\n return fn.call(context, node, index, instance);\n });\n },\n\n /**\n * Creates a documenFragment from the nodes bound to the NodeList instance\n * @method toFrag\n * @return {Node} a Node instance bound to the documentFragment\n */\n toFrag: function() {\n return Y.one(Y.DOM._nl2frag(this._nodes));\n },\n\n /**\n * Returns the index of the node in the NodeList instance\n * or -1 if the node isn't found.\n * @method indexOf\n * @param {Node | DOMNode} node the node to search for\n * @return {Int} the index of the node value or -1 if not found\n */\n indexOf: function(node) {\n return Y.Array.indexOf(this._nodes, Y.Node.getDOMNode(node));\n },\n\n /**\n * Filters the NodeList instance down to only nodes matching the given selector.\n * @method filter\n * @param {String} selector The selector to filter against\n * @return {NodeList} NodeList containing the updated collection\n * @see Selector\n */\n filter: function(selector) {\n return Y.all(Y.Selector.filter(this._nodes, selector));\n },\n\n\n /**\n * Creates a new NodeList containing all nodes at every n indices, where\n * remainder n % index equals r.\n * (zero-based index).\n * @method modulus\n * @param {Int} n The offset to use (return every nth node)\n * @param {Int} r An optional remainder to use with the modulus operation (defaults to zero)\n * @return {NodeList} NodeList containing the updated collection\n */\n modulus: function(n, r) {\n r = r || 0;\n var nodes = [];\n NodeList.each(this, function(node, i) {\n if (i % n === r) {\n nodes.push(node);\n }\n });\n\n return Y.all(nodes);\n },\n\n /**\n * Creates a new NodeList containing all nodes at odd indices\n * (zero-based index).\n * @method odd\n * @return {NodeList} NodeList containing the updated collection\n */\n odd: function() {\n return this.modulus(2, 1);\n },\n\n /**\n * Creates a new NodeList containing all nodes at even indices\n * (zero-based index), including zero.\n * @method even\n * @return {NodeList} NodeList containing the updated collection\n */\n even: function() {\n return this.modulus(2);\n },\n\n destructor: function() {\n },\n\n /**\n * Reruns the initial query, when created using a selector query\n * @method refresh\n * @chainable\n */\n refresh: function() {\n var doc,\n nodes = this._nodes,\n query = this._query,\n root = this._queryRoot;\n\n if (query) {\n if (!root) {\n if (nodes && nodes[0] && nodes[0].ownerDocument) {\n root = nodes[0].ownerDocument;\n }\n }\n\n this._nodes = Y.Selector.query(query, root);\n }\n\n return this;\n },\n\n /**\n * Returns the current number of items in the NodeList.\n * @method size\n * @return {Int} The number of items in the NodeList.\n */\n size: function() {\n return this._nodes.length;\n },\n\n /**\n * Determines if the instance is bound to any nodes\n * @method isEmpty\n * @return {Boolean} Whether or not the NodeList is bound to any nodes\n */\n isEmpty: function() {\n return this._nodes.length < 1;\n },\n\n toString: function() {\n var str = '',\n errorMsg = this[UID] + ': not bound to any nodes',\n nodes = this._nodes,\n node;\n\n if (nodes && nodes[0]) {\n node = nodes[0];\n str += node[NODE_NAME];\n if (node.id) {\n str += '#' + node.id;\n }\n\n if (node.className) {\n str += '.' + node.className.replace(' ', '.');\n }\n\n if (nodes.length > 1) {\n str += '...[' + nodes.length + ' items]';\n }\n }\n return str || errorMsg;\n },\n\n /**\n * Returns the DOM node bound to the Node instance\n * @method getDOMNodes\n * @return {Array}\n */\n getDOMNodes: function() {\n return this._nodes;\n }\n}, true);\n\nNodeList.importMethod(Y.Node.prototype, [\n /** \n * Called on each Node instance. Nulls internal node references, \n * removes any plugins and event listeners\n * @method destroy\n * @param {Boolean} recursivePurge (optional) Whether or not to \n * remove listeners from the node's subtree (default is false)\n * @see Node.destroy\n */\n 'destroy',\n\n /** \n * Called on each Node instance. Removes and destroys all of the nodes \n * within the node\n * @method empty\n * @chainable\n * @see Node.empty\n */\n 'empty',\n\n /** \n * Called on each Node instance. Removes the node from its parent.\n * Shortcut for myNode.get('parentNode').removeChild(myNode);\n * @method remove\n * @param {Boolean} destroy whether or not to call destroy() on the node\n * after removal.\n * @chainable\n * @see Node.remove\n */\n 'remove',\n\n /** \n * Called on each Node instance. Sets an attribute on the Node instance.\n * Unless pre-configured (via Node.ATTRS), set hands\n * off to the underlying DOM node. Only valid\n * attributes/properties for the node will be set.\n * To set custom attributes use setAttribute.\n * @method set\n * @param {String} attr The attribute to be set.\n * @param {any} val The value to set the attribute to.\n * @chainable\n * @see Node.set\n */\n 'set'\n]);\n\n// one-off implementation to convert array of Nodes to NodeList\n// e.g. Y.all('input').get('parentNode');\n\n/** Called on each Node instance\n * @method get\n * @see Node\n */\nNodeList.prototype.get = function(attr) {\n var ret = [],\n nodes = this._nodes,\n isNodeList = false,\n getTemp = NodeList._getTempNode,\n instance,\n val;\n\n if (nodes[0]) {\n instance = Y.Node._instances[nodes[0]._yuid] || getTemp(nodes[0]);\n val = instance._get(attr);\n if (val && val.nodeType) {\n isNodeList = true;\n }\n }\n\n Y.Array.each(nodes, function(node) {\n instance = Y.Node._instances[node._yuid];\n\n if (!instance) {\n instance = getTemp(node);\n }\n\n val = instance._get(attr);\n if (!isNodeList) { // convert array of Nodes to NodeList\n val = Y.Node.scrubVal(val, instance);\n }\n\n ret.push(val);\n });\n\n return (isNodeList) ? Y.all(ret) : ret;\n};\n\nY.NodeList = NodeList;\n\nY.all = function(nodes) {\n return new NodeList(nodes);\n};\n\nY.Node.all = Y.all;\n/**\n * @module node\n * @submodule node-core\n */\n\nvar Y_NodeList = Y.NodeList,\n ArrayProto = Array.prototype,\n ArrayMethods = {\n /** Returns a new NodeList combining the given NodeList(s)\n * @for NodeList\n * @method concat\n * @param {NodeList | Array} valueN Arrays/NodeLists and/or values to\n * concatenate to the resulting NodeList\n * @return {NodeList} A new NodeList comprised of this NodeList joined with the input.\n */\n 'concat': 1,\n /** Removes the last from the NodeList and returns it.\n * @for NodeList\n * @method pop\n * @return {Node} The last item in the NodeList.\n */\n 'pop': 0,\n /** Adds the given Node(s) to the end of the NodeList.\n * @for NodeList\n * @method push\n * @param {Node | DOMNode} nodes One or more nodes to add to the end of the NodeList.\n */\n 'push': 0,\n /** Removes the first item from the NodeList and returns it.\n * @for NodeList\n * @method shift\n * @return {Node} The first item in the NodeList.\n */\n 'shift': 0,\n /** Returns a new NodeList comprising the Nodes in the given range.\n * @for NodeList\n * @method slice\n * @param {Number} begin Zero-based index at which to begin extraction.\n As a negative index, start indicates an offset from the end of the sequence. slice(-2) extracts the second-to-last element and the last element in the sequence.\n * @param {Number} end Zero-based index at which to end extraction. slice extracts up to but not including end.\n slice(1,4) extracts the second element through the fourth element (elements indexed 1, 2, and 3).\n As a negative index, end indicates an offset from the end of the sequence. slice(2,-1) extracts the third element through the second-to-last element in the sequence.\n If end is omitted, slice extracts to the end of the sequence.\n * @return {NodeList} A new NodeList comprised of this NodeList joined with the input.\n */\n 'slice': 1,\n /** Changes the content of the NodeList, adding new elements while removing old elements.\n * @for NodeList\n * @method splice\n * @param {Number} index Index at which to start changing the array. If negative, will begin that many elements from the end.\n * @param {Number} howMany An integer indicating the number of old array elements to remove. If howMany is 0, no elements are removed. In this case, you should specify at least one new element. If no howMany parameter is specified (second syntax above, which is a SpiderMonkey extension), all elements after index are removed.\n * {Node | DOMNode| element1, ..., elementN\n The elements to add to the array. If you don't specify any elements, splice simply removes elements from the array.\n * @return {NodeList} The element(s) removed.\n */\n 'splice': 1,\n /** Adds the given Node(s) to the beginning of the NodeList.\n * @for NodeList\n * @method unshift\n * @param {Node | DOMNode} nodes One or more nodes to add to the NodeList.\n */\n 'unshift': 0\n };\n\n\nY.Object.each(ArrayMethods, function(returnNodeList, name) {\n Y_NodeList.prototype[name] = function() {\n var args = [],\n i = 0,\n arg,\n ret;\n\n while (typeof (arg = arguments[i++]) != 'undefined') { // use DOM nodes/nodeLists\n args.push(arg._node || arg._nodes || arg);\n }\n\n ret = ArrayProto[name].apply(this._nodes, args);\n\n if (returnNodeList) {\n ret = Y.all(ret);\n } else {\n ret = Y.Node.scrubVal(ret);\n }\n\n return ret;\n };\n});\n/**\n * @module node\n * @submodule node-core\n */\n\nY.Array.each([\n /**\n * Passes through to DOM method.\n * @for Node\n * @method removeChild\n * @param {HTMLElement | Node} node Node to be removed\n * @return {Node} The removed node\n */\n 'removeChild',\n\n /**\n * Passes through to DOM method.\n * @method hasChildNodes\n * @return {Boolean} Whether or not the node has any childNodes\n */\n 'hasChildNodes',\n\n /**\n * Passes through to DOM method.\n * @method cloneNode\n * @param {Boolean} deep Whether or not to perform a deep clone, which includes\n * subtree and attributes\n * @return {Node} The clone\n */\n 'cloneNode',\n\n /**\n * Passes through to DOM method.\n * @method hasAttribute\n * @param {String} attribute The attribute to test for\n * @return {Boolean} Whether or not the attribute is present\n */\n 'hasAttribute',\n\n /**\n * Passes through to DOM method.\n * @method scrollIntoView\n * @chainable\n */\n 'scrollIntoView',\n\n /**\n * Passes through to DOM method.\n * @method getElementsByTagName\n * @param {String} tagName The tagName to collect\n * @return {NodeList} A NodeList representing the HTMLCollection\n */\n 'getElementsByTagName',\n\n /**\n * Passes through to DOM method.\n * @method focus\n * @chainable\n */\n 'focus',\n\n /**\n * Passes through to DOM method.\n * @method blur\n * @chainable\n */\n 'blur',\n\n /**\n * Passes through to DOM method.\n * Only valid on FORM elements\n * @method submit\n * @chainable\n */\n 'submit',\n\n /**\n * Passes through to DOM method.\n * Only valid on FORM elements\n * @method reset\n * @chainable\n */\n 'reset',\n\n /**\n * Passes through to DOM method.\n * @method select\n * @chainable\n */\n 'select',\n\n /**\n * Passes through to DOM method.\n * Only valid on TABLE elements\n * @method createCaption\n * @chainable\n */\n 'createCaption'\n\n], function(method) {\n Y.log('adding: ' + method, 'info', 'node');\n Y.Node.prototype[method] = function(arg1, arg2, arg3) {\n var ret = this.invoke(method, arg1, arg2, arg3);\n return ret;\n };\n});\n\n/**\n * Passes through to DOM method.\n * @method removeAttribute\n * @param {String} attribute The attribute to be removed\n * @chainable\n */\n // one-off implementation due to IE returning boolean, breaking chaining\nY.Node.prototype.removeAttribute = function(attr) {\n var node = this._node;\n if (node) {\n node.removeAttribute(attr, 0); // comma zero for IE < 8 to force case-insensitive\n }\n\n return this;\n};\n\nY.Node.importMethod(Y.DOM, [\n /**\n * Determines whether the node is an ancestor of another HTML element in the DOM hierarchy.\n * @method contains\n * @param {Node | HTMLElement} needle The possible node or descendent\n * @return {Boolean} Whether or not this node is the needle its ancestor\n */\n 'contains',\n /**\n * Allows setting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method setAttribute\n * @for Node\n * @chainable\n * @param {string} name The attribute name\n * @param {string} value The value to set\n */\n 'setAttribute',\n /**\n * Allows getting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method getAttribute\n * @for Node\n * @param {string} name The attribute name\n * @return {string} The attribute value\n */\n 'getAttribute',\n\n /**\n * Wraps the given HTML around the node.\n * @method wrap\n * @param {String} html The markup to wrap around the node.\n * @chainable\n * @for Node\n */\n 'wrap',\n\n /**\n * Removes the node's parent node.\n * @method unwrap\n * @chainable\n */\n 'unwrap',\n\n /**\n * Applies a unique ID to the node if none exists\n * @method generateID\n * @return {String} The existing or generated ID\n */\n 'generateID'\n]);\n\nY.NodeList.importMethod(Y.Node.prototype, [\n/**\n * Allows getting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method getAttribute\n * @see Node\n * @for NodeList\n * @param {string} name The attribute name\n * @return {string} The attribute value\n */\n\n 'getAttribute',\n/**\n * Allows setting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method setAttribute\n * @see Node\n * @for NodeList\n * @chainable\n * @param {string} name The attribute name\n * @param {string} value The value to set\n */\n 'setAttribute',\n\n/**\n * Allows for removing attributes on DOM nodes.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method removeAttribute\n * @see Node\n * @for NodeList\n * @param {string} name The attribute to remove\n */\n 'removeAttribute',\n/**\n * Removes the parent node from node in the list.\n * @method unwrap\n * @chainable\n */\n 'unwrap',\n/**\n * Wraps the given HTML around each node.\n * @method wrap\n * @param {String} html The markup to wrap around the node.\n * @chainable\n */\n 'wrap',\n\n/**\n * Applies a unique ID to each node if none exists\n * @method generateID\n * @return {String} The existing or generated ID\n */\n 'generateID'\n]);\n\n\n}, '@VERSION@', {\"requires\": [\"dom-core\", \"selector\"]});\nYUI.add('node-base', function (Y, NAME) {\n\n/**\n * @module node\n * @submodule node-base\n */\n\nvar methods = [\n/**\n * Determines whether each node has the given className.\n * @method hasClass\n * @for Node\n * @param {String} className the class name to search for\n * @return {Boolean} Whether or not the element has the specified class\n */\n 'hasClass',\n\n/**\n * Adds a class name to each node.\n * @method addClass\n * @param {String} className the class name to add to the node's class attribute\n * @chainable\n */\n 'addClass',\n\n/**\n * Removes a class name from each node.\n * @method removeClass\n * @param {String} className the class name to remove from the node's class attribute\n * @chainable\n */\n 'removeClass',\n\n/**\n * Replace a class with another class for each node.\n * If no oldClassName is present, the newClassName is simply added.\n * @method replaceClass\n * @param {String} oldClassName the class name to be replaced\n * @param {String} newClassName the class name that will be replacing the old class name\n * @chainable\n */\n 'replaceClass',\n\n/**\n * If the className exists on the node it is removed, if it doesn't exist it is added.\n * @method toggleClass\n * @param {String} className the class name to be toggled\n * @param {Boolean} force Option to force adding or removing the class.\n * @chainable\n */\n 'toggleClass'\n];\n\nY.Node.importMethod(Y.DOM, methods);\n/**\n * Determines whether each node has the given className.\n * @method hasClass\n * @see Node.hasClass\n * @for NodeList\n * @param {String} className the class name to search for\n * @return {Array} An array of booleans for each node bound to the NodeList.\n */\n\n/**\n * Adds a class name to each node.\n * @method addClass\n * @see Node.addClass\n * @param {String} className the class name to add to the node's class attribute\n * @chainable\n */\n\n/**\n * Removes a class name from each node.\n * @method removeClass\n * @see Node.removeClass\n * @param {String} className the class name to remove from the node's class attribute\n * @chainable\n */\n\n/**\n * Replace a class with another class for each node.\n * If no oldClassName is present, the newClassName is simply added.\n * @method replaceClass\n * @see Node.replaceClass\n * @param {String} oldClassName the class name to be replaced\n * @param {String} newClassName the class name that will be replacing the old class name\n * @chainable\n */\n\n/**\n * If the className exists on the node it is removed, if it doesn't exist it is added.\n * @method toggleClass\n * @see Node.toggleClass\n * @param {String} className the class name to be toggled\n * @chainable\n */\nY.NodeList.importMethod(Y.Node.prototype, methods);\n/**\n * @module node\n * @submodule node-base\n */\n\nvar Y_Node = Y.Node,\n Y_DOM = Y.DOM;\n\n/**\n * Returns a new dom node using the provided markup string.\n * @method create\n * @static\n * @param {String} html The markup used to create the element\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @param {HTMLDocument} doc An optional document context\n * @return {Node} A Node instance bound to a DOM node or fragment\n * @for Node\n */\nY_Node.create = function(html, doc) {\n if (doc && doc._node) {\n doc = doc._node;\n }\n return Y.one(Y_DOM.create(html, doc));\n};\n\nY.mix(Y_Node.prototype, {\n /**\n * Creates a new Node using the provided markup string.\n * @method create\n * @param {String} html The markup used to create the element.\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @param {HTMLDocument} doc An optional document context\n * @return {Node} A Node instance bound to a DOM node or fragment\n */\n create: Y_Node.create,\n\n /**\n * Inserts the content before the reference node.\n * @method insert\n * @param {String | Node | HTMLElement | NodeList | HTMLCollection} content The content to insert\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @param {Int | Node | HTMLElement | String} where The position to insert at.\n * Possible \"where\" arguments\n * <dl>\n * <dt>Y.Node</dt>\n * <dd>The Node to insert before</dd>\n * <dt>HTMLElement</dt>\n * <dd>The element to insert before</dd>\n * <dt>Int</dt>\n * <dd>The index of the child element to insert before</dd>\n * <dt>\"replace\"</dt>\n * <dd>Replaces the existing HTML</dd>\n * <dt>\"before\"</dt>\n * <dd>Inserts before the existing HTML</dd>\n * <dt>\"before\"</dt>\n * <dd>Inserts content before the node</dd>\n * <dt>\"after\"</dt>\n * <dd>Inserts content after the node</dd>\n * </dl>\n * @chainable\n */\n insert: function(content, where) {\n this._insert(content, where);\n return this;\n },\n\n _insert: function(content, where) {\n var node = this._node,\n ret = null;\n\n if (typeof where == 'number') { // allow index\n where = this._node.childNodes[where];\n } else if (where && where._node) { // Node\n where = where._node;\n }\n\n if (content && typeof content != 'string') { // allow Node or NodeList/Array instances\n content = content._node || content._nodes || content;\n }\n ret = Y_DOM.addHTML(node, content, where);\n\n return ret;\n },\n\n /**\n * Inserts the content as the firstChild of the node.\n * @method prepend\n * @param {String | Node | HTMLElement} content The content to insert\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @chainable\n */\n prepend: function(content) {\n return this.insert(content, 0);\n },\n\n /**\n * Inserts the content as the lastChild of the node.\n * @method append\n * @param {String | Node | HTMLElement} content The content to insert\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @chainable\n */\n append: function(content) {\n return this.insert(content, null);\n },\n\n /**\n * @method appendChild\n * @param {String | HTMLElement | Node} node Node to be appended\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @return {Node} The appended node\n */\n appendChild: function(node) {\n return Y_Node.scrubVal(this._insert(node));\n },\n\n /**\n * @method insertBefore\n * @param {String | HTMLElement | Node} newNode Node to be appended\n * @param {HTMLElement | Node} refNode Node to be inserted before\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content.\n * @return {Node} The inserted node\n */\n insertBefore: function(newNode, refNode) {\n return Y.Node.scrubVal(this._insert(newNode, refNode));\n },\n\n /**\n * Appends the node to the given node.\n * @method appendTo\n * @param {Node | HTMLElement} node The node to append to\n * @chainable\n */\n appendTo: function(node) {\n Y.one(node).append(this);\n return this;\n },\n\n /**\n * Replaces the node's current content with the content.\n * Note that this passes to innerHTML and is not escaped.\n * Use <a href=\"../classes/Escape.html#method_html\">`Y.Escape.html()`</a>\n * to escape html content or `set('text')` to add as text.\n * @method setContent\n * @deprecated Use setHTML\n * @param {String | Node | HTMLElement | NodeList | HTMLCollection} content The content to insert\n * @chainable\n */\n setContent: function(content) {\n this._insert(content, 'replace');\n return this;\n },\n\n /**\n * Returns the node's current content (e.g. innerHTML)\n * @method getContent\n * @deprecated Use getHTML\n * @return {String} The current content\n */\n getContent: function(content) {\n return this.get('innerHTML');\n }\n});\n\n/**\n * Replaces the node's current html content with the content provided.\n * Note that this passes to innerHTML and is not escaped.\n * Use `Y.Escape.html()` to escape HTML, or `set('text')` to add as text.\n * @method setHTML\n * @param {String | HTML | Node | HTMLElement | NodeList | HTMLCollection} content The content to insert\n * @chainable\n */\nY.Node.prototype.setHTML = Y.Node.prototype.setContent;\n\n/**\n * Returns the node's current html content (e.g. innerHTML)\n * @method getHTML\n * @return {String} The html content\n */\nY.Node.prototype.getHTML = Y.Node.prototype.getContent;\n\nY.NodeList.importMethod(Y.Node.prototype, [\n /**\n * Called on each Node instance\n * @for NodeList\n * @method append\n * @see Node.append\n */\n 'append',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method insert\n * @see Node.insert\n */\n 'insert',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method appendChild\n * @see Node.appendChild\n */\n 'appendChild',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method insertBefore\n * @see Node.insertBefore\n */\n 'insertBefore',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method prepend\n * @see Node.prepend\n */\n 'prepend',\n\n /**\n * Called on each Node instance\n * Note that this passes to innerHTML and is not escaped.\n * Use `Y.Escape.html()` to escape HTML, or `set('text')` to add as text.\n * @for NodeList\n * @method setContent\n * @deprecated Use setHTML\n */\n 'setContent',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method getContent\n * @deprecated Use getHTML\n */\n 'getContent',\n\n /**\n * Called on each Node instance\n * Note that this passes to innerHTML and is not escaped.\n * Use `Y.Escape.html()` to escape HTML, or `set('text')` to add as text.\n * @for NodeList\n * @method setHTML\n * @see Node.setHTML\n */\n 'setHTML',\n\n /**\n * Called on each Node instance\n * @for NodeList\n * @method getHTML\n * @see Node.getHTML\n */\n 'getHTML'\n]);\n/**\n * @module node\n * @submodule node-base\n */\n\nvar Y_Node = Y.Node,\n Y_DOM = Y.DOM;\n\n/**\n * Static collection of configuration attributes for special handling\n * @property ATTRS\n * @static\n * @type object\n */\nY_Node.ATTRS = {\n /**\n * Allows for getting and setting the text of an element.\n * Formatting is preserved and special characters are treated literally.\n * @config text\n * @type String\n */\n text: {\n getter: function() {\n return Y_DOM.getText(this._node);\n },\n\n setter: function(content) {\n Y_DOM.setText(this._node, content);\n return content;\n }\n },\n\n /**\n * Allows for getting and setting the text of an element.\n * Formatting is preserved and special characters are treated literally.\n * @config for\n * @type String\n */\n 'for': {\n getter: function() {\n return Y_DOM.getAttribute(this._node, 'for');\n },\n\n setter: function(val) {\n Y_DOM.setAttribute(this._node, 'for', val);\n return val;\n }\n },\n\n 'options': {\n getter: function() {\n return this._node.getElementsByTagName('option');\n }\n },\n\n /**\n * Returns a NodeList instance of all HTMLElement children.\n * @readOnly\n * @config children\n * @type NodeList\n */\n 'children': {\n getter: function() {\n var node = this._node,\n children = node.children,\n childNodes, i, len;\n\n if (!children) {\n childNodes = node.childNodes;\n children = [];\n\n for (i = 0, len = childNodes.length; i < len; ++i) {\n if (childNodes[i].tagName) {\n children[children.length] = childNodes[i];\n }\n }\n }\n return Y.all(children);\n }\n },\n\n value: {\n getter: function() {\n return Y_DOM.getValue(this._node);\n },\n\n setter: function(val) {\n Y_DOM.setValue(this._node, val);\n return val;\n }\n }\n};\n\nY.Node.importMethod(Y.DOM, [\n /**\n * Allows setting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method setAttribute\n * @for Node\n * @for NodeList\n * @chainable\n * @param {string} name The attribute name\n * @param {string} value The value to set\n */\n 'setAttribute',\n /**\n * Allows getting attributes on DOM nodes, normalizing in some cases.\n * This passes through to the DOM node, allowing for custom attributes.\n * @method getAttribute\n * @for Node\n * @for NodeList\n * @param {string} name The attribute name\n * @return {string} The attribute value\n */\n 'getAttribute'\n\n]);\n/**\n * @module node\n * @submodule node-base\n */\n\nvar Y_Node = Y.Node;\nvar Y_NodeList = Y.NodeList;\n/**\n * List of events that route to DOM events\n * @static\n * @property DOM_EVENTS\n * @for Node\n */\n\nY_Node.DOM_EVENTS = {\n abort: 1,\n beforeunload: 1,\n blur: 1,\n change: 1,\n click: 1,\n close: 1,\n command: 1,\n contextmenu: 1,\n dblclick: 1,\n DOMMouseScroll: 1,\n drag: 1,\n dragstart: 1,\n dragenter: 1,\n dragover: 1,\n dragleave: 1,\n dragend: 1,\n drop: 1,\n error: 1,\n focus: 1,\n key: 1,\n keydown: 1,\n keypress: 1,\n keyup: 1,\n load: 1,\n message: 1,\n mousedown: 1,\n mouseenter: 1,\n mouseleave: 1,\n mousemove: 1,\n mousemultiwheel: 1,\n mouseout: 1,\n mouseover: 1,\n mouseup: 1,\n mousewheel: 1,\n orientationchange: 1,\n reset: 1,\n resize: 1,\n select: 1,\n selectstart: 1,\n submit: 1,\n scroll: 1,\n textInput: 1,\n unload: 1\n};\n\n// Add custom event adaptors to this list. This will make it so\n// that delegate, key, available, contentready, etc all will\n// be available through Node.on\nY.mix(Y_Node.DOM_EVENTS, Y.Env.evt.plugins);\n\nY.augment(Y_Node, Y.EventTarget);\n\nY.mix(Y_Node.prototype, {\n /**\n * Removes event listeners from the node and (optionally) its subtree\n * @method purge\n * @param {Boolean} recurse (optional) Whether or not to remove listeners from the\n * node's subtree\n * @param {String} type (optional) Only remove listeners of the specified type\n * @chainable\n *\n */\n purge: function(recurse, type) {\n Y.Event.purgeElement(this._node, recurse, type);\n return this;\n }\n\n});\n\nY.mix(Y.NodeList.prototype, {\n _prepEvtArgs: function(type, fn, context) {\n // map to Y.on/after signature (type, fn, nodes, context, arg1, arg2, etc)\n var args = Y.Array(arguments, 0, true);\n\n if (args.length < 2) { // type only (event hash) just add nodes\n args[2] = this._nodes;\n } else {\n args.splice(2, 0, this._nodes);\n }\n\n args[3] = context || this; // default to NodeList instance as context\n\n return args;\n },\n\n /**\n Subscribe a callback function for each `Node` in the collection to execute\n in response to a DOM event.\n\n NOTE: Generally, the `on()` method should be avoided on `NodeLists`, in\n favor of using event delegation from a parent Node. See the Event user\n guide for details.\n\n Most DOM events are associated with a preventable default behavior, such as\n link clicks navigating to a new page. Callbacks are passed a\n `DOMEventFacade` object as their first argument (usually called `e`) that\n can be used to prevent this default behavior with `e.preventDefault()`. See\n the `DOMEventFacade` API for all available properties and methods on the\n object.\n\n By default, the `this` object will be the `NodeList` that the subscription\n came from, <em>not the `Node` that received the event</em>. Use\n `e.currentTarget` to refer to the `Node`.\n\n Returning `false` from a callback is supported as an alternative to calling\n `e.preventDefault(); e.stopPropagation();`. However, it is recommended to\n use the event methods.\n\n @example\n\n Y.all(\".sku\").on(\"keydown\", function (e) {\n if (e.keyCode === 13) {\n e.preventDefault();\n\n // Use e.currentTarget to refer to the individual Node\n var item = Y.MyApp.searchInventory( e.currentTarget.get('value') );\n // etc ...\n }\n });\n\n @method on\n @param {String} type The name of the event\n @param {Function} fn The callback to execute in response to the event\n @param {Object} [context] Override `this` object in callback\n @param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n @return {EventHandle} A subscription handle capable of detaching that\n subscription\n @for NodeList\n **/\n on: function(type, fn, context) {\n return Y.on.apply(Y, this._prepEvtArgs.apply(this, arguments));\n },\n\n /**\n * Applies an one-time event listener to each Node bound to the NodeList.\n * @method once\n * @param {String} type The event being listened for\n * @param {Function} fn The handler to call when the event fires\n * @param {Object} context The context to call the handler with.\n * Default is the NodeList instance.\n * @return {EventHandle} A subscription handle capable of detaching that\n * subscription\n * @for NodeList\n */\n once: function(type, fn, context) {\n return Y.once.apply(Y, this._prepEvtArgs.apply(this, arguments));\n },\n\n /**\n * Applies an event listener to each Node bound to the NodeList.\n * The handler is called only after all on() handlers are called\n * and the event is not prevented.\n * @method after\n * @param {String} type The event being listened for\n * @param {Function} fn The handler to call when the event fires\n * @param {Object} context The context to call the handler with.\n * Default is the NodeList instance.\n * @return {EventHandle} A subscription handle capable of detaching that\n * subscription\n * @for NodeList\n */\n after: function(type, fn, context) {\n return Y.after.apply(Y, this._prepEvtArgs.apply(this, arguments));\n },\n\n /**\n * Applies an one-time event listener to each Node bound to the NodeList\n * that will be called only after all on() handlers are called and the\n * event is not prevented.\n *\n * @method onceAfter\n * @param {String} type The event being listened for\n * @param {Function} fn The handler to call when the event fires\n * @param {Object} context The context to call the handler with.\n * Default is the NodeList instance.\n * @return {EventHandle} A subscription handle capable of detaching that\n * subscription\n * @for NodeList\n */\n onceAfter: function(type, fn, context) {\n return Y.onceAfter.apply(Y, this._prepEvtArgs.apply(this, arguments));\n }\n});\n\nY_NodeList.importMethod(Y.Node.prototype, [\n /**\n * Called on each Node instance\n * @method detach\n * @see Node.detach\n * @for NodeList\n */\n 'detach',\n\n /** Called on each Node instance\n * @method detachAll\n * @see Node.detachAll\n * @for NodeList\n */\n 'detachAll'\n]);\n\n/**\nSubscribe a callback function to execute in response to a DOM event or custom\nevent.\n\nMost DOM events are associated with a preventable default behavior such as\nlink clicks navigating to a new page. Callbacks are passed a `DOMEventFacade`\nobject as their first argument (usually called `e`) that can be used to\nprevent this default behavior with `e.preventDefault()`. See the\n`DOMEventFacade` API for all available properties and methods on the object.\n\nIf the event name passed as the first parameter is not a whitelisted DOM event,\nit will be treated as a custom event subscriptions, allowing\n`node.fire('customEventName')` later in the code. Refer to the Event user guide\nfor the full DOM event whitelist.\n\nBy default, the `this` object in the callback will refer to the subscribed\n`Node`.\n\nReturning `false` from a callback is supported as an alternative to calling\n`e.preventDefault(); e.stopPropagation();`. However, it is recommended to use\nthe event methods.\n\n@example\n\n Y.one(\"#my-form\").on(\"submit\", function (e) {\n e.preventDefault();\n\n // proceed with ajax form submission instead...\n });\n\n@method on\n@param {String} type The name of the event\n@param {Function} fn The callback to execute in response to the event\n@param {Object} [context] Override `this` object in callback\n@param {Any} [arg*] 0..n additional arguments to supply to the subscriber\n@return {EventHandle} A subscription handle capable of detaching that\n subscription\n@for Node\n**/\n\nY.mix(Y.Node.ATTRS, {\n offsetHeight: {\n setter: function(h) {\n Y.DOM.setHeight(this._node, h);\n return h;\n },\n\n getter: function() {\n return this._node.offsetHeight;\n }\n },\n\n offsetWidth: {\n setter: function(w) {\n Y.DOM.setWidth(this._node, w);\n return w;\n },\n\n getter: function() {\n return this._node.offsetWidth;\n }\n }\n});\n\nY.mix(Y.Node.prototype, {\n sizeTo: function(w, h) {\n var node;\n if (arguments.length < 2) {\n node = Y.one(w);\n w = node.get('offsetWidth');\n h = node.get('offsetHeight');\n }\n\n this.setAttrs({\n offsetWidth: w,\n offsetHeight: h\n });\n }\n});\n/**\n * @module node\n * @submodule node-base\n */\n\nvar Y_Node = Y.Node;\n\nY.mix(Y_Node.prototype, {\n /**\n * Makes the node visible.\n * If the \"transition\" module is loaded, show optionally\n * animates the showing of the node using either the default\n * transition effect ('fadeIn'), or the given named effect.\n * @method show\n * @for Node\n * @param {String} name A named Transition effect to use as the show effect.\n * @param {Object} config Options to use with the transition.\n * @param {Function} callback An optional function to run after the transition completes.\n * @chainable\n */\n show: function(callback) {\n callback = arguments[arguments.length - 1];\n this.toggleView(true, callback);\n return this;\n },\n\n /**\n * The implementation for showing nodes.\n * Default is to toggle the style.display property.\n * @method _show\n * @protected\n * @chainable\n */\n _show: function() {\n this.setStyle('display', '');\n\n },\n\n _isHidden: function() {\n return Y.DOM.getStyle(this._node, 'display') === 'none';\n },\n\n /**\n * Displays or hides the node.\n * If the \"transition\" module is loaded, toggleView optionally\n * animates the toggling of the node using given named effect.\n * @method toggleView\n * @for Node\n * @param {String} [name] An optional string value to use as transition effect.\n * @param {Boolean} [on] An optional boolean value to force the node to be shown or hidden\n * @param {Function} [callback] An optional function to run after the transition completes.\n * @chainable\n */\n toggleView: function(on, callback) {\n this._toggleView.apply(this, arguments);\n return this;\n },\n\n _toggleView: function(on, callback) {\n callback = arguments[arguments.length - 1];\n\n // base on current state if not forcing\n if (typeof on != 'boolean') {\n on = (this._isHidden()) ? 1 : 0;\n }\n\n if (on) {\n this._show();\n } else {\n this._hide();\n }\n\n if (typeof callback == 'function') {\n callback.call(this);\n }\n\n return this;\n },\n\n /**\n * Hides the node.\n * If the \"transition\" module is loaded, hide optionally\n * animates the hiding of the node using either the default\n * transition effect ('fadeOut'), or the given named effect.\n * @method hide\n * @param {String} name A named Transition effect to use as the show effect.\n * @param {Object} config Options to use with the transition.\n * @param {Function} callback An optional function to run after the transition completes.\n * @chainable\n */\n hide: function(callback) {\n callback = arguments[arguments.length - 1];\n this.toggleView(false, callback);\n return this;\n },\n\n /**\n * The implementation for hiding nodes.\n * Default is to toggle the style.display property.\n * @method _hide\n * @protected\n * @chainable\n */\n _hide: function() {\n this.setStyle('display', 'none');\n }\n});\n\nY.NodeList.importMethod(Y.Node.prototype, [\n /**\n * Makes each node visible.\n * If the \"transition\" module is loaded, show optionally\n * animates the showing of the node using either the default\n * transition effect ('fadeIn'), or the given named effect.\n * @method show\n * @param {String} name A named Transition effect to use as the show effect.\n * @param {Object} config Options to use with the transition.\n * @param {Function} callback An optional function to run after the transition completes.\n * @for NodeList\n * @chainable\n */\n 'show',\n\n /**\n * Hides each node.\n * If the \"transition\" module is loaded, hide optionally\n * animates the hiding of the node using either the default\n * transition effect ('fadeOut'), or the given named effect.\n * @method hide\n * @param {String} name A named Transition effect to use as the show effect.\n * @param {Object} config Options to use with the transition.\n * @param {Function} callback An optional function to run after the transition completes.\n * @chainable\n */\n 'hide',\n\n /**\n * Displays or hides each node.\n * If the \"transition\" module is loaded, toggleView optionally\n * animates the toggling of the nodes using given named effect.\n * @method toggleView\n * @param {String} [name] An optional string value to use as transition effect.\n * @param {Boolean} [on] An optional boolean value to force the nodes to be shown or hidden\n * @param {Function} [callback] An optional function to run after the transition completes.\n * @chainable\n */\n 'toggleView'\n]);\n\nif (!Y.config.doc.documentElement.hasAttribute) { // IE < 8\n Y.Node.prototype.hasAttribute = function(attr) {\n if (attr === 'value') {\n if (this.get('value') !== \"\") { // IE < 8 fails to populate specified when set in HTML\n return true;\n }\n }\n return !!(this._node.attributes[attr] &&\n this._node.attributes[attr].specified);\n };\n}\n\n// IE throws an error when calling focus() on an element that's invisible, not\n// displayed, or disabled.\nY.Node.prototype.focus = function () {\n try {\n this._node.focus();\n } catch (e) {\n Y.log('error focusing node: ' + e.toString(), 'error', 'node');\n }\n\n return this;\n};\n\n// IE throws error when setting input.type = 'hidden',\n// input.setAttribute('type', 'hidden') and input.attributes.type.value = 'hidden'\nY.Node.ATTRS.type = {\n setter: function(val) {\n if (val === 'hidden') {\n try {\n this._node.type = 'hidden';\n } catch(e) {\n this.setStyle('display', 'none');\n this._inputType = 'hidden';\n }\n } else {\n try { // IE errors when changing the type from \"hidden'\n this._node.type = val;\n } catch (e) {\n Y.log('error setting type: ' + val, 'info', 'node');\n }\n }\n return val;\n },\n\n getter: function() {\n return this._inputType || this._node.type;\n },\n\n _bypassProxy: true // don't update DOM when using with Attribute\n};\n\nif (Y.config.doc.createElement('form').elements.nodeType) {\n // IE: elements collection is also FORM node which trips up scrubVal.\n Y.Node.ATTRS.elements = {\n getter: function() {\n return this.all('input, textarea, button, select');\n }\n };\n}\n\n/**\n * Provides methods for managing custom Node data.\n * \n * @module node\n * @main node\n * @submodule node-data\n */\n\nY.mix(Y.Node.prototype, {\n _initData: function() {\n if (! ('_data' in this)) {\n this._data = {};\n }\n },\n\n /**\n * @method getData\n * @for Node\n * @description Retrieves arbitrary data stored on a Node instance.\n * If no data is associated with the Node, it will attempt to retrieve\n * a value from the corresponding HTML data attribute. (e.g. node.getData('foo')\n * will check node.getAttribute('data-foo')).\n * @param {string} name Optional name of the data field to retrieve.\n * If no name is given, all data is returned.\n * @return {any | Object} Whatever is stored at the given field,\n * or an object hash of all fields.\n */\n getData: function(name) {\n this._initData();\n var data = this._data,\n ret = data;\n\n if (arguments.length) { // single field\n if (name in data) {\n ret = data[name];\n } else { // initialize from HTML attribute\n ret = this._getDataAttribute(name);\n }\n } else if (typeof data == 'object' && data !== null) { // all fields\n ret = {};\n Y.Object.each(data, function(v, n) {\n ret[n] = v;\n });\n\n ret = this._getDataAttributes(ret);\n }\n\n return ret;\n\n },\n\n _getDataAttributes: function(ret) {\n ret = ret || {};\n var i = 0,\n attrs = this._node.attributes,\n len = attrs.length,\n prefix = this.DATA_PREFIX,\n prefixLength = prefix.length,\n name;\n\n while (i < len) {\n name = attrs[i].name;\n if (name.indexOf(prefix) === 0) {\n name = name.substr(prefixLength);\n if (!(name in ret)) { // only merge if not already stored\n ret[name] = this._getDataAttribute(name);\n }\n }\n\n i += 1;\n }\n\n return ret;\n },\n\n _getDataAttribute: function(name) {\n name = this.DATA_PREFIX + name;\n\n var node = this._node,\n attrs = node.attributes,\n data = attrs && attrs[name] && attrs[name].value;\n\n return data;\n },\n\n /**\n * @method setData\n * @for Node\n * @description Stores arbitrary data on a Node instance.\n * This is not stored with the DOM node.\n * @param {string} name The name of the field to set. If no val\n * is given, name is treated as the data and overrides any existing data.\n * @param {any} val The value to be assigned to the field.\n * @chainable\n */\n setData: function(name, val) {\n this._initData();\n if (arguments.length > 1) {\n this._data[name] = val;\n } else {\n this._data = name;\n }\n\n return this;\n },\n\n /**\n * @method clearData\n * @for Node\n * @description Clears internally stored data.\n * @param {string} name The name of the field to clear. If no name\n * is given, all data is cleared.\n * @chainable\n */\n clearData: function(name) {\n if ('_data' in this) {\n if (typeof name != 'undefined') {\n delete this._data[name];\n } else {\n delete this._data;\n }\n }\n\n return this;\n }\n});\n\nY.mix(Y.NodeList.prototype, {\n /**\n * @method getData\n * @for NodeList\n * @description Retrieves arbitrary data stored on each Node instance\n * bound to the NodeList.\n * @see Node\n * @param {string} name Optional name of the data field to retrieve.\n * If no name is given, all data is returned.\n * @return {Array} An array containing all of the data for each Node instance. \n * or an object hash of all fields.\n */\n getData: function(name) {\n var args = (arguments.length) ? [name] : [];\n return this._invoke('getData', args, true);\n },\n\n /**\n * @method setData\n * @for NodeList\n * @description Stores arbitrary data on each Node instance bound to the\n * NodeList. This is not stored with the DOM node.\n * @param {string} name The name of the field to set. If no name\n * is given, name is treated as the data and overrides any existing data.\n * @param {any} val The value to be assigned to the field.\n * @chainable\n */\n setData: function(name, val) {\n var args = (arguments.length > 1) ? [name, val] : [name];\n return this._invoke('setData', args);\n },\n\n /**\n * @method clearData\n * @for NodeList\n * @description Clears data on all Node instances bound to the NodeList.\n * @param {string} name The name of the field to clear. If no name\n * is given, all data is cleared.\n * @chainable\n */\n clearData: function(name) {\n var args = (arguments.length) ? [name] : [];\n return this._invoke('clearData', [name]);\n }\n});\n\n\n}, '@VERSION@', {\"requires\": [\"event-base\", \"node-core\", \"dom-base\"]});\n(function () {\nvar GLOBAL_ENV = YUI.Env;\n\nif (!GLOBAL_ENV._ready) {\n GLOBAL_ENV._ready = function() {\n GLOBAL_ENV.DOMReady = true;\n GLOBAL_ENV.remove(YUI.config.doc, 'DOMContentLoaded', GLOBAL_ENV._ready);\n };\n\n GLOBAL_ENV.add(YUI.config.doc, 'DOMContentLoaded', GLOBAL_ENV._ready);\n}\n})();\nYUI.add('event-base', function (Y, NAME) {\n\n/*\n * DOM event listener abstraction layer\n * @module event\n * @submodule event-base\n */\n\n/**\n * The domready event fires at the moment the browser's DOM is\n * usable. In most cases, this is before images are fully\n * downloaded, allowing you to provide a more responsive user\n * interface.\n *\n * In YUI 3, domready subscribers will be notified immediately if\n * that moment has already passed when the subscription is created.\n *\n * One exception is if the yui.js file is dynamically injected into\n * the page. If this is done, you must tell the YUI instance that\n * you did this in order for DOMReady (and window load events) to\n * fire normally. That configuration option is 'injected' -- set\n * it to true if the yui.js script is not included inline.\n *\n * This method is part of the 'event-ready' module, which is a\n * submodule of 'event'.\n *\n * @event domready\n * @for YUI\n */\nY.publish('domready', {\n fireOnce: true,\n async: true\n});\n\nif (YUI.Env.DOMReady) {\n Y.fire('domready');\n} else {\n Y.Do.before(function() { Y.fire('domready'); }, YUI.Env, '_ready');\n}\n\n/**\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event\n * @submodule event-base\n */\n\n/**\n * Wraps a DOM event, properties requiring browser abstraction are\n * fixed here. Provids a security layer when required.\n * @class DOMEventFacade\n * @param ev {Event} the DOM event\n * @param currentTarget {HTMLElement} the element the listener was attached to\n * @param wrapper {Event.Custom} the custom event wrapper for this DOM event\n */\n\n var ua = Y.UA,\n\n EMPTY = {},\n\n /**\n * webkit key remapping required for Safari < 3.1\n * @property webkitKeymap\n * @private\n */\n webkitKeymap = {\n 63232: 38, // up\n 63233: 40, // down\n 63234: 37, // left\n 63235: 39, // right\n 63276: 33, // page up\n 63277: 34, // page down\n 25: 9, // SHIFT-TAB (Safari provides a different key code in\n // this case, even though the shiftKey modifier is set)\n 63272: 46, // delete\n 63273: 36, // home\n 63275: 35 // end\n },\n\n /**\n * Returns a wrapped node. Intended to be used on event targets,\n * so it will return the node's parent if the target is a text\n * node.\n *\n * If accessing a property of the node throws an error, this is\n * probably the anonymous div wrapper Gecko adds inside text\n * nodes. This likely will only occur when attempting to access\n * the relatedTarget. In this case, we now return null because\n * the anonymous div is completely useless and we do not know\n * what the related target was because we can't even get to\n * the element's parent node.\n *\n * @method resolve\n * @private\n */\n resolve = function(n) {\n if (!n) {\n return n;\n }\n try {\n if (n && 3 == n.nodeType) {\n n = n.parentNode;\n }\n } catch(e) {\n return null;\n }\n\n return Y.one(n);\n },\n\n DOMEventFacade = function(ev, currentTarget, wrapper) {\n this._event = ev;\n this._currentTarget = currentTarget;\n this._wrapper = wrapper || EMPTY;\n\n // if not lazy init\n this.init();\n };\n\nY.extend(DOMEventFacade, Object, {\n\n init: function() {\n\n var e = this._event,\n overrides = this._wrapper.overrides,\n x = e.pageX,\n y = e.pageY,\n c,\n currentTarget = this._currentTarget;\n\n this.altKey = e.altKey;\n this.ctrlKey = e.ctrlKey;\n this.metaKey = e.metaKey;\n this.shiftKey = e.shiftKey;\n this.type = (overrides && overrides.type) || e.type;\n this.clientX = e.clientX;\n this.clientY = e.clientY;\n\n this.pageX = x;\n this.pageY = y;\n\n // charCode is unknown in keyup, keydown. keyCode is unknown in keypress.\n // FF 3.6 - 8+? pass 0 for keyCode in keypress events.\n // Webkit, FF 3.6-8+?, and IE9+? pass 0 for charCode in keydown, keyup.\n // Webkit and IE9+? duplicate charCode in keyCode.\n // Opera never sets charCode, always keyCode (though with the charCode).\n // IE6-8 don't set charCode or which.\n // All browsers other than IE6-8 set which=keyCode in keydown, keyup, and \n // which=charCode in keypress.\n //\n // Moral of the story: (e.which || e.keyCode) will always return the\n // known code for that key event phase. e.keyCode is often different in\n // keypress from keydown and keyup.\n c = e.keyCode || e.charCode;\n\n if (ua.webkit && (c in webkitKeymap)) {\n c = webkitKeymap[c];\n }\n\n this.keyCode = c;\n this.charCode = c;\n // Fill in e.which for IE - implementers should always use this over\n // e.keyCode or e.charCode.\n this.which = e.which || e.charCode || c;\n // this.button = e.button;\n this.button = this.which;\n\n this.target = resolve(e.target);\n this.currentTarget = resolve(currentTarget);\n this.relatedTarget = resolve(e.relatedTarget);\n\n if (e.type == \"mousewheel\" || e.type == \"DOMMouseScroll\") {\n this.wheelDelta = (e.detail) ? (e.detail * -1) : Math.round(e.wheelDelta / 80) || ((e.wheelDelta < 0) ? -1 : 1);\n }\n\n if (this._touch) {\n this._touch(e, currentTarget, this._wrapper);\n }\n },\n\n stopPropagation: function() {\n this._event.stopPropagation();\n this._wrapper.stopped = 1;\n this.stopped = 1;\n },\n\n stopImmediatePropagation: function() {\n var e = this._event;\n if (e.stopImmediatePropagation) {\n e.stopImmediatePropagation();\n } else {\n this.stopPropagation();\n }\n this._wrapper.stopped = 2;\n this.stopped = 2;\n },\n\n preventDefault: function(returnValue) {\n var e = this._event;\n e.preventDefault();\n e.returnValue = returnValue || false;\n this._wrapper.prevented = 1;\n this.prevented = 1;\n },\n\n halt: function(immediate) {\n if (immediate) {\n this.stopImmediatePropagation();\n } else {\n this.stopPropagation();\n }\n\n this.preventDefault();\n }\n\n});\n\nDOMEventFacade.resolve = resolve;\nY.DOM2EventFacade = DOMEventFacade;\nY.DOMEventFacade = DOMEventFacade;\n\n /**\n * The native event\n * @property _event\n * @type {Native DOM Event}\n * @private\n */\n\n /**\n The name of the event (e.g. \"click\")\n\n @property type\n @type {String}\n **/\n\n /**\n `true` if the \"alt\" or \"option\" key is pressed.\n\n @property altKey\n @type {Boolean}\n **/\n\n /**\n `true` if the shift key is pressed.\n\n @property shiftKey\n @type {Boolean}\n **/\n\n /**\n `true` if the \"Windows\" key on a Windows keyboard, \"command\" key on an\n Apple keyboard, or \"meta\" key on other keyboards is pressed.\n\n @property metaKey\n @type {Boolean}\n **/\n\n /**\n `true` if the \"Ctrl\" or \"control\" key is pressed.\n\n @property ctrlKey\n @type {Boolean}\n **/\n\n /**\n * The X location of the event on the page (including scroll)\n * @property pageX\n * @type {Number}\n */\n\n /**\n * The Y location of the event on the page (including scroll)\n * @property pageY\n * @type {Number}\n */\n\n /**\n * The X location of the event in the viewport\n * @property clientX\n * @type {Number}\n */\n\n /**\n * The Y location of the event in the viewport\n * @property clientY\n * @type {Number}\n */\n\n /**\n * The keyCode for key events. Uses charCode if keyCode is not available\n * @property keyCode\n * @type {Number}\n */\n\n /**\n * The charCode for key events. Same as keyCode\n * @property charCode\n * @type {Number}\n */\n\n /**\n * The button that was pushed. 1 for left click, 2 for middle click, 3 for\n * right click. This is only reliably populated on `mouseup` events.\n * @property button\n * @type {Number}\n */\n\n /**\n * The button that was pushed. Same as button.\n * @property which\n * @type {Number}\n */\n\n /**\n * Node reference for the targeted element\n * @property target\n * @type {Node}\n */\n\n /**\n * Node reference for the element that the listener was attached to.\n * @property currentTarget\n * @type {Node}\n */\n\n /**\n * Node reference to the relatedTarget\n * @property relatedTarget\n * @type {Node}\n */\n\n /**\n * Number representing the direction and velocity of the movement of the mousewheel.\n * Negative is down, the higher the number, the faster. Applies to the mousewheel event.\n * @property wheelDelta\n * @type {Number}\n */\n\n /**\n * Stops the propagation to the next bubble target\n * @method stopPropagation\n */\n\n /**\n * Stops the propagation to the next bubble target and\n * prevents any additional listeners from being exectued\n * on the current target.\n * @method stopImmediatePropagation\n */\n\n /**\n * Prevents the event's default behavior\n * @method preventDefault\n * @param returnValue {string} sets the returnValue of the event to this value\n * (rather than the default false value). This can be used to add a customized\n * confirmation query to the beforeunload event).\n */\n\n /**\n * Stops the event propagation and prevents the default\n * event behavior.\n * @method halt\n * @param immediate {boolean} if true additional listeners\n * on the current target will not be executed\n */\n(function() {\n/**\n * The event utility provides functions to add and remove event listeners,\n * event cleansing. It also tries to automatically remove listeners it\n * registers during the unload event.\n * @module event\n * @main event\n * @submodule event-base\n */\n\n/**\n * The event utility provides functions to add and remove event listeners,\n * event cleansing. It also tries to automatically remove listeners it\n * registers during the unload event.\n *\n * @class Event\n * @static\n */\n\nY.Env.evt.dom_wrappers = {};\nY.Env.evt.dom_map = {};\n\nvar YDOM = Y.DOM,\n _eventenv = Y.Env.evt,\n config = Y.config,\n win = config.win,\n add = YUI.Env.add,\n remove = YUI.Env.remove,\n\n onLoad = function() {\n YUI.Env.windowLoaded = true;\n Y.Event._load();\n remove(win, \"load\", onLoad);\n },\n\n onUnload = function() {\n Y.Event._unload();\n },\n\n EVENT_READY = 'domready',\n\n COMPAT_ARG = '~yui|2|compat~',\n\n shouldIterate = function(o) {\n try {\n // TODO: See if there's a more performant way to return true early on this, for the common case\n return (o && typeof o !== \"string\" && Y.Lang.isNumber(o.length) && !o.tagName && !YDOM.isWindow(o));\n } catch(ex) {\n Y.log(\"collection check failure\", \"warn\", \"event\");\n return false;\n }\n },\n\n // aliases to support DOM event subscription clean up when the last\n // subscriber is detached. deleteAndClean overrides the DOM event's wrapper\n // CustomEvent _delete method.\n _ceProtoDelete = Y.CustomEvent.prototype._delete,\n _deleteAndClean = function(s) {\n var ret = _ceProtoDelete.apply(this, arguments);\n\n if (!this.hasSubs()) {\n Y.Event._clean(this);\n }\n\n return ret;\n },\n\nEvent = function() {\n\n /**\n * True after the onload event has fired\n * @property _loadComplete\n * @type boolean\n * @static\n * @private\n */\n var _loadComplete = false,\n\n /**\n * The number of times to poll after window.onload. This number is\n * increased if additional late-bound handlers are requested after\n * the page load.\n * @property _retryCount\n * @static\n * @private\n */\n _retryCount = 0,\n\n /**\n * onAvailable listeners\n * @property _avail\n * @static\n * @private\n */\n _avail = [],\n\n /**\n * Custom event wrappers for DOM events. Key is\n * 'event:' + Element uid stamp + event type\n * @property _wrappers\n * @type Y.Event.Custom\n * @static\n * @private\n */\n _wrappers = _eventenv.dom_wrappers,\n\n _windowLoadKey = null,\n\n /**\n * Custom event wrapper map DOM events. Key is\n * Element uid stamp. Each item is a hash of custom event\n * wrappers as provided in the _wrappers collection. This\n * provides the infrastructure for getListeners.\n * @property _el_events\n * @static\n * @private\n */\n _el_events = _eventenv.dom_map;\n\n return {\n\n /**\n * The number of times we should look for elements that are not\n * in the DOM at the time the event is requested after the document\n * has been loaded. The default is 1000@amp;40 ms, so it will poll\n * for 40 seconds or until all outstanding handlers are bound\n * (whichever comes first).\n * @property POLL_RETRYS\n * @type int\n * @static\n * @final\n */\n POLL_RETRYS: 1000,\n\n /**\n * The poll interval in milliseconds\n * @property POLL_INTERVAL\n * @type int\n * @static\n * @final\n */\n POLL_INTERVAL: 40,\n\n /**\n * addListener/removeListener can throw errors in unexpected scenarios.\n * These errors are suppressed, the method returns false, and this property\n * is set\n * @property lastError\n * @static\n * @type Error\n */\n lastError: null,\n\n\n /**\n * poll handle\n * @property _interval\n * @static\n * @private\n */\n _interval: null,\n\n /**\n * document readystate poll handle\n * @property _dri\n * @static\n * @private\n */\n _dri: null,\n\n /**\n * True when the document is initially usable\n * @property DOMReady\n * @type boolean\n * @static\n */\n DOMReady: false,\n\n /**\n * @method startInterval\n * @static\n * @private\n */\n startInterval: function() {\n if (!Event._interval) {\nEvent._interval = setInterval(Event._poll, Event.POLL_INTERVAL);\n }\n },\n\n /**\n * Executes the supplied callback when the item with the supplied\n * id is found. This is meant to be used to execute behavior as\n * soon as possible as the page loads. If you use this after the\n * initial page load it will poll for a fixed time for the element.\n * The number of times it will poll and the frequency are\n * configurable. By default it will poll for 10 seconds.\n *\n * <p>The callback is executed with a single parameter:\n * the custom object parameter, if provided.</p>\n *\n * @method onAvailable\n *\n * @param {string||string[]} id the id of the element, or an array\n * of ids to look for.\n * @param {function} fn what to execute when the element is found.\n * @param {object} p_obj an optional object to be passed back as\n * a parameter to fn.\n * @param {boolean|object} p_override If set to true, fn will execute\n * in the context of p_obj, if set to an object it\n * will execute in the context of that object\n * @param checkContent {boolean} check child node readiness (onContentReady)\n * @static\n * @deprecated Use Y.on(\"available\")\n */\n // @TODO fix arguments\n onAvailable: function(id, fn, p_obj, p_override, checkContent, compat) {\n\n var a = Y.Array(id), i, availHandle;\n\n // Y.log('onAvailable registered for: ' + id);\n\n for (i=0; i<a.length; i=i+1) {\n _avail.push({\n id: a[i],\n fn: fn,\n obj: p_obj,\n override: p_override,\n checkReady: checkContent,\n compat: compat\n });\n }\n _retryCount = this.POLL_RETRYS;\n\n // We want the first test to be immediate, but async\n setTimeout(Event._poll, 0);\n\n availHandle = new Y.EventHandle({\n\n _delete: function() {\n // set by the event system for lazy DOM listeners\n if (availHandle.handle) {\n availHandle.handle.detach();\n return;\n }\n\n var i, j;\n\n // otherwise try to remove the onAvailable listener(s)\n for (i = 0; i < a.length; i++) {\n for (j = 0; j < _avail.length; j++) {\n if (a[i] === _avail[j].id) {\n _avail.splice(j, 1);\n }\n }\n }\n }\n\n });\n\n return availHandle;\n },\n\n /**\n * Works the same way as onAvailable, but additionally checks the\n * state of sibling elements to determine if the content of the\n * available element is safe to modify.\n *\n * <p>The callback is executed with a single parameter:\n * the custom object parameter, if provided.</p>\n *\n * @method onContentReady\n *\n * @param {string} id the id of the element to look for.\n * @param {function} fn what to execute when the element is ready.\n * @param {object} obj an optional object to be passed back as\n * a parameter to fn.\n * @param {boolean|object} override If set to true, fn will execute\n * in the context of p_obj. If an object, fn will\n * exectute in the context of that object\n *\n * @static\n * @deprecated Use Y.on(\"contentready\")\n */\n // @TODO fix arguments\n onContentReady: function(id, fn, obj, override, compat) {\n return Event.onAvailable(id, fn, obj, override, true, compat);\n },\n\n /**\n * Adds an event listener\n *\n * @method attach\n *\n * @param {String} type The type of event to append\n * @param {Function} fn The method the event invokes\n * @param {String|HTMLElement|Array|NodeList} el An id, an element\n * reference, or a collection of ids and/or elements to assign the\n * listener to.\n * @param {Object} context optional context object\n * @param {Boolean|object} args 0..n arguments to pass to the callback\n * @return {EventHandle} an object to that can be used to detach the listener\n *\n * @static\n */\n\n attach: function(type, fn, el, context) {\n return Event._attach(Y.Array(arguments, 0, true));\n },\n\n _createWrapper: function (el, type, capture, compat, facade) {\n\n var cewrapper,\n ek = Y.stamp(el),\n key = 'event:' + ek + type;\n\n if (false === facade) {\n key += 'native';\n }\n if (capture) {\n key += 'capture';\n }\n\n\n cewrapper = _wrappers[key];\n\n\n if (!cewrapper) {\n // create CE wrapper\n cewrapper = Y.publish(key, {\n silent: true,\n bubbles: false,\n contextFn: function() {\n if (compat) {\n return cewrapper.el;\n } else {\n cewrapper.nodeRef = cewrapper.nodeRef || Y.one(cewrapper.el);\n return cewrapper.nodeRef;\n }\n }\n });\n\n cewrapper.overrides = {};\n\n // for later removeListener calls\n cewrapper.el = el;\n cewrapper.key = key;\n cewrapper.domkey = ek;\n cewrapper.type = type;\n cewrapper.fn = function(e) {\n cewrapper.fire(Event.getEvent(e, el, (compat || (false === facade))));\n };\n cewrapper.capture = capture;\n\n if (el == win && type == \"load\") {\n // window load happens once\n cewrapper.fireOnce = true;\n _windowLoadKey = key;\n }\n cewrapper._delete = _deleteAndClean;\n\n _wrappers[key] = cewrapper;\n _el_events[ek] = _el_events[ek] || {};\n _el_events[ek][key] = cewrapper;\n\n add(el, type, cewrapper.fn, capture);\n }\n\n return cewrapper;\n\n },\n\n _attach: function(args, conf) {\n\n var compat,\n handles, oEl, cewrapper, context,\n fireNow = false, ret,\n type = args[0],\n fn = args[1],\n el = args[2] || win,\n facade = conf && conf.facade,\n capture = conf && conf.capture,\n overrides = conf && conf.overrides;\n\n if (args[args.length-1] === COMPAT_ARG) {\n compat = true;\n }\n\n if (!fn || !fn.call) {\n// throw new TypeError(type + \" attach call failed, callback undefined\");\nY.log(type + \" attach call failed, invalid callback\", \"error\", \"event\");\n return false;\n }\n\n // The el argument can be an array of elements or element ids.\n if (shouldIterate(el)) {\n\n handles=[];\n\n Y.each(el, function(v, k) {\n args[2] = v;\n handles.push(Event._attach(args.slice(), conf));\n });\n\n // return (handles.length === 1) ? handles[0] : handles;\n return new Y.EventHandle(handles);\n\n // If the el argument is a string, we assume it is\n // actually the id of the element. If the page is loaded\n // we convert el to the actual element, otherwise we\n // defer attaching the event until the element is\n // ready\n } else if (Y.Lang.isString(el)) {\n\n // oEl = (compat) ? Y.DOM.byId(el) : Y.Selector.query(el);\n\n if (compat) {\n oEl = YDOM.byId(el);\n } else {\n\n oEl = Y.Selector.query(el);\n\n switch (oEl.length) {\n case 0:\n oEl = null;\n break;\n case 1:\n oEl = oEl[0];\n break;\n default:\n args[2] = oEl;\n return Event._attach(args, conf);\n }\n }\n\n if (oEl) {\n\n el = oEl;\n\n // Not found = defer adding the event until the element is available\n } else {\n\n // Y.log(el + ' not found');\n ret = Event.onAvailable(el, function() {\n // Y.log('lazy attach: ' + args);\n\n ret.handle = Event._attach(args, conf);\n\n }, Event, true, false, compat);\n\n return ret;\n\n }\n }\n\n // Element should be an html element or node\n if (!el) {\n Y.log(\"unable to attach event \" + type, \"warn\", \"event\");\n return false;\n }\n\n if (Y.Node && Y.instanceOf(el, Y.Node)) {\n el = Y.Node.getDOMNode(el);\n }\n\n cewrapper = Event._createWrapper(el, type, capture, compat, facade);\n if (overrides) {\n Y.mix(cewrapper.overrides, overrides);\n }\n\n if (el == win && type == \"load\") {\n\n // if the load is complete, fire immediately.\n // all subscribers, including the current one\n // will be notified.\n if (YUI.Env.windowLoaded) {\n fireNow = true;\n }\n }\n\n if (compat) {\n args.pop();\n }\n\n context = args[3];\n\n // set context to the Node if not specified\n // ret = cewrapper.on.apply(cewrapper, trimmedArgs);\n ret = cewrapper._on(fn, context, (args.length > 4) ? args.slice(4) : null);\n\n if (fireNow) {\n cewrapper.fire();\n }\n\n return ret;\n\n },\n\n /**\n * Removes an event listener. Supports the signature the event was bound\n * with, but the preferred way to remove listeners is using the handle\n * that is returned when using Y.on\n *\n * @method detach\n *\n * @param {String} type the type of event to remove.\n * @param {Function} fn the method the event invokes. If fn is\n * undefined, then all event handlers for the type of event are\n * removed.\n * @param {String|HTMLElement|Array|NodeList|EventHandle} el An\n * event handle, an id, an element reference, or a collection\n * of ids and/or elements to remove the listener from.\n * @return {boolean} true if the unbind was successful, false otherwise.\n * @static\n */\n detach: function(type, fn, el, obj) {\n\n var args=Y.Array(arguments, 0, true), compat, l, ok, i,\n id, ce;\n\n if (args[args.length-1] === COMPAT_ARG) {\n compat = true;\n // args.pop();\n }\n\n if (type && type.detach) {\n return type.detach();\n }\n\n // The el argument can be a string\n if (typeof el == \"string\") {\n\n // el = (compat) ? Y.DOM.byId(el) : Y.all(el);\n if (compat) {\n el = YDOM.byId(el);\n } else {\n el = Y.Selector.query(el);\n l = el.length;\n if (l < 1) {\n el = null;\n } else if (l == 1) {\n el = el[0];\n }\n }\n // return Event.detach.apply(Event, args);\n }\n\n if (!el) {\n return false;\n }\n\n if (el.detach) {\n args.splice(2, 1);\n return el.detach.apply(el, args);\n // The el argument can be an array of elements or element ids.\n } else if (shouldIterate(el)) {\n ok = true;\n for (i=0, l=el.length; i<l; ++i) {\n args[2] = el[i];\n ok = ( Y.Event.detach.apply(Y.Event, args) && ok );\n }\n\n return ok;\n }\n\n if (!type || !fn || !fn.call) {\n return Event.purgeElement(el, false, type);\n }\n\n id = 'event:' + Y.stamp(el) + type;\n ce = _wrappers[id];\n\n if (ce) {\n return ce.detach(fn);\n } else {\n return false;\n }\n\n },\n\n /**\n * Finds the event in the window object, the caller's arguments, or\n * in the arguments of another method in the callstack. This is\n * executed automatically for events registered through the event\n * manager, so the implementer should not normally need to execute\n * this function at all.\n * @method getEvent\n * @param {Event} e the event parameter from the handler\n * @param {HTMLElement} el the element the listener was attached to\n * @return {Event} the event\n * @static\n */\n getEvent: function(e, el, noFacade) {\n var ev = e || win.event;\n\n return (noFacade) ? ev :\n new Y.DOMEventFacade(ev, el, _wrappers['event:' + Y.stamp(el) + e.type]);\n },\n\n /**\n * Generates an unique ID for the element if it does not already\n * have one.\n * @method generateId\n * @param el the element to create the id for\n * @return {string} the resulting id of the element\n * @static\n */\n generateId: function(el) {\n return YDOM.generateID(el);\n },\n\n /**\n * We want to be able to use getElementsByTagName as a collection\n * to attach a group of events to. Unfortunately, different\n * browsers return different types of collections. This function\n * tests to determine if the object is array-like. It will also\n * fail if the object is an array, but is empty.\n * @method _isValidCollection\n * @param o the object to test\n * @return {boolean} true if the object is array-like and populated\n * @deprecated was not meant to be used directly\n * @static\n * @private\n */\n _isValidCollection: shouldIterate,\n\n /**\n * hook up any deferred listeners\n * @method _load\n * @static\n * @private\n */\n _load: function(e) {\n if (!_loadComplete) {\n // Y.log('Load Complete', 'info', 'event');\n _loadComplete = true;\n\n // Just in case DOMReady did not go off for some reason\n // E._ready();\n if (Y.fire) {\n Y.fire(EVENT_READY);\n }\n\n // Available elements may not have been detected before the\n // window load event fires. Try to find them now so that the\n // the user is more likely to get the onAvailable notifications\n // before the window load notification\n Event._poll();\n }\n },\n\n /**\n * Polling function that runs before the onload event fires,\n * attempting to attach to DOM Nodes as soon as they are\n * available\n * @method _poll\n * @static\n * @private\n */\n _poll: function() {\n if (Event.locked) {\n return;\n }\n\n if (Y.UA.ie && !YUI.Env.DOMReady) {\n // Hold off if DOMReady has not fired and check current\n // readyState to protect against the IE operation aborted\n // issue.\n Event.startInterval();\n return;\n }\n\n Event.locked = true;\n\n // Y.log.debug(\"poll\");\n // keep trying until after the page is loaded. We need to\n // check the page load state prior to trying to bind the\n // elements so that we can be certain all elements have been\n // tested appropriately\n var i, len, item, el, notAvail, executeItem,\n tryAgain = !_loadComplete;\n\n if (!tryAgain) {\n tryAgain = (_retryCount > 0);\n }\n\n // onAvailable\n notAvail = [];\n\n executeItem = function (el, item) {\n var context, ov = item.override;\n try {\n if (item.compat) {\n if (item.override) {\n if (ov === true) {\n context = item.obj;\n } else {\n context = ov;\n }\n } else {\n context = el;\n }\n item.fn.call(context, item.obj);\n } else {\n context = item.obj || Y.one(el);\n item.fn.apply(context, (Y.Lang.isArray(ov)) ? ov : []);\n }\n } catch (e) {\n Y.log(\"Error in available or contentReady callback\", 'error', 'event');\n }\n };\n\n // onAvailable\n for (i=0,len=_avail.length; i<len; ++i) {\n item = _avail[i];\n if (item && !item.checkReady) {\n\n // el = (item.compat) ? Y.DOM.byId(item.id) : Y.one(item.id);\n el = (item.compat) ? YDOM.byId(item.id) : Y.Selector.query(item.id, null, true);\n\n if (el) {\n // Y.log('avail: ' + el);\n executeItem(el, item);\n _avail[i] = null;\n } else {\n // Y.log('NOT avail: ' + el);\n notAvail.push(item);\n }\n }\n }\n\n // onContentReady\n for (i=0,len=_avail.length; i<len; ++i) {\n item = _avail[i];\n if (item && item.checkReady) {\n\n // el = (item.compat) ? Y.DOM.byId(item.id) : Y.one(item.id);\n el = (item.compat) ? YDOM.byId(item.id) : Y.Selector.query(item.id, null, true);\n\n if (el) {\n // The element is available, but not necessarily ready\n // @todo should we test parentNode.nextSibling?\n if (_loadComplete || (el.get && el.get('nextSibling')) || el.nextSibling) {\n executeItem(el, item);\n _avail[i] = null;\n }\n } else {\n notAvail.push(item);\n }\n }\n }\n\n _retryCount = (notAvail.length === 0) ? 0 : _retryCount - 1;\n\n if (tryAgain) {\n // we may need to strip the nulled out items here\n Event.startInterval();\n } else {\n clearInterval(Event._interval);\n Event._interval = null;\n }\n\n Event.locked = false;\n\n return;\n\n },\n\n /**\n * Removes all listeners attached to the given element via addListener.\n * Optionally, the node's children can also be purged.\n * Optionally, you can specify a specific type of event to remove.\n * @method purgeElement\n * @param {HTMLElement} el the element to purge\n * @param {boolean} recurse recursively purge this element's children\n * as well. Use with caution.\n * @param {string} type optional type of listener to purge. If\n * left out, all listeners will be removed\n * @static\n */\n purgeElement: function(el, recurse, type) {\n // var oEl = (Y.Lang.isString(el)) ? Y.one(el) : el,\n var oEl = (Y.Lang.isString(el)) ? Y.Selector.query(el, null, true) : el,\n lis = Event.getListeners(oEl, type), i, len, children, child;\n\n if (recurse && oEl) {\n lis = lis || [];\n children = Y.Selector.query('*', oEl);\n len = children.length;\n for (i = 0; i < len; ++i) {\n child = Event.getListeners(children[i], type);\n if (child) {\n lis = lis.concat(child);\n }\n }\n }\n\n if (lis) {\n for (i = 0, len = lis.length; i < len; ++i) {\n lis[i].detachAll();\n }\n }\n\n },\n\n /**\n * Removes all object references and the DOM proxy subscription for\n * a given event for a DOM node.\n *\n * @method _clean\n * @param wrapper {CustomEvent} Custom event proxy for the DOM\n * subscription\n * @private\n * @static\n * @since 3.4.0\n */\n _clean: function (wrapper) {\n var key = wrapper.key,\n domkey = wrapper.domkey;\n\n remove(wrapper.el, wrapper.type, wrapper.fn, wrapper.capture);\n delete _wrappers[key];\n delete Y._yuievt.events[key];\n if (_el_events[domkey]) {\n delete _el_events[domkey][key];\n if (!Y.Object.size(_el_events[domkey])) {\n delete _el_events[domkey];\n }\n }\n },\n\n /**\n * Returns all listeners attached to the given element via addListener.\n * Optionally, you can specify a specific type of event to return.\n * @method getListeners\n * @param el {HTMLElement|string} the element or element id to inspect\n * @param type {string} optional type of listener to return. If\n * left out, all listeners will be returned\n * @return {CustomEvent} the custom event wrapper for the DOM event(s)\n * @static\n */\n getListeners: function(el, type) {\n var ek = Y.stamp(el, true), evts = _el_events[ek],\n results=[] , key = (type) ? 'event:' + ek + type : null,\n adapters = _eventenv.plugins;\n\n if (!evts) {\n return null;\n }\n\n if (key) {\n // look for synthetic events\n if (adapters[type] && adapters[type].eventDef) {\n key += '_synth';\n }\n\n if (evts[key]) {\n results.push(evts[key]);\n }\n\n // get native events as well\n key += 'native';\n if (evts[key]) {\n results.push(evts[key]);\n }\n\n } else {\n Y.each(evts, function(v, k) {\n results.push(v);\n });\n }\n\n return (results.length) ? results : null;\n },\n\n /**\n * Removes all listeners registered by pe.event. Called\n * automatically during the unload event.\n * @method _unload\n * @static\n * @private\n */\n _unload: function(e) {\n Y.each(_wrappers, function(v, k) {\n if (v.type == 'unload') {\n v.fire(e);\n }\n v.detachAll();\n });\n remove(win, \"unload\", onUnload);\n },\n\n /**\n * Adds a DOM event directly without the caching, cleanup, context adj, etc\n *\n * @method nativeAdd\n * @param {HTMLElement} el the element to bind the handler to\n * @param {string} type the type of event handler\n * @param {function} fn the callback to invoke\n * @param {boolen} capture capture or bubble phase\n * @static\n * @private\n */\n nativeAdd: add,\n\n /**\n * Basic remove listener\n *\n * @method nativeRemove\n * @param {HTMLElement} el the element to bind the handler to\n * @param {string} type the type of event handler\n * @param {function} fn the callback to invoke\n * @param {boolen} capture capture or bubble phase\n * @static\n * @private\n */\n nativeRemove: remove\n };\n\n}();\n\nY.Event = Event;\n\nif (config.injected || YUI.Env.windowLoaded) {\n onLoad();\n} else {\n add(win, \"load\", onLoad);\n}\n\n// Process onAvailable/onContentReady items when when the DOM is ready in IE\nif (Y.UA.ie) {\n Y.on(EVENT_READY, Event._poll);\n}\n\ntry {\n add(win, \"unload\", onUnload);\n} catch(e) {\n Y.log(\"Registering unload listener failed. This is known to happen in Chrome Packaged Apps and Extensions, which don't support unload, and don't provide a way to test for support\", \"warn\", \"event-base\");\n}\n\nEvent.Custom = Y.CustomEvent;\nEvent.Subscriber = Y.Subscriber;\nEvent.Target = Y.EventTarget;\nEvent.Handle = Y.EventHandle;\nEvent.Facade = Y.EventFacade;\n\nEvent._poll();\n\n}());\n\n/**\n * DOM event listener abstraction layer\n * @module event\n * @submodule event-base\n */\n\n/**\n * Executes the callback as soon as the specified element\n * is detected in the DOM. This function expects a selector\n * string for the element(s) to detect. If you already have\n * an element reference, you don't need this event.\n * @event available\n * @param type {string} 'available'\n * @param fn {function} the callback function to execute.\n * @param el {string} an selector for the element(s) to attach\n * @param context optional argument that specifies what 'this' refers to.\n * @param args* 0..n additional arguments to pass on to the callback function.\n * These arguments will be added after the event object.\n * @return {EventHandle} the detach handle\n * @for YUI\n */\nY.Env.evt.plugins.available = {\n on: function(type, fn, id, o) {\n var a = arguments.length > 4 ? Y.Array(arguments, 4, true) : null;\n return Y.Event.onAvailable.call(Y.Event, id, fn, o, a);\n }\n};\n\n/**\n * Executes the callback as soon as the specified element\n * is detected in the DOM with a nextSibling property\n * (indicating that the element's children are available).\n * This function expects a selector\n * string for the element(s) to detect. If you already have\n * an element reference, you don't need this event.\n * @event contentready\n * @param type {string} 'contentready'\n * @param fn {function} the callback function to execute.\n * @param el {string} an selector for the element(s) to attach.\n * @param context optional argument that specifies what 'this' refers to.\n * @param args* 0..n additional arguments to pass on to the callback function.\n * These arguments will be added after the event object.\n * @return {EventHandle} the detach handle\n * @for YUI\n */\nY.Env.evt.plugins.contentready = {\n on: function(type, fn, id, o) {\n var a = arguments.length > 4 ? Y.Array(arguments, 4, true) : null;\n return Y.Event.onContentReady.call(Y.Event, id, fn, o, a);\n }\n};\n\n\n}, '@VERSION@', {\"requires\": [\"event-custom-base\"]});\n(function() {\n\nvar stateChangeListener,\n GLOBAL_ENV = YUI.Env,\n config = YUI.config,\n doc = config.doc,\n docElement = doc && doc.documentElement,\n EVENT_NAME = 'onreadystatechange',\n pollInterval = config.pollInterval || 40;\n\nif (docElement.doScroll && !GLOBAL_ENV._ieready) {\n GLOBAL_ENV._ieready = function() {\n GLOBAL_ENV._ready();\n };\n\n/*! DOMReady: based on work by: Dean Edwards/John Resig/Matthias Miller/Diego Perini */\n// Internet Explorer: use the doScroll() method on the root element.\n// This isolates what appears to be a safe moment to manipulate the\n// DOM prior to when the document's readyState suggests it is safe to do so.\n if (self !== self.top) {\n stateChangeListener = function() {\n if (doc.readyState == 'complete') {\n GLOBAL_ENV.remove(doc, EVENT_NAME, stateChangeListener);\n GLOBAL_ENV.ieready();\n }\n };\n GLOBAL_ENV.add(doc, EVENT_NAME, stateChangeListener);\n } else {\n GLOBAL_ENV._dri = setInterval(function() {\n try {\n docElement.doScroll('left');\n clearInterval(GLOBAL_ENV._dri);\n GLOBAL_ENV._dri = null;\n GLOBAL_ENV._ieready();\n } catch (domNotReady) { }\n }, pollInterval);\n }\n}\n\n})();\nYUI.add('event-base-ie', function (Y, NAME) {\n\n/*\n * Custom event engine, DOM event listener abstraction layer, synthetic DOM\n * events.\n * @module event\n * @submodule event-base\n */\n\nfunction IEEventFacade() {\n // IEEventFacade.superclass.constructor.apply(this, arguments);\n Y.DOM2EventFacade.apply(this, arguments);\n}\n\n/*\n * (intentially left out of API docs)\n * Alternate Facade implementation that is based on Object.defineProperty, which\n * is partially supported in IE8. Properties that involve setup work are\n * deferred to temporary getters using the static _define method.\n */\nfunction IELazyFacade(e) {\n var proxy = Y.config.doc.createEventObject(e),\n proto = IELazyFacade.prototype;\n\n // TODO: necessary?\n proxy.hasOwnProperty = function () { return true; };\n\n proxy.init = proto.init;\n proxy.halt = proto.halt;\n proxy.preventDefault = proto.preventDefault;\n proxy.stopPropagation = proto.stopPropagation;\n proxy.stopImmediatePropagation = proto.stopImmediatePropagation;\n\n Y.DOM2EventFacade.apply(proxy, arguments);\n\n return proxy;\n}\n\n\nvar imp = Y.config.doc && Y.config.doc.implementation,\n useLazyFacade = Y.config.lazyEventFacade,\n\n buttonMap = {\n 0: 1, // left click\n 4: 2, // middle click\n 2: 3 // right click\n },\n relatedTargetMap = {\n mouseout: 'toElement',\n mouseover: 'fromElement'\n },\n\n resolve = Y.DOM2EventFacade.resolve,\n\n proto = {\n init: function() {\n\n IEEventFacade.superclass.init.apply(this, arguments);\n\n var e = this._event,\n x, y, d, b, de, t;\n\n this.target = resolve(e.srcElement);\n\n if (('clientX' in e) && (!x) && (0 !== x)) {\n x = e.clientX;\n y = e.clientY;\n\n d = Y.config.doc;\n b = d.body;\n de = d.documentElement;\n\n x += (de.scrollLeft || (b && b.scrollLeft) || 0);\n y += (de.scrollTop || (b && b.scrollTop) || 0);\n\n this.pageX = x;\n this.pageY = y;\n }\n\n if (e.type == \"mouseout\") {\n t = e.toElement;\n } else if (e.type == \"mouseover\") {\n t = e.fromElement;\n }\n\n // fallback to t.relatedTarget to support simulated events.\n // IE doesn't support setting toElement or fromElement on generic\n // events, so Y.Event.simulate sets relatedTarget instead.\n this.relatedTarget = resolve(t || e.relatedTarget);\n\n // which should contain the unicode key code if this is a key event.\n // For click events, which is normalized for which mouse button was\n // clicked.\n this.which = // chained assignment\n this.button = e.keyCode || buttonMap[e.button] || e.button;\n },\n\n stopPropagation: function() {\n this._event.cancelBubble = true;\n this._wrapper.stopped = 1;\n this.stopped = 1;\n },\n\n stopImmediatePropagation: function() {\n this.stopPropagation();\n this._wrapper.stopped = 2;\n this.stopped = 2;\n },\n\n preventDefault: function(returnValue) {\n this._event.returnValue = returnValue || false;\n this._wrapper.prevented = 1;\n this.prevented = 1;\n }\n };\n\nY.extend(IEEventFacade, Y.DOM2EventFacade, proto);\n\nY.extend(IELazyFacade, Y.DOM2EventFacade, proto);\nIELazyFacade.prototype.init = function () {\n var e = this._event,\n overrides = this._wrapper.overrides,\n define = IELazyFacade._define,\n lazyProperties = IELazyFacade._lazyProperties,\n prop;\n\n this.altKey = e.altKey;\n this.ctrlKey = e.ctrlKey;\n this.metaKey = e.metaKey;\n this.shiftKey = e.shiftKey;\n this.type = (overrides && overrides.type) || e.type;\n this.clientX = e.clientX;\n this.clientY = e.clientY;\n this.keyCode = // chained assignment\n this.charCode = e.keyCode;\n this.which = // chained assignment\n this.button = e.keyCode || buttonMap[e.button] || e.button;\n\n for (prop in lazyProperties) {\n if (lazyProperties.hasOwnProperty(prop)) {\n define(this, prop, lazyProperties[prop]);\n }\n }\n\n if (this._touch) {\n this._touch(e, this._currentTarget, this._wrapper);\n }\n};\n\nIELazyFacade._lazyProperties = {\n target: function () {\n return resolve(this._event.srcElement);\n },\n relatedTarget: function () {\n var e = this._event,\n targetProp = relatedTargetMap[e.type] || 'relatedTarget';\n\n // fallback to t.relatedTarget to support simulated events.\n // IE doesn't support setting toElement or fromElement on generic\n // events, so Y.Event.simulate sets relatedTarget instead.\n return resolve(e[targetProp] || e.relatedTarget);\n },\n currentTarget: function () {\n return resolve(this._currentTarget);\n },\n\n wheelDelta: function () {\n var e = this._event;\n\n if (e.type === \"mousewheel\" || e.type === \"DOMMouseScroll\") {\n return (e.detail) ?\n (e.detail * -1) :\n // wheelDelta between -80 and 80 result in -1 or 1\n Math.round(e.wheelDelta / 80) || ((e.wheelDelta < 0) ? -1 : 1);\n }\n },\n\n pageX: function () {\n var e = this._event,\n val = e.pageX,\n doc, bodyScroll, docScroll;\n \n if (val === undefined) {\n doc = Y.config.doc;\n bodyScroll = doc.body && doc.body.scrollLeft;\n docScroll = doc.documentElement.scrollLeft;\n\n val = e.clientX + (docScroll || bodyScroll || 0);\n }\n\n return val;\n },\n pageY: function () {\n var e = this._event,\n val = e.pageY,\n doc, bodyScroll, docScroll;\n \n if (val === undefined) {\n doc = Y.config.doc;\n bodyScroll = doc.body && doc.body.scrollTop;\n docScroll = doc.documentElement.scrollTop;\n\n val = e.clientY + (docScroll || bodyScroll || 0);\n }\n\n return val;\n }\n};\n\n\n/**\n * Wrapper function for Object.defineProperty that creates a property whose\n * value will be calulated only when asked for. After calculating the value,\n * the getter wll be removed, so it will behave as a normal property beyond that\n * point. A setter is also assigned so assigning to the property will clear\n * the getter, so foo.prop = 'a'; foo.prop; won't trigger the getter,\n * overwriting value 'a'.\n *\n * Used only by the DOMEventFacades used by IE8 when the YUI configuration\n * <code>lazyEventFacade</code> is set to true.\n *\n * @method _define\n * @param o {DOMObject} A DOM object to add the property to\n * @param prop {String} The name of the new property\n * @param valueFn {Function} The function that will return the initial, default\n * value for the property.\n * @static\n * @private\n */\nIELazyFacade._define = function (o, prop, valueFn) {\n function val(v) {\n var ret = (arguments.length) ? v : valueFn.call(this);\n\n delete o[prop];\n Object.defineProperty(o, prop, {\n value: ret,\n configurable: true,\n writable: true\n });\n return ret;\n }\n Object.defineProperty(o, prop, {\n get: val,\n set: val,\n configurable: true\n });\n};\n\nif (imp && (!imp.hasFeature('Events', '2.0'))) {\n if (useLazyFacade) {\n // Make sure we can use the lazy facade logic\n try {\n Object.defineProperty(Y.config.doc.createEventObject(), 'z', {});\n } catch (e) {\n useLazyFacade = false;\n }\n }\n \n Y.DOMEventFacade = (useLazyFacade) ? IELazyFacade : IEEventFacade;\n}\n\n\n}, '@VERSION@', {\"requires\": [\"node-base\"]});\nYUI.add('pluginhost-base', function (Y, NAME) {\n\n /**\n * Provides the augmentable PluginHost interface, which can be added to any class.\n * @module pluginhost\n */\n\n /**\n * Provides the augmentable PluginHost interface, which can be added to any class.\n * @module pluginhost-base\n */\n\n /**\n * <p>\n * An augmentable class, which provides the augmented class with the ability to host plugins.\n * It adds <a href=\"#method_plug\">plug</a> and <a href=\"#method_unplug\">unplug</a> methods to the augmented class, which can \n * be used to add or remove plugins from instances of the class.\n * </p>\n *\n * <p>Plugins can also be added through the constructor configuration object passed to the host class' constructor using\n * the \"plugins\" property. Supported values for the \"plugins\" property are those defined by the <a href=\"#method_plug\">plug</a> method. \n * \n * For example the following code would add the AnimPlugin and IOPlugin to Overlay (the plugin host):\n * <xmp>\n * var o = new Overlay({plugins: [ AnimPlugin, {fn:IOPlugin, cfg:{section:\"header\"}}]});\n * </xmp>\n * </p>\n * <p>\n * Plug.Host's protected <a href=\"#method_initPlugins\">_initPlugins</a> and <a href=\"#method_destroyPlugins\">_destroyPlugins</a> \n * methods should be invoked by the host class at the appropriate point in the host's lifecyle. \n * </p>\n *\n * @class Plugin.Host\n */\n\n var L = Y.Lang;\n\n function PluginHost() {\n this._plugins = {};\n }\n\n PluginHost.prototype = {\n\n /**\n * Adds a plugin to the host object. This will instantiate the \n * plugin and attach it to the configured namespace on the host object.\n *\n * @method plug\n * @chainable\n * @param P {Function | Object |Array} Accepts the plugin class, or an \n * object with a \"fn\" property specifying the plugin class and \n * a \"cfg\" property specifying the configuration for the Plugin.\n * <p>\n * Additionally an Array can also be passed in, with the above function or \n * object values, allowing the user to add multiple plugins in a single call.\n * </p>\n * @param config (Optional) If the first argument is the plugin class, the second argument\n * can be the configuration for the plugin.\n * @return {Base} A reference to the host object\n */\n plug: function(Plugin, config) {\n var i, ln, ns;\n\n if (L.isArray(Plugin)) {\n for (i = 0, ln = Plugin.length; i < ln; i++) {\n this.plug(Plugin[i]);\n }\n } else {\n if (Plugin && !L.isFunction(Plugin)) {\n config = Plugin.cfg;\n Plugin = Plugin.fn;\n }\n\n // Plugin should be fn by now\n if (Plugin && Plugin.NS) {\n ns = Plugin.NS;\n \n config = config || {};\n config.host = this;\n \n if (this.hasPlugin(ns)) {\n // Update config\n if (this[ns].setAttrs) {\n this[ns].setAttrs(config);\n }\n else { Y.log(\"Attempt to replug an already attached plugin, and we can't setAttrs, because it's not Attribute based: \" + ns); }\n } else {\n // Create new instance\n this[ns] = new Plugin(config);\n this._plugins[ns] = Plugin;\n }\n }\n else { Y.log(\"Attempt to plug in an invalid plugin. Host:\" + this + \", Plugin:\" + Plugin); }\n }\n return this;\n },\n\n /**\n * Removes a plugin from the host object. This will destroy the \n * plugin instance and delete the namespace from the host object. \n *\n * @method unplug\n * @param {String | Function} plugin The namespace of the plugin, or the plugin class with the static NS namespace property defined. If not provided,\n * all registered plugins are unplugged.\n * @return {Base} A reference to the host object\n * @chainable\n */\n unplug: function(plugin) {\n var ns = plugin, \n plugins = this._plugins;\n \n if (plugin) {\n if (L.isFunction(plugin)) {\n ns = plugin.NS;\n if (ns && (!plugins[ns] || plugins[ns] !== plugin)) {\n ns = null;\n }\n }\n \n if (ns) {\n if (this[ns]) {\n if (this[ns].destroy) {\n this[ns].destroy();\n }\n delete this[ns];\n }\n if (plugins[ns]) {\n delete plugins[ns];\n }\n }\n } else {\n for (ns in this._plugins) {\n if (this._plugins.hasOwnProperty(ns)) {\n this.unplug(ns);\n }\n }\n }\n return this;\n },\n\n /**\n * Determines if a plugin has plugged into this host.\n *\n * @method hasPlugin\n * @param {String} ns The plugin's namespace\n * @return {Plugin} Returns a truthy value (the plugin instance) if present, or undefined if not.\n */\n hasPlugin : function(ns) {\n return (this._plugins[ns] && this[ns]);\n },\n\n /**\n * Initializes static plugins registered on the host (using the\n * Base.plug static method) and any plugins passed to the \n * instance through the \"plugins\" configuration property.\n *\n * @method _initPlugins\n * @param {Config} config The configuration object with property name/value pairs.\n * @private\n */\n \n _initPlugins: function(config) {\n this._plugins = this._plugins || {};\n\n if (this._initConfigPlugins) {\n this._initConfigPlugins(config);\n }\n },\n\n /**\n * Unplugs and destroys all plugins on the host\n * @method _destroyPlugins\n * @private\n */\n _destroyPlugins: function() {\n this.unplug();\n }\n };\n\n Y.namespace(\"Plugin\").Host = PluginHost;\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('pluginhost-config', function (Y, NAME) {\n\n /**\n * Adds pluginhost constructor configuration and static configuration support\n * @submodule pluginhost-config\n */\n\n var PluginHost = Y.Plugin.Host,\n L = Y.Lang;\n\n /**\n * A protected initialization method, used by the host class to initialize\n * plugin configurations passed the constructor, through the config object.\n * \n * Host objects should invoke this method at the appropriate time in their\n * construction lifecycle.\n * \n * @method _initConfigPlugins\n * @param {Object} config The configuration object passed to the constructor\n * @protected\n * @for Plugin.Host\n */\n PluginHost.prototype._initConfigPlugins = function(config) {\n\n // Class Configuration\n var classes = (this._getClasses) ? this._getClasses() : [this.constructor],\n plug = [],\n unplug = {},\n constructor, i, classPlug, classUnplug, pluginClassName;\n\n // TODO: Room for optimization. Can we apply statically/unplug in same pass?\n for (i = classes.length - 1; i >= 0; i--) {\n constructor = classes[i];\n\n classUnplug = constructor._UNPLUG;\n if (classUnplug) {\n // subclasses over-write\n Y.mix(unplug, classUnplug, true);\n }\n\n classPlug = constructor._PLUG;\n if (classPlug) {\n // subclasses over-write\n Y.mix(plug, classPlug, true);\n }\n }\n\n for (pluginClassName in plug) {\n if (plug.hasOwnProperty(pluginClassName)) {\n if (!unplug[pluginClassName]) {\n this.plug(plug[pluginClassName]);\n }\n }\n }\n\n // User Configuration\n if (config && config.plugins) {\n this.plug(config.plugins);\n }\n };\n \n /**\n * Registers plugins to be instantiated at the class level (plugins \n * which should be plugged into every instance of the class by default).\n *\n * @method plug\n * @static\n *\n * @param {Function} hostClass The host class on which to register the plugins\n * @param {Function | Array} plugin Either the plugin class, an array of plugin classes or an array of objects (with fn and cfg properties defined)\n * @param {Object} config (Optional) If plugin is the plugin class, the configuration for the plugin\n * @for Plugin.Host\n */\n PluginHost.plug = function(hostClass, plugin, config) {\n // Cannot plug into Base, since Plugins derive from Base [ will cause infinite recurrsion ]\n var p, i, l, name;\n \n if (hostClass !== Y.Base) {\n hostClass._PLUG = hostClass._PLUG || {};\n \n if (!L.isArray(plugin)) {\n if (config) {\n plugin = {fn:plugin, cfg:config};\n }\n plugin = [plugin];\n }\n \n for (i = 0, l = plugin.length; i < l;i++) {\n p = plugin[i];\n name = p.NAME || p.fn.NAME;\n hostClass._PLUG[name] = p;\n }\n }\n };\n\n /**\n * Unregisters any class level plugins which have been registered by the host class, or any\n * other class in the hierarchy.\n *\n * @method unplug\n * @static\n *\n * @param {Function} hostClass The host class from which to unregister the plugins\n * @param {Function | Array} plugin The plugin class, or an array of plugin classes\n * @for Plugin.Host\n */\n PluginHost.unplug = function(hostClass, plugin) {\n var p, i, l, name;\n \n if (hostClass !== Y.Base) {\n hostClass._UNPLUG = hostClass._UNPLUG || {};\n \n if (!L.isArray(plugin)) {\n plugin = [plugin];\n }\n \n for (i = 0, l = plugin.length; i < l; i++) {\n p = plugin[i];\n name = p.NAME;\n if (!hostClass._PLUG[name]) {\n hostClass._UNPLUG[name] = p;\n } else {\n delete hostClass._PLUG[name];\n }\n }\n }\n };\n\n\n}, '@VERSION@', {\"requires\": [\"pluginhost-base\"]});\nYUI.add('event-delegate', function (Y, NAME) {\n\n/**\n * Adds event delegation support to the library.\n *\n * @module event\n * @submodule event-delegate\n */\n\nvar toArray = Y.Array,\n YLang = Y.Lang,\n isString = YLang.isString,\n isObject = YLang.isObject,\n isArray = YLang.isArray,\n selectorTest = Y.Selector.test,\n detachCategories = Y.Env.evt.handles;\n\n/**\n * <p>Sets up event delegation on a container element. The delegated event\n * will use a supplied selector or filtering function to test if the event\n * references at least one node that should trigger the subscription\n * callback.</p>\n *\n * <p>Selector string filters will trigger the callback if the event originated\n * from a node that matches it or is contained in a node that matches it.\n * Function filters are called for each Node up the parent axis to the\n * subscribing container node, and receive at each level the Node and the event\n * object. The function should return true (or a truthy value) if that Node\n * should trigger the subscription callback. Note, it is possible for filters\n * to match multiple Nodes for a single event. In this case, the delegate\n * callback will be executed for each matching Node.</p>\n *\n * <p>For each matching Node, the callback will be executed with its 'this'\n * object set to the Node matched by the filter (unless a specific context was\n * provided during subscription), and the provided event's\n * <code>currentTarget</code> will also be set to the matching Node. The\n * containing Node from which the subscription was originally made can be\n * referenced as <code>e.container</code>.\n *\n * @method delegate\n * @param type {String} the event type to delegate\n * @param fn {Function} the callback function to execute. This function\n * will be provided the event object for the delegated event.\n * @param el {String|node} the element that is the delegation container\n * @param filter {string|Function} a selector that must match the target of the\n * event or a function to test target and its parents for a match\n * @param context optional argument that specifies what 'this' refers to.\n * @param args* 0..n additional arguments to pass on to the callback function.\n * These arguments will be added after the event object.\n * @return {EventHandle} the detach handle\n * @static\n * @for Event\n */\nfunction delegate(type, fn, el, filter) {\n var args = toArray(arguments, 0, true),\n query = isString(el) ? el : null,\n typeBits, synth, container, categories, cat, i, len, handles, handle;\n\n // Support Y.delegate({ click: fnA, key: fnB }, el, filter, ...);\n // and Y.delegate(['click', 'key'], fn, el, filter, ...);\n if (isObject(type)) {\n handles = [];\n\n if (isArray(type)) {\n for (i = 0, len = type.length; i < len; ++i) {\n args[0] = type[i];\n handles.push(Y.delegate.apply(Y, args));\n }\n } else {\n // Y.delegate({'click', fn}, el, filter) =>\n // Y.delegate('click', fn, el, filter)\n args.unshift(null); // one arg becomes two; need to make space\n\n for (i in type) {\n if (type.hasOwnProperty(i)) {\n args[0] = i;\n args[1] = type[i];\n handles.push(Y.delegate.apply(Y, args));\n }\n }\n }\n\n return new Y.EventHandle(handles);\n }\n\n typeBits = type.split(/\\|/);\n\n if (typeBits.length > 1) {\n cat = typeBits.shift();\n args[0] = type = typeBits.shift();\n }\n\n synth = Y.Node.DOM_EVENTS[type];\n\n if (isObject(synth) && synth.delegate) {\n handle = synth.delegate.apply(synth, arguments);\n }\n\n if (!handle) {\n if (!type || !fn || !el || !filter) {\n Y.log(\"delegate requires type, callback, parent, & filter\", \"warn\");\n return;\n }\n\n container = (query) ? Y.Selector.query(query, null, true) : el;\n\n if (!container && isString(el)) {\n handle = Y.on('available', function () {\n Y.mix(handle, Y.delegate.apply(Y, args), true);\n }, el);\n }\n\n if (!handle && container) {\n args.splice(2, 2, container); // remove the filter\n\n handle = Y.Event._attach(args, { facade: false });\n handle.sub.filter = filter;\n handle.sub._notify = delegate.notifySub;\n }\n }\n\n if (handle && cat) {\n categories = detachCategories[cat] || (detachCategories[cat] = {});\n categories = categories[type] || (categories[type] = []);\n categories.push(handle);\n }\n\n return handle;\n}\n\n/**\nOverrides the <code>_notify</code> method on the normal DOM subscription to\ninject the filtering logic and only proceed in the case of a match.\n\nThis method is hosted as a private property of the `delegate` method\n(e.g. `Y.delegate.notifySub`)\n\n@method notifySub\n@param thisObj {Object} default 'this' object for the callback\n@param args {Array} arguments passed to the event's <code>fire()</code>\n@param ce {CustomEvent} the custom event managing the DOM subscriptions for\n the subscribed event on the subscribing node.\n@return {Boolean} false if the event was stopped\n@private\n@static\n@since 3.2.0\n**/\ndelegate.notifySub = function (thisObj, args, ce) {\n // Preserve args for other subscribers\n args = args.slice();\n if (this.args) {\n args.push.apply(args, this.args);\n }\n\n // Only notify subs if the event occurred on a targeted element\n var currentTarget = delegate._applyFilter(this.filter, args, ce),\n //container = e.currentTarget,\n e, i, len, ret;\n\n if (currentTarget) {\n // Support multiple matches up the the container subtree\n currentTarget = toArray(currentTarget);\n\n // The second arg is the currentTarget, but we'll be reusing this\n // facade, replacing the currentTarget for each use, so it doesn't\n // matter what element we seed it with.\n e = args[0] = new Y.DOMEventFacade(args[0], ce.el, ce);\n\n e.container = Y.one(ce.el);\n\n for (i = 0, len = currentTarget.length; i < len && !e.stopped; ++i) {\n e.currentTarget = Y.one(currentTarget[i]);\n\n ret = this.fn.apply(this.context || e.currentTarget, args);\n\n if (ret === false) { // stop further notifications\n break;\n }\n }\n\n return ret;\n }\n};\n\n/**\nCompiles a selector string into a filter function to identify whether\nNodes along the parent axis of an event's target should trigger event\nnotification.\n\nThis function is memoized, so previously compiled filter functions are\nreturned if the same selector string is provided.\n\nThis function may be useful when defining synthetic events for delegate\nhandling.\n\nHosted as a property of the `delegate` method (e.g. `Y.delegate.compileFilter`).\n\n@method compileFilter\n@param selector {String} the selector string to base the filtration on\n@return {Function}\n@since 3.2.0\n@static\n**/\ndelegate.compileFilter = Y.cached(function (selector) {\n return function (target, e) {\n return selectorTest(target._node, selector,\n (e.currentTarget === e.target) ? null : e.currentTarget._node);\n };\n});\n\n/**\nRegex to test for disabled elements during filtering. This is only relevant to\nIE to normalize behavior with other browsers, which swallow events that occur\nto disabled elements. IE fires the event from the parent element instead of the\noriginal target, though it does preserve `event.srcElement` as the disabled\nelement. IE also supports disabled on `<a>`, but the event still bubbles, so it\nacts more like `e.preventDefault()` plus styling. That issue is not handled here\nbecause other browsers fire the event on the `<a>`, so delegate is supported in\nboth cases.\n\n@property _disabledRE\n@type {RegExp}\n@protected\n@since 3.8.1\n**/\ndelegate._disabledRE = /^(?:button|input|select|textarea)$/i;\n\n/**\nWalks up the parent axis of an event's target, and tests each element\nagainst a supplied filter function. If any Nodes, including the container,\nsatisfy the filter, the delegated callback will be triggered for each.\n\nHosted as a protected property of the `delegate` method (e.g.\n`Y.delegate._applyFilter`).\n\n@method _applyFilter\n@param filter {Function} boolean function to test for inclusion in event\n notification\n@param args {Array} the arguments that would be passed to subscribers\n@param ce {CustomEvent} the DOM event wrapper\n@return {Node|Node[]|undefined} The Node or Nodes that satisfy the filter\n@protected\n**/\ndelegate._applyFilter = function (filter, args, ce) {\n var e = args[0],\n container = ce.el, // facadeless events in IE, have no e.currentTarget\n target = e.target || e.srcElement,\n match = [],\n isContainer = false;\n\n // Resolve text nodes to their containing element\n if (target.nodeType === 3) {\n target = target.parentNode;\n }\n\n // For IE. IE propagates events from the parent element of disabled\n // elements, where other browsers swallow the event entirely. To normalize\n // this in IE, filtering for matching elements should abort if the target\n // is a disabled form control.\n if (target.disabled && delegate._disabledRE.test(target.nodeName)) {\n return match;\n }\n\n // passing target as the first arg rather than leaving well enough alone\n // making 'this' in the filter function refer to the target. This is to\n // support bound filter functions.\n args.unshift(target);\n\n if (isString(filter)) {\n while (target) {\n isContainer = (target === container);\n if (selectorTest(target, filter, (isContainer ? null: container))) {\n match.push(target);\n }\n\n if (isContainer) {\n break;\n }\n\n target = target.parentNode;\n }\n } else {\n // filter functions are implementer code and should receive wrappers\n args[0] = Y.one(target);\n args[1] = new Y.DOMEventFacade(e, container, ce);\n\n while (target) {\n // filter(target, e, extra args...) - this === target\n if (filter.apply(args[0], args)) {\n match.push(target);\n }\n\n if (target === container) {\n break;\n }\n\n target = target.parentNode;\n args[0] = Y.one(target);\n }\n args[1] = e; // restore the raw DOM event\n }\n\n if (match.length <= 1) {\n match = match[0]; // single match or undefined\n }\n\n // remove the target\n args.shift();\n\n return match;\n};\n\n/**\n * Sets up event delegation on a container element. The delegated event\n * will use a supplied filter to test if the callback should be executed.\n * This filter can be either a selector string or a function that returns\n * a Node to use as the currentTarget for the event.\n *\n * The event object for the delegated event is supplied to the callback\n * function. It is modified slightly in order to support all properties\n * that may be needed for event delegation. 'currentTarget' is set to\n * the element that matched the selector string filter or the Node returned\n * from the filter function. 'container' is set to the element that the\n * listener is delegated from (this normally would be the 'currentTarget').\n *\n * Filter functions will be called with the arguments that would be passed to\n * the callback function, including the event object as the first parameter.\n * The function should return false (or a falsey value) if the success criteria\n * aren't met, and the Node to use as the event's currentTarget and 'this'\n * object if they are.\n *\n * @method delegate\n * @param type {string} the event type to delegate\n * @param fn {function} the callback function to execute. This function\n * will be provided the event object for the delegated event.\n * @param el {string|node} the element that is the delegation container\n * @param filter {string|function} a selector that must match the target of the\n * event or a function that returns a Node or false.\n * @param context optional argument that specifies what 'this' refers to.\n * @param args* 0..n additional arguments to pass on to the callback function.\n * These arguments will be added after the event object.\n * @return {EventHandle} the detach handle\n * @for YUI\n */\nY.delegate = Y.Event.delegate = delegate;\n\n\n}, '@VERSION@', {\"requires\": [\"node-base\"]});\nYUI.add('node-event-delegate', function (Y, NAME) {\n\n/**\n * Functionality to make the node a delegated event container\n * @module node\n * @submodule node-event-delegate\n */\n\n/**\n * <p>Sets up a delegation listener for an event occurring inside the Node.\n * The delegated event will be verified against a supplied selector or\n * filtering function to test if the event references at least one node that\n * should trigger the subscription callback.</p>\n *\n * <p>Selector string filters will trigger the callback if the event originated\n * from a node that matches it or is contained in a node that matches it.\n * Function filters are called for each Node up the parent axis to the\n * subscribing container node, and receive at each level the Node and the event\n * object. The function should return true (or a truthy value) if that Node\n * should trigger the subscription callback. Note, it is possible for filters\n * to match multiple Nodes for a single event. In this case, the delegate\n * callback will be executed for each matching Node.</p>\n *\n * <p>For each matching Node, the callback will be executed with its 'this'\n * object set to the Node matched by the filter (unless a specific context was\n * provided during subscription), and the provided event's\n * <code>currentTarget</code> will also be set to the matching Node. The\n * containing Node from which the subscription was originally made can be\n * referenced as <code>e.container</code>.\n *\n * @method delegate\n * @param type {String} the event type to delegate\n * @param fn {Function} the callback function to execute. This function\n * will be provided the event object for the delegated event.\n * @param spec {String|Function} a selector that must match the target of the\n * event or a function to test target and its parents for a match\n * @param context {Object} optional argument that specifies what 'this' refers to.\n * @param args* {any} 0..n additional arguments to pass on to the callback function.\n * These arguments will be added after the event object.\n * @return {EventHandle} the detach handle\n * @for Node\n */\nY.Node.prototype.delegate = function(type) {\n\n var args = Y.Array(arguments, 0, true),\n index = (Y.Lang.isObject(type) && !Y.Lang.isArray(type)) ? 1 : 2;\n\n args.splice(index, 0, this._node);\n\n return Y.delegate.apply(Y, args);\n};\n\n\n}, '@VERSION@', {\"requires\": [\"node-base\", \"event-delegate\"]});\nYUI.add('node-pluginhost', function (Y, NAME) {\n\n/**\n * @module node\n * @submodule node-pluginhost\n */\n\n/**\n * Registers plugins to be instantiated at the class level (plugins\n * which should be plugged into every instance of Node by default).\n *\n * @method plug\n * @static\n * @for Node\n * @param {Function | Array} plugin Either the plugin class, an array of plugin classes or an array of objects (with fn and cfg properties defined)\n * @param {Object} config (Optional) If plugin is the plugin class, the configuration for the plugin\n */\nY.Node.plug = function() {\n var args = Y.Array(arguments);\n args.unshift(Y.Node);\n Y.Plugin.Host.plug.apply(Y.Base, args);\n return Y.Node;\n};\n\n/**\n * Unregisters any class level plugins which have been registered by the Node\n *\n * @method unplug\n * @static\n *\n * @param {Function | Array} plugin The plugin class, or an array of plugin classes\n */\nY.Node.unplug = function() {\n var args = Y.Array(arguments);\n args.unshift(Y.Node);\n Y.Plugin.Host.unplug.apply(Y.Base, args);\n return Y.Node;\n};\n\nY.mix(Y.Node, Y.Plugin.Host, false, null, 1);\n\n// allow batching of plug/unplug via NodeList\n// doesn't use NodeList.importMethod because we need real Nodes (not tmpNode)\n/**\n * Adds a plugin to each node in the NodeList.\n * This will instantiate the plugin and attach it to the configured namespace on each node\n * @method plug\n * @for NodeList\n * @param P {Function | Object |Array} Accepts the plugin class, or an \n * object with a \"fn\" property specifying the plugin class and \n * a \"cfg\" property specifying the configuration for the Plugin.\n * <p>\n * Additionally an Array can also be passed in, with the above function or \n * object values, allowing the user to add multiple plugins in a single call.\n * </p>\n * @param config (Optional) If the first argument is the plugin class, the second argument\n * can be the configuration for the plugin.\n * @chainable\n */\nY.NodeList.prototype.plug = function() {\n var args = arguments;\n Y.NodeList.each(this, function(node) {\n Y.Node.prototype.plug.apply(Y.one(node), args);\n });\n return this;\n};\n\n/**\n * Removes a plugin from all nodes in the NodeList. This will destroy the \n * plugin instance and delete the namespace each node. \n * @method unplug\n * @for NodeList\n * @param {String | Function} plugin The namespace of the plugin, or the plugin class with the static NS namespace property defined. If not provided,\n * all registered plugins are unplugged.\n * @chainable\n */\nY.NodeList.prototype.unplug = function() {\n var args = arguments;\n Y.NodeList.each(this, function(node) {\n Y.Node.prototype.unplug.apply(Y.one(node), args);\n });\n return this;\n};\n\n\n}, '@VERSION@', {\"requires\": [\"node-base\", \"pluginhost\"]});\nYUI.add('node-screen', function (Y, NAME) {\n\n/**\n * Extended Node interface for managing regions and screen positioning.\n * Adds support for positioning elements and normalizes window size and scroll detection. \n * @module node\n * @submodule node-screen\n */\n\n// these are all \"safe\" returns, no wrapping required\nY.each([\n /**\n * Returns the inner width of the viewport (exludes scrollbar). \n * @config winWidth\n * @for Node\n * @type {Int}\n */\n 'winWidth',\n\n /**\n * Returns the inner height of the viewport (exludes scrollbar). \n * @config winHeight\n * @type {Int}\n */\n 'winHeight',\n\n /**\n * Document width \n * @config docWidth\n * @type {Int}\n */\n 'docWidth',\n\n /**\n * Document height \n * @config docHeight\n * @type {Int}\n */\n 'docHeight',\n\n /**\n * Pixel distance the page has been scrolled horizontally \n * @config docScrollX\n * @type {Int}\n */\n 'docScrollX',\n\n /**\n * Pixel distance the page has been scrolled vertically \n * @config docScrollY\n * @type {Int}\n */\n 'docScrollY'\n ],\n function(name) {\n Y.Node.ATTRS[name] = {\n getter: function() {\n var args = Array.prototype.slice.call(arguments);\n args.unshift(Y.Node.getDOMNode(this));\n\n return Y.DOM[name].apply(this, args);\n }\n };\n }\n);\n\nY.Node.ATTRS.scrollLeft = {\n getter: function() {\n var node = Y.Node.getDOMNode(this);\n return ('scrollLeft' in node) ? node.scrollLeft : Y.DOM.docScrollX(node);\n },\n\n setter: function(val) {\n var node = Y.Node.getDOMNode(this);\n if (node) {\n if ('scrollLeft' in node) {\n node.scrollLeft = val;\n } else if (node.document || node.nodeType === 9) {\n Y.DOM._getWin(node).scrollTo(val, Y.DOM.docScrollY(node)); // scroll window if win or doc\n }\n } else {\n Y.log('unable to set scrollLeft for ' + node, 'error', 'Node');\n }\n }\n};\n\nY.Node.ATTRS.scrollTop = {\n getter: function() {\n var node = Y.Node.getDOMNode(this);\n return ('scrollTop' in node) ? node.scrollTop : Y.DOM.docScrollY(node);\n },\n\n setter: function(val) {\n var node = Y.Node.getDOMNode(this);\n if (node) {\n if ('scrollTop' in node) {\n node.scrollTop = val;\n } else if (node.document || node.nodeType === 9) {\n Y.DOM._getWin(node).scrollTo(Y.DOM.docScrollX(node), val); // scroll window if win or doc\n }\n } else {\n Y.log('unable to set scrollTop for ' + node, 'error', 'Node');\n }\n }\n};\n\nY.Node.importMethod(Y.DOM, [\n/**\n * Gets the current position of the node in page coordinates. \n * @method getXY\n * @for Node\n * @return {Array} The XY position of the node\n*/\n 'getXY',\n\n/**\n * Set the position of the node in page coordinates, regardless of how the node is positioned.\n * @method setXY\n * @param {Array} xy Contains X & Y values for new position (coordinates are page-based)\n * @chainable\n */\n 'setXY',\n\n/**\n * Gets the current position of the node in page coordinates. \n * @method getX\n * @return {Int} The X position of the node\n*/\n 'getX',\n\n/**\n * Set the position of the node in page coordinates, regardless of how the node is positioned.\n * @method setX\n * @param {Int} x X value for new position (coordinates are page-based)\n * @chainable\n */\n 'setX',\n\n/**\n * Gets the current position of the node in page coordinates. \n * @method getY\n * @return {Int} The Y position of the node\n*/\n 'getY',\n\n/**\n * Set the position of the node in page coordinates, regardless of how the node is positioned.\n * @method setY\n * @param {Int} y Y value for new position (coordinates are page-based)\n * @chainable\n */\n 'setY',\n\n/**\n * Swaps the XY position of this node with another node. \n * @method swapXY\n * @param {Node | HTMLElement} otherNode The node to swap with.\n * @chainable\n */\n 'swapXY'\n]);\n\n/**\n * @module node\n * @submodule node-screen\n */\n\n/**\n * Returns a region object for the node\n * @config region\n * @for Node\n * @type Node\n */\nY.Node.ATTRS.region = {\n getter: function() {\n var node = this.getDOMNode(),\n region;\n\n if (node && !node.tagName) {\n if (node.nodeType === 9) { // document\n node = node.documentElement;\n }\n }\n if (Y.DOM.isWindow(node)) {\n region = Y.DOM.viewportRegion(node);\n } else {\n region = Y.DOM.region(node);\n }\n return region;\n }\n};\n\n/**\n * Returns a region object for the node's viewport\n * @config viewportRegion\n * @type Node\n */\nY.Node.ATTRS.viewportRegion = {\n getter: function() {\n return Y.DOM.viewportRegion(Y.Node.getDOMNode(this));\n }\n};\n\nY.Node.importMethod(Y.DOM, 'inViewportRegion');\n\n// these need special treatment to extract 2nd node arg\n/**\n * Compares the intersection of the node with another node or region\n * @method intersect\n * @for Node\n * @param {Node|Object} node2 The node or region to compare with.\n * @param {Object} altRegion An alternate region to use (rather than this node's).\n * @return {Object} An object representing the intersection of the regions.\n */\nY.Node.prototype.intersect = function(node2, altRegion) {\n var node1 = Y.Node.getDOMNode(this);\n if (Y.instanceOf(node2, Y.Node)) { // might be a region object\n node2 = Y.Node.getDOMNode(node2);\n }\n return Y.DOM.intersect(node1, node2, altRegion);\n};\n\n/**\n * Determines whether or not the node is within the giving region.\n * @method inRegion\n * @param {Node|Object} node2 The node or region to compare with.\n * @param {Boolean} all Whether or not all of the node must be in the region.\n * @param {Object} altRegion An alternate region to use (rather than this node's).\n * @return {Object} An object representing the intersection of the regions.\n */\nY.Node.prototype.inRegion = function(node2, all, altRegion) {\n var node1 = Y.Node.getDOMNode(this);\n if (Y.instanceOf(node2, Y.Node)) { // might be a region object\n node2 = Y.Node.getDOMNode(node2);\n }\n return Y.DOM.inRegion(node1, node2, all, altRegion);\n};\n\n\n}, '@VERSION@', {\"requires\": [\"dom-screen\", \"node-base\"]});\nYUI.add('node-style', function (Y, NAME) {\n\n(function(Y) {\n/**\n * Extended Node interface for managing node styles.\n * @module node\n * @submodule node-style\n */\n\nY.mix(Y.Node.prototype, {\n /**\n * Sets a style property of the node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method setStyle\n * @param {String} attr The style attribute to set. \n * @param {String|Number} val The value. \n * @chainable\n */\n setStyle: function(attr, val) {\n Y.DOM.setStyle(this._node, attr, val);\n return this;\n },\n\n /**\n * Sets multiple style properties on the node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method setStyles\n * @param {Object} hash An object literal of property:value pairs. \n * @chainable\n */\n setStyles: function(hash) {\n Y.DOM.setStyles(this._node, hash);\n return this;\n },\n\n /**\n * Returns the style's current value.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method getStyle\n * @for Node\n * @param {String} attr The style attribute to retrieve. \n * @return {String} The current value of the style property for the element.\n */\n\n getStyle: function(attr) {\n return Y.DOM.getStyle(this._node, attr);\n },\n\n /**\n * Returns the computed value for the given style property.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method getComputedStyle\n * @param {String} attr The style attribute to retrieve. \n * @return {String} The computed value of the style property for the element.\n */\n getComputedStyle: function(attr) {\n return Y.DOM.getComputedStyle(this._node, attr);\n }\n});\n\n/**\n * Returns an array of values for each node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method getStyle\n * @for NodeList\n * @see Node.getStyle\n * @param {String} attr The style attribute to retrieve. \n * @return {Array} The current values of the style property for the element.\n */\n\n/**\n * Returns an array of the computed value for each node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method getComputedStyle\n * @see Node.getComputedStyle\n * @param {String} attr The style attribute to retrieve. \n * @return {Array} The computed values for each node.\n */\n\n/**\n * Sets a style property on each node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method setStyle\n * @see Node.setStyle\n * @param {String} attr The style attribute to set. \n * @param {String|Number} val The value. \n * @chainable\n */\n\n/**\n * Sets multiple style properties on each node.\n * Use camelCase (e.g. 'backgroundColor') for multi-word properties.\n * @method setStyles\n * @see Node.setStyles\n * @param {Object} hash An object literal of property:value pairs. \n * @chainable\n */\n\n// These are broken out to handle undefined return (avoid false positive for\n// chainable)\n\nY.NodeList.importMethod(Y.Node.prototype, ['getStyle', 'getComputedStyle', 'setStyle', 'setStyles']);\n})(Y);\n\n\n}, '@VERSION@', {\"requires\": [\"dom-style\", \"node-base\"]});\nYUI.add('querystring-stringify-simple', function (Y, NAME) {\n\n/*global Y */\n/**\n * <p>Provides Y.QueryString.stringify method for converting objects to Query Strings.\n * This is a subset implementation of the full querystring-stringify.</p>\n * <p>This module provides the bare minimum functionality (encoding a hash of simple values),\n * without the additional support for nested data structures. Every key-value pair is\n * encoded by encodeURIComponent.</p>\n * <p>This module provides a minimalistic way for io to handle single-level objects\n * as transaction data.</p>\n *\n * @module querystring\n * @submodule querystring-stringify-simple\n */\n\nvar QueryString = Y.namespace(\"QueryString\"),\n EUC = encodeURIComponent;\n\n\nQueryString.stringify = function (obj, c) {\n var qs = [],\n // Default behavior is false; standard key notation.\n s = c && c.arrayKey ? true : false,\n key, i, l;\n\n for (key in obj) {\n if (obj.hasOwnProperty(key)) {\n if (Y.Lang.isArray(obj[key])) {\n for (i = 0, l = obj[key].length; i < l; i++) {\n qs.push(EUC(s ? key + '[]' : key) + '=' + EUC(obj[key][i]));\n }\n }\n else {\n qs.push(EUC(key) + '=' + EUC(obj[key]));\n }\n }\n }\n\n return qs.join('&');\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('io-base', function (Y, NAME) {\n\n/**\nBase IO functionality. Provides basic XHR transport support.\n\n@module io\n@submodule io-base\n@for IO\n**/\n\nvar // List of events that comprise the IO event lifecycle.\n EVENTS = ['start', 'complete', 'end', 'success', 'failure', 'progress'],\n\n // Whitelist of used XHR response object properties.\n XHR_PROPS = ['status', 'statusText', 'responseText', 'responseXML'],\n\n win = Y.config.win,\n uid = 0;\n\n/**\nThe IO class is a utility that brokers HTTP requests through a simplified\ninterface. Specifically, it allows JavaScript to make HTTP requests to\na resource without a page reload. The underlying transport for making\nsame-domain requests is the XMLHttpRequest object. IO can also use\nFlash, if specified as a transport, for cross-domain requests.\n\n@class IO\n@constructor\n@param {Object} config Object of EventTarget's publish method configurations\n used to configure IO's events.\n**/\nfunction IO (config) {\n var io = this;\n\n io._uid = 'io:' + uid++;\n io._init(config);\n Y.io._map[io._uid] = io;\n}\n\nIO.prototype = {\n //--------------------------------------\n // Properties\n //--------------------------------------\n\n /**\n * A counter that increments for each transaction.\n *\n * @property _id\n * @private\n * @type {Number}\n */\n _id: 0,\n\n /**\n * Object of IO HTTP headers sent with each transaction.\n *\n * @property _headers\n * @private\n * @type {Object}\n */\n _headers: {\n 'X-Requested-With' : 'XMLHttpRequest'\n },\n\n /**\n * Object that stores timeout values for any transaction with a defined\n * \"timeout\" configuration property.\n *\n * @property _timeout\n * @private\n * @type {Object}\n */\n _timeout: {},\n\n //--------------------------------------\n // Methods\n //--------------------------------------\n\n _init: function(config) {\n var io = this, i, len;\n\n io.cfg = config || {};\n\n Y.augment(io, Y.EventTarget);\n for (i = 0, len = EVENTS.length; i < len; ++i) {\n // Publish IO global events with configurations, if any.\n // IO global events are set to broadcast by default.\n // These events use the \"io:\" namespace.\n io.publish('io:' + EVENTS[i], Y.merge({ broadcast: 1 }, config));\n // Publish IO transaction events with configurations, if\n // any. These events use the \"io-trn:\" namespace.\n io.publish('io-trn:' + EVENTS[i], config);\n }\n },\n\n /**\n * Method that creates a unique transaction object for each request.\n *\n * @method _create\n * @private\n * @param {Object} cfg Configuration object subset to determine if\n * the transaction is an XDR or file upload,\n * requiring an alternate transport.\n * @param {Number} id Transaction id\n * @return {Object} The transaction object\n */\n _create: function(config, id) {\n var io = this,\n transaction = {\n id : Y.Lang.isNumber(id) ? id : io._id++,\n uid: io._uid\n },\n alt = config.xdr ? config.xdr.use : null,\n form = config.form && config.form.upload ? 'iframe' : null,\n use;\n\n if (alt === 'native') {\n // Non-IE and IE >= 10 can use XHR level 2 and not rely on an\n // external transport.\n alt = Y.UA.ie && !SUPPORTS_CORS ? 'xdr' : null;\n\n // Prevent \"pre-flight\" OPTIONS request by removing the\n // `X-Requested-With` HTTP header from CORS requests. This header\n // can be added back on a per-request basis, if desired.\n io.setHeader('X-Requested-With');\n }\n\n use = alt || form;\n transaction = use ? Y.merge(Y.IO.customTransport(use), transaction) :\n Y.merge(Y.IO.defaultTransport(), transaction);\n\n if (transaction.notify) {\n config.notify = function (e, t, c) { io.notify(e, t, c); };\n }\n\n if (!use) {\n if (win && win.FormData && config.data instanceof win.FormData) {\n transaction.c.upload.onprogress = function (e) {\n io.progress(transaction, e, config);\n };\n transaction.c.onload = function (e) {\n io.load(transaction, e, config);\n };\n transaction.c.onerror = function (e) {\n io.error(transaction, e, config);\n };\n transaction.upload = true;\n }\n }\n\n return transaction;\n },\n\n _destroy: function(transaction) {\n if (win && !transaction.notify && !transaction.xdr) {\n if (XHR && !transaction.upload) {\n transaction.c.onreadystatechange = null;\n } else if (transaction.upload) {\n transaction.c.upload.onprogress = null;\n transaction.c.onload = null;\n transaction.c.onerror = null;\n } else if (Y.UA.ie && !transaction.e) {\n // IE, when using XMLHttpRequest as an ActiveX Object, will throw\n // a \"Type Mismatch\" error if the event handler is set to \"null\".\n transaction.c.abort();\n }\n }\n\n transaction = transaction.c = null;\n },\n\n /**\n * Method for creating and firing events.\n *\n * @method _evt\n * @private\n * @param {String} eventName Event to be published.\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration data subset for event subscription.\n */\n _evt: function(eventName, transaction, config) {\n var io = this, params,\n args = config['arguments'],\n emitFacade = io.cfg.emitFacade,\n globalEvent = \"io:\" + eventName,\n trnEvent = \"io-trn:\" + eventName;\n\n // Workaround for #2532107\n this.detach(trnEvent);\n\n if (transaction.e) {\n transaction.c = { status: 0, statusText: transaction.e };\n }\n\n // Fire event with parameters or an Event Facade.\n params = [ emitFacade ?\n {\n id: transaction.id,\n data: transaction.c,\n cfg: config,\n 'arguments': args\n } :\n transaction.id\n ];\n\n if (!emitFacade) {\n if (eventName === EVENTS[0] || eventName === EVENTS[2]) {\n if (args) {\n params.push(args);\n }\n } else {\n if (transaction.evt) {\n params.push(transaction.evt);\n } else {\n params.push(transaction.c);\n }\n if (args) {\n params.push(args);\n }\n }\n }\n\n params.unshift(globalEvent);\n // Fire global events.\n io.fire.apply(io, params);\n // Fire transaction events, if receivers are defined.\n if (config.on) {\n params[0] = trnEvent;\n io.once(trnEvent, config.on[eventName], config.context || Y);\n io.fire.apply(io, params);\n }\n },\n\n /**\n * Fires event \"io:start\" and creates, fires a transaction-specific\n * start event, if `config.on.start` is defined.\n *\n * @method start\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration object for the transaction.\n */\n start: function(transaction, config) {\n /**\n * Signals the start of an IO request.\n * @event io:start\n */\n this._evt(EVENTS[0], transaction, config);\n },\n\n /**\n * Fires event \"io:complete\" and creates, fires a\n * transaction-specific \"complete\" event, if config.on.complete is\n * defined.\n *\n * @method complete\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration object for the transaction.\n */\n complete: function(transaction, config) {\n /**\n * Signals the completion of the request-response phase of a\n * transaction. Response status and data are accessible, if\n * available, in this event.\n * @event io:complete\n */\n this._evt(EVENTS[1], transaction, config);\n },\n\n /**\n * Fires event \"io:end\" and creates, fires a transaction-specific \"end\"\n * event, if config.on.end is defined.\n *\n * @method end\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration object for the transaction.\n */\n end: function(transaction, config) {\n /**\n * Signals the end of the transaction lifecycle.\n * @event io:end\n */\n this._evt(EVENTS[2], transaction, config);\n this._destroy(transaction);\n },\n\n /**\n * Fires event \"io:success\" and creates, fires a transaction-specific\n * \"success\" event, if config.on.success is defined.\n *\n * @method success\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration object for the transaction.\n */\n success: function(transaction, config) {\n /**\n * Signals an HTTP response with status in the 2xx range.\n * Fires after io:complete.\n * @event io:success\n */\n this._evt(EVENTS[3], transaction, config);\n this.end(transaction, config);\n },\n\n /**\n * Fires event \"io:failure\" and creates, fires a transaction-specific\n * \"failure\" event, if config.on.failure is defined.\n *\n * @method failure\n * @param {Object} transaction Transaction object.\n * @param {Object} config Configuration object for the transaction.\n */\n failure: function(transaction, config) {\n /**\n * Signals an HTTP response with status outside of the 2xx range.\n * Fires after io:complete.\n * @event io:failure\n */\n this._evt(EVENTS[4], transaction, config);\n this.end(transaction, config);\n },\n\n /**\n * Fires event \"io:progress\" and creates, fires a transaction-specific\n * \"progress\" event -- for XMLHttpRequest file upload -- if\n * config.on.progress is defined.\n *\n * @method progress\n * @param {Object} transaction Transaction object.\n * @param {Object} progress event.\n * @param {Object} config Configuration object for the transaction.\n */\n progress: function(transaction, e, config) {\n /**\n * Signals the interactive state during a file upload transaction.\n * This event fires after io:start and before io:complete.\n * @event io:progress\n */\n transaction.evt = e;\n this._evt(EVENTS[5], transaction, config);\n },\n\n /**\n * Fires event \"io:complete\" and creates, fires a transaction-specific\n * \"complete\" event -- for XMLHttpRequest file upload -- if\n * config.on.complete is defined.\n *\n * @method load\n * @param {Object} transaction Transaction object.\n * @param {Object} load event.\n * @param {Object} config Configuration object for the transaction.\n */\n load: function (transaction, e, config) {\n transaction.evt = e.target;\n this._evt(EVENTS[1], transaction, config);\n },\n\n /**\n * Fires event \"io:failure\" and creates, fires a transaction-specific\n * \"failure\" event -- for XMLHttpRequest file upload -- if\n * config.on.failure is defined.\n *\n * @method error\n * @param {Object} transaction Transaction object.\n * @param {Object} error event.\n * @param {Object} config Configuration object for the transaction.\n */\n error: function (transaction, e, config) {\n transaction.evt = e;\n this._evt(EVENTS[4], transaction, config);\n },\n\n /**\n * Retry an XDR transaction, using the Flash tranport, if the native\n * transport fails.\n *\n * @method _retry\n * @private\n * @param {Object} transaction Transaction object.\n * @param {String} uri Qualified path to transaction resource.\n * @param {Object} config Configuration object for the transaction.\n */\n _retry: function(transaction, uri, config) {\n this._destroy(transaction);\n config.xdr.use = 'flash';\n return this.send(uri, config, transaction.id);\n },\n\n /**\n * Method that concatenates string data for HTTP GET transactions.\n *\n * @method _concat\n * @private\n * @param {String} uri URI or root data.\n * @param {String} data Data to be concatenated onto URI.\n * @return {String}\n */\n _concat: function(uri, data) {\n uri += (uri.indexOf('?') === -1 ? '?' : '&') + data;\n return uri;\n },\n\n /**\n * Stores default client headers for all transactions. If a label is\n * passed with no value argument, the header will be deleted.\n *\n * @method setHeader\n * @param {String} name HTTP header\n * @param {String} value HTTP header value\n */\n setHeader: function(name, value) {\n if (value) {\n this._headers[name] = value;\n } else {\n delete this._headers[name];\n }\n },\n\n /**\n * Method that sets all HTTP headers to be sent in a transaction.\n *\n * @method _setHeaders\n * @private\n * @param {Object} transaction - XHR instance for the specific transaction.\n * @param {Object} headers - HTTP headers for the specific transaction, as\n * defined in the configuration object passed to YUI.io().\n */\n _setHeaders: function(transaction, headers) {\n headers = Y.merge(this._headers, headers);\n Y.Object.each(headers, function(value, name) {\n if (value !== 'disable') {\n transaction.setRequestHeader(name, headers[name]);\n }\n });\n },\n\n /**\n * Starts timeout count if the configuration object has a defined\n * timeout property.\n *\n * @method _startTimeout\n * @private\n * @param {Object} transaction Transaction object generated by _create().\n * @param {Object} timeout Timeout in milliseconds.\n */\n _startTimeout: function(transaction, timeout) {\n var io = this;\n\n io._timeout[transaction.id] = setTimeout(function() {\n io._abort(transaction, 'timeout');\n }, timeout);\n },\n\n /**\n * Clears the timeout interval started by _startTimeout().\n *\n * @method _clearTimeout\n * @private\n * @param {Number} id - Transaction id.\n */\n _clearTimeout: function(id) {\n clearTimeout(this._timeout[id]);\n delete this._timeout[id];\n },\n\n /**\n * Method that determines if a transaction response qualifies as success\n * or failure, based on the response HTTP status code, and fires the\n * appropriate success or failure events.\n *\n * @method _result\n * @private\n * @static\n * @param {Object} transaction Transaction object generated by _create().\n * @param {Object} config Configuration object passed to io().\n */\n _result: function(transaction, config) {\n var status;\n // Firefox will throw an exception if attempting to access\n // an XHR object's status property, after a request is aborted.\n try {\n status = transaction.c.status;\n } catch(e) {\n status = 0;\n }\n\n // IE reports HTTP 204 as HTTP 1223.\n if (status >= 200 && status < 300 || status === 304 || status === 1223) {\n this.success(transaction, config);\n } else {\n this.failure(transaction, config);\n }\n },\n\n /**\n * Event handler bound to onreadystatechange.\n *\n * @method _rS\n * @private\n * @param {Object} transaction Transaction object generated by _create().\n * @param {Object} config Configuration object passed to YUI.io().\n */\n _rS: function(transaction, config) {\n var io = this;\n\n if (transaction.c.readyState === 4) {\n if (config.timeout) {\n io._clearTimeout(transaction.id);\n }\n\n // Yield in the event of request timeout or abort.\n setTimeout(function() {\n io.complete(transaction, config);\n io._result(transaction, config);\n }, 0);\n }\n },\n\n /**\n * Terminates a transaction due to an explicit abort or timeout.\n *\n * @method _abort\n * @private\n * @param {Object} transaction Transaction object generated by _create().\n * @param {String} type Identifies timed out or aborted transaction.\n */\n _abort: function(transaction, type) {\n if (transaction && transaction.c) {\n transaction.e = type;\n transaction.c.abort();\n }\n },\n\n /**\n * Requests a transaction. `send()` is implemented as `Y.io()`. Each\n * transaction may include a configuration object. Its properties are:\n *\n * <dl>\n * <dt>method</dt>\n * <dd>HTTP method verb (e.g., GET or POST). If this property is not\n * not defined, the default value will be GET.</dd>\n *\n * <dt>data</dt>\n * <dd>This is the name-value string that will be sent as the\n * transaction data. If the request is HTTP GET, the data become\n * part of querystring. If HTTP POST, the data are sent in the\n * message body.</dd>\n *\n * <dt>xdr</dt>\n * <dd>Defines the transport to be used for cross-domain requests.\n * By setting this property, the transaction will use the specified\n * transport instead of XMLHttpRequest. The properties of the\n * transport object are:\n * <dl>\n * <dt>use</dt>\n * <dd>The transport to be used: 'flash' or 'native'</dd>\n * <dt>dataType</dt>\n * <dd>Set the value to 'XML' if that is the expected response\n * content type.</dd>\n * </dl></dd>\n *\n * <dt>form</dt>\n * <dd>Form serialization configuration object. Its properties are:\n * <dl>\n * <dt>id</dt>\n * <dd>Node object or id of HTML form</dd>\n * <dt>useDisabled</dt>\n * <dd>`true` to also serialize disabled form field values\n * (defaults to `false`)</dd>\n * </dl></dd>\n *\n * <dt>on</dt>\n * <dd>Assigns transaction event subscriptions. Available events are:\n * <dl>\n * <dt>start</dt>\n * <dd>Fires when a request is sent to a resource.</dd>\n * <dt>complete</dt>\n * <dd>Fires when the transaction is complete.</dd>\n * <dt>success</dt>\n * <dd>Fires when the HTTP response status is within the 2xx\n * range.</dd>\n * <dt>failure</dt>\n * <dd>Fires when the HTTP response status is outside the 2xx\n * range, if an exception occurs, if the transation is aborted,\n * or if the transaction exceeds a configured `timeout`.</dd>\n * <dt>end</dt>\n * <dd>Fires at the conclusion of the transaction\n * lifecycle, after `success` or `failure`.</dd>\n * </dl>\n *\n * <p>Callback functions for `start` and `end` receive the id of the\n * transaction as a first argument. For `complete`, `success`, and\n * `failure`, callbacks receive the id and the response object\n * (usually the XMLHttpRequest instance). If the `arguments`\n * property was included in the configuration object passed to\n * `Y.io()`, the configured data will be passed to all callbacks as\n * the last argument.</p>\n * </dd>\n *\n * <dt>sync</dt>\n * <dd>Pass `true` to make a same-domain transaction synchronous.\n * <strong>CAVEAT</strong>: This will negatively impact the user\n * experience. Have a <em>very</em> good reason if you intend to use\n * this.</dd>\n *\n * <dt>context</dt>\n * <dd>The \"`this'\" object for all configured event handlers. If a\n * specific context is needed for individual callbacks, bind the\n * callback to a context using `Y.bind()`.</dd>\n *\n * <dt>headers</dt>\n * <dd>Object map of transaction headers to send to the server. The\n * object keys are the header names and the values are the header\n * values.</dd>\n *\n * <dt>timeout</dt>\n * <dd>Millisecond threshold for the transaction before being\n * automatically aborted.</dd>\n *\n * <dt>arguments</dt>\n * <dd>User-defined data passed to all registered event handlers.\n * This value is available as the second argument in the \"start\" and\n * \"end\" event handlers. It is the third argument in the \"complete\",\n * \"success\", and \"failure\" event handlers. <strong>Be sure to quote\n * this property name in the transaction configuration as\n * \"arguments\" is a reserved word in JavaScript</strong> (e.g.\n * `Y.io({ ..., \"arguments\": stuff })`).</dd>\n * </dl>\n *\n * @method send\n * @public\n * @param {String} uri Qualified path to transaction resource.\n * @param {Object} config Configuration object for the transaction.\n * @param {Number} id Transaction id, if already set.\n * @return {Object}\n */\n send: function(uri, config, id) {\n var transaction, method, i, len, sync, data,\n io = this,\n u = uri,\n response = {};\n\n config = config ? Y.Object(config) : {};\n transaction = io._create(config, id);\n method = config.method ? config.method.toUpperCase() : 'GET';\n sync = config.sync;\n data = config.data;\n\n // Serialize a map object into a key-value string using\n // querystring-stringify-simple.\n if ((Y.Lang.isObject(data) && !data.nodeType) && !transaction.upload) {\n if (Y.QueryString && Y.QueryString.stringify) {\n Y.log('Stringifying config.data for request', 'info', 'io');\n config.data = data = Y.QueryString.stringify(data);\n } else {\n Y.log('Failed to stringify config.data object, likely because `querystring-stringify-simple` is missing.', 'warn', 'io');\n }\n }\n\n if (config.form) {\n if (config.form.upload) {\n // This is a file upload transaction, calling\n // upload() in io-upload-iframe.\n return io.upload(transaction, uri, config);\n } else {\n // Serialize HTML form data into a key-value string.\n data = io._serialize(config.form, data);\n }\n }\n\n // Convert falsy values to an empty string. This way IE can't be\n // rediculous and translate `undefined` to \"undefined\".\n data || (data = '');\n\n if (data) {\n switch (method) {\n case 'GET':\n case 'HEAD':\n case 'DELETE':\n u = io._concat(u, data);\n data = '';\n Y.log('HTTP' + method + ' with data. The querystring is: ' + u, 'info', 'io');\n break;\n case 'POST':\n case 'PUT':\n // If Content-Type is defined in the configuration object, or\n // or as a default header, it will be used instead of\n // 'application/x-www-form-urlencoded; charset=UTF-8'\n config.headers = Y.merge({\n 'Content-Type': 'application/x-www-form-urlencoded; charset=UTF-8'\n }, config.headers);\n break;\n }\n }\n\n if (transaction.xdr) {\n // Route data to io-xdr module for flash and XDomainRequest.\n return io.xdr(u, transaction, config);\n }\n else if (transaction.notify) {\n // Route data to custom transport\n return transaction.c.send(transaction, uri, config);\n }\n\n if (!sync && !transaction.upload) {\n transaction.c.onreadystatechange = function() {\n io._rS(transaction, config);\n };\n }\n\n try {\n // Determine if request is to be set as\n // synchronous or asynchronous.\n transaction.c.open(method, u, !sync, config.username || null, config.password || null);\n io._setHeaders(transaction.c, config.headers || {});\n io.start(transaction, config);\n\n // Will work only in browsers that implement the\n // Cross-Origin Resource Sharing draft.\n if (config.xdr && config.xdr.credentials && SUPPORTS_CORS) {\n transaction.c.withCredentials = true;\n }\n\n // Using \"null\" with HTTP POST will result in a request\n // with no Content-Length header defined.\n transaction.c.send(data);\n\n if (sync) {\n // Create a response object for synchronous transactions,\n // mixing id and arguments properties with the xhr\n // properties whitelist.\n for (i = 0, len = XHR_PROPS.length; i < len; ++i) {\n response[XHR_PROPS[i]] = transaction.c[XHR_PROPS[i]];\n }\n\n response.getAllResponseHeaders = function() {\n return transaction.c.getAllResponseHeaders();\n };\n\n response.getResponseHeader = function(name) {\n return transaction.c.getResponseHeader(name);\n };\n\n io.complete(transaction, config);\n io._result(transaction, config);\n\n return response;\n }\n } catch(e) {\n if (transaction.xdr) {\n // This exception is usually thrown by browsers\n // that do not support XMLHttpRequest Level 2.\n // Retry the request with the XDR transport set\n // to 'flash'. If the Flash transport is not\n // initialized or available, the transaction\n // will resolve to a transport error.\n return io._retry(transaction, uri, config);\n } else {\n io.complete(transaction, config);\n io._result(transaction, config);\n }\n }\n\n // If config.timeout is defined, and the request is standard XHR,\n // initialize timeout polling.\n if (config.timeout) {\n io._startTimeout(transaction, config.timeout);\n Y.log('Configuration timeout set to: ' + config.timeout, 'info', 'io');\n }\n\n return {\n id: transaction.id,\n abort: function() {\n return transaction.c ? io._abort(transaction, 'abort') : false;\n },\n isInProgress: function() {\n return transaction.c ? (transaction.c.readyState % 4) : false;\n },\n io: io\n };\n }\n};\n\n/**\nMethod for initiating an ajax call. The first argument is the url end\npoint for the call. The second argument is an object to configure the\ntransaction and attach event subscriptions. The configuration object\nsupports the following properties:\n\n<dl>\n <dt>method</dt>\n <dd>HTTP method verb (e.g., GET or POST). If this property is not\n not defined, the default value will be GET.</dd>\n\n <dt>data</dt>\n <dd>This is the name-value string that will be sent as the\n transaction data. If the request is HTTP GET, the data become\n part of querystring. If HTTP POST, the data are sent in the\n message body.</dd>\n\n <dt>xdr</dt>\n <dd>Defines the transport to be used for cross-domain requests.\n By setting this property, the transaction will use the specified\n transport instead of XMLHttpRequest. The properties of the\n transport object are:\n <dl>\n <dt>use</dt>\n <dd>The transport to be used: 'flash' or 'native'</dd>\n <dt>dataType</dt>\n <dd>Set the value to 'XML' if that is the expected response\n content type.</dd>\n </dl></dd>\n\n <dt>form</dt>\n <dd>Form serialization configuration object. Its properties are:\n <dl>\n <dt>id</dt>\n <dd>Node object or id of HTML form</dd>\n <dt>useDisabled</dt>\n <dd>`true` to also serialize disabled form field values\n (defaults to `false`)</dd>\n </dl></dd>\n\n <dt>on</dt>\n <dd>Assigns transaction event subscriptions. Available events are:\n <dl>\n <dt>start</dt>\n <dd>Fires when a request is sent to a resource.</dd>\n <dt>complete</dt>\n <dd>Fires when the transaction is complete.</dd>\n <dt>success</dt>\n <dd>Fires when the HTTP response status is within the 2xx\n range.</dd>\n <dt>failure</dt>\n <dd>Fires when the HTTP response status is outside the 2xx\n range, if an exception occurs, if the transation is aborted,\n or if the transaction exceeds a configured `timeout`.</dd>\n <dt>end</dt>\n <dd>Fires at the conclusion of the transaction\n lifecycle, after `success` or `failure`.</dd>\n </dl>\n\n <p>Callback functions for `start` and `end` receive the id of the\n transaction as a first argument. For `complete`, `success`, and\n `failure`, callbacks receive the id and the response object\n (usually the XMLHttpRequest instance). If the `arguments`\n property was included in the configuration object passed to\n `Y.io()`, the configured data will be passed to all callbacks as\n the last argument.</p>\n </dd>\n\n <dt>sync</dt>\n <dd>Pass `true` to make a same-domain transaction synchronous.\n <strong>CAVEAT</strong>: This will negatively impact the user\n experience. Have a <em>very</em> good reason if you intend to use\n this.</dd>\n\n <dt>context</dt>\n <dd>The \"`this'\" object for all configured event handlers. If a\n specific context is needed for individual callbacks, bind the\n callback to a context using `Y.bind()`.</dd>\n\n <dt>headers</dt>\n <dd>Object map of transaction headers to send to the server. The\n object keys are the header names and the values are the header\n values.</dd>\n\n <dt>timeout</dt>\n <dd>Millisecond threshold for the transaction before being\n automatically aborted.</dd>\n\n <dt>arguments</dt>\n <dd>User-defined data passed to all registered event handlers.\n This value is available as the second argument in the \"start\" and\n \"end\" event handlers. It is the third argument in the \"complete\",\n \"success\", and \"failure\" event handlers. <strong>Be sure to quote\n this property name in the transaction configuration as\n \"arguments\" is a reserved word in JavaScript</strong> (e.g.\n `Y.io({ ..., \"arguments\": stuff })`).</dd>\n</dl>\n\n@method io\n@static\n@param {String} url qualified path to transaction resource.\n@param {Object} config configuration object for the transaction.\n@return {Object}\n@for YUI\n**/\nY.io = function(url, config) {\n // Calling IO through the static interface will use and reuse\n // an instance of IO.\n var transaction = Y.io._map['io:0'] || new IO();\n return transaction.send.apply(transaction, [url, config]);\n};\n\n/**\nMethod for setting and deleting IO HTTP headers to be sent with every\nrequest.\n\nHosted as a property on the `io` function (e.g. `Y.io.header`).\n\n@method header\n@param {String} name HTTP header\n@param {String} value HTTP header value\n@static\n**/\nY.io.header = function(name, value) {\n // Calling IO through the static interface will use and reuse\n // an instance of IO.\n var transaction = Y.io._map['io:0'] || new IO();\n transaction.setHeader(name, value);\n};\n\nY.IO = IO;\n// Map of all IO instances created.\nY.io._map = {};\nvar XHR = win && win.XMLHttpRequest,\n XDR = win && win.XDomainRequest,\n AX = win && win.ActiveXObject,\n\n // Checks for the presence of the `withCredentials` in an XHR instance\n // object, which will be present if the environment supports CORS.\n SUPPORTS_CORS = XHR && 'withCredentials' in (new XMLHttpRequest());\n\n\nY.mix(Y.IO, {\n /**\n * The ID of the default IO transport, defaults to `xhr`\n * @property _default\n * @type {String}\n * @static\n */\n _default: 'xhr',\n /**\n *\n * @method defaultTransport\n * @static\n * @param {String} [id] The transport to set as the default, if empty a new transport is created.\n * @return {Object} The transport object with a `send` method\n */\n defaultTransport: function(id) {\n if (id) {\n Y.log('Setting default IO to: ' + id, 'info', 'io');\n Y.IO._default = id;\n } else {\n var o = {\n c: Y.IO.transports[Y.IO._default](),\n notify: Y.IO._default === 'xhr' ? false : true\n };\n Y.log('Creating default transport: ' + Y.IO._default, 'info', 'io');\n return o;\n }\n },\n /**\n * An object hash of custom transports available to IO\n * @property transports\n * @type {Object}\n * @static\n */\n transports: {\n xhr: function () {\n return XHR ? new XMLHttpRequest() :\n AX ? new ActiveXObject('Microsoft.XMLHTTP') : null;\n },\n xdr: function () {\n return XDR ? new XDomainRequest() : null;\n },\n iframe: function () { return {}; },\n flash: null,\n nodejs: null\n },\n /**\n * Create a custom transport of type and return it's object\n * @method customTransport\n * @param {String} id The id of the transport to create.\n * @static\n */\n customTransport: function(id) {\n var o = { c: Y.IO.transports[id]() };\n\n o[(id === 'xdr' || id === 'flash') ? 'xdr' : 'notify'] = true;\n return o;\n }\n});\n\nY.mix(Y.IO.prototype, {\n /**\n * Fired from the notify method of the transport which in turn fires\n * the event on the IO object.\n * @method notify\n * @param {String} event The name of the event\n * @param {Object} transaction The transaction object\n * @param {Object} config The configuration object for this transaction\n */\n notify: function(event, transaction, config) {\n var io = this;\n\n switch (event) {\n case 'timeout':\n case 'abort':\n case 'transport error':\n transaction.c = { status: 0, statusText: event };\n event = 'failure';\n default:\n io[event].apply(io, [transaction, config]);\n }\n }\n});\n\n\n\n\n}, '@VERSION@', {\"requires\": [\"event-custom-base\", \"querystring-stringify-simple\"]});\nYUI.add('json-parse', function (Y, NAME) {\n\nvar _JSON = Y.config.global.JSON;\n\nY.namespace('JSON').parse = function (obj, reviver, space) {\n return _JSON.parse((typeof obj === 'string' ? obj : obj + ''), reviver, space);\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('transition', function (Y, NAME) {\n\n/**\n* Provides the transition method for Node.\n* Transition has no API of its own, but adds the transition method to Node.\n*\n* @module transition\n* @requires node-style\n*/\n\nvar CAMEL_VENDOR_PREFIX = '',\n VENDOR_PREFIX = '',\n DOCUMENT = Y.config.doc,\n DOCUMENT_ELEMENT = 'documentElement',\n DOCUMENT_STYLE = DOCUMENT[DOCUMENT_ELEMENT].style,\n TRANSITION_CAMEL = 'transition',\n TRANSITION_PROPERTY_CAMEL = 'transitionProperty',\n TRANSITION_PROPERTY,\n TRANSITION_DURATION,\n TRANSITION_TIMING_FUNCTION,\n TRANSITION_DELAY,\n TRANSITION_END,\n ON_TRANSITION_END,\n\n EMPTY_OBJ = {},\n\n VENDORS = [\n 'Webkit',\n 'Moz'\n ],\n\n VENDOR_TRANSITION_END = {\n Webkit: 'webkitTransitionEnd'\n },\n\n/**\n * A class for constructing transition instances.\n * Adds the \"transition\" method to Node.\n * @class Transition\n * @constructor\n */\n\nTransition = function() {\n this.init.apply(this, arguments);\n};\n\n// One off handling of transform-prefixing.\nTransition._TRANSFORM = 'transform';\n\nTransition._toCamel = function(property) {\n property = property.replace(/-([a-z])/gi, function(m0, m1) {\n return m1.toUpperCase();\n });\n\n return property;\n};\n\nTransition._toHyphen = function(property) {\n property = property.replace(/([A-Z]?)([a-z]+)([A-Z]?)/g, function(m0, m1, m2, m3) {\n var str = ((m1) ? '-' + m1.toLowerCase() : '') + m2;\n\n if (m3) {\n str += '-' + m3.toLowerCase();\n }\n\n return str;\n });\n\n return property;\n};\n\nTransition.SHOW_TRANSITION = 'fadeIn';\nTransition.HIDE_TRANSITION = 'fadeOut';\n\nTransition.useNative = false;\n\n// Map transition properties to vendor-specific versions.\nif ('transition' in DOCUMENT_STYLE \n && 'transitionProperty' in DOCUMENT_STYLE \n && 'transitionDuration' in DOCUMENT_STYLE\n && 'transitionTimingFunction' in DOCUMENT_STYLE\n && 'transitionDelay' in DOCUMENT_STYLE) {\n Transition.useNative = true;\n Transition.supported = true; // TODO: remove\n} else {\n Y.Array.each(VENDORS, function(val) { // then vendor specific\n var property = val + 'Transition';\n if (property in DOCUMENT[DOCUMENT_ELEMENT].style) {\n CAMEL_VENDOR_PREFIX = val;\n VENDOR_PREFIX = Transition._toHyphen(val) + '-';\n\n Transition.useNative = true;\n Transition.supported = true; // TODO: remove\n Transition._VENDOR_PREFIX = val;\n }\n });\n}\n\n// Map transform property to vendor-specific versions.\n// One-off required for cssText injection.\nif (typeof DOCUMENT_STYLE.transform === 'undefined') {\n Y.Array.each(VENDORS, function(val) { // then vendor specific\n var property = val + 'Transform';\n if (typeof DOCUMENT_STYLE[property] !== 'undefined') {\n Transition._TRANSFORM = property;\n }\n });\n}\n\nif (CAMEL_VENDOR_PREFIX) {\n TRANSITION_CAMEL = CAMEL_VENDOR_PREFIX + 'Transition';\n TRANSITION_PROPERTY_CAMEL = CAMEL_VENDOR_PREFIX + 'TransitionProperty';\n}\n\nTRANSITION_PROPERTY = VENDOR_PREFIX + 'transition-property';\nTRANSITION_DURATION = VENDOR_PREFIX + 'transition-duration';\nTRANSITION_TIMING_FUNCTION = VENDOR_PREFIX + 'transition-timing-function';\nTRANSITION_DELAY = VENDOR_PREFIX + 'transition-delay';\n\nTRANSITION_END = 'transitionend';\nON_TRANSITION_END = 'on' + CAMEL_VENDOR_PREFIX.toLowerCase() + 'transitionend';\nTRANSITION_END = VENDOR_TRANSITION_END[CAMEL_VENDOR_PREFIX] || TRANSITION_END;\n\nTransition.fx = {};\nTransition.toggles = {};\n\nTransition._hasEnd = {};\n\nTransition._reKeywords = /^(?:node|duration|iterations|easing|delay|on|onstart|onend)$/i;\n\nY.Node.DOM_EVENTS[TRANSITION_END] = 1;\n\nTransition.NAME = 'transition';\n\nTransition.DEFAULT_EASING = 'ease';\nTransition.DEFAULT_DURATION = 0.5;\nTransition.DEFAULT_DELAY = 0;\n\nTransition._nodeAttrs = {};\n\nTransition.prototype = {\n constructor: Transition,\n init: function(node, config) {\n var anim = this;\n anim._node = node;\n if (!anim._running && config) {\n anim._config = config;\n node._transition = anim; // cache for reuse\n\n anim._duration = ('duration' in config) ?\n config.duration: anim.constructor.DEFAULT_DURATION;\n\n anim._delay = ('delay' in config) ?\n config.delay: anim.constructor.DEFAULT_DELAY;\n\n anim._easing = config.easing || anim.constructor.DEFAULT_EASING;\n anim._count = 0; // track number of animated properties\n anim._running = false;\n\n }\n\n return anim;\n },\n\n addProperty: function(prop, config) {\n var anim = this,\n node = this._node,\n uid = Y.stamp(node),\n nodeInstance = Y.one(node),\n attrs = Transition._nodeAttrs[uid],\n computed,\n compareVal,\n dur,\n attr,\n val;\n\n if (!attrs) {\n attrs = Transition._nodeAttrs[uid] = {};\n }\n\n attr = attrs[prop];\n\n // might just be a value\n if (config && config.value !== undefined) {\n val = config.value;\n } else if (config !== undefined) {\n val = config;\n config = EMPTY_OBJ;\n }\n\n if (typeof val === 'function') {\n val = val.call(nodeInstance, nodeInstance);\n }\n\n if (attr && attr.transition) {\n // take control if another transition owns this property\n if (attr.transition !== anim) {\n attr.transition._count--; // remapping attr to this transition\n }\n }\n\n anim._count++; // properties per transition\n\n // make 0 async and fire events\n dur = ((typeof config.duration !== 'undefined') ? config.duration :\n anim._duration) || 0.0001;\n\n attrs[prop] = {\n value: val,\n duration: dur,\n delay: (typeof config.delay !== 'undefined') ? config.delay :\n anim._delay,\n\n easing: config.easing || anim._easing,\n\n transition: anim\n };\n\n // native end event doesnt fire when setting to same value\n // supplementing with timer\n // val may be a string or number (height: 0, etc), but computedStyle is always string\n computed = Y.DOM.getComputedStyle(node, prop);\n compareVal = (typeof val === 'string') ? computed : parseFloat(computed);\n\n if (Transition.useNative && compareVal === val) {\n setTimeout(function() {\n anim._onNativeEnd.call(node, {\n propertyName: prop,\n elapsedTime: dur\n });\n }, dur * 1000);\n }\n },\n\n removeProperty: function(prop) {\n var anim = this,\n attrs = Transition._nodeAttrs[Y.stamp(anim._node)];\n\n if (attrs && attrs[prop]) {\n delete attrs[prop];\n anim._count--;\n }\n\n },\n\n initAttrs: function(config) {\n var attr,\n node = this._node;\n\n if (config.transform && !config[Transition._TRANSFORM]) {\n config[Transition._TRANSFORM] = config.transform;\n delete config.transform; // TODO: copy\n }\n\n for (attr in config) {\n if (config.hasOwnProperty(attr) && !Transition._reKeywords.test(attr)) {\n this.addProperty(attr, config[attr]);\n\n // when size is auto or % webkit starts from zero instead of computed\n // (https://bugs.webkit.org/show_bug.cgi?id=16020)\n // TODO: selective set\n if (node.style[attr] === '') {\n Y.DOM.setStyle(node, attr, Y.DOM.getComputedStyle(node, attr));\n }\n }\n }\n },\n\n /**\n * Starts or an animation.\n * @method run\n * @chainable\n * @private\n */\n run: function(callback) {\n var anim = this,\n node = anim._node,\n config = anim._config,\n data = {\n type: 'transition:start',\n config: config\n };\n\n\n if (!anim._running) {\n anim._running = true;\n\n if (config.on && config.on.start) {\n config.on.start.call(Y.one(node), data);\n }\n\n anim.initAttrs(anim._config);\n\n anim._callback = callback;\n anim._start();\n }\n\n\n return anim;\n },\n\n _start: function() {\n this._runNative();\n },\n\n _prepDur: function(dur) {\n dur = parseFloat(dur) * 1000;\n\n return dur + 'ms';\n },\n\n _runNative: function() {\n var anim = this,\n node = anim._node,\n uid = Y.stamp(node),\n style = node.style,\n computed = node.ownerDocument.defaultView.getComputedStyle(node),\n attrs = Transition._nodeAttrs[uid],\n cssText = '',\n cssTransition = computed[Transition._toCamel(TRANSITION_PROPERTY)],\n\n transitionText = TRANSITION_PROPERTY + ': ',\n duration = TRANSITION_DURATION + ': ',\n easing = TRANSITION_TIMING_FUNCTION + ': ',\n delay = TRANSITION_DELAY + ': ',\n hyphy,\n attr,\n name;\n\n // preserve existing transitions\n if (cssTransition !== 'all') {\n transitionText += cssTransition + ',';\n duration += computed[Transition._toCamel(TRANSITION_DURATION)] + ',';\n easing += computed[Transition._toCamel(TRANSITION_TIMING_FUNCTION)] + ',';\n delay += computed[Transition._toCamel(TRANSITION_DELAY)] + ',';\n\n }\n\n // run transitions mapped to this instance\n for (name in attrs) {\n hyphy = Transition._toHyphen(name);\n attr = attrs[name];\n if ((attr = attrs[name]) && attr.transition === anim) {\n if (name in node.style) { // only native styles allowed\n duration += anim._prepDur(attr.duration) + ',';\n delay += anim._prepDur(attr.delay) + ',';\n easing += (attr.easing) + ',';\n\n transitionText += hyphy + ',';\n cssText += hyphy + ': ' + attr.value + '; ';\n } else {\n this.removeProperty(name);\n }\n }\n }\n\n transitionText = transitionText.replace(/,$/, ';');\n duration = duration.replace(/,$/, ';');\n easing = easing.replace(/,$/, ';');\n delay = delay.replace(/,$/, ';');\n\n // only one native end event per node\n if (!Transition._hasEnd[uid]) {\n node.addEventListener(TRANSITION_END, anim._onNativeEnd, '');\n Transition._hasEnd[uid] = true;\n\n }\n\n style.cssText += transitionText + duration + easing + delay + cssText;\n\n },\n\n _end: function(elapsed) {\n var anim = this,\n node = anim._node,\n callback = anim._callback,\n config = anim._config,\n data = {\n type: 'transition:end',\n config: config,\n elapsedTime: elapsed\n },\n\n nodeInstance = Y.one(node);\n\n anim._running = false;\n anim._callback = null;\n\n if (node) {\n if (config.on && config.on.end) {\n setTimeout(function() { // IE: allow previous update to finish\n config.on.end.call(nodeInstance, data);\n\n // nested to ensure proper fire order\n if (callback) {\n callback.call(nodeInstance, data);\n }\n\n }, 1);\n } else if (callback) {\n setTimeout(function() { // IE: allow previous update to finish\n callback.call(nodeInstance, data);\n }, 1);\n }\n }\n\n },\n\n _endNative: function(name) {\n var node = this._node,\n value = node.ownerDocument.defaultView.getComputedStyle(node, '')[Transition._toCamel(TRANSITION_PROPERTY)];\n\n name = Transition._toHyphen(name);\n if (typeof value === 'string') {\n value = value.replace(new RegExp('(?:^|,\\\\s)' + name + ',?'), ',');\n value = value.replace(/^,|,$/, '');\n node.style[TRANSITION_CAMEL] = value;\n }\n },\n\n _onNativeEnd: function(e) {\n var node = this,\n uid = Y.stamp(node),\n event = e,//e._event,\n name = Transition._toCamel(event.propertyName),\n elapsed = event.elapsedTime,\n attrs = Transition._nodeAttrs[uid],\n attr = attrs[name],\n anim = (attr) ? attr.transition : null,\n data,\n config;\n\n if (anim) {\n anim.removeProperty(name);\n anim._endNative(name);\n config = anim._config[name];\n\n data = {\n type: 'propertyEnd',\n propertyName: name,\n elapsedTime: elapsed,\n config: config\n };\n\n if (config && config.on && config.on.end) {\n config.on.end.call(Y.one(node), data);\n }\n\n if (anim._count <= 0) { // after propertyEnd fires\n anim._end(elapsed);\n node.style[TRANSITION_PROPERTY_CAMEL] = ''; // clean up style\n }\n }\n },\n\n destroy: function() {\n var anim = this,\n node = anim._node;\n\n if (node) {\n node.removeEventListener(TRANSITION_END, anim._onNativeEnd, false);\n anim._node = null;\n }\n }\n};\n\nY.Transition = Transition;\nY.TransitionNative = Transition; // TODO: remove\n\n/**\n * Animate one or more css properties to a given value. Requires the \"transition\" module.\n * <pre>example usage:\n * Y.one('#demo').transition({\n * duration: 1, // in seconds, default is 0.5\n * easing: 'ease-out', // default is 'ease'\n * delay: '1', // delay start for 1 second, default is 0\n *\n * height: '10px',\n * width: '10px',\n *\n * opacity: { // per property\n * value: 0,\n * duration: 2,\n * delay: 2,\n * easing: 'ease-in'\n * }\n * });\n * </pre>\n * @for Node\n * @method transition\n * @param {Object} config An object containing one or more style properties, a duration and an easing.\n * @param {Function} callback A function to run after the transition has completed.\n * @chainable\n*/\nY.Node.prototype.transition = function(name, config, callback) {\n var\n transitionAttrs = Transition._nodeAttrs[Y.stamp(this._node)],\n anim = (transitionAttrs) ? transitionAttrs.transition || null : null,\n fxConfig,\n prop;\n\n if (typeof name === 'string') { // named effect, pull config from registry\n if (typeof config === 'function') {\n callback = config;\n config = null;\n }\n\n fxConfig = Transition.fx[name];\n\n if (config && typeof config !== 'boolean') {\n config = Y.clone(config);\n\n for (prop in fxConfig) {\n if (fxConfig.hasOwnProperty(prop)) {\n if (! (prop in config)) {\n config[prop] = fxConfig[prop];\n }\n }\n }\n } else {\n config = fxConfig;\n }\n\n } else { // name is a config, config is a callback or undefined\n callback = config;\n config = name;\n }\n\n if (anim && !anim._running) {\n anim.init(this, config);\n } else {\n anim = new Transition(this._node, config);\n }\n\n anim.run(callback);\n return this;\n};\n\nY.Node.prototype.show = function(name, config, callback) {\n this._show(); // show prior to transition\n if (name && Y.Transition) {\n if (typeof name !== 'string' && !name.push) { // named effect or array of effects supercedes default\n if (typeof config === 'function') {\n callback = config;\n config = name;\n }\n name = Transition.SHOW_TRANSITION;\n }\n this.transition(name, config, callback);\n }\n else if (name && !Y.Transition) { Y.log('unable to transition show; missing transition module', 'warn', 'node'); }\n return this;\n};\n\nY.NodeList.prototype.show = function(name, config, callback) {\n var nodes = this._nodes,\n i = 0,\n node;\n\n while ((node = nodes[i++])) {\n Y.one(node).show(name, config, callback);\n }\n\n return this;\n};\n\n\n\nvar _wrapCallBack = function(anim, fn, callback) {\n return function() {\n if (fn) {\n fn.call(anim);\n }\n if (callback && typeof callback === 'function') {\n callback.apply(anim._node, arguments);\n }\n };\n};\n\nY.Node.prototype.hide = function(name, config, callback) {\n if (name && Y.Transition) {\n if (typeof config === 'function') {\n callback = config;\n config = null;\n }\n\n callback = _wrapCallBack(this, this._hide, callback); // wrap with existing callback\n if (typeof name !== 'string' && !name.push) { // named effect or array of effects supercedes default\n if (typeof config === 'function') {\n callback = config;\n config = name;\n }\n name = Transition.HIDE_TRANSITION;\n }\n this.transition(name, config, callback);\n } else if (name && !Y.Transition) { Y.log('unable to transition hide; missing transition module', 'warn', 'node');\n } else {\n this._hide();\n }\n return this;\n};\n\nY.NodeList.prototype.hide = function(name, config, callback) {\n var nodes = this._nodes,\n i = 0,\n node;\n\n while ((node = nodes[i++])) {\n Y.one(node).hide(name, config, callback);\n }\n\n return this;\n};\n\n/**\n * Animate one or more css properties to a given value. Requires the \"transition\" module.\n * <pre>example usage:\n * Y.all('.demo').transition({\n * duration: 1, // in seconds, default is 0.5\n * easing: 'ease-out', // default is 'ease'\n * delay: '1', // delay start for 1 second, default is 0\n *\n * height: '10px',\n * width: '10px',\n *\n * opacity: { // per property\n * value: 0,\n * duration: 2,\n * delay: 2,\n * easing: 'ease-in'\n * }\n * });\n * </pre>\n * @for NodeList\n * @method transition\n * @param {Object} config An object containing one or more style properties, a duration and an easing.\n * @param {Function} callback A function to run after the transition has completed. The callback fires\n * once per item in the NodeList.\n * @chainable\n*/\nY.NodeList.prototype.transition = function(config, callback) {\n var nodes = this._nodes,\n i = 0,\n node;\n\n while ((node = nodes[i++])) {\n Y.one(node).transition(config, callback);\n }\n\n return this;\n};\n\nY.Node.prototype.toggleView = function(name, on, callback) {\n this._toggles = this._toggles || [];\n callback = arguments[arguments.length - 1];\n\n if (typeof name !== 'string') { // no transition, just toggle\n on = name;\n this._toggleView(on, callback); // call original _toggleView in Y.Node\n return;\n }\n\n if (typeof on === 'function') { // Ignore \"on\" if used for callback argument.\n on = undefined;\n }\n\n if (typeof on === 'undefined' && name in this._toggles) { // reverse current toggle\n on = ! this._toggles[name];\n }\n\n on = (on) ? 1 : 0;\n if (on) {\n this._show();\n } else {\n callback = _wrapCallBack(this, this._hide, callback);\n }\n\n this._toggles[name] = on;\n this.transition(Y.Transition.toggles[name][on], callback);\n\n return this;\n};\n\nY.NodeList.prototype.toggleView = function(name, on, callback) {\n var nodes = this._nodes,\n i = 0,\n node;\n\n while ((node = nodes[i++])) {\n node = Y.one(node);\n node.toggleView.apply(node, arguments);\n }\n\n return this;\n};\n\nY.mix(Transition.fx, {\n fadeOut: {\n opacity: 0,\n duration: 0.5,\n easing: 'ease-out'\n },\n\n fadeIn: {\n opacity: 1,\n duration: 0.5,\n easing: 'ease-in'\n },\n\n sizeOut: {\n height: 0,\n width: 0,\n duration: 0.75,\n easing: 'ease-out'\n },\n\n sizeIn: {\n height: function(node) {\n return node.get('scrollHeight') + 'px';\n },\n width: function(node) {\n return node.get('scrollWidth') + 'px';\n },\n duration: 0.5,\n easing: 'ease-in',\n\n on: {\n start: function() {\n var overflow = this.getStyle('overflow');\n if (overflow !== 'hidden') { // enable scrollHeight/Width\n this.setStyle('overflow', 'hidden');\n this._transitionOverflow = overflow;\n }\n },\n\n end: function() {\n if (this._transitionOverflow) { // revert overridden value\n this.setStyle('overflow', this._transitionOverflow);\n delete this._transitionOverflow;\n }\n }\n }\n }\n});\n\nY.mix(Transition.toggles, {\n size: ['sizeOut', 'sizeIn'],\n fade: ['fadeOut', 'fadeIn']\n});\n\n\n}, '@VERSION@', {\"requires\": [\"node-style\"]});\nYUI.add('selector-css2', function (Y, NAME) {\n\n/**\n * The selector module provides helper methods allowing CSS2 Selectors to be used with DOM elements.\n * @module dom\n * @submodule selector-css2\n * @for Selector\n */\n\n/*\n * Provides helper methods for collecting and filtering DOM elements.\n */\n\nvar PARENT_NODE = 'parentNode',\n TAG_NAME = 'tagName',\n ATTRIBUTES = 'attributes',\n COMBINATOR = 'combinator',\n PSEUDOS = 'pseudos',\n\n Selector = Y.Selector,\n\n SelectorCSS2 = {\n _reRegExpTokens: /([\\^\\$\\?\\[\\]\\*\\+\\-\\.\\(\\)\\|\\\\])/,\n SORT_RESULTS: true,\n\n // TODO: better detection, document specific\n _isXML: (function() {\n var isXML = (Y.config.doc.createElement('div').tagName !== 'DIV');\n return isXML;\n }()),\n\n /**\n * Mapping of shorthand tokens to corresponding attribute selector \n * @property shorthand\n * @type object\n */\n shorthand: {\n '\\\\#(-?[_a-z0-9]+[-\\\\w\\\\uE000]*)': '[id=$1]',\n '\\\\.(-?[_a-z]+[-\\\\w\\\\uE000]*)': '[className~=$1]'\n },\n\n /**\n * List of operators and corresponding boolean functions. \n * These functions are passed the attribute and the current node's value of the attribute.\n * @property operators\n * @type object\n */\n operators: {\n '': function(node, attr) { return Y.DOM.getAttribute(node, attr) !== ''; }, // Just test for existence of attribute\n '~=': '(?:^|\\\\s+){val}(?:\\\\s+|$)', // space-delimited\n '|=': '^{val}-?' // optional hyphen-delimited\n },\n\n pseudos: {\n 'first-child': function(node) { \n return Y.DOM._children(node[PARENT_NODE])[0] === node; \n } \n },\n\n _bruteQuery: function(selector, root, firstOnly) {\n var ret = [],\n nodes = [],\n tokens = Selector._tokenize(selector),\n token = tokens[tokens.length - 1],\n rootDoc = Y.DOM._getDoc(root),\n child,\n id,\n className,\n tagName;\n\n if (token) {\n // prefilter nodes\n id = token.id;\n className = token.className;\n tagName = token.tagName || '*';\n\n if (root.getElementsByTagName) { // non-IE lacks DOM api on doc frags\n // try ID first, unless no root.all && root not in document\n // (root.all works off document, but not getElementById)\n if (id && (root.all || (root.nodeType === 9 || Y.DOM.inDoc(root)))) {\n nodes = Y.DOM.allById(id, root);\n // try className\n } else if (className) {\n nodes = root.getElementsByClassName(className);\n } else { // default to tagName\n nodes = root.getElementsByTagName(tagName);\n }\n\n } else { // brute getElementsByTagName()\n child = root.firstChild;\n while (child) {\n // only collect HTMLElements\n // match tag to supplement missing getElementsByTagName\n if (child.tagName && (tagName === '*' || child.tagName === tagName)) {\n nodes.push(child);\n }\n child = child.nextSibling || child.firstChild;\n }\n }\n if (nodes.length) {\n ret = Selector._filterNodes(nodes, tokens, firstOnly);\n }\n }\n\n return ret;\n },\n \n _filterNodes: function(nodes, tokens, firstOnly) {\n var i = 0,\n j,\n len = tokens.length,\n n = len - 1,\n result = [],\n node = nodes[0],\n tmpNode = node,\n getters = Y.Selector.getters,\n operator,\n combinator,\n token,\n path,\n pass,\n value,\n tests,\n test;\n\n for (i = 0; (tmpNode = node = nodes[i++]);) {\n n = len - 1;\n path = null;\n \n testLoop:\n while (tmpNode && tmpNode.tagName) {\n token = tokens[n];\n tests = token.tests;\n j = tests.length;\n if (j && !pass) {\n while ((test = tests[--j])) {\n operator = test[1];\n if (getters[test[0]]) {\n value = getters[test[0]](tmpNode, test[0]);\n } else {\n value = tmpNode[test[0]];\n if (test[0] === 'tagName' && !Selector._isXML) {\n value = value.toUpperCase(); \n }\n if (typeof value != 'string' && value !== undefined && value.toString) {\n value = value.toString(); // coerce for comparison\n } else if (value === undefined && tmpNode.getAttribute) {\n // use getAttribute for non-standard attributes\n value = tmpNode.getAttribute(test[0], 2); // 2 === force string for IE\n }\n }\n\n if ((operator === '=' && value !== test[2]) || // fast path for equality\n (typeof operator !== 'string' && // protect against String.test monkey-patch (Moo)\n operator.test && !operator.test(value)) || // regex test\n (!operator.test && // protect against RegExp as function (webkit)\n typeof operator === 'function' && !operator(tmpNode, test[0], test[2]))) { // function test\n\n // skip non element nodes or non-matching tags\n if ((tmpNode = tmpNode[path])) {\n while (tmpNode &&\n (!tmpNode.tagName ||\n (token.tagName && token.tagName !== tmpNode.tagName))\n ) {\n tmpNode = tmpNode[path]; \n }\n }\n continue testLoop;\n }\n }\n }\n\n n--; // move to next token\n // now that we've passed the test, move up the tree by combinator\n if (!pass && (combinator = token.combinator)) {\n path = combinator.axis;\n tmpNode = tmpNode[path];\n\n // skip non element nodes\n while (tmpNode && !tmpNode.tagName) {\n tmpNode = tmpNode[path]; \n }\n\n if (combinator.direct) { // one pass only\n path = null; \n }\n\n } else { // success if we made it this far\n result.push(node);\n if (firstOnly) {\n return result;\n }\n break;\n }\n }\n }\n node = tmpNode = null;\n return result;\n },\n\n combinators: {\n ' ': {\n axis: 'parentNode'\n },\n\n '>': {\n axis: 'parentNode',\n direct: true\n },\n\n\n '+': {\n axis: 'previousSibling',\n direct: true\n }\n },\n\n _parsers: [\n {\n name: ATTRIBUTES,\n re: /^\\uE003(-?[a-z]+[\\w\\-]*)+([~\\|\\^\\$\\*!=]=?)?['\"]?([^\\uE004'\"]*)['\"]?\\uE004/i,\n fn: function(match, token) {\n var operator = match[2] || '',\n operators = Selector.operators,\n escVal = (match[3]) ? match[3].replace(/\\\\/g, '') : '',\n test;\n\n // add prefiltering for ID and CLASS\n if ((match[1] === 'id' && operator === '=') ||\n (match[1] === 'className' &&\n Y.config.doc.documentElement.getElementsByClassName &&\n (operator === '~=' || operator === '='))) {\n token.prefilter = match[1];\n\n\n match[3] = escVal; \n\n // escape all but ID for prefilter, which may run through QSA (via Dom.allById)\n token[match[1]] = (match[1] === 'id') ? match[3] : escVal;\n\n }\n\n // add tests\n if (operator in operators) {\n test = operators[operator];\n if (typeof test === 'string') {\n match[3] = escVal.replace(Selector._reRegExpTokens, '\\\\$1');\n test = new RegExp(test.replace('{val}', match[3]));\n }\n match[2] = test;\n }\n if (!token.last || token.prefilter !== match[1]) {\n return match.slice(1);\n }\n }\n },\n {\n name: TAG_NAME,\n re: /^((?:-?[_a-z]+[\\w-]*)|\\*)/i,\n fn: function(match, token) {\n var tag = match[1];\n\n if (!Selector._isXML) {\n tag = tag.toUpperCase();\n }\n\n token.tagName = tag;\n\n if (tag !== '*' && (!token.last || token.prefilter)) {\n return [TAG_NAME, '=', tag];\n }\n if (!token.prefilter) {\n token.prefilter = 'tagName';\n }\n }\n },\n {\n name: COMBINATOR,\n re: /^\\s*([>+~]|\\s)\\s*/,\n fn: function(match, token) {\n }\n },\n {\n name: PSEUDOS,\n re: /^:([\\-\\w]+)(?:\\uE005['\"]?([^\\uE005]*)['\"]?\\uE006)*/i,\n fn: function(match, token) {\n var test = Selector[PSEUDOS][match[1]];\n if (test) { // reorder match array and unescape special chars for tests\n if (match[2]) {\n match[2] = match[2].replace(/\\\\/g, '');\n }\n return [match[2], test]; \n } else { // selector token not supported (possibly missing CSS3 module)\n return false;\n }\n }\n }\n ],\n\n _getToken: function(token) {\n return {\n tagName: null,\n id: null,\n className: null,\n attributes: {},\n combinator: null,\n tests: []\n };\n },\n\n /*\n Break selector into token units per simple selector.\n Combinator is attached to the previous token.\n */\n _tokenize: function(selector) {\n selector = selector || '';\n selector = Selector._parseSelector(Y.Lang.trim(selector)); \n var token = Selector._getToken(), // one token per simple selector (left selector holds combinator)\n query = selector, // original query for debug report\n tokens = [], // array of tokens\n found = false, // whether or not any matches were found this pass\n match, // the regex match\n test,\n i, parser;\n\n /*\n Search for selector patterns, store, and strip them from the selector string\n until no patterns match (invalid selector) or we run out of chars.\n\n Multiple attributes and pseudos are allowed, in any order.\n for example:\n 'form:first-child[type=button]:not(button)[lang|=en]'\n */\n outer:\n do {\n found = false; // reset after full pass\n for (i = 0; (parser = Selector._parsers[i++]);) {\n if ( (match = parser.re.exec(selector)) ) { // note assignment\n if (parser.name !== COMBINATOR ) {\n token.selector = selector;\n }\n selector = selector.replace(match[0], ''); // strip current match from selector\n if (!selector.length) {\n token.last = true;\n }\n\n if (Selector._attrFilters[match[1]]) { // convert class to className, etc.\n match[1] = Selector._attrFilters[match[1]];\n }\n\n test = parser.fn(match, token);\n if (test === false) { // selector not supported\n found = false;\n break outer;\n } else if (test) {\n token.tests.push(test);\n }\n\n if (!selector.length || parser.name === COMBINATOR) {\n tokens.push(token);\n token = Selector._getToken(token);\n if (parser.name === COMBINATOR) {\n token.combinator = Y.Selector.combinators[match[1]];\n }\n }\n found = true;\n }\n }\n } while (found && selector.length);\n\n if (!found || selector.length) { // not fully parsed\n Y.log('query: ' + query + ' contains unsupported token in: ' + selector, 'warn', 'Selector');\n tokens = [];\n }\n return tokens;\n },\n\n _replaceMarkers: function(selector) {\n selector = selector.replace(/\\[/g, '\\uE003');\n selector = selector.replace(/\\]/g, '\\uE004');\n\n selector = selector.replace(/\\(/g, '\\uE005');\n selector = selector.replace(/\\)/g, '\\uE006');\n return selector;\n },\n\n _replaceShorthand: function(selector) {\n var shorthand = Y.Selector.shorthand,\n re;\n\n for (re in shorthand) {\n if (shorthand.hasOwnProperty(re)) {\n selector = selector.replace(new RegExp(re, 'gi'), shorthand[re]);\n }\n }\n\n return selector;\n },\n\n _parseSelector: function(selector) {\n var replaced = Y.Selector._replaceSelector(selector),\n selector = replaced.selector;\n\n // replace shorthand (\".foo, #bar\") after pseudos and attrs\n // to avoid replacing unescaped chars\n selector = Y.Selector._replaceShorthand(selector);\n\n selector = Y.Selector._restore('attr', selector, replaced.attrs);\n selector = Y.Selector._restore('pseudo', selector, replaced.pseudos);\n\n // replace braces and parens before restoring escaped chars\n // to avoid replacing ecaped markers\n selector = Y.Selector._replaceMarkers(selector);\n selector = Y.Selector._restore('esc', selector, replaced.esc);\n\n return selector;\n },\n\n _attrFilters: {\n 'class': 'className',\n 'for': 'htmlFor'\n },\n\n getters: {\n href: function(node, attr) {\n return Y.DOM.getAttribute(node, attr);\n },\n\n id: function(node, attr) {\n return Y.DOM.getId(node);\n }\n }\n };\n\nY.mix(Y.Selector, SelectorCSS2, true);\nY.Selector.getters.src = Y.Selector.getters.rel = Y.Selector.getters.href;\n\n// IE wants class with native queries\nif (Y.Selector.useNative && Y.config.doc.querySelector) {\n Y.Selector.shorthand['\\\\.(-?[_a-z]+[-\\\\w]*)'] = '[class~=$1]';\n}\n\n\n\n}, '@VERSION@', {\"requires\": [\"selector-native\"]});\nYUI.add('selector-css3', function (Y, NAME) {\n\n/**\n * The selector css3 module provides support for css3 selectors.\n * @module dom\n * @submodule selector-css3\n * @for Selector\n */\n\n/*\n an+b = get every _a_th node starting at the _b_th\n 0n+b = no repeat (\"0\" and \"n\" may both be omitted (together) , e.g. \"0n+1\" or \"1\", not \"0+1\"), return only the _b_th element\n 1n+b = get every element starting from b (\"1\" may may be omitted, e.g. \"1n+0\" or \"n+0\" or \"n\")\n an+0 = get every _a_th element, \"0\" may be omitted \n*/\n\nY.Selector._reNth = /^(?:([\\-]?\\d*)(n){1}|(odd|even)$)*([\\-+]?\\d*)$/;\n\nY.Selector._getNth = function(node, expr, tag, reverse) {\n Y.Selector._reNth.test(expr);\n var a = parseInt(RegExp.$1, 10), // include every _a_ elements (zero means no repeat, just first _a_)\n n = RegExp.$2, // \"n\"\n oddeven = RegExp.$3, // \"odd\" or \"even\"\n b = parseInt(RegExp.$4, 10) || 0, // start scan from element _b_\n result = [],\n siblings = Y.DOM._children(node.parentNode, tag),\n op;\n\n if (oddeven) {\n a = 2; // always every other\n op = '+';\n n = 'n';\n b = (oddeven === 'odd') ? 1 : 0;\n } else if ( isNaN(a) ) {\n a = (n) ? 1 : 0; // start from the first or no repeat\n }\n\n if (a === 0) { // just the first\n if (reverse) {\n b = siblings.length - b + 1; \n }\n\n if (siblings[b - 1] === node) {\n return true;\n } else {\n return false;\n }\n\n } else if (a < 0) {\n reverse = !!reverse;\n a = Math.abs(a);\n }\n\n if (!reverse) {\n for (var i = b - 1, len = siblings.length; i < len; i += a) {\n if ( i >= 0 && siblings[i] === node ) {\n return true;\n }\n }\n } else {\n for (var i = siblings.length - b, len = siblings.length; i >= 0; i -= a) {\n if ( i < len && siblings[i] === node ) {\n return true;\n }\n }\n }\n return false;\n};\n\nY.mix(Y.Selector.pseudos, {\n 'root': function(node) {\n return node === node.ownerDocument.documentElement;\n },\n\n 'nth-child': function(node, expr) {\n return Y.Selector._getNth(node, expr);\n },\n\n 'nth-last-child': function(node, expr) {\n return Y.Selector._getNth(node, expr, null, true);\n },\n\n 'nth-of-type': function(node, expr) {\n return Y.Selector._getNth(node, expr, node.tagName);\n },\n \n 'nth-last-of-type': function(node, expr) {\n return Y.Selector._getNth(node, expr, node.tagName, true);\n },\n \n 'last-child': function(node) {\n var children = Y.DOM._children(node.parentNode);\n return children[children.length - 1] === node;\n },\n\n 'first-of-type': function(node) {\n return Y.DOM._children(node.parentNode, node.tagName)[0] === node;\n },\n \n 'last-of-type': function(node) {\n var children = Y.DOM._children(node.parentNode, node.tagName);\n return children[children.length - 1] === node;\n },\n \n 'only-child': function(node) {\n var children = Y.DOM._children(node.parentNode);\n return children.length === 1 && children[0] === node;\n },\n\n 'only-of-type': function(node) {\n var children = Y.DOM._children(node.parentNode, node.tagName);\n return children.length === 1 && children[0] === node;\n },\n\n 'empty': function(node) {\n return node.childNodes.length === 0;\n },\n\n 'not': function(node, expr) {\n return !Y.Selector.test(node, expr);\n },\n\n 'contains': function(node, expr) {\n var text = node.innerText || node.textContent || '';\n return text.indexOf(expr) > -1;\n },\n\n 'checked': function(node) {\n return (node.checked === true || node.selected === true);\n },\n\n enabled: function(node) {\n return (node.disabled !== undefined && !node.disabled);\n },\n\n disabled: function(node) {\n return (node.disabled);\n }\n});\n\nY.mix(Y.Selector.operators, {\n '^=': '^{val}', // Match starts with value\n '$=': '{val}$', // Match ends with value\n '*=': '{val}' // Match contains value as substring \n});\n\nY.Selector.combinators['~'] = {\n axis: 'previousSibling'\n};\n\n\n}, '@VERSION@', {\"requires\": [\"selector-native\", \"selector-css2\"]});\nYUI.add('yui-log', function (Y, NAME) {\n\n/**\n * Provides console log capability and exposes a custom event for\n * console implementations. This module is a `core` YUI module,\n * <a href=\"../classes/YUI.html#method_log\">it's documentation is located under the YUI class</a>.\n *\n * @module yui\n * @submodule yui-log\n */\n\nvar INSTANCE = Y,\n LOGEVENT = 'yui:log',\n UNDEFINED = 'undefined',\n LEVELS = { debug: 1,\n info: 1,\n warn: 1,\n error: 1 };\n\n/**\n * If the 'debug' config is true, a 'yui:log' event will be\n * dispatched, which the Console widget and anything else\n * can consume. If the 'useBrowserConsole' config is true, it will\n * write to the browser console if available. YUI-specific log\n * messages will only be present in the -debug versions of the\n * JS files. The build system is supposed to remove log statements\n * from the raw and minified versions of the files.\n *\n * @method log\n * @for YUI\n * @param {String} msg The message to log.\n * @param {String} cat The log category for the message. Default\n * categories are \"info\", \"warn\", \"error\", time\".\n * Custom categories can be used as well. (opt).\n * @param {String} src The source of the the message (opt).\n * @param {boolean} silent If true, the log event won't fire.\n * @return {YUI} YUI instance.\n */\nINSTANCE.log = function(msg, cat, src, silent) {\n var bail, excl, incl, m, f,\n Y = INSTANCE,\n c = Y.config,\n publisher = (Y.fire) ? Y : YUI.Env.globalEvents;\n // suppress log message if the config is off or the event stack\n // or the event call stack contains a consumer of the yui:log event\n if (c.debug) {\n // apply source filters\n src = src || \"\";\n if (typeof src !== \"undefined\") {\n excl = c.logExclude;\n incl = c.logInclude;\n if (incl && !(src in incl)) {\n bail = 1;\n } else if (incl && (src in incl)) {\n bail = !incl[src];\n } else if (excl && (src in excl)) {\n bail = excl[src];\n }\n }\n if (!bail) {\n if (c.useBrowserConsole) {\n m = (src) ? src + ': ' + msg : msg;\n if (Y.Lang.isFunction(c.logFn)) {\n c.logFn.call(Y, msg, cat, src);\n } else if (typeof console !== UNDEFINED && console.log) {\n f = (cat && console[cat] && (cat in LEVELS)) ? cat : 'log';\n console[f](m);\n } else if (typeof opera !== UNDEFINED) {\n opera.postError(m);\n }\n }\n\n if (publisher && !silent) {\n\n if (publisher === Y && (!publisher.getEvent(LOGEVENT))) {\n publisher.publish(LOGEVENT, {\n broadcast: 2\n });\n }\n\n publisher.fire(LOGEVENT, {\n msg: msg,\n cat: cat,\n src: src\n });\n }\n }\n }\n\n return Y;\n};\n\n/**\n * Write a system message. This message will be preserved in the\n * minified and raw versions of the YUI files, unlike log statements.\n * @method message\n * @for YUI\n * @param {String} msg The message to log.\n * @param {String} cat The log category for the message. Default\n * categories are \"info\", \"warn\", \"error\", time\".\n * Custom categories can be used as well. (opt).\n * @param {String} src The source of the the message (opt).\n * @param {boolean} silent If true, the log event won't fire.\n * @return {YUI} YUI instance.\n */\nINSTANCE.message = function() {\n return INSTANCE.log.apply(INSTANCE, arguments);\n};\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('dump', function (Y, NAME) {\n\n/**\n * Returns a simple string representation of the object or array.\n * Other types of objects will be returned unprocessed. Arrays\n * are expected to be indexed. Use object notation for\n * associative arrays.\n *\n * If included, the dump method is added to the YUI instance.\n *\n * @module dump\n */\n\n var L = Y.Lang,\n OBJ = '{...}',\n FUN = 'f(){...}',\n COMMA = ', ',\n ARROW = ' => ',\n\n /**\n * Returns a simple string representation of the object or array.\n * Other types of objects will be returned unprocessed. Arrays\n * are expected to be indexed.\n *\n * @method dump\n * @param {Object} o The object to dump.\n * @param {Number} d How deep to recurse child objects, default 3.\n * @return {String} the dump result.\n * @for YUI\n */\n dump = function(o, d) {\n var i, len, s = [], type = L.type(o);\n\n // Cast non-objects to string\n // Skip dates because the std toString is what we want\n // Skip HTMLElement-like objects because trying to dump\n // an element will cause an unhandled exception in FF 2.x\n if (!L.isObject(o)) {\n return o + '';\n } else if (type == 'date') {\n return o;\n } else if (o.nodeType && o.tagName) {\n return o.tagName + '#' + o.id;\n } else if (o.document && o.navigator) {\n return 'window';\n } else if (o.location && o.body) {\n return 'document';\n } else if (type == 'function') {\n return FUN;\n }\n\n // dig into child objects the depth specifed. Default 3\n d = (L.isNumber(d)) ? d : 3;\n\n // arrays [1, 2, 3]\n if (type == 'array') {\n s.push('[');\n for (i = 0, len = o.length; i < len; i = i + 1) {\n if (L.isObject(o[i])) {\n s.push((d > 0) ? L.dump(o[i], d - 1) : OBJ);\n } else {\n s.push(o[i]);\n }\n s.push(COMMA);\n }\n if (s.length > 1) {\n s.pop();\n }\n s.push(']');\n // regexp /foo/\n } else if (type == 'regexp') {\n s.push(o.toString());\n // objects {k1 => v1, k2 => v2}\n } else {\n s.push('{');\n for (i in o) {\n if (o.hasOwnProperty(i)) {\n try {\n s.push(i + ARROW);\n if (L.isObject(o[i])) {\n s.push((d > 0) ? L.dump(o[i], d - 1) : OBJ);\n } else {\n s.push(o[i]);\n }\n s.push(COMMA);\n } catch (e) {\n s.push('Error: ' + e.message);\n }\n }\n }\n if (s.length > 1) {\n s.pop();\n }\n s.push('}');\n }\n\n return s.join('');\n };\n\n Y.dump = dump;\n L.dump = dump;\n\n\n\n}, '@VERSION@', {\"requires\": [\"yui-base\"]});\nYUI.add('transition-timer', function (Y, NAME) {\n\n/**\n* Provides the base Transition class, for animating numeric properties.\n*\n* @module transition\n* @submodule transition-timer\n*/\n\n\nvar Transition = Y.Transition;\n\nY.mix(Transition.prototype, {\n _start: function() {\n if (Transition.useNative) {\n this._runNative();\n } else {\n this._runTimer();\n }\n },\n\n _runTimer: function() {\n var anim = this;\n anim._initAttrs();\n\n Transition._running[Y.stamp(anim)] = anim;\n anim._startTime = new Date();\n Transition._startTimer();\n },\n\n _endTimer: function() {\n var anim = this;\n delete Transition._running[Y.stamp(anim)];\n anim._startTime = null;\n },\n\n _runFrame: function() {\n var t = new Date() - this._startTime;\n this._runAttrs(t);\n },\n\n _runAttrs: function(time) {\n var anim = this,\n node = anim._node,\n config = anim._config,\n uid = Y.stamp(node),\n attrs = Transition._nodeAttrs[uid],\n customAttr = Transition.behaviors,\n done = false,\n allDone = false,\n data,\n name,\n attribute,\n setter,\n elapsed,\n delay,\n d,\n t,\n i;\n\n for (name in attrs) {\n if ((attribute = attrs[name]) && attribute.transition === anim) {\n d = attribute.duration;\n delay = attribute.delay;\n elapsed = (time - delay) / 1000;\n t = time;\n data = {\n type: 'propertyEnd',\n propertyName: name,\n config: config,\n elapsedTime: elapsed\n };\n\n setter = (i in customAttr && 'set' in customAttr[i]) ?\n customAttr[i].set : Transition.DEFAULT_SETTER;\n\n done = (t >= d);\n\n if (t > d) {\n t = d;\n }\n\n if (!delay || time >= delay) {\n setter(anim, name, attribute.from, attribute.to, t - delay, d - delay,\n attribute.easing, attribute.unit);\n\n if (done) {\n delete attrs[name];\n anim._count--;\n\n if (config[name] && config[name].on && config[name].on.end) {\n config[name].on.end.call(Y.one(node), data);\n }\n\n //node.fire('transition:propertyEnd', data);\n\n if (!allDone && anim._count <= 0) {\n allDone = true;\n anim._end(elapsed);\n anim._endTimer();\n }\n }\n }\n\n }\n }\n },\n\n _initAttrs: function() {\n var anim = this,\n customAttr = Transition.behaviors,\n uid = Y.stamp(anim._node),\n attrs = Transition._nodeAttrs[uid],\n attribute,\n duration,\n delay,\n easing,\n val,\n name,\n mTo,\n mFrom,\n unit, begin, end;\n\n for (name in attrs) {\n if ((attribute = attrs[name]) && attribute.transition === anim) {\n duration = attribute.duration * 1000;\n delay = attribute.delay * 1000;\n easing = attribute.easing;\n val = attribute.value;\n\n // only allow supported properties\n if (name in anim._node.style || name in Y.DOM.CUSTOM_STYLES) {\n begin = (name in customAttr && 'get' in customAttr[name]) ?\n customAttr[name].get(anim, name) : Transition.DEFAULT_GETTER(anim, name);\n\n mFrom = Transition.RE_UNITS.exec(begin);\n mTo = Transition.RE_UNITS.exec(val);\n\n begin = mFrom ? mFrom[1] : begin;\n end = mTo ? mTo[1] : val;\n unit = mTo ? mTo[2] : mFrom ? mFrom[2] : ''; // one might be zero TODO: mixed units\n\n if (!unit && Transition.RE_DEFAULT_UNIT.test(name)) {\n unit = Transition.DEFAULT_UNIT;\n }\n\n if (typeof easing === 'string') {\n if (easing.indexOf('cubic-bezier') > -1) {\n easing = easing.substring(13, easing.length - 1).split(',');\n } else if (Transition.easings[easing]) {\n easing = Transition.easings[easing];\n }\n }\n\n attribute.from = Number(begin);\n attribute.to = Number(end);\n attribute.unit = unit;\n attribute.easing = easing;\n attribute.duration = duration + delay;\n attribute.delay = delay;\n } else {\n delete attrs[name];\n anim._count--;\n }\n }\n }\n },\n\n destroy: function() {\n this.detachAll();\n this._node = null;\n }\n}, true);\n\nY.mix(Y.Transition, {\n _runtimeAttrs: {},\n /*\n * Regex of properties that should use the default unit.\n *\n * @property RE_DEFAULT_UNIT\n * @static\n */\n RE_DEFAULT_UNIT: /^width|height|top|right|bottom|left|margin.*|padding.*|border.*$/i,\n\n /*\n * The default unit to use with properties that pass the RE_DEFAULT_UNIT test.\n *\n * @property DEFAULT_UNIT\n * @static\n */\n DEFAULT_UNIT: 'px',\n\n /*\n * Time in milliseconds passed to setInterval for frame processing\n *\n * @property intervalTime\n * @default 20\n * @static\n */\n intervalTime: 20,\n\n /*\n * Bucket for custom getters and setters\n *\n * @property behaviors\n * @static\n */\n behaviors: {\n left: {\n get: function(anim, attr) {\n return Y.DOM._getAttrOffset(anim._node, attr);\n }\n }\n },\n\n /*\n * The default setter to use when setting object properties.\n *\n * @property DEFAULT_SETTER\n * @static\n */\n DEFAULT_SETTER: function(anim, att, from, to, elapsed, duration, fn, unit) {\n from = Number(from);\n to = Number(to);\n\n var node = anim._node,\n val = Transition.cubicBezier(fn, elapsed / duration);\n\n val = from + val[0] * (to - from);\n\n if (node) {\n if (att in node.style || att in Y.DOM.CUSTOM_STYLES) {\n unit = unit || '';\n Y.DOM.setStyle(node, att, val + unit);\n }\n } else {\n anim._end();\n }\n },\n\n /*\n * The default getter to use when getting object properties.\n *\n * @property DEFAULT_GETTER\n * @static\n */\n DEFAULT_GETTER: function(anim, att) {\n var node = anim._node,\n val = '';\n\n if (att in node.style || att in Y.DOM.CUSTOM_STYLES) {\n val = Y.DOM.getComputedStyle(node, att);\n }\n\n return val;\n },\n\n _startTimer: function() {\n if (!Transition._timer) {\n Transition._timer = setInterval(Transition._runFrame, Transition.intervalTime);\n }\n },\n\n _stopTimer: function() {\n clearInterval(Transition._timer);\n Transition._timer = null;\n },\n\n /*\n * Called per Interval to handle each animation frame.\n * @method _runFrame\n * @private\n * @static\n */\n _runFrame: function() {\n var done = true,\n anim;\n for (anim in Transition._running) {\n if (Transition._running[anim]._runFrame) {\n done = false;\n Transition._running[anim]._runFrame();\n }\n }\n\n if (done) {\n Transition._stopTimer();\n }\n },\n\n cubicBezier: function(p, t) {\n var x0 = 0,\n y0 = 0,\n x1 = p[0],\n y1 = p[1],\n x2 = p[2],\n y2 = p[3],\n x3 = 1,\n y3 = 0,\n\n A = x3 - 3 * x2 + 3 * x1 - x0,\n B = 3 * x2 - 6 * x1 + 3 * x0,\n C = 3 * x1 - 3 * x0,\n D = x0,\n E = y3 - 3 * y2 + 3 * y1 - y0,\n F = 3 * y2 - 6 * y1 + 3 * y0,\n G = 3 * y1 - 3 * y0,\n H = y0,\n\n x = (((A*t) + B)*t + C)*t + D,\n y = (((E*t) + F)*t + G)*t + H;\n\n return [x, y];\n },\n\n easings: {\n ease: [0.25, 0, 1, 0.25],\n linear: [0, 0, 1, 1],\n 'ease-in': [0.42, 0, 1, 1],\n 'ease-out': [0, 0, 0.58, 1],\n 'ease-in-out': [0.42, 0, 0.58, 1]\n },\n\n _running: {},\n _timer: null,\n\n RE_UNITS: /^(-?\\d*\\.?\\d*){1}(em|ex|px|in|cm|mm|pt|pc|%)*$/\n}, true);\n\nTransition.behaviors.top = Transition.behaviors.bottom = Transition.behaviors.right = Transition.behaviors.left;\n\nY.Transition = Transition;\n\n\n}, '@VERSION@', {\"requires\": [\"transition\"]});\nYUI.add('yui', function (Y, NAME) {\n\n// empty\n\n\n\n}, '@VERSION@', {\n \"use\": [\n \"yui\",\n \"oop\",\n \"dom\",\n \"event-custom-base\",\n \"event-base\",\n \"pluginhost\",\n \"node\",\n \"event-delegate\",\n \"io-base\",\n \"json-parse\",\n \"transition\",\n \"selector-css3\",\n \"dom-style-ie\",\n \"querystring-stringify-simple\"\n ]\n});\nvar Y = YUI().use('*');\n"}}},{"rowIdx":789380,"cells":{"path":{"kind":"string","value":"ajax/libs/core-js/0.2.2/core.js"},"repo_name":{"kind":"string","value":"xymostech/cdnjs"},"content":{"kind":"string","value":"/**\n * Core.js 0.2.2\n * https://github.com/zloirock/core-js\n * License: http://rock.mit-license.org\n * © 2014 Denis Pushkarev\n */\n!function(returnThis, framework, undefined){\n'use strict';\n\n/******************************************************************************\n * Module : common *\n ******************************************************************************/\n\nvar global = returnThis()\n // Shortcuts for [[Class]] & property names\n , OBJECT = 'Object'\n , FUNCTION = 'Function'\n , ARRAY = 'Array'\n , STRING = 'String'\n , NUMBER = 'Number'\n , REGEXP = 'RegExp'\n , DATE = 'Date'\n , MAP = 'Map'\n , SET = 'Set'\n , WEAKMAP = 'WeakMap'\n , WEAKSET = 'WeakSet'\n , SYMBOL = 'Symbol'\n , PROMISE = 'Promise'\n , MATH = 'Math'\n , ARGUMENTS = 'Arguments'\n , PROTOTYPE = 'prototype'\n , CONSTRUCTOR = 'constructor'\n , TO_STRING = 'toString'\n , TO_LOCALE = 'toLocaleString'\n , HAS_OWN = 'hasOwnProperty'\n , FOR_EACH = 'forEach'\n , PROCESS = 'process'\n , CREATE_ELEMENT = 'createElement'\n // Aliases global objects and prototypes\n , Function = global[FUNCTION]\n , Object = global[OBJECT]\n , Array = global[ARRAY]\n , String = global[STRING]\n , Number = global[NUMBER]\n , RegExp = global[REGEXP]\n , Date = global[DATE]\n , Map = global[MAP]\n , Set = global[SET]\n , WeakMap = global[WEAKMAP]\n , WeakSet = global[WEAKSET]\n , Symbol = global[SYMBOL]\n , Math = global[MATH]\n , TypeError = global.TypeError\n , RangeError = global.RangeError\n , setTimeout = global.setTimeout\n , clearTimeout = global.clearTimeout\n , setImmediate = global.setImmediate\n , clearImmediate = global.clearImmediate\n , process = global[PROCESS]\n , nextTick = process && process.nextTick\n , document = global.document\n , navigator = global.navigator\n , define = global.define\n , ArrayProto = Array[PROTOTYPE]\n , ObjectProto = Object[PROTOTYPE]\n , FunctionProto = Function[PROTOTYPE]\n , Infinity = 1 / 0\n , core = {}\n , path = framework ? global : core\n , DOT = '.';\n\n// http://jsperf.com/core-js-isobject\nfunction isObject(it){\n return it != null && (typeof it == 'object' || typeof it == 'function');\n}\nfunction isFunction(it){\n return typeof it == 'function';\n}\n// Native function?\nvar isNative = ctx(/./.test, /\\[native code\\]\\s*\\}\\s*$/, 1);\n\n// Object internal [[Class]] or toStringTag\n// http://people.mozilla.org/~jorendorff/es6-draft.html#sec-object.prototype.tostring\nvar toString = ObjectProto[TO_STRING];\nvar buildIn = {\n Undefined: 1, Null: 1, Array: 1, String: 1, Arguments: 1,\n Function: 1, Error: 1, Boolean: 1, Number: 1, Date: 1, RegExp: 1\n} , TO_STRING_TAG = TO_STRING + 'Tag';\nfunction setToStringTag(it, tag, stat){\n if(it)has(it = stat ? it : it[PROTOTYPE], SYMBOL_TAG) || hidden(it, SYMBOL_TAG, tag);\n}\nfunction cof(it){\n return it == undefined ? it === undefined\n ? 'Undefined' : 'Null' : toString.call(it).slice(8, -1);\n}\nfunction classof(it){\n var klass = cof(it), tag;\n return klass == OBJECT && (tag = it[SYMBOL_TAG]) ? has(buildIn, tag) ? '~' + tag : tag : klass;\n}\n\n// Function\nvar apply = FunctionProto.apply\n , call = FunctionProto.call\n , REFERENCE_GET;\n// Placeholder\ncore._ = path._ = framework ? path._ || {} : {};\n// Partial apply\nfunction part(/* ...args */){\n var length = arguments.length\n , args = Array(length)\n , i = 0\n , _ = path._\n , holder = false;\n while(length > i)if((args[i] = arguments[i++]) === _)holder = true;\n return partial(this, args, length, holder, _, false);\n}\n// Internal partial application & context binding\nfunction partial(fn, argsPart, lengthPart, holder, _, bind, context){\n assertFunction(fn);\n return function(/* ...args */){\n var that = bind ? context : this\n , length = arguments.length\n , i = 0, j = 0, args;\n if(!holder && !length)return invoke(fn, argsPart, that);\n args = argsPart.slice();\n if(holder)for(;lengthPart > i; i++)if(args[i] === _)args[i] = arguments[j++];\n while(length > j)args.push(arguments[j++]);\n return invoke(fn, args, that);\n }\n}\n// Optional / simple context binding\nfunction ctx(fn, that, length){\n assertFunction(fn);\n if(~length && that === undefined)return fn;\n switch(length){\n case 1: return function(a){\n return fn.call(that, a);\n }\n case 2: return function(a, b){\n return fn.call(that, a, b);\n }\n case 3: return function(a, b, c){\n return fn.call(that, a, b, c);\n }\n } return function(/* ...args */){\n return fn.apply(that, arguments);\n }\n}\n// Fast apply\n// http://jsperf.lnkit.com/fast-apply/5\nfunction invoke(fn, args, that){\n var un = that === undefined;\n switch(args.length | 0){\n case 0: return un ? fn()\n : fn.call(that);\n case 1: return un ? fn(args[0])\n : fn.call(that, args[0]);\n case 2: return un ? fn(args[0], args[1])\n : fn.call(that, args[0], args[1]);\n case 3: return un ? fn(args[0], args[1], args[2])\n : fn.call(that, args[0], args[1], args[2]);\n case 4: return un ? fn(args[0], args[1], args[2], args[3])\n : fn.call(that, args[0], args[1], args[2], args[3]);\n case 5: return un ? fn(args[0], args[1], args[2], args[3], args[4])\n : fn.call(that, args[0], args[1], args[2], args[3], args[4]);\n } return fn.apply(that, args);\n}\n\n// Object:\nvar create = Object.create\n , getPrototypeOf = Object.getPrototypeOf\n , defineProperty = Object.defineProperty\n , defineProperties = Object.defineProperties\n , getOwnDescriptor = Object.getOwnPropertyDescriptor\n , getKeys = Object.keys\n , getNames = Object.getOwnPropertyNames\n , getSymbols = Object.getOwnPropertySymbols\n , ownKeys = function(it){\n return getSymbols ? getNames(it).concat(getSymbols(it)) : getNames(it);\n }\n , has = ctx(call, ObjectProto[HAS_OWN], 2)\n // Dummy, fix for not array-like ES3 string in es5 module\n , ES5Object = Object;\n// 19.1.2.1 Object.assign(target, source, ...)\nvar assign = Object.assign || function(target, source){\n var T = Object(target)\n , l = arguments.length\n , i = 1;\n while(l > i){\n var S = ES5Object(arguments[i++])\n , keys = getKeys(S)\n , length = keys.length\n , j = 0\n , key;\n while(length > j)T[key = keys[j++]] = S[key];\n }\n return T;\n}\nfunction createObjectToArray(isEntries){\n return function(object){\n var O = ES5Object(object)\n , keys = getKeys(object)\n , length = keys.length\n , i = 0\n , result = Array(length)\n , key;\n if(isEntries)while(length > i)result[i] = [key = keys[i++], O[key]];\n else while(length > i)result[i] = O[keys[i++]];\n return result;\n }\n}\nfunction keyOf(object, el){\n var O = ES5Object(object)\n , keys = getKeys(O)\n , length = keys.length\n , index = 0\n , key;\n while(length > index)if(O[key = keys[index++]] === el)return key;\n}\n\n// Array\n// array('str1,str2,str3') => ['str1', 'str2', 'str3']\nfunction array(it){\n return String(it).split(',');\n}\nvar push = ArrayProto.push\n , unshift = ArrayProto.unshift\n , slice = ArrayProto.slice\n , splice = ArrayProto.splice\n , indexOf = ArrayProto.indexOf\n , forEach = ArrayProto[FOR_EACH];\n/*\n * 0 -> forEach\n * 1 -> map\n * 2 -> filter\n * 3 -> some\n * 4 -> every\n * 5 -> find\n * 6 -> findIndex\n */\nfunction createArrayMethod(type){\n var isMap = type == 1\n , isFilter = type == 2\n , isSome = type == 3\n , isEvery = type == 4\n , isFindIndex = type == 6\n , noholes = type == 5 || isFindIndex;\n return function(callbackfn, that /* = undefined */){\n var f = ctx(callbackfn, that, 3)\n , O = Object(this)\n , self = ES5Object(O)\n , length = toLength(self.length)\n , index = 0\n , result = isMap ? Array(length) : isFilter ? [] : undefined\n , val, res;\n for(;length > index; index++)if(noholes || index in self){\n val = self[index];\n res = f(val, index, O);\n if(type){\n if(isMap)result[index] = res; // map\n else if(res)switch(type){\n case 3: return true; // some\n case 5: return val; // find\n case 6: return index; // findIndex\n case 2: result.push(val); // filter\n } else if(isEvery)return false; // every\n }\n }\n return isFindIndex ? -1 : isSome || isEvery ? isEvery : result;\n }\n}\nfunction createArrayContains(isContains){\n return function(el, fromIndex /* = 0 */){\n var O = ES5Object(this)\n , length = toLength(O.length)\n , index = toIndex(fromIndex, length);\n if(isContains && el != el){\n for(;length > index; index++)if(sameNaN(O[index]))return isContains || index;\n } else for(;length > index; index++)if(isContains || index in O){\n if(O[index] === el)return isContains || index;\n } return !isContains && -1;\n }\n}\n// Simple reduce to object\nfunction turn(mapfn, target /* = [] */){\n assertFunction(mapfn);\n var memo = target == undefined ? [] : Object(target)\n , O = ES5Object(this)\n , length = toLength(O.length)\n , index = 0;\n for(;length > index; index++){\n if(mapfn(memo, O[index], index, this) === false)break;\n }\n return memo;\n}\nfunction generic(A, B){\n // strange IE quirks mode bug -> use typeof vs isFunction\n return typeof A == 'function' ? A : B;\n}\n\n// Math\nvar MAX_SAFE_INTEGER = 0x1fffffffffffff // pow(2, 53) - 1 == 9007199254740991\n , ceil = Math.ceil\n , floor = Math.floor\n , max = Math.max\n , min = Math.min\n , pow = Math.pow\n , random = Math.random\n , trunc = Math.trunc || function(it){\n return (it > 0 ? floor : ceil)(it);\n }\n// 7.2.3 SameValue(x, y)\nfunction same(x, y){\n return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y;\n}\n// 20.1.2.4 Number.isNaN(number)\nfunction sameNaN(number){\n return number != number;\n}\n// 7.1.4 ToInteger\nfunction toInteger(it){\n return isNaN(it) ? 0 : trunc(it);\n}\n// 7.1.15 ToLength\nfunction toLength(it){\n return it > 0 ? min(toInteger(it), MAX_SAFE_INTEGER) : 0;\n}\nfunction toIndex(index, length){\n var index = toInteger(index);\n return index < 0 ? max(index + length, 0) : min(index, length);\n}\n\nfunction createReplacer(regExp, replace, isStatic){\n var replacer = isObject(replace) ? function(part){\n return replace[part];\n } : replace;\n return function(it){\n return String(isStatic ? it : this).replace(regExp, replacer);\n }\n}\nfunction createPointAt(toString){\n return function(pos){\n var s = String(this)\n , i = toInteger(pos)\n , l = s.length\n , a, b;\n if(i < 0 || i >= l)return toString ? '' : undefined;\n a = s.charCodeAt(i);\n return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\n ? toString ? s.charAt(i) : a\n : toString ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\n }\n}\n\n// Assertion & errors\nvar REDUCE_ERROR = 'Reduce of empty object with no initial value';\nfunction assert(condition, msg1, msg2){\n if(!condition)throw TypeError(msg2 ? msg1 + msg2 : msg1);\n}\nfunction assertFunction(it){\n assert(isFunction(it), it, ' is not a function!');\n return it;\n}\nfunction assertObject(it){\n assert(isObject(it), it, ' is not an object!');\n return it;\n}\nfunction assertInstance(it, Constructor, name){\n assert(it instanceof Constructor, name, \": use the 'new' operator!\");\n}\n\n// Property descriptors & Symbol\nfunction descriptor(bitmap, value){\n return {\n enumerable : !(bitmap & 1),\n configurable: !(bitmap & 2),\n writable : !(bitmap & 4),\n value : value\n }\n}\nfunction simpleSet(object, key, value){\n object[key] = value;\n return object;\n}\nfunction createDefiner(bitmap){\n return DESC ? function(object, key, value){\n return defineProperty(object, key, descriptor(bitmap, value));\n } : simpleSet;\n}\nfunction uid(key){\n return SYMBOL + '(' + key + ')_' + (++sid + random())[TO_STRING](36);\n}\n// The engine works fine with descriptors? Thank's IE8 for his funny defineProperty.\nvar DESC = !!function(){try{return defineProperty({}, 0, ObjectProto)}catch(e){}}()\n , sid = 0\n , hidden = createDefiner(1)\n , symbol = Symbol || uid\n , set = Symbol ? simpleSet : hidden;\n\n// Iterators\nvar ITERATOR = 'iterator'\n , SYMBOL_ITERATOR = Symbol && ITERATOR in Symbol\n ? Symbol[ITERATOR] : uid(SYMBOL + DOT + ITERATOR)\n , SYMBOL_TAG = Symbol && TO_STRING_TAG in Symbol\n ? Symbol[TO_STRING_TAG] : uid(SYMBOL + DOT + TO_STRING_TAG)\n , FF_ITERATOR = '@@' + ITERATOR\n , SUPPORT_FF_ITER = FF_ITERATOR in ArrayProto\n , ITER = symbol('iter')\n , SHIM = symbol('shim')\n , KEY = 1\n , VALUE = 2\n , Iterators = {}\n , IteratorPrototype = {}\n , COLLECTION_KEYS;\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nsetIterator(IteratorPrototype, returnThis);\nfunction setIterator(O, value){\n hidden(O, SYMBOL_ITERATOR, value);\n // Add iterator for FF iterator protocol\n SUPPORT_FF_ITER && hidden(O, FF_ITERATOR, value);\n}\nfunction createIterator(Constructor, NAME, next, proto){\n Constructor[PROTOTYPE] = create(proto || IteratorPrototype, {next: descriptor(1, next)});\n setToStringTag(Constructor, NAME + ' Iterator');\n}\nfunction defineIterator(Constructor, NAME, value){\n var proto = Constructor[PROTOTYPE]\n , HAS_FF_ITER = has(proto, FF_ITERATOR);\n var iter = has(proto, SYMBOL_ITERATOR)\n ? proto[SYMBOL_ITERATOR]\n : HAS_FF_ITER\n ? proto[FF_ITERATOR]\n : value;\n if(framework){\n // Define iterator\n setIterator(proto, iter);\n if(iter !== value){\n var iterProto = getPrototypeOf(iter.call(new Constructor));\n // Set @@toStringTag to native iterators\n setToStringTag(iterProto, NAME + ' Iterator', true);\n // FF fix\n HAS_FF_ITER && setIterator(iterProto, returnThis);\n }\n }\n // Plug for library\n Iterators[NAME] = iter;\n // FF & v8 fix\n Iterators[NAME + ' Iterator'] = returnThis;\n}\nfunction iterResult(done, value){\n return {value: value, done: !!done};\n}\nfunction isIterable(it){\n var O = Object(it);\n return SYMBOL_ITERATOR in O || has(Iterators, classof(O));\n}\nfunction getIterator(it){\n return assertObject((it[SYMBOL_ITERATOR] || Iterators[classof(it)]).call(it));\n}\nfunction stepCall(fn, value, entries){\n return entries ? invoke(fn, value) : fn(value);\n}\nfunction forOf(iterable, entries, fn, that){\n var iterator = getIterator(iterable)\n , f = ctx(fn, that, entries ? 2 : 1)\n , step;\n while(!(step = iterator.next()).done)if(stepCall(f, step.value, entries) === false)return;\n}\n\n// DOM\nvar html = document && document.documentElement;\n\n// core\nvar NODE = cof(process) == PROCESS\n , old = global.core\n // type bitmap\n , FORCED = 1\n , GLOBAL = 2\n , STATIC = 4\n , PROTO = 8\n , BIND = 16\n , WRAP = 32;\nfunction $define(type, name, source){\n var key, own, out, exp\n , isGlobal = type & GLOBAL\n , target = isGlobal ? global : (type & STATIC)\n ? global[name] : (global[name] || ObjectProto)[PROTOTYPE]\n , exports = isGlobal ? core : core[name] || (core[name] = {});\n if(isGlobal)source = name;\n for(key in source){\n // there is a similar native\n own = !(type & FORCED) && target && key in target\n && (!isFunction(target[key]) || isNative(target[key]));\n // export native or passed\n out = (own ? target : source)[key];\n // bind timers to global for call from export context\n if(type & BIND && own)exp = ctx(out, global);\n // wrap global constructors for prevent change them in library\n else if(type & WRAP && !framework && target[key] == out){\n exp = function(param){\n return this instanceof out ? new out(param) : out(param);\n }\n exp[PROTOTYPE] = out[PROTOTYPE];\n } else exp = type & PROTO && isFunction(out) ? ctx(call, out) : out;\n // export\n if(exports[key] != out)exports[key] = exp;\n // extend global\n framework && target && !own && (isGlobal || delete target[key]) && hidden(target, key, out);\n }\n}\n// CommonJS export\nif(NODE)module.exports = core;\n// RequireJS export\nif(isFunction(define) && define.amd)define(function(){return core});\n// Export to global object\nif(!NODE || framework){\n core.noConflict = function(){\n global.core = old;\n return core;\n }\n global.core = core;\n}\n\n/******************************************************************************\n * Module : es5 *\n ******************************************************************************/\n\n// ECMAScript 5 shim\n!function(IS_ENUMERABLE, Empty, _classof, $PROTO){ \n if(!DESC){\n getOwnDescriptor = function(O, P){\n if(has(O, P))return descriptor(!ObjectProto[IS_ENUMERABLE].call(O, P), O[P]);\n };\n defineProperty = function(O, P, Attributes){\n if('value' in Attributes)assertObject(O)[P] = Attributes.value;\n return O;\n };\n defineProperties = function(O, Properties){\n assertObject(O);\n var keys = getKeys(Properties)\n , length = keys.length\n , i = 0\n , P, Attributes;\n while(length > i){\n P = keys[i++];\n Attributes = Properties[P];\n if('value' in Attributes)O[P] = Attributes.value;\n }\n return O;\n };\n }\n $define(STATIC + FORCED * !DESC, OBJECT, {\n // 19.1.2.6 / 15.2.3.3 Object.getOwnPropertyDescriptor(O, P)\n getOwnPropertyDescriptor: getOwnDescriptor,\n // 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\n defineProperty: defineProperty,\n // 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties) \n defineProperties: defineProperties\n });\n \n // IE 8- don't enum bug keys\n var keys1 = [CONSTRUCTOR, HAS_OWN, 'isPrototypeOf', IS_ENUMERABLE, TO_LOCALE, TO_STRING, 'valueOf']\n // Additional keys for getOwnPropertyNames\n , keys2 = keys1.concat('length', PROTOTYPE)\n , keysLen1 = keys1.length;\n \n // Create object with `null` prototype: use iframe Object with cleared prototype\n function createDict(){\n // Thrash, waste and sodomy: IE GC bug\n var iframe = document[CREATE_ELEMENT]('iframe')\n , i = keysLen1\n , iframeDocument;\n iframe.style.display = 'none';\n html.appendChild(iframe);\n iframe.src = 'javascript:';\n // createDict = iframe.contentWindow.Object;\n // html.removeChild(iframe);\n iframeDocument = iframe.contentWindow.document;\n iframeDocument.open();\n iframeDocument.write('<script>document.F=Object</script>');\n iframeDocument.close();\n createDict = iframeDocument.F;\n while(i--)delete createDict[PROTOTYPE][keys1[i]];\n return createDict();\n }\n function createGetKeys(names, length, isNames){\n return function(object){\n var O = ES5Object(object)\n , i = 0\n , result = []\n , key;\n for(key in O)if(key != $PROTO)has(O, key) && result.push(key);\n // Don't enum bug & hidden keys\n while(length > i)if(has(O, key = names[i++])){\n ~indexOf.call(result, key) || result.push(key);\n }\n return result;\n }\n }\n $define(STATIC, OBJECT, {\n // 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\n getPrototypeOf: getPrototypeOf = getPrototypeOf || function(O){\n if(has(assertObject(O), $PROTO))return O[$PROTO];\n if(isFunction(O[CONSTRUCTOR]) && O instanceof O[CONSTRUCTOR]){\n return O[CONSTRUCTOR][PROTOTYPE];\n } return O instanceof Object ? ObjectProto : null;\n },\n // 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\n getOwnPropertyNames: getNames = getNames || createGetKeys(keys2, keys2.length, true),\n // 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\n create: create = create || function(O, /*?*/Properties){\n var result\n if(O !== null){\n Empty[PROTOTYPE] = assertObject(O);\n result = new Empty();\n Empty[PROTOTYPE] = null;\n // add \"__proto__\" for Object.getPrototypeOf shim\n result[CONSTRUCTOR][PROTOTYPE] === O || (result[$PROTO] = O);\n } else result = createDict();\n return Properties === undefined ? result : defineProperties(result, Properties);\n },\n // 19.1.2.14 / 15.2.3.14 Object.keys(O)\n keys: getKeys = getKeys || createGetKeys(keys1, keysLen1, false)\n });\n \n // 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...)\n $define(PROTO, FUNCTION, {\n bind: function(that /*, args... */){\n var fn = assertFunction(this)\n , partArgs = slice.call(arguments, 1);\n function bound(/* args... */){\n var args = partArgs.concat(slice.call(arguments));\n if(this instanceof bound){\n var instance = create(fn[PROTOTYPE])\n , result = invoke(fn, args, instance);\n return isObject(result) ? result : instance;\n } return invoke(fn, args, that);\n }\n return bound;\n }\n });\n \n // Fix for not array-like ES3 string\n function arrayMethodFix(fn){\n return function(){\n return fn.apply(ES5Object(this), arguments);\n }\n }\n if(!(0 in Object(DOT) && DOT[0] == DOT)){\n ES5Object = function(it){\n return cof(it) == STRING ? it.split('') : Object(it);\n }\n slice = arrayMethodFix(slice);\n }\n $define(PROTO + FORCED * (ES5Object != Object), ARRAY, {\n slice: slice,\n join: arrayMethodFix(ArrayProto.join)\n });\n \n // 22.1.2.2 / 15.4.3.2 Array.isArray(arg)\n $define(STATIC, ARRAY, {\n isArray: function(arg){\n return cof(arg) == ARRAY\n }\n });\n function createArrayReduce(isRight){\n return function(callbackfn, memo){\n assertFunction(callbackfn);\n var O = ES5Object(this)\n , length = toLength(O.length)\n , index = isRight ? length - 1 : 0\n , i = isRight ? -1 : 1;\n if(2 > arguments.length)for(;;){\n if(index in O){\n memo = O[index];\n index += i;\n break;\n }\n index += i;\n assert(isRight ? index >= 0 : length > index, REDUCE_ERROR);\n }\n for(;isRight ? index >= 0 : length > index; index += i)if(index in O){\n memo = callbackfn(memo, O[index], index, this);\n }\n return memo;\n }\n }\n $define(PROTO, ARRAY, {\n // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg])\n forEach: forEach = forEach || createArrayMethod(0),\n // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg])\n map: createArrayMethod(1),\n // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg])\n filter: createArrayMethod(2),\n // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg])\n some: createArrayMethod(3),\n // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg])\n every: createArrayMethod(4),\n // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue])\n reduce: createArrayReduce(false),\n // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue])\n reduceRight: createArrayReduce(true),\n // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex])\n indexOf: indexOf = indexOf || createArrayContains(false),\n // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex])\n lastIndexOf: function(el, fromIndex /* = @[*-1] */){\n var O = ES5Object(this)\n , length = toLength(O.length)\n , index = length - 1;\n if(arguments.length > 1)index = min(index, toInteger(fromIndex));\n if(index < 0)index = toLength(length + index);\n for(;index >= 0; index--)if(index in O)if(O[index] === el)return index;\n return -1;\n }\n });\n \n // 21.1.3.25 / 15.5.4.20 String.prototype.trim()\n $define(PROTO, STRING, {trim: createReplacer(/^\\s*([\\s\\S]*\\S)?\\s*$/, '$1')});\n \n // 20.3.3.1 / 15.9.4.4 Date.now()\n $define(STATIC, DATE, {now: function(){\n return +new Date;\n }});\n \n if(_classof(function(){return arguments}()) == OBJECT)classof = function(it){\n var cof = _classof(it);\n return cof == OBJECT && isFunction(it.callee) ? ARGUMENTS : cof;\n }\n}('propertyIsEnumerable', Function(), classof, symbol(PROTOTYPE));\n\n/******************************************************************************\n * Module : global *\n ******************************************************************************/\n\n$define(GLOBAL + FORCED, {global: global});\n\n/******************************************************************************\n * Module : es6_symbol *\n ******************************************************************************/\n\n// ECMAScript 6 symbols shim\n!function(TAG, SymbolRegistry){\n // 19.4.1.1 Symbol([description])\n if(!isNative(Symbol)){\n Symbol = function(description){\n assert(!(this instanceof Symbol), SYMBOL + ' is not a ' + CONSTRUCTOR);\n var tag = uid(description);\n defineProperty(ObjectProto, tag, {\n configurable: true,\n set: function(value){\n hidden(this, tag, value);\n }\n });\n return set(create(Symbol[PROTOTYPE]), TAG, tag);\n }\n hidden(Symbol[PROTOTYPE], TO_STRING, function(){\n return this[TAG];\n });\n }\n $define(GLOBAL + WRAP, {Symbol: Symbol});\n $define(STATIC, SYMBOL, {\n // 19.4.2.2 Symbol.for(key)\n 'for': function(key){\n return has(SymbolRegistry, key += '')\n ? SymbolRegistry[key]\n : SymbolRegistry[key] = Symbol(key);\n },\n // 19.4.2.6 Symbol.iterator\n iterator: SYMBOL_ITERATOR,\n // 19.4.2.7 Symbol.keyFor(sym)\n keyFor: part.call(keyOf, SymbolRegistry),\n // 19.4.2.10 Symbol.toStringTag\n toStringTag: SYMBOL_TAG = TO_STRING_TAG in Symbol\n ? Symbol[TO_STRING_TAG]\n : Symbol(SYMBOL + DOT + TO_STRING_TAG),\n pure: symbol,\n set: set\n });\n setToStringTag(Symbol, SYMBOL);\n // 26.1.11 Reflect.ownKeys (target)\n $define(GLOBAL, {Reflect: {ownKeys: ownKeys}});\n}(symbol('tag'), {});\n\n/******************************************************************************\n * Module : es6 *\n ******************************************************************************/\n\n// ECMAScript 6 shim\n!function(isFinite, tmp){\n $define(STATIC, OBJECT, {\n // 19.1.3.1 Object.assign(target, source)\n assign: assign,\n // 19.1.3.10 Object.is(value1, value2)\n is: same\n });\n // 19.1.3.19 Object.setPrototypeOf(O, proto)\n // Works with __proto__ only. Old v8 can't works with null proto objects.\n '__proto__' in ObjectProto && function(buggy, set){\n try {\n set = ctx(call, getOwnDescriptor(ObjectProto, '__proto__').set, 2);\n set({}, ArrayProto);\n } catch(e){ buggy = true }\n $define(STATIC, OBJECT, {\n setPrototypeOf: function(O, proto){\n assertObject(O);\n assert(proto === null || isObject(proto), proto, \": can't set as prototype!\");\n if(buggy)O.__proto__ = proto;\n else set(O, proto);\n return O;\n }\n });\n }();\n \n // 20.1.2.3 Number.isInteger(number)\n var isInteger = Number.isInteger || function(it){\n return isFinite(it) && floor(it) === it;\n }\n // 20.2.2.28 Math.sign(x)\n , sign = Math.sign || function sign(it){\n return (it = +it) == 0 || it != it ? it : it < 0 ? -1 : 1;\n }\n , abs = Math.abs\n , exp = Math.exp\n , log = Math.log\n , sqrt = Math.sqrt\n , fcc = String.fromCharCode;\n // 20.2.2.5 Math.asinh(x)\n function asinh(x){\n return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : log(x + sqrt(x * x + 1));\n }\n \n $define(STATIC, NUMBER, {\n // 20.1.2.1 Number.EPSILON\n EPSILON: pow(2, -52),\n // 20.1.2.2 Number.isFinite(number)\n isFinite: function(it){\n return typeof it == 'number' && isFinite(it);\n },\n // 20.1.2.3 Number.isInteger(number)\n isInteger: isInteger,\n // 20.1.2.4 Number.isNaN(number)\n isNaN: sameNaN,\n // 20.1.2.5 Number.isSafeInteger(number)\n isSafeInteger: function(number){\n return isInteger(number) && abs(number) <= MAX_SAFE_INTEGER;\n },\n // 20.1.2.6 Number.MAX_SAFE_INTEGER\n MAX_SAFE_INTEGER: MAX_SAFE_INTEGER,\n // 20.1.2.10 Number.MIN_SAFE_INTEGER\n MIN_SAFE_INTEGER: -MAX_SAFE_INTEGER,\n // 20.1.2.12 Number.parseFloat(string)\n parseFloat: parseFloat,\n // 20.1.2.13 Number.parseInt(string, radix)\n parseInt: parseInt\n });\n \n $define(STATIC, MATH, {\n // 20.2.2.3 Math.acosh(x)\n acosh: function(x){\n return log(x + sqrt(x * x - 1));\n },\n // 20.2.2.5 Math.asinh(x)\n asinh: asinh,\n // 20.2.2.7 Math.atanh(x)\n atanh: function(x){\n return x == 0 ? +x : log((1 + +x) / (1 - x)) / 2;\n },\n // 20.2.2.9 Math.cbrt(x)\n cbrt: function(x){\n return sign(x) * pow(abs(x), 1 / 3);\n },\n // 20.2.2.11 Math.clz32 (x)\n clz32: function(x){\n return (x >>>= 0) ? 32 - x[TO_STRING](2).length : 32;\n },\n // 20.2.2.12 Math.cosh(x)\n cosh: function(x){\n return (exp(x) + exp(-x)) / 2;\n },\n // 20.2.2.14 Math.expm1(x)\n expm1: function(x){\n return x == 0 ? +x : x > -1e-6 && x < 1e-6 ? +x + x * x / 2 : exp(x) - 1;\n },\n // 20.2.2.16 Math.fround(x)\n // TODO\n // 20.2.2.17 Math.hypot([value1[, value2[, … ]]])\n hypot: function(value1, value2){\n var sum = 0\n , length = arguments.length\n , value;\n while(length--){\n value = +arguments[length];\n if(value == Infinity || value == -Infinity)return Infinity;\n sum += value * value;\n }\n return sqrt(sum);\n },\n // 20.2.2.18 Math.imul(x, y)\n imul: function(x, y){\n var UInt16 = 0xffff\n , xl = UInt16 & x\n , yl = UInt16 & y;\n return 0 | xl * yl + ((UInt16 & x >>> 16) * yl + xl * (UInt16 & y >>> 16) << 16 >>> 0);\n },\n // 20.2.2.20 Math.log1p(x)\n log1p: function(x){\n return x > -1e-8 && x < 1e-8 ? x - x * x / 2 : log(1 + +x);\n },\n // 20.2.2.21 Math.log10(x)\n log10: function(x){\n return log(x) / Math.LN10;\n },\n // 20.2.2.22 Math.log2(x)\n log2: function(x){\n return log(x) / Math.LN2;\n },\n // 20.2.2.28 Math.sign(x)\n sign: sign,\n // 20.2.2.30 Math.sinh(x)\n sinh: function(x){\n return x == 0 ? +x : (exp(x) - exp(-x)) / 2;\n },\n // 20.2.2.33 Math.tanh(x)\n tanh: function(x){\n return isFinite(x) ? x == 0 ? +x : (exp(x) - exp(-x)) / (exp(x) + exp(-x)) : sign(x);\n },\n // 20.2.2.34 Math.trunc(x)\n trunc: trunc\n });\n // 20.2.1.9 Math[@@toStringTag]\n setToStringTag(Math, MATH, true);\n \n $define(STATIC, STRING, {\n // 21.1.2.2 String.fromCodePoint(...codePoints)\n fromCodePoint: function(){\n var res = []\n , len = arguments.length\n , i = 0\n , code\n while(len > i){\n code = +arguments[i++];\n if(toIndex(code, 0x10ffff) !== code)throw RangeError(code + ' is not a valid code point');\n res.push(code < 0x10000\n ? fcc(code)\n : fcc(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00)\n );\n } return res.join('');\n },\n // 21.1.2.4 String.raw(callSite, ...substitutions)\n raw: function(callSite){\n var raw = ES5Object(callSite.raw)\n , len = toLength(raw.length)\n , sln = arguments.length\n , res = []\n , i = 0;\n while(len > i){\n res.push(String(raw[i++]));\n if(i < sln)res.push(String(arguments[i]));\n } return res.join('');\n }\n });\n $define(PROTO, STRING, {\n // 21.1.3.3 String.prototype.codePointAt(pos)\n codePointAt: createPointAt(false),\n // 21.1.3.6 String.prototype.endsWith(searchString [, endPosition])\n endsWith: function(searchString, endPosition /* = @length */){\n var len = this.length\n , end = endPosition === undefined ? len : min(toLength(endPosition), len);\n searchString += '';\n return String(this).slice(end - searchString.length, end) === searchString;\n },\n // 21.1.3.7 String.prototype.includes(searchString, position = 0)\n includes: function(searchString, position /* = 0 */){\n return !!~String(this).indexOf(searchString, position);\n },\n // 21.1.3.13 String.prototype.repeat(count)\n repeat: function(count){\n var str = String(this)\n , res = ''\n , n = toInteger(count);\n if(0 > n)throw RangeError(\"Count can't be negative\");\n for(;n > 0; (n >>>= 1) && (str += str))if(n & 1)res += str;\n return res;\n },\n // 21.1.3.18 String.prototype.startsWith(searchString [, position ])\n startsWith: function(searchString, position /* = 0 */){\n var index = toLength(min(position, this.length));\n searchString += '';\n return String(this).slice(index, index + searchString.length) === searchString;\n }\n });\n \n $define(STATIC, ARRAY, {\n // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\n from: function(arrayLike, mapfn /* -> it */, that /* = undefind */){\n var O = Object(arrayLike)\n , result = new (generic(this, Array))\n , mapping = mapfn !== undefined\n , f = mapping ? ctx(mapfn, that, 2) : undefined\n , index = 0\n , length;\n if(isIterable(O))for(var iter = getIterator(O), step; !(step = iter.next()).done; index++){\n result[index] = mapping ? f(step.value, index) : step.value;\n } else for(length = toLength(O.length); length > index; index++){\n result[index] = mapping ? f(O[index], index) : O[index];\n }\n result.length = index;\n return result;\n },\n // 22.1.2.3 Array.of( ...items)\n of: function(/* ...args */){\n var index = 0\n , length = arguments.length\n , result = new (generic(this, Array))(length);\n while(length > index)result[index] = arguments[index++];\n result.length = length;\n return result;\n }\n });\n $define(PROTO, ARRAY, {\n // 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\n copyWithin: function(target /* = 0 */, start /* = 0 */, end /* = @length */){\n var O = Object(this)\n , len = toLength(O.length)\n , to = toIndex(target, len)\n , from = toIndex(start, len)\n , fin = end === undefined ? len : toIndex(end, len)\n , count = min(fin - from, len - to), inc = 1;\n if(from < to && to < from + count){\n inc = -1;\n from = from + count - 1;\n to = to + count - 1;\n }\n while(count-- > 0){\n if(from in O)O[to] = O[from];\n else delete O[to];\n to += inc;\n from += inc;\n } return O;\n },\n // 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\n fill: function(value, start /* = 0 */, end /* = @length */){\n var O = Object(this)\n , length = toLength(O.length)\n , index = toIndex(start, length)\n , endPos = end === undefined ? length : toIndex(end, length);\n while(endPos > index)O[index++] = value;\n return O;\n },\n // 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined)\n find: createArrayMethod(5),\n // 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined)\n findIndex: createArrayMethod(6)\n });\n \n // 24.3.3 JSON[@@toStringTag]\n setToStringTag(global.JSON, 'JSON', true);\n \n if(framework){\n // 19.1.3.6 Object.prototype.toString()\n tmp[SYMBOL_TAG] = DOT;\n if(cof(tmp) != DOT)hidden(ObjectProto, TO_STRING, function(){\n return '[object ' + classof(this) + ']';\n });\n \n // 21.2.5.3 get RegExp.prototype.flags()\n if(/./g.flags != 'g')defineProperty(RegExp[PROTOTYPE], 'flags', {\n configurable: true,\n get: createReplacer(/^.*\\/(\\w*)$/, '$1')\n });\n }\n}(isFinite, {});\n\n/******************************************************************************\n * Module : immediate *\n ******************************************************************************/\n\n// setImmediate shim\n// Node.js 0.9+ & IE10+ has setImmediate, else:\nisFunction(setImmediate) && isFunction(clearImmediate) || function(ONREADYSTATECHANGE){\n var postMessage = global.postMessage\n , addEventListener = global.addEventListener\n , MessageChannel = global.MessageChannel\n , counter = 0\n , queue = {}\n , defer, channel, port;\n setImmediate = function(fn){\n var args = [], i = 1;\n while(arguments.length > i)args.push(arguments[i++]);\n queue[++counter] = function(){\n invoke(isFunction(fn) ? fn : Function(fn), args);\n }\n defer(counter);\n return counter;\n }\n clearImmediate = function(id){\n delete queue[id];\n }\n function run(id){\n if(has(queue, id)){\n var fn = queue[id];\n delete queue[id];\n fn();\n }\n }\n function listner(event){\n run(event.data);\n }\n // Node.js 0.8-\n if(NODE){\n defer = function(id){\n nextTick(part.call(run, id));\n }\n // Modern browsers, skip implementation for WebWorkers\n // IE8 has postMessage, but it's sync & typeof its postMessage is object\n } else if(addEventListener && isFunction(postMessage) && !global.importScripts){\n defer = function(id){\n postMessage(id, '*');\n }\n addEventListener('message', listner, false);\n // WebWorkers\n } else if(isFunction(MessageChannel)){\n channel = new MessageChannel;\n port = channel.port2;\n channel.port1.onmessage = listner;\n defer = ctx(port.postMessage, port, 1);\n // IE8-\n } else if(document && ONREADYSTATECHANGE in document[CREATE_ELEMENT]('script')){\n defer = function(id){\n html.appendChild(document[CREATE_ELEMENT]('script'))[ONREADYSTATECHANGE] = function(){\n html.removeChild(this);\n run(id);\n }\n }\n // Rest old browsers\n } else {\n defer = function(id){\n setTimeout(part.call(run, id), 0);\n }\n }\n}('onreadystatechange');\n$define(GLOBAL + BIND, {\n setImmediate: setImmediate,\n clearImmediate: clearImmediate\n});\n\n/******************************************************************************\n * Module : es6_promise *\n ******************************************************************************/\n\n// ES6 promises shim\n// Based on https://github.com/getify/native-promise-only/\n!function(Promise, test){\n isFunction(Promise) && isFunction(Promise.resolve)\n && Promise.resolve(test = new Promise(Function())) == test\n || function(asap, DEF){\n function isThenable(o){\n var then;\n if(isObject(o))then = o.then;\n return isFunction(then) ? then : false;\n }\n function notify(def){\n var chain = def.chain;\n chain.length && asap(function(){\n var msg = def.msg\n , ok = def.state == 1\n , i = 0;\n while(chain.length > i)!function(react){\n var cb = ok ? react.ok : react.fail\n , ret, then;\n try {\n if(cb){\n ret = cb === true ? msg : cb(msg);\n if(ret === react.P){\n react.rej(TypeError(PROMISE + '-chain cycle'));\n } else if(then = isThenable(ret)){\n then.call(ret, react.res, react.rej);\n } else react.res(ret);\n } else react.rej(msg);\n } catch(err){\n react.rej(err);\n }\n }(chain[i++]);\n chain.length = 0;\n });\n }\n function resolve(msg){\n var def = this\n , then, wrapper;\n if(def.done)return;\n def.done = true;\n def = def.def || def; // unwrap\n try {\n if(then = isThenable(msg)){\n wrapper = {def: def, done: false}; // wrap\n then.call(msg, ctx(resolve, wrapper, 1), ctx(reject, wrapper, 1));\n } else {\n def.msg = msg;\n def.state = 1;\n notify(def);\n }\n } catch(err){\n reject.call(wrapper || {def: def, done: false}, err); // wrap\n }\n }\n function reject(msg){\n var def = this;\n if(def.done)return;\n def.done = true;\n def = def.def || def; // unwrap\n def.msg = msg;\n def.state = 2;\n notify(def);\n }\n // 25.4.3.1 Promise(executor)\n Promise = function(executor){\n assertFunction(executor);\n assertInstance(this, Promise, PROMISE);\n var def = {chain: [], state: 0, done: false, msg: undefined};\n hidden(this, DEF, def);\n try {\n executor(ctx(resolve, def, 1), ctx(reject, def, 1));\n } catch(err){\n reject.call(def, err);\n }\n }\n // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)\n hidden(Promise[PROTOTYPE], 'then', function(onFulfilled, onRejected){\n var react = {\n ok: isFunction(onFulfilled) ? onFulfilled : true,\n fail: isFunction(onRejected) ? onRejected : false\n } , P = react.P = new this[CONSTRUCTOR](function(resolve, reject){\n react.res = assertFunction(resolve);\n react.rej = assertFunction(reject);\n }), def = this[DEF];\n def.chain.push(react);\n def.state && notify(def);\n return P;\n });\n // 25.4.5.1 Promise.prototype.catch(onRejected)\n hidden(Promise[PROTOTYPE], 'catch', function(onRejected){\n return this.then(undefined, onRejected);\n });\n // 25.4.4.1 Promise.all(iterable)\n hidden(Promise, 'all', function(iterable){\n var Promise = this\n , values = [];\n return new Promise(function(resolve, reject){\n forOf(iterable, false, push, values);\n var remaining = values.length\n , results = Array(remaining);\n if(remaining)forEach.call(values, function(promise, index){\n Promise.resolve(promise).then(function(value){\n results[index] = value;\n --remaining || resolve(results);\n }, reject);\n });\n else resolve(results);\n });\n });\n // 25.4.4.4 Promise.race(iterable)\n hidden(Promise, 'race', function(iterable){\n var Promise = this;\n return new Promise(function(resolve, reject){\n forOf(iterable, false, function(promise){\n Promise.resolve(promise).then(resolve, reject);\n });\n });\n });\n // 25.4.4.5 Promise.reject(r)\n hidden(Promise, 'reject', function(r){\n return new this(function(resolve, reject){\n reject(r);\n });\n });\n // 25.4.4.6 Promise.resolve(x)\n hidden(Promise, 'resolve', function(x){\n return isObject(x) && getPrototypeOf(x) === this[PROTOTYPE]\n ? x : new this(function(resolve, reject){\n resolve(x);\n });\n });\n }(nextTick || setImmediate, symbol('def'));\n setToStringTag(Promise, PROMISE);\n $define(GLOBAL + FORCED * !isNative(Promise), {Promise: Promise});\n}(global[PROMISE]);\n\n/******************************************************************************\n * Module : es6_collections *\n ******************************************************************************/\n\n// ECMAScript 6 collections shim\n!function(){\n var KEYS = COLLECTION_KEYS = symbol('keys')\n , VALUES = symbol('values')\n , STOREID = symbol('storeId')\n , WEAKDATA = symbol('weakData')\n , WEAKID = symbol('weakId')\n , SIZE = DESC ? symbol('size') : 'size'\n , uid = 0\n , wid = 0;\n \n function getCollection(C, NAME, methods, commonMethods, isMap, isWeak){\n var ADDER_KEY = isMap ? 'set' : 'add'\n , init = commonMethods.clear\n , O = {};\n function initFromIterable(that, iterable){\n if(iterable != undefined)forOf(iterable, isMap, that[ADDER_KEY], that);\n return that;\n }\n if(!(isNative(C) && (isWeak || has(C[PROTOTYPE], FOR_EACH)))){\n // create collection constructor\n C = function(iterable){\n assertInstance(this, C, NAME);\n isWeak ? hidden(this, WEAKID, wid++) : init.call(this);\n initFromIterable(this, iterable);\n }\n set(C, SHIM, true);\n assign(C[PROTOTYPE], methods, commonMethods);\n isWeak || defineProperty(C[PROTOTYPE], 'size', {get: function(){\n return this[SIZE];\n }});\n } else {\n var Native = C\n , collection = new C\n , adder = collection[ADDER_KEY]\n , buggyChaining, buggyZero;\n // wrap to init collections from iterable\n if(!(SYMBOL_ITERATOR in ArrayProto && C.length)){\n C = function(iterable){\n assertInstance(this, C, NAME);\n return initFromIterable(new Native, iterable);\n }\n C[PROTOTYPE] = Native[PROTOTYPE];\n }\n buggyChaining = collection[ADDER_KEY](isWeak ? {} : -0, 1) !== collection;\n isWeak || collection[FOR_EACH](function(val, key){\n if(same(key, -0))buggyZero = true;\n });\n // fix .add & .set for chaining & converting -0 key to +0\n if(framework && (buggyChaining || buggyZero)){\n hidden(C[PROTOTYPE], ADDER_KEY, function(a, b){\n adder.call(this, same(a, -0) ? 0 : a, b);\n return this;\n });\n }\n }\n setToStringTag(C, NAME);\n O[NAME] = C;\n $define(GLOBAL + WRAP + FORCED * !isNative(C), O);\n return C;\n }\n \n function fastKey(it, create){\n // return it with 'S' prefix if it's string or with 'P' prefix for over primitives\n if(!isObject(it))return (typeof it == 'string' ? 'S' : 'P') + it;\n // if it hasn't object id - add next\n if(!has(it, STOREID)){\n if(create)hidden(it, STOREID, ++uid);\n else return '';\n }\n // return object id with 'O' prefix\n return 'O' + it[STOREID];\n }\n\n function collectionMethods($VALUES){\n return {\n // 23.1.3.1 Map.prototype.clear()\n // 23.2.3.2 Set.prototype.clear()\n clear: function(){\n hidden(this, SIZE, 0);\n hidden(this, KEYS, create(null));\n if($VALUES == VALUES)hidden(this, VALUES, create(null));\n },\n // 23.1.3.3 Map.prototype.delete(key)\n // 23.2.3.4 Set.prototype.delete(value)\n 'delete': function(key){\n var index = fastKey(key)\n , keys = this[KEYS]\n , contains = index in keys;\n if(contains){\n delete keys[index];\n if($VALUES == VALUES)delete this[VALUES][index];\n this[SIZE]--;\n }\n return contains;\n },\n // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)\n // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)\n forEach: function(callbackfn, that /* = undefined */){\n var f = ctx(callbackfn, that, 3)\n , values = this[$VALUES]\n , keys = this[KEYS]\n , done = {}\n , k, index;\n do {\n for(index in keys){\n if(index in done)continue;\n done[index] = true;\n f(values[index], keys[index], this);\n }\n } while(index != undefined && index != (k = getKeys(keys))[k.length - 1]);\n },\n // 23.1.3.7 Map.prototype.has(key)\n // 23.2.3.7 Set.prototype.has(value)\n has: function(key){\n return fastKey(key) in this[KEYS];\n }\n }\n }\n \n // 23.1 Map Objects\n Map = getCollection(Map, MAP, {\n // 23.1.3.6 Map.prototype.get(key)\n get: function(key){\n return this[VALUES][fastKey(key)];\n },\n // 23.1.3.9 Map.prototype.set(key, value)\n set: function(key, value){\n var index = fastKey(key, true)\n , values = this[VALUES];\n if(!(index in values)){\n this[KEYS][index] = same(key, -0) ? 0 : key;\n this[SIZE]++;\n }\n values[index] = value;\n return this;\n }\n }, collectionMethods(VALUES), true);\n \n // 23.2 Set Objects\n Set = getCollection(Set, SET, {\n // 23.2.3.1 Set.prototype.add(value)\n add: function(value){\n var index = fastKey(value, true)\n , values = this[KEYS];\n if(!(index in values)){\n values[index] = same(value, -0) ? 0 : value;\n this[SIZE]++;\n }\n return this;\n }\n }, collectionMethods(KEYS));\n \n function getWeakData(it){\n has(it, WEAKDATA) || hidden(it, WEAKDATA, {});\n return it[WEAKDATA];\n }\n function weakCollectionHas(key){\n return isObject(key) && has(key, WEAKDATA) && has(key[WEAKDATA], this[WEAKID]);\n }\n var weakCollectionMethods = {\n // 23.3.3.2 WeakMap.prototype.delete(key)\n // 23.4.3.3 WeakSet.prototype.delete(value)\n 'delete': function(key){\n return weakCollectionHas.call(this, key) && delete key[WEAKDATA][this[WEAKID]];\n },\n // 23.3.3.4 WeakMap.prototype.has(key)\n // 23.4.3.4 WeakSet.prototype.has(value)\n has: weakCollectionHas\n };\n \n // 23.3 WeakMap Objects\n WeakMap = getCollection(WeakMap, WEAKMAP, {\n // 23.3.3.3 WeakMap.prototype.get(key)\n get: function(key){\n if(isObject(key) && has(key, WEAKDATA))return key[WEAKDATA][this[WEAKID]];\n },\n // 23.3.3.5 WeakMap.prototype.set(key, value)\n set: function(key, value){\n getWeakData(assertObject(key))[this[WEAKID]] = value;\n return this;\n }\n }, weakCollectionMethods, true, true);\n \n // 23.4 WeakSet Objects\n WeakSet = getCollection(WeakSet, WEAKSET, {\n // 23.4.3.1 WeakSet.prototype.add(value)\n add: function(value){\n getWeakData(assertObject(value))[this[WEAKID]] = true;\n return this;\n }\n }, weakCollectionMethods, false, true);\n}();\n\n/******************************************************************************\n * Module : es7 *\n ******************************************************************************/\n\n!function(){\n $define(PROTO, ARRAY, {\n // https://github.com/domenic/Array.prototype.includes\n includes: createArrayContains(true)\n });\n $define(PROTO, STRING, {\n // https://github.com/mathiasbynens/String.prototype.at\n at: createPointAt(true)\n });\n $define(STATIC, OBJECT, {\n // https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-04/apr-9.md#51-objectentries-objectvalues\n values: createObjectToArray(false),\n entries: createObjectToArray(true)\n });\n $define(STATIC, REGEXP, {\n // https://gist.github.com/kangax/9698100\n escape: createReplacer(/([\\\\\\-[\\]{}()*+?.,^$|])/g, '\\\\$1', true)\n });\n}();\n\n/******************************************************************************\n * Module : es7_refs *\n ******************************************************************************/\n\n// https://github.com/zenparsing/es-abstract-refs\n!function(REFERENCE){\n REFERENCE_GET = Symbol(SYMBOL+DOT+REFERENCE+'Get');\n var REFERENCE_SET = Symbol(SYMBOL+DOT+REFERENCE+SET)\n , REFERENCE_DELETE = Symbol(SYMBOL+DOT+REFERENCE+'Delete');\n \n $define(STATIC, SYMBOL, {\n referenceGet: REFERENCE_GET,\n referenceSet: REFERENCE_SET,\n referenceDelete: REFERENCE_DELETE\n });\n \n hidden(FunctionProto, REFERENCE_GET, returnThis);\n \n function setMapMethods(Constructor){\n if(Constructor){\n var MapProto = Constructor[PROTOTYPE];\n hidden(MapProto, REFERENCE_GET, MapProto.get);\n hidden(MapProto, REFERENCE_SET, MapProto.set);\n hidden(MapProto, REFERENCE_DELETE, MapProto['delete']);\n }\n }\n setMapMethods(Map);\n setMapMethods(WeakMap);\n}('reference');\n\n/******************************************************************************\n * Module : dict *\n ******************************************************************************/\n\n!function(DICT){\n function Dict(iterable){\n var dict = create(null);\n if(iterable != undefined){\n if(isIterable(iterable)){\n for(var iter = getIterator(iterable), step, value; !(step = iter.next()).done;){\n value = step.value;\n dict[value[0]] = value[1];\n }\n } else assign(dict, iterable);\n }\n return dict;\n }\n Dict[PROTOTYPE] = null;\n \n function DictIterator(iterated, kind){\n set(this, ITER, {o: ES5Object(iterated), a: getKeys(iterated), i: 0, k: kind});\n }\n createIterator(DictIterator, DICT, function(){\n var iter = this[ITER]\n , index = iter.i++\n , keys = iter.a\n , kind = iter.k\n , key, value;\n if(index >= keys.length)return iterResult(1);\n key = keys[index];\n if(kind == KEY) value = key;\n else if(kind == VALUE)value = iter.o[key];\n else value = [key, iter.o[key]];\n return iterResult(0, value);\n });\n function createDictIter(kind){\n return function(it){\n return new DictIterator(it, kind);\n }\n }\n \n /*\n * 0 -> forEach\n * 1 -> map\n * 2 -> filter\n * 3 -> some\n * 4 -> every\n * 5 -> find\n * 6 -> findKey\n * 7 -> mapPairs\n */\n function createDictMethod(type){\n var isMap = type == 1\n , isEvery = type == 4;\n return function(object, callbackfn, that /* = undefined */){\n var f = ctx(callbackfn, that, 3)\n , O = ES5Object(object)\n , keys = getKeys(O)\n , length = keys.length\n , i = 0\n , result = isMap || type == 7 || type == 2 ? new (generic(this, Dict)) : undefined\n , key, val, res;\n while(length > i){\n key = keys[i++];\n val = O[key];\n res = f(val, key, object);\n if(type){\n if(isMap)result[key] = res; // map\n else if(res)switch(type){\n case 2: result[key] = val; break // filter\n case 3: return true; // some\n case 5: return val; // find\n case 6: return key; // findKey\n case 7: result[res[0]] = res[1]; // mapPairs\n } else if(isEvery)return false; // every\n }\n }\n return type == 3 || isEvery ? isEvery : result;\n }\n }\n function createDictReduce(isTurn){\n return function(object, mapfn, init){\n assertFunction(mapfn);\n var O = ES5Object(object)\n , keys = getKeys(O)\n , length = keys.length\n , i = 0\n , memo, key, result;\n if(isTurn)memo = init == undefined ? new (generic(this, Dict)) : Object(init);\n else if(arguments.length < 3){\n assert(length, REDUCE_ERROR);\n memo = O[keys[i++]];\n } else memo = Object(init);\n while(length > i){\n result = mapfn(memo, O[key = keys[i++]], key, object);\n if(isTurn){\n if(result === false)break;\n } else memo = result;\n }\n return memo;\n }\n }\n var findKey = createDictMethod(6);\n function includes(object, el){\n return (el == el ? keyOf(object, el) : findKey(object, sameNaN)) !== undefined;\n }\n \n var dictMethods = {\n keys: createDictIter(KEY),\n values: createDictIter(VALUE),\n entries: createDictIter(KEY+VALUE),\n forEach: createDictMethod(0),\n map: createDictMethod(1),\n filter: createDictMethod(2),\n some: createDictMethod(3),\n every: createDictMethod(4),\n find: createDictMethod(5),\n findKey: findKey,\n mapPairs:createDictMethod(7),\n reduce: createDictReduce(false),\n turn: createDictReduce(true),\n keyOf: keyOf,\n includes:includes,\n // Has / get / set own property\n has: has,\n get: function(object, key){\n if(has(object, key))return object[key];\n },\n set: createDefiner(0),\n isDict: function(it){\n return isObject(it) && getPrototypeOf(it) === Dict[PROTOTYPE];\n }\n };\n \n if(REFERENCE_GET)for(var key in dictMethods)!function(fn){\n function method(){\n for(var args = [this], i = 0; i < arguments.length;)args.push(arguments[i++]);\n return invoke(fn, args);\n }\n fn[REFERENCE_GET] = function(){\n return method;\n }\n }(dictMethods[key]);\n \n $define(GLOBAL + FORCED, {Dict: assign(Dict, dictMethods)});\n}('Dict');\n\n/******************************************************************************\n * Module : $for *\n ******************************************************************************/\n\n!function(ENTRIES, FN){ \n function $for(iterable, entries){\n if(!(this instanceof $for))return new $for(iterable, entries);\n this[ITER] = getIterator(iterable);\n this[ENTRIES] = !!entries;\n }\n \n createIterator($for, 'Wrapper', function(){\n return this[ITER].next();\n });\n var $forProto = $for[PROTOTYPE];\n setIterator($forProto, function(){\n return this[ITER]; // unwrap\n });\n \n function createChainIterator(next){\n function Iter(I, fn, that){\n this[ITER] = getIterator(I);\n this[ENTRIES] = I[ENTRIES];\n this[FN] = ctx(fn, that, I[ENTRIES] ? 2 : 1);\n }\n createIterator(Iter, 'Chain', next, $forProto);\n setIterator(Iter[PROTOTYPE], returnThis); // override $forProto iterator\n return Iter;\n }\n \n var MapIter = createChainIterator(function(){\n var step = this[ITER].next();\n return step.done ? step : iterResult(0, stepCall(this[FN], step.value, this[ENTRIES]));\n });\n \n var FilterIter = createChainIterator(function(){\n for(;;){\n var step = this[ITER].next();\n if(step.done || stepCall(this[FN], step.value, this[ENTRIES]))return step;\n }\n });\n \n assign($forProto, {\n of: function(fn, that){\n forOf(this, this[ENTRIES], fn, that);\n },\n array: function(fn, that){\n var result = [];\n forOf(fn != undefined ? this.map(fn, that) : this, false, push, result);\n return result;\n },\n filter: function(fn, that){\n return new FilterIter(this, fn, that);\n },\n map: function(fn, that){\n return new MapIter(this, fn, that);\n }\n });\n \n $for.isIterable = isIterable;\n $for.getIterator = getIterator;\n \n $define(GLOBAL + FORCED, {$for: $for});\n}('entries', symbol('fn'));\n\n/******************************************************************************\n * Module : es6_iterators *\n ******************************************************************************/\n\n// ECMAScript 6 iterators shim\n!function(){\n var getValues = createObjectToArray(false)\n // Safari define byggy iterators w/o `next`\n , buggy = 'keys' in ArrayProto && !('next' in [].keys())\n , at = createPointAt(true);\n \n function defineStdIterators(Base, NAME, Constructor, next, DEFAULT){\n function createIter(kind){\n return function(){\n return new Constructor(this, kind);\n }\n }\n // 21.1.5.2.2 %StringIteratorPrototype%[@@toStringTag]\n // 22.1.5.2.3 %ArrayIteratorPrototype%[@@toStringTag]\n // 23.1.5.2.3 %MapIteratorPrototype%[@@toStringTag]\n // 23.2.5.2.3 %SetIteratorPrototype%[@@toStringTag]\n createIterator(Constructor, NAME, next);\n DEFAULT && $define(PROTO + FORCED * buggy, NAME, {\n // 22.1.3.4 Array.prototype.entries()\n // 23.1.3.4 Map.prototype.entries()\n // 23.2.3.5 Set.prototype.entries()\n entries: createIter(KEY+VALUE),\n // 22.1.3.13 Array.prototype.keys()\n // 23.1.3.8 Map.prototype.keys()\n // 23.2.3.8 Set.prototype.keys()\n keys: createIter(KEY),\n // 22.1.3.29 Array.prototype.values()\n // 23.1.3.11 Map.prototype.values()\n // 23.2.3.10 Set.prototype.values()\n values: createIter(VALUE)\n });\n // 21.1.3.27 String.prototype[@@iterator]()\n // 22.1.3.30 Array.prototype[@@iterator]()\n // 23.1.3.12 Map.prototype[@@iterator]()\n // 23.2.3.11 Set.prototype[@@iterator]()\n Base && defineIterator(Base, NAME, createIter(DEFAULT));\n }\n \n // 21.1.5.1 CreateStringIterator Abstract Operation\n defineStdIterators(String, STRING, function(iterated){\n set(this, ITER, {o: String(iterated), i: 0});\n // 21.1.5.2.1 %StringIteratorPrototype%.next()\n }, function(){\n var iter = this[ITER]\n , iterated = iter.o\n , index = iter.i\n , point;\n if(index >= iterated.length)return iterResult(1);\n point = at.call(iterated, index);\n iter.i += point.length;\n return iterResult(0, point);\n });\n \n // 22.1.5.1 CreateArrayIterator Abstract Operation\n defineStdIterators(Array, ARRAY, function(iterated, kind){\n set(this, ITER, {o: ES5Object(iterated), i: 0, k: kind});\n // 22.1.5.2.1 %ArrayIteratorPrototype%.next()\n }, function(){\n var iter = this[ITER]\n , iterated = iter.o\n , index = iter.i++\n , kind = iter.k\n , value;\n if(index >= iterated.length)return iterResult(1);\n if(kind == KEY) value = index;\n else if(kind == VALUE)value = iterated[index];\n else value = [index, iterated[index]];\n return iterResult(0, value);\n }, VALUE);\n \n // argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\n Iterators[ARGUMENTS] = Iterators[ARRAY];\n \n // 23.1.5.1 CreateMapIterator Abstract Operation\n defineStdIterators(Map, MAP, function(iterated, kind){\n var keys;\n if(Map[SHIM])keys = getValues(iterated[COLLECTION_KEYS]);\n else Map[PROTOTYPE][FOR_EACH].call(iterated, function(val, key){\n this.push(key);\n }, keys = []);\n set(this, ITER, {o: iterated, k: kind, a: keys, i: 0});\n // 23.1.5.2.1 %MapIteratorPrototype%.next()\n }, function(){\n var iter = this[ITER]\n , iterated = iter.o\n , keys = iter.a\n , index = iter.i++\n , kind = iter.k\n , key, value;\n if(index >= keys.length)return iterResult(1);\n key = keys[index];\n if(kind == KEY) value = key;\n else if(kind == VALUE)value = iterated.get(key);\n else value = [key, iterated.get(key)];\n return iterResult(0, value);\n }, KEY+VALUE);\n \n // 23.2.5.1 CreateSetIterator Abstract Operation\n defineStdIterators(Set, SET, function(iterated, kind){\n var keys;\n if(Set[SHIM])keys = getValues(iterated[COLLECTION_KEYS]);\n else Set[PROTOTYPE][FOR_EACH].call(iterated, function(val){\n this.push(val);\n }, keys = []);\n set(this, ITER, {k: kind, a: keys.reverse(), l: keys.length});\n // 23.2.5.2.1 %SetIteratorPrototype%.next()\n }, function(){\n var iter = this[ITER]\n , keys = iter.a\n , key;\n if(!keys.length)return iterResult(1);\n key = keys.pop();\n return iterResult(0, iter.k == KEY+VALUE ? [key, key] : key);\n }, VALUE);\n}();\n\n/******************************************************************************\n * Module : timers *\n ******************************************************************************/\n\n// ie9- setTimeout & setInterval additional parameters fix\n!function(MSIE){\n function wrap(set){\n return MSIE ? function(fn, time /*, ...args */){\n return set(invoke(part, slice.call(arguments, 2), isFunction(fn) ? fn : Function(fn)), time);\n } : set;\n }\n $define(GLOBAL + BIND + FORCED * MSIE, {\n setTimeout: setTimeout = wrap(setTimeout),\n setInterval: wrap(setInterval)\n });\n // ie9- dirty check\n}(!!navigator && /MSIE .\\./.test(navigator.userAgent));\n\n/******************************************************************************\n * Module : binding *\n ******************************************************************************/\n\n!function(_, toLocaleString){\n $define(PROTO + FORCED, FUNCTION, {\n part: part,\n by: function(that){\n var fn = this\n , _ = path._\n , holder = false\n , length = arguments.length\n , isThat = that === _\n , i = +!isThat\n , indent = i\n , it, args;\n if(isThat){\n it = fn;\n fn = call;\n } else it = that;\n if(length < 2)return ctx(fn, it, -1);\n args = Array(length - indent);\n while(length > i)if((args[i - indent] = arguments[i++]) === _)holder = true;\n return partial(fn, args, length, holder, _, true, it);\n },\n only: function(numberArguments, that /* = @ */){\n var fn = assertFunction(this)\n , n = toLength(numberArguments)\n , isThat = arguments.length > 1;\n return function(/* ...args */){\n var length = min(n, arguments.length)\n , args = Array(length)\n , i = 0;\n while(length > i)args[i] = arguments[i++];\n return invoke(fn, args, isThat ? that : this);\n }\n }\n });\n \n function tie(key){\n var that = this\n , bound = {};\n return hidden(that, _, function(key){\n if(key === undefined || !(key in that))return toLocaleString.call(that);\n return has(bound, key) ? bound[key] : (bound[key] = ctx(that[key], that, -1));\n })[_](key);\n }\n \n hidden(path._, TO_STRING, function(){\n return _;\n });\n \n hidden(ObjectProto, _, tie);\n DESC || hidden(ArrayProto, _, tie);\n // IE8- dirty hack - redefined toLocaleString is not enumerable\n}(DESC ? uid('tie') : TO_LOCALE, ObjectProto[TO_LOCALE]);\n\n/******************************************************************************\n * Module : object *\n ******************************************************************************/\n\n!function(){\n function define(target, mixin){\n var keys = ownKeys(ES5Object(mixin))\n , length = keys.length\n , i = 0, key;\n while(length > i)defineProperty(target, key = keys[i++], getOwnDescriptor(mixin, key));\n return target;\n };\n $define(STATIC + FORCED, OBJECT, {\n isObject: isObject,\n classof: classof,\n define: define,\n make: function(proto, mixin){\n return define(create(proto), mixin);\n }\n });\n}();\n\n/******************************************************************************\n * Module : array *\n ******************************************************************************/\n\n$define(PROTO + FORCED, ARRAY, {\n turn: turn\n});\n\n/******************************************************************************\n * Module : array_statics *\n ******************************************************************************/\n\n// JavaScript 1.6 / Strawman array statics shim\n!function(){\n function setArrayStatics(keys, length){\n $define(STATIC, ARRAY, turn.call(\n array(keys),\n function(memo, key){\n if(key in ArrayProto)memo[key] = ctx(call, ArrayProto[key], length);\n }, {}\n ));\n }\n setArrayStatics('pop,reverse,shift,keys,values,entries', 1);\n setArrayStatics('indexOf,every,some,forEach,map,filter,find,findIndex,includes', 3);\n setArrayStatics('join,slice,concat,push,splice,unshift,sort,lastIndexOf,' +\n 'reduce,reduceRight,copyWithin,fill,turn');\n}();\n\n/******************************************************************************\n * Module : number *\n ******************************************************************************/\n\n!function(){ \n function NumberIterator(iterated){\n set(this, ITER, {l: toLength(iterated), i: 0});\n }\n createIterator(NumberIterator, NUMBER, function(){\n var iter = this[ITER]\n , i = iter.i++;\n return i < iter.l ? iterResult(0, i) : iterResult(1);\n });\n defineIterator(Number, NUMBER, function(){\n return new NumberIterator(this);\n });\n \n $define(PROTO + FORCED, NUMBER, {\n random: function(lim /* = 0 */){\n var a = +this\n , b = lim == undefined ? 0 : +lim\n , m = min(a, b);\n return random() * (max(a, b) - m) + m;\n }\n });\n\n $define(PROTO + FORCED, NUMBER, turn.call(\n array(\n // ES3:\n 'round,floor,ceil,abs,sin,asin,cos,acos,tan,atan,exp,sqrt,max,min,pow,atan2,' +\n // ES6:\n 'acosh,asinh,atanh,cbrt,clz32,cosh,expm1,hypot,imul,log1p,log10,log2,sign,sinh,tanh,trunc'\n ),\n function(memo, key){\n var fn = Math[key];\n if(fn)memo[key] = function(/* ...args */){\n // ie9- dont support strict mode & convert `this` to object -> convert it to number\n var args = [+this]\n , i = 0;\n while(arguments.length > i)args.push(arguments[i++]);\n return invoke(fn, args);\n }\n }, {}\n ));\n}();\n\n/******************************************************************************\n * Module : string *\n ******************************************************************************/\n\n!function(){\n var escapeHTMLDict = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n }, unescapeHTMLDict = {}, key;\n for(key in escapeHTMLDict)unescapeHTMLDict[escapeHTMLDict[key]] = key;\n $define(PROTO + FORCED, STRING, {\n escapeHTML: createReplacer(/[&<>\"']/g, escapeHTMLDict),\n unescapeHTML: createReplacer(/&(?:amp|lt|gt|quot|apos);/g, unescapeHTMLDict)\n });\n}();\n\n/******************************************************************************\n * Module : date *\n ******************************************************************************/\n\n!function(formatRegExp, flexioRegExp, locales, current, SECONDS, MINUTES, HOURS, MONTH, YEAR){\n function createFormat(prefix){\n return function(template, locale /* = current */){\n var that = this\n , dict = locales[has(locales, locale) ? locale : current];\n function get(unit){\n return that[prefix + unit]();\n }\n return String(template).replace(formatRegExp, function(part){\n switch(part){\n case 's' : return get(SECONDS); // Seconds : 0-59\n case 'ss' : return lz(get(SECONDS)); // Seconds : 00-59\n case 'm' : return get(MINUTES); // Minutes : 0-59\n case 'mm' : return lz(get(MINUTES)); // Minutes : 00-59\n case 'h' : return get(HOURS); // Hours : 0-23\n case 'hh' : return lz(get(HOURS)); // Hours : 00-23\n case 'D' : return get(DATE); // Date : 1-31\n case 'DD' : return lz(get(DATE)); // Date : 01-31\n case 'W' : return dict[0][get('Day')]; // Day : Понедельник\n case 'N' : return get(MONTH) + 1; // Month : 1-12\n case 'NN' : return lz(get(MONTH) + 1); // Month : 01-12\n case 'M' : return dict[2][get(MONTH)]; // Month : Январь\n case 'MM' : return dict[1][get(MONTH)]; // Month : Января\n case 'Y' : return get(YEAR); // Year : 2014\n case 'YY' : return lz(get(YEAR) % 100); // Year : 14\n } return part;\n });\n }\n }\n function lz(num){\n return num > 9 ? num : '0' + num;\n }\n function addLocale(lang, locale){\n function split(index){\n return turn.call(array(locale.months), function(memo, it){\n memo.push(it.replace(flexioRegExp, '$' + index));\n });\n }\n locales[lang] = [array(locale.weekdays), split(1), split(2)];\n return core;\n }\n $define(PROTO + FORCED, DATE, {\n format: createFormat('get'),\n formatUTC: createFormat('getUTC')\n });\n addLocale(current, {\n weekdays: 'Sunday,Monday,Tuesday,Wednesday,Thursday,Friday,Saturday',\n months: 'January,February,March,April,May,June,July,August,September,October,November,December'\n });\n addLocale('ru', {\n weekdays: 'Воскресенье,Понедельник,Вторник,Среда,Четверг,Пятница,Суббота',\n months: 'Январ:я|ь,Феврал:я|ь,Март:а|,Апрел:я|ь,Ма:я|й,Июн:я|ь,' +\n 'Июл:я|ь,Август:а|,Сентябр:я|ь,Октябр:я|ь,Ноябр:я|ь,Декабр:я|ь'\n });\n core.locale = function(locale){\n return has(locales, locale) ? current = locale : current;\n };\n core.addLocale = addLocale;\n}(/\\b\\w\\w?\\b/g, /:(.*)\\|(.*)$/, {}, 'en', 'Seconds', 'Minutes', 'Hours', 'Month', 'FullYear');\n\n/******************************************************************************\n * Module : console *\n ******************************************************************************/\n\n!function(console){\n var $console = turn.call(\n /**\n * Methods from:\n * https://github.com/DeveloperToolsWG/console-object/blob/master/api.md\n * https://developer.mozilla.org/en-US/docs/Web/API/console\n */\n array('assert,clear,count,debug,dir,dirxml,error,exception,group,groupCollapsed,' +\n 'groupEnd,info,isIndependentlyComposed,log,markTimeline,profile,profileEnd,' +\n 'table,time,timeEnd,timeline,timelineEnd,timeStamp,trace,warn'),\n function(memo, key){\n var fn = console[key];\n memo[key] = function(){\n if(enabled && fn)return apply.call(fn, console, arguments);\n };\n },\n {\n enable: function(){\n enabled = true;\n },\n disable: function(){\n enabled = false;\n }\n }\n ), enabled = true;\n try {\n framework && delete global.console;\n } catch(e){}\n $define(GLOBAL + FORCED, {console: assign($console.log, $console)});\n}(global.console || {});\n}(Function('return this'), true);"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":7893,"numItemsPerPage":100,"numTotalItems":789381,"offset":789300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NjE4MTA1MCwic3ViIjoiL2RhdGFzZXRzL2hjaGF1dHJhbi9qYXZhc2NyaXB0IiwiZXhwIjoxNzc2MTg0NjUwLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.UrRxffOMo7kzIJLkXndcT21QL--7xCuqIj-eWdrShXowTuRDQz867px64_1XaP57gAC7CrO_DDj3VbWgG_E0Bg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":789381,"numBytesParquet":14981574335},{"config":"default","split":"test","numRows":119649,"numBytesParquet":7193302278}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
path stringlengths 5 296 | repo_name stringlengths 5 85 | content stringlengths 25 1.05M |
|---|---|---|
lib/yuilib/3.17.2/event-focus/event-focus.js | johnny14028/moodle28 | /*
YUI 3.17.2 (build 9c3c78e)
Copyright 2014 Yahoo! Inc. All rights reserved.
Licensed under the BSD License.
http://yuilibrary.com/license/
*/
YUI.add('event-focus', function (Y, NAME) {
/**
* Adds bubbling and delegation support to DOM events focus and blur.
*
* @module event
* @submodule event-focus
*/
var Ev... |
node_modules/material-ui/svg-icons/communication/comment.js | yaolei/Samoyed | 'use strict';
Object.defineProperty(exports, "__esModule", {
value: true
});
var _react = require('react');
var _react2 = _interopRequireDefault(_react);
var _pure = require('recompose/pure');
var _pure2 = _interopRequireDefault(_pure);
var _SvgIcon = require('../../SvgIcon');
var _SvgIcon2 = _interopRequireDe... |
ajax/libs/ember-data.js/1.0.0-beta.16.1/ember-data.prod.js | blairvanderhoof/cdnjs | (function() {
"use strict";
var ember$data$lib$system$adapter$$get = Ember.get;
var ember$data$lib$system$adapter$$errorProps = [
'description',
'fileName',
'lineNumber',
'message',
'name',
'number',
'stack'
];
/**
A `DS.InvalidError` is used by an ... |
estudoSites/templates/dragonfruit/js/jquery.min.js | andrevst/helloworldfrontend | /*! jQuery v1.7.1 jquery.com | jquery.org/license */
(function(a,b){function cy(a){return f.isWindow(a)?a:a.nodeType===9?a.defaultView||a.parentWindow:!1}function cv(a){if(!ck[a]){var b=c.body,d=f("<"+a+">").appendTo(b),e=d.css("display");d.remove();if(e==="none"||e===""){cl||(cl=c.createElement("iframe"),cl.frameBorde... |
src/svg-icons/image/photo-library.js | pomerantsev/material-ui | import React from 'react';
import pure from 'recompose/pure';
import SvgIcon from '../../SvgIcon';
let ImagePhotoLibrary = (props) => (
<SvgIcon {...props}>
<path d="M22 16V4c0-1.1-.9-2-2-2H8c-1.1 0-2 .9-2 2v12c0 1.1.9 2 2 2h12c1.1 0 2-.9 2-2zm-11-4l2.03 2.71L16 11l4 5H8l3-4zM2 6v14c0 1.1.9 2 2 2h14v-2H4V6H2z"/>... |
ajax/libs/react-router/0.11.1/react-router.min.js | kennynaoh/cdnjs | !function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.ReactRouter=e()}}(function(){var define;return functi... |
node_modules/rx/dist/rx.lite.js | logity/git-playground | // Copyright (c) Microsoft, All rights reserved. See License.txt in the project root for license information.
;(function (undefined) {
var objectTypes = {
'function': true,
'object': true
};
function checkGlobal(value) {
return (value && value.Object === Object) ? value : null;
}
var freeExpor... |
ajax/libs/zeroclipboard/2.2.0/ZeroClipboard.js | andyinabox/cdnjs | /*!
* ZeroClipboard
* The ZeroClipboard library provides an easy way to copy text to the clipboard using an invisible Adobe Flash movie and a JavaScript interface.
* Copyright (c) 2009-2014 Jon Rohan, James M. Greene
* Licensed MIT
* http://zeroclipboard.org/
* v2.2.0
*/
(function(window, undefined) {
"use str... |
vendor/raulfraile/ladybug-themes/Ladybug/Theme/Modern/Resources/lib/jquery/jquery.js | vhurtado89/myproject | /*!
* jQuery JavaScript Library v1.8.3
* http://jquery.com/
*
* Includes Sizzle.js
* http://sizzlejs.com/
*
* Copyright 2012 jQuery Foundation and other contributors
* Released under the MIT license
* http://jquery.org/license
*
* Date: Tue Nov 13 2012 08:20:33 GMT-0500 (Eastern Standard Time)
*... |
SinglePageAppAndWebApi/SinglePageAppAndWebApi/Scripts/jquery-1.10.2.min.js | lucavgobbi/typescript-react-visualstudio | /* NUGET: BEGIN LICENSE TEXT
*
* Microsoft grants you the right to use these script files for the sole
* purpose of either: (i) interacting through your browser with the Microsoft
* website or online service, subject to the applicable licensing or use
* terms; or (ii) using the files as included with a Microsoft p... |
ajax/libs/yui/3.4.1pr1/event-focus/event-focus-debug.js | honestree/cdnjs | YUI.add('event-focus', function(Y) {
/**
* Adds bubbling and delegation support to DOM events focus and blur.
*
* @module event
* @submodule event-focus
*/
var Event = Y.Event,
YLang = Y.Lang,
isString = YLang.isString,
useActivate = YLang.isFunction(
Y.DOM.create('<p onbeforeactivate="... |
react-js/src/components/Feedback/Feedback.js | josedab/javascript-examples | /*! React Starter Kit | MIT License | http://www.reactstarterkit.com/ */
import React, { Component } from 'react';
import styles from './Feedback.css';
import withStyles from '../../decorators/withStyles';
@withStyles(styles)
class Feedback extends Component {
render() {
return (
<div className="Feedback... |
ajax/libs/material-ui/5.0.0-alpha.35/node/internal/svg-icons/NavigateBefore.js | cdnjs/cdnjs | "use strict";
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
var _interopRequireWildcard = require("@babel/runtime/helpers/interopRequireWildcard");
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.default = void 0;
var React = _interopRequireWildcard(r... |
ajax/libs/yui/3.10.1/scrollview-base/scrollview-base.js | RubaXa/cdnjs | YUI.add('scrollview-base', function (Y, NAME) {
/**
* The scrollview-base module provides a basic ScrollView Widget, without scrollbar indicators
*
* @module scrollview
* @submodule scrollview-base
*/
// Local vars
var getClassName = Y.ClassNameManager.getClassName,
DOCUMENT = Y.config.doc,
IE = Y.UA.ie... |
BaconFeedbackScreen.js | bakin-bacon/app | import React from 'react';
import { StyleSheet, Dimensions, StatusBar, Text, ScrollView, View, Image, Button, TouchableOpacity, Alert } from 'react-native';
import * as Colors from './Colors';
import { BakinBaconApi } from './api/BakinBaconApi';
export class BaconFeedbackScreen extends React.Component {
static navig... |
ajax/libs/forerunnerdb/1.3.615/fdb-core+persist.js | kiwi89/cdnjs | (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.ex... |
WebGridSpeedTest/Scripts/jquery-1.8.2.min.js | jamesk/MVCWebGridSpeedTest | /* NUGET: BEGIN LICENSE TEXT
*
* Microsoft grants you the right to use these script files for the sole
* purpose of either: (i) interacting through your browser with the Microsoft
* website or online service, subject to the applicable licensing or use
* terms; or (ii) using the files as included with a Micro... |
SliderSolve/lib/jquery.js | EpiphanyMachine/HR-Algorithms-Meetup | /*! jQuery v1.9.0 | (c) 2005, 2012 jQuery Foundation, Inc. | jquery.org/license */(function(e,t){"use strict";function n(e){var t=e.length,n=st.type(e);return st.isWindow(e)?!1:1===e.nodeType&&t?!0:"array"===n||"function"!==n&&(0===t||"number"==typeof t&&t>0&&t-1 in e)}function r(e){var t=Tt[e]={};return st.each(e.matc... |
Examples/UIExplorer/ActivityIndicatorIOSExample.js | ChristopherSalam/react-native | /**
* The examples provided by Facebook are for non-commercial testing and
* evaluation purposes only.
*
* Facebook reserves all rights not expressly granted.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
... |
frontend/src/Activity/Blocklist/Blocklist.js | geogolem/Radarr | import PropTypes from 'prop-types';
import React, { Component } from 'react';
import LoadingIndicator from 'Components/Loading/LoadingIndicator';
import ConfirmModal from 'Components/Modal/ConfirmModal';
import PageContent from 'Components/Page/PageContent';
import PageContentBody from 'Components/Page/PageContentBody'... |
ajax/libs/highcharts/4.0.0/highcharts.src.js | contentfree/cdnjs | // ==ClosureCompiler==
// @compilation_level SIMPLE_OPTIMIZATIONS
/**
* @license Highcharts JS v4.0.0 (2014-04-22)
*
* (c) 2009-2014 Torstein Honsi
*
* License: www.highcharts.com/license
*/
// JSLint options:
/*global Highcharts, document, window, navigator, setInterval, clearInterval, clearTimeout, setTimeout... |
include/javascript/yui3/build/event/event-focus.js | RajkumarSelvaraju/FixNix_CRM | /*
Copyright (c) 2010, Yahoo! Inc. All rights reserved.
Code licensed under the BSD License:
http://developer.yahoo.com/yui/license.html
version: 3.3.0
build: 3167
*/
YUI.add("event-focus",function(e){var d=e.Event,c=e.Lang,a=c.isString,b=c.isFunction(e.DOM.create('<p onbeforeactivate=";"/>').onbeforeactivate);f... |
ajax/libs/react-virtualized/4.7.0/react-virtualized.js | jdh8/cdnjs | !function(root, factory) {
"object" == typeof exports && "object" == typeof module ? module.exports = factory(require("react"), require("react-dom")) : "function" == typeof define && define.amd ? define([ "react", "react-dom" ], factory) : "object" == typeof exports ? exports["react-virtualized"] = factory(require(... |
src/renderers/shared/event/eventPlugins/__tests__/ResponderEventPlugin-test.js | supriyantomaftuh/react | /**
* Copyright 2013-2015, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
* @emails react-co... |
node_modules/github-api/node_modules/axios/dist/axios.js | suamorales/course-registration | /* axios v0.10.0 | (c) 2016 by Matt Zabriskie */
(function webpackUniversalModuleDefinition(root, factory) {
if(typeof exports === 'object' && typeof module === 'object')
module.exports = factory();
else if(typeof define === 'function' && define.amd)
define([], factory);
else if(typeof exports === 'object')
ex... |
ajax/libs/react-native-web/0.14.0/exports/RefreshControl/index.js | cdnjs/cdnjs | function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
/**
* Copy... |
ajax/libs/yui/3.9.0pr2/datatable-body/datatable-body-coverage.js | BitsyCode/cdnjs | if (typeof _yuitest_coverage == "undefined"){
_yuitest_coverage = {};
_yuitest_coverline = function(src, line){
var coverage = _yuitest_coverage[src];
if (!coverage.lines[line]){
coverage.calledLines++;
}
coverage.lines[line]++;
};
_yuitest_coverfunc = functio... |
ajax/libs/foundation/4.0.9/js/vendor/jquery.min.js | RubaXa/cdnjs | (function(e,t){function n(e){var t=e.length,n=lt.type(e);return lt.isWindow(e)?!1:1===e.nodeType&&t?!0:"array"===n||"function"!==n&&(0===t||"number"==typeof t&&t>0&&t-1 in e)}function i(e){var t=wt[e]={};return lt.each(e.match(ut)||[],function(e,n){t[n]=!0}),t}function r(e,n,i,r){if(lt.acceptData(e)){var o,a,s=lt.expan... |
ajax/libs/yui/3.1.0/event-custom/event-custom-base.js | kartikrao31/cdnjs | YUI.add('event-custom-base', function(Y) {
/**
* Custom event engine, DOM event listener abstraction layer, synthetic DOM
* events.
* @module event-custom
*/
Y.Env.evt = {
handles: {},
plugins: {}
};
/**
* Custom event engine, DOM event listener abstraction layer, synthetic DOM
* events.
* @module e... |
ajax/libs/vue-imgix/2.6.0/vue-imgix.umd.js | cdnjs/cdnjs | (function (global, factory) {
typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
typeof define === 'function' && define.amd ? define(['exports'], factory) :
(global = global || self, factory(global.Imgix = {}));
}(this, (function (exports) { 'use strict';
var commonjsGlobal = typeof ... |
assets/jqwidgets/demos/react/app/chart/pyramidchart/app.js | juannelisalde/holter | import React from 'react';
import ReactDOM from 'react-dom';
import JqxChart from '../../../jqwidgets-react/react_jqxchart.js';
class App extends React.Component {
render() {
let sampleData = [
{ Index: '1', SerieA: -30, SerieB: -10, SerieC: -25 },
{ Index: '2', SerieA: -25, SerieB... |
ajax/libs/forerunnerdb/1.3.676/fdb-core.js | redmunds/cdnjs | (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.ex... |
js/vendor/contrib/libs/jquery-ui-tabs/tests/unit/tabs/tabs_events.js | khalid-bd/psa-recovery | (function( $ ) {
var state = TestHelpers.tabs.state;
module( "tabs: events" );
test( "create", function() {
expect( 10 );
var element = $( "#tabs1" ),
tabs = element.find( "ul li" ),
panels = element.children( "div" );
element.tabs({
create: function( event, ui ) {
equal( ui.tab.length, 1, "tab length"... |
node_modules/react-dom/lib/ReactTestUtils.js | lhuria94/srijan-staff-react | /**
* Copyright 2013-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
*/
'use strict... |
src/common/components/button/index.js | canonical-ols/my.ubuntu.com | import React, { PropTypes } from 'react';
import style from './button.css';
const defaultProps = {
disabled: PropTypes.bool,
children: PropTypes.string,
onClick: PropTypes.func,
type: PropTypes.string,
appearance: React.PropTypes.oneOf(['primary', 'secondary'])
};
export default function Button(props) {
... |
www/Jcrop/js/jquery.min.js | reasoncms/reasoncms | /*! jQuery v1.9.0 | (c) 2005, 2012 jQuery Foundation, Inc. | jquery.org/license */(function(e,t){"use strict";function n(e){var t=e.length,n=st.type(e);return st.isWindow(e)?!1:1===e.nodeType&&t?!0:"array"===n||"function"!==n&&(0===t||"number"==typeof t&&t>0&&t-1 in e)}function r(e){var t=Tt[e]={};return st.each(e.matc... |
ajax/libs/ag-grid/13.1.2/lib/utils.js | BenjaminVanRyseghem/cdnjs | /**
* ag-grid - Advanced Data Grid / Data Table supporting Javascript / React / AngularJS / Web Components
* @version v13.1.2
* @link http://www.ag-grid.com/
* @license MIT
*/
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var FUNCTION_STRIP_COMMENTS = /((\/\/.*$)|(\/\*[\s\S]*?\*\/))/... |
definitions/npm/react-jss_v6.1.x/test_react-jss_v6.1.x.js | echenley/flow-typed | // @flow
import React from 'react';
import injectSheet, { create } from 'react-jss';
import type { Classes, Sheet } from 'react-jss';
const styles = {
root: {
backgroundColor: 'red',
},
[`@media (min-width: ${10}px)`]: {
root: {
width: 200
}
}
};
type Styles = typeof styles;
type Props = {... |
examples/counter/containers/CounterApp.js | xiaoking/redux | import React, { Component } from 'react';
import { bindActionCreators } from 'redux';
import { connect } from 'redux/react';
import Counter from '../components/Counter';
import * as CounterActions from '../actions/CounterActions';
@connect(state => ({
counter: state.counter
}))
export default class CounterApp extend... |
dist/global/backbone-parse-inclusive.js | typhonjs/backbone-parse-es6 | !function(e){function r(e,r,o){return 4===arguments.length?t.apply(this,arguments):void n(e,{declarative:!0,deps:r,declare:o})}function t(e,r,t,o){n(e,{declarative:!1,deps:r,executingRequire:t,execute:o})}function n(e,r){r.name=e,e in p||(p[e]=r),r.normalizedDeps=r.deps}function o(e,r){if(r[e.groupIndex]=r[e.groupIndex... |
node_modules/grunt-contrib-watch/node_modules/tiny-lr/node_modules/qs/test/browser/jquery.js | ricardorestrepo/perdida_esperada | /*!
* jQuery JavaScript Library v1.6.2
* http://jquery.com/
*
* Copyright 2011, John Resig
* Dual licensed under the MIT or GPL Version 2 licenses.
* http://jquery.org/license
*
* Includes Sizzle.js
* http://sizzlejs.com/
* Copyright 2011, The Dojo Foundation
* Released under the MIT, BSD, and GPL Licenses.
... |
js/jquery.js | GetUp-Go/GetUp-Go.github.io | /*! jQuery v1.11.1 | (c) 2005, 2014 jQuery Foundation, Inc. | jquery.org/license */
!function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof wind... |
ajax/libs/forerunnerdb/1.3.405/fdb-all.min.js | jonobr1/cdnjs | !function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);var j=new Error("Cannot find module '"+g+"'");throw j.code="MODULE_NOT_FOUND",j}var k=c[g]={exports:{}};b[g][0].call(k.exports,function(a){var c=b[g][1][a];return e(c?c:a)},k,k.ex... |
docs/app/Examples/elements/Container/Types/ContainerExampleText.js | shengnian/shengnian-ui-react | /* eslint-disable max-len */
import React from 'react'
import { Container, Header } from 'shengnian-ui-react'
const ContainerExampleText = () => (
<Container text>
<Header as='h2'>Header</Header>
<p>Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Aenean commodo ligula eget dolor. Aenean massa stro... |
react-jade/inline-react-jade-loader.js | mrk21/study_frontend | // see: https://github.com/jbrantly/ts-jsx-loader/blob/master/index.js
var jade = require('react-jade');
var path = require('path')
var loaderUtils = require('loader-utils')
module.exports = function (content) {
this.cacheable()
var that = this;
var replace = function (match, content) {
if (match.match('//')... |
ajax/libs/zeroclipboard/2.1.6/ZeroClipboard.Core.js | boneskull/cdnjs | /*!
* ZeroClipboard
* The ZeroClipboard library provides an easy way to copy text to the clipboard using an invisible Adobe Flash movie and a JavaScript interface.
* Copyright (c) 2014 Jon Rohan, James M. Greene
* Licensed MIT
* http://zeroclipboard.org/
* v2.1.6
*/
(function(window, undefined) {
"use strict";... |
src/components/Editor/ColumnBreakpoints.js | wldcordeiro/debugger.html | /* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at <http://mozilla.org/MPL/2.0/>. */
import React, { Component } from "react";
import ColumnBreakpoint from "./ColumnBreakpoint";
import "./ColumnBr... |
node_modules/babel-runtime/node_modules/core-js/client/library.js | jakegornall/MeatFestWebsite | /**
* core-js 2.4.1
* https://github.com/zloirock/core-js
* License: http://rock.mit-license.org
* © 2016 Denis Pushkarev
*/
!function(__e, __g, undefined){
'use strict';
/******/ (function(modules) { // webpackBootstrap
/******/ // The module cache
/******/ var installedModules = {};
/******/ // The require f... |
ajax/libs/yui/3.2.0/loader/loader.js | jimmybyrum/cdnjs | YUI.add('loader-base', function(Y) {
/**
* The YUI loader core
* @module loader
* @submodule loader-base
*/
if (!YUI.Env[Y.version]) {
(function() {
var VERSION = Y.version,
// CONFIG = Y.config,
BUILD = '/build/',
ROOT = VERSI... |
fixtures/packaging/rjs/prod/input.js | chicoxyzzy/react | require(['react', 'react-dom'], function(React, ReactDOM) {
ReactDOM.render(
React.createElement('h1', null, 'Hello World!'),
document.getElementById('container')
);
});
|
ajax/libs/inferno/1.0.0-beta16/inferno-mobx.min.js | iwdmb/cdnjs | !function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t(require("./inferno-component"),require("./inferno"),require("./inferno-create-class"),require("./inferno-create-element")):"function"==typeof define&&define.amd?define(["inferno-component","inferno","inferno-create-class","inferno-crea... |
ajax/libs/yui/3.4.0pr1/loader/loader-debug.js | redmunds/cdnjs | YUI.add('loader-base', function(Y) {
/**
* The YUI loader core
* @module loader
* @submodule loader-base
*/
if (!YUI.Env[Y.version]) {
(function() {
var VERSION = Y.version,
BUILD = '/build/',
ROOT = VERSION + BUILD,
CDN_BASE = Y.Env.base,
GALLERY_VERSI... |
ajax/libs/video.js/5.8.0/alt/video.novtt.js | tonytomov/cdnjs | /**
* @license
* Video.js 5.8.0 <http://videojs.com/>
* Copyright Brightcove, Inc. <https://www.brightcove.com/>
* Available under Apache License Version 2.0
* <https://github.com/videojs/video.js/blob/master/LICENSE>
*/
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}e... |
web/static/js/actions/session.js | mciastek/emotions-wheel-backend | import { push } from 'react-router-redux';
import Connection from 'utils/Connection';
import Storage from 'utils/Storage';
import actionTypes from 'constants/action-types';
export function createSession() {
return {
type: actionTypes.SESSION_CREATE
};
}
export function deleteSession() {
return {
type: ... |
src/core/Location.js | yudppp/react-starter-kit-with-falcor | /*! React Starter Kit | MIT License | http://www.reactstarterkit.com/ */
import { canUseDOM } from 'fbjs/lib/ExecutionEnvironment';
import createHistory from 'history/lib/createBrowserHistory';
import createMemoryHistory from 'history/lib/createMemoryHistory';
import useQueries from 'history/lib/useQueries';
const lo... |
ajax/libs/react/0.14.0-alpha2/react.min.js | tkirda/cdnjs | /**
* React v0.14.0-alpha2
*
* Copyright 2013-2015, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same direct... |
ajax/libs/yasr/1.2.3/yasr.bundled.min.js | boneskull/cdnjs | !function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var t;"undefined"!=typeof window?t=window:"undefined"!=typeof global?t=global:"undefined"!=typeof self&&(t=self),t.YASR=e()}}(function(){var e;return function t(e,n,r){... |
profiles/drupal_commons/modules/contrib/views/js/dependent.js | COPU/openunion | /**
* @file dependent.js
*
* Written by dmitrig01 (Dmitri Gaskin) for Views; this provides dependent
* visibility for form items in Views' ajax forms.
*
* To your $form item definition add:
* - '#process' => array('views_process_dependency'),
* - Add '#dependency' => array('id-of-form-item' => array(list, of, v... |
LogFileReader/log-viewer-fe/internals/scripts/dependencies.js | luungoc2005/LogFileReader | // No need to build the DLL in production
if (process.env.NODE_ENV === 'production') {
process.exit(0);
}
require('shelljs/global');
const path = require('path');
const fs = require('fs');
const exists = fs.existsSync;
const writeFile = fs.writeFileSync;
const defaults = require('lodash/defaultsDeep');
const pkg =... |
stories/button.js | emsiengineering/emsi-ui | import React from 'react';
import { storiesOf, action } from '@kadira/storybook';
import Button from '../src/components/Button';
storiesOf('Button', module)
.add('default button', () => (
<div>
<Button>Default</Button>
<div style={{ display: 'block', paddingBottom: '1rem' }} />
<Button active>... |
assets/js/jquery.min.js | EbenezerOyenuga/citizenship | /*! jQuery v1.10.2 | (c) 2005, 2013 jQuery Foundation, Inc. | jquery.org/license
//@ sourceMappingURL=jquery-1.10.2.min.map
*/
(function(e,t){var n,r,i=typeof t,o=e.location,a=e.document,s=a.documentElement,l=e.jQuery,u=e.$,c={},p=[],f="1.10.2",d=p.concat,h=p.push,g=p.slice,m=p.indexOf,y=c.toString,v=c.hasOwnProperty,b... |
ajax/libs/angular-google-maps/1.1.8/angular-google-maps.js | luanlmd/cdnjs | /*! angular-google-maps 1.1.8 2014-07-10
* AngularJS directives for Google Maps
* git: https://github.com/nlaplante/angular-google-maps.git
*/
/*
!
The MIT License
Copyright (c) 2010-2013 Google, Inc. http://angularjs.org
Permission is hereby granted, free of charge, to any person obtaining a copy
of this softwa... |
ajax/libs/primereact/6.3.1/components/paginator/NextPageLink.js | cdnjs/cdnjs | "use strict";
function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj ... |
ajax/libs/inferno-mobx/3.0.1/inferno-mobx.js | froala/cdnjs |
/*!
* Inferno.Mobx v3.0.1
* (c) 2017 Dominic Gannaway'
* Released under the MIT License.
*/
(function (global, factory) {
typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('inferno-component'), require('inferno-create-class'), require('hoist-non-inferno-statics'), require('i... |
lib/svg-icons/hardware/security.js | bdsabian/material-ui-old | 'use strict';
var React = require('react');
var PureRenderMixin = require('react-addons-pure-render-mixin');
var SvgIcon = require('../../svg-icon');
var HardwareSecurity = React.createClass({
displayName: 'HardwareSecurity',
mixins: [PureRenderMixin],
render: function render() {
return React.createElemen... |
ajax/libs/yui/3.16.0/datatable-core/datatable-core-debug.js | yinghunglai/cdnjs | /*
YUI 3.16.0 (build 76f0e08)
Copyright 2014 Yahoo! Inc. All rights reserved.
Licensed under the BSD License.
http://yuilibrary.com/license/
*/
YUI.add('datatable-core', function (Y, NAME) {
/**
The core implementation of the `DataTable` and `DataTable.Base` Widgets.
@module datatable
@submodule datatable-core
@sinc... |
node_modules/browserify/node_modules/syntax-error/node_modules/acorn/test/compare/traceur.js | jcheron/angular-samples | (function(global) {
'use strict';
if (global.$traceurRuntime) {
return;
}
var $Object = Object;
var $TypeError = TypeError;
var $create = $Object.create;
var $defineProperties = $Object.defineProperties;
var $defineProperty = $Object.defineProperty;
var $freeze = $Object.freeze;
var $getOwnPrope... |
ajax/libs/react/0.14.0-beta1/react.min.js | hanbyul-here/cdnjs | /**
* React v0.14.0-beta1
*
* Copyright 2013-2015, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directo... |
ajax/libs/material-ui/5.0.0-beta.4/node/ListItemSecondaryAction/ListItemSecondaryAction.js | cdnjs/cdnjs | "use strict";
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.default = void 0;
var _objectWithoutPropertiesLoose2 = _interopRequireDefault(require("@babel/runtime/helpers/objectWithoutPropertiesLoose"));
... |
tests/baselines/reference/commentsOnJSXExpressionsArePreserved(jsx=react,module=commonjs,moduledetection=force).js | microsoft/TypeScript | //// [commentsOnJSXExpressionsArePreserved.tsx]
// file is intentionally not a module - this tests for a crash in the module/system transforms alongside the `react-jsx` and `react-jsxdev` outputs
namespace JSX {}
class Component {
render() {
return <div>
{/* missing */}
{null/* pres... |
Bugzkilla/Dev/scripts/vendor/sly.js | Trust-Sourcing/BugzKilla | /*!
* sly 1.6.1 - 8th Aug 2015
* https://github.com/darsain/sly
*
* Licensed under the MIT license.
* http://opensource.org/licenses/MIT
*/
;(function ($, w, undefined) {
'use strict';
var pluginName = 'sly';
var className = 'Sly';
var namespace = pluginName;
// Local WindowAnimationTiming interface
va... |
fanx_admin/js/tinymce/jquery-1.5.min.js | sunnefa/FanXpression | /*!
* jQuery JavaScript Library v1.5
* http://jquery.com/
*
* Copyright 2011, John Resig
* Dual licensed under the MIT or GPL Version 2 licenses.
* http://jquery.org/license
*
* Includes Sizzle.js
* http://sizzlejs.com/
* Copyright 2011, The Dojo Foundation
* Released under the MIT, BSD, and GPL Licenses.
*... |
ajax/libs/forerunnerdb/1.3.441/fdb-all.min.js | iwdmb/cdnjs | !function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);var j=new Error("Cannot find module '"+g+"'");throw j.code="MODULE_NOT_FOUND",j}var k=c[g]={exports:{}};b[g][0].call(k.exports,function(a){var c=b[g][1][a];return e(c?c:a)},k,k.ex... |
ajax/libs/react-chartjs/2.0.0-beta2/react-chartjs.min.js | joeyparrish/cdnjs | !function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e(require("react"),require("react-dom"),require("Chartjs")):"function"==typeof define&&define.amd?define(["react","react-dom","Chartjs"],e):"object"==typeof exports?exports["react-chartjs"]=e(require("react"),require("react-dom"),require("C... |
public/vendor/jquery-1.9.1.min.js | rootinginway/27 | /*! jQuery v1.9.1 | (c) 2005, 2012 jQuery Foundation, Inc. | jquery.org/license
//@ sourceMappingURL=jquery.min.map
*/(function(e,t){var n,r,i=typeof t,o=e.document,a=e.location,s=e.jQuery,u=e.$,l={},c=[],p="1.9.1",f=c.concat,d=c.push,h=c.slice,g=c.indexOf,m=l.toString,y=l.hasOwnProperty,v=p.trim,b=function(e,t){return... |
dashboard/app/bower_components/jquery/test/data/jquery-1.8.2.ajax_xhr.min.js | SUSE/romana | /*! jQuery v1.8.2 -deprecated,-css,-ajax/script,-ajax/jsonp,-effects,-offset,-dimensions jquery.com | jquery.org/license */
(function(e,t){function _(e){var t=M[e]={};return v.each(e.split(y),function(e,n){t[n]=!0}),t}function H(e,n,r){if(r===t&&e.nodeType===1){var i="data-"+n.replace(P,"-$1").toLowerCase();r=e.getAttr... |
ajax/libs/react-grid-layout/0.13.6/react-grid-layout.min.js | joeyparrish/cdnjs | !function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e(require("react"),require("react-dom")):"function"==typeof define&&define.amd?define(["react","react-dom"],e):"object"==typeof exports?exports.ReactGridLayout=e(require("react"),require("react-dom")):t.ReactGridLayout=e(t.React,t.ReactDOM)... |
ajax/libs/forerunnerdb/1.3.716/fdb-core+persist.js | keicheng/cdnjs | (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.ex... |
src/components/messages/parts/Outbox.js | platejan/HeroCamp | import React, {PropTypes} from 'react';
import {connect} from 'react-redux';
import {bindActionCreators} from 'redux';
import {loadMessages} from '../../../actions/messagesActions';
import Message from './Message';
class Outbox extends React.Component {
constructor(props, context) {
super(props, context);
th... |
ajax/libs/yui/3.9.0/simpleyui/simpleyui-debug.js | humbletim/cdnjs | /**
The YUI module contains the components required for building the YUI seed file.
This includes the script loading mechanism, a simple queue, and the core
utilities for the library.
@module yui
@main yui
@submodule yui-base
**/
/*jshint eqeqeq: false*/
if (typeof YUI != 'undefined') {
YUI._YUI = YUI;
}
/**
The... |
ajax/libs/core-js/0.2.2/core.js | xymostech/cdnjs | /**
* Core.js 0.2.2
* https://github.com/zloirock/core-js
* License: http://rock.mit-license.org
* © 2014 Denis Pushkarev
*/
!function(returnThis, framework, undefined){
'use strict';
/******************************************************************************
* Module : common ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.