Mirroristas/gun
2
0
Fork 0
mirror of https://github.com/amark/gun.git synced 2025-03-30 15:08:33 +00:00
Code Issues Packages Projects Releases Wiki Activity
gun/gun.js
Mark Nadal c6b117fde9 footer
2016-05-03 12:01:41 -07:00

1526 lines
52 KiB
JavaScript
Raw Blame History

console.log("!!!!!!!!!!!!!!!! WARNING THIS IS GUN 0.5 !!!!!!!!!!!!!!!!!!!!!!");
;(function(){ var u;
function Gun(o){
if(!(this instanceof Gun)){ return new Gun(o) }
this._ = {gun: this, lex: {}, opt: {}, on: Gun.on, ons: {}};
if(!(o instanceof Gun)){ this.opt(o) }
}
;(function(Util){ // Generic javascript utilities.
;(function(Type){
Type.fns = Type.fn = {is: function(fn){ return (fn instanceof Function) }}
Type.fn.apply = function(){}
Type.bi = {is: function(b){ return (b instanceof Boolean || typeof b == 'boolean') }}
Type.num = {is: function(n){ return !Type.list.is(n) && (Infinity === n || n - parseFloat(n) + 1 >= 0) }}
Type.text = {is: function(t){ return (typeof t == 'string') }}
Type.text.ify = function(t){
if(Type.text.is(t)){ return t }
if(typeof JSON !== "undefined"){ return JSON.stringify(t) }
return (t && t.toString)? t.toString() : t;
}
Type.text.random = function(l, c){
var s = '';
l = l || 24; // you are not going to make a 0 length random number, so no need to check type
c = c || '0123456789ABCDEFGHIJKLMNOPQRSTUVWXZabcdefghijklmnopqrstuvwxyz';
while(l > 0){ s += c.charAt(Math.floor(Math.random() * c.length)); l-- }
return s;
}
Type.text.match = function(t, o){ var r = false;
t = t || '';
o = Gun.text.is(o)? {'=': o} : o || {}; // {'~', '=', '*', '<', '>', '+', '-', '?', '!'} // ignore case, exactly equal, anything after, lexically larger, lexically lesser, added in, subtacted from, questionable fuzzy match, and ends with.
if(Type.obj.has(o,'~')){ t = t.toLowerCase(); o['='] = (o['='] || o['~']).toLowerCase() }
if(Type.obj.has(o,'=')){ return t === o['='] }
if(Type.obj.has(o,'*')){ if(t.slice(0, o['*'].length) === o['*']){ r = true; t = t.slice(o['*'].length) } else { return false }}
if(Type.obj.has(o,'!')){ if(t.slice(-o['!'].length) === o['!']){ r = true } else { return false }}
if(Type.obj.has(o,'+')){
if(Type.list.map(Type.list.is(o['+'])? o['+'] : [o['+']], function(m){ // TODO: PERF! CACHE!
if(t.indexOf(m) >= 0){ r = true } else { return true }
})){ return false }
}
if(Type.obj.has(o,'-')){
if(Type.list.map(Type.list.is(o['-'])? o['-'] : [o['-']], function(m){ // TODO: PERF! CACHE!
if(t.indexOf(m) < 0){ r = true } else { return true }
})){ return false }
}
if(Type.obj.has(o,'>')){ if(t > o['>']){ r = true } else { return false }}
if(Type.obj.has(o,'<')){ if(t < o['<']){ r = true } else { return false }}
function fuzzy(t,f){ var n = -1, i = 0, c; for(;c = f[i++];){ if(!~(n = t.indexOf(c, n+1))){ return false }} return true } // via http://stackoverflow.com/questions/9206013/javascript-fuzzy-search // TODO: PERF! CACHE!
if(Type.obj.has(o,'?')){ if(fuzzy(t, o['?'])){ r = true } else { return false }} // change name!
return r;
}
Type.list = {is: function(l){ return (l instanceof Array) }}
Type.list.slit = Array.prototype.slice;
Type.list.sort = function(k){ // creates a new sort function based off some field
return function(A,B){
if(!A || !B){ return 0 } A = A[k]; B = B[k];
if(A < B){ return -1 }else if(A > B){ return 1 }
else { return 0 }
}
}
Type.list.map = function(l, c, _){ return Type.obj.map(l, c, _) }
Type.list.index = 1; // change this to 0 if you want non-logical, non-mathematical, non-matrix, non-convenient array notation
Type.obj = {is: function(o){ return o? (o instanceof Object && o.constructor === Object) || Object.prototype.toString.call(o).match(/^\[object (\w+)\]$/)[1] === 'Object' : false }} // TODO: PERF HIT! Fixed?
Type.obj.put = function(o, f, v){ return (o||{})[f] = v, o }
Type.obj.del = function(o, k){
if(!o){ return }
o[k] = null;
delete o[k];
return o;
}
Type.obj.ify = function(o){
if(Type.obj.is(o)){ return o }
try{o = JSON.parse(o);
}catch(e){o={}};
return o;
}
Type.obj.copy = function(o){ // because http://web.archive.org/web/20140328224025/http://jsperf.com/cloning-an-object/2
return !o? o : JSON.parse(JSON.stringify(o)); // is shockingly faster than anything else, and our data has to be a subset of JSON anyways!
}
Type.obj.as = function(o, f, v){ return o[f] = o[f] || (arguments.length >= 3? v : {}) }
Type.obj.has = function(o, t){ return o && Object.prototype.hasOwnProperty.call(o, t) }
;(function(){
function empty(v,i){ n = this.n;
if(n && (i === n || (Type.obj.is(n) && Type.obj.has(n, i)))){ return }
if(i){ return true }
}
Type.obj.empty = function(o, n){
if(!o){ return true }
return Type.obj.map(o,empty,{n:n})? false : true;
}
}());
;(function(){
function t(k,v){
if(2 === arguments.length){
t.r = t.r || {};
t.r[k] = v;
return;
} t.r = t.r || [];
t.r.push(k);
};
Type.obj.map = function(l, c, _){
var u, i = 0, x, r, ll, lle, f = Type.fns.is(c);
t.r = null;
if(Object.keys && Type.obj.is(l)){
ll = Object.keys(l); lle = true;
}
if(Type.list.is(l) || ll){
x = (ll || l).length;
for(;i < x; i++){
var ii = (i + Type.list.index);
if(f){
r = lle? c.call(_ || this, l[ll[i]], ll[i], t) : c.call(_ || this, l[i], ii, t);
if(r !== u){ return r }
} else {
//if(Type.test.is(c,l[i])){ return ii } // should implement deep equality testing!
if(c === l[lle? ll[i] : i]){ return ll? ll[i] : ii } // use this for now
}
}
} else {
for(i in l){
if(f){
if(Type.obj.has(l,i)){
r = _? c.call(_, l[i], i, t) : c(l[i], i, t);
if(r !== u){ return r }
}
} else {
//if(a.test.is(c,l[i])){ return i } // should implement deep equality testing!
if(c === l[i]){ return i } // use this for now
}
}
}
return f? t.r : Type.list.index? 0 : -1;
}
}());
Type.time = {};
Type.time.is = function(t){ return t? t instanceof Date : (+new Date().getTime()) }
}(Util));
;(function(exports){ // On event emitter generic javascript utility.
function Act(fn, at, on){
this.fn = fn;
this.at = at;
this.on = on;
}
Act.chain = Act.prototype;
Act.chain.stun = function(){
this.halt = true;
}
function Event(tag, arg, at, t){
var on = this, ons = on.ons || (on.ons = {}), On = ons[tag] || (ons[tag] = {s: []}), act, mem;
if(arg instanceof Function){
On.s.push(act = new Act(arg, at, on));
if(mem = On.mem){ act.fn(mem, at) }
return;
}
On.mem = arg;
var i = 0, acts = On.s, l = acts.length, act;
for(i; i < l; i++){ act = acts[i];
act.fn(arg, act.at);
if(act.halt){
act.halt = false;
break;
}
}
if(at instanceof Function){
at(arg, t);
}
return;
}
Gun.on = Event;
}(Util));
;(function(exports){ // Generic javascript scheduler utility.
function s(state, cb, time){ // maybe use lru-cache?
s.time = time || Gun.time.is;
s.waiting.push({when: state, event: cb || function(){}});
if(s.soonest < state){ return }
s.set(state);
}
s.waiting = [];
s.soonest = Infinity;
s.sort = exports.list.sort('when');
s.set = function(future){
if(Infinity <= (s.soonest = future)){ return }
var now = s.time();
future = (future <= now)? 0 : (future - now);
clearTimeout(s.id);
s.id = setTimeout(s.check, future);
}
s.each = function(wait, i, map){
var ctx = this;
if(!wait){ return }
if(wait.when <= ctx.now){
if(exports.fns.is(wait.event)){
setTimeout(function(){ wait.event() },0);
}
} else {
soonest = (soonest < wait.when)? soonest : wait.when;
map(wait);
}
}
s.check = function(){
var now = s.time(), soonest = Infinity;
s.waiting.sort(s.sort);
s.waiting = exports.list.map(s.waiting, s.each, {now: now}) || [];
s.set(soonest);
}
exports.schedule = s;
}(Util));
}(Gun));
var fn_is = Gun.fn.is, bi_is = Gun.bi.is, num_is = Gun.num.is, text_is = Gun.text.is, text_ify = Gun.text.ify, text_random = Gun.text.random, text_match = Gun.text.match, list_is = Gun.list.is, list_slit = Gun.list.slit, list_sort = Gun.list.sort, list_map = Gun.list.map, obj_is = Gun.obj.is, obj_put = Gun.obj.put, obj_del = Gun.obj.del, obj_ify = Gun.obj.ify, obj_copy = Gun.obj.copy, obj_empty = Gun.obj.empty, obj_as = Gun.obj.as, obj_has = Gun.obj.has, obj_map = Gun.obj.map;
;(function(Gun){ // Gun specific utilities.
Gun.version = 0.4;
Gun.version_minor = 0;
Gun._ = { // some reserved key words, these are not the only ones.
meta: '_' // all metadata of the node is stored in the meta property on the node.
,soul: '#' // a soul is a UUID of a node but it always points to the "latest" data known.
,field: '.' // a field is a property on a node which points to a value.
,state: '>' // other than the soul, we store HAM metadata.
,value: '=' // the primitive value.
}
Gun.__ = {
'_':'meta'
,'#':'soul'
,'.':'field'
,'=':'value'
,'>':'state'
}
Gun.is = function(gun){ return (gun instanceof Gun) } // check to see if it is a GUN instance.
Gun.is.val = function(v){ // Valid values are a subset of JSON: null, binary, number (!Infinity), text, or a soul relation. Arrays need special algorithms to handle concurrency, so they are not supported directly. Use an extension that supports them if needed but research their problems first.
var u;
if(v === u){ return false }
if(v === null){ return true } // "deletes", nulling out fields.
if(v === Infinity){ return false } // we want this to be, but JSON does not support it, sad face.
if(Gun.bi.is(v) // by "binary" we mean boolean.
|| Gun.num.is(v)
|| Gun.text.is(v)){ // by "text" we mean strings.
return true; // simple values are valid.
}
return Gun.is.rel(v) || false; // is the value a soul relation? Then it is valid and return it. If not, everything else remaining is an invalid data type. Custom extensions can be built on top of these primitives to support other types.
}
Gun.is.opt = function(opt,o){
opt = opt || {};
Gun.obj.map(o, function(v,f){
if(Gun.list.is(opt[f])){
opt[f] = Gun.obj.map(opt[f], function(v,f,t){t(v,{sort: f})}); // TODO: PERF! CACHE!
}
if(Gun.list.is(v)){
v = Gun.obj.map(v, function(v,f,t){t(v,{sort: f})}); // TODO: PERF! CACHE!
}
if(Gun.obj.is(v)){
Gun.is.opt(opt[f] = opt[f] || {}, v); // TODO: This winds up merging peers option, not overwriting!
} else
if(!Gun.obj.has(opt,f)){
opt[f] = v;
}
});
return opt;
}
Gun.is.lex = function(lex){ var o = {}; // Validates a lex, and if it is returns a friendly lex.
if(!Gun.obj.is(lex)){ return false }
Gun.obj.map(lex, function(v,f){ // TODO: PERF! CACHE!
if(!(Gun._[f] || Gun.__[f]) || !(Gun.text.is(v) || Gun.obj.is(v))){ return o = false }
o[Gun._[f]? f : Gun.__[f]] = v;
}); // TODO: What if the lex cursor has a document on the match, that shouldn't be allowed!
return o;
}
Gun.is.lex.ify = function(lex){ var o = {}; // Turns a friendly lex into a spec lex.
lex = lex || {};
Gun.list.map(Gun._, function(v, f){ // TODO: PERF! CACHE!
if(!(Gun.obj.has(lex, v) || Gun.obj.has(lex, f))){ return }
o[v] = lex[v] || lex[f];
});
return o;
}
;(function(){
function map(s, f){ var o = this; // map over the object...
if(o.id){ return o.id = false } // if ID is already defined AND we're still looping through the object, it is considered invalid.
if(f == Gun._.soul && Gun.text.is(s)){ // the field should be '#' and have a text value.
o.id = s; // we found the soul!
} else {
return o.id = false; // if there exists anything else on the object that isn't the soul, then it is considered invalid.
}
}
Gun.is.rel = function(v){ // this defines whether an object is a soul relation or not, they look like this: {'#': 'UUID'}
if(Gun.obj.is(v)){ // must be an object.
var o = {};
Gun.obj.map(v, map, o);
if(o.id){ // a valid id was found.
return o.id; // yay! Return it.
}
}
return false; // the value was not a valid soul relation.
}
}());
Gun.is.rel.ify = function(s){ var r = {}; return Gun.obj.put(r, Gun._.soul, s), r } // convert a soul into a relation and return it.
;(function(){
function map(v, f){ // we invert this because the way we check for this is via a negation.
if(f == Gun._.meta){ return } // skip over the metadata.
if(!Gun.is.val(v)){ return true } // it is true that this is an invalid node.
if(this.cb){ this.cb.call(this.o, v, f, this.n) } // optionally callback each field/value.
}
Gun.is.node = function(n, cb, o){ var s; // checks to see if an object is a valid node.
if(!Gun.obj.is(n)){ return false } // must be an object.
if(s = Gun.is.node.soul(n)){ // must have a soul on it.
return !Gun.obj.map(n, map, {o:o,n:n,cb:cb});
}
return false; // nope! This was not a valid node.
}
}());
Gun.is.node.copy = function(g, s){
var __ = g.__, copy = __.copy || (__.copy = {}), cache = copy[s];
if(cache){ return cache }
if(cache = __.graph[s]){ return copy[s] = obj_copy(cache) }
}
;(function(){
function map(v, f){ // iterate over each field/value.
if(_meta === f){ return } // ignore meta.
is_node_state_ify(this.n, {field: f, value: v, state: this.o.state = this.o.state || Gun.time.is()}); // and set the state for this field and value on this node.
}
Gun.is.node.ify = function(n, o){ // convert a shallow object into a node.
o = (typeof o === 'string')? {soul: o} : o || {};
n = is_node_soul_ify(n, o); // put a soul on it.
obj_map(n, map, {n:n,o:o});
return n; // This will only be a valid node if the object wasn't already deep!
}
}());
Gun.is.node.soul = function(n, o){ return (n && n._ && n._[o || _soul]) || false } // convenience function to check to see if there is a soul on a node and return it.
Gun.is.node.soul.ify = function(n, o){ // put a soul on an object.
o = (typeof o === 'string')? {soul: o} : o || {};
n = n || {}; // make sure it exists.
n._ = n._ || {}; // make sure meta exists.
n._[_soul] = o.soul || n._[_soul] || text_random(); // put the soul on it.
return n;
}
Gun.is.node.state = function(n, o){ return (o && n && n._ && n._[Gun._.state] && Gun.num.is(n._[Gun._.state][o]))? n._[Gun._.state][o] : -Infinity } // convenience function to get the state on a field on a node and return it.
Gun.is.node.state.ify = function(n, o){ var s; // put a field's state and value on some nodes.
o = (typeof o === 'string')? {field: o} : o || {};
n = n || {}; // make sure it exists.
obj_as(n, _meta);
if(is_val(o.value)){ n[o.field] = o.value } // if we have a value, then put it.
s = obj_as(n._, _state);
if(num_is(o.state)){ s[o.field] = o.state }
return n;
}
;(function(){
function nf(fn){ // optional callback for each node.
if(fn){ Gun.is.node(nf.n, fn, nf.o) } // where we then have an optional callback for each field/value.
}
function map(n, s){ // we invert this because the way we check for this is via a negation.
if(!n || s !== Gun.is.node.soul(n) || !Gun.is.node(n, this.fn)){ return true } // it is true that this is an invalid graph.
if(!Gun.fns.is(this.cb)){ return }
nf.n = n; nf.o = this.o;
this.cb.call(nf.o, n, s, nf);
}
Gun.is.graph = function(g, cb, fn, o){ // checks to see if an object is a valid graph.
if(!Gun.obj.is(g) || Gun.obj.empty(g)){ return false } // must be an object.
return !Gun.obj.map(g, map, {fn:fn,cb:cb,o:o}); // makes sure it wasn't an empty object.
}
}());
Gun.is.graph.ify = function(n){ var s; // wrap a node into a graph.
if(s = Gun.is.node.soul(n)){ // grab the soul from the node, if it is a node.
return Gun.obj.put({}, s, n); // then create and return a graph which has a node on the matching soul property.
}
}
Gun.HAM = function(machineState, incomingState, currentState, incomingValue, currentValue){
if(machineState < incomingState){
return {defer: true}; // the incoming value is outside the boundary of the machine's state, it must be reprocessed in another state.
}
if(incomingState < currentState){
return {historical: true}; // the incoming value is within the boundary of the machine's state, but not within the range.
}
if(currentState < incomingState){
return {converge: true, incoming: true}; // the incoming value is within both the boundary and the range of the machine's state.
}
if(incomingState === currentState){
if(incomingValue === currentValue){ // Note: while these are practically the same, the deltas could be technically different
return {state: true};
}
/*
The following is a naive implementation, but will always work.
Never change it unless you have specific needs that absolutely require it.
If changed, your data will diverge unless you guarantee every peer's algorithm has also been changed to be the same.
As a result, it is highly discouraged to modify despite the fact that it is naive,
because convergence (data integrity) is generally more important.
Any difference in this algorithm must be given a new and different name.
*/
if(String(incomingValue) < String(currentValue)){ // String only works on primitive values!
return {converge: true, current: true};
}
if(String(currentValue) < String(incomingValue)){ // String only works on primitive values!
return {converge: true, incoming: true};
}
}
return {err: "you have not properly handled recursion through your data or filtered it as JSON"};
}
;(function(){
function meta(v,f){
if(obj_has(Gun.__, f)){ return }
obj_put(this._, f, v);
}
function map(value, field){
var node = this.node, vertex = this.vertex, machine = this.machine; //opt = this.opt;
var is = is_node_state(node, field), cs = is_node_state(vertex, field), iv = is_rel(value) || value, cv = is_rel(vertex[field]) || vertex[field];
var HAM = Gun.HAM(machine, is, cs, iv, cv);
if(HAM.err){
root.console.log(".!HYPOTHETICAL AMNESIA MACHINE ERR!.", HAM.err); // this error should never happen.
return;
}
if(HAM.state || HAM.historical || HAM.current){
//opt.lower(vertex, {field: field, value: value, state: is});
return;
}
if(HAM.incoming){
is_node_state_ify(vertex, {field: field, value: value, state: is});
return;
}
if(HAM.defer){
/*upper.wait = true;
opt.upper.call(state, vertex, field, incoming, ctx.incoming.state); // signals that there are still future modifications.
Gun.schedule(ctx.incoming.state, function(){
update(incoming, field);
if(ctx.incoming.state === upper.max){ (upper.last || function(){})() }
}, gun.__.opt.state);*/
}
}
Gun.HAM.node = function(gun, node, opt){
if(!node){ return }
var soul = is_node_soul(node);
if(!soul){ return }
var vertex = gun.__.graph[soul];
if(vertex === node){ return vertex }
vertex = gun.__.graph[soul] = vertex || is_node_ify({}, soul);
opt = num_is(opt)? {state: opt} : opt || {};
var machine = opt.state || gun.__.opt.state();
obj_map(node._, meta, vertex);
if(!is_node(node, map, {node:node,vertex:vertex,machine:machine,opt:opt})){ return }
return vertex;
}
}());
Gun.HAM.graph = function(gun, graph){ var g = {};
if(!Gun.is.graph(graph, function(node, soul){ // TODO: PERF! CACHE!
g[soul] = Gun.HAM.node(gun, node);
})){ return }
return g;
}
;(function(){ var u;
function An(){ /*Gun.on.create(this)*/ }
An.chain = An.prototype;
An.chain.event = function(tag, fn, at){
var an = this.an || this;
if(fn){
if(an.mem){
an.on(tag, fn, at).fn(an.mem, at);
at.ran = true;
} else {
an.on(tag, fn, at);
}
}
an.tag = tag;
return an;
}
An.chain.emit = function(a){
var an = this.an || this, tag = an.tag;
an.mem = a;
an.on(tag, a);
}
Gun.at = function(at){
at.on = (at.an = new An()).event;
};
function map(v,f){
if(obj_has(this,f) && u !== this[f]){ return }
this[f] = v;
}
Gun.at.copy = function(from, at){
at = at || {};
obj_map(from, map, at);
return at;
}
}());
;(function(){
Gun.put = function(gun, graph, cb, opt){
var at;
if(gun instanceof Gun){
at = {
gun: gun,
graph: graph,
cb: cb,
opt: Gun.is.opt(opt || {}, gun.__.opt)
}
} else {
at = gun;
at.opt = at.opt || {};
at.ack = at.cb;
at.cb = function(err, ok){ // TODO: PERF! CACHE!
if(err){ Gun.log(err) }
var cat = Gun.at.copy(at, {err: err, ok: ok});
Gun.on('ack', cat);
at.ack(cat.err, cat.ok, cat);
}
}
Gun.on('put', at);
return at.gun;
}
}());
;(function(){
function map(node, soul){
}
Gun.on('put', function(at){
if(!Gun.is.graph(at.graph, function(node, soul){ // TODO: PERF! CACHE!
Gun.HAM.node(at.gun, node);
})){ return at.cb({err: "Invalid graph!"}), this.stun() }
});
}());
/*Gun.on('put', function(gun, graph, cb, opt){
Gun.is.graph(graph, function(node, soul){ // TODO: PERF! CACHE!
Gun.on('stream').emit(err, node);
});
});*/
;(function(){
function stream(at){
at.get(at.err, at.node);
}
function got(err, node){
if(err){ Gun.log(err) }
Gun.on('stream', Gun.at.copy(this, {err: err, node: node}), stream);
}
Gun.get = function(at, lex, cb, opt){
if(at.lex){
at.get = at.cb;
at.cb = got;
} else {
var gun = at;
at = {
gun: gun,
lex: Gun.is.lex(lex || {}),
opt: Gun.is.opt(opt || {}, gun.__.opt),
cb: got,
get: cb
}
}
Gun.on('get', at); // TODO: What is the cleanest way to reply if there is no responses, without assuming drivers do reply or not?
return at.gun;
}
}());
Gun.on('get', function(at){
var opt = at.opt;
if(opt.force){ return }
var lex = at.lex, gun = at.gun, graph = gun.__.graph, node = graph[lex.soul];
if(opt.memory || node){ return at.cb(null, node), this.stun() }
});
Gun.on('stream', function(at){ var node;
if(!(node = at.node)){ return }
at.node = obj_copy(HAM_node(gun, node));
//at.node = obj_copy(Gun.HAM.node(gun, at.node)); // TODO: Cache the copied ones! So you don't have to recopy every time.
if(!at.node){
at.err = at.err || {err: "Invalid node!"};
this.stun();
}
});
Gun.on('stream', function(at){
var lex = at.lex, soul = lex.soul, field = lex.field;
var gun = at.gun, graph = gun.__.graph, node = graph[soul], u;
if(soul){
if(soul !== is_node_soul(at.node)){
at.node = obj_copy(node);
}
}
if(at.node && field){ // TODO: Multiples?
var ignore = obj_put({}, _meta, 1);
if(!obj_empty(at.node, obj_put(ignore, field, 1))){
at.node = Gun.is.node.ify(obj_put({}, field, at.node[field]), {soul: soul, state: Gun.is.node.state(at.node, field)})
}
}
});
Gun.ify = (function(){
function noop(){};
function nodeop(env, cb){ cb(env, env.at) }
function ify(data, cb, opt, scope){
cb = cb || noop;
opt = opt || {};
opt.uuid = opt.uuid || text_random;
opt.state = opt.state || Gun.time.is();
opt.value = opt.value || noop;
opt.node = opt.node || nodeop;
var ctx = {at: {path: [], obj: data}, root: {}, graph: {}, queue: [], seen: [], opt: opt, loop: true, end: cb, scope: scope};
if(!data){ return ctx.err = 'Serializer does not have correct parameters.', cb(ctx.err, ctx, scope) }
ctx.at.node = ctx.root;
loop(ctx, opt);
unique(ctx);
}
function recurse(ctx, opt){
}
function loop(ctx, opt){
while(ctx.loop && !ctx.err){
seen(ctx, ctx.at);
normalize(ctx, opt);
if(ctx.queue.length){
ctx.at = ctx.queue.shift();
} else {
ctx.loop = false;
}
}
}
function normnode(ctx, at, soul){
var opt = ctx.opt;
at.soul = at.soul || soul || Gun.is.node.soul(at.obj) || Gun.is.node.soul(at.node) || opt.uuid();
if(!opt.pure){ ctx.graph[at.soul] = Gun.is.node.soul.ify(at.node, at.soul) }
var arr = at.back||[], i = arr.length, rel;
while(i--){ rel = arr[i];
rel[_soul] = at.soul;
}
unique(ctx);
}
function meta(v,f){ var ctx = this;
obj_put(ctx.at.node[ctx.at.field], f, obj_copy(v));
}
function map(val, field){
var ctx = this, opt = ctx.opt;
field = ctx.at.field = String(field);
ctx.at.value = val;
if(_meta == field){
obj_as(ctx.at.node, _meta);
obj_map(val, meta, ctx);
return;
}
//Gun.obj.has(Gun.__, field) ||
if(field.indexOf('.') != -1 || obj_has(reserved, field)){
return ctx.err = "Invalid field name on '" + ctx.at.path.join('.') + "'!";
}
if(Gun.is.val(val)){
ctx.at.node[field] = obj_copy(val);
opt.value(ctx);
return;
}
var at = {obj: val, node: {}, back: [], path: [field]}, was;
at.path = (ctx.at.path||[]).concat(at.path || []);
if(!obj_is(val)){
return ctx.err = "Invalid value at '" + at.path.join('.') + "'!";
}
if(was = seen(ctx, at)){
(was.back = was.back || []).push(ctx.at.node[field] = Gun.is.rel.ify(Gun.is.node.soul(was.node) || null));
} else {
ctx.queue.push(at);
at.back.push(ctx.at.node[field] = Gun.is.rel.ify(null));
}
opt.value(ctx);
}
function normalize(ctx, opt){
opt.node(ctx, normnode);
obj_map(ctx.at.obj, map, ctx);
}
function seen(ctx, at){
var arr = ctx.seen, i = arr.length, has;
while(i--){ has = arr[i];
if(at.obj === has.obj){ return has }
}
ctx.seen.push(at);
}
function unique(ctx){
if(ctx.err){ return ctx.end(ctx.err, ctx, ctx.scope), ctx.end = noop }
if(ctx.loop){ return true }
var arr = ctx.seen, i = arr.length, at;
while(i--){ at = arr[i];
if(!at.soul){ return true }
}
ctx.end(ctx.err, ctx, ctx.scope);
ctx.end = noop;
}
var reserved = list_map([Gun._.meta, Gun._.soul, Gun._.field, Gun._.value, Gun._.state], function(v,i,t){
t(v,1);
});
return ify;
}());
}(Gun));
var _soul = Gun._.soul, _meta = Gun._.meta, _state = Gun._.state;
var is_val = Gun.is.val, is_rel = Gun.is.rel, is_node = Gun.is.node, is_node_soul = is_node.soul, is_node_soul_ify = is_node_soul.ify, is_node_ify = is_node.ify, is_node_copy = is_node.copy, is_node_state = is_node.state, is_node_state_ify = is_node_state.ify, HAM_node = Gun.HAM.node;
Gun.chain = Gun.prototype;
;(function(chain){
Gun.chain.opt = function(opt, stun){
opt = opt || {};
var gun = this, root = (gun.__ && gun.__.gun)? gun.__.gun : (gun._ = gun.__ = {gun: gun}).gun.chain(); // if root does not exist, then create a root chain.
var by = root.__.by = root.__.by || function(f){ return by[f] = by[f] || {} };
root.__.graph = root.__.graph || {};
root.__.opt = root.__.opt || {};
root.__.opt.any = root.opt.any || function(){};
root.__.opt.uuid = root.__.opt.uuid || Gun.text.random;
root.__.opt.state = root.__.opt.state || Gun.time.is;
root.__.opt.wire = root.__.opt.wire || {};
if(Gun.text.is(opt)){ opt = {peers: opt} }
if(Gun.list.is(opt)){ opt = {peers: opt} }
if(Gun.text.is(opt.peers)){ opt.peers = [opt.peers] }
if(Gun.list.is(opt.peers)){ opt.peers = Gun.obj.map(opt.peers, function(n,f,m){ m(n,{}) }) }
root.__.opt.peers = opt.peers || gun.__.opt.peers || {};
Gun.obj.map(opt.wire, function(h, f){
if(!Gun.fns.is(h)){ return }
root.__.opt.wire[f] = h;
});
Gun.obj.map(['key', 'on', 'path', 'map', 'not', 'init'], function(f){
if(!opt[f]){ return }
root.__.opt[f] = opt[f] || root.__.opt[f];
});
opt.gun = root;
if(!stun){ Gun.on('opt', opt) }
return gun;
}
Gun.chain.chain = function(cb){
var back = this, gun = new this.constructor(back);
gun.back = back;
gun.__ = back.__;
return gun;
}
function pop(cat, at){
var node = cat.node, lex = cat.lex, field = lex.field, rel;
if(obj_has(node, field)){
if(rel = Gun.is.rel(node[field])){
return Gun.get(Gun.at.copy(at, {lex: {soul: rel}}));
}
}
at.link.call({}, cat, at);
}
;(function(){
function wrap(cat, data){
if(!cat){ return data }
if(cat.lex.field){
data = obj_put({}, cat.lex.field, data);
} else
if(!obj_is(data)){ return }
data = is_node_soul_ify(data, cat.lex.soul);
if(cat.lex.soul){ return data }
if(cat !== cat.back){
return wrap(cat.back, data);
}
return data;
}
function link(cat, at){
var data = wrap(cat, at.put.data), cb; // TODO: PERF! Wrap could create a graph version, rather than a document verison that THEN has to get flattened.
if(!data){
if(at.opt && (cb = at.opt.any) instanceof Function){
cb.call(at.gun, {err: Gun.log("No node exists to put " + (typeof at.put.data) + ' "' + at.put.data + '" in!')});
}
return;
}
var state = at.put.state;
Gun.ify(data, end, {
node: function(env, cb){ var eat = env.at;
if(1 === eat.path.length && at.node){
eat.soul = Gun.is.rel(at.node[eat.path[0]]);
}
cb(env, eat);
}, value: function(env){ var eat = env.at;
if(!eat.field){ return }
Gun.is.node.state.ify(eat.node, {field: eat.field, state: state});
}, uuid: gun.__.opt.uuid, state: state
}, at);
}
function end(err, env, at){ var cb;
if(err){
if(at.opt && (cb = at.opt.any) instanceof Function){
cb.call(at.gun, {err: Gun.log(err)});
}
return; // TODO: BUG! Chain emit??
}
at.cache = env.root;
Gun.put(Gun.at.copy(at, {graph: env.graph, cb: ack}));
}
function ack(err, ok){ var cb;
var at = this;
if(at.opt && (cb = at.opt.any) instanceof Function){
cb.call(at.gun, err, ok);
}
at.on('chain', at);
}
Gun.chain.put = function(data, cb, opt){
var back = this, gun = back.chain(), at = gun._, put = at.put || (at.put = {});
put.data = data;
put.state = Gun.time.is(); // TODO: BUG! Should use NTS capable stuff.
//put.state = opt.state();
if(cb instanceof Function){
at.opt.any = cb;
}
/*
// START CACHE SHORTCUT
var cache, rel, from = back._, soul;
if(cache = from.cache){
if(soul = is_node_soul(cache)){
link(Gun.at.copy(from, {node: is_node_copy(gun, cache), lex: {soul: soul, field: from.lex.field }}), at);
return gun;
}
}
// END CACHE SHORTCUT
*/
if(back.back){
back._.on('chain', link, at);
} else {
link(at, at);
}
return gun;
};
}());
;(function(){
function got(err, node){
var at = this, opt = at.opt, cb;
at.gun._.cache = node;
if(cb = opt.any){ cb.call(at.gun, err, node) }
at.on('chain', at);
}
Gun.chain.get = function(lex, cb, opt){
var back = this, gun = back.chain();
var at = gun._, alex = at.lex;
/*
// START CACHE SHORTCUT
var cache;
if(cache = gun.__.graph[lex]){
at.cache = cache;
if(cb instanceof Function){
cb.call(gun, null, is_node_copy(gun, lex));
}
return gun;
}
// END CACHE SHORTCUT
*/
if(typeof lex === 'string'){
alex.soul = lex;
} else
if(lex[_soul]){
alex.soul = lex[_soul];
} else
if(lex.soul){
alex.soul = lex.soul;
}
at.cb = got;
if(cb instanceof Function){
at.opt.any = cb;
Gun.get(at);
}
return gun;
}
}());
;(function(){
function index(cat, at){
var cex = cat.lex, lex = at.lex;
if(cex.soul === lex.soul){ return }
ctx.obj = (1 === is_node_soul(ctx.node, 'key'))? obj_copy(ctx.node) : obj_put({}, lex.soul, is_rel_ify(lex.soul));
obj_as((ctx.put = is_node_ify(ctx.obj, key, true))._, 'key', 1);
at.gun.__.gun.put(ctx.put, function(err, ok){ cb.call(this, err, ok)}, {chain: opt.chain, key: true, init: true});
}
Gun.chain.key = function(key, cb, opt){
var gun = this;
gun.on('chain', index, gun._);
return gun;
}
}());
;(function(){ var u;
function got(){ this.link.call({}, this, this) }
function link(cat, at){
if(!cat.node){ // TODO: I think this is fine, belonging here, but it might need to be pushed further down.
at.back = cat; // TODO: BUG! concerned about race conditions.
at.on('chain', at);
return;
}
if(at.gun === cat.gun){
// TODO: opt.any
if(cat.node){
var rel, cache = cat.node[cat.lex.field];
if(rel = Gun.is.rel(cache)){
cache = at.gun._.cache = at.gun.__.graph[rel];
} else {
at.gun._.cache = cache;
}
}
// TODO: BUG! at.back = cat?
at.on('chain', cat);
return;
}
var opt = at.opt, cb, lex = at.lex, field = lex.field, node = cat.node, soul = Gun.is.node.soul(node), val, rel, clex = cat.lex, cfield = clex.field;
if(obj_has(clex, 'field')){
if(obj_has(node, cfield)){
if(rel = Gun.is.rel(val = node[cfield])){
return Gun.get(Gun.at.copy(at, {lex: {soul: rel, field: field}}));
}
}
}
}
Gun.chain.path = function(field, cb, opt){
var back = this, from = back._, flex = from.lex, vert;
var gun = back.chain(), at = gun._, lex = at.lex;
/*
// START CACHE SHORTCUT
var cache, rel;
if(cache = from.cache){
cache = at.cache = cache[lex.field = field];
if(rel = is_rel(cache)){
cache = at.cache = gun.__.graph[rel];
}
if(cache){
if(cb instanceof Function){
cb.call(gun, null, cache, field); // TODO: BUG! What if the cached item is not a node?
}
return gun;
}
}
// END CACHE SHORTCUT
*/
if(!field){
if(0 != field){
return gun;
}
}
lex.field = field = ''+field;
at.opt = opt || {};
if(cb instanceof Function){
at.opt.any = cb;
}
at.link = link;
at.cb = got;
back.on('chain', link, at);
if(!at.ran){
lex.soul = flex.soul;
Gun.get(at);
}
return gun;
}
}());
;(function(){
function link(cat, at){
var opt = at.opt, node = cat.node, lex = at.lex, field = lex.field, cb;
if(!(cb = opt.ok) || cat.err || !node || (field && !Gun.obj.has(node, field))){ return }
cb.call(cat.gun, at.gun._.cache = field? node[field] : node, field || at.gun._.lex.field); // TODO: Wrong gun?
}
// Deen catch-up 5pm every Third Wednesday.
Gun.chain.on = function(cb, opt, t){
var gun = this, at = gun._;
// START CACHE SHORTCUT
if(cache = at.cache){
if(cb instanceof Function){
cb.call(gun, is_node_copy(gun, is_node_soul(cache)), at.lex.field); // TODO: BUG! What if the cached item is not a node?
}
return gun;
}
// END CACHE SHORTCUT
if(typeof cb === 'string'){ return at.on(cb, opt, t) }
//opt = Gun.fns.is(opt)? {any: opt, to: Gun.text.is(cb)? cb : u} : Gun.fns.is(cb)? {ok: cb, opt: opt} : {opt: opt};
if(cb instanceof Function){
var cat = at;
(at = Gun.at.copy(at, {opt: opt || {}})).opt.ok = cb;
at.link = link;
at.on('chain', pop, at);
if(!cat.ran){
Gun.get(cat);
}
}
return gun;
}
}());
}(Gun.chain));
var root = this || {}; // safe for window, global, root, and 'use strict'.
if(root.window){ window.Gun = Gun }
if(typeof module !== "undefined" && module.exports){ module.exports = Gun }
root.console = root.console || {log: function(s){ return s }}; // safe for old browsers
var console = {
log: function(s){return root.console.log.apply(root.console, arguments), s},
Log: Gun.log = function(s){ return (!Gun.log.squelch && root.console.log.apply(root.console, arguments)), s }
};
console.debug = function(i, s){ return (Gun.log.debug && i === Gun.log.debug && Gun.log.debug++) && root.console.log.apply(root.console, arguments), s };
Gun.log.count = function(s){ return Gun.log.count[s] = Gun.log.count[s] || 0, Gun.log.count[s]++ }
}());
;(function(Tab){
if(!this.Gun){ return }
if(!window.JSON){ throw new Error("Include JSON first: ajax.cdnjs.com/ajax/libs/json2/20110223/json2.js") } // for old IE use
Gun.tab = Tab;
Tab.on = Gun.on;//Gun.on.create();
;(function(){
function get(err, data, at){
if(!data && !Gun.obj.empty(at.opt.peers)){ return } // let the peers handle no data.
at.cb(err, data); // node
}
Gun.on('get', function(at){
var opt = at.opt, lex = at.lex;
Tab.store.get((opt.prefix || '') + lex.soul, get, at);
});
}());
Gun.on('put', function(at){
var opt = at.opt, graph = at.graph, gun = at.gun;
if(false === opt.localstorage || false === opt.localStorage){ return } // TODO: BAD! Don't provide a "storage:false" option because the option won't apply to over the network. A custom module will need to handle this.
Gun.is.graph(graph, function(node, soul){
if(!(node = gun.__.graph[soul])){ return }
Tab.store.put((opt.prefix || '') + soul, node, function(err){ if(err){at.cb({err:err})} });
});
});
Gun.on('put', function(at){
var gun = at.gun, graph = at.graph, opt = at.opt;
if(Gun.obj.empty(opt.peers)){
if(!Gun.log.count('no-wire-put')){ Gun.log("Warning! You have no peers to replicate to!") }
at.cb(null);
return;
}
if(false === opt.websocket){ return }
var msg = {
'#': Gun.text.random(9), // msg ID
'$': graph // msg BODY
};
Tab.on(msg['#'], function(err, ok){
at.cb(err, ok);
});
Tab.peers(opt.peers).send(msg);
});
Gun.on('get', function(at){
var opt = at.opt, lex = at.lex;
if(Gun.obj.empty(opt.peers)){
if(!Gun.log.count('no-wire-get')){ Gun.log("Warning! You have no peers to get from!") }
return;
}
var msg = {
'#': Gun.text.random(9), // msg ID
'$': Gun.is.lex.ify(lex) // msg BODY
};
Tab.on(msg['#'], function(err, data){
at.cb(err, data);
});
Tab.peers(opt.peers).send(msg);
});
(function(exports){
function P(p){
if(!P.is(this)){ return new P(p) }
this.peers = p;
}
P.is = function(p){ return (p instanceof P) }
P.chain = P.prototype;
function map(peer, url){
var msg = this;
Tab.request(url, msg, function(err, reply){ var body = (reply||{}).body||{};
Tab.on(body['@'] || msg['#'], err || body['!'], body['$']);
});
}
P.chain.send = function(msg){
Gun.obj.map(this.peers, map, msg);
}
exports.peers = P;
}(Tab));
;(function(exports){ var u;
function s(){}
s.put = function(key, val, cb){ try{ store.setItem(key, Gun.text.ify(val));if(cb)cb(null) }catch(e){if(cb)cb(e)} }
s.get = function(key, cb, t){ //setTimeout(function(){
try{ cb(null, Gun.obj.ify(store.getItem(key) || null), t);
}catch(e){ cb(e,u,t)}
}//,1) }
s.del = function(key){ return store.removeItem(key) }
var store = this.localStorage || {setItem: function(){}, removeItem: function(){}, getItem: function(){}};
exports.store = s;
}(Tab));
(function(exports){
function r(base, body, cb, opt){
opt = opt || (base.length? {base: base} : base);
opt.base = opt.base || base;
opt.body = opt.body || body;
cb = cb || function(){};
if(!opt.base){ return }
r.transport(opt, cb);
}
r.createServer = function(fn){ r.createServer.s.push(fn) }
r.createServer.ing = function(req, cb){
var i = r.createServer.s.length;
while(i--){ (r.createServer.s[i] || function(){})(req, cb) }
}
r.createServer.s = [];
r.back = 2; r.backoff = 2;
r.transport = function(opt, cb){
//Gun.log("TRANSPORT:", opt);
if(r.ws(opt, cb)){ return }
r.jsonp(opt, cb);
}
r.ws = function(opt, cb, req){
var ws, WS = window.WebSocket || window.mozWebSocket || window.webkitWebSocket;
if(!WS){ return }
if(ws = r.ws.peers[opt.base]){
req = req || {};
if(opt.headers){ req.headers = opt.headers }
if(opt.body){ req.body = opt.body }
if(opt.url){ req.url = opt.url }
req.headers = req.headers || {};
if(!ws.cbs[req.headers['ws-rid']]){
ws.cbs[req.headers['ws-rid'] = 'WS' + (+ new Date()) + '.' + Math.floor((Math.random()*65535)+1)] = function(err,res){
if(!res || res.body || res.end){ delete ws.cbs[req.headers['ws-rid']] }
cb(err,res);
}
}
if(!ws.readyState){ return setTimeout(function(){ r.ws(opt, cb, req) },100), true }
ws.sending = true;
ws.send(JSON.stringify(req));
return true;
}
if(ws === false){ return }
(ws = r.ws.peers[opt.base] = new WS(opt.base.replace('http','ws'))).cbs = {};
ws.onopen = function(o){ r.back = 2; r.ws(opt, cb) };
ws.onclose = window.onbeforeunload = function(c){
if(!c){ return }
if(ws && ws.close instanceof Function){ ws.close() }
if(!ws.sending){
ws = r.ws.peers[opt.base] = false;
return r.transport(opt, cb);
}
r.each(ws.cbs, function(cb){
cb({err: "WebSocket disconnected!", code: !ws.sending? -1 : (ws||{}).err || c.code});
});
ws = r.ws.peers[opt.base] = null; // this will make the next request try to reconnect
setTimeout(function(){ // TODO: Have the driver handle this!
r.ws(opt, function(){}); // opt here is a race condition, is it not? Does this matter?
}, r.back *= r.backoff);
};
ws.onmessage = function(m){ var res;
if(!m || !m.data){ return }
try{res = JSON.parse(m.data);
}catch(e){ return }
if(!res){ return }
res.headers = res.headers || {};
if(res.headers['ws-rid']){ return (ws.cbs[res.headers['ws-rid']]||function(){})(null, res) }
//Gun.log("We have a pushed message!", res);
if(res.body){ r.createServer.ing(res, function(res){ r(opt.base, null, null, res)}) } // emit extra events.
};
ws.onerror = function(e){ (ws||{}).err = e };
return true;
}
r.ws.peers = {};
r.ws.cbs = {};
r.jsonp = function(opt, cb){
r.jsonp.ify(opt, function(url){
if(!url){ return }
r.jsonp.send(url, function(err, reply){
cb(err, reply);
r.jsonp.poll(opt, reply);
}, opt.jsonp);
});
}
r.jsonp.send = function(url, cb, id){
var js = document.createElement('script');
js.src = url;
js.onerror = function(c){
(window[js.id]||function(){})(null, {err: "JSONP failed!"});
}
window[js.id = id] = function(res, err){
cb(err, res);
cb.id = js.id;
js.parentNode.removeChild(js);
window[cb.id] = null; // TODO: BUG: This needs to handle chunking!
try{delete window[cb.id];
}catch(e){}
}
js.async = true;
document.getElementsByTagName('head')[0].appendChild(js);
return js;
}
r.jsonp.poll = function(opt, res){
if(!opt || !opt.base || !res || !res.headers || !res.headers.poll){ return }
(r.jsonp.poll.s = r.jsonp.poll.s || {})[opt.base] = r.jsonp.poll.s[opt.base] || setTimeout(function(){ // TODO: Need to optimize for Chrome's 6 req limit?
//Gun.log("polling again");
var o = {base: opt.base, headers: {pull: 1}};
r.each(opt.headers, function(v,i){ o.headers[i] = v })
r.jsonp(o, function(err, reply){
delete r.jsonp.poll.s[opt.base];
while(reply.body && reply.body.length && reply.body.shift){ // we're assuming an array rather than chunk encoding. :(
var res = reply.body.shift();
//Gun.log("-- go go go", res);
if(res && res.body){ r.createServer.ing(res, function(){ r(opt.base, null, null, res) }) } // emit extra events.
}
});
}, res.headers.poll);
}
r.jsonp.ify = function(opt, cb){
var uri = encodeURIComponent, q = '?';
if(opt.url && opt.url.pathname){ q = opt.url.pathname + q; }
q = opt.base + q;
r.each((opt.url||{}).query, function(v, i){ q += uri(i) + '=' + uri(v) + '&' });
if(opt.headers){ q += uri('`') + '=' + uri(JSON.stringify(opt.headers)) + '&' }
if(r.jsonp.max < q.length){ return cb() }
q += uri('jsonp') + '=' + uri(opt.jsonp = 'P'+Math.floor((Math.random()*65535)+1));
if(opt.body){
q += '&';
var w = opt.body, wls = function(w,l,s){
return uri('%') + '=' + uri(w+'-'+(l||w)+'/'+(s||w)) + '&' + uri('$') + '=';
}
if(typeof w != 'string'){
w = JSON.stringify(w);
q += uri('^') + '=' + uri('json') + '&';
}
w = uri(w);
var i = 0, l = w.length
, s = r.jsonp.max - (q.length + wls(l.toString()).length);
if(s < 0){ return cb() }
while(w){
cb(q + wls(i, (i = i + s), l) + w.slice(0, i));
w = w.slice(i);
}
} else {
cb(q);
}
}
r.jsonp.max = 2000;
r.each = function(obj, cb){
if(!obj || !cb){ return }
for(var i in obj){
if(obj.hasOwnProperty(i)){
cb(obj[i], i);
}
}
}
exports.request = r;
}(Tab));
}({}));
(function(){
if(!this.Gun){ return }
function Test(o){
var test = this;
if(!(test instanceof Test)){ return new Test(o) }
test._ = {};
test._.stack = [];
return test;
}
Test.chain = Test.prototype;
Test.chain.run = function(fn){
var test = this;
var e = test._.i, i = 0;
var stack = test._.stack;
stack.push(fn);
//var to = setInterval(function(){ if(++i >= e){ return clearTimeout(to) }
var start = Gun.time.is();
while(++i <= e){
Gun.list.map(stack, function(fn){ (fn||function(){})(i) })
}
console.log((Gun.time.is() - start) / 1000);
//},0);
return test;
}
Test.chain.it = function(i){
var test = this;
test._.i = i || 1000;
return test;
}
Test.chain.gen = function(fn){
var test = this;
test._.stack.push(fn);
return test;
}
var gun = window.gun = Gun(); //Gun('http://localhost:8080/gun');
window.SPAM = function(read){ // TODO: BUG? gun-sid in transport layer not correct?
//localStorage.clear();
var start = Gun.time.is();
/*var mark = {
name: "Mark Nadal"
};
var amber = {
name: "Amber Nadal",
spouse: mark
}
mark.spouse = amber;
amber.pet = {
name: "Fluffy",
slave: mark
}
Test().it(read).gen(function(i){
Gun.ify(mark);
}).run();return;*/
Test().it(read).gen(function(i){
gun.get('users').path(i).path('where').put({lat: Math.random(), lng: Math.random(),i:i});
}).run();return;
Test().it(read === true? 1 : read || 1000).gen(function(i){
if(read === true){
gun.get('users').map().path('where').on(function(node){
console.log("node:", node);
if(node.i === (1000)){
console.log("total:", Gun.time.is() - start);
start = Gun.time.is();
}
});
return;
}
// PUT, GET, PATH, ON
var now = Gun.time.is();
/*var obj = {'i': i, 'v': Gun.text.random(100)};
gun.put(obj, function(err, ok){
//console.log("put done", i, 'in', Gun.time.is() - now);//, i % 1000);
if(i % (1000) === 0){
console.log("total:", Gun.time.is() - start);
start = Gun.time.is();
}
});return;*/
gun.get('users').path(i).path('where').put({
lat: Math.random(),lng: Math.random(),i: i
//lol: i / 2
}, function(err, ok){
console.log("put done", i, 'in', Gun.time.is() - now);//, i % 1000);
if(i % (1000) === 0){
console.log("total:", Gun.time.is() - start);
start = Gun.time.is();
}
});return;
}).run(function(){});
}
//window.SPAM(1000000);
}());
/* EXTRA GUN UTILITY FUNCTIONS I MIGHT WANT TO KEEP
(function(){
Gun().get('chat').path('messages').since(Gun().get('me').path('last')).map().val(function(msg){
});
Gun().get('chat').path('messages').last(100).map().val(function(msg){
});
var peers = [
peer1,
peer2
];
Gun.on('put').event(function(graph, cb, opt){
Gun.is.graph(graph, function(node, soul){
localStorage[soul] = node;
});
});
Gun.on('put').event(function(graph, cb, opt){
Peers(opt.peers).send({
id: MsgID,
value: data,
from: myPeerID
}, cb);
});
Gun.on('get').event(function(lex, cb, opt){
Peers(opt.peers || peers).send({
'#': MsgID,
'$': lex,
'~': myPeerID
}, cb);
});
Peers.server(function(req, res){
if(Msg.IDs[req.id]){ return } // throttle
// auth
Peers(peers).send(req); // relay
// auth
if(req.rid){ return } // ignore
if(req.put && opt.everything || graph[for soul in req.body]){ // process
Gun.put(gun, req.body, REPLY);
}
});
// TODO: MARK / JESSE need to solve infinite circular loop on get flushing and put flushing.
GUN = {'#': 'soul', '.': 'field', '=': 'value', '>': 'state'}
MSG = {'#': 'id', '$': 'body', '@': 'to'}
Gun.wire = function(data){
}
Gun.get.wire = function(lex, cb, opt){ return Gun.text.is(lex)? Gun.get.wire.from(lex, cb, opt) : Gun.get.wire.to(lex, cb, opt) }
Gun.get.wire.to = function(lex, cb, opt){
var t = '';
Gun.obj.map(lex, function(v,f){
if(!v){ return }
Gun.list.map(Gun.list.is(v)? v : [v], function(v){
t += f + "'" + Gun.put.wire.ify(v) + "'";
});
});
return t + '?';
}
Gun.get.wire.from = function(t, cb, opt){
if(!t){ return null }
var a = Gun.put.wire.from.parse(t), lex = {};
Gun.list.map([Gun._.soul, Gun._.field, Gun._.value, Gun._.state], function(sym, i){
if(!(i = a.indexOf(sym) + 1)){ return }
lex[sym] = Gun.put.wire.type(a[i]);
});
return lex;
}
// #soul.field
// "#soul.field=value>state"
// #messages>>1234567890 //{soul: 'messages', state: {'>': 1234567890}}
// #id$"msg"~who@to
Gun.put.wire = function(n, cb, opt){ return Gun.text.is(n)? Gun.put.wire.from(n, cb, opt) : Gun.put.wire.to(n, cb, opt) }
Gun.put.wire.ify = function(s){ var tmp;
if(Infinity === s || -Infinity === s){ return s }
if(tmp = Gun.is.rel(s)){ return '#' + JSON.stringify(tmp) }
return JSON.stringify(s)
}
Gun.put.wire.type = function(s){ var tmp;
if(Gun._.soul === s.charAt(0)){ return Gun.is.rel.ify(JSON.parse(s.slice(1))) }
if(String(Infinity) === s){ return Infinity }
if(String(-Infinity) === s){ return -Infinity }
return JSON.parse(s)
}
Gun.put.wire.to = function(n, cb, opt){ var t, b;
if(!n || !(t = Gun.is.node.soul(n))){ return null }
cb = cb || function(){};
t = (b = "#'" + Gun.put.wire.ify(t) + "'");
var val = function(v,f, nv,nf){
var w = '', s = Gun.is.node.state(n,f), sw = '';
if(!s){ return }
w += ".'" + Gun.put.wire.ify(f) + "'";
console.log("yeah value?", v, Gun.put.wire.ify(v));
w += "='" + Gun.put.wire.ify(v) + "'";
if(s !== Gun.is.node.state(n,nf)){
w += ">'" + Gun.put.wire.ify(s) + "'";
} else {
sw = ">'" + Gun.put.wire.ify(s) + "'";
}
t += w;
w = b + w + sw;
cb(null, w);
}
var next = function(v,f){ // TODO: BUG! Missing adding meta data.
if(Gun._.meta === f){ return }
if(next.f){
val(next.v, next.f, v,f);
}
next.f = f;
next.v = v;
}
Gun.obj.map(n, next);
next();
return t;
}
Gun.put.wire.from = function(t, cb, opt){
if(!t){ return null }
var a = Gun.put.wire.from.parse(t);
Gun.list.map(a, function(v, i){
if(Gun._.soul === v){
Gun.is.node.soul.ify(n, Gun.put.wire.type(a[i]));
return;
}
if(Gun._.field === v){
var val = a.indexOf(Gun._.value,i), state = a.indexOf(Gun._.state,i);
Gun.is.node.state.ify([n], Gun.put.wire.type(a[i]), Gun.put.wire.type(a[val+1]), Gun.put.wire.type(a[state+1]));
return;
}
})
return n;
}
Gun.put.wire.from.parse = function(t){
var a = [], s = -1, e = 0, end = 1, n = {};
while((e = t.indexOf("'", s + 1)) >= 0){
if(s === e || '\\' === t.charAt(e-1)){}else{
a.push(t.slice(s + 1,e));
s = e;
}
}
return a;
}
}());
*/
/*
;(function(){ // make as separate module!
Gun.chain.sql = function(sql){
var gun = this;//.chain();
sql = gun._.sql = sql || {};
gun.select = function(sel){
sql.select = sel;
return gun;
}
gun.from = function(from){
sql.from = from;
gun.get(from).map();
return gun;
}
gun.where = function(where){
sql.where = where;
return gun;
}
return gun;
}
Gun.on('chain').event(function(gun, at){
console.log("sql stuff?", gun._, at.node);
var query = gun._.sql;
if(!query){ return }
var node = at.node;
});
}());
*/
Reference in New Issue View Git Blame Copy Permalink