http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/BigInteger.min.js
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/BigInteger.min.js
 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/BigInteger.min.js
new file mode 100644
index 0000000..a9d12de
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/BigInteger.min.js
@@ -0,0 +1,33 @@
+var bigInt=function(E){function k(a,b){if("undefined"===typeof a)return 
k[0];if("undefined"!==typeof b){var c;if(10===+b)c=l(a);else{c=b;var 
n=k[0],f=k[1],d=a.length;if(2<=c&&36>=c&&d<=ga/Math.log(c))c=new 
e(parseInt(a,c));else{c=l(c);var 
d=[],g,h="-"===a[0];for(g=h?1:0;g<a.length;g++){var 
q=a[g].toLowerCase(),u=q.charCodeAt(0);if(48<=u&&57>=u)d.push(l(q));else 
if(97<=u&&122>=u)d.push(l(q.charCodeAt(0)-87));else if("<"===q){q=g;do 
g++;while(">"!==a[g]);d.push(l(a.slice(q+1,g)))}else throw Error(q+
+" is not a valid 
character");}d.reverse();for(g=0;g<d.length;g++)n=n.add(d[g].times(f)),f=f.times(c);c=h?n.negate():n}}return
 c}return l(a)}function 
d(a,b){this.value=a;this.sign=b;this.isSmall=!1}function 
e(a){this.value=a;this.sign=0>a;this.isSmall=!0}function 
w(a){return-9007199254740992<a&&9007199254740992>a}function z(a){return 
1E7>a?[a]:1E14>a?[a%1E7,Math.floor(a/1E7)]:[a%1E7,Math.floor(a/1E7)%1E7,Math.floor(a/1E14)]}function
 y(a){D(a);var b=a.length;if(4>b&&0>A(a,P))switch(b){case 0:return 0;
+case 1:return a[0];case 2:return a[0]+1E7*a[1];default:return 
a[0]+1E7*(a[1]+1E7*a[2])}return a}function D(a){for(var 
b=a.length;0===a[--b];);a.length=b+1}function K(a){for(var 
b=Array(a),c=-1;++c<a;)b[c]=0;return b}function B(a){return 
0<a?Math.floor(a):Math.ceil(a)}function S(a,b){var 
c=a.length,d=b.length,f=Array(c),m=0,g,e;for(e=0;e<d;e++)g=a[e]+b[e]+m,m=1E7<=g?1:0,f[e]=g-1E7*m;for(;e<c;)g=a[e]+m,m=1E7===g?1:0,f[e++]=g-1E7*m;0<m&&f.push(m);return
 f}function F(a,b){return a.length>=b.length?S(a,
+b):S(b,a)}function L(a,b){var 
c=a.length,d=Array(c),f,e;for(e=0;e<c;e++)f=a[e]-1E7+b,b=Math.floor(f/1E7),d[e]=f-1E7*b,b+=1;for(;0<b;)d[e++]=b%1E7,b=Math.floor(b/1E7);return
 d}function G(a,b){var 
c=a.length,d=b.length,f=Array(c),e=0,g,h;for(g=0;g<d;g++)h=a[g]-e-b[g],0>h?(h+=1E7,e=1):e=0,f[g]=h;for(g=d;g<c;g++){h=a[g]-e;if(0>h)h+=1E7;else{f[g++]=h;break}f[g]=h}for(;g<c;g++)f[g]=a[g];D(f);return
 f}function M(a,b,c){var n=a.length,f=Array(n);b=-b;var 
m,g;for(m=0;m<n;m++)g=a[m]+b,b=Math.floor(g/1E7),g%=
+1E7,f[m]=0>g?g+1E7:g;f=y(f);return"number"===typeof f?(c&&(f=-f),new e(f)):new 
d(f,c)}function Q(a,b){var 
c=a.length,d=b.length,f=K(c+d),e,g,h,k;for(h=0;h<c;++h){k=a[h];for(var 
l=0;l<d;++l)e=b[l],e=k*e+f[h+l],g=Math.floor(e/1E7),f[h+l]=e-1E7*g,f[h+l+1]+=g}D(f);return
 f}function H(a,b){var 
c=a.length,d=Array(c),f=0,e,g;for(g=0;g<c;g++)e=a[g]*b+f,f=Math.floor(e/1E7),d[g]=e-1E7*f;for(;0<f;)d[g++]=f%1E7,f=Math.floor(f/1E7);return
 d}function T(a,b){for(var c=[];0<b--;)c.push(0);return c.concat(a)}function 
N(a,
+b){var c=Math.max(a.length,b.length);if(30>=c)return Q(a,b);var 
c=Math.ceil(c/2),d=a.slice(c),f=a.slice(0,c),e=b.slice(c),g=b.slice(0,c),h=N(f,g),k=N(d,e),d=N(F(f,d),F(g,e)),c=F(F(h,T(G(G(d,h),k),c)),T(k,2*c));D(c);return
 c}function U(a,b,c){return 1E7>a?new d(H(b,a),c):new d(Q(b,z(a)),c)}function 
V(a){var b=a.length,c=K(b+b),d,f,e,g;for(e=0;e<b;e++){g=a[e];for(var 
h=0;h<b;h++)d=a[h],d=g*d+c[e+h],f=Math.floor(d/1E7),c[e+h]=d-1E7*f,c[e+h+1]+=f}D(c);return
 c}function W(a,b){var c=a.length,d=K(c),f,
+e;e=0;for(--c;0<=c;--c)e=1E7*e+a[c],f=B(e/b),e-=f*b,d[c]=f|0;return[d,e|0]}function
 I(a,b){var c,n=l(b),f=a.value;c=n.value;if(0===c)throw Error("Cannot divide by 
zero");if(a.isSmall)return n.isSmall?[new e(B(f/c)),new 
e(f%c)]:[k[0],a];if(n.isSmall){if(1===c)return[a,k[0]];if(-1==c)return[a.negate(),k[0]];c=Math.abs(c);if(1E7>c)return
 c=W(f,c),f=y(c[0]),c=c[1],a.sign&&(c=-c),"number"===typeof 
f?(a.sign!==n.sign&&(f=-f),[new e(f),new e(c)]):[new d(f,a.sign!==n.sign),new 
e(c)];c=z(c)}var m=A(f,c);if(-1===
+m)return[k[0],a];if(0===m)return[k[a.sign===n.sign?1:-1],k[0]];if(200>=f.length+c.length){var
 g=c,h=f.length;c=g.length;var 
m=K(g.length),q=g[c-1],u=Math.ceil(1E7/(2*q)),f=H(f,u),g=H(g,u),p,r,x,t,v,w;f.length<=h&&f.push(0);g.push(0);q=g[c-1];for(p=h-c;0<=p;p--){h=9999999;f[p+c]!==q&&(h=Math.floor((1E7*f[p+c]+f[p+c-1])/q));x=r=0;v=g.length;for(t=0;t<v;t++)r+=h*g[t],w=Math.floor(r/1E7),x+=f[p+t]-(r-1E7*w),r=w,0>x?(f[p+t]=x+1E7,x=-1):(f[p+t]=x,x=0);for(;0!==x;){--h;for(t=r=0;t<v;t++)r+=f[p+t]-1E7+g[t],
+0>r?(f[p+t]=r+1E7,r=0):(f[p+t]=r,r=1);x+=r}m[p]=h}f=W(f,u)[0];c=[y(m),y(f)]}else{m=f.length;q=c.length;u=[];for(g=[];m;)if(g.unshift(f[--m]),0>A(g,c))u.push(0);else{h=g.length;p=1E7*g[h-1]+g[h-2];r=1E7*c[q-1]+c[q-2];h>q&&(p=1E7*(p+1));h=Math.ceil(p/r);do{p=H(c,h);if(0>=A(p,g))break;h--}while(h);u.push(h);g=G(g,p)}u.reverse();c=[y(u),y(g)]}f=c[0];n=a.sign!==n.sign;c=c[1];m=a.sign;"number"===typeof
 f?(n&&(f=-f),f=new e(f)):f=new d(f,n);"number"===typeof c?(m&&(c=-c),c=new 
e(c)):c=new d(c,m);return[f,
+c]}function A(a,b){if(a.length!==b.length)return 
a.length>b.length?1:-1;for(var c=a.length-1;0<=c;c--)if(a[c]!==b[c])return 
a[c]>b[c]?1:-1;return 0}function 
X(a){a=a.abs();if(a.isUnit())return!1;if(a.equals(2)||a.equals(3)||a.equals(5))return!0;if(a.isEven()||a.isDivisibleBy(3)||a.isDivisibleBy(5))return!1;if(a.lesser(25))return!0}function
 Y(a){return("number"===typeof a||"string"===typeof a)&&1E7>=+Math.abs(a)||a 
instanceof d&&1>=a.value.length}function R(a,b,c){b=l(b);var 
d=a.isNegative(),e=b.isNegative(),
+m=d?a.not():a,g=e?b.not():b;b=[];a=[];for(var 
h=!1,k=!1;!h||!k;)m.isZero()?(h=!0,b.push(d?1:0)):d?b.push(m.isEven()?1:0):b.push(m.isEven()?0:1),g.isZero()?(k=!0,a.push(e?1:0)):e?a.push(g.isEven()?1:0):a.push(g.isEven()?0:1),m=m.over(2),g=g.over(2);d=[];for(e=0;e<b.length;e++)d.push(c(b[e],a[e]));for(c=bigInt(d.pop()).negate().times(bigInt(2).pow(d.length));d.length;)c=c.add(bigInt(d.pop()).times(bigInt(2).pow(d.length)));return
 c}function O(a){a=a.value;a="number"===typeof a?a|1073741824:a[0]+1E7*
+a[1]|1073758208;return a&-a}function Z(a,b){a=l(a);b=l(b);return 
a.greater(b)?a:b}function aa(a,b){a=l(a);b=l(b);return a.lesser(b)?a:b}function 
ba(a,b){a=l(a).abs();b=l(b).abs();if(a.equals(b))return a;if(a.isZero())return 
b;if(b.isZero())return a;for(var 
c=k[1],d;a.isEven()&&b.isEven();)d=Math.min(O(a),O(b)),a=a.divide(d),b=b.divide(d),c=c.multiply(d);for(;a.isEven();)a=a.divide(O(a));do{for(;b.isEven();)b=b.divide(O(b));a.greater(b)&&(d=b,b=a,a=d);b=b.subtract(a)}while(!b.isZero());return
 c.isUnit()?
+a:a.multiply(c)}function ca(a){a=a.value;"number"===typeof a&&(a=[a]);return 
1===a.length&&35>=a[0]?"0123456789abcdefghijklmnopqrstuvwxyz".charAt(a[0]):"<"+a+">"}function
 da(a,b){b=bigInt(b);if(b.isZero()){if(a.isZero())return"0";throw Error("Cannot 
convert nonzero numbers to base 0.");}if(b.equals(-1))return 
a.isZero()?"0":a.isNegative()?Array(1-a).join("10"):"1"+Array(+a).join("01");var
 c="";a.isNegative()&&b.isPositive()&&(c="-",a=a.abs());if(b.equals(1))return 
a.isZero()?"0":c+Array(+a+1).join(1);
+for(var 
d=[],e=a,k;e.isNegative()||0<=e.compareAbs(b);)k=e.divmod(b),e=k.quotient,k=k.remainder,k.isNegative()&&(k=b.minus(k).abs(),e=e.next()),d.push(ca(k));d.push(ca(e));return
 c+d.reverse().join("")}function ea(a){if(w(+a)){var b=+a;if(b===B(b))return 
new e(b);throw"Invalid integer: "+a;}(b="-"===a[0])&&(a=a.slice(1));var 
c=a.split(/e/i);if(2<c.length)throw Error("Invalid integer: 
"+c.join("e"));if(2===c.length){a=c[1];"+"===a[0]&&(a=a.slice(1));a=+a;if(a!==B(a)||!w(a))throw
 Error("Invalid integer: "+
+a+" is not a valid exponent.");var 
c=c[0],n=c.indexOf(".");0<=n&&(a-=c.length-n-1,c=c.slice(0,n)+c.slice(n+1));if(0>a)throw
 Error("Cannot include negative exponent part for 
integers");a=c+=Array(a+1).join("0")}if(!/^([0-9][0-9]*)$/.test(a))throw 
Error("Invalid integer: "+a);for(var 
c=[],n=a.length,f=n-7;0<n;)c.push(+a.slice(f,n)),f-=7,0>f&&(f=0),n-=7;D(c);return
 new d(c,b)}function l(a){if("number"===typeof a){if(w(a)){if(a!==B(a))throw 
Error(a+" is not an integer.");a=new e(a)}else a=ea(a.toString());
+return a}return"string"===typeof a?ea(a):a}var 
P=z(9007199254740992),ga=Math.log(9007199254740992);d.prototype=Object.create(k.prototype);e.prototype=Object.create(k.prototype);d.prototype.add=function(a){a=l(a);if(this.sign!==a.sign)return
 this.subtract(a.negate());var b=this.value,c=a.value;return a.isSmall?new 
d(L(b,Math.abs(c)),this.sign):new 
d(F(b,c),this.sign)};d.prototype.plus=d.prototype.add;e.prototype.add=function(a){a=l(a);var
 b=this.value;if(0>b!==a.sign)return this.subtract(a.negate());
+var c=a.value;if(a.isSmall){if(w(b+c))return new 
e(b+c);c=z(Math.abs(c))}return new 
d(L(c,Math.abs(b)),0>b)};e.prototype.plus=e.prototype.add;d.prototype.subtract=function(a){var
 b=l(a);if(this.sign!==b.sign)return this.add(b.negate());a=this.value;var 
c=b.value;if(b.isSmall)return 
M(a,Math.abs(c),this.sign);b=this.sign;0<=A(a,c)?a=G(a,c):(a=G(c,a),b=!b);a=y(a);"number"===typeof
 a?(b&&(a=-a),a=new e(a)):a=new d(a,b);return 
a};d.prototype.minus=d.prototype.subtract;e.prototype.subtract=function(a){a=
+l(a);var b=this.value;if(0>b!==a.sign)return this.add(a.negate());var 
c=a.value;return a.isSmall?new 
e(b-c):M(c,Math.abs(b),0<=b)};e.prototype.minus=e.prototype.subtract;d.prototype.negate=function(){return
 new d(this.value,!this.sign)};e.prototype.negate=function(){var 
a=this.sign,b=new e(-this.value);b.sign=!a;return 
b};d.prototype.abs=function(){return new 
d(this.value,!1)};e.prototype.abs=function(){return new 
e(Math.abs(this.value))};d.prototype.multiply=function(a){var 
b=l(a);a=this.value;var c=
+b.value,e=this.sign!==b.sign;if(b.isSmall){if(0===c)return 
k[0];if(1===c)return this;if(-1===c)return 
this.negate();c=Math.abs(c);if(1E7>c)return new d(H(a,c),e);c=z(c)}var 
b=a.length,f=c.length;return 0<-.012*b-.012*f+1.5E-5*b*f?new d(N(a,c),e):new 
d(Q(a,c),e)};d.prototype.times=d.prototype.multiply;e.prototype._multiplyBySmall=function(a){return
 w(a.value*this.value)?new 
e(a.value*this.value):U(Math.abs(a.value),z(Math.abs(this.value)),this.sign!==a.sign)};d.prototype._multiplyBySmall=function(a){return
 0===
+a.value?k[0]:1===a.value?this:-1===a.value?this.negate():U(Math.abs(a.value),this.value,this.sign!==a.sign)};e.prototype.multiply=function(a){return
 
l(a)._multiplyBySmall(this)};e.prototype.times=e.prototype.multiply;d.prototype.square=function(){return
 new d(V(this.value),!1)};e.prototype.square=function(){var 
a=this.value*this.value;return w(a)?new e(a):new 
d(V(z(Math.abs(this.value))),!1)};d.prototype.divmod=function(a){a=I(this,a);return{quotient:a[0],remainder:a[1]}};e.prototype.divmod=d.prototype.divmod;
+d.prototype.divide=function(a){return 
I(this,a)[0]};e.prototype.over=e.prototype.divide=d.prototype.over=d.prototype.divide;d.prototype.mod=function(a){return
 
I(this,a)[1]};e.prototype.remainder=e.prototype.mod=d.prototype.remainder=d.prototype.mod;d.prototype.pow=function(a){var
 b=l(a),c=this.value;a=b.value;var d;if(0===a)return k[1];if(0===c)return 
k[0];if(1===c)return k[1];if(-1===c)return 
b.isEven()?k[1]:k[-1];if(b.sign)return k[0];if(!b.isSmall)throw Error("The 
exponent "+b.toString()+" is too large.");
+if(this.isSmall&&w(d=Math.pow(c,a)))return new 
e(B(d));d=this;for(b=k[1];;){a&1&&(b=b.times(d),--a);if(0===a)break;a/=2;d=d.square()}return
 
b};e.prototype.pow=d.prototype.pow;d.prototype.modPow=function(a,b){a=l(a);b=l(b);if(b.isZero())throw
 Error("Cannot take modPow with modulus 0");for(var 
c=k[1],d=this.mod(b);a.isPositive();){if(d.isZero())return 
k[0];a.isOdd()&&(c=c.multiply(d).mod(b));a=a.divide(2);d=d.square().mod(b)}return
 c};e.prototype.modPow=d.prototype.modPow;d.prototype.compareAbs=function(a){a=
+l(a);return 
a.isSmall?1:A(this.value,a.value)};e.prototype.compareAbs=function(a){a=l(a);var
 b=Math.abs(this.value),c=a.value;return 
a.isSmall?(c=Math.abs(c),b===c?0:b>c?1:-1):-1};d.prototype.compare=function(a){if(Infinity===a)return-1;if(-Infinity===a)return
 1;a=l(a);return 
this.sign!==a.sign?a.sign?1:-1:a.isSmall?this.sign?-1:1:A(this.value,a.value)*(this.sign?-1:1)};d.prototype.compareTo=d.prototype.compare;e.prototype.compare=function(a){if(Infinity===a)return-1;if(-Infinity===a)return
 1;a=l(a);
+var b=this.value,c=a.value;return 
a.isSmall?b==c?0:b>c?1:-1:0>b!==a.sign?0>b?-1:1:0>b?1:-1};e.prototype.compareTo=e.prototype.compare;d.prototype.equals=function(a){return
 
0===this.compare(a)};e.prototype.eq=e.prototype.equals=d.prototype.eq=d.prototype.equals;d.prototype.notEquals=function(a){return
 
0!==this.compare(a)};e.prototype.neq=e.prototype.notEquals=d.prototype.neq=d.prototype.notEquals;d.prototype.greater=function(a){return
 0<this.compare(a)};e.prototype.gt=e.prototype.greater=d.prototype.gt=
+d.prototype.greater;d.prototype.lesser=function(a){return 
0>this.compare(a)};e.prototype.lt=e.prototype.lesser=d.prototype.lt=d.prototype.lesser;d.prototype.greaterOrEquals=function(a){return
 
0<=this.compare(a)};e.prototype.geq=e.prototype.greaterOrEquals=d.prototype.geq=d.prototype.greaterOrEquals;d.prototype.lesserOrEquals=function(a){return
 
0>=this.compare(a)};e.prototype.leq=e.prototype.lesserOrEquals=d.prototype.leq=d.prototype.lesserOrEquals;d.prototype.isEven=function(){return
 0===(this.value[0]&
+1)};e.prototype.isEven=function(){return 
0===(this.value&1)};d.prototype.isOdd=function(){return 
1===(this.value[0]&1)};e.prototype.isOdd=function(){return 
1===(this.value&1)};d.prototype.isPositive=function(){return!this.sign};e.prototype.isPositive=function(){return
 0<this.value};d.prototype.isNegative=function(){return 
this.sign};e.prototype.isNegative=function(){return 
0>this.value};d.prototype.isUnit=function(){return!1};e.prototype.isUnit=function(){return
 1===Math.abs(this.value)};d.prototype.isZero=
+function(){return!1};e.prototype.isZero=function(){return 
0===this.value};d.prototype.isDivisibleBy=function(a){a=l(a);var 
b=a.value;return 
0===b?!1:1===b?!0:2===b?this.isEven():this.mod(a).equals(k[0])};e.prototype.isDivisibleBy=d.prototype.isDivisibleBy;d.prototype.isPrime=function(){var
 a=X(this);if(a!==E)return a;for(var 
a=this.abs(),b=a.prev(),c=[2,3,5,7,11,13,17,19],d=b,e,l,g,h;d.isEven();)d=d.divide(2);for(g=0;g<c.length;g++)if(h=bigInt(c[g]).modPow(d,a),!h.equals(k[1])&&!h.equals(b)){l=!0;
+for(e=d;l&&e.lesser(b);e=e.multiply(2))h=h.square().mod(a),h.equals(b)&&(l=!1);if(l)return!1}return!0};e.prototype.isPrime=d.prototype.isPrime;d.prototype.isProbablePrime=function(a){var
 b=X(this);if(b!==E)return b;b=this.abs();a=a===E?5:a;for(var 
c=0;c<a;c++)if(!bigInt.randBetween(2,b.minus(2)).modPow(b.prev(),b).isUnit())return!1;return!0};e.prototype.isProbablePrime=d.prototype.isProbablePrime;d.prototype.next=function(){var
 a=this.value;return this.sign?M(a,1,this.sign):new d(L(a,1),this.sign)};
+e.prototype.next=function(){var a=this.value;return 9007199254740992>a+1?new 
e(a+1):new d(P,!1)};d.prototype.prev=function(){var a=this.value;return 
this.sign?new d(L(a,1),!0):M(a,1,this.sign)};e.prototype.prev=function(){var 
a=this.value;return-9007199254740992<a-1?new e(a-1):new d(P,!0)};for(var 
v=[1];1E7>=v[v.length-1];)v.push(2*v[v.length-1]);var 
J=v.length,fa=v[J-1];d.prototype.shiftLeft=function(a){if(!Y(a))throw 
Error(String(a)+" is too large for shifting.");a=+a;if(0>a)return 
this.shiftRight(-a);
+for(var b=this;a>=J;)b=b.multiply(fa),a-=J-1;return 
b.multiply(v[a])};e.prototype.shiftLeft=d.prototype.shiftLeft;d.prototype.shiftRight=function(a){var
 b;if(!Y(a))throw Error(String(a)+" is too large for 
shifting.");a=+a;if(0>a)return 
this.shiftLeft(-a);for(b=this;a>=J;){if(b.isZero())return 
b;b=I(b,fa);b=b[1].isNegative()?b[0].prev():b[0];a-=J-1}b=I(b,v[a]);return 
b[1].isNegative()?b[0].prev():b[0]};e.prototype.shiftRight=d.prototype.shiftRight;d.prototype.not=function(){return
 this.negate().prev()};
+e.prototype.not=d.prototype.not;d.prototype.and=function(a){return 
R(this,a,function(a,c){return 
a&c})};e.prototype.and=d.prototype.and;d.prototype.or=function(a){return 
R(this,a,function(a,c){return 
a|c})};e.prototype.or=d.prototype.or;d.prototype.xor=function(a){return 
R(this,a,function(a,c){return 
a^c})};e.prototype.xor=d.prototype.xor;d.prototype.toString=function(a){a===E&&(a=10);if(10!==a)return
 da(this,a);a=this.value;for(var 
b=a.length,c=String(a[--b]),d;0<=--b;)d=String(a[b]),c+="0000000".slice(d.length)+
+d;return(this.sign?"-":"")+c};e.prototype.toString=function(a){a===E&&(a=10);return
 
10!=a?da(this,a):String(this.value)};d.prototype.valueOf=function(){return+this.toString()};d.prototype.toJSNumber=d.prototype.valueOf;e.prototype.valueOf=function(){return
 this.value};e.prototype.toJSNumber=e.prototype.valueOf;for(var 
C=0;1E3>C;C++)k[C]=new e(C),0<C&&(k[-C]=new 
e(-C));k.one=k[1];k.zero=k[0];k.minusOne=k[-1];k.max=Z;k.min=aa;k.gcd=ba;k.lcm=function(a,b){a=l(a).abs();b=l(b).abs();return
 a.divide(ba(a,
+b)).multiply(b)};k.isInstance=function(a){return a instanceof d||a instanceof 
e};k.randBetween=function(a,b){a=l(a);b=l(b);var 
c=aa(a,b),k=Z(a,b).subtract(c);if(k.isSmall)return 
c.add(Math.round(Math.random()*k));for(var 
f=[],m=!0,g=k.value.length-1;0<=g;g--){var 
h=m?k.value[g]:1E7,q=B(Math.random()*h);f.unshift(q);q<h&&(m=!1)}f=y(f);return 
c.add("number"===typeof f?new e(f):new d(f,!1))};return 
k}();"undefined"!==typeof 
module&&module.hasOwnProperty("exports")&&(module.exports=bigInt);
\ No newline at end of file

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/LICENSE
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/LICENSE
 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/LICENSE
new file mode 100644
index 0000000..cf1ab25
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/LICENSE
@@ -0,0 +1,24 @@
+This is free and unencumbered software released into the public domain.
+
+Anyone is free to copy, modify, publish, use, compile, sell, or
+distribute this software, either in source code form or as a compiled
+binary, for any purpose, commercial or non-commercial, and by any
+means.
+
+In jurisdictions that recognize copyright laws, the author or authors
+of this software dedicate any and all copyright interest in the
+software to the public domain. We make this dedication for the benefit
+of the public at large and to the detriment of our heirs and
+successors. We intend this dedication to be an overt act of
+relinquishment in perpetuity of all present and future rights to this
+software under copyright law.
+
+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 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.
+
+For more information, please refer to <http://unlicense.org>

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/README.md
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/README.md
 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/README.md
new file mode 100644
index 0000000..6d9ee85
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/README.md
@@ -0,0 +1,506 @@
+# BigInteger.js [![Build Status][travis-img]][travis-url] [![Coverage 
Status][coveralls-img]][coveralls-url] [![Monthly 
Downloads][downloads-img]][downloads-url]
+
+[travis-url]: https://travis-ci.org/peterolson/BigInteger.js
+[travis-img]: https://travis-ci.org/peterolson/BigInteger.js.svg?branch=master
+[coveralls-url]: 
https://coveralls.io/github/peterolson/BigInteger.js?branch=master
+[coveralls-img]: 
https://coveralls.io/repos/peterolson/BigInteger.js/badge.svg?branch=master&service=github
+[downloads-url]: https://www.npmjs.com/package/big-integer
+[downloads-img]: https://img.shields.io/npm/dm/big-integer.svg
+
+**BigInteger.js** is an arbitrary-length integer library for Javascript, 
allowing arithmetic operations on integers of unlimited size, notwithstanding 
memory and time limitations.
+
+## Installation
+
+If you are using a browser, you can download [BigInteger.js from 
GitHub](http://peterolson.github.com/BigInteger.js/BigInteger.min.js) or just 
hotlink to it:
+
+       <script 
src="http://peterolson.github.com/BigInteger.js/BigInteger.min.js";></script>
+
+If you are using node, you can install BigInteger with 
[npm](https://npmjs.org/).
+
+    npm install big-integer
+
+Then you can include it in your code:
+
+       var bigInt = require("big-integer");
+
+
+## Usage
+### `bigInt(number, [base])`
+
+You can create a bigInt by calling the `bigInt` function. You can pass in
+
+ - a string, which it will parse as an bigInt and throw an `"Invalid integer"` 
error if the parsing fails.
+ - a Javascript number, which it will parse as an bigInt and throw an 
`"Invalid integer"` error if the parsing fails.
+ - another bigInt.
+ - nothing, and it will return `bigInt.zero`.
+
+ If you provide a second parameter, then it will parse `number` as a number in 
base `base`. Note that `base` can be any bigInt (even negative or zero). The 
letters "a-z" and "A-Z" will be interpreted as the numbers 10 to 35. Higher 
digits can be specified in angle brackets (`<` and `>`).
+
+Examples:
+
+    var zero = bigInt();
+    var ninetyThree = bigInt(93);
+       var largeNumber = 
bigInt("75643564363473453456342378564387956906736546456235345");
+       var googol = bigInt("1e100");
+       var bigNumber = bigInt(largeNumber);
+        
+       var maximumByte = bigInt("FF", 16);
+       var fiftyFiveGoogol = bigInt("<55>0", googol);
+
+Note that Javascript numbers larger than `9007199254740992` and smaller than 
`-9007199254740992` are not precisely represented numbers and will not produce 
exact results. If you are dealing with numbers outside that range, it is better 
to pass in strings.
+
+### Method Chaining
+
+Note that bigInt operations return bigInts, which allows you to chain methods, 
for example:
+
+    var salary = bigInt(dollarsPerHour).times(hoursWorked).plus(randomBonuses)
+
+### Constants
+
+There are three named constants already stored that you do not have to 
construct with the `bigInt` function yourself:
+
+ - `bigInt.one`, equivalent to `bigInt(1)`
+ - `bigInt.zero`, equivalent to `bigInt(0)`
+ - `bigInt.minusOne`, equivalent to `bigInt(-1)`
+ 
+The numbers from -999 to 999 are also already prestored and can be accessed 
using `bigInt[index]`, for example:
+
+ - `bigInt[-999]`, equivalent to `bigInt(-999)`
+ - `bigInt[256]`, equivalent to `bigInt(256)`
+
+### Methods
+
+#### `abs()`
+
+Returns the absolute value of a bigInt.
+
+ - `bigInt(-45).abs()` => `45`
+ - `bigInt(45).abs()` => `45`
+
+#### `add(number)`
+
+Performs addition.
+
+ - `bigInt(5).add(7)` => `12`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Addition)
+
+#### `and(number)`
+
+Performs the bitwise AND operation. The operands are treated as if they were 
represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).
+
+ - `bigInt(6).and(3)` => `2`
+ - `bigInt(6).and(-3)` => `4`
+
+#### `compare(number)`
+
+Performs a comparison between two numbers. If the numbers are equal, it 
returns `0`. If the first number is greater, it returns `1`. If the first 
number is lesser, it returns `-1`.
+
+ - `bigInt(5).compare(5)` => `0`
+ - `bigInt(5).compare(4)` => `1`
+ - `bigInt(4).compare(5)` => `-1`
+
+#### `compareAbs(number)`
+
+Performs a comparison between the absolute value of two numbers.
+
+ - `bigInt(5).compareAbs(-5)` => `0`
+ - `bigInt(5).compareAbs(4)` => `1`
+ - `bigInt(4).compareAbs(-5)` => `-1`
+
+#### `compareTo(number)`
+
+Alias for the `compare` method.
+
+#### `divide(number)`
+
+Performs integer division, disregarding the remainder.
+
+ - `bigInt(59).divide(5)` => `11`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)
+
+#### `divmod(number)`
+
+Performs division and returns an object with two properties: `quotient` and 
`remainder`. The sign of the remainder will match the sign of the dividend.
+
+ - `bigInt(59).divmod(5)` => `{quotient: bigInt(11), remainder: bigInt(4) }`
+ - `bigInt(-5).divmod(2)` => `{quotient: bigInt(-2), remainder: bigInt(-1) }`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)
+
+#### `eq(number)`
+
+Alias for the `equals` method.
+
+#### `equals(number)`
+
+Checks if two numbers are equal.
+
+ - `bigInt(5).equals(5)` => `true`
+ - `bigInt(4).equals(7)` => `false`
+
+#### `geq(number)`
+
+Alias for the `greaterOrEquals` method.
+
+
+#### `greater(number)`
+
+Checks if the first number is greater than the second.
+
+ - `bigInt(5).greater(6)` => `false`
+ - `bigInt(5).greater(5)` => `false`
+ - `bigInt(5).greater(4)` => `true`
+
+#### `greaterOrEquals(number)`
+
+Checks if the first number is greater than or equal to the second.
+
+ - `bigInt(5).greaterOrEquals(6)` => `false`
+ - `bigInt(5).greaterOrEquals(5)` => `true`
+ - `bigInt(5).greaterOrEquals(4)` => `true`
+
+#### `gt(number)`
+
+Alias for the `greater` method.
+
+#### `isDivisibleBy(number)`
+
+Returns `true` if the first number is divisible by the second number, `false` 
otherwise.
+
+ - `bigInt(999).isDivisibleBy(333)` => `true`
+ - `bigInt(99).isDivisibleBy(5)` => `false`
+
+#### `isEven()`
+
+Returns `true` if the number is even, `false` otherwise.
+
+ - `bigInt(6).isEven()` => `true`
+ - `bigInt(3).isEven()` => `false`
+
+#### `isNegative()`
+
+Returns `true` if the number is negative, `false` otherwise.
+Returns `false` for `0` and `-0`.
+
+ - `bigInt(-23).isNegative()` => `true`
+ - `bigInt(50).isNegative()` => `false`
+
+#### `isOdd()`
+
+Returns `true` if the number is odd, `false` otherwise.
+
+ - `bigInt(13).isOdd()` => `true`
+ - `bigInt(40).isOdd()` => `false`
+
+#### `isPositive()`
+
+Return `true` if the number is positive, `false` otherwise.
+Returns `false` for `0` and `-0`.
+
+ - `bigInt(54).isPositive()` => `true`
+ - `bigInt(-1).isPositive()` => `false`
+
+#### `isPrime()`
+
+Returns `true` if the number is prime, `false` otherwise.
+
+ - `bigInt(5).isPrime()` => `true`
+ - `bigInt(6).isPrime()` => `false`
+
+#### `isProbablePrime([iterations])`
+
+Returns `true` if the number is very likely to be positive, `false` otherwise.
+Argument is optional and determines the amount of iterations of the test 
(default: `5`). The more iterations, the lower chance of getting a false 
positive.
+This uses the [Fermat primality 
test](https://en.wikipedia.org/wiki/Fermat_primality_test).
+
+ - `bigInt(5).isProbablePrime()` => `true`
+ - `bigInt(49).isProbablePrime()` => `false`
+ - `bigInt(1729).isProbablePrime(50)` => `false`
+ 
+Note that this function is not deterministic, since it relies on random 
sampling of factors, so the result for some numbers is not always the same. 
[Carmichael numbers](https://en.wikipedia.org/wiki/Carmichael_number) are 
particularly prone to give unreliable results.
+
+For example, `bigInt(1729).isProbablePrime()` returns `false` about 76% of the 
time and `true` about 24% of the time. The correct result is `false`.
+
+#### `isUnit()`
+
+Returns `true` if the number is `1` or `-1`, `false` otherwise.
+
+ - `bigInt.one.isUnit()` => `true`
+ - `bigInt.minusOne.isUnit()` => `true`
+ - `bigInt(5).isUnit()` => `false`
+
+#### `isZero()`
+
+Return `true` if the number is `0` or `-0`, `false` otherwise.
+
+ - `bigInt.zero.isZero()` => `true`
+ - `bigInt("-0").isZero()` => `true`
+ - `bigInt(50).isZero()` => `false`
+
+#### `leq(number)`
+
+Alias for the `lesserOrEquals` method.
+
+#### `lesser(number)`
+
+Checks if the first number is lesser than the second.
+
+ - `bigInt(5).lesser(6)` => `true`
+ - `bigInt(5).lesser(5)` => `false`
+ - `bigInt(5).lesser(4)` => `false`
+
+#### `lesserOrEquals(number)`
+
+Checks if the first number is less than or equal to the second.
+
+ - `bigInt(5).lesserOrEquals(6)` => `true`
+ - `bigInt(5).lesserOrEquals(5)` => `true`
+ - `bigInt(5).lesserOrEquals(4)` => `false`
+
+#### `lt(number)`
+
+Alias for the `lesser` method.
+
+#### `minus(number)`
+
+Alias for the `subtract` method.
+
+ - `bigInt(3).minus(5)` => `-2`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Subtraction)
+
+#### `mod(number)`
+
+Performs division and returns the remainder, disregarding the quotient. The 
sign of the remainder will match the sign of the dividend.
+
+ - `bigInt(59).mod(5)` =>  `4`
+ - `bigInt(-5).mod(2)` => `-1`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)
+
+#### `modPow(exp, mod)`
+
+Takes the number to the power `exp` modulo `mod`.
+
+ - `bigInt(10).modPow(3, 30)` => `10`
+
+#### `multiply(number)`
+
+Performs multiplication.
+
+ - `bigInt(111).multiply(111)` => `12321`
+
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Multiplication)
+
+#### `neq(number)`
+
+Alias for the `notEquals` method.
+
+#### `next()`
+
+Adds one to the number.
+
+ - `bigInt(6).next()` => `7`
+
+#### `not()`
+
+Performs the bitwise NOT operation. The operands are treated as if they were 
represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).
+
+ - `bigInt(10).not()` => `-11`
+ - `bigInt(0).not()` => `-1`
+
+#### `notEquals(number)`
+
+Checks if two numbers are not equal.
+
+ - `bigInt(5).notEquals(5)` => `false`
+ - `bigInt(4).notEquals(7)` => `true`
+
+#### `or(number)`
+
+Performs the bitwise OR operation. The operands are treated as if they were 
represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).
+
+ - `bigInt(13).or(10)` => `15`
+ - `bigInt(13).or(-8)` => `-3`
+
+#### `over(number)`
+
+Alias for the `divide` method.
+
+ - `bigInt(59).over(5)` => `11`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)
+
+#### `plus(number)`
+
+Alias for the `add` method.
+
+ - `bigInt(5).plus(7)` => `12`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Addition)
+
+#### `pow(number)`
+
+Performs exponentiation. If the exponent is less than `0`, `pow` returns `0`. 
`bigInt.zero.pow(0)` returns `1`.
+
+ - `bigInt(16).pow(16)` => `18446744073709551616`
+
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Exponentiation)
+
+#### `prev(number)`
+
+Subtracts one from the number.
+
+ - `bigInt(6).prev()` => `5`
+
+#### `remainder(number)`
+
+Alias for the `mod` method.
+
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)
+
+#### `shiftLeft(n)`
+
+Shifts the number left by `n` places in its binary representation. If a 
negative number is provided, it will shift right. Throws an error if `n` is 
outside of the range `[-9007199254740992, 9007199254740992]`.
+
+ - `bigInt(8).shiftLeft(2)` => `32`
+ - `bigInt(8).shiftLeft(-2)` => `2`
+
+#### `shiftRight(n)`
+
+Shifts the number right by `n` places in its binary representation. If a 
negative number is provided, it will shift left. Throws an error if `n` is 
outside of the range `[-9007199254740992, 9007199254740992]`.
+
+ - `bigInt(8).shiftRight(2)` => `2`
+ - `bigInt(8).shiftRight(-2)` => `32`
+
+#### `square()`
+
+Squares the number
+
+ - `bigInt(3).square()` => `9`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Squaring)
+
+#### `subtract(number)`
+
+Performs subtraction.
+
+ - `bigInt(3).subtract(5)` => `-2`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Subtraction)
+
+#### `times(number)`
+
+Alias for the `multiply` method.
+
+ - `bigInt(111).times(111)` => `12321`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Multiplication)
+
+#### `toJSNumber()`
+
+Converts a bigInt into a native Javascript number. Loses precision for numbers 
outside the range `[-9007199254740992, 9007199254740992]`.
+
+ - `bigInt("18446744073709551616").toJSNumber()` => `18446744073709552000`
+
+#### `xor(number)`
+
+Performs the bitwise XOR operation. The operands are treated as if they were 
represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).
+
+ - `bigInt(12).xor(5)` => `9`
+ - `bigInt(12).xor(-5)` => `-9`
+ 
+### Static Methods
+
+#### `gcd(a, b)`
+
+Finds the greatest common denominator of `a` and `b`.
+
+ - `bigInt.gcd(42,56)` => `14`
+
+#### `isInstance(x)`
+
+Returns `true` if `x` is a BigInteger, `false` otherwise.
+
+ - `bigInt.isInstance(bigInt(14))` => `true`
+ - `bigInt.isInstance(14)` => `false`
+ 
+#### `lcm(a,b)`
+
+Finds the least common multiple of `a` and `b`.
+ 
+ - `bigInt.lcm(21, 6)` => `42`
+ 
+#### `max(a,b)`
+
+Returns the largest of `a` and `b`.
+
+ - `bigInt.max(77, 432)` => `432`
+
+#### `min(a,b)`
+
+Returns the smallest of `a` and `b`.
+
+ - `bigInt.min(77, 432)` => `77`
+
+#### `randBetween(min, max)`
+
+Returns a random number between `min` and `max`.
+
+ - `bigInt.randBetween("-1e100", "1e100")` => (for example) 
`8494907165436643479673097939554427056789510374838494147955756275846226209006506706784609314471378745`
+
+
+### Override Methods
+
+#### `toString(radix = 10)`
+
+Converts a bigInt to a string. There is an optional radix parameter (which 
defaults to 10) that converts the number to the given radix. Digits in the 
range `10-35` will use the letters `a-z`.
+
+ - `bigInt("1e9").toString()` => `"1000000000"`
+ - `bigInt("1e9").toString(16)` => `"3b9aca00"`
+
+**Note that arithmetical operators will trigger the `valueOf` function rather 
than the `toString` function.** When converting a bigInteger to a string, you 
should use the `toString` method or the `String` function instead of adding the 
empty string.
+
+ - `bigInt("999999999999999999").toString()` => `"999999999999999999"`
+ - `String(bigInt("999999999999999999"))` => `"999999999999999999"`
+ - `bigInt("999999999999999999") + ""` => `1000000000000000000`
+
+Bases larger than 36 are supported. If a digit is greater than or equal to 36, 
it will be enclosed in angle brackets.
+
+ - `bigInt(567890).toString(100)` => `"<56><78><90>"`
+
+Negative bases are also supported.
+
+ - `bigInt(12345).toString(-10)` => `"28465"`
+
+Base 1 and base -1 are also supported.
+
+ - `bigInt(-15).toString(1)` => `"-111111111111111"`
+ - `bigInt(-15).toString(-1)` => `"101010101010101010101010101010"`
+
+Base 0 is only allowed for the number zero.
+
+ - `bigInt(0).toString(0)` => `0`
+ - `bigInt(1).toString(0)` => `Error: Cannot convert nonzero numbers to base 
0.`
+ 
+[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#toString)
+ 
+#### `valueOf()`
+
+Converts a bigInt to a native Javascript number. This override allows you to 
use native arithmetic operators without explicit conversion:
+
+ - `bigInt("100") + bigInt("200") === 300; //true`
+
+## Contributors
+
+To contribute, just fork the project, make some changes, and submit a pull 
request. Please verify that the unit tests pass before submitting.
+
+The unit tests are contained in the `spec/spec.js` file. You can run them 
locally by opening the `spec/SpecRunner.html` or file or running `npm test`. 
You can also [run the tests online from 
GitHub](http://peterolson.github.io/BigInteger.js/spec/SpecRunner.html).
+
+There are performance benchmarks that can be viewed from the 
`benchmarks/index.html` page. You can [run them online from 
GitHub](http://peterolson.github.io/BigInteger.js/benchmark/).
+
+## License
+
+This project is public domain. For more details, read about the 
[Unlicense](http://unlicense.org/).
\ No newline at end of file

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/package.json
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/package.json
 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/package.json
new file mode 100644
index 0000000..2c0a201
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/bplist-parser/node_modules/big-integer/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "big-integer",
+  "version": "1.6.15",
+  "author": {
+    "name": "Peter Olson",
+    "email": "[email protected]"
+  },
+  "description": "An arbitrary length integer library for Javascript",
+  "contributors": [],
+  "bin": {},
+  "scripts": {
+    "test": "karma start my.conf.js"
+  },
+  "main": "./BigInteger",
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://[email protected]/peterolson/BigInteger.js.git"
+  },
+  "keywords": [
+    "math",
+    "big",
+    "bignum",
+    "bigint",
+    "biginteger",
+    "integer",
+    "arbitrary",
+    "precision",
+    "arithmetic"
+  ],
+  "devDependencies": {
+    "coveralls": "^2.11.4",
+    "jasmine": "2.1.x",
+    "jasmine-core": "^2.3.4",
+    "karma": "^0.13.3",
+    "karma-coverage": "^0.4.2",
+    "karma-jasmine": "^0.3.6",
+    "karma-phantomjs-launcher": "~0.1"
+  },
+  "license": "Unlicense",
+  "engines": {
+    "node": ">=0.6"
+  },
+  "readme": "# BigInteger.js [![Build Status][travis-img]][travis-url] 
[![Coverage Status][coveralls-img]][coveralls-url] [![Monthly 
Downloads][downloads-img]][downloads-url]\r\n\r\n[travis-url]: 
https://travis-ci.org/peterolson/BigInteger.js\r\n[travis-img]: 
https://travis-ci.org/peterolson/BigInteger.js.svg?branch=master\r\n[coveralls-url]:
 
https://coveralls.io/github/peterolson/BigInteger.js?branch=master\r\n[coveralls-img]:
 
https://coveralls.io/repos/peterolson/BigInteger.js/badge.svg?branch=master&service=github\r\n[downloads-url]:
 https://www.npmjs.com/package/big-integer\r\n[downloads-img]: 
https://img.shields.io/npm/dm/big-integer.svg\r\n\r\n**BigInteger.js** is an 
arbitrary-length integer library for Javascript, allowing arithmetic operations 
on integers of unlimited size, notwithstanding memory and time 
limitations.\r\n\r\n## Installation\r\n\r\nIf you are using a browser, you can 
download [BigInteger.js from 
GitHub](http://peterolson.github.com/BigInteger.js/BigInteger.mi
 n.js) or just hotlink to it:\r\n\r\n\t<script 
src=\"http://peterolson.github.com/BigInteger.js/BigInteger.min.js\";></script>\r\n\r\nIf
 you are using node, you can install BigInteger with 
[npm](https://npmjs.org/).\r\n\r\n    npm install big-integer\r\n\r\nThen you 
can include it in your code:\r\n\r\n\tvar bigInt = 
require(\"big-integer\");\r\n\r\n\r\n## Usage\r\n### `bigInt(number, 
[base])`\r\n\r\nYou can create a bigInt by calling the `bigInt` function. You 
can pass in\r\n\r\n - a string, which it will parse as an bigInt and throw an 
`\"Invalid integer\"` error if the parsing fails.\r\n - a Javascript number, 
which it will parse as an bigInt and throw an `\"Invalid integer\"` error if 
the parsing fails.\r\n - another bigInt.\r\n - nothing, and it will return 
`bigInt.zero`.\r\n\r\n If you provide a second parameter, then it will parse 
`number` as a number in base `base`. Note that `base` can be any bigInt (even 
negative or zero). The letters \"a-z\" and \"A-Z\" will be interpreted a
 s the numbers 10 to 35. Higher digits can be specified in angle brackets (`<` 
and `>`).\r\n\r\nExamples:\r\n\r\n    var zero = bigInt();\r\n    var 
ninetyThree = bigInt(93);\r\n\tvar largeNumber = 
bigInt(\"75643564363473453456342378564387956906736546456235345\");\r\n\tvar 
googol = bigInt(\"1e100\");\r\n\tvar bigNumber = bigInt(largeNumber);\r\n\t 
\r\n\tvar maximumByte = bigInt(\"FF\", 16);\r\n\tvar fiftyFiveGoogol = 
bigInt(\"<55>0\", googol);\r\n\r\nNote that Javascript numbers larger than 
`9007199254740992` and smaller than `-9007199254740992` are not precisely 
represented numbers and will not produce exact results. If you are dealing with 
numbers outside that range, it is better to pass in strings.\r\n\r\n### Method 
Chaining\r\n\r\nNote that bigInt operations return bigInts, which allows you to 
chain methods, for example:\r\n\r\n    var salary = 
bigInt(dollarsPerHour).times(hoursWorked).plus(randomBonuses)\r\n\r\n### 
Constants\r\n\r\nThere are three named constants already stored 
 that you do not have to construct with the `bigInt` function yourself:\r\n\r\n 
- `bigInt.one`, equivalent to `bigInt(1)`\r\n - `bigInt.zero`, equivalent to 
`bigInt(0)`\r\n - `bigInt.minusOne`, equivalent to `bigInt(-1)`\r\n \r\nThe 
numbers from -999 to 999 are also already prestored and can be accessed using 
`bigInt[index]`, for example:\r\n\r\n - `bigInt[-999]`, equivalent to 
`bigInt(-999)`\r\n - `bigInt[256]`, equivalent to `bigInt(256)`\r\n\r\n### 
Methods\r\n\r\n#### `abs()`\r\n\r\nReturns the absolute value of a 
bigInt.\r\n\r\n - `bigInt(-45).abs()` => `45`\r\n - `bigInt(45).abs()` => 
`45`\r\n\r\n#### `add(number)`\r\n\r\nPerforms addition.\r\n\r\n - 
`bigInt(5).add(7)` => `12`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Addition)\r\n\r\n####
 `and(number)`\r\n\r\nPerforms the bitwise AND operation. The operands are 
treated as if they were represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_com
 plement).\r\n\r\n - `bigInt(6).and(3)` => `2`\r\n - `bigInt(6).and(-3)` => 
`4`\r\n\r\n#### `compare(number)`\r\n\r\nPerforms a comparison between two 
numbers. If the numbers are equal, it returns `0`. If the first number is 
greater, it returns `1`. If the first number is lesser, it returns 
`-1`.\r\n\r\n - `bigInt(5).compare(5)` => `0`\r\n - `bigInt(5).compare(4)` => 
`1`\r\n - `bigInt(4).compare(5)` => `-1`\r\n\r\n#### 
`compareAbs(number)`\r\n\r\nPerforms a comparison between the absolute value of 
two numbers.\r\n\r\n - `bigInt(5).compareAbs(-5)` => `0`\r\n - 
`bigInt(5).compareAbs(4)` => `1`\r\n - `bigInt(4).compareAbs(-5)` => 
`-1`\r\n\r\n#### `compareTo(number)`\r\n\r\nAlias for the `compare` 
method.\r\n\r\n#### `divide(number)`\r\n\r\nPerforms integer division, 
disregarding the remainder.\r\n\r\n - `bigInt(59).divide(5)` => `11`\r\n 
\r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)\r\n\r\n####
 `divmod(number)`\r\n\r\nPerforms divis
 ion and returns an object with two properties: `quotient` and `remainder`. The 
sign of the remainder will match the sign of the dividend.\r\n\r\n - 
`bigInt(59).divmod(5)` => `{quotient: bigInt(11), remainder: bigInt(4) }`\r\n - 
`bigInt(-5).divmod(2)` => `{quotient: bigInt(-2), remainder: bigInt(-1) }`\r\n 
\r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)\r\n\r\n####
 `eq(number)`\r\n\r\nAlias for the `equals` method.\r\n\r\n#### 
`equals(number)`\r\n\r\nChecks if two numbers are equal.\r\n\r\n - 
`bigInt(5).equals(5)` => `true`\r\n - `bigInt(4).equals(7)` => 
`false`\r\n\r\n#### `geq(number)`\r\n\r\nAlias for the `greaterOrEquals` 
method.\r\n\r\n\r\n#### `greater(number)`\r\n\r\nChecks if the first number is 
greater than the second.\r\n\r\n - `bigInt(5).greater(6)` => `false`\r\n - 
`bigInt(5).greater(5)` => `false`\r\n - `bigInt(5).greater(4)` => 
`true`\r\n\r\n#### `greaterOrEquals(number)`\r\n\r\nChecks if the first number 
is greater t
 han or equal to the second.\r\n\r\n - `bigInt(5).greaterOrEquals(6)` => 
`false`\r\n - `bigInt(5).greaterOrEquals(5)` => `true`\r\n - 
`bigInt(5).greaterOrEquals(4)` => `true`\r\n\r\n#### `gt(number)`\r\n\r\nAlias 
for the `greater` method.\r\n\r\n#### `isDivisibleBy(number)`\r\n\r\nReturns 
`true` if the first number is divisible by the second number, `false` 
otherwise.\r\n\r\n - `bigInt(999).isDivisibleBy(333)` => `true`\r\n - 
`bigInt(99).isDivisibleBy(5)` => `false`\r\n\r\n#### `isEven()`\r\n\r\nReturns 
`true` if the number is even, `false` otherwise.\r\n\r\n - `bigInt(6).isEven()` 
=> `true`\r\n - `bigInt(3).isEven()` => `false`\r\n\r\n#### 
`isNegative()`\r\n\r\nReturns `true` if the number is negative, `false` 
otherwise.\r\nReturns `false` for `0` and `-0`.\r\n\r\n - 
`bigInt(-23).isNegative()` => `true`\r\n - `bigInt(50).isNegative()` => 
`false`\r\n\r\n#### `isOdd()`\r\n\r\nReturns `true` if the number is odd, 
`false` otherwise.\r\n\r\n - `bigInt(13).isOdd()` => `true`\r\n - `bigInt
 (40).isOdd()` => `false`\r\n\r\n#### `isPositive()`\r\n\r\nReturn `true` if 
the number is positive, `false` otherwise.\r\nReturns `false` for `0` and 
`-0`.\r\n\r\n - `bigInt(54).isPositive()` => `true`\r\n - 
`bigInt(-1).isPositive()` => `false`\r\n\r\n#### `isPrime()`\r\n\r\nReturns 
`true` if the number is prime, `false` otherwise.\r\n\r\n - 
`bigInt(5).isPrime()` => `true`\r\n - `bigInt(6).isPrime()` => 
`false`\r\n\r\n#### `isProbablePrime([iterations])`\r\n\r\nReturns `true` if 
the number is very likely to be positive, `false` otherwise.\r\nArgument is 
optional and determines the amount of iterations of the test (default: `5`). 
The more iterations, the lower chance of getting a false positive.\r\nThis uses 
the [Fermat primality 
test](https://en.wikipedia.org/wiki/Fermat_primality_test).\r\n\r\n - 
`bigInt(5).isProbablePrime()` => `true`\r\n - `bigInt(49).isProbablePrime()` => 
`false`\r\n - `bigInt(1729).isProbablePrime(50)` => `false`\r\n \r\nNote that 
this function is not determini
 stic, since it relies on random sampling of factors, so the result for some 
numbers is not always the same. [Carmichael 
numbers](https://en.wikipedia.org/wiki/Carmichael_number) are particularly 
prone to give unreliable results.\r\n\r\nFor example, 
`bigInt(1729).isProbablePrime()` returns `false` about 76% of the time and 
`true` about 24% of the time. The correct result is `false`.\r\n\r\n#### 
`isUnit()`\r\n\r\nReturns `true` if the number is `1` or `-1`, `false` 
otherwise.\r\n\r\n - `bigInt.one.isUnit()` => `true`\r\n - 
`bigInt.minusOne.isUnit()` => `true`\r\n - `bigInt(5).isUnit()` => 
`false`\r\n\r\n#### `isZero()`\r\n\r\nReturn `true` if the number is `0` or 
`-0`, `false` otherwise.\r\n\r\n - `bigInt.zero.isZero()` => `true`\r\n - 
`bigInt(\"-0\").isZero()` => `true`\r\n - `bigInt(50).isZero()` => 
`false`\r\n\r\n#### `leq(number)`\r\n\r\nAlias for the `lesserOrEquals` 
method.\r\n\r\n#### `lesser(number)`\r\n\r\nChecks if the first number is 
lesser than the second.\r\n\r\n - `bigIn
 t(5).lesser(6)` => `true`\r\n - `bigInt(5).lesser(5)` => `false`\r\n - 
`bigInt(5).lesser(4)` => `false`\r\n\r\n#### 
`lesserOrEquals(number)`\r\n\r\nChecks if the first number is less than or 
equal to the second.\r\n\r\n - `bigInt(5).lesserOrEquals(6)` => `true`\r\n - 
`bigInt(5).lesserOrEquals(5)` => `true`\r\n - `bigInt(5).lesserOrEquals(4)` => 
`false`\r\n\r\n#### `lt(number)`\r\n\r\nAlias for the `lesser` 
method.\r\n\r\n#### `minus(number)`\r\n\r\nAlias for the `subtract` 
method.\r\n\r\n - `bigInt(3).minus(5)` => `-2`\r\n \r\n[View benchmarks for 
this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Subtraction)\r\n\r\n####
 `mod(number)`\r\n\r\nPerforms division and returns the remainder, disregarding 
the quotient. The sign of the remainder will match the sign of the 
dividend.\r\n\r\n - `bigInt(59).mod(5)` =>  `4`\r\n - `bigInt(-5).mod(2)` => 
`-1`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)\r\n\r\n####
 `modPow
 (exp, mod)`\r\n\r\nTakes the number to the power `exp` modulo `mod`.\r\n\r\n - 
`bigInt(10).modPow(3, 30)` => `10`\r\n\r\n#### 
`multiply(number)`\r\n\r\nPerforms multiplication.\r\n\r\n - 
`bigInt(111).multiply(111)` => `12321`\r\n\r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Multiplication)\r\n\r\n####
 `neq(number)`\r\n\r\nAlias for the `notEquals` method.\r\n\r\n#### 
`next()`\r\n\r\nAdds one to the number.\r\n\r\n - `bigInt(6).next()` => 
`7`\r\n\r\n#### `not()`\r\n\r\nPerforms the bitwise NOT operation. The operands 
are treated as if they were represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).\r\n\r\n - 
`bigInt(10).not()` => `-11`\r\n - `bigInt(0).not()` => `-1`\r\n\r\n#### 
`notEquals(number)`\r\n\r\nChecks if two numbers are not equal.\r\n\r\n - 
`bigInt(5).notEquals(5)` => `false`\r\n - `bigInt(4).notEquals(7)` => 
`true`\r\n\r\n#### `or(number)`\r\n\r\nPerforms the bitwise OR operation. 
 The operands are treated as if they were represented using [two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).\r\n\r\n - 
`bigInt(13).or(10)` => `15`\r\n - `bigInt(13).or(-8)` => `-3`\r\n\r\n#### 
`over(number)`\r\n\r\nAlias for the `divide` method.\r\n\r\n - 
`bigInt(59).over(5)` => `11`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)\r\n\r\n####
 `plus(number)`\r\n\r\nAlias for the `add` method.\r\n\r\n - 
`bigInt(5).plus(7)` => `12`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Addition)\r\n\r\n####
 `pow(number)`\r\n\r\nPerforms exponentiation. If the exponent is less than 
`0`, `pow` returns `0`. `bigInt.zero.pow(0)` returns `1`.\r\n\r\n - 
`bigInt(16).pow(16)` => `18446744073709551616`\r\n\r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Exponentiation)\r\n\r\n####
 `prev(number)`\r\n\r\nSubtracts one from the
  number.\r\n\r\n - `bigInt(6).prev()` => `5`\r\n\r\n#### 
