You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@cordova.apache.org by bh...@apache.org on 2014/03/27 16:08:30 UTC
[16/51] [partial] CB-6346 - Add node_modules to source control
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/CONTRIBUTING.md
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/CONTRIBUTING.md b/blackberry10/node_modules/jasmine-node/node_modules/underscore/CONTRIBUTING.md
new file mode 100644
index 0000000..e133ebe
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/CONTRIBUTING.md
@@ -0,0 +1,9 @@
+## How to contribute to Underscore.js
+
+* Before you open a ticket or send a pull request, [search](https://github.com/jashkenas/underscore/issues) for previous discussions about the same feature or issue. Add to the earlier ticket if you find one.
+
+* Before sending a pull request for a feature, be sure to have [tests](http://underscorejs.org/test/).
+
+* Use the same coding style as the rest of the [codebase](https://github.com/jashkenas/underscore/blob/master/underscore.js).
+
+* In your pull request, do not add documentation or re-build the minified `underscore-min.js` file. We'll do those things before cutting a new release.
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/LICENSE
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/LICENSE b/blackberry10/node_modules/jasmine-node/node_modules/underscore/LICENSE
new file mode 100644
index 0000000..3acf908
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/LICENSE
@@ -0,0 +1,23 @@
+Copyright (c) 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative
+Reporters & Editors
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/README.md
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/README.md b/blackberry10/node_modules/jasmine-node/node_modules/underscore/README.md
new file mode 100644
index 0000000..c2ba259
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/README.md
@@ -0,0 +1,22 @@
+ __
+ /\ \ __
+ __ __ ___ \_\ \ __ _ __ ____ ___ ___ _ __ __ /\_\ ____
+ /\ \/\ \ /' _ `\ /'_ \ /'__`\/\ __\/ ,__\ / ___\ / __`\/\ __\/'__`\ \/\ \ /',__\
+ \ \ \_\ \/\ \/\ \/\ \ \ \/\ __/\ \ \//\__, `\/\ \__//\ \ \ \ \ \//\ __/ __ \ \ \/\__, `\
+ \ \____/\ \_\ \_\ \___,_\ \____\\ \_\\/\____/\ \____\ \____/\ \_\\ \____\/\_\ _\ \ \/\____/
+ \/___/ \/_/\/_/\/__,_ /\/____/ \/_/ \/___/ \/____/\/___/ \/_/ \/____/\/_//\ \_\ \/___/
+ \ \____/
+ \/___/
+
+Underscore.js is a utility-belt library for JavaScript that provides
+support for the usual functional suspects (each, map, reduce, filter...)
+without extending any core JavaScript objects.
+
+For Docs, License, Tests, and pre-packed downloads, see:
+http://underscorejs.org
+
+Underscore is an open-sourced component of DocumentCloud:
+https://github.com/documentcloud
+
+Many thanks to our contributors:
+https://github.com/jashkenas/underscore/contributors
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/favicon.ico
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/favicon.ico b/blackberry10/node_modules/jasmine-node/node_modules/underscore/favicon.ico
new file mode 100644
index 0000000..0304968
Binary files /dev/null and b/blackberry10/node_modules/jasmine-node/node_modules/underscore/favicon.ico differ
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/index.js
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/index.js b/blackberry10/node_modules/jasmine-node/node_modules/underscore/index.js
new file mode 100644
index 0000000..2cf0ca5
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/index.js
@@ -0,0 +1 @@
+module.exports = require('./underscore');
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/package.json
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/package.json b/blackberry10/node_modules/jasmine-node/node_modules/underscore/package.json
new file mode 100644
index 0000000..0d9ace4
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/package.json
@@ -0,0 +1,40 @@
+{
+ "name": "underscore",
+ "description": "JavaScript's functional programming helper library.",
+ "homepage": "http://underscorejs.org",
+ "keywords": [
+ "util",
+ "functional",
+ "server",
+ "client",
+ "browser"
+ ],
+ "author": {
+ "name": "Jeremy Ashkenas",
+ "email": "jeremy@documentcloud.org"
+ },
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/jashkenas/underscore.git"
+ },
+ "main": "underscore.js",
+ "version": "1.5.1",
+ "devDependencies": {
+ "phantomjs": "1.9.0-1"
+ },
+ "scripts": {
+ "test": "phantomjs test/vendor/runner.js test/index.html?noglobals=true"
+ },
+ "license": "MIT",
+ "readme": " __\n /\\ \\ __\n __ __ ___ \\_\\ \\ __ _ __ ____ ___ ___ _ __ __ /\\_\\ ____\n /\\ \\/\\ \\ /' _ `\\ /'_ \\ /'__`\\/\\ __\\/ ,__\\ / ___\\ / __`\\/\\ __\\/'__`\\ \\/\\ \\ /',__\\\n \\ \\ \\_\\ \\/\\ \\/\\ \\/\\ \\ \\ \\/\\ __/\\ \\ \\//\\__, `\\/\\ \\__//\\ \\ \\ \\ \\ \\//\\ __/ __ \\ \\ \\/\\__, `\\\n \\ \\____/\\ \\_\\ \\_\\ \\___,_\\ \\____\\\\ \\_\\\\/\\____/\\ \\____\\ \\____/\\ \\_\\\\ \\____\\/\\_\\ _\\ \\ \\/\\____/\n \\/___/ \\/_/\\/_/\\/__,_ /\\/____/ \\/_/ \\/___/ \\/____/\\/___/ \\/_/ \\/____/\\/_//\\ \\_\\ \\/___/\n \\ \\____/\n \\/___/\n\nUnderscore.js is a utility-belt library for JavaScript that provides\nsupport for the usu
al functional suspects (each, map, reduce, filter...)\nwithout extending any core JavaScript objects.\n\nFor Docs, License, Tests, and pre-packed downloads, see:\nhttp://underscorejs.org\n\nUnderscore is an open-sourced component of DocumentCloud:\nhttps://github.com/documentcloud\n\nMany thanks to our contributors:\nhttps://github.com/jashkenas/underscore/contributors\n",
+ "readmeFilename": "README.md",
+ "bugs": {
+ "url": "https://github.com/jashkenas/underscore/issues"
+ },
+ "_id": "underscore@1.5.1",
+ "dist": {
+ "shasum": "d2bde817d176ffade894ab71458e682a14b86dc9"
+ },
+ "_from": "underscore@>= 1.3.1",
+ "_resolved": "https://registry.npmjs.org/underscore/-/underscore-1.5.1.tgz"
+}
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore-min.map
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore-min.map b/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore-min.map
new file mode 100644
index 0000000..fee224f
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore-min.map
@@ -0,0 +1 @@
+{"version":3,"file":"underscore-min.js","sources":["underscore.js"],"names":["root","this","previousUnderscore","_","breaker","ArrayProto","Array","prototype","ObjProto","Object","FuncProto","Function","push","slice","concat","toString","hasOwnProperty","nativeForEach","forEach","nativeMap","map","nativeReduce","reduce","nativeReduceRight","reduceRight","nativeFilter","filter","nativeEvery","every","nativeSome","some","nativeIndexOf","indexOf","nativeLastIndexOf","lastIndexOf","nativeIsArray","isArray","nativeKeys","keys","nativeBind","bind","obj","_wrapped","exports","module","VERSION","each","iterator","context","length","i","l","call","key","has","collect","results","value","index","list","reduceError","foldl","inject","memo","initial","arguments","TypeError","foldr","find","detect","result","any","select","reject","all","identity","contains","include","target","invoke","method","args","isFunc","isFunction","apply","pluck","where","attrs","first","isEmpty","findWhere","max","Math
","Infinity","computed","min","shuffle","rand","shuffled","random","lookupIterator","sortBy","criteria","sort","left","right","a","b","group","behavior","groupBy","countBy","sortedIndex","array","low","high","mid","toArray","values","size","head","take","n","guard","last","rest","tail","drop","compact","flatten","input","shallow","output","isArguments","without","difference","uniq","unique","isSorted","seen","union","intersection","item","other","zip","object","from","hasIndex","range","start","stop","step","len","ceil","idx","ctor","func","bound","self","partial","bindAll","funcs","Error","f","memoize","hasher","delay","wait","setTimeout","defer","throttle","options","timeout","previous","later","leading","Date","now","remaining","clearTimeout","trailing","debounce","immediate","callNow","once","ran","wrap","wrapper","compose","after","times","pairs","invert","functions","methods","names","extend","source","prop","pick","copy","omit","defaults","clone","isObject","tap","interceptor
","eq","aStack","bStack","className","String","global","multiline","ignoreCase","aCtor","constructor","bCtor","pop","isEqual","isString","isElement","nodeType","name","isFinite","isNaN","parseFloat","isNumber","isBoolean","isNull","isUndefined","noConflict","accum","floor","entityMap","escape","&","<",">","\"","'","/","unescape","entityRegexes","RegExp","join","string","replace","match","property","mixin","idCounter","uniqueId","prefix","id","templateSettings","evaluate","interpolate","noMatch","escapes","\\","\r","\n","\t","
","
","escaper","template","text","data","settings","render","matcher","offset","variable","e","chain","_chain"],"mappings":";;;;CAKA,WAME,GAAIA,GAAOC,KAGPC,EAAqBF,EAAKG,EAG1BC,KAGAC,EAAaC,MAAMC,UAAWC,EAAWC,OAAOF,UAAWG,EAAYC,SAASJ,UAIlFK,EAAmBP,EAAWO,KAC9BC,EAAmBR,EAAWQ,MAC9BC,EAAmBT,EAAWS,OAC9BC,EAAmBP,EAASO,SAC5BC,EAAmBR,EAASQ,eAK5BC,EAAqBZ,EAAWa,QAChCC,EAAqBd,EAAWe,IAChCC,EAAqBhB,EAAWiB,OAChCC,EAAqBlB,EAAWmB,YAChCC,EAAqBpB,EAAWqB,OAChCC,EAAqBtB,EAAWuB,MA
ChCC,EAAqBxB,EAAWyB,KAChCC,EAAqB1B,EAAW2B,QAChCC,EAAqB5B,EAAW6B,YAChCC,EAAqB7B,MAAM8B,QAC3BC,EAAqB5B,OAAO6B,KAC5BC,EAAqB7B,EAAU8B,KAG7BrC,EAAI,SAASsC,GACf,MAAIA,aAAetC,GAAUsC,EACvBxC,eAAgBE,IACtBF,KAAKyC,SAAWD,EAAhBxC,QADiC,GAAIE,GAAEsC,GAQlB,oBAAZE,UACa,mBAAXC,SAA0BA,OAAOD,UAC1CA,QAAUC,OAAOD,QAAUxC,GAE7BwC,QAAQxC,EAAIA,GAEZH,EAAKG,EAAIA,EAIXA,EAAE0C,QAAU,OAQZ,IAAIC,GAAO3C,EAAE2C,KAAO3C,EAAEe,QAAU,SAASuB,EAAKM,EAAUC,GACtD,GAAW,MAAPP,EACJ,GAAIxB,GAAiBwB,EAAIvB,UAAYD,EACnCwB,EAAIvB,QAAQ6B,EAAUC,OACjB,IAAIP,EAAIQ,UAAYR,EAAIQ,QAC7B,IAAK,GAAIC,GAAI,EAAGC,EAAIV,EAAIQ,OAAYE,EAAJD,EAAOA,IACrC,GAAIH,EAASK,KAAKJ,EAASP,EAAIS,GAAIA,EAAGT,KAASrC,EAAS,WAG1D,KAAK,GAAIiD,KAAOZ,GACd,GAAItC,EAAEmD,IAAIb,EAAKY,IACTN,EAASK,KAAKJ,EAASP,EAAIY,GAAMA,EAAKZ,KAASrC,EAAS,OAQpED,GAAEiB,IAAMjB,EAAEoD,QAAU,SAASd,EAAKM,EAAUC,GAC1C,GAAIQ,KACJ,OAAW,OAAPf,EAAoBe,EACpBrC,GAAasB,EAAIrB,MAAQD,EAAkBsB,EAAIrB,IAAI2B,EAAUC,IACjEF,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/BH,EAAQ5C,KAAKmC,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,MAE7CH,GAGT,
IAAII,GAAc,6CAIlBzD,GAAEmB,OAASnB,EAAE0D,MAAQ1D,EAAE2D,OAAS,SAASrB,EAAKM,EAAUgB,EAAMf,GAC5D,GAAIgB,GAAUC,UAAUhB,OAAS,CAEjC,IADW,MAAPR,IAAaA,MACbpB,GAAgBoB,EAAInB,SAAWD,EAEjC,MADI2B,KAASD,EAAW5C,EAAEqC,KAAKO,EAAUC,IAClCgB,EAAUvB,EAAInB,OAAOyB,EAAUgB,GAAQtB,EAAInB,OAAOyB,EAU3D,IARAD,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC1BK,EAIHD,EAAOhB,EAASK,KAAKJ,EAASe,EAAMN,EAAOC,EAAOC,IAHlDI,EAAON,EACPO,GAAU,MAKTA,EAAS,KAAM,IAAIE,WAAUN,EAClC,OAAOG,IAKT5D,EAAEqB,YAAcrB,EAAEgE,MAAQ,SAAS1B,EAAKM,EAAUgB,EAAMf,GACtD,GAAIgB,GAAUC,UAAUhB,OAAS,CAEjC,IADW,MAAPR,IAAaA,MACblB,GAAqBkB,EAAIjB,cAAgBD,EAE3C,MADIyB,KAASD,EAAW5C,EAAEqC,KAAKO,EAAUC,IAClCgB,EAAUvB,EAAIjB,YAAYuB,EAAUgB,GAAQtB,EAAIjB,YAAYuB,EAErE,IAAIE,GAASR,EAAIQ,MACjB,IAAIA,KAAYA,EAAQ,CACtB,GAAIX,GAAOnC,EAAEmC,KAAKG,EAClBQ,GAASX,EAAKW,OAWhB,GATAH,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/BD,EAAQpB,EAAOA,IAAOW,KAAYA,EAC7Be,EAIHD,EAAOhB,EAASK,KAAKJ,EAASe,EAAMtB,EAAIiB,GAAQA,EAAOC,IAHvDI,EAAOtB,EAAIiB,GACXM,GAAU,MAKTA,EAAS,KAAM,IAAIE,WAAUN,EAClC,OAAOG,IAIT5D,EAAEiE
,KAAOjE,EAAEkE,OAAS,SAAS5B,EAAKM,EAAUC,GAC1C,GAAIsB,EAOJ,OANAC,GAAI9B,EAAK,SAASgB,EAAOC,EAAOC,GAC9B,MAAIZ,GAASK,KAAKJ,EAASS,EAAOC,EAAOC,IACvCW,EAASb,GACF,GAFT,SAKKa,GAMTnE,EAAEuB,OAASvB,EAAEqE,OAAS,SAAS/B,EAAKM,EAAUC,GAC5C,GAAIQ,KACJ,OAAW,OAAPf,EAAoBe,EACpB/B,GAAgBgB,EAAIf,SAAWD,EAAqBgB,EAAIf,OAAOqB,EAAUC,IAC7EF,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC3BZ,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,IAAOH,EAAQ5C,KAAK6C,KAExDD,IAITrD,EAAEsE,OAAS,SAAShC,EAAKM,EAAUC,GACjC,MAAO7C,GAAEuB,OAAOe,EAAK,SAASgB,EAAOC,EAAOC,GAC1C,OAAQZ,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,IAC5CX,IAML7C,EAAEyB,MAAQzB,EAAEuE,IAAM,SAASjC,EAAKM,EAAUC,GACxCD,IAAaA,EAAW5C,EAAEwE,SAC1B,IAAIL,IAAS,CACb,OAAW,OAAP7B,EAAoB6B,EACpB3C,GAAec,EAAIb,QAAUD,EAAoBc,EAAIb,MAAMmB,EAAUC,IACzEF,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/B,OAAMW,EAASA,GAAUvB,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,IAA9D,OAA6EvD,MAEtEkE,GAMX,IAAIC,GAAMpE,EAAE2B,KAAO3B,EAAEoE,IAAM,SAAS9B,EAAKM,EAAUC,GACjDD,IAAaA,EAAW5C,EAAEwE,SAC1B,IAAIL,IAAS,CACb,OAAW,OAAP7B,EAAoB6B,EACpBzC,GAAcY,EAAIX,OAASD,EAAmBY,
EAAIX,KAAKiB,EAAUC,IACrEF,EAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/B,MAAIW,KAAWA,EAASvB,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,IAAevD,EAA5E,WAEOkE,GAKXnE,GAAEyE,SAAWzE,EAAE0E,QAAU,SAASpC,EAAKqC,GACrC,MAAW,OAAPrC,GAAoB,EACpBV,GAAiBU,EAAIT,UAAYD,EAAsBU,EAAIT,QAAQ8C,KAAY,EAC5EP,EAAI9B,EAAK,SAASgB,GACvB,MAAOA,KAAUqB,KAKrB3E,EAAE4E,OAAS,SAAStC,EAAKuC,GACvB,GAAIC,GAAOpE,EAAMuC,KAAKa,UAAW,GAC7BiB,EAAS/E,EAAEgF,WAAWH,EAC1B,OAAO7E,GAAEiB,IAAIqB,EAAK,SAASgB,GACzB,OAAQyB,EAASF,EAASvB,EAAMuB,IAASI,MAAM3B,EAAOwB,MAK1D9E,EAAEkF,MAAQ,SAAS5C,EAAKY,GACtB,MAAOlD,GAAEiB,IAAIqB,EAAK,SAASgB,GAAQ,MAAOA,GAAMJ,MAKlDlD,EAAEmF,MAAQ,SAAS7C,EAAK8C,EAAOC,GAC7B,MAAIrF,GAAEsF,QAAQF,GAAeC,MAAa,MACnCrF,EAAEqF,EAAQ,OAAS,UAAU/C,EAAK,SAASgB,GAChD,IAAK,GAAIJ,KAAOkC,GACd,GAAIA,EAAMlC,KAASI,EAAMJ,GAAM,OAAO,CAExC,QAAO,KAMXlD,EAAEuF,UAAY,SAASjD,EAAK8C,GAC1B,MAAOpF,GAAEmF,MAAM7C,EAAK8C,GAAO,IAM7BpF,EAAEwF,IAAM,SAASlD,EAAKM,EAAUC,GAC9B,IAAKD,GAAY5C,EAAEiC,QAAQK,IAAQA,EAAI,MAAQA,EAAI,IAAMA,EAAIQ,OAAS,MACpE,MAAO2C,MAAKD,IAAIP,MAAMQ,KAAMnD,EAE
9B,KAAKM,GAAY5C,EAAEsF,QAAQhD,GAAM,OAAQoD,GACzC,IAAIvB,IAAUwB,UAAYD,IAAUpC,OAAQoC,IAK5C,OAJA/C,GAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/B,GAAImC,GAAW/C,EAAWA,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,GAAQF,CACvEqC,GAAWxB,EAAOwB,WAAaxB,GAAUb,MAAQA,EAAOqC,SAAWA,MAE9DxB,EAAOb,OAIhBtD,EAAE4F,IAAM,SAAStD,EAAKM,EAAUC,GAC9B,IAAKD,GAAY5C,EAAEiC,QAAQK,IAAQA,EAAI,MAAQA,EAAI,IAAMA,EAAIQ,OAAS,MACpE,MAAO2C,MAAKG,IAAIX,MAAMQ,KAAMnD,EAE9B,KAAKM,GAAY5C,EAAEsF,QAAQhD,GAAM,MAAOoD,IACxC,IAAIvB,IAAUwB,SAAWD,IAAUpC,MAAOoC,IAK1C,OAJA/C,GAAKL,EAAK,SAASgB,EAAOC,EAAOC,GAC/B,GAAImC,GAAW/C,EAAWA,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,GAAQF,CACvEqC,GAAWxB,EAAOwB,WAAaxB,GAAUb,MAAQA,EAAOqC,SAAWA,MAE9DxB,EAAOb,OAIhBtD,EAAE6F,QAAU,SAASvD,GACnB,GAAIwD,GACAvC,EAAQ,EACRwC,IAMJ,OALApD,GAAKL,EAAK,SAASgB,GACjBwC,EAAO9F,EAAEgG,OAAOzC,KAChBwC,EAASxC,EAAQ,GAAKwC,EAASD,GAC/BC,EAASD,GAAQxC,IAEZyC,EAIT,IAAIE,GAAiB,SAAS3C,GAC5B,MAAOtD,GAAEgF,WAAW1B,GAASA,EAAQ,SAAShB,GAAM,MAAOA,GAAIgB,IAIjEtD,GAAEkG,OAAS,SAAS5D,EAAKgB,EAAOT,GAC9B,GAAID,GAAWqD,EAAe3C,EAC9B
,OAAOtD,GAAEkF,MAAMlF,EAAEiB,IAAIqB,EAAK,SAASgB,EAAOC,EAAOC,GAC/C,OACEF,MAAQA,EACRC,MAAQA,EACR4C,SAAWvD,EAASK,KAAKJ,EAASS,EAAOC,EAAOC,MAEjD4C,KAAK,SAASC,EAAMC,GACrB,GAAIC,GAAIF,EAAKF,SACTK,EAAIF,EAAMH,QACd,IAAII,IAAMC,EAAG,CACX,GAAID,EAAIC,GAAKD,QAAW,GAAG,MAAO,EAClC,IAAQC,EAAJD,GAASC,QAAW,GAAG,OAAQ,EAErC,MAAOH,GAAK9C,MAAQ+C,EAAM/C,OAAS,EAAI,IACrC,SAIN,IAAIkD,GAAQ,SAASnE,EAAKgB,EAAOT,EAAS6D,GACxC,GAAIvC,MACAvB,EAAWqD,EAAwB,MAAT3C,EAAgBtD,EAAEwE,SAAWlB,EAK3D,OAJAX,GAAKL,EAAK,SAASgB,EAAOC,GACxB,GAAIL,GAAMN,EAASK,KAAKJ,EAASS,EAAOC,EAAOjB,EAC/CoE,GAASvC,EAAQjB,EAAKI,KAEjBa,EAKTnE,GAAE2G,QAAU,SAASrE,EAAKgB,EAAOT,GAC/B,MAAO4D,GAAMnE,EAAKgB,EAAOT,EAAS,SAASsB,EAAQjB,EAAKI,IACrDtD,EAAEmD,IAAIgB,EAAQjB,GAAOiB,EAAOjB,GAAQiB,EAAOjB,OAAYzC,KAAK6C,MAOjEtD,EAAE4G,QAAU,SAAStE,EAAKgB,EAAOT,GAC/B,MAAO4D,GAAMnE,EAAKgB,EAAOT,EAAS,SAASsB,EAAQjB,GAC5ClD,EAAEmD,IAAIgB,EAAQjB,KAAMiB,EAAOjB,GAAO,GACvCiB,EAAOjB,QAMXlD,EAAE6G,YAAc,SAASC,EAAOxE,EAAKM,EAAUC,GAC7CD,EAAuB,MAAZA,EAAmB5C,EAAEwE,SAAWyB,EAAerD,EAG1D,K
AFA,GAAIU,GAAQV,EAASK,KAAKJ,EAASP,GAC/ByE,EAAM,EAAGC,EAAOF,EAAMhE,OACbkE,EAAND,GAAY,CACjB,GAAIE,GAAOF,EAAMC,IAAU,CAC3BpE,GAASK,KAAKJ,EAASiE,EAAMG,IAAQ3D,EAAQyD,EAAME,EAAM,EAAID,EAAOC,EAEtE,MAAOF,IAIT/G,EAAEkH,QAAU,SAAS5E,GACnB,MAAKA,GACDtC,EAAEiC,QAAQK,GAAa5B,EAAMuC,KAAKX,GAClCA,EAAIQ,UAAYR,EAAIQ,OAAe9C,EAAEiB,IAAIqB,EAAKtC,EAAEwE,UAC7CxE,EAAEmH,OAAO7E,OAIlBtC,EAAEoH,KAAO,SAAS9E,GAChB,MAAW,OAAPA,EAAoB,EAChBA,EAAIQ,UAAYR,EAAIQ,OAAUR,EAAIQ,OAAS9C,EAAEmC,KAAKG,GAAKQ,QASjE9C,EAAEqF,MAAQrF,EAAEqH,KAAOrH,EAAEsH,KAAO,SAASR,EAAOS,EAAGC,GAC7C,MAAa,OAATV,MAA2B,GAClB,MAALS,GAAeC,EAAkCV,EAAM,GAAhCpG,EAAMuC,KAAK6D,EAAO,EAAGS,IAOtDvH,EAAE6D,QAAU,SAASiD,EAAOS,EAAGC,GAC7B,MAAO9G,GAAMuC,KAAK6D,EAAO,EAAGA,EAAMhE,QAAgB,MAALyE,GAAcC,EAAQ,EAAID,KAKzEvH,EAAEyH,KAAO,SAASX,EAAOS,EAAGC,GAC1B,MAAa,OAATV,MAA2B,GACrB,MAALS,GAAeC,EAGXV,EAAMA,EAAMhE,OAAS,GAFrBpC,EAAMuC,KAAK6D,EAAOrB,KAAKD,IAAIsB,EAAMhE,OAASyE,EAAG,KAUxDvH,EAAE0H,KAAO1H,EAAE2H,KAAO3H,EAAE4H,KAAO,SAASd,EAAOS,EAAGC,GAC5C,MAAO9G,GAAMuC,KAAK6D,EAAa,M
AALS,GAAcC,EAAQ,EAAID,IAItDvH,EAAE6H,QAAU,SAASf,GACnB,MAAO9G,GAAEuB,OAAOuF,EAAO9G,EAAEwE,UAI3B,IAAIsD,GAAU,SAASC,EAAOC,EAASC,GACrC,MAAID,IAAWhI,EAAEyB,MAAMsG,EAAO/H,EAAEiC,SACvBtB,EAAOsE,MAAMgD,EAAQF,IAE9BpF,EAAKoF,EAAO,SAASzE,GACftD,EAAEiC,QAAQqB,IAAUtD,EAAEkI,YAAY5E,GACpC0E,EAAUvH,EAAKwE,MAAMgD,EAAQ3E,GAASwE,EAAQxE,EAAO0E,EAASC,GAE9DA,EAAOxH,KAAK6C,KAGT2E,GAITjI,GAAE8H,QAAU,SAAShB,EAAOkB,GAC1B,MAAOF,GAAQhB,EAAOkB,OAIxBhI,EAAEmI,QAAU,SAASrB,GACnB,MAAO9G,GAAEoI,WAAWtB,EAAOpG,EAAMuC,KAAKa,UAAW,KAMnD9D,EAAEqI,KAAOrI,EAAEsI,OAAS,SAASxB,EAAOyB,EAAU3F,EAAUC,GAClD7C,EAAEgF,WAAWuD,KACf1F,EAAUD,EACVA,EAAW2F,EACXA,GAAW,EAEb,IAAI1E,GAAUjB,EAAW5C,EAAEiB,IAAI6F,EAAOlE,EAAUC,GAAWiE,EACvDzD,KACAmF,IAOJ,OANA7F,GAAKkB,EAAS,SAASP,EAAOC,IACxBgF,EAAahF,GAASiF,EAAKA,EAAK1F,OAAS,KAAOQ,EAAUtD,EAAEyE,SAAS+D,EAAMlF,MAC7EkF,EAAK/H,KAAK6C,GACVD,EAAQ5C,KAAKqG,EAAMvD,OAGhBF,GAKTrD,EAAEyI,MAAQ,WACR,MAAOzI,GAAEqI,KAAKrI,EAAE8H,QAAQhE,WAAW,KAKrC9D,EAAE0I,aAAe,SAAS5B,GACxB,GAAIY,GAAOhH,EAAMuC,KAAKa,UAAW,EACjC,OAAO
9D,GAAEuB,OAAOvB,EAAEqI,KAAKvB,GAAQ,SAAS6B,GACtC,MAAO3I,GAAEyB,MAAMiG,EAAM,SAASkB,GAC5B,MAAO5I,GAAE6B,QAAQ+G,EAAOD,IAAS,OAOvC3I,EAAEoI,WAAa,SAAStB,GACtB,GAAIY,GAAO/G,EAAOsE,MAAM/E,EAAYQ,EAAMuC,KAAKa,UAAW,GAC1D,OAAO9D,GAAEuB,OAAOuF,EAAO,SAASxD,GAAQ,OAAQtD,EAAEyE,SAASiD,EAAMpE,MAKnEtD,EAAE6I,IAAM,WAGN,IAAK,GAFD/F,GAAS9C,EAAEwF,IAAIxF,EAAEkF,MAAMpB,UAAW,UAAUnD,OAAO,IACnD0C,EAAU,GAAIlD,OAAM2C,GACfC,EAAI,EAAOD,EAAJC,EAAYA,IAC1BM,EAAQN,GAAK/C,EAAEkF,MAAMpB,UAAW,GAAKf,EAEvC,OAAOM,IAMTrD,EAAE8I,OAAS,SAAStF,EAAM2D,GACxB,GAAY,MAAR3D,EAAc,QAElB,KAAK,GADDW,MACKpB,EAAI,EAAGC,EAAIQ,EAAKV,OAAYE,EAAJD,EAAOA,IAClCoE,EACFhD,EAAOX,EAAKT,IAAMoE,EAAOpE,GAEzBoB,EAAOX,EAAKT,GAAG,IAAMS,EAAKT,GAAG,EAGjC,OAAOoB,IASTnE,EAAE6B,QAAU,SAASiF,EAAO6B,EAAMJ,GAChC,GAAa,MAATzB,EAAe,OAAQ,CAC3B,IAAI/D,GAAI,EAAGC,EAAI8D,EAAMhE,MACrB,IAAIyF,EAAU,CACZ,GAAuB,gBAAZA,GAIT,MADAxF,GAAI/C,EAAE6G,YAAYC,EAAO6B,GAClB7B,EAAM/D,KAAO4F,EAAO5F,GAAK,CAHhCA,GAAgB,EAAXwF,EAAe9C,KAAKD,IAAI,EAAGxC,EAAIuF,GAAYA,EAMpD,GAAI3G,GAAiBkF,EAAMjF,UA
AYD,EAAe,MAAOkF,GAAMjF,QAAQ8G,EAAMJ,EACjF,MAAWvF,EAAJD,EAAOA,IAAK,GAAI+D,EAAM/D,KAAO4F,EAAM,MAAO5F,EACjD,QAAQ,GAIV/C,EAAE+B,YAAc,SAAS+E,EAAO6B,EAAMI,GACpC,GAAa,MAATjC,EAAe,OAAQ,CAC3B,IAAIkC,GAAmB,MAARD,CACf,IAAIjH,GAAqBgF,EAAM/E,cAAgBD,EAC7C,MAAOkH,GAAWlC,EAAM/E,YAAY4G,EAAMI,GAAQjC,EAAM/E,YAAY4G,EAGtE,KADA,GAAI5F,GAAKiG,EAAWD,EAAOjC,EAAMhE,OAC1BC,KAAK,GAAI+D,EAAM/D,KAAO4F,EAAM,MAAO5F,EAC1C,QAAQ,GAMV/C,EAAEiJ,MAAQ,SAASC,EAAOC,EAAMC,GAC1BtF,UAAUhB,QAAU,IACtBqG,EAAOD,GAAS,EAChBA,EAAQ,GAEVE,EAAOtF,UAAU,IAAM,CAMvB,KAJA,GAAIuF,GAAM5D,KAAKD,IAAIC,KAAK6D,MAAMH,EAAOD,GAASE,GAAO,GACjDG,EAAM,EACNN,EAAQ,GAAI9I,OAAMkJ,GAEVA,EAANE,GACJN,EAAMM,KAASL,EACfA,GAASE,CAGX,OAAOH,GAOT,IAAIO,GAAO,YAKXxJ,GAAEqC,KAAO,SAASoH,EAAM5G,GACtB,GAAIiC,GAAM4E,CACV,IAAItH,GAAcqH,EAAKpH,OAASD,EAAY,MAAOA,GAAW6C,MAAMwE,EAAM/I,EAAMuC,KAAKa,UAAW,GAChG,KAAK9D,EAAEgF,WAAWyE,GAAO,KAAM,IAAI1F,UAEnC,OADAe,GAAOpE,EAAMuC,KAAKa,UAAW,GACtB4F,EAAQ,WACb,KAAM5J,eAAgB4J,IAAQ,MAAOD,GAAKxE,MAAMpC,EAASiC,EAAKnE,OAAOD,EAAMuC,KAAKa,YAChF0F,
GAAKpJ,UAAYqJ,EAAKrJ,SACtB,IAAIuJ,GAAO,GAAIH,EACfA,GAAKpJ,UAAY,IACjB,IAAI+D,GAASsF,EAAKxE,MAAM0E,EAAM7E,EAAKnE,OAAOD,EAAMuC,KAAKa,YACrD,OAAIxD,QAAO6D,KAAYA,EAAeA,EAC/BwF,IAMX3J,EAAE4J,QAAU,SAASH,GACnB,GAAI3E,GAAOpE,EAAMuC,KAAKa,UAAW,EACjC,OAAO,YACL,MAAO2F,GAAKxE,MAAMnF,KAAMgF,EAAKnE,OAAOD,EAAMuC,KAAKa,eAMnD9D,EAAE6J,QAAU,SAASvH,GACnB,GAAIwH,GAAQpJ,EAAMuC,KAAKa,UAAW,EAClC,IAAqB,IAAjBgG,EAAMhH,OAAc,KAAM,IAAIiH,OAAM,wCAExC,OADApH,GAAKmH,EAAO,SAASE,GAAK1H,EAAI0H,GAAKhK,EAAEqC,KAAKC,EAAI0H,GAAI1H,KAC3CA,GAITtC,EAAEiK,QAAU,SAASR,EAAMS,GACzB,GAAItG,KAEJ,OADAsG,KAAWA,EAASlK,EAAEwE,UACf,WACL,GAAItB,GAAMgH,EAAOjF,MAAMnF,KAAMgE,UAC7B,OAAO9D,GAAEmD,IAAIS,EAAMV,GAAOU,EAAKV,GAAQU,EAAKV,GAAOuG,EAAKxE,MAAMnF,KAAMgE,aAMxE9D,EAAEmK,MAAQ,SAASV,EAAMW,GACvB,GAAItF,GAAOpE,EAAMuC,KAAKa,UAAW,EACjC,OAAOuG,YAAW,WAAY,MAAOZ,GAAKxE,MAAM,KAAMH,IAAUsF,IAKlEpK,EAAEsK,MAAQ,SAASb,GACjB,MAAOzJ,GAAEmK,MAAMlF,MAAMjF,GAAIyJ,EAAM,GAAG9I,OAAOD,EAAMuC,KAAKa,UAAW,MAQjE9D,EAAEuK,SAAW,SAASd,EAAMW,EAAMI,GAChC,GAAI3H,GAASiC,EAA
MX,EACfsG,EAAU,KACVC,EAAW,CACfF,KAAYA,KACZ,IAAIG,GAAQ,WACVD,EAAWF,EAAQI,WAAY,EAAQ,EAAI,GAAIC,MAC/CJ,EAAU,KACVtG,EAASsF,EAAKxE,MAAMpC,EAASiC,GAE/B,OAAO,YACL,GAAIgG,GAAM,GAAID,KACTH,IAAYF,EAAQI,WAAY,IAAOF,EAAWI,EACvD,IAAIC,GAAYX,GAAQU,EAAMJ,EAW9B,OAVA7H,GAAU/C,KACVgF,EAAOhB,UACU,GAAbiH,GACFC,aAAaP,GACbA,EAAU,KACVC,EAAWI,EACX3G,EAASsF,EAAKxE,MAAMpC,EAASiC,IACnB2F,GAAWD,EAAQS,YAAa,IAC1CR,EAAUJ,WAAWM,EAAOI,IAEvB5G,IAQXnE,EAAEkL,SAAW,SAASzB,EAAMW,EAAMe,GAChC,GAAIhH,GACAsG,EAAU,IACd,OAAO,YACL,GAAI5H,GAAU/C,KAAMgF,EAAOhB,UACvB6G,EAAQ,WACVF,EAAU,KACLU,IAAWhH,EAASsF,EAAKxE,MAAMpC,EAASiC,KAE3CsG,EAAUD,IAAcV,CAI5B,OAHAO,cAAaP,GACbA,EAAUJ,WAAWM,EAAOP,GACxBgB,IAASjH,EAASsF,EAAKxE,MAAMpC,EAASiC,IACnCX,IAMXnE,EAAEqL,KAAO,SAAS5B,GAChB,GAAiB7F,GAAb0H,GAAM,CACV,OAAO,YACL,MAAIA,GAAY1H,GAChB0H,GAAM,EACN1H,EAAO6F,EAAKxE,MAAMnF,KAAMgE,WACxB2F,EAAO,KACA7F,KAOX5D,EAAEuL,KAAO,SAAS9B,EAAM+B,GACtB,MAAO,YACL,GAAI1G,IAAQ2E,EAEZ,OADAhJ,GAAKwE,MAAMH,EAAMhB,WACV0H,EAAQvG,MAAMnF,KAAMgF,KAM/B9E,EAAEyL,QAAU,WACV,GAAI3
B,GAAQhG,SACZ,OAAO,YAEL,IAAK,GADDgB,GAAOhB,UACFf,EAAI+G,EAAMhH,OAAS,EAAGC,GAAK,EAAGA,IACrC+B,GAAQgF,EAAM/G,GAAGkC,MAAMnF,KAAMgF,GAE/B,OAAOA,GAAK,KAKhB9E,EAAE0L,MAAQ,SAASC,EAAOlC,GACxB,MAAO,YACL,QAAMkC,EAAQ,EACLlC,EAAKxE,MAAMnF,KAAMgE,WAD1B,SAWJ9D,EAAEmC,KAAOD,GAAc,SAASI,GAC9B,GAAIA,IAAQhC,OAAOgC,GAAM,KAAM,IAAIyB,WAAU,iBAC7C,IAAI5B,KACJ,KAAK,GAAIe,KAAOZ,GAAStC,EAAEmD,IAAIb,EAAKY,IAAMf,EAAK1B,KAAKyC,EACpD,OAAOf,IAITnC,EAAEmH,OAAS,SAAS7E,GAClB,GAAI6E,KACJ,KAAK,GAAIjE,KAAOZ,GAAStC,EAAEmD,IAAIb,EAAKY,IAAMiE,EAAO1G,KAAK6B,EAAIY,GAC1D,OAAOiE,IAITnH,EAAE4L,MAAQ,SAAStJ,GACjB,GAAIsJ,KACJ,KAAK,GAAI1I,KAAOZ,GAAStC,EAAEmD,IAAIb,EAAKY,IAAM0I,EAAMnL,MAAMyC,EAAKZ,EAAIY,IAC/D,OAAO0I,IAIT5L,EAAE6L,OAAS,SAASvJ,GAClB,GAAI6B,KACJ,KAAK,GAAIjB,KAAOZ,GAAStC,EAAEmD,IAAIb,EAAKY,KAAMiB,EAAO7B,EAAIY,IAAQA,EAC7D,OAAOiB,IAKTnE,EAAE8L,UAAY9L,EAAE+L,QAAU,SAASzJ,GACjC,GAAI0J,KACJ,KAAK,GAAI9I,KAAOZ,GACVtC,EAAEgF,WAAW1C,EAAIY,KAAO8I,EAAMvL,KAAKyC,EAEzC,OAAO8I,GAAM5F,QAIfpG,EAAEiM,OAAS,SAAS3J,GAQlB,MAPAK,GAAKjC,EAAMuC
,KAAKa,UAAW,GAAI,SAASoI,GACtC,GAAIA,EACF,IAAK,GAAIC,KAAQD,GACf5J,EAAI6J,GAAQD,EAAOC,KAIlB7J,GAITtC,EAAEoM,KAAO,SAAS9J,GAChB,GAAI+J,MACAlK,EAAOxB,EAAOsE,MAAM/E,EAAYQ,EAAMuC,KAAKa,UAAW,GAI1D,OAHAnB,GAAKR,EAAM,SAASe,GACdA,IAAOZ,KAAK+J,EAAKnJ,GAAOZ,EAAIY,MAE3BmJ,GAITrM,EAAEsM,KAAO,SAAShK,GAChB,GAAI+J,MACAlK,EAAOxB,EAAOsE,MAAM/E,EAAYQ,EAAMuC,KAAKa,UAAW,GAC1D,KAAK,GAAIZ,KAAOZ,GACTtC,EAAEyE,SAAStC,EAAMe,KAAMmJ,EAAKnJ,GAAOZ,EAAIY,GAE9C,OAAOmJ,IAITrM,EAAEuM,SAAW,SAASjK,GAQpB,MAPAK,GAAKjC,EAAMuC,KAAKa,UAAW,GAAI,SAASoI,GACtC,GAAIA,EACF,IAAK,GAAIC,KAAQD,GACX5J,EAAI6J,SAAe,KAAG7J,EAAI6J,GAAQD,EAAOC,MAI5C7J,GAITtC,EAAEwM,MAAQ,SAASlK,GACjB,MAAKtC,GAAEyM,SAASnK,GACTtC,EAAEiC,QAAQK,GAAOA,EAAI5B,QAAUV,EAAEiM,UAAW3J,GADtBA,GAO/BtC,EAAE0M,IAAM,SAASpK,EAAKqK,GAEpB,MADAA,GAAYrK,GACLA,EAIT,IAAIsK,GAAK,SAASrG,EAAGC,EAAGqG,EAAQC,GAG9B,GAAIvG,IAAMC,EAAG,MAAa,KAAND,GAAW,EAAIA,GAAK,EAAIC,CAE5C,IAAS,MAALD,GAAkB,MAALC,EAAW,MAAOD,KAAMC,CAErCD,aAAavG,KAAGuG,EAAIA,EAAEhE,UACtBiE,YAAaxG,KAAGwG,EAAIA,EAAEjE,SAE1B,IAA
IwK,GAAYnM,EAASqC,KAAKsD,EAC9B,IAAIwG,GAAanM,EAASqC,KAAKuD,GAAI,OAAO,CAC1C,QAAQuG,GAEN,IAAK,kBAGH,MAAOxG,IAAKyG,OAAOxG,EACrB,KAAK,kBAGH,MAAOD,KAAMA,EAAIC,IAAMA,EAAU,GAALD,EAAS,EAAIA,GAAK,EAAIC,EAAID,IAAMC,CAC9D,KAAK,gBACL,IAAK,mBAIH,OAAQD,IAAMC,CAEhB,KAAK,kBACH,MAAOD,GAAE2F,QAAU1F,EAAE0F,QACd3F,EAAE0G,QAAUzG,EAAEyG,QACd1G,EAAE2G,WAAa1G,EAAE0G,WACjB3G,EAAE4G,YAAc3G,EAAE2G,WAE7B,GAAgB,gBAAL5G,IAA6B,gBAALC,GAAe,OAAO,CAIzD,KADA,GAAI1D,GAAS+J,EAAO/J,OACbA,KAGL,GAAI+J,EAAO/J,IAAWyD,EAAG,MAAOuG,GAAOhK,IAAW0D,CAIpD,IAAI4G,GAAQ7G,EAAE8G,YAAaC,EAAQ9G,EAAE6G,WACrC,IAAID,IAAUE,KAAWtN,EAAEgF,WAAWoI,IAAWA,YAAiBA,IACzCpN,EAAEgF,WAAWsI,IAAWA,YAAiBA,IAChE,OAAO,CAGTT,GAAOpM,KAAK8F,GACZuG,EAAOrM,KAAK+F,EACZ,IAAIY,GAAO,EAAGjD,GAAS,CAEvB,IAAiB,kBAAb4I,GAIF,GAFA3F,EAAOb,EAAEzD,OACTqB,EAASiD,GAAQZ,EAAE1D,OAGjB,KAAOsE,MACCjD,EAASyI,EAAGrG,EAAEa,GAAOZ,EAAEY,GAAOyF,EAAQC,WAG3C,CAEL,IAAK,GAAI5J,KAAOqD,GACd,GAAIvG,EAAEmD,IAAIoD,EAAGrD,KAEXkE,MAEMjD,EAASnE,EAAEmD,IAAIqD,EAAGtD,IAAQ0J,EAAGrG,EAAErD,GAAMsD,EAAEtD
,GAAM2J,EAAQC,KAAU,KAIzE,IAAI3I,EAAQ,CACV,IAAKjB,IAAOsD,GACV,GAAIxG,EAAEmD,IAAIqD,EAAGtD,KAAUkE,IAAS,KAElCjD,IAAUiD,GAMd,MAFAyF,GAAOU,MACPT,EAAOS,MACApJ,EAITnE,GAAEwN,QAAU,SAASjH,EAAGC,GACtB,MAAOoG,GAAGrG,EAAGC,UAKfxG,EAAEsF,QAAU,SAAShD,GACnB,GAAW,MAAPA,EAAa,OAAO,CACxB,IAAItC,EAAEiC,QAAQK,IAAQtC,EAAEyN,SAASnL,GAAM,MAAsB,KAAfA,EAAIQ,MAClD,KAAK,GAAII,KAAOZ,GAAK,GAAItC,EAAEmD,IAAIb,EAAKY,GAAM,OAAO,CACjD,QAAO,GAITlD,EAAE0N,UAAY,SAASpL,GACrB,SAAUA,GAAwB,IAAjBA,EAAIqL,WAKvB3N,EAAEiC,QAAUD,GAAiB,SAASM,GACpC,MAA6B,kBAAtB1B,EAASqC,KAAKX,IAIvBtC,EAAEyM,SAAW,SAASnK,GACpB,MAAOA,KAAQhC,OAAOgC,IAIxBK,GAAM,YAAa,WAAY,SAAU,SAAU,OAAQ,UAAW,SAASiL,GAC7E5N,EAAE,KAAO4N,GAAQ,SAAStL,GACxB,MAAO1B,GAASqC,KAAKX,IAAQ,WAAasL,EAAO,OAMhD5N,EAAEkI,YAAYpE,aACjB9D,EAAEkI,YAAc,SAAS5F,GACvB,SAAUA,IAAOtC,EAAEmD,IAAIb,EAAK,aAKX,kBAAV,MACTtC,EAAEgF,WAAa,SAAS1C,GACtB,MAAsB,kBAARA,KAKlBtC,EAAE6N,SAAW,SAASvL,GACpB,MAAOuL,UAASvL,KAASwL,MAAMC,WAAWzL,KAI5CtC,EAAE8N,MAAQ,SAASxL,GACjB,MAAOtC,GAAEgO,SAAS1L,IAAQA,IAAQA,GAIpCtC,EAA
EiO,UAAY,SAAS3L,GACrB,MAAOA,MAAQ,GAAQA,KAAQ,GAA+B,oBAAtB1B,EAASqC,KAAKX,IAIxDtC,EAAEkO,OAAS,SAAS5L,GAClB,MAAe,QAARA,GAITtC,EAAEmO,YAAc,SAAS7L,GACvB,MAAOA,SAAa,IAKtBtC,EAAEmD,IAAM,SAASb,EAAKY,GACpB,MAAOrC,GAAeoC,KAAKX,EAAKY,IAQlClD,EAAEoO,WAAa,WAEb,MADAvO,GAAKG,EAAID,EACFD,MAITE,EAAEwE,SAAW,SAASlB,GACpB,MAAOA,IAITtD,EAAE2L,MAAQ,SAASpE,EAAG3E,EAAUC,GAE9B,IAAK,GADDwL,GAAQlO,MAAMsF,KAAKD,IAAI,EAAG+B,IACrBxE,EAAI,EAAOwE,EAAJxE,EAAOA,IAAKsL,EAAMtL,GAAKH,EAASK,KAAKJ,EAASE,EAC9D,OAAOsL,IAITrO,EAAEgG,OAAS,SAASJ,EAAKJ,GAKvB,MAJW,OAAPA,IACFA,EAAMI,EACNA,EAAM,GAEDA,EAAMH,KAAK6I,MAAM7I,KAAKO,UAAYR,EAAMI,EAAM,IAIvD,IAAI2I,IACFC,QACEC,IAAK,QACLC,IAAK,OACLC,IAAK,OACLC,IAAK,SACLC,IAAK,SACLC,IAAK,UAGTP,GAAUQ,SAAW/O,EAAE6L,OAAO0C,EAAUC,OAGxC,IAAIQ,IACFR,OAAU,GAAIS,QAAO,IAAMjP,EAAEmC,KAAKoM,EAAUC,QAAQU,KAAK,IAAM,IAAK,KACpEH,SAAU,GAAIE,QAAO,IAAMjP,EAAEmC,KAAKoM,EAAUQ,UAAUG,KAAK,KAAO,IAAK,KAIzElP,GAAE2C,MAAM,SAAU,YAAa,SAASkC,GACtC7E,EAAE6E,GAAU,SAASsK,GACnB,MAAc,OAAVA,EAAuB,IACnB,GAAKA,GAAQC,QAAQJ,EAAcnK
,GAAS,SAASwK,GAC3D,MAAOd,GAAU1J,GAAQwK,QAO/BrP,EAAEmE,OAAS,SAAS2E,EAAQwG,GAC1B,GAAc,MAAVxG,EAAgB,WAAY,EAChC,IAAIxF,GAAQwF,EAAOwG,EACnB,OAAOtP,GAAEgF,WAAW1B,GAASA,EAAML,KAAK6F,GAAUxF,GAIpDtD,EAAEuP,MAAQ,SAASjN,GACjBK,EAAK3C,EAAE8L,UAAUxJ,GAAM,SAASsL,GAC9B,GAAInE,GAAOzJ,EAAE4N,GAAQtL,EAAIsL,EACzB5N,GAAEI,UAAUwN,GAAQ,WAClB,GAAI9I,IAAQhF,KAAKyC,SAEjB,OADA9B,GAAKwE,MAAMH,EAAMhB,WACVK,EAAOlB,KAAKnD,KAAM2J,EAAKxE,MAAMjF,EAAG8E,OAO7C,IAAI0K,GAAY,CAChBxP,GAAEyP,SAAW,SAASC,GACpB,GAAIC,KAAOH,EAAY,EACvB,OAAOE,GAASA,EAASC,EAAKA,GAKhC3P,EAAE4P,kBACAC,SAAc,kBACdC,YAAc,mBACdtB,OAAc,mBAMhB,IAAIuB,GAAU,OAIVC,GACFnB,IAAU,IACVoB,KAAU,KACVC,KAAU,IACVC,KAAU,IACVC,IAAU,IACVC,SAAU,QACVC,SAAU,SAGRC,EAAU,8BAKdvQ,GAAEwQ,SAAW,SAASC,EAAMC,EAAMC,GAChC,GAAIC,EACJD,GAAW3Q,EAAEuM,YAAaoE,EAAU3Q,EAAE4P,iBAGtC,IAAIiB,GAAU,GAAI5B,UACf0B,EAASnC,QAAUuB,GAAS7D,QAC5ByE,EAASb,aAAeC,GAAS7D,QACjCyE,EAASd,UAAYE,GAAS7D,QAC/BgD,KAAK,KAAO,KAAM,KAGhB3L,EAAQ,EACR2I,EAAS,QACbuE,GAAKrB,QAAQyB,EAAS,SAASxB,EAAOb,EAAQsB,EAAaD,EAAUiB,GAc
nE,MAbA5E,IAAUuE,EAAK/P,MAAM6C,EAAOuN,GACzB1B,QAAQmB,EAAS,SAASlB,GAAS,MAAO,KAAOW,EAAQX,KAExDb,IACFtC,GAAU,cAAgBsC,EAAS,kCAEjCsB,IACF5D,GAAU,cAAgB4D,EAAc,wBAEtCD,IACF3D,GAAU,OAAS2D,EAAW,YAEhCtM,EAAQuN,EAASzB,EAAMvM,OAChBuM,IAETnD,GAAU,OAGLyE,EAASI,WAAU7E,EAAS,mBAAqBA,EAAS,OAE/DA,EAAS,2CACP,oDACAA,EAAS,eAEX,KACE0E,EAAS,GAAIpQ,UAASmQ,EAASI,UAAY,MAAO,IAAK7E,GACvD,MAAO8E,GAEP,KADAA,GAAE9E,OAASA,EACL8E,EAGR,GAAIN,EAAM,MAAOE,GAAOF,EAAM1Q,EAC9B,IAAIwQ,GAAW,SAASE,GACtB,MAAOE,GAAO3N,KAAKnD,KAAM4Q,EAAM1Q,GAMjC,OAFAwQ,GAAStE,OAAS,aAAeyE,EAASI,UAAY,OAAS,OAAS7E,EAAS,IAE1EsE,GAITxQ,EAAEiR,MAAQ,SAAS3O,GACjB,MAAOtC,GAAEsC,GAAK2O,QAUhB,IAAI9M,GAAS,SAAS7B,GACpB,MAAOxC,MAAKoR,OAASlR,EAAEsC,GAAK2O,QAAU3O,EAIxCtC,GAAEuP,MAAMvP,GAGR2C,GAAM,MAAO,OAAQ,UAAW,QAAS,OAAQ,SAAU,WAAY,SAASiL,GAC9E,GAAI/I,GAAS3E,EAAW0N,EACxB5N,GAAEI,UAAUwN,GAAQ,WAClB,GAAItL,GAAMxC,KAAKyC,QAGf,OAFAsC,GAAOI,MAAM3C,EAAKwB,WACL,SAAR8J,GAA2B,UAARA,GAAoC,IAAftL,EAAIQ,cAAqBR,GAAI,GACnE6B,EAAOlB,KAAKnD,KAAMwC,MAK7BK,GAAM,SAAU,OAAQ,SAAU,SAASi
L,GACzC,GAAI/I,GAAS3E,EAAW0N,EACxB5N,GAAEI,UAAUwN,GAAQ,WAClB,MAAOzJ,GAAOlB,KAAKnD,KAAM+E,EAAOI,MAAMnF,KAAKyC,SAAUuB,eAIzD9D,EAAEiM,OAAOjM,EAAEI,WAGT6Q,MAAO,WAEL,MADAnR,MAAKoR,QAAS,EACPpR,MAITwD,MAAO,WACL,MAAOxD,MAAKyC,aAKfU,KAAKnD"}
\ No newline at end of file
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore.js
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore.js b/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore.js
new file mode 100644
index 0000000..7d4ee27
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/underscore/underscore.js
@@ -0,0 +1,1246 @@
+// Underscore.js 1.5.1
+// http://underscorejs.org
+// (c) 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+// Underscore may be freely distributed under the MIT license.
+
+(function() {
+
+ // Baseline setup
+ // --------------
+
+ // Establish the root object, `window` in the browser, or `global` on the server.
+ var root = this;
+
+ // Save the previous value of the `_` variable.
+ var previousUnderscore = root._;
+
+ // Establish the object that gets returned to break out of a loop iteration.
+ var breaker = {};
+
+ // Save bytes in the minified (but not gzipped) version:
+ var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
+
+ // Create quick reference variables for speed access to core prototypes.
+ var
+ push = ArrayProto.push,
+ slice = ArrayProto.slice,
+ concat = ArrayProto.concat,
+ toString = ObjProto.toString,
+ hasOwnProperty = ObjProto.hasOwnProperty;
+
+ // All **ECMAScript 5** native function implementations that we hope to use
+ // are declared here.
+ var
+ nativeForEach = ArrayProto.forEach,
+ nativeMap = ArrayProto.map,
+ nativeReduce = ArrayProto.reduce,
+ nativeReduceRight = ArrayProto.reduceRight,
+ nativeFilter = ArrayProto.filter,
+ nativeEvery = ArrayProto.every,
+ nativeSome = ArrayProto.some,
+ nativeIndexOf = ArrayProto.indexOf,
+ nativeLastIndexOf = ArrayProto.lastIndexOf,
+ nativeIsArray = Array.isArray,
+ nativeKeys = Object.keys,
+ nativeBind = FuncProto.bind;
+
+ // Create a safe reference to the Underscore object for use below.
+ var _ = function(obj) {
+ if (obj instanceof _) return obj;
+ if (!(this instanceof _)) return new _(obj);
+ this._wrapped = obj;
+ };
+
+ // Export the Underscore object for **Node.js**, with
+ // backwards-compatibility for the old `require()` API. If we're in
+ // the browser, add `_` as a global object via a string identifier,
+ // for Closure Compiler "advanced" mode.
+ if (typeof exports !== 'undefined') {
+ if (typeof module !== 'undefined' && module.exports) {
+ exports = module.exports = _;
+ }
+ exports._ = _;
+ } else {
+ root._ = _;
+ }
+
+ // Current version.
+ _.VERSION = '1.5.1';
+
+ // Collection Functions
+ // --------------------
+
+ // The cornerstone, an `each` implementation, aka `forEach`.
+ // Handles objects with the built-in `forEach`, arrays, and raw objects.
+ // Delegates to **ECMAScript 5**'s native `forEach` if available.
+ var each = _.each = _.forEach = function(obj, iterator, context) {
+ if (obj == null) return;
+ if (nativeForEach && obj.forEach === nativeForEach) {
+ obj.forEach(iterator, context);
+ } else if (obj.length === +obj.length) {
+ for (var i = 0, l = obj.length; i < l; i++) {
+ if (iterator.call(context, obj[i], i, obj) === breaker) return;
+ }
+ } else {
+ for (var key in obj) {
+ if (_.has(obj, key)) {
+ if (iterator.call(context, obj[key], key, obj) === breaker) return;
+ }
+ }
+ }
+ };
+
+ // Return the results of applying the iterator to each element.
+ // Delegates to **ECMAScript 5**'s native `map` if available.
+ _.map = _.collect = function(obj, iterator, context) {
+ var results = [];
+ if (obj == null) return results;
+ if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context);
+ each(obj, function(value, index, list) {
+ results.push(iterator.call(context, value, index, list));
+ });
+ return results;
+ };
+
+ var reduceError = 'Reduce of empty array with no initial value';
+
+ // **Reduce** builds up a single result from a list of values, aka `inject`,
+ // or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available.
+ _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) {
+ var initial = arguments.length > 2;
+ if (obj == null) obj = [];
+ if (nativeReduce && obj.reduce === nativeReduce) {
+ if (context) iterator = _.bind(iterator, context);
+ return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator);
+ }
+ each(obj, function(value, index, list) {
+ if (!initial) {
+ memo = value;
+ initial = true;
+ } else {
+ memo = iterator.call(context, memo, value, index, list);
+ }
+ });
+ if (!initial) throw new TypeError(reduceError);
+ return memo;
+ };
+
+ // The right-associative version of reduce, also known as `foldr`.
+ // Delegates to **ECMAScript 5**'s native `reduceRight` if available.
+ _.reduceRight = _.foldr = function(obj, iterator, memo, context) {
+ var initial = arguments.length > 2;
+ if (obj == null) obj = [];
+ if (nativeReduceRight && obj.reduceRight === nativeReduceRight) {
+ if (context) iterator = _.bind(iterator, context);
+ return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
+ }
+ var length = obj.length;
+ if (length !== +length) {
+ var keys = _.keys(obj);
+ length = keys.length;
+ }
+ each(obj, function(value, index, list) {
+ index = keys ? keys[--length] : --length;
+ if (!initial) {
+ memo = obj[index];
+ initial = true;
+ } else {
+ memo = iterator.call(context, memo, obj[index], index, list);
+ }
+ });
+ if (!initial) throw new TypeError(reduceError);
+ return memo;
+ };
+
+ // Return the first value which passes a truth test. Aliased as `detect`.
+ _.find = _.detect = function(obj, iterator, context) {
+ var result;
+ any(obj, function(value, index, list) {
+ if (iterator.call(context, value, index, list)) {
+ result = value;
+ return true;
+ }
+ });
+ return result;
+ };
+
+ // Return all the elements that pass a truth test.
+ // Delegates to **ECMAScript 5**'s native `filter` if available.
+ // Aliased as `select`.
+ _.filter = _.select = function(obj, iterator, context) {
+ var results = [];
+ if (obj == null) return results;
+ if (nativeFilter && obj.filter === nativeFilter) return obj.filter(iterator, context);
+ each(obj, function(value, index, list) {
+ if (iterator.call(context, value, index, list)) results.push(value);
+ });
+ return results;
+ };
+
+ // Return all the elements for which a truth test fails.
+ _.reject = function(obj, iterator, context) {
+ return _.filter(obj, function(value, index, list) {
+ return !iterator.call(context, value, index, list);
+ }, context);
+ };
+
+ // Determine whether all of the elements match a truth test.
+ // Delegates to **ECMAScript 5**'s native `every` if available.
+ // Aliased as `all`.
+ _.every = _.all = function(obj, iterator, context) {
+ iterator || (iterator = _.identity);
+ var result = true;
+ if (obj == null) return result;
+ if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context);
+ each(obj, function(value, index, list) {
+ if (!(result = result && iterator.call(context, value, index, list))) return breaker;
+ });
+ return !!result;
+ };
+
+ // Determine if at least one element in the object matches a truth test.
+ // Delegates to **ECMAScript 5**'s native `some` if available.
+ // Aliased as `any`.
+ var any = _.some = _.any = function(obj, iterator, context) {
+ iterator || (iterator = _.identity);
+ var result = false;
+ if (obj == null) return result;
+ if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context);
+ each(obj, function(value, index, list) {
+ if (result || (result = iterator.call(context, value, index, list))) return breaker;
+ });
+ return !!result;
+ };
+
+ // Determine if the array or object contains a given value (using `===`).
+ // Aliased as `include`.
+ _.contains = _.include = function(obj, target) {
+ if (obj == null) return false;
+ if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1;
+ return any(obj, function(value) {
+ return value === target;
+ });
+ };
+
+ // Invoke a method (with arguments) on every item in a collection.
+ _.invoke = function(obj, method) {
+ var args = slice.call(arguments, 2);
+ var isFunc = _.isFunction(method);
+ return _.map(obj, function(value) {
+ return (isFunc ? method : value[method]).apply(value, args);
+ });
+ };
+
+ // Convenience version of a common use case of `map`: fetching a property.
+ _.pluck = function(obj, key) {
+ return _.map(obj, function(value){ return value[key]; });
+ };
+
+ // Convenience version of a common use case of `filter`: selecting only objects
+ // containing specific `key:value` pairs.
+ _.where = function(obj, attrs, first) {
+ if (_.isEmpty(attrs)) return first ? void 0 : [];
+ return _[first ? 'find' : 'filter'](obj, function(value) {
+ for (var key in attrs) {
+ if (attrs[key] !== value[key]) return false;
+ }
+ return true;
+ });
+ };
+
+ // Convenience version of a common use case of `find`: getting the first object
+ // containing specific `key:value` pairs.
+ _.findWhere = function(obj, attrs) {
+ return _.where(obj, attrs, true);
+ };
+
+ // Return the maximum element or (element-based computation).
+ // Can't optimize arrays of integers longer than 65,535 elements.
+ // See [WebKit Bug 80797](https://bugs.webkit.org/show_bug.cgi?id=80797)
+ _.max = function(obj, iterator, context) {
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+ return Math.max.apply(Math, obj);
+ }
+ if (!iterator && _.isEmpty(obj)) return -Infinity;
+ var result = {computed : -Infinity, value: -Infinity};
+ each(obj, function(value, index, list) {
+ var computed = iterator ? iterator.call(context, value, index, list) : value;
+ computed > result.computed && (result = {value : value, computed : computed});
+ });
+ return result.value;
+ };
+
+ // Return the minimum element (or element-based computation).
+ _.min = function(obj, iterator, context) {
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+ return Math.min.apply(Math, obj);
+ }
+ if (!iterator && _.isEmpty(obj)) return Infinity;
+ var result = {computed : Infinity, value: Infinity};
+ each(obj, function(value, index, list) {
+ var computed = iterator ? iterator.call(context, value, index, list) : value;
+ computed < result.computed && (result = {value : value, computed : computed});
+ });
+ return result.value;
+ };
+
+ // Shuffle an array.
+ _.shuffle = function(obj) {
+ var rand;
+ var index = 0;
+ var shuffled = [];
+ each(obj, function(value) {
+ rand = _.random(index++);
+ shuffled[index - 1] = shuffled[rand];
+ shuffled[rand] = value;
+ });
+ return shuffled;
+ };
+
+ // An internal function to generate lookup iterators.
+ var lookupIterator = function(value) {
+ return _.isFunction(value) ? value : function(obj){ return obj[value]; };
+ };
+
+ // Sort the object's values by a criterion produced by an iterator.
+ _.sortBy = function(obj, value, context) {
+ var iterator = lookupIterator(value);
+ return _.pluck(_.map(obj, function(value, index, list) {
+ return {
+ value : value,
+ index : index,
+ criteria : iterator.call(context, value, index, list)
+ };
+ }).sort(function(left, right) {
+ var a = left.criteria;
+ var b = right.criteria;
+ if (a !== b) {
+ if (a > b || a === void 0) return 1;
+ if (a < b || b === void 0) return -1;
+ }
+ return left.index < right.index ? -1 : 1;
+ }), 'value');
+ };
+
+ // An internal function used for aggregate "group by" operations.
+ var group = function(obj, value, context, behavior) {
+ var result = {};
+ var iterator = lookupIterator(value == null ? _.identity : value);
+ each(obj, function(value, index) {
+ var key = iterator.call(context, value, index, obj);
+ behavior(result, key, value);
+ });
+ return result;
+ };
+
+ // Groups the object's values by a criterion. Pass either a string attribute
+ // to group by, or a function that returns the criterion.
+ _.groupBy = function(obj, value, context) {
+ return group(obj, value, context, function(result, key, value) {
+ (_.has(result, key) ? result[key] : (result[key] = [])).push(value);
+ });
+ };
+
+ // Counts instances of an object that group by a certain criterion. Pass
+ // either a string attribute to count by, or a function that returns the
+ // criterion.
+ _.countBy = function(obj, value, context) {
+ return group(obj, value, context, function(result, key) {
+ if (!_.has(result, key)) result[key] = 0;
+ result[key]++;
+ });
+ };
+
+ // Use a comparator function to figure out the smallest index at which
+ // an object should be inserted so as to maintain order. Uses binary search.
+ _.sortedIndex = function(array, obj, iterator, context) {
+ iterator = iterator == null ? _.identity : lookupIterator(iterator);
+ var value = iterator.call(context, obj);
+ var low = 0, high = array.length;
+ while (low < high) {
+ var mid = (low + high) >>> 1;
+ iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid;
+ }
+ return low;
+ };
+
+ // Safely create a real, live array from anything iterable.
+ _.toArray = function(obj) {
+ if (!obj) return [];
+ if (_.isArray(obj)) return slice.call(obj);
+ if (obj.length === +obj.length) return _.map(obj, _.identity);
+ return _.values(obj);
+ };
+
+ // Return the number of elements in an object.
+ _.size = function(obj) {
+ if (obj == null) return 0;
+ return (obj.length === +obj.length) ? obj.length : _.keys(obj).length;
+ };
+
+ // Array Functions
+ // ---------------
+
+ // Get the first element of an array. Passing **n** will return the first N
+ // values in the array. Aliased as `head` and `take`. The **guard** check
+ // allows it to work with `_.map`.
+ _.first = _.head = _.take = function(array, n, guard) {
+ if (array == null) return void 0;
+ return (n != null) && !guard ? slice.call(array, 0, n) : array[0];
+ };
+
+ // Returns everything but the last entry of the array. Especially useful on
+ // the arguments object. Passing **n** will return all the values in
+ // the array, excluding the last N. The **guard** check allows it to work with
+ // `_.map`.
+ _.initial = function(array, n, guard) {
+ return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n));
+ };
+
+ // Get the last element of an array. Passing **n** will return the last N
+ // values in the array. The **guard** check allows it to work with `_.map`.
+ _.last = function(array, n, guard) {
+ if (array == null) return void 0;
+ if ((n != null) && !guard) {
+ return slice.call(array, Math.max(array.length - n, 0));
+ } else {
+ return array[array.length - 1];
+ }
+ };
+
+ // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
+ // Especially useful on the arguments object. Passing an **n** will return
+ // the rest N values in the array. The **guard**
+ // check allows it to work with `_.map`.
+ _.rest = _.tail = _.drop = function(array, n, guard) {
+ return slice.call(array, (n == null) || guard ? 1 : n);
+ };
+
+ // Trim out all falsy values from an array.
+ _.compact = function(array) {
+ return _.filter(array, _.identity);
+ };
+
+ // Internal implementation of a recursive `flatten` function.
+ var flatten = function(input, shallow, output) {
+ if (shallow && _.every(input, _.isArray)) {
+ return concat.apply(output, input);
+ }
+ each(input, function(value) {
+ if (_.isArray(value) || _.isArguments(value)) {
+ shallow ? push.apply(output, value) : flatten(value, shallow, output);
+ } else {
+ output.push(value);
+ }
+ });
+ return output;
+ };
+
+ // Return a completely flattened version of an array.
+ _.flatten = function(array, shallow) {
+ return flatten(array, shallow, []);
+ };
+
+ // Return a version of the array that does not contain the specified value(s).
+ _.without = function(array) {
+ return _.difference(array, slice.call(arguments, 1));
+ };
+
+ // Produce a duplicate-free version of the array. If the array has already
+ // been sorted, you have the option of using a faster algorithm.
+ // Aliased as `unique`.
+ _.uniq = _.unique = function(array, isSorted, iterator, context) {
+ if (_.isFunction(isSorted)) {
+ context = iterator;
+ iterator = isSorted;
+ isSorted = false;
+ }
+ var initial = iterator ? _.map(array, iterator, context) : array;
+ var results = [];
+ var seen = [];
+ each(initial, function(value, index) {
+ if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) {
+ seen.push(value);
+ results.push(array[index]);
+ }
+ });
+ return results;
+ };
+
+ // Produce an array that contains the union: each distinct element from all of
+ // the passed-in arrays.
+ _.union = function() {
+ return _.uniq(_.flatten(arguments, true));
+ };
+
+ // Produce an array that contains every item shared between all the
+ // passed-in arrays.
+ _.intersection = function(array) {
+ var rest = slice.call(arguments, 1);
+ return _.filter(_.uniq(array), function(item) {
+ return _.every(rest, function(other) {
+ return _.indexOf(other, item) >= 0;
+ });
+ });
+ };
+
+ // Take the difference between one array and a number of other arrays.
+ // Only the elements present in just the first array will remain.
+ _.difference = function(array) {
+ var rest = concat.apply(ArrayProto, slice.call(arguments, 1));
+ return _.filter(array, function(value){ return !_.contains(rest, value); });
+ };
+
+ // Zip together multiple lists into a single array -- elements that share
+ // an index go together.
+ _.zip = function() {
+ var length = _.max(_.pluck(arguments, "length").concat(0));
+ var results = new Array(length);
+ for (var i = 0; i < length; i++) {
+ results[i] = _.pluck(arguments, '' + i);
+ }
+ return results;
+ };
+
+ // Converts lists into objects. Pass either a single array of `[key, value]`
+ // pairs, or two parallel arrays of the same length -- one of keys, and one of
+ // the corresponding values.
+ _.object = function(list, values) {
+ if (list == null) return {};
+ var result = {};
+ for (var i = 0, l = list.length; i < l; i++) {
+ if (values) {
+ result[list[i]] = values[i];
+ } else {
+ result[list[i][0]] = list[i][1];
+ }
+ }
+ return result;
+ };
+
+ // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**),
+ // we need this function. Return the position of the first occurrence of an
+ // item in an array, or -1 if the item is not included in the array.
+ // Delegates to **ECMAScript 5**'s native `indexOf` if available.
+ // If the array is large and already in sort order, pass `true`
+ // for **isSorted** to use binary search.
+ _.indexOf = function(array, item, isSorted) {
+ if (array == null) return -1;
+ var i = 0, l = array.length;
+ if (isSorted) {
+ if (typeof isSorted == 'number') {
+ i = (isSorted < 0 ? Math.max(0, l + isSorted) : isSorted);
+ } else {
+ i = _.sortedIndex(array, item);
+ return array[i] === item ? i : -1;
+ }
+ }
+ if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted);
+ for (; i < l; i++) if (array[i] === item) return i;
+ return -1;
+ };
+
+ // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available.
+ _.lastIndexOf = function(array, item, from) {
+ if (array == null) return -1;
+ var hasIndex = from != null;
+ if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) {
+ return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item);
+ }
+ var i = (hasIndex ? from : array.length);
+ while (i--) if (array[i] === item) return i;
+ return -1;
+ };
+
+ // Generate an integer Array containing an arithmetic progression. A port of
+ // the native Python `range()` function. See
+ // [the Python documentation](http://docs.python.org/library/functions.html#range).
+ _.range = function(start, stop, step) {
+ if (arguments.length <= 1) {
+ stop = start || 0;
+ start = 0;
+ }
+ step = arguments[2] || 1;
+
+ var len = Math.max(Math.ceil((stop - start) / step), 0);
+ var idx = 0;
+ var range = new Array(len);
+
+ while(idx < len) {
+ range[idx++] = start;
+ start += step;
+ }
+
+ return range;
+ };
+
+ // Function (ahem) Functions
+ // ------------------
+
+ // Reusable constructor function for prototype setting.
+ var ctor = function(){};
+
+ // Create a function bound to a given object (assigning `this`, and arguments,
+ // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
+ // available.
+ _.bind = function(func, context) {
+ var args, bound;
+ if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
+ if (!_.isFunction(func)) throw new TypeError;
+ args = slice.call(arguments, 2);
+ return bound = function() {
+ if (!(this instanceof bound)) return func.apply(context, args.concat(slice.call(arguments)));
+ ctor.prototype = func.prototype;
+ var self = new ctor;
+ ctor.prototype = null;
+ var result = func.apply(self, args.concat(slice.call(arguments)));
+ if (Object(result) === result) return result;
+ return self;
+ };
+ };
+
+ // Partially apply a function by creating a version that has had some of its
+ // arguments pre-filled, without changing its dynamic `this` context.
+ _.partial = function(func) {
+ var args = slice.call(arguments, 1);
+ return function() {
+ return func.apply(this, args.concat(slice.call(arguments)));
+ };
+ };
+
+ // Bind all of an object's methods to that object. Useful for ensuring that
+ // all callbacks defined on an object belong to it.
+ _.bindAll = function(obj) {
+ var funcs = slice.call(arguments, 1);
+ if (funcs.length === 0) throw new Error("bindAll must be passed function names");
+ each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
+ return obj;
+ };
+
+ // Memoize an expensive function by storing its results.
+ _.memoize = function(func, hasher) {
+ var memo = {};
+ hasher || (hasher = _.identity);
+ return function() {
+ var key = hasher.apply(this, arguments);
+ return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
+ };
+ };
+
+ // Delays a function for the given number of milliseconds, and then calls
+ // it with the arguments supplied.
+ _.delay = function(func, wait) {
+ var args = slice.call(arguments, 2);
+ return setTimeout(function(){ return func.apply(null, args); }, wait);
+ };
+
+ // Defers a function, scheduling it to run after the current call stack has
+ // cleared.
+ _.defer = function(func) {
+ return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));
+ };
+
+ // Returns a function, that, when invoked, will only be triggered at most once
+ // during a given window of time. Normally, the throttled function will run
+ // as much as it can, without ever going more than once per `wait` duration;
+ // but if you'd like to disable the execution on the leading edge, pass
+ // `{leading: false}`. To disable execution on the trailing edge, ditto.
+ _.throttle = function(func, wait, options) {
+ var context, args, result;
+ var timeout = null;
+ var previous = 0;
+ options || (options = {});
+ var later = function() {
+ previous = options.leading === false ? 0 : new Date;
+ timeout = null;
+ result = func.apply(context, args);
+ };
+ return function() {
+ var now = new Date;
+ if (!previous && options.leading === false) previous = now;
+ var remaining = wait - (now - previous);
+ context = this;
+ args = arguments;
+ if (remaining <= 0) {
+ clearTimeout(timeout);
+ timeout = null;
+ previous = now;
+ result = func.apply(context, args);
+ } else if (!timeout && options.trailing !== false) {
+ timeout = setTimeout(later, remaining);
+ }
+ return result;
+ };
+ };
+
+ // Returns a function, that, as long as it continues to be invoked, will not
+ // be triggered. The function will be called after it stops being called for
+ // N milliseconds. If `immediate` is passed, trigger the function on the
+ // leading edge, instead of the trailing.
+ _.debounce = function(func, wait, immediate) {
+ var result;
+ var timeout = null;
+ return function() {
+ var context = this, args = arguments;
+ var later = function() {
+ timeout = null;
+ if (!immediate) result = func.apply(context, args);
+ };
+ var callNow = immediate && !timeout;
+ clearTimeout(timeout);
+ timeout = setTimeout(later, wait);
+ if (callNow) result = func.apply(context, args);
+ return result;
+ };
+ };
+
+ // Returns a function that will be executed at most one time, no matter how
+ // often you call it. Useful for lazy initialization.
+ _.once = function(func) {
+ var ran = false, memo;
+ return function() {
+ if (ran) return memo;
+ ran = true;
+ memo = func.apply(this, arguments);
+ func = null;
+ return memo;
+ };
+ };
+
+ // Returns the first function passed as an argument to the second,
+ // allowing you to adjust arguments, run code before and after, and
+ // conditionally execute the original function.
+ _.wrap = function(func, wrapper) {
+ return function() {
+ var args = [func];
+ push.apply(args, arguments);
+ return wrapper.apply(this, args);
+ };
+ };
+
+ // Returns a function that is the composition of a list of functions, each
+ // consuming the return value of the function that follows.
+ _.compose = function() {
+ var funcs = arguments;
+ return function() {
+ var args = arguments;
+ for (var i = funcs.length - 1; i >= 0; i--) {
+ args = [funcs[i].apply(this, args)];
+ }
+ return args[0];
+ };
+ };
+
+ // Returns a function that will only be executed after being called N times.
+ _.after = function(times, func) {
+ return function() {
+ if (--times < 1) {
+ return func.apply(this, arguments);
+ }
+ };
+ };
+
+ // Object Functions
+ // ----------------
+
+ // Retrieve the names of an object's properties.
+ // Delegates to **ECMAScript 5**'s native `Object.keys`
+ _.keys = nativeKeys || function(obj) {
+ if (obj !== Object(obj)) throw new TypeError('Invalid object');
+ var keys = [];
+ for (var key in obj) if (_.has(obj, key)) keys.push(key);
+ return keys;
+ };
+
+ // Retrieve the values of an object's properties.
+ _.values = function(obj) {
+ var values = [];
+ for (var key in obj) if (_.has(obj, key)) values.push(obj[key]);
+ return values;
+ };
+
+ // Convert an object into a list of `[key, value]` pairs.
+ _.pairs = function(obj) {
+ var pairs = [];
+ for (var key in obj) if (_.has(obj, key)) pairs.push([key, obj[key]]);
+ return pairs;
+ };
+
+ // Invert the keys and values of an object. The values must be serializable.
+ _.invert = function(obj) {
+ var result = {};
+ for (var key in obj) if (_.has(obj, key)) result[obj[key]] = key;
+ return result;
+ };
+
+ // Return a sorted list of the function names available on the object.
+ // Aliased as `methods`
+ _.functions = _.methods = function(obj) {
+ var names = [];
+ for (var key in obj) {
+ if (_.isFunction(obj[key])) names.push(key);
+ }
+ return names.sort();
+ };
+
+ // Extend a given object with all the properties in passed-in object(s).
+ _.extend = function(obj) {
+ each(slice.call(arguments, 1), function(source) {
+ if (source) {
+ for (var prop in source) {
+ obj[prop] = source[prop];
+ }
+ }
+ });
+ return obj;
+ };
+
+ // Return a copy of the object only containing the whitelisted properties.
+ _.pick = function(obj) {
+ var copy = {};
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+ each(keys, function(key) {
+ if (key in obj) copy[key] = obj[key];
+ });
+ return copy;
+ };
+
+ // Return a copy of the object without the blacklisted properties.
+ _.omit = function(obj) {
+ var copy = {};
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+ for (var key in obj) {
+ if (!_.contains(keys, key)) copy[key] = obj[key];
+ }
+ return copy;
+ };
+
+ // Fill in a given object with default properties.
+ _.defaults = function(obj) {
+ each(slice.call(arguments, 1), function(source) {
+ if (source) {
+ for (var prop in source) {
+ if (obj[prop] === void 0) obj[prop] = source[prop];
+ }
+ }
+ });
+ return obj;
+ };
+
+ // Create a (shallow-cloned) duplicate of an object.
+ _.clone = function(obj) {
+ if (!_.isObject(obj)) return obj;
+ return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
+ };
+
+ // Invokes interceptor with the obj, and then returns obj.
+ // The primary purpose of this method is to "tap into" a method chain, in
+ // order to perform operations on intermediate results within the chain.
+ _.tap = function(obj, interceptor) {
+ interceptor(obj);
+ return obj;
+ };
+
+ // Internal recursive comparison function for `isEqual`.
+ var eq = function(a, b, aStack, bStack) {
+ // Identical objects are equal. `0 === -0`, but they aren't identical.
+ // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
+ if (a === b) return a !== 0 || 1 / a == 1 / b;
+ // A strict comparison is necessary because `null == undefined`.
+ if (a == null || b == null) return a === b;
+ // Unwrap any wrapped objects.
+ if (a instanceof _) a = a._wrapped;
+ if (b instanceof _) b = b._wrapped;
+ // Compare `[[Class]]` names.
+ var className = toString.call(a);
+ if (className != toString.call(b)) return false;
+ switch (className) {
+ // Strings, numbers, dates, and booleans are compared by value.
+ case '[object String]':
+ // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
+ // equivalent to `new String("5")`.
+ return a == String(b);
+ case '[object Number]':
+ // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for
+ // other numeric values.
+ return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b);
+ case '[object Date]':
+ case '[object Boolean]':
+ // Coerce dates and booleans to numeric primitive values. Dates are compared by their
+ // millisecond representations. Note that invalid dates with millisecond representations
+ // of `NaN` are not equivalent.
+ return +a == +b;
+ // RegExps are compared by their source patterns and flags.
+ case '[object RegExp]':
+ return a.source == b.source &&
+ a.global == b.global &&
+ a.multiline == b.multiline &&
+ a.ignoreCase == b.ignoreCase;
+ }
+ if (typeof a != 'object' || typeof b != 'object') return false;
+ // Assume equality for cyclic structures. The algorithm for detecting cyclic
+ // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
+ var length = aStack.length;
+ while (length--) {
+ // Linear search. Performance is inversely proportional to the number of
+ // unique nested structures.
+ if (aStack[length] == a) return bStack[length] == b;
+ }
+ // Objects with different constructors are not equivalent, but `Object`s
+ // from different frames are.
+ var aCtor = a.constructor, bCtor = b.constructor;
+ if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) &&
+ _.isFunction(bCtor) && (bCtor instanceof bCtor))) {
+ return false;
+ }
+ // Add the first object to the stack of traversed objects.
+ aStack.push(a);
+ bStack.push(b);
+ var size = 0, result = true;
+ // Recursively compare objects and arrays.
+ if (className == '[object Array]') {
+ // Compare array lengths to determine if a deep comparison is necessary.
+ size = a.length;
+ result = size == b.length;
+ if (result) {
+ // Deep compare the contents, ignoring non-numeric properties.
+ while (size--) {
+ if (!(result = eq(a[size], b[size], aStack, bStack))) break;
+ }
+ }
+ } else {
+ // Deep compare objects.
+ for (var key in a) {
+ if (_.has(a, key)) {
+ // Count the expected number of properties.
+ size++;
+ // Deep compare each member.
+ if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;
+ }
+ }
+ // Ensure that both objects contain the same number of properties.
+ if (result) {
+ for (key in b) {
+ if (_.has(b, key) && !(size--)) break;
+ }
+ result = !size;
+ }
+ }
+ // Remove the first object from the stack of traversed objects.
+ aStack.pop();
+ bStack.pop();
+ return result;
+ };
+
+ // Perform a deep comparison to check if two objects are equal.
+ _.isEqual = function(a, b) {
+ return eq(a, b, [], []);
+ };
+
+ // Is a given array, string, or object empty?
+ // An "empty" object has no enumerable own-properties.
+ _.isEmpty = function(obj) {
+ if (obj == null) return true;
+ if (_.isArray(obj) || _.isString(obj)) return obj.length === 0;
+ for (var key in obj) if (_.has(obj, key)) return false;
+ return true;
+ };
+
+ // Is a given value a DOM element?
+ _.isElement = function(obj) {
+ return !!(obj && obj.nodeType === 1);
+ };
+
+ // Is a given value an array?
+ // Delegates to ECMA5's native Array.isArray
+ _.isArray = nativeIsArray || function(obj) {
+ return toString.call(obj) == '[object Array]';
+ };
+
+ // Is a given variable an object?
+ _.isObject = function(obj) {
+ return obj === Object(obj);
+ };
+
+ // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp.
+ each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) {
+ _['is' + name] = function(obj) {
+ return toString.call(obj) == '[object ' + name + ']';
+ };
+ });
+
+ // Define a fallback version of the method in browsers (ahem, IE), where
+ // there isn't any inspectable "Arguments" type.
+ if (!_.isArguments(arguments)) {
+ _.isArguments = function(obj) {
+ return !!(obj && _.has(obj, 'callee'));
+ };
+ }
+
+ // Optimize `isFunction` if appropriate.
+ if (typeof (/./) !== 'function') {
+ _.isFunction = function(obj) {
+ return typeof obj === 'function';
+ };
+ }
+
+ // Is a given object a finite number?
+ _.isFinite = function(obj) {
+ return isFinite(obj) && !isNaN(parseFloat(obj));
+ };
+
+ // Is the given value `NaN`? (NaN is the only number which does not equal itself).
+ _.isNaN = function(obj) {
+ return _.isNumber(obj) && obj != +obj;
+ };
+
+ // Is a given value a boolean?
+ _.isBoolean = function(obj) {
+ return obj === true || obj === false || toString.call(obj) == '[object Boolean]';
+ };
+
+ // Is a given value equal to null?
+ _.isNull = function(obj) {
+ return obj === null;
+ };
+
+ // Is a given variable undefined?
+ _.isUndefined = function(obj) {
+ return obj === void 0;
+ };
+
+ // Shortcut function for checking if an object has a given property directly
+ // on itself (in other words, not on a prototype).
+ _.has = function(obj, key) {
+ return hasOwnProperty.call(obj, key);
+ };
+
+ // Utility Functions
+ // -----------------
+
+ // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
+ // previous owner. Returns a reference to the Underscore object.
+ _.noConflict = function() {
+ root._ = previousUnderscore;
+ return this;
+ };
+
+ // Keep the identity function around for default iterators.
+ _.identity = function(value) {
+ return value;
+ };
+
+ // Run a function **n** times.
+ _.times = function(n, iterator, context) {
+ var accum = Array(Math.max(0, n));
+ for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i);
+ return accum;
+ };
+
+ // Return a random integer between min and max (inclusive).
+ _.random = function(min, max) {
+ if (max == null) {
+ max = min;
+ min = 0;
+ }
+ return min + Math.floor(Math.random() * (max - min + 1));
+ };
+
+ // List of HTML entities for escaping.
+ var entityMap = {
+ escape: {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": ''',
+ '/': '/'
+ }
+ };
+ entityMap.unescape = _.invert(entityMap.escape);
+
+ // Regexes containing the keys and values listed immediately above.
+ var entityRegexes = {
+ escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'),
+ unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g')
+ };
+
+ // Functions for escaping and unescaping strings to/from HTML interpolation.
+ _.each(['escape', 'unescape'], function(method) {
+ _[method] = function(string) {
+ if (string == null) return '';
+ return ('' + string).replace(entityRegexes[method], function(match) {
+ return entityMap[method][match];
+ });
+ };
+ });
+
+ // If the value of the named `property` is a function then invoke it with the
+ // `object` as context; otherwise, return it.
+ _.result = function(object, property) {
+ if (object == null) return void 0;
+ var value = object[property];
+ return _.isFunction(value) ? value.call(object) : value;
+ };
+
+ // Add your own custom functions to the Underscore object.
+ _.mixin = function(obj) {
+ each(_.functions(obj), function(name){
+ var func = _[name] = obj[name];
+ _.prototype[name] = function() {
+ var args = [this._wrapped];
+ push.apply(args, arguments);
+ return result.call(this, func.apply(_, args));
+ };
+ });
+ };
+
+ // Generate a unique integer id (unique within the entire client session).
+ // Useful for temporary DOM ids.
+ var idCounter = 0;
+ _.uniqueId = function(prefix) {
+ var id = ++idCounter + '';
+ return prefix ? prefix + id : id;
+ };
+
+ // By default, Underscore uses ERB-style template delimiters, change the
+ // following template settings to use alternative delimiters.
+ _.templateSettings = {
+ evaluate : /<%([\s\S]+?)%>/g,
+ interpolate : /<%=([\s\S]+?)%>/g,
+ escape : /<%-([\s\S]+?)%>/g
+ };
+
+ // When customizing `templateSettings`, if you don't want to define an
+ // interpolation, evaluation or escaping regex, we need one that is
+ // guaranteed not to match.
+ var noMatch = /(.)^/;
+
+ // Certain characters need to be escaped so that they can be put into a
+ // string literal.
+ var escapes = {
+ "'": "'",
+ '\\': '\\',
+ '\r': 'r',
+ '\n': 'n',
+ '\t': 't',
+ '\u2028': 'u2028',
+ '\u2029': 'u2029'
+ };
+
+ var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g;
+
+ // JavaScript micro-templating, similar to John Resig's implementation.
+ // Underscore templating handles arbitrary delimiters, preserves whitespace,
+ // and correctly escapes quotes within interpolated code.
+ _.template = function(text, data, settings) {
+ var render;
+ settings = _.defaults({}, settings, _.templateSettings);
+
+ // Combine delimiters into one regular expression via alternation.
+ var matcher = new RegExp([
+ (settings.escape || noMatch).source,
+ (settings.interpolate || noMatch).source,
+ (settings.evaluate || noMatch).source
+ ].join('|') + '|$', 'g');
+
+ // Compile the template source, escaping string literals appropriately.
+ var index = 0;
+ var source = "__p+='";
+ text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
+ source += text.slice(index, offset)
+ .replace(escaper, function(match) { return '\\' + escapes[match]; });
+
+ if (escape) {
+ source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+ }
+ if (interpolate) {
+ source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+ }
+ if (evaluate) {
+ source += "';\n" + evaluate + "\n__p+='";
+ }
+ index = offset + match.length;
+ return match;
+ });
+ source += "';\n";
+
+ // If a variable is not specified, place data values in local scope.
+ if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
+
+ source = "var __t,__p='',__j=Array.prototype.join," +
+ "print=function(){__p+=__j.call(arguments,'');};\n" +
+ source + "return __p;\n";
+
+ try {
+ render = new Function(settings.variable || 'obj', '_', source);
+ } catch (e) {
+ e.source = source;
+ throw e;
+ }
+
+ if (data) return render(data, _);
+ var template = function(data) {
+ return render.call(this, data, _);
+ };
+
+ // Provide the compiled function source as a convenience for precompilation.
+ template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}';
+
+ return template;
+ };
+
+ // Add a "chain" function, which will delegate to the wrapper.
+ _.chain = function(obj) {
+ return _(obj).chain();
+ };
+
+ // OOP
+ // ---------------
+ // If Underscore is called as a function, it returns a wrapped object that
+ // can be used OO-style. This wrapper holds altered versions of all the
+ // underscore functions. Wrapped objects may be chained.
+
+ // Helper function to continue chaining intermediate results.
+ var result = function(obj) {
+ return this._chain ? _(obj).chain() : obj;
+ };
+
+ // Add all of the Underscore functions to the wrapper object.
+ _.mixin(_);
+
+ // Add all mutator Array functions to the wrapper.
+ each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
+ var method = ArrayProto[name];
+ _.prototype[name] = function() {
+ var obj = this._wrapped;
+ method.apply(obj, arguments);
+ if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0];
+ return result.call(this, obj);
+ };
+ });
+
+ // Add all accessor Array functions to the wrapper.
+ each(['concat', 'join', 'slice'], function(name) {
+ var method = ArrayProto[name];
+ _.prototype[name] = function() {
+ return result.call(this, method.apply(this._wrapped, arguments));
+ };
+ });
+
+ _.extend(_.prototype, {
+
+ // Start chaining a wrapped Underscore object.
+ chain: function() {
+ this._chain = true;
+ return this;
+ },
+
+ // Extracts the result from a wrapped and chained object.
+ value: function() {
+ return this._wrapped;
+ }
+
+ });
+
+}).call(this);
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.jshintignore
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.jshintignore b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.jshintignore
new file mode 100644
index 0000000..aa916f8
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.jshintignore
@@ -0,0 +1,3 @@
+node_modules
+test/dir
+test/comparison
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.npmignore
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.npmignore b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.npmignore
new file mode 100644
index 0000000..042ccf2
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.npmignore
@@ -0,0 +1,2 @@
+node_modules
+*~
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.travis.yml
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.travis.yml b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.travis.yml
new file mode 100644
index 0000000..58f2371
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/.travis.yml
@@ -0,0 +1,5 @@
+language: node_js
+node_js:
+ - 0.6
+ - 0.8
+ - 0.10
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/license
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/license b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/license
new file mode 100644
index 0000000..4e2b3b9
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/license
@@ -0,0 +1,10 @@
+The MIT License (MIT)
+
+Copyright (c) 2012 Ryan Day
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/package.json
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/package.json b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/package.json
new file mode 100644
index 0000000..4ca4d7c
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/package.json
@@ -0,0 +1,45 @@
+{
+ "name": "walkdir",
+ "description": "Find files simply. Walks a directory tree emitting events based on what it finds. Presents a familliar callback/emitter/a+sync interface. Walk a tree of any depth.",
+ "version": "0.0.7",
+ "author": {
+ "name": "Ryan Day",
+ "email": "soldair@gmail.com"
+ },
+ "keywords": [
+ "find",
+ "walk",
+ "tree",
+ "files",
+ "fs"
+ ],
+ "main": "./walkdir.js",
+ "homepage": "http://github.com/soldair/node-walkdir",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/soldair/node-walkdir.git"
+ },
+ "scripts": {
+ "test": "./test.sh"
+ },
+ "devDependencies": {
+ "tap": "*",
+ "jshint": "0.5.x"
+ },
+ "engines": {
+ "node": ">=0.6.0"
+ },
+ "license": "MIT/X11",
+ "contributors": [
+ {
+ "name": "tjfontaine"
+ }
+ ],
+ "readme": "[](http://travis-ci.org/soldair/node-walkdir)\n \n## walkdir\n\nFind files. Walks a directory tree emitting events based on what it finds. Presents a familliar callback/emitter/sync interface. Walk a tree of any depth. This is a performant option any pull requests to make it more so will be talken into consderation.. \n\n## Example\n\n```js\n\nvar walk = require('walkdir');\n\n//async with path callback \n\nwalk('../',function(path,stat){\n console.log('found: ',path);\n});\n\n//use async emitter to capture more events\n\nvar emitter = walk('../');\n\nemitter.on('file',function(filename,stat){\n console.log('file from emitter: ', filename);\n});\n\n\n//sync with callback\n\nwalk.sync('../',function(path,stat){\n console.log('found sync:',path);\n});\n\n//sync just need paths\n\nvar paths = walk.sync('../');\nconsole.log('found paths sync: ',paths);\n\n```\n\n\n## install\n\n\tnpm install walkdir\n\
n## arguments\n\nwalkdir(path, [options], [callback])\nwalkdir.sync(path, [options], [callback]);\n\n- path\n - the starting point of your directory walk\n\n- options. supported options are\n - general\n\n\t```js\n\t{\n\t\"follow_symlinks\":false, // default is off \n\t\"no_recurse\":false, // only recurse one level deep\n\t\"max_depth\":undefined // only recurse down to max_depth. if you need more than no_recurse\n\t}\n\t```\n\n - sync only\n\n\t```js\n\t{\n\t\"return_object\":false, // if true the sync return will be in {path:stat} format instead of [path,path,...]\n\t\"no_return\":false, // if true null will be returned and no array or object will be created with found paths. useful for large listings\n\t}\n\t```\n\n- callback\n - this is bound to the path event of the emitter. its optional in all cases.\n\n\t```js\n\tcallback(path,stat)\n\t```\n\n## events\n\nnon error type events are emitted with (path,stat). stat is an instanceof fs.Stats\n\n###path\nfired for ever
ything\n\n###file\nfired only for regular files\n\n###directory\nfired only for directories\n\n###link\nfired when a symbolic link is found\n\n###end\nfired when the entire tree has been read and emitted.\n\n###socket\nfired when a socket descriptor is found\n\n###fifo\nfired when a fifo is found\n\n###characterdevice\nfired when a character device is found\n\n###blockdevice\nfired when a block device is found\n\n###targetdirectory\nfired for the stat of the path you provided as the first argument. is is only fired if it is a directory.\n\n###empty\nfired for empty directory\n\n## error events\nerror type events are emitted with (path,error). error being the error object returned from an fs call or other opperation.\n\n###error\nif the target path cannot be read an error event is emitted. this is the only failure case.\n\n###fail\nwhen stat or read fails on a path somewhere in the walk and it is not your target path you get a fail event instead of error.\nThis is handy if you want t
o find places you dont have access too.\n\n## notes\nthe async emitter returned supports 3 methods\n\n###end\n stop a walk in progress\n\n###pause\n pause the walk. no more events will be emitted until resume\n\n###resume\n resume the walk\n\n### cancel a walk in progress\n ```js\n //cancel a walk in progress within callback.\n\n var walk = require('walkdir');\n walk('../',function(path,stat){\n this.end();\n });\n\n //cancel a walk in progress with emitter handle\n var walk = require('walkdir');\n var emitter = walk('../');\n\n doSomethingAsync(function(){\n\temitter.end();\n })\n ```\n\n## thanks\nthanks to substack. the interface for this module is based off of node-findit\n\n",
+ "readmeFilename": "readme.md",
+ "bugs": {
+ "url": "https://github.com/soldair/node-walkdir/issues"
+ },
+ "_id": "walkdir@0.0.7",
+ "_from": "walkdir@>= 0.0.1"
+}
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/readme.md
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/readme.md b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/readme.md
new file mode 100644
index 0000000..1b359de
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/readme.md
@@ -0,0 +1,160 @@
+[](http://travis-ci.org/soldair/node-walkdir)
+
+## walkdir
+
+Find files. Walks a directory tree emitting events based on what it finds. Presents a familliar callback/emitter/sync interface. Walk a tree of any depth. This is a performant option any pull requests to make it more so will be talken into consderation..
+
+## Example
+
+```js
+
+var walk = require('walkdir');
+
+//async with path callback
+
+walk('../',function(path,stat){
+ console.log('found: ',path);
+});
+
+//use async emitter to capture more events
+
+var emitter = walk('../');
+
+emitter.on('file',function(filename,stat){
+ console.log('file from emitter: ', filename);
+});
+
+
+//sync with callback
+
+walk.sync('../',function(path,stat){
+ console.log('found sync:',path);
+});
+
+//sync just need paths
+
+var paths = walk.sync('../');
+console.log('found paths sync: ',paths);
+
+```
+
+
+## install
+
+ npm install walkdir
+
+## arguments
+
+walkdir(path, [options], [callback])
+walkdir.sync(path, [options], [callback]);
+
+- path
+ - the starting point of your directory walk
+
+- options. supported options are
+ - general
+
+ ```js
+ {
+ "follow_symlinks":false, // default is off
+ "no_recurse":false, // only recurse one level deep
+ "max_depth":undefined // only recurse down to max_depth. if you need more than no_recurse
+ }
+ ```
+
+ - sync only
+
+ ```js
+ {
+ "return_object":false, // if true the sync return will be in {path:stat} format instead of [path,path,...]
+ "no_return":false, // if true null will be returned and no array or object will be created with found paths. useful for large listings
+ }
+ ```
+
+- callback
+ - this is bound to the path event of the emitter. its optional in all cases.
+
+ ```js
+ callback(path,stat)
+ ```
+
+## events
+
+non error type events are emitted with (path,stat). stat is an instanceof fs.Stats
+
+###path
+fired for everything
+
+###file
+fired only for regular files
+
+###directory
+fired only for directories
+
+###link
+fired when a symbolic link is found
+
+###end
+fired when the entire tree has been read and emitted.
+
+###socket
+fired when a socket descriptor is found
+
+###fifo
+fired when a fifo is found
+
+###characterdevice
+fired when a character device is found
+
+###blockdevice
+fired when a block device is found
+
+###targetdirectory
+fired for the stat of the path you provided as the first argument. is is only fired if it is a directory.
+
+###empty
+fired for empty directory
+
+## error events
+error type events are emitted with (path,error). error being the error object returned from an fs call or other opperation.
+
+###error
+if the target path cannot be read an error event is emitted. this is the only failure case.
+
+###fail
+when stat or read fails on a path somewhere in the walk and it is not your target path you get a fail event instead of error.
+This is handy if you want to find places you dont have access too.
+
+## notes
+the async emitter returned supports 3 methods
+
+###end
+ stop a walk in progress
+
+###pause
+ pause the walk. no more events will be emitted until resume
+
+###resume
+ resume the walk
+
+### cancel a walk in progress
+ ```js
+ //cancel a walk in progress within callback.
+
+ var walk = require('walkdir');
+ walk('../',function(path,stat){
+ this.end();
+ });
+
+ //cancel a walk in progress with emitter handle
+ var walk = require('walkdir');
+ var emitter = walk('../');
+
+ doSomethingAsync(function(){
+ emitter.end();
+ })
+ ```
+
+## thanks
+thanks to substack. the interface for this module is based off of node-findit
+
http://git-wip-us.apache.org/repos/asf/cordova-blackberry/blob/1139813c/blackberry10/node_modules/jasmine-node/node_modules/walkdir/test.sh
----------------------------------------------------------------------
diff --git a/blackberry10/node_modules/jasmine-node/node_modules/walkdir/test.sh b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/test.sh
new file mode 100755
index 0000000..14679f8
--- /dev/null
+++ b/blackberry10/node_modules/jasmine-node/node_modules/walkdir/test.sh
@@ -0,0 +1,19 @@
+#!/bin/sh
+./node_modules/jshint/bin/hint ./*
+hint=$?
+if [ $hint != 0 ]; then
+ echo "< script runner stopped jshint failed >";
+ exit $hint
+else
+ echo "< jshint passed >";
+fi
+
+./node_modules/tap/bin/tap.js ./test/*.js
+unit=$?
+if [ $unit != 0 ]; then
+ echo "< script runner stopped unit tests failed >";
+ exit $unit
+else
+ echo "< unit tests passed >";
+fi
+