bfg-common 1.0.24 → 1.0.26

package/public/spice-console/lib/prng4.js

@@ -1,64 +1,64 @@
-/*
-    Copyright (c) 2016 eyeOS
-
-    This file is part of Open365.
-
-    Open365 is free software: you can redistribute it and/or modify
-    it under the terms of the GNU Affero General Public License as
-    published by the Free Software Foundation, either version 3 of the
-    License, or (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Affero General Public License for more details.
-
-    You should have received a copy of the GNU Affero General Public License
-    along with this program. If not, see <http://www.gnu.org/licenses/>.
-*/
-
-// prng4.js - uses Arcfour as a PRNG
-
-function Arcfour() {
-  this.i = 0;
-  this.j = 0;
-  this.S = new Array();
-}
-
-// Initialize arcfour context from key, an array of ints, each from [0..255]
-function ARC4init(key) {
-  var i, j, t;
-  for(i = 0; i < 256; ++i)
-    this.S[i] = i;
-  j = 0;
-  for(i = 0; i < 256; ++i) {
-    j = (j + this.S[i] + key[i % key.length]) & 255;
-    t = this.S[i];
-    this.S[i] = this.S[j];
-    this.S[j] = t;
-  }
-  this.i = 0;
-  this.j = 0;
-}
-
-function ARC4next() {
-  var t;
-  this.i = (this.i + 1) & 255;
-  this.j = (this.j + this.S[this.i]) & 255;
-  t = this.S[this.i];
-  this.S[this.i] = this.S[this.j];
-  this.S[this.j] = t;
-  return this.S[(t + this.S[this.i]) & 255];
-}
-
-Arcfour.prototype.init = ARC4init;
-Arcfour.prototype.next = ARC4next;
-
-// Plug in your RNG constructor here
-function prng_newstate() {
-  return new Arcfour();
-}
-
-// Pool size must be a multiple of 4 and greater than 32.
-// An array of bytes the size of the pool will be passed to init()
-var rng_psize = 256;
+/*
+    Copyright (c) 2016 eyeOS
+
+    This file is part of Open365.
+
+    Open365 is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as
+    published by the Free Software Foundation, either version 3 of the
+    License, or (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero General Public License
+    along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+// prng4.js - uses Arcfour as a PRNG
+
+function Arcfour() {
+  this.i = 0;
+  this.j = 0;
+  this.S = new Array();
+}
+
+// Initialize arcfour context from key, an array of ints, each from [0..255]
+function ARC4init(key) {
+  var i, j, t;
+  for(i = 0; i < 256; ++i)
+    this.S[i] = i;
+  j = 0;
+  for(i = 0; i < 256; ++i) {
+    j = (j + this.S[i] + key[i % key.length]) & 255;
+    t = this.S[i];
+    this.S[i] = this.S[j];
+    this.S[j] = t;
+  }
+  this.i = 0;
+  this.j = 0;
+}
+
+function ARC4next() {
+  var t;
+  this.i = (this.i + 1) & 255;
+  this.j = (this.j + this.S[this.i]) & 255;
+  t = this.S[this.i];
+  this.S[this.i] = this.S[this.j];
+  this.S[this.j] = t;
+  return this.S[(t + this.S[this.i]) & 255];
+}
+
+Arcfour.prototype.init = ARC4init;
+Arcfour.prototype.next = ARC4next;
+
+// Plug in your RNG constructor here
+function prng_newstate() {
+  return new Arcfour();
+}
+
+// Pool size must be a multiple of 4 and greater than 32.
+// An array of bytes the size of the pool will be passed to init()
+var rng_psize = 256;

package/public/spice-console/lib/queue.js

@@ -1,259 +1,259 @@
-/*
-    Copyright (c) 2016 eyeOS
-
-    This file is part of Open365.
-
-    Open365 is free software: you can redistribute it and/or modify
-    it under the terms of the GNU Affero General Public License as
-    published by the Free Software Foundation, either version 3 of the
-    License, or (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Affero General Public License for more details.
-
-    You should have received a copy of the GNU Affero General Public License
-    along with this program. If not, see <http://www.gnu.org/licenses/>.
-*/
-
-Uint8Array.prototype.toJSArray = function() {
-    if(this.length == 1) {
-        return [this[0]];
-    }
-
-    var len = this.length;
-    var arr = new Array(len);
-
-    for(var i=0;i<len;i++) {
-        arr[i] = this[i];
-    }
-    return arr;
-}
-
-wdi.FixedQueue = $.spcExtend(wdi.DomainObject, {
-	q: null,
-	size: 1024*1024*10,
-    grow: 1024*1024*10,
-	woffset: 0,
-    roffset: 0,
-
-	init: function(c) {
-		this.q = new Uint8Array(this.size);
-	},
-
-    setData: function(q) {
-        this.woffset = q.length;
-        this.roffset = 0;
-        this.q.set(q);
-    },
-
-	shift: function(elements) {
-        if(this.roffset + elements > this.woffset) {
-            throw "Not enough queue to read";
-        }
-        var toreturn = this.q.subarray(this.roffset, this.roffset + elements);
-        this.roffset = this.roffset + elements;
-        if(this.woffset == this.roffset) {
-            this.woffset = 0;
-            this.roffset = 0;
-        }
-		return toreturn;
-	},
-
-	push: function(collection) {
-        if(this.woffset + collection.byteLength > this.size) {
-            //we need to make the queue bigger...
-            var oldq = this.q;
-            this.size += this.grow;
-            this.q = new Uint8Array(this.size);
-            this.q.set(oldq);
-        }
-        this.q.set(collection, this.woffset);
-        this.woffset += collection.byteLength;
-	},
-
-	getLength: function() {
-		return this.woffset-this.roffset;
-	}
-});
-
-
-wdi.Queue = $.spcExtend(wdi.DomainObject, {
-	q: null,
-    raw: false,
-
-	init: function(c) {
-        if(c.raw) {
-            this.raw = c.raw;
-        }
-		this.q = new Uint8Array(0);
-	},
-
-	getData: function() {
-		return this.toJSArray(this.q);
-	},
-
-	setData: function(q) {
-        this.q = new Uint8Array(q.length);
-		this.q.set(q);
-	},
-
-	shift: function() {
-		var elements = arguments[0] || this.getLength();
-
-		if (elements === this.q.length) {
-			var toreturn = this.q;
-			this.q = new Uint8Array(0);
-		} else {
-			var toreturn = this.q.subarray(0, elements);
-			this.q = this.q.subarray(elements);
-		}
-
-        return this.toJSArray(toreturn)
-	},
-
-	peek: function(begin, end) {
-        var tmp = null;
-        if(begin == 0 && !end) {
-            tmp = this.q; //read the entire queue
-        } else {
-            tmp = this.q.subarray(begin, end);
-        }
-		return this.toJSArray(tmp);
-	},
-
-	push: function(collection) {
-		if (typeof collection == 'string') {
-            var len = collection.length;
-            var newq = new Uint8Array(this.q.length+len);
-            newq.set(this.q);
-            for(var i=0;i<len;i++) {
-                newq[i+this.q.length] = collection[i];
-            }
-            this.q = newq;
-		} else {
-			if(this.getLength() === 0) {
-				this.q = new Uint8Array(collection.length);
-                this.q.set(collection);
-			} else {
-                var newq = new Uint8Array(collection.length+this.q.length);
-                newq.set(this.q);
-                newq.set(collection, this.q.length);
-				this.q = newq;
-			}
-		}
-	},
-
-	getLength: function() {
-		return this.q.length;
-	},
-
-    toJSArray: function(data) {
-        if(this.raw) {
-            return data;
-        }
-
-        return data.toJSArray();
-    }
-});
-
-wdi.ViewQueue = $.spcExtend(wdi.DomainObject, {
-	q: null,
-	at: null,
-
-	init: function() {
-		this.q = new Uint8Array();
-		this.at = 0;
-	},
-
-	getData: function() {
-		return this.toJSArray(this.q.subarray(this.at));
-	},
-
-    getDataOffset: function(pos) {
-   		return this.toJSArray(this.q.subarray(pos));
-   	},
-
-    getRawData: function() {
-   		return this.q.subarray(this.at);
-   	},
-
-    getRawDataOffset: function(pos) {
-        return this.q.subarray(pos);
-    },
-
-	setData: function(q) {
-		this.q = new Uint8Array(q.length);
-        this.q.set(q);
-		this.at = 0;
-	},
-
-	shift: function(length) {
-		var elements = length || this.getLength();
-		if(elements > this.getLength()) {
-			elements = this.getLength();
-		}
-		var ret = this.q.subarray(0+this.at, elements+this.at);
-		this.at += elements;
-		return this.toJSArray(ret);
-	},
-
-    eatBytes: function(bytes) {
-        this.at += bytes;
-    },
-
-    getByte: function(pos) {
-        return this.q[pos+this.at];
-    },
-
-	peek: function(begin, end) {
-        var tmp = null;
-        if(begin == 0 && !end) {
-            tmp = this.q; //read the entire queue
-        } else {
-            if(end) {
-                end += this.at;
-            }
-            tmp = this.q.subarray(begin+this.at, end);
-        }
-		return this.toJSArray(tmp);
-	},
-
-    push: function(collection) {
-   		if (typeof collection == 'string') {
-               var len = collection.length;
-               var newq = new Uint8Array(this.q.length+len);
-               newq.set(this.q);
-               for(var i=0;i<len;i++) {
-                   newq[i+this.q.length] = collection[i];
-               }
-               this.q = newq;
-   		} else {
-   			if(this.getLength() === 0) {
-   				this.q = new Uint8Array(collection.length);
-                   this.q.set(collection);
-   			} else {
-               var newq = new Uint8Array(collection.length+this.q.length);
-               newq.set(this.q);
-               newq.set(collection, this.q.length);
-   				this.q = newq;
-   			}
-   		}
-   	},
-
-	getLength: function() {
-		return this.q.length-this.at;
-	},
-
-	getPosition: function() {
-		return this.at;
-	},
-    toJSArray: function(data) {
-        if(data.length == 1) {
-            return [data[0]];
-        }
-        return data.toJSArray();
-    }
-});
-
+/*
+    Copyright (c) 2016 eyeOS
+
+    This file is part of Open365.
+
+    Open365 is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as
+    published by the Free Software Foundation, either version 3 of the
+    License, or (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero General Public License
+    along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+Uint8Array.prototype.toJSArray = function() {
+    if(this.length == 1) {
+        return [this[0]];
+    }
+
+    var len = this.length;
+    var arr = new Array(len);
+
+    for(var i=0;i<len;i++) {
+        arr[i] = this[i];
+    }
+    return arr;
+}
+
+wdi.FixedQueue = $.spcExtend(wdi.DomainObject, {
+	q: null,
+	size: 1024*1024*10,
+    grow: 1024*1024*10,
+	woffset: 0,
+    roffset: 0,
+
+	init: function(c) {
+		this.q = new Uint8Array(this.size);
+	},
+
+    setData: function(q) {
+        this.woffset = q.length;
+        this.roffset = 0;
+        this.q.set(q);
+    },
+
+	shift: function(elements) {
+        if(this.roffset + elements > this.woffset) {
+            throw "Not enough queue to read";
+        }
+        var toreturn = this.q.subarray(this.roffset, this.roffset + elements);
+        this.roffset = this.roffset + elements;
+        if(this.woffset == this.roffset) {
+            this.woffset = 0;
+            this.roffset = 0;
+        }
+		return toreturn;
+	},
+
+	push: function(collection) {
+        if(this.woffset + collection.byteLength > this.size) {
+            //we need to make the queue bigger...
+            var oldq = this.q;
+            this.size += this.grow;
+            this.q = new Uint8Array(this.size);
+            this.q.set(oldq);
+        }
+        this.q.set(collection, this.woffset);
+        this.woffset += collection.byteLength;
+	},
+
+	getLength: function() {
+		return this.woffset-this.roffset;
+	}
+});
+
+
+wdi.Queue = $.spcExtend(wdi.DomainObject, {
+	q: null,
+    raw: false,
+
+	init: function(c) {
+        if(c.raw) {
+            this.raw = c.raw;
+        }
+		this.q = new Uint8Array(0);
+	},
+
+	getData: function() {
+		return this.toJSArray(this.q);
+	},
+
+	setData: function(q) {
+        this.q = new Uint8Array(q.length);
+		this.q.set(q);
+	},
+
+	shift: function() {
+		var elements = arguments[0] || this.getLength();
+
+		if (elements === this.q.length) {
+			var toreturn = this.q;
+			this.q = new Uint8Array(0);
+		} else {
+			var toreturn = this.q.subarray(0, elements);
+			this.q = this.q.subarray(elements);
+		}
+
+        return this.toJSArray(toreturn)
+	},
+
+	peek: function(begin, end) {
+        var tmp = null;
+        if(begin == 0 && !end) {
+            tmp = this.q; //read the entire queue
+        } else {
+            tmp = this.q.subarray(begin, end);
+        }
+		return this.toJSArray(tmp);
+	},
+
+	push: function(collection) {
+		if (typeof collection == 'string') {
+            var len = collection.length;
+            var newq = new Uint8Array(this.q.length+len);
+            newq.set(this.q);
+            for(var i=0;i<len;i++) {
+                newq[i+this.q.length] = collection[i];
+            }
+            this.q = newq;
+		} else {
+			if(this.getLength() === 0) {
+				this.q = new Uint8Array(collection.length);
+                this.q.set(collection);
+			} else {
+                var newq = new Uint8Array(collection.length+this.q.length);
+                newq.set(this.q);
+                newq.set(collection, this.q.length);
+				this.q = newq;
+			}
+		}
+	},
+
+	getLength: function() {
+		return this.q.length;
+	},
+
+    toJSArray: function(data) {
+        if(this.raw) {
+            return data;
+        }
+
+        return data.toJSArray();
+    }
+});
+
+wdi.ViewQueue = $.spcExtend(wdi.DomainObject, {
+	q: null,
+	at: null,
+
+	init: function() {
+		this.q = new Uint8Array();
+		this.at = 0;
+	},
+
+	getData: function() {
+		return this.toJSArray(this.q.subarray(this.at));
+	},
+
+    getDataOffset: function(pos) {
+   		return this.toJSArray(this.q.subarray(pos));
+   	},
+
+    getRawData: function() {
+   		return this.q.subarray(this.at);
+   	},
+
+    getRawDataOffset: function(pos) {
+        return this.q.subarray(pos);
+    },
+
+	setData: function(q) {
+		this.q = new Uint8Array(q.length);
+        this.q.set(q);
+		this.at = 0;
+	},
+
+	shift: function(length) {
+		var elements = length || this.getLength();
+		if(elements > this.getLength()) {
+			elements = this.getLength();
+		}
+		var ret = this.q.subarray(0+this.at, elements+this.at);
+		this.at += elements;
+		return this.toJSArray(ret);
+	},
+
+    eatBytes: function(bytes) {
+        this.at += bytes;
+    },
+
+    getByte: function(pos) {
+        return this.q[pos+this.at];
+    },
+
+	peek: function(begin, end) {
+        var tmp = null;
+        if(begin == 0 && !end) {
+            tmp = this.q; //read the entire queue
+        } else {
+            if(end) {
+                end += this.at;
+            }
+            tmp = this.q.subarray(begin+this.at, end);
+        }
+		return this.toJSArray(tmp);
+	},
+
+    push: function(collection) {
+   		if (typeof collection == 'string') {
+               var len = collection.length;
+               var newq = new Uint8Array(this.q.length+len);
+               newq.set(this.q);
+               for(var i=0;i<len;i++) {
+                   newq[i+this.q.length] = collection[i];
+               }
+               this.q = newq;
+   		} else {
+   			if(this.getLength() === 0) {
+   				this.q = new Uint8Array(collection.length);
+                   this.q.set(collection);
+   			} else {
+               var newq = new Uint8Array(collection.length+this.q.length);
+               newq.set(this.q);
+               newq.set(collection, this.q.length);
+   				this.q = newq;
+   			}
+   		}
+   	},
+
+	getLength: function() {
+		return this.q.length-this.at;
+	},
+
+	getPosition: function() {
+		return this.at;
+	},
+    toJSArray: function(data) {
+        if(data.length == 1) {
+            return [data[0]];
+        }
+        return data.toJSArray();
+    }
+});
+