`remainder(number)`\r\n\r\nAlias for the `mod` method.\r\n\r\n[View benchmarks 
for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Division)\r\n\r\n####
 `shiftLeft(n)`\r\n\r\nShifts the number left by `n` places in its binary 
representation. If a negative number is provided, it will shift right. Throws 
an error if `n` is outside of the range `[-9007199254740992, 
9007199254740992]`.\r\n\r\n - `bigInt(8).shiftLeft(2)` => `32`\r\n - 
`bigInt(8).shiftLeft(-2)` => `2`\r\n\r\n#### `shiftRight(n)`\r\n\r\nShifts the 
number right by `n` places in its binary representation. If a negative number 
is provided, it will shift left. Throws an error if `n` is outside of the range 
`[-9007199254740992, 9007199254740992]`.\r\n\r\n - `bigInt(8).shiftRight(2)` => 
`2`\r\n - `bigInt(8).shiftRight(-2)` => `32`\r\n\r\n#### 
`square()`\r\n\r\nSquares the number\r\n\r\n - `bigInt(3).square()` => `9`\r\n 
\r\n[View benchmarks for this metho
 d](http://peterolson.github.io/BigInteger.js/benchmark/#Squaring)\r\n\r\n#### 
`subtract(number)`\r\n\r\nPerforms subtraction.\r\n\r\n - 
`bigInt(3).subtract(5)` => `-2`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Subtraction)\r\n\r\n####
 `times(number)`\r\n\r\nAlias for the `multiply` method.\r\n\r\n - 
`bigInt(111).times(111)` => `12321`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#Multiplication)\r\n\r\n####
 `toJSNumber()`\r\n\r\nConverts a bigInt into a native Javascript number. Loses 
precision for numbers outside the range `[-9007199254740992, 
9007199254740992]`.\r\n\r\n - `bigInt(\"18446744073709551616\").toJSNumber()` 
=> `18446744073709552000`\r\n\r\n#### `xor(number)`\r\n\r\nPerforms the bitwise 
XOR operation. The operands are treated as if they were represented using 
[two's complement 
representation](http://en.wikipedia.org/wiki/Two%27s_complement).\r\n\r\n - 
`bigInt(12).xor(5)
 ` => `9`\r\n - `bigInt(12).xor(-5)` => `-9`\r\n \r\n### Static 
Methods\r\n\r\n#### `gcd(a, b)`\r\n\r\nFinds the greatest common denominator of 
`a` and `b`.\r\n\r\n - `bigInt.gcd(42,56)` => `14`\r\n\r\n#### 
`isInstance(x)`\r\n\r\nReturns `true` if `x` is a BigInteger, `false` 
otherwise.\r\n\r\n - `bigInt.isInstance(bigInt(14))` => `true`\r\n - 
`bigInt.isInstance(14)` => `false`\r\n \r\n#### `lcm(a,b)`\r\n\r\nFinds the 
least common multiple of `a` and `b`.\r\n \r\n - `bigInt.lcm(21, 6)` => 
`42`\r\n \r\n#### `max(a,b)`\r\n\r\nReturns the largest of `a` and `b`.\r\n\r\n 
- `bigInt.max(77, 432)` => `432`\r\n\r\n#### `min(a,b)`\r\n\r\nReturns the 
smallest of `a` and `b`.\r\n\r\n - `bigInt.min(77, 432)` => `77`\r\n\r\n#### 
`randBetween(min, max)`\r\n\r\nReturns a random number between `min` and 
`max`.\r\n\r\n - `bigInt.randBetween(\"-1e100\", \"1e100\")` => (for example) 
`8494907165436643479673097939554427056789510374838494147955756275846226209006506706784609314471378745`\r\n\r\n\r\n###
 Ove
 rride Methods\r\n\r\n#### `toString(radix = 10)`\r\n\r\nConverts a bigInt to a 
string. There is an optional radix parameter (which defaults to 10) that 
converts the number to the given radix. Digits in the range `10-35` will use 
the letters `a-z`.\r\n\r\n - `bigInt(\"1e9\").toString()` => 
`\"1000000000\"`\r\n - `bigInt(\"1e9\").toString(16)` => 
`\"3b9aca00\"`\r\n\r\n**Note that arithmetical operators will trigger the 
`valueOf` function rather than the `toString` function.** When converting a 
bigInteger to a string, you should use the `toString` method or the `String` 
function instead of adding the empty string.\r\n\r\n - 
`bigInt(\"999999999999999999\").toString()` => `\"999999999999999999\"`\r\n - 
`String(bigInt(\"999999999999999999\"))` => `\"999999999999999999\"`\r\n - 
`bigInt(\"999999999999999999\") + \"\"` => `1000000000000000000`\r\n\r\nBases 
larger than 36 are supported. If a digit is greater than or equal to 36, it 
will be enclosed in angle brackets.\r\n\r\n - `bigInt(567890)
 .toString(100)` => `\"<56><78><90>\"`\r\n\r\nNegative bases are also 
supported.\r\n\r\n - `bigInt(12345).toString(-10)` => `\"28465\"`\r\n\r\nBase 1 
and base -1 are also supported.\r\n\r\n - `bigInt(-15).toString(1)` => 
`\"-111111111111111\"`\r\n - `bigInt(-15).toString(-1)` => 
`\"101010101010101010101010101010\"`\r\n\r\nBase 0 is only allowed for the 
number zero.\r\n\r\n - `bigInt(0).toString(0)` => `0`\r\n - 
`bigInt(1).toString(0)` => `Error: Cannot convert nonzero numbers to base 
0.`\r\n \r\n[View benchmarks for this 
method](http://peterolson.github.io/BigInteger.js/benchmark/#toString)\r\n 
\r\n#### `valueOf()`\r\n\r\nConverts a bigInt to a native Javascript number. 
This override allows you to use native arithmetic operators without explicit 
conversion:\r\n\r\n - `bigInt(\"100\") + bigInt(\"200\") === 300; 
//true`\r\n\r\n## Contributors\r\n\r\nTo contribute, just fork the project, 
make some changes, and submit a pull request. Please verify that the unit tests 
pass before submitti
 ng.\r\n\r\nThe unit tests are contained in the `spec/spec.js` file. You can 
run them locally by opening the `spec/SpecRunner.html` or file or running `npm 
test`. You can also [run the tests online from 
GitHub](http://peterolson.github.io/BigInteger.js/spec/SpecRunner.html).\r\n\r\nThere
 are performance benchmarks that can be viewed from the `benchmarks/index.html` 
page. You can [run them online from 
GitHub](http://peterolson.github.io/BigInteger.js/benchmark/).\r\n\r\n## 
License\r\n\r\nThis project is public domain. For more details, read about the 
[Unlicense](http://unlicense.org/).",
+  "readmeFilename": "README.md",
+  "bugs": {
+    "url": "https://github.com/peterolson/BigInteger.js/issues";
+  },
+  "homepage": "https://github.com/peterolson/BigInteger.js#readme";,
+  "_id": "[email protected]",
+  "_shasum": "33d27d3b7388dfcc4b86d3130c10740cec01fb9e",
+  "_resolved": 
"https://registry.npmjs.org/big-integer/-/big-integer-1.6.15.tgz";,
+  "_from": "big-integer@>=1.6.7 <2.0.0"
+}

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/package.json
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/package.json 
b/node_modules/cordova-common/node_modules/bplist-parser/package.json
new file mode 100644
index 0000000..6685e00
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/bplist-parser/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "bplist-parser",
+  "version": "0.1.1",
+  "description": "Binary plist parser.",
+  "main": "bplistParser.js",
+  "scripts": {
+    "test": "./node_modules/nodeunit/bin/nodeunit test"
+  },
+  "keywords": [
+    "bplist",
+    "plist",
+    "parser"
+  ],
+  "author": {
+    "name": "Joe Ferner",
+    "email": "[email protected]"
+  },
+  "license": "MIT",
+  "devDependencies": {
+    "nodeunit": "~0.9.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/nearinfinity/node-bplist-parser.git";
+  },
+  "dependencies": {
+    "big-integer": "^1.6.7"
+  },
+  "readme": "bplist-parser\n=============\n\nBinary Mac OS X Plist (property 
list) parser.\n\n## Installation\n\n```bash\n$ npm install 
bplist-parser\n```\n\n## Quick Examples\n\n```javascript\nvar bplist = 
require('bplist-parser');\n\nbplist.parseFile('myPlist.bplist', function(err, 
obj) {\n  if (err) throw err;\n\n  
console.log(JSON.stringify(obj));\n});\n```\n\n## License\n\n(The MIT 
License)\n\nCopyright (c) 2012 Near Infinity Corporation\n\nPermission is 
hereby granted, free of charge, to any person obtaining\na copy of this 
software and associated documentation files (the\n\"Software\"), to deal in the 
Software without restriction, including\nwithout limitation the rights to use, 
copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of 
the Software, and to\npermit persons to whom the Software is furnished to do 
so, subject to\nthe following conditions:\n\nThe above copyright notice and 
this permission notice shall be\nincluded in all copies or substantial p
 ortions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT 
WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE 
WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE 
AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 
BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF 
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE 
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n",
+  "readmeFilename": "README.md",
+  "bugs": {
+    "url": "https://github.com/nearinfinity/node-bplist-parser/issues";
+  },
+  "homepage": "https://github.com/nearinfinity/node-bplist-parser#readme";,
+  "_id": "[email protected]",
+  "_shasum": "d60d5dcc20cba6dc7e1f299b35d3e1f95dafbae6",
+  "_resolved": 
"https://registry.npmjs.org/bplist-parser/-/bplist-parser-0.1.1.tgz";,
+  "_from": "bplist-parser@>=0.1.0 <0.2.0"
+}

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/airplay.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/airplay.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/airplay.bplist
new file mode 100644
index 0000000..931adea
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/airplay.bplist 
differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/iTunes-small.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/iTunes-small.bplist
 
b/node_modules/cordova-common/node_modules/bplist-parser/test/iTunes-small.bplist
new file mode 100644
index 0000000..b7edb14
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/iTunes-small.bplist
 differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/int64.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/int64.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/int64.bplist
new file mode 100644
index 0000000..6da9c04
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/int64.bplist 
differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/int64.xml
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/int64.xml 
b/node_modules/cordova-common/node_modules/bplist-parser/test/int64.xml
new file mode 100644
index 0000000..cc6cb03
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/bplist-parser/test/int64.xml
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" 
"http://www.apple.com/DTDs/PropertyList-1.0.dtd";>
+<plist version="1.0">
+  <dict>
+    <key>zero</key>
+    <integer>0</integer>
+    <key>int64item</key>
+    <integer>12345678901234567890</integer>
+  </dict>
+</plist>

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/parseTest.js
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/parseTest.js 
b/node_modules/cordova-common/node_modules/bplist-parser/test/parseTest.js
new file mode 100644
index 0000000..67e7bfa
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/bplist-parser/test/parseTest.js
@@ -0,0 +1,159 @@
+'use strict';
+
+// tests are adapted from https://github.com/TooTallNate/node-plist
+
+var path = require('path');
+var nodeunit = require('nodeunit');
+var bplist = require('../');
+
+module.exports = {
+  'iTunes Small': function (test) {
+    var file = path.join(__dirname, "iTunes-small.bplist");
+    var startTime1 = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime1) + 'ms');
+      var dict = dicts[0];
+      test.equal(dict['Application Version'], "9.0.3");
+      test.equal(dict['Library Persistent ID'], "6F81D37F95101437");
+      test.done();
+    });
+  },
+
+  'sample1': function (test) {
+    var file = path.join(__dirname, "sample1.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+      var dict = dicts[0];
+      test.equal(dict['CFBundleIdentifier'], 'com.apple.dictionary.MySample');
+      test.done();
+    });
+  },
+
+  'sample2': function (test) {
+    var file = path.join(__dirname, "sample2.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+      var dict = dicts[0];
+      test.equal(dict['PopupMenu'][2]['Key'], "\n        #import 
<Cocoa/Cocoa.h>\n\n#import <MacRuby/MacRuby.h>\n\nint main(int argc, char 
*argv[])\n{\n  return macruby_main(\"rb_main.rb\", argc, argv);\n}\n");
+      test.done();
+    });
+  },
+
+  'airplay': function (test) {
+    var file = path.join(__dirname, "airplay.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+
+      var dict = dicts[0];
+      test.equal(dict['duration'], 5555.0495000000001);
+      test.equal(dict['position'], 4.6269989039999997);
+      test.done();
+    });
+  },
+
+  'utf16': function (test) {
+    var file = path.join(__dirname, "utf16.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+
+      var dict = dicts[0];
+      test.equal(dict['CFBundleName'], 'sellStuff');
+      test.equal(dict['CFBundleShortVersionString'], '2.6.1');
+      test.equal(dict['NSHumanReadableCopyright'], '©2008-2012, sellStuff, 
Inc.');
+      test.done();
+    });
+  },
+
+  'utf16chinese': function (test) {
+    var file = path.join(__dirname, "utf16_chinese.plist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+
+      var dict = dicts[0];
+      test.equal(dict['CFBundleName'], '天翼阅读');
+      test.equal(dict['CFBundleDisplayName'], '天翼阅读');
+      test.done();
+    });
+  },
+
+
+
+  'uid': function (test) {
+    var file = path.join(__dirname, "uid.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+
+      var dict = dicts[0];
+      test.deepEqual(dict['$objects'][1]['NS.keys'], [{UID:2}, {UID:3}, 
{UID:4}]);
+      test.deepEqual(dict['$objects'][1]['NS.objects'], [{UID: 5}, {UID:6}, 
{UID:7}]);
+      test.deepEqual(dict['$top']['root'], {UID:1});
+      test.done();
+    });
+  },
+  
+  'int64': function (test) {
+    var file = path.join(__dirname, "int64.bplist");
+    var startTime = new Date();
+
+    bplist.parseFile(file, function (err, dicts) {
+      if (err) {
+        throw err;
+      }
+
+      var endTime = new Date();
+      console.log('Parsed "' + file + '" in ' + (endTime - startTime) + 'ms');
+      var dict = dicts[0];
+      test.equal(dict['zero'], '0');
+      test.equal(dict['int64item'], '12345678901234567890');
+      test.done();
+    });
+  }
+};

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/sample1.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/sample1.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/sample1.bplist
new file mode 100644
index 0000000..5b808ff
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/sample1.bplist 
differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/sample2.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/sample2.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/sample2.bplist
new file mode 100644
index 0000000..fc42979
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/sample2.bplist 
differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/uid.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/uid.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/uid.bplist
new file mode 100644
index 0000000..59f341e
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/uid.bplist differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/utf16.bplist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/utf16.bplist 
b/node_modules/cordova-common/node_modules/bplist-parser/test/utf16.bplist
new file mode 100644
index 0000000..ba4bcfa
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/utf16.bplist 
differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/bplist-parser/test/utf16_chinese.plist
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/bplist-parser/test/utf16_chinese.plist
 
b/node_modules/cordova-common/node_modules/bplist-parser/test/utf16_chinese.plist
new file mode 100644
index 0000000..ba1e2d7
Binary files /dev/null and 
b/node_modules/cordova-common/node_modules/bplist-parser/test/utf16_chinese.plist
 differ

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/.npmignore
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/.npmignore 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/.npmignore
new file mode 100644
index 0000000..3c3629e
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/.npmignore
@@ -0,0 +1 @@
+node_modules

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/.travis.yml
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/.travis.yml 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/.travis.yml
new file mode 100644
index 0000000..ae381fc
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/.travis.yml
@@ -0,0 +1,7 @@
+language: node_js
+sudo: false 
+node_js:
+  - "0.10"
+install: npm install
+script:
+  - npm test

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/README.md
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/README.md 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/README.md
new file mode 100644
index 0000000..3b93e5f
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/cordova-registry-mapper/README.md
@@ -0,0 +1,14 @@
+[![Build 
Status](https://travis-ci.org/stevengill/cordova-registry-mapper.svg?branch=master)](https://travis-ci.org/stevengill/cordova-registry-mapper)
+
+#Cordova Registry Mapper
+
+This module is used to map Cordova plugin ids to package names and vice versa.
+
+When Cordova users add plugins to their projects using ids
+(e.g. `cordova plugin add org.apache.cordova.device`),
+this module will map that id to the corresponding package name so 
`cordova-lib` knows what to fetch from **npm**.
+
+This module was created so the Apache Cordova project could migrate its 
plugins from
+the [Cordova Registry](http://registry.cordova.io/)
+to [npm](https://registry.npmjs.com/)
+instead of having to maintain a registry.

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/index.js
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/index.js 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/index.js
new file mode 100644
index 0000000..4550774
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/cordova-registry-mapper/index.js
@@ -0,0 +1,204 @@
+var map = {
+    'org.apache.cordova.battery-status':'cordova-plugin-battery-status',
+    'org.apache.cordova.camera':'cordova-plugin-camera',
+    'org.apache.cordova.console':'cordova-plugin-console',
+    'org.apache.cordova.contacts':'cordova-plugin-contacts',
+    'org.apache.cordova.device':'cordova-plugin-device',
+    'org.apache.cordova.device-motion':'cordova-plugin-device-motion',
+    
'org.apache.cordova.device-orientation':'cordova-plugin-device-orientation',
+    'org.apache.cordova.dialogs':'cordova-plugin-dialogs',
+    'org.apache.cordova.file':'cordova-plugin-file',
+    'org.apache.cordova.file-transfer':'cordova-plugin-file-transfer',
+    'org.apache.cordova.geolocation':'cordova-plugin-geolocation',
+    'org.apache.cordova.globalization':'cordova-plugin-globalization',
+    'org.apache.cordova.inappbrowser':'cordova-plugin-inappbrowser',
+    'org.apache.cordova.media':'cordova-plugin-media',
+    'org.apache.cordova.media-capture':'cordova-plugin-media-capture',
+    
'org.apache.cordova.network-information':'cordova-plugin-network-information',
+    'org.apache.cordova.splashscreen':'cordova-plugin-splashscreen',
+    'org.apache.cordova.statusbar':'cordova-plugin-statusbar',
+    'org.apache.cordova.vibration':'cordova-plugin-vibration',
+    'org.apache.cordova.test-framework':'cordova-plugin-test-framework',
+    'com.msopentech.websql' : 'cordova-plugin-websql',
+    'com.msopentech.indexeddb' : 'cordova-plugin-indexeddb',
+    'com.microsoft.aad.adal' : 'cordova-plugin-ms-adal',
+    'com.microsoft.capptain' : 'capptain-cordova',
+    'com.microsoft.services.aadgraph' : 'cordova-plugin-ms-aad-graph',
+    'com.microsoft.services.files' : 'cordova-plugin-ms-files',
+    'om.microsoft.services.outlook' : 'cordova-plugin-ms-outlook',
+    'com.pbakondy.sim' : 'cordova-plugin-sim',
+    'android.support.v4' : 'cordova-plugin-android-support-v4',
+    'android.support.v7-appcompat' : 
'cordova-plugin-android-support-v7-appcompat',
+    'com.google.playservices' : 'cordova-plugin-googleplayservices',
+    'com.google.cordova.admob' : 'cordova-plugin-admobpro',
+    'com.rjfun.cordova.extension' : 'cordova-plugin-extension',
+    'com.rjfun.cordova.plugin.admob' : 'cordova-plugin-admob',
+    'com.rjfun.cordova.flurryads' : 'cordova-plugin-flurry',
+    'com.rjfun.cordova.facebookads' : 'cordova-plugin-facebookads',
+    'com.rjfun.cordova.httpd' : 'cordova-plugin-httpd',
+    'com.rjfun.cordova.iad' : 'cordova-plugin-iad',
+    'com.rjfun.cordova.iflyspeech' : 'cordova-plugin-iflyspeech',
+    'com.rjfun.cordova.lianlianpay' : 'cordova-plugin-lianlianpay',
+    'com.rjfun.cordova.mobfox' : 'cordova-plugin-mobfox',
+    'com.rjfun.cordova.mopub' : 'cordova-plugin-mopub',
+    'com.rjfun.cordova.mmedia' : 'cordova-plugin-mmedia',
+    'com.rjfun.cordova.nativeaudio' : 'cordova-plugin-nativeaudio',
+    'com.rjfun.cordova.plugin.paypalmpl' : 'cordova-plugin-paypalmpl',
+    'com.rjfun.cordova.smartadserver' : 'cordova-plugin-smartadserver',
+    'com.rjfun.cordova.sms' : 'cordova-plugin-sms',
+    'com.rjfun.cordova.wifi' : 'cordova-plugin-wifi',
+    'com.ohh2ahh.plugins.appavailability' : 'cordova-plugin-appavailability',
+    'org.adapt-it.cordova.fonts' : 'cordova-plugin-fonts',
+    'de.martinreinhardt.cordova.plugins.barcodeScanner' : 
'cordova-plugin-barcodescanner',
+    'de.martinreinhardt.cordova.plugins.urlhandler' : 
'cordova-plugin-urlhandler',
+    'de.martinreinhardt.cordova.plugins.email' : 'cordova-plugin-email',
+    'de.martinreinhardt.cordova.plugins.certificates' : 
'cordova-plugin-certificates',
+    'de.martinreinhardt.cordova.plugins.sqlite' : 'cordova-plugin-sqlite',
+    'fr.smile.cordova.fileopener' : 'cordova-plugin-fileopener',
+    'org.smile.websqldatabase.initializer' : 
'cordova-plugin-websqldatabase-initializer',
+    'org.smile.websqldatabase.wpdb' : 'cordova-plugin-websqldatabase',
+    'org.jboss.aerogear.cordova.push' : 'aerogear-cordova-push',
+    'org.jboss.aerogear.cordova.oauth2' : 'aerogear-cordova-oauth2',
+    'org.jboss.aerogear.cordova.geo' : 'aerogear-cordova-geo',
+    'org.jboss.aerogear.cordova.crypto' : 'aerogear-cordova-crypto',
+    'org.jboss.aerogaer.cordova.otp' : 'aerogear-cordova-otp',
+    'uk.co.ilee.applewatch' : 'cordova-plugin-apple-watch',
+    'uk.co.ilee.directions' : 'cordova-plugin-directions',
+    'uk.co.ilee.gamecenter' : 'cordova-plugin-game-center',
+    'uk.co.ilee.jailbreakdetection' : 'cordova-plugin-jailbreak-detection',
+    'uk.co.ilee.nativetransitions' : 'cordova-plugin-native-transitions',
+    'uk.co.ilee.pedometer' : 'cordova-plugin-pedometer',
+    'uk.co.ilee.shake' : 'cordova-plugin-shake',
+    'uk.co.ilee.touchid' : 'cordova-plugin-touchid',
+    'com.knowledgecode.cordova.websocket' : 'cordova-plugin-websocket',
+    'com.elixel.plugins.settings' : 'cordova-plugin-settings',
+    'com.cowbell.cordova.geofence' : 'cordova-plugin-geofence',
+    'com.blackberry.community.preventsleep' : 'cordova-plugin-preventsleep',
+    'com.blackberry.community.gamepad' : 'cordova-plugin-gamepad',
+    'com.blackberry.community.led' : 'cordova-plugin-led',
+    'com.blackberry.community.thumbnail' : 'cordova-plugin-thumbnail',
+    'com.blackberry.community.mediakeys' : 'cordova-plugin-mediakeys',
+    'com.blackberry.community.simplebtlehrplugin' : 
'cordova-plugin-bluetoothheartmonitor',
+    'com.blackberry.community.simplebeaconplugin' : 
'cordova-plugin-bluetoothibeacon',
+    'com.blackberry.community.simplebtsppplugin' : 
'cordova-plugin-bluetoothspp',
+    'com.blackberry.community.clipboard' : 'cordova-plugin-clipboard',
+    'com.blackberry.community.curl' : 'cordova-plugin-curl',
+    'com.blackberry.community.qt' : 'cordova-plugin-qtbridge',
+    'com.blackberry.community.upnp' : 'cordova-plugin-upnp',
+    'com.blackberry.community.PasswordCrypto' : 
'cordova-plugin-password-crypto',
+    'com.blackberry.community.deviceinfoplugin' : 'cordova-plugin-deviceinfo',
+    'com.blackberry.community.gsecrypto' : 'cordova-plugin-bb-crypto',
+    'com.blackberry.community.mongoose' : 'cordova-plugin-mongoose',
+    'com.blackberry.community.sysdialog' : 'cordova-plugin-bb-sysdialog',
+    'com.blackberry.community.screendisplay' : 'cordova-plugin-screendisplay',
+    'com.blackberry.community.messageplugin' : 
'cordova-plugin-bb-messageretrieve',
+    'com.blackberry.community.emailsenderplugin' : 
'cordova-plugin-emailsender',
+    'com.blackberry.community.audiometadata' : 'cordova-plugin-audiometadata',
+    'com.blackberry.community.deviceemails' : 'cordova-plugin-deviceemails',
+    'com.blackberry.community.audiorecorder' : 'cordova-plugin-audiorecorder',
+    'com.blackberry.community.vibration' : 'cordova-plugin-vibrate-intense',
+    'com.blackberry.community.SMSPlugin' : 'cordova-plugin-bb-sms',
+    'com.blackberry.community.extractZipFile' : 'cordova-plugin-bb-zip',
+    'com.blackberry.community.lowlatencyaudio' : 
'cordova-plugin-bb-nativeaudio',
+    'com.blackberry.community.barcodescanner' : 
'phonegap-plugin-barcodescanner',
+    'com.blackberry.app' : 'cordova-plugin-bb-app',
+    'com.blackberry.bbm.platform' : 'cordova-plugin-bbm',
+    'com.blackberry.connection' : 'cordova-plugin-bb-connection',
+    'com.blackberry.identity' : 'cordova-plugin-bb-identity',
+    'com.blackberry.invoke.card' : 'cordova-plugin-bb-card',
+    'com.blackberry.invoke' : 'cordova-plugin-bb-invoke',
+    'com.blackberry.invoked' : 'cordova-plugin-bb-invoked',
+    'com.blackberry.io.filetransfer' : 'cordova-plugin-bb-filetransfer',
+    'com.blackberry.io' : 'cordova-plugin-bb-io',
+    'com.blackberry.notification' : 'cordova-plugin-bb-notification',
+    'com.blackberry.payment' : 'cordova-plugin-bb-payment',
+    'com.blackberry.pim.calendar' : 'cordova-plugin-bb-calendar',
+    'com.blackberry.pim.contacts' : 'cordova-plugin-bb-contacts',
+    'com.blackberry.pim.lib' : 'cordova-plugin-bb-pimlib',
+    'com.blackberry.push' : 'cordova-plugin-bb-push',
+    'com.blackberry.screenshot' : 'cordova-plugin-screenshot',
+    'com.blackberry.sensors' : 'cordova-plugin-bb-sensors',
+    'com.blackberry.system' : 'cordova-plugin-bb-system',
+    'com.blackberry.ui.contextmenu' : 'cordova-plugin-bb-ctxmenu',
+    'com.blackberry.ui.cover' : 'cordova-plugin-bb-cover',
+    'com.blackberry.ui.dialog' : 'cordova-plugin-bb-dialog',
+    'com.blackberry.ui.input' : 'cordova-plugin-touch-keyboard',
+    'com.blackberry.ui.toast' : 'cordova-plugin-toast',
+    'com.blackberry.user.identity' : 'cordova-plugin-bb-idservice',
+    'com.blackberry.utils' : 'cordova-plugin-bb-utils',
+    'net.yoik.cordova.plugins.screenorientation' : 
'cordova-plugin-screen-orientation',
+    'com.phonegap.plugins.barcodescanner' : 'phonegap-plugin-barcodescanner',
+    'com.manifoldjs.hostedwebapp' : 'cordova-plugin-hostedwebapp',
+    'com.initialxy.cordova.themeablebrowser' : 
'cordova-plugin-themeablebrowser',
+    'gr.denton.photosphere' : 'cordova-plugin-panoramaviewer',
+    'nl.x-services.plugins.actionsheet' : 'cordova-plugin-actionsheet',
+    'nl.x-services.plugins.socialsharing' : 'cordova-plugin-x-socialsharing',
+    'nl.x-services.plugins.googleplus' : 'cordova-plugin-googleplus',
+    'nl.x-services.plugins.insomnia' : 'cordova-plugin-insomnia',
+    'nl.x-services.plugins.toast' : 'cordova-plugin-x-toast',
+    'nl.x-services.plugins.calendar' : 'cordova-plugin-calendar',
+    'nl.x-services.plugins.launchmyapp' : 'cordova-plugin-customurlscheme',
+    'nl.x-services.plugins.flashlight' : 'cordova-plugin-flashlight',
+    'nl.x-services.plugins.sslcertificatechecker' : 
'cordova-plugin-sslcertificatechecker',
+    'com.bridge.open' : 'cordova-open',
+    'com.bridge.safe' : 'cordova-safe',
+    'com.disusered.open' : 'cordova-open',
+    'com.disusered.safe' : 'cordova-safe',
+    'me.apla.cordova.app-preferences' : 'cordova-plugin-app-preferences',
+    'com.konotor.cordova' : 'cordova-plugin-konotor',
+    'io.intercom.cordova' : 'cordova-plugin-intercom',
+    'com.onesignal.plugins.onesignal' : 'onesignal-cordova-plugin',
+    'com.danjarvis.document-contract': 'cordova-plugin-document-contract',
+    'com.eface2face.iosrtc' : 'cordova-plugin-iosrtc',
+    'com.mobileapptracking.matplugin' : 'cordova-plugin-tune',
+    'com.marianhello.cordova.background-geolocation' : 
'cordova-plugin-mauron85-background-geolocation',
+    'fr.louisbl.cordova.locationservices' : 'cordova-plugin-locationservices',
+    'fr.louisbl.cordova.gpslocation' : 'cordova-plugin-gpslocation',
+    'com.hiliaox.weibo' : 'cordova-plugin-weibo',
+    'com.uxcam.cordova.plugin' : 'cordova-uxcam',
+    'de.fastr.phonegap.plugins.downloader' : 
'cordova-plugin-fastrde-downloader',
+    'de.fastr.phonegap.plugins.injectView' : 
'cordova-plugin-fastrde-injectview',
+    'de.fastr.phonegap.plugins.CheckGPS' : 'cordova-plugin-fastrde-checkgps',
+    'de.fastr.phonegap.plugins.md5chksum' : 'cordova-plugin-fastrde-md5',
+    'io.repro.cordova' : 'cordova-plugin-repro',
+    're.notifica.cordova': 'cordova-plugin-notificare-push',
+    'com.megster.cordova.ble': 'cordova-plugin-ble-central',
+    'com.megster.cordova.bluetoothserial': 'cordova-plugin-bluetooth-serial',
+    'com.megster.cordova.rfduino': 'cordova-plugin-rfduino',
+    'cz.velda.cordova.plugin.devicefeedback': 
'cordova-plugin-velda-devicefeedback',
+    'cz.Velda.cordova.plugin.devicefeedback': 
'cordova-plugin-velda-devicefeedback',
+    'org.scriptotek.appinfo': 'cordova-plugin-appinfo',
+    'com.yezhiming.cordova.appinfo': 'cordova-plugin-appinfo',
+    'pl.makingwaves.estimotebeacons': 'cordova-plugin-estimote',
+    'com.evothings.ble': 'cordova-plugin-ble',
+    'com.appsee.plugin' : 'cordova-plugin-appsee',
+    'am.armsoft.plugins.listpicker': 'cordova-plugin-listpicker',
+    'com.pushbots.push': 'pushbots-cordova-plugin',
+    'com.admob.google': 'cordova-admob',
+    'admob.ads.google': 'cordova-admob-ads',
+    'admob.google.plugin': 'admob-google',
+    'com.admob.admobads': 'admob-ads',
+    'com.connectivity.monitor': 'cordova-connectivity-monitor',
+    'com.ios.libgoogleadmobads': 'cordova-libgoogleadmobads',
+    'com.google.play.services': 'cordova-google-play-services',
+    'android.support.v13': 'cordova-android-support-v13',
+    'android.support.v4': 'cordova-android-support-v4', // Duplicated key ;)
+    'com.analytics.google': 'cordova-plugin-analytics',
+    'com.analytics.adid.google': 'cordova-plugin-analytics-adid',
+    'com.chariotsolutions.nfc.plugin': 'phonegap-nfc',
+    'com.samz.mixpanel': 'cordova-plugin-mixpanel',
+    'de.appplant.cordova.common.RegisterUserNotificationSettings': 
'cordova-plugin-registerusernotificationsettings',
+    'plugin.google.maps': 'cordova-plugin-googlemaps',
+    'xu.li.cordova.wechat': 'cordova-plugin-wechat',
+    'es.keensoft.fullscreenimage': 'cordova-plugin-fullscreenimage',
+    'com.arcoirislabs.plugin.mqtt' : 'cordova-plugin-mqtt'
+};
+
+module.exports.oldToNew = map;
+
+var reverseMap = {};
+Object.keys(map).forEach(function(elem){
+    reverseMap[map[elem]] = elem;
+});
+
+module.exports.newToOld = reverseMap;

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/package.json
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/package.json 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/package.json
new file mode 100644
index 0000000..952d753
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/package.json
@@ -0,0 +1,51 @@
+{
+  "name": "cordova-registry-mapper",
+  "version": "1.1.15",
+  "description": "Maps old plugin ids to new plugin names for fetching from 
npm",
+  "main": "index.js",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/stevengill/cordova-registry-mapper.git";
+  },
+  "scripts": {
+    "test": "node tests/test.js"
+  },
+  "keywords": [
+    "cordova",
+    "plugins"
+  ],
+  "author": {
+    "name": "Steve Gill"
+  },
+  "license": "Apache version 2.0",
+  "devDependencies": {
+    "tape": "^3.5.0"
+  },
+  "gitHead": "00af0f028ec94154a364eeabe38b8e22320647bd",
+  "bugs": {
+    "url": "https://github.com/stevengill/cordova-registry-mapper/issues";
+  },
+  "homepage": "https://github.com/stevengill/cordova-registry-mapper#readme";,
+  "_id": "[email protected]",
+  "_shasum": "e244b9185b8175473bff6079324905115f83dc7c",
+  "_from": "cordova-registry-mapper@>=1.1.8 <2.0.0",
+  "_npmVersion": "3.5.3",
+  "_nodeVersion": "5.4.1",
+  "_npmUser": {
+    "name": "stevegill",
+    "email": "[email protected]"
+  },
+  "dist": {
+    "shasum": "e244b9185b8175473bff6079324905115f83dc7c",
+    "tarball": 
"https://registry.npmjs.org/cordova-registry-mapper/-/cordova-registry-mapper-1.1.15.tgz";
+  },
+  "maintainers": [
+    {
+      "name": "stevegill",
+      "email": "[email protected]"
+    }
+  ],
+  "directories": {},
+  "_resolved": 
"https://registry.npmjs.org/cordova-registry-mapper/-/cordova-registry-mapper-1.1.15.tgz";,
+  "readme": "ERROR: No README data found!"
+}

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/cordova-registry-mapper/tests/test.js
----------------------------------------------------------------------
diff --git 
a/node_modules/cordova-common/node_modules/cordova-registry-mapper/tests/test.js
 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/tests/test.js
new file mode 100644
index 0000000..35343be
--- /dev/null
+++ 
b/node_modules/cordova-common/node_modules/cordova-registry-mapper/tests/test.js
@@ -0,0 +1,11 @@
+var test = require('tape');
+var oldToNew = require('../index').oldToNew;
+var newToOld = require('../index').newToOld;
+
+test('plugin mappings exist', function(t) {
+    t.plan(2);
+
+    t.equal('cordova-plugin-device', oldToNew['org.apache.cordova.device']);
+
+    t.equal('org.apache.cordova.device', newToOld['cordova-plugin-device']);
+})

http://git-wip-us.apache.org/repos/asf/cordova-windows/blob/4c0c81a1/node_modules/cordova-common/node_modules/glob/LICENSE
----------------------------------------------------------------------
diff --git a/node_modules/cordova-common/node_modules/glob/LICENSE 
b/node_modules/cordova-common/node_modules/glob/LICENSE
new file mode 100644
index 0000000..19129e3
--- /dev/null
+++ b/node_modules/cordova-common/node_modules/glob/LICENSE
@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter and Contributors
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to