mirror of
https://github.com/amark/gun.git
synced 2025-03-30 15:08:33 +00:00
1551 lines
59 KiB
JavaScript
1551 lines
59 KiB
JavaScript
;(function(){
|
|
|
|
/* UNBUILD */
|
|
function USE(arg, req){
|
|
return req? require(arg) : arg.slice? USE[R(arg)] : function(mod, path){
|
|
arg(mod = {exports: {}});
|
|
USE[R(path)] = mod.exports;
|
|
}
|
|
function R(p){
|
|
return p.split('/').slice(-1).toString().replace('.js','');
|
|
}
|
|
}
|
|
if(typeof module !== "undefined"){ var MODULE = module }
|
|
/* UNBUILD */
|
|
|
|
;USE(function(module){
|
|
// Shim for generic javascript utilities.
|
|
String.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)) }
|
|
return s;
|
|
}
|
|
String.match = function(t, o){ var tmp, u;
|
|
if('string' !== typeof t){ return false }
|
|
if('string' == typeof o){ o = {'=': o} }
|
|
o = o || {};
|
|
tmp = (o['='] || o['*'] || o['>'] || o['<']);
|
|
if(t === tmp){ return true }
|
|
if(u !== o['=']){ return false }
|
|
tmp = (o['*'] || o['>'] || o['<']);
|
|
if(t.slice(0, (tmp||'').length) === tmp){ return true }
|
|
if(u !== o['*']){ return false }
|
|
if(u !== o['>'] && u !== o['<']){
|
|
return (t >= o['>'] && t <= o['<'])? true : false;
|
|
}
|
|
if(u !== o['>'] && t >= o['>']){ return true }
|
|
if(u !== o['<'] && t <= o['<']){ return true }
|
|
return false;
|
|
}
|
|
String.hash = function(s, c){ // via SO
|
|
if(typeof s !== 'string'){ return }
|
|
c = c || 0; // CPU schedule hashing by
|
|
if(!s.length){ return c }
|
|
for(var i=0,l=s.length,n; i<l; ++i){
|
|
n = s.charCodeAt(i);
|
|
c = ((c<<5)-c)+n;
|
|
c |= 0;
|
|
}
|
|
return c;
|
|
}
|
|
var has = Object.prototype.hasOwnProperty;
|
|
Object.plain = function(o){ return o? (o instanceof Object && o.constructor === Object) || Object.prototype.toString.call(o).match(/^\[object (\w+)\]$/)[1] === 'Object' : false }
|
|
Object.empty = function(o, n){
|
|
for(var k in o){ if(has.call(o, k) && (!n || -1==n.indexOf(k))){ return false } }
|
|
return true;
|
|
}
|
|
Object.keys = Object.keys || function(o){
|
|
var l = [];
|
|
for(var k in o){ if(has.call(o, k)){ l.push(k) } }
|
|
return l;
|
|
}
|
|
;(function(){ // max ~1ms or before stack overflow
|
|
var u, sT = setTimeout, l = 0, c = 0, sI = (typeof setImmediate !== ''+u && setImmediate) || sT;
|
|
sT.poll = sT.poll || function(f){
|
|
if((1 >= (+new Date - l)) && c++ < 3333){ f(); return }
|
|
sI(function(){ l = +new Date; f() },c=0)
|
|
}
|
|
}());
|
|
;(function(){ // Too many polls block, this "threads" them in turns over a single thread in time.
|
|
var sT = setTimeout, t = sT.turn = sT.turn || function(f){ 1 == s.push(f) && p(T) }
|
|
, s = t.s = [], p = sT.poll, i = 0, f, T = function(){
|
|
if(f = s[i++]){ f() }
|
|
if(i == s.length || 99 == i){
|
|
s = t.s = s.slice(i);
|
|
i = 0;
|
|
}
|
|
if(s.length){ p(T) }
|
|
}
|
|
}());
|
|
;(function(){
|
|
var u, sT = setTimeout, T = sT.turn;
|
|
sT.each = sT.each || function(l,f,e,S){ S = S || 9; (function t(s,L,r){
|
|
if(L = (s = (l||[]).splice(0,S)).length){
|
|
for(var i = 0; i < L; i++){
|
|
if(u !== (r = f(s[i]))){ break }
|
|
}
|
|
if(u === r){ T(t); return }
|
|
} e && e(r);
|
|
}())}
|
|
}());
|
|
})(USE, './shim');
|
|
|
|
;USE(function(module){
|
|
// On event emitter generic javascript utility.
|
|
module.exports = function onto(tag, arg, as){
|
|
if(!tag){ return {to: onto} }
|
|
var u, tag = (this.tag || (this.tag = {}))[tag] ||
|
|
(this.tag[tag] = {tag: tag, to: onto._ = {
|
|
next: function(arg){ var tmp;
|
|
if((tmp = this.to)){
|
|
tmp.next(arg);
|
|
}}
|
|
}});
|
|
if('function' == typeof arg){
|
|
var be = {
|
|
off: onto.off ||
|
|
(onto.off = function(){
|
|
if(this.next === onto._.next){ return !0 }
|
|
if(this === this.the.last){
|
|
this.the.last = this.back;
|
|
}
|
|
this.to.back = this.back;
|
|
this.next = onto._.next;
|
|
this.back.to = this.to;
|
|
if(this.the.last === this.the){
|
|
delete this.on.tag[this.the.tag];
|
|
}
|
|
}),
|
|
to: onto._,
|
|
next: arg,
|
|
the: tag,
|
|
on: this,
|
|
as: as,
|
|
};
|
|
(be.back = tag.last || tag).to = be;
|
|
return tag.last = be;
|
|
}
|
|
if((tag = tag.to) && u !== arg){ tag.next(arg) }
|
|
return tag;
|
|
};
|
|
})(USE, './onto');
|
|
|
|
;USE(function(module){
|
|
USE('./shim');
|
|
module.exports = 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.
|
|
if(v === undefined){ return false }
|
|
if(v === null){ return true } // "deletes", nulling out keys.
|
|
if(v === Infinity){ return false } // we want this to be, but JSON does not support it, sad face.
|
|
if(v !== v){ return false } // can you guess what this checks for? ;)
|
|
if('string' == typeof v // text!
|
|
|| 'boolean' == typeof v
|
|
|| 'number' == typeof v){
|
|
return true; // simple values are valid.
|
|
}
|
|
if(v && ('string' == typeof (v['#']||0)) && Object.empty(v, ['#'])){ return v['#'] } // is link
|
|
return false; // If not, everything else remaining is an invalid data type. Custom extensions can be built on top of these primitives to support other types.
|
|
}
|
|
})(USE, './valid');
|
|
|
|
;USE(function(module){
|
|
USE('./shim');
|
|
function State(){
|
|
var t = +new Date;
|
|
if(last < t){
|
|
return N = 0, last = t + State.drift;
|
|
}
|
|
return last = t + ((N += 1) / D) + State.drift;
|
|
}
|
|
State.drift = 0;
|
|
var NI = -Infinity, N = 0, D = 999, last = NI, u; // WARNING! In the future, on machines that are D times faster than 2016AD machines, you will want to increase D by another several orders of magnitude so the processing speed never out paces the decimal resolution (increasing an integer effects the state accuracy).
|
|
State.is = function(n, k, o){ // convenience function to get the state on a key on a node and return it.
|
|
var tmp = (k && n && n._ && n._['>']) || o;
|
|
if(!tmp){ return }
|
|
return ('number' == typeof (tmp = tmp[k]))? tmp : NI;
|
|
}
|
|
State.ify = function(n, k, s, v, soul){ // put a key's state on a node.
|
|
(n = n || {})._ = n._ || {}; // safety check or init.
|
|
if(soul){ n._['#'] = soul } // set a soul if specified.
|
|
var tmp = n._['>'] || (n._['>'] = {}); // grab the states data.
|
|
if(u !== k && k !== '_'){
|
|
if('number' == typeof s){ tmp[k] = s } // add the valid state.
|
|
if(u !== v){ n[k] = v } // Note: Not its job to check for valid values!
|
|
}
|
|
return n;
|
|
}
|
|
module.exports = State;
|
|
})(USE, './state');
|
|
|
|
;USE(function(module){
|
|
USE('./shim');
|
|
function Dup(opt){
|
|
var dup = {s:{}}, s = dup.s;
|
|
opt = opt || {max: 999, age: /*1000 * 9};//*/ 1000 * 9 * 3};
|
|
dup.check = function(id){
|
|
if(!s[id]){ return false }
|
|
return dt(id);
|
|
}
|
|
var dt = dup.track = function(id){
|
|
var it = s[id] || (s[id] = {});
|
|
it.was = dup.now = +new Date;
|
|
if(!dup.to){ dup.to = setTimeout(dup.drop, opt.age + 9) }
|
|
return it;
|
|
}
|
|
dup.drop = function(age){
|
|
dup.to = null;
|
|
dup.now = +new Date;
|
|
setTimeout.each(Object.keys(s), function(id){ var it = s[id]; // TODO: .keys( is slow
|
|
if(it && (age || opt.age) > (dup.now - it.was)){ return }
|
|
delete s[id];
|
|
},0,99);
|
|
}
|
|
return dup;
|
|
}
|
|
module.exports = Dup;
|
|
})(USE, './dup');
|
|
|
|
;USE(function(module){
|
|
// request / response module, for asking and acking messages.
|
|
USE('./onto'); // depends upon onto!
|
|
module.exports = function ask(cb, as){
|
|
if(!this.on){ return }
|
|
if(!('function' == typeof cb)){
|
|
if(!cb || !as){ return }
|
|
var id = cb['#'] || cb, tmp = (this.tag||'')[id];
|
|
if(!tmp){ return }
|
|
tmp = this.on(id, as);
|
|
clearTimeout(tmp.err);
|
|
return true;
|
|
}
|
|
var id = (as && as['#']) || Math.random().toString(36).slice(2);
|
|
if(!cb){ return id }
|
|
var to = this.on(id, cb, as);
|
|
to.err = to.err || setTimeout(function(){
|
|
to.next({err: "Error: No ACK yet.", lack: true});
|
|
to.off();
|
|
}, (this.opt||{}).lack || 9000);
|
|
return id;
|
|
}
|
|
})(USE, './ask');
|
|
|
|
;USE(function(module){
|
|
|
|
function Gun(o){
|
|
if(o instanceof Gun){ return (this._ = {$: this}).$ }
|
|
if(!(this instanceof Gun)){ return new Gun(o) }
|
|
return Gun.create(this._ = {$: this, opt: o});
|
|
}
|
|
|
|
Gun.is = function($){ return ($ instanceof Gun) || ($ && $._ && ($ === $._.$)) || false }
|
|
|
|
Gun.version = 0.2020;
|
|
|
|
Gun.chain = Gun.prototype;
|
|
Gun.chain.toJSON = function(){};
|
|
|
|
USE('./shim');
|
|
Gun.valid = USE('./valid');
|
|
Gun.state = USE('./state');
|
|
Gun.on = USE('./onto');
|
|
Gun.dup = USE('./dup');
|
|
Gun.ask = USE('./ask');
|
|
|
|
;(function(){
|
|
Gun.create = function(at){
|
|
at.root = at.root || at;
|
|
at.graph = at.graph || {};
|
|
at.on = at.on || Gun.on;
|
|
at.ask = at.ask || Gun.ask;
|
|
at.dup = at.dup || Gun.dup();
|
|
var gun = at.$.opt(at.opt);
|
|
if(!at.once){
|
|
at.on('in', universe, at);
|
|
at.on('out', universe, at);
|
|
at.on('put', map, at);
|
|
Gun.on('create', at);
|
|
at.on('create', at);
|
|
}
|
|
at.once = 1;
|
|
return gun;
|
|
}
|
|
function universe(msg){
|
|
if(!msg){ return }
|
|
if(msg.out === universe){ this.to.next(msg); return }
|
|
var eve = this, as = eve.as, at = as.at || as, gun = at.$, dup = at.dup, tmp, DBG = msg.DBG;
|
|
(tmp = msg['#']) || (tmp = msg['#'] = text_rand(9));
|
|
if(dup.check(tmp)){ return } dup.track(tmp);
|
|
tmp = msg._; msg._ = ('function' == typeof tmp)? tmp : function(){};
|
|
(msg.$ && (msg.$ === (msg.$._||'').$)) || (msg.$ = gun);
|
|
if(msg['@'] && !msg.put){ ack(msg) }
|
|
if(!at.ask(msg['@'], msg)){ // is this machine listening for an ack?
|
|
DBG && (DBG.u = +new Date);
|
|
if(msg.get){ Gun.on._get(msg, gun) }
|
|
if(msg.put){ put(msg); return }
|
|
}
|
|
DBG && (DBG.uc = +new Date);
|
|
eve.to.next(msg);
|
|
DBG && (DBG.ua = +new Date);
|
|
if(msg.nts || msg.NTS){ return } // TODO: This shouldn't be in core, but fast way to prevent NTS spread. Delete this line after all peers have upgraded to newer versions.
|
|
msg.out = universe; at.on('out', msg);
|
|
DBG && (DBG.ue = +new Date);
|
|
}
|
|
function put(msg){
|
|
if(!msg){ return }
|
|
var ctx = msg._||'', root = ctx.root = ((ctx.$ = msg.$||'')._||'').root;
|
|
if(msg['@'] && ctx.faith && !ctx.miss){ // TODO: AXE may split/route based on 'put' what should we do here? Detect @ in AXE?
|
|
msg.out = universe;
|
|
root.on('out', msg);
|
|
return;
|
|
}
|
|
var put = msg.put;
|
|
var DBG = ctx.DBG = msg.DBG;
|
|
if(put['#'] && put['.']){ /*root && root.on('put', msg);*/ return } // TODO: BUG! This needs to call HAM instead.
|
|
DBG && (DBG.p = S);
|
|
ctx['#'] = msg['#'];
|
|
ctx.msg = msg;
|
|
ctx.all = 0;
|
|
ctx.stun = 1;
|
|
var nl = Object.keys(put).sort(); // TODO: This is unbounded operation, large graphs will be slower. Write our own CPU scheduled sort? Or somehow do it in below?
|
|
msg['%'] && console.log(msg['%']);
|
|
var ni = 0, nj, kl, soul, node, states, err, tmp;
|
|
(function pop(o){
|
|
if(nj != ni){ nj = ni;
|
|
if(!(soul = nl[ni])){
|
|
fire(ctx);
|
|
return;
|
|
}
|
|
if(!(node = put[soul])){ err = ERR+cut(soul)+"no node." } else
|
|
if(!(tmp = node._)){ err = ERR+cut(soul)+"no meta." } else
|
|
if(soul !== tmp['#']){ err = ERR+cut(soul)+"soul not same." } else
|
|
if(!(states = tmp['>'])){ err = ERR+cut(soul)+"no state." }
|
|
kl = Object.keys(node||{}); // TODO: .keys( is slow
|
|
}
|
|
if(err){
|
|
console.log("handle error!", err) // handle!
|
|
return;
|
|
}
|
|
var i = 0, key; o = o || 0;
|
|
while(o++ < 9 && (key = kl[i++])){
|
|
if('_' === key){ continue }
|
|
var val = node[key], state = states[key];
|
|
if(u === state){ err = ERR+cut(key)+"on"+cut(soul)+"no state."; break }
|
|
if(!valid(val)){ err = ERR+cut(key)+"on"+cut(soul)+"bad "+(typeof val)+cut(val); break }
|
|
ctx.all++; //ctx.ack[soul+key] = '';
|
|
ham(val, key, soul, state, msg);
|
|
}
|
|
if((kl = kl.slice(i)).length){ turn(pop); return }
|
|
++ni; kl = null; pop(o);
|
|
}());
|
|
} Gun.on.put = put;
|
|
function ham(val, key, soul, state, msg){
|
|
var ctx = msg._||'', root = ctx.root, graph = root.graph, lot, tmp;
|
|
var vertex = graph[soul] || empty, was = state_is(vertex, key, 1), known = vertex[key];
|
|
|
|
if(tmp = console.STAT){ if(!graph[soul] || !known){ tmp.has = (tmp.has || 0) + 1 } }
|
|
|
|
var now = State(),u;
|
|
if(state > now){ /*console.log("setTo");*/ /*setTo;*/ return } // TODO: BUG!!!!
|
|
if(state < was){ /*console.log("old");*/ /*old;*/ if(!ctx.miss){ return } } // but some chains have a cache miss that need to re-fire. // TODO: Improve in future. // for AXE this would reduce rebroadcast, but GUN does it on message forwarding.
|
|
if(!ctx.faith){ // TODO: BUG? Can this be used for cache miss as well?
|
|
if(state === was && (val === known || L(val) <= L(known))){ return } // same
|
|
}
|
|
/*if(!is.incoming){
|
|
if(is.defer){
|
|
var to = state - machine;
|
|
setTimeout(function(){
|
|
ham(val, key, soul, state, msg);
|
|
}, to > MD? MD : to); // setTimeout Max Defer 32bit :(
|
|
if(!ctx.to){ root.on('in', {'@': msg['#'], err: to}) } ctx.to = 1; // TODO: This causes too many problems unless sending peers auto-retry.
|
|
return to;
|
|
}
|
|
return;
|
|
}*/
|
|
//ctx.stun++; // TODO: 'forget' feature in SEA tied to this, bad approach, but hacked in for now. Any changes here must update there.
|
|
var aid = msg['#']+ctx.stun++, id = {toString: function(){ return aid }, _: ctx}; // this *trick* makes it compatible between old & new versions.
|
|
var DBG = ctx.DBG; DBG && (DBG.ph = DBG.ph || +new Date);
|
|
root.on('put', {'#': id, '@': msg['@'], put: {'#': soul, '.': key, ':': val, '>': state}, _: ctx});
|
|
}
|
|
function map(msg){
|
|
var DBG; if(DBG = (msg._||'').DBG){ DBG.pa = +new Date; DBG.pm = DBG.pm || +new Date}
|
|
var eve = this, root = eve.as, graph = root.graph, ctx = msg._, put = msg.put, soul = put['#'], key = put['.'], val = put[':'], state = put['>'], id = msg['#'], tmp;
|
|
if((tmp = ctx.msg) && (tmp = tmp.put) && (tmp = tmp[soul])){ state_ify(tmp, key, state, val, soul) } // necessary! or else out messages do not get SEA transforms.
|
|
graph[soul] = state_ify(graph[soul], key, state, val, soul);
|
|
if(tmp = (root.next||'')[soul]){ tmp.on('in', msg) }
|
|
eve.to.next(msg);
|
|
fire(ctx);
|
|
}
|
|
function fire(ctx, msg){
|
|
if(--ctx.stun !== 0){ return } // TODO: 'forget' feature in SEA tied to this, bad approach, but hacked in for now. Any changes here must update there.
|
|
ctx.hatch && ctx.hatch(); // TODO: rename/rework how put & this interact.
|
|
if(!(msg = ctx.msg) || ctx.err || msg.err || !ctx.root){ return }
|
|
msg.out = universe;
|
|
ctx.root.on('out', msg);
|
|
}
|
|
function ack(msg){ // aggregate ACKs.
|
|
var id = msg['@'] || '', root = (msg.$._||'').root, tmp;
|
|
if(msg.err && root && (tmp = root.dup.s[id])){ tmp.err = msg.err; } // add error to original message.
|
|
if(!(tmp = id._)){ /*console.log("TODO: handle ack id.");*/ return }
|
|
tmp.acks = (tmp.acks||0) + 1;
|
|
if(0 == tmp.stun && tmp.acks == tmp.all){ // TODO: if ack is synchronous this may not work?
|
|
root && root.on('in', {'@': tmp['#'], err: msg.err, ok: 'shard'});
|
|
}
|
|
}
|
|
|
|
var ERR = "Error: Invalid graph!";
|
|
var cut = function(s){ return " '"+(''+s).slice(0,9)+"...' " }
|
|
var L = JSON.stringify, MD = 2147483647, State = Gun.state;
|
|
|
|
}());
|
|
|
|
;(function(){
|
|
Gun.on._get = function(msg, gun){
|
|
var root = gun._, get = msg.get, soul = get['#'], node = root.graph[soul], has = get['.'], tmp;
|
|
var next = root.next || (root.next = {}), at = next[soul];
|
|
// queue concurrent GETs?
|
|
// TODO: consider tagging original message into dup for DAM.
|
|
var ctx = msg._||'', DBG = ctx.DBG = msg.DBG;
|
|
DBG && (DBG.g = +new Date);
|
|
//console.log("GET", get);
|
|
if(!node){ return root.on('get', msg) }
|
|
if(has){
|
|
if('string' != typeof has || u === node[has]){ return root.on('get', msg) }
|
|
node = Gun.state.ify(node, has, Gun.state.is(node, has), node[has]);
|
|
// If we have a key in-memory, do we really need to fetch?
|
|
// Maybe... in case the in-memory key we have is a local write
|
|
// we still need to trigger a pull/merge from peers.
|
|
}
|
|
//Gun.window? Gun.obj.copy(node) : node; // HNPERF: If !browser bump Performance? Is this too dangerous to reference root graph? Copy / shallow copy too expensive for big nodes. Gun.obj.to(node); // 1 layer deep copy // Gun.obj.copy(node); // too slow on big nodes
|
|
var ack = msg['#'], id = text_rand(9), keys = Object.keys(node||''), soul = ((node||'')._||'')['#'], kl = keys.length, j = 0;
|
|
// PERF: Consider commenting this out to force disk-only reads for perf testing? // TODO: .keys( is slow
|
|
node && (function got(){
|
|
var i = 0, k, put = {};
|
|
while(i < 9 && (k = keys[i++])){
|
|
state_ify(put, k, state_is(node, k), node[k], soul);
|
|
}
|
|
keys = keys.slice(i);
|
|
(tmp = {})[soul] = put; put = tmp;
|
|
var faith = function(){}; faith.ram = faith.faith = true; // HNPERF: We're testing performance improvement by skipping going through security again, but this should be audited.
|
|
tmp = keys.length;
|
|
DBG && (DBG.ga = +new Date);
|
|
root.on('in', {'@': ack, '#': id, put: put, '%': (tmp? (id = text_rand(9)) : u), ram: 1, $: gun, _: faith});
|
|
//root.on('in', {'@': ack, '#': text_rand(9), put: put, '%': tmp? ((j+=i)+'/'+kl) : u, ram: 1, $: gun, _: faith}); console.log("???", j+'/'+kl);
|
|
if(!tmp){ return }
|
|
setTimeout.turn(got);
|
|
}());
|
|
root.on('get', msg); // send GET to storage adapters.
|
|
}
|
|
}());
|
|
|
|
;(function(){
|
|
Gun.chain.opt = function(opt){
|
|
opt = opt || {};
|
|
var gun = this, at = gun._, tmp = opt.peers || opt;
|
|
if(!Object.plain(opt)){ opt = {} }
|
|
if(!Object.plain(at.opt)){ at.opt = opt }
|
|
if('string' == typeof tmp){ tmp = [tmp] }
|
|
if(tmp instanceof Array){
|
|
if(!Object.plain(at.opt.peers)){ at.opt.peers = {}}
|
|
tmp.forEach(function(url){
|
|
var p = {}; p.id = p.url = url;
|
|
at.opt.peers[url] = at.opt.peers[url] || p;
|
|
})
|
|
}
|
|
at.opt.peers = at.opt.peers || {};
|
|
obj_each(opt, function each(k){ var v = this[k];
|
|
if((this && this.hasOwnProperty(k)) || 'string' == typeof v || Object.empty(v)){ this[k] = v; return }
|
|
if(v && v.constructor !== Object && !(v instanceof Array)){ return }
|
|
obj_each(v, each);
|
|
});
|
|
Gun.on('opt', at);
|
|
return gun;
|
|
}
|
|
}());
|
|
|
|
var obj_each = function(o,f){ Object.keys(o).forEach(f,o) }, text_rand = String.random, turn = setTimeout.turn, valid = Gun.valid, state_is = Gun.state.is, state_ify = Gun.state.ify, u, empty = {}, C;
|
|
|
|
Gun.log = function(){ return (!Gun.log.off && C.log.apply(C, arguments)), [].slice.call(arguments).join(' ') };
|
|
Gun.log.once = function(w,s,o){ return (o = Gun.log.once)[w] = o[w] || 0, o[w]++ || Gun.log(s) };
|
|
|
|
if(typeof window !== "undefined"){ (window.GUN = window.Gun = Gun).window = window }
|
|
try{ if(typeof MODULE !== "undefined"){ MODULE.exports = Gun } }catch(e){}
|
|
module.exports = Gun;
|
|
|
|
(Gun.window||{}).console = (Gun.window||{}).console || {log: function(){}};
|
|
(C = console).only = function(i, s){ return (C.only.i && i === C.only.i && C.only.i++) && (C.log.apply(C, arguments) || s) };
|
|
|
|
;"Please do not remove welcome log unless you are paying for a monthly sponsorship, thanks!";
|
|
Gun.log.once("welcome", "Hello wonderful person! :) Thanks for using GUN, please ask for help on http://chat.gun.eco if anything takes you longer than 5min to figure out!");
|
|
})(USE, './root');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./root');
|
|
Gun.chain.back = function(n, opt){ var tmp;
|
|
n = n || 1;
|
|
if(-1 === n || Infinity === n){
|
|
return this._.root.$;
|
|
} else
|
|
if(1 === n){
|
|
return (this._.back || this._).$;
|
|
}
|
|
var gun = this, at = gun._;
|
|
if(typeof n === 'string'){
|
|
n = n.split('.');
|
|
}
|
|
if(n instanceof Array){
|
|
var i = 0, l = n.length, tmp = at;
|
|
for(i; i < l; i++){
|
|
tmp = (tmp||empty)[n[i]];
|
|
}
|
|
if(u !== tmp){
|
|
return opt? gun : tmp;
|
|
} else
|
|
if((tmp = at.back)){
|
|
return tmp.$.back(n, opt);
|
|
}
|
|
return;
|
|
}
|
|
if('function' == typeof n){
|
|
var yes, tmp = {back: at};
|
|
while((tmp = tmp.back)
|
|
&& u === (yes = n(tmp, opt))){}
|
|
return yes;
|
|
}
|
|
if('number' == typeof n){
|
|
return (at.back || at).$.back(n - 1);
|
|
}
|
|
return this;
|
|
}
|
|
var empty = {}, u;
|
|
})(USE, './back');
|
|
|
|
;USE(function(module){
|
|
// WARNING: GUN is very simple, but the JavaScript chaining API around GUN
|
|
// is complicated and was extremely hard to build. If you port GUN to another
|
|
// language, consider implementing an easier API to build.
|
|
var Gun = USE('./root');
|
|
Gun.chain.chain = function(sub){
|
|
var gun = this, at = gun._, chain = new (sub || gun).constructor(gun), cat = chain._, root;
|
|
cat.root = root = at.root;
|
|
cat.id = ++root.once;
|
|
cat.back = gun._;
|
|
cat.on = Gun.on;
|
|
cat.on('in', input, cat); // For 'in' if I add my own listeners to each then I MUST do it before in gets called. If I listen globally for all incoming data instead though, regardless of individual listeners, I can transform the data there and then as well.
|
|
cat.on('out', output, cat); // However for output, there isn't really the global option. I must listen by adding my own listener individually BEFORE this one is ever called.
|
|
var P = []; cat.$.back(function(at){ at.get && P.push(at.get) }); cat.TMPathBACK = P.reverse();
|
|
return chain;
|
|
}
|
|
|
|
function output(msg){
|
|
var put, get, at = this.as, back = at.back, root = at.root, tmp;
|
|
if(!msg.$){ msg.$ = at.$ }
|
|
this.to.next(msg);
|
|
if(get = msg.get){
|
|
/*if(u !== at.put){
|
|
at.on('in', at);
|
|
return;
|
|
}*/
|
|
if(at.lex){ msg.get = obj_to(at.lex, msg.get) }
|
|
if(get['#'] || at.soul){
|
|
get['#'] = get['#'] || at.soul;
|
|
msg['#'] || (msg['#'] = text_rand(9)); // A3120 ?
|
|
back = (root.$.get(get['#'])._);
|
|
if(!(get = get['.'])){
|
|
tmp = back.ask && back.ask['']; // check if we have already asked for the full node
|
|
(back.ask || (back.ask = {}))[''] = back; // add a flag that we are now.
|
|
if(u !== back.put){ // if we already have data,
|
|
back.on('in', back); // send what is cached down the chain
|
|
if(tmp){ return } // and don't ask for it again.
|
|
}
|
|
/*if(obj_has(back, 'put')){
|
|
back.on('in', back);
|
|
}
|
|
if(tmp && u !== back.put){ return } // if we already asked for it AND have data, don't ask again. */
|
|
msg.$ = back.$;
|
|
} else
|
|
if(obj_has(back.put, get)){ // TODO: support #LEX !
|
|
tmp = back.ask && back.ask[get];
|
|
(back.ask || (back.ask = {}))[get] = back.$.get(get)._;
|
|
back.on('in', {put: {'#': back.soul, '.': get, ':': back.put[get], '>': state_is(root.graph[back.soul], get)}});
|
|
if(tmp){ return }
|
|
}
|
|
/*put = (back.$.get(get)._);
|
|
if(!(tmp = put.ack)){ put.ack = -1 }
|
|
back.on('in', {
|
|
$: back.$,
|
|
put: Gun.state.ify({}, get, Gun.state(back.put, get), back.put[get]),
|
|
get: back.get
|
|
});
|
|
if(tmp){ return }
|
|
} else
|
|
if('string' != typeof get){
|
|
var put = {}, meta = (back.put||{})._;
|
|
Gun.obj.map(back.put, function(v,k){
|
|
if(!Gun.text.match(k, get)){ return }
|
|
put[k] = v;
|
|
})
|
|
if(!Gun.obj.empty(put)){
|
|
put._ = meta;
|
|
back.on('in', {$: back.$, put: put, get: back.get})
|
|
}
|
|
if(tmp = at.lex){
|
|
tmp = (tmp._) || (tmp._ = function(){});
|
|
if(back.ack < tmp.ask){ tmp.ask = back.ack }
|
|
if(tmp.ask){ return }
|
|
tmp.ask = 1;
|
|
}
|
|
}
|
|
*/
|
|
root.ask(ack, msg); // A3120 ?
|
|
return root.on('in', msg);
|
|
}
|
|
//if(root.now){ root.now[at.id] = root.now[at.id] || true; at.pass = {} }
|
|
if(get['.']){
|
|
if(at.get){
|
|
msg = {get: {'.': at.get}, $: at.$};
|
|
(back.ask || (back.ask = {}))[at.get] = msg.$._; // TODO: PERFORMANCE? More elegant way?
|
|
return back.on('out', msg);
|
|
}
|
|
msg = {get: {}, $: at.$};
|
|
console.log("NO ASK", msg);
|
|
return back.on('out', msg);
|
|
}
|
|
(at.ask || (at.ask = {}))[''] = at; //at.ack = at.ack || -1;
|
|
if(at.get){
|
|
get['.'] = at.get;
|
|
(back.ask || (back.ask = {}))[at.get] = msg.$._; // TODO: PERFORMANCE? More elegant way?
|
|
return back.on('out', msg);
|
|
}
|
|
}
|
|
return back.on('out', msg);
|
|
}
|
|
|
|
function input(msg){
|
|
// manhattan:
|
|
var eve = this, cat = eve.as, root = cat.root, gun = msg.$ || (msg.$ = cat.$), at = (gun||'')._ || empty, tmp = msg.put||'', soul = tmp['#'], key = tmp['.'], change = tmp['=']||tmp[':'], state = tmp['>'] || -Infinity, link, sat;
|
|
|
|
if(tmp && tmp._ && tmp._['#']){ // convert from old format
|
|
return setTimeout.each(Object.keys(tmp).sort(), function(k){ // TODO: .keys( is slow
|
|
if('_' == k || !(state = state_is(tmp, k))){ return }
|
|
cat.on('in', {put: {'#': tmp._['#'], '.': k, ':': tmp[k], '>': state}});
|
|
});
|
|
}
|
|
if((msg.seen||'')[cat.id]){ return } (msg.seen || (msg.seen = function(){}))[cat.id] = cat;
|
|
|
|
//if(cat.ask && key){
|
|
if(key){
|
|
if(cat.soul && cat.ask && state >= state_is(root.graph[soul], key)){ // faster than HAM
|
|
cat.put = state_ify(cat.put, key, state, change, soul);
|
|
}
|
|
if(cat.has && at.soul){
|
|
cat.put = at.put;
|
|
}
|
|
if(cat.has && at === cat && state >= state_is(root.graph[soul], key)){ // faster than HAM
|
|
cat.put = change;
|
|
}
|
|
}
|
|
|
|
if(cat.soul && at === cat){ // (1) we're a root node chain.
|
|
} else
|
|
if(cat.has && at === cat){ // (2)
|
|
} else
|
|
if(cat.has && at.soul){ // (3) we're a proxy for a root node.
|
|
Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] }, tmp = {});
|
|
tmp.get = cat.has; tmp.$ = cat.$; tmp.$$ = at; msg = tmp;
|
|
} else {}
|
|
|
|
eve.to.next(msg); // 1st API job is to call all the listeners.
|
|
setTimeout.each(Object.keys(cat.act||''), function(act){ // 1st API job is to call all chain listeners. // TODO: .keys( is slow
|
|
(act = cat.act[act]) && act(msg);
|
|
},0,99);
|
|
setTimeout.each(Object.keys(cat.echo||''), function(lat){ // & linked chains // TODO: .keys( is slow
|
|
if(!(lat = cat.echo[lat])){ return }
|
|
lat.on('in', msg);
|
|
},0,99);
|
|
|
|
if(u === change){ // 1st edge case: If we have a brand new database, no data will be found.
|
|
cat.put = u; // empty out the cache if, for example, alice's car's color no longer exists (relative to alice) if alice no longer has a car.
|
|
delete cat.link; // TODO: Empty out links, maps, echos, acks/asks, etc.?
|
|
setTimeout.each(Object.keys(cat.next||''), function(get, sat){ // empty out all sub properties. // TODO: .keys( is slow
|
|
if(!(sat = cat.next[get])){ return }
|
|
sat.on('in', {get: get, put: u, $: sat.$});
|
|
},0,99);
|
|
return;
|
|
}
|
|
if(at.soul){
|
|
if((sat = cat.next) && (sat = sat[key])){
|
|
tmp = {}; Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] }); tmp.$ = sat.$;
|
|
sat.on('in', tmp);
|
|
}
|
|
}
|
|
if('string' == typeof (link = valid(change))){
|
|
if((cat.has && at === cat)){
|
|
sat = root.$.get(cat.link = link)._; // grab what we're linking to.
|
|
if((sat.echo || (sat.echo = {}))[cat.id]){ return } // we've already added ourself.
|
|
sat.echo[cat.id] = cat; // add ourselves to it.
|
|
if((tmp = cat.ask||'')['']){
|
|
sat.on('out', {get: {'#': link}});
|
|
} else {
|
|
setTimeout.each(Object.keys(tmp), function(get, sat){ // if sub chains are asking for data. // TODO: .keys( is slow
|
|
if(!(sat = cat.ask[get])){ return }
|
|
sat.on('out', {get: {'#': link, '.': get}}); // go get it.
|
|
},0,99);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function ack(msg, ev){
|
|
// manhattan:
|
|
var as = this.as, at = as.$._, get = as.get||'', tmp = (msg.put||'')[get['#']]||'';
|
|
if(!msg.put || ('string' == typeof get['.'] && u === tmp[at.get])){
|
|
if(at.put !== u){ return }
|
|
at.on('in', {
|
|
get: at.get,
|
|
put: at.put = u,
|
|
$: at.$,
|
|
'@': msg['@']
|
|
});
|
|
return;
|
|
}
|
|
(msg._||{}).miss = 1;
|
|
Gun.on.put(msg);
|
|
return; // eom
|
|
}
|
|
var empty = {}, u, text_rand = String.random, valid = Gun.valid, obj_has = function(o, k){ return o && Object.prototype.hasOwnProperty.call(o, k) }, state = Gun.state, state_is = state.is, state_ify = state.ify;
|
|
})(USE, './chain');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./root');
|
|
Gun.chain.get = function(key, cb, as){
|
|
var gun, tmp;
|
|
if(typeof key === 'string'){
|
|
var back = this, cat = back._;
|
|
var next = cat.next || empty;
|
|
if(!(gun = next[key])){
|
|
gun = cache(key, back);
|
|
}
|
|
gun = gun.$;
|
|
} else
|
|
if('function' == typeof key){
|
|
if(true === cb){ return soul(this, key, cb, as), this }
|
|
gun = this;
|
|
var at = gun._, root = at.root, tmp = root.now, ev;
|
|
as = cb || {};
|
|
as.at = at;
|
|
as.use = key;
|
|
as.out = as.out || {};
|
|
as.out.get = as.out.get || {};
|
|
(ev = at.on('in', use, as)).rid = rid;
|
|
(root.now = {$:1})[as.now = at.id] = ev;
|
|
var mum = root.mum; root.mum = {};
|
|
at.on('out', as.out);
|
|
root.mum = mum;
|
|
root.now = tmp;
|
|
return gun;
|
|
} else
|
|
if('number' == typeof key){
|
|
return this.get(''+key, cb, as);
|
|
} else
|
|
if('string' == typeof (tmp = valid(key))){
|
|
return this.get(tmp, cb, as);
|
|
} else
|
|
if(Object.plain(key)){
|
|
gun = this;
|
|
if(tmp = ((tmp = key['#'])||empty)['='] || tmp){ gun = gun.get(tmp) }
|
|
gun._.lex = key;
|
|
return gun;
|
|
} else {
|
|
(as = this.chain())._.err = {err: Gun.log('Invalid get request!', key)}; // CLEAN UP
|
|
if(cb){ cb.call(as, as._.err) }
|
|
return as;
|
|
}
|
|
if(tmp = this._.stun){ // TODO: Refactor?
|
|
gun._.stun = gun._.stun || tmp;
|
|
}
|
|
if(cb && 'function' == typeof cb){
|
|
gun.get(cb, as);
|
|
}
|
|
return gun;
|
|
}
|
|
function cache(key, back){
|
|
var cat = back._, next = cat.next, gun = back.chain(), at = gun._;
|
|
if(!next){ next = cat.next = {} }
|
|
next[at.get = key] = at;
|
|
if(back === cat.root.$){
|
|
at.soul = key;
|
|
} else
|
|
if(cat.soul || cat.has){
|
|
at.has = key;
|
|
//if(obj_has(cat.put, key)){
|
|
//at.put = cat.put[key];
|
|
//}
|
|
}
|
|
return at;
|
|
}
|
|
function soul(gun, cb, opt, as){
|
|
var cat = gun._, acks = 0, tmp;
|
|
if(tmp = cat.soul || cat.link || cat.dub){ return cb(tmp, as, cat) }
|
|
if(cat.jam){ return cat.jam.push([cb, as]) }
|
|
cat.jam = [[cb,as]];
|
|
gun.get(function go(msg, eve){
|
|
if(u === msg.put && !cat.root.opt.super && (tmp = Object.keys(cat.root.opt.peers).length) && ++acks <= tmp){ // TODO: super should not be in core code, bring AXE up into core instead to fix? // TODO: .keys( is slow
|
|
return;
|
|
}
|
|
eve.rid(msg);
|
|
var at = ((at = msg.$) && at._) || {}, i = 0, as;
|
|
tmp = cat.jam; delete cat.jam; // tmp = cat.jam.splice(0, 100);
|
|
//if(tmp.length){ process.nextTick(function(){ go(msg, eve) }) }
|
|
while(as = tmp[i++]){ //Gun.obj.map(tmp, function(as, cb){
|
|
var cb = as[0], id; as = as[1];
|
|
cb && cb(id = at.link || at.soul || Gun.valid(msg.put) || ((msg.put||{})._||{})['#'] || at.dub, as, msg, eve);
|
|
} //);
|
|
}, {out: {get: {'.':true}}});
|
|
return gun;
|
|
}
|
|
function use(msg){
|
|
var eve = this, as = eve.as, cat = as.at, root = cat.root, gun = msg.$, at = (gun||{})._ || {}, data = msg.put || at.put, tmp;
|
|
if((tmp = root.now) && eve !== tmp[as.now]){ return eve.to.next(msg) }
|
|
//if(at.async && msg.root){ return }
|
|
//if(at.async === 1 && cat.async !== true){ return }
|
|
//if(root.stop && root.stop[at.id]){ return } root.stop && (root.stop[at.id] = true);
|
|
//if(!at.async && !cat.async && at.put && msg.put === at.put){ return }
|
|
//else if(!cat.async && msg.put !== at.put && root.stop && root.stop[at.id]){ return } root.stop && (root.stop[at.id] = true);
|
|
|
|
|
|
//root.stop && (root.stop.id = root.stop.id || Gun.text.random(2));
|
|
//if((tmp = root.stop) && (tmp = tmp[at.id] || (tmp[at.id] = {})) && tmp[cat.id]){ return } tmp && (tmp[cat.id] = true);
|
|
if(eve.seen && at.id && eve.seen[at.id]){ return eve.to.next(msg) }
|
|
//if((tmp = root.stop)){ if(tmp[at.id]){ return } tmp[at.id] = msg.root; } // temporary fix till a better solution?
|
|
if((tmp = data) && tmp['#'] && 'string' == typeof (tmp = valid(tmp))){
|
|
tmp = ((msg.$$ = at.root.$.get(tmp))._);
|
|
if(u !== tmp.put){
|
|
//msg = obj_to(msg, {put: data = tmp.put});
|
|
var o = {}; Object.keys(msg).forEach(function(k){ o[k] = msg[k] }); o.put = data = tmp.put;
|
|
msg = o;
|
|
}
|
|
}
|
|
if((tmp = root.mum) && at.id){ // TODO: can we delete mum entirely now?
|
|
var id = at.id + (eve.id || (eve.id = String.random(9)));
|
|
if(tmp[id]){ return }
|
|
if(u !== data && 'string' != typeof valid(data)){ tmp[id] = true; }
|
|
}
|
|
as.use(msg, eve);
|
|
if(eve.stun){
|
|
eve.stun = null;
|
|
return;
|
|
}
|
|
eve.to.next(msg);
|
|
}
|
|
function rid(at){
|
|
var cat = this.on;
|
|
if(!at || cat.soul || cat.has){ return this.off() }
|
|
if(!(at = (at = (at = at.$ || at)._ || at).id)){ return }
|
|
var map = cat.map, tmp, seen;
|
|
//if(!map || !(tmp = map[at]) || !(tmp = tmp.at)){ return }
|
|
if(tmp = (seen = this.seen || (this.seen = {}))[at]){ return true }
|
|
seen[at] = true;
|
|
return;
|
|
//tmp.echo[cat.id] = {}; // TODO: Warning: This unsubscribes ALL of this chain's listeners from this link, not just the one callback event.
|
|
//obj.del(map, at); // TODO: Warning: This unsubscribes ALL of this chain's listeners from this link, not just the one callback event.
|
|
return;
|
|
}
|
|
var empty = {}, valid = Gun.valid, u;
|
|
})(USE, './get');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./root');
|
|
Gun.chain.put = function(data, cb, as){ // I rewrote it :)
|
|
var gun = this, at = gun._, root = at.root;
|
|
as = as || {};
|
|
(root.stun = root.stun || {})[at.id] = (as.stun = as.stun
|
|
|| ((root.stun._ = (root.stun._ || 0) + 1) && {}));
|
|
as.ack = as.ack || cb;
|
|
as.via = as.via || gun;
|
|
as.data = as.data || data;
|
|
as.soul || (as.soul = at.soul || ('string' == typeof cb && cb));
|
|
var s = as.state = as.state || Gun.state();
|
|
if(!as.soul){ return get(as), gun }
|
|
if('function' == typeof data){ data(function(d){ as.data = d; gun.put(u,u,as) }); return gun }
|
|
as.$ = root.$.get(as.soul);
|
|
as.todo = [{it: as.data, ref: as.$}];
|
|
as.turn = as.turn || turn;
|
|
as.ran = as.ran || ran;
|
|
var S = +new Date;
|
|
(function walk(){
|
|
var to = as.todo, at = to.pop(), d = at.it, v, k, cat, tmp, g;
|
|
(tmp = at.ref) && (root.stun[tmp._.id] = as.stun); // stun
|
|
if(tmp = at.todo){
|
|
k = tmp.pop(); d = d[k];
|
|
if(tmp.length){ to.push(at) }
|
|
}
|
|
if(!(v = valid(d)) && !(g = Gun.is(d))){
|
|
if(!Object.plain(d)){ (as.ack||noop).call(as, as.out = {err: Gun.log("Invalid data, " + typeof d + " at " + (as.path||[]).join('.'))}); return } // TODO: BUG! Clear out stun!
|
|
var seen = as.seen || (as.seen = []), i = seen.length;
|
|
while(i--){ if(d === (tmp = seen[i]).it){ v = d = tmp.link; break } }
|
|
}
|
|
if(k && v){ at.node = state_ify(at.node, k, s, d) } // handle soul later.
|
|
else {
|
|
as.seen.push(cat = {it: d, link: {}, todo: g? [] : Object.keys(d).sort().reverse()}); // Any perf reasons to CPU schedule this .keys( ?
|
|
at.node = state_ify(at.node, k, s, cat.link);
|
|
!g && to.push(cat);
|
|
// ---------------
|
|
var id = as.seen.length;
|
|
(as.wait || (as.wait = {}))[id] = '';
|
|
tmp = (cat.ref = (g? d : k? at.ref.get(k) : at.ref))._;
|
|
(tmp = tmp.soul || tmp.link || tmp.dub)? resolve({soul: tmp}) : cat.ref.get(resolve, {stun: 0});
|
|
function resolve(msg, eve){
|
|
if(eve){ eve.off(); eve.rid(msg) } // TODO: Too early! Check all peers ack not found.
|
|
var soul = msg.soul || ((tmp = msg.put) && (tmp = tmp._) && (tmp = tmp['#'])) || ((tmp = msg.put) && (tmp = tmp['='] || tmp[':']) && tmp['#']) || ((tmp = msg.put) && tmp['#']);
|
|
(tmp = msg.$) && (root.stun[tmp._.id] = as.stun); // stun
|
|
if(!soul){
|
|
soul = [];
|
|
msg.$.back(function(at){
|
|
if(tmp = at.soul || at.link || at.dub){ return soul.push(tmp) }
|
|
soul.push(at.get);
|
|
});
|
|
soul = msg.$._.dub = soul.reverse().join('/');
|
|
}
|
|
cat.link['#'] = soul;
|
|
!g && (((as.graph || (as.graph = {}))[soul] = (cat.node || (cat.node = {_:{}})))._['#'] = soul);
|
|
delete as.wait[id];
|
|
as.ran(as);
|
|
};
|
|
// ---------------
|
|
}
|
|
if(!to.length){ return as.ran(as) }
|
|
as.turn(walk);
|
|
}());
|
|
return gun;
|
|
}
|
|
|
|
function ran(as){
|
|
if(as.todo.length || !Object.empty(as.wait)){ return }
|
|
var cat = (as.$.back(-1)._), ask = cat.ask(function(ack){
|
|
cat.root.on('ack', ack);
|
|
if(ack.err){ Gun.log(ack) }
|
|
if(++acks > (as.acks || 0)){ this.off() } // Adjustable ACKs! Only 1 by default.
|
|
if(!as.ack){ return }
|
|
as.ack(ack, this);
|
|
}, as.opt), acks = 0, stun = as.stun;
|
|
if((tmp = cat.root.stun) && --tmp._ === 0){ delete cat.root.stun }
|
|
(tmp = function(){ // this is not official yet, but quick solution to hack in for now.
|
|
setTimeout.each(Object.keys(stun||''), function(cb){if(cb = stun[cb]){cb()}}); // Any perf reasons to CPU schedule this .keys( ?
|
|
}).hatch = tmp; // this is not official yet ^
|
|
(as.via._).on('out', {put: as.out = as.graph, opt: as.opt, '#': ask, _: tmp});
|
|
}
|
|
|
|
function get(as){
|
|
var at = as.via._, tmp;
|
|
as.via = as.via.back(function(at){
|
|
if(at.soul){ return at.$ }
|
|
tmp = as.data; (as.data = {})[at.get] = tmp;
|
|
});
|
|
if(!as.via || !as.via._.soul){
|
|
console.log("TODO: Error! Handle non-soul put backs");
|
|
return;
|
|
}
|
|
as.via.put(as.data, as.ack, as);
|
|
|
|
|
|
return;
|
|
if(at.get && at.back.soul){
|
|
tmp = as.data;
|
|
as.via = at.back.$;
|
|
(as.data = {})[at.get] = tmp;
|
|
as.via.put(as.data, as.ack, as);
|
|
return;
|
|
}
|
|
}
|
|
|
|
var u, empty = {}, noop = function(){}, turn = setTimeout.turn, valid = Gun.valid, state_ify = Gun.state.ify;
|
|
var iife = function(fn,as){fn.call(as||empty)}
|
|
})(USE, './put');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./root');
|
|
USE('./chain');
|
|
USE('./back');
|
|
USE('./put');
|
|
USE('./get');
|
|
module.exports = Gun;
|
|
})(USE, './index');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./index');
|
|
Gun.chain.on = function(tag, arg, eas, as){ // don't rewrite!
|
|
var gun = this, cat = gun._, root = cat.root, act, off, id, tmp;
|
|
if(typeof tag === 'string'){
|
|
if(!arg){ return cat.on(tag) }
|
|
act = cat.on(tag, arg, eas || cat, as);
|
|
if(eas && eas.$){
|
|
(eas.subs || (eas.subs = [])).push(act);
|
|
}
|
|
return gun;
|
|
}
|
|
var opt = arg;
|
|
opt = (true === opt)? {change: true} : opt || {};
|
|
opt.at = cat;
|
|
opt.ok = tag;
|
|
//opt.last = {};
|
|
//gun.get(ok, opt); // TODO: PERF! Event listener leak!!!?
|
|
function one(msg, eve){
|
|
if(one.stun){ return }
|
|
var at = msg.$._, data = at.put, tmp;
|
|
if(opt.not===u && u === data){ return }
|
|
if(opt.stun===u && (tmp = root.stun) && (tmp = tmp[at.id] || tmp[at.back.id])){ // Remember! If you port this into `.get(cb` make sure you allow stun:0 skip option for `.put(`.
|
|
tmp[id] = function(){one(msg,eve)};
|
|
return;
|
|
}
|
|
// call:
|
|
if(opt.as){
|
|
opt.ok.call(opt.as, msg, eve || one);
|
|
} else {
|
|
opt.ok.call(at.$, data, msg.get || at.get, msg, eve || one);
|
|
}
|
|
};
|
|
one.at = cat;
|
|
(cat.act||(cat.act={}))[id = tmp||String.random(7)] = one;
|
|
one.off = function(){ one.stun = 1; if(!cat.act){ return } delete cat.act[id] }
|
|
cat.on('out', {get: {}});
|
|
return gun;
|
|
}
|
|
// Rules:
|
|
// 1. If cached, should be fast, but not read while write.
|
|
// 2. Should not retrigger other listeners, should get triggered even if nothing found.
|
|
// 3. If the same callback passed to many different once chains, each should resolve - an unsubscribe from the same callback should not effect the state of the other resolving chains, if you do want to cancel them all early you should mutate the callback itself with a flag & check for it at top of callback
|
|
Gun.chain.once = function(cb, opt){ opt = opt || {}; // avoid rewriting
|
|
var gun = this, cat = gun._, root = cat.root, data = cat.put, id, one, tmp;
|
|
//(root.act[tmp = ++root.acts] = cat.act[tmp] = function(msg, eve, to){
|
|
((cat.act||(cat.act={}))[id = tmp||String.random(7)] = function(msg, eve, to){
|
|
var at = msg.$._, one = (at.one||(at.one={}));
|
|
if('' === one[id]){ return }
|
|
if(!at.soul && (tmp = msg.put) && 'string' == typeof (tmp = Gun.valid(tmp['=']||tmp[':']))){
|
|
if(u === (tmp = root.$.get(tmp)._).put){ return } // probably already getting it.
|
|
}
|
|
if(!(at.soul || at.link)){ once(); return }
|
|
clearTimeout(one[id]); one[id] = setTimeout(once, opt.wait||99);
|
|
function once(){
|
|
if('' === one[id]){ return }
|
|
one[id] = ''; if(cat.soul || cat.has){ delete cat.act[id] }
|
|
if(u === (tmp = at.put)){ tmp = ((msg.$$||'')._||'').put }
|
|
cb.call(at.$, tmp, msg.get || at.get);
|
|
};
|
|
}).at = cat;
|
|
cat.on('out', {get: {}});
|
|
return gun;
|
|
}
|
|
|
|
Gun.chain.off = function(){
|
|
// make off more aggressive. Warning, it might backfire!
|
|
var gun = this, at = gun._, tmp;
|
|
var cat = at.back;
|
|
if(!cat){ return }
|
|
at.ack = 0; // so can resubscribe.
|
|
if(tmp = cat.next){
|
|
if(tmp[at.get]){
|
|
delete tmp[at.get];
|
|
} else {
|
|
|
|
}
|
|
}
|
|
if(tmp = cat.ask){
|
|
delete tmp[at.get];
|
|
}
|
|
if(tmp = cat.put){
|
|
delete tmp[at.get];
|
|
}
|
|
if(tmp = at.soul){
|
|
delete cat.root.graph[tmp];
|
|
}
|
|
if(tmp = at.map){
|
|
Object.keys(tmp).forEach(function(i,at){ at = tmp[i]; //obj_map(tmp, function(at){
|
|
if(at.link){
|
|
cat.root.$.get(at.link).off();
|
|
}
|
|
});
|
|
}
|
|
if(tmp = at.next){
|
|
Object.keys(tmp).forEach(function(i,neat){ neat = tmp[i]; //obj_map(tmp, function(neat){
|
|
neat.$.off();
|
|
});
|
|
}
|
|
at.on('off', {});
|
|
return gun;
|
|
}
|
|
var empty = {}, noop = function(){}, u;
|
|
})(USE, './on');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./index');
|
|
Gun.chain.map = function(cb, opt, t){
|
|
var gun = this, cat = gun._, chain;
|
|
if(!cb){
|
|
if(chain = cat.each){ return chain }
|
|
cat.each = chain = gun.chain();
|
|
chain._.nix = gun.back('nix');
|
|
gun.on(map, {as: chain._});
|
|
return chain;
|
|
}
|
|
Gun.log.once("mapfn", "Map functions are experimental, their behavior and API may change moving forward. Please play with it and report bugs and ideas on how to improve it.");
|
|
chain = gun.chain();
|
|
gun.map().on(function(data, key, at, ev){
|
|
var next = (cb||noop).call(this, data, key, at, ev);
|
|
if(u === next){ return }
|
|
if(data === next){ return chain._.on('in', at) }
|
|
if(Gun.is(next)){ return chain._.on('in', next._) }
|
|
chain._.on('in', {get: key, put: next});
|
|
});
|
|
return chain;
|
|
}
|
|
function map(msg){
|
|
var cat = this, gun = msg.$, put = msg.put;
|
|
if(!put){ return }
|
|
var soul = put['#'], k = put['.'], val = put['=']||put[':'];
|
|
// TODO: lex match!
|
|
((tmp = gun.get(k)._).echo || (tmp.echo = {}))[cat.id] = tmp.echo[cat.id] || cat;
|
|
}
|
|
var noop = function(){}, event = {stun: noop, off: noop}, u;
|
|
})(USE, './map');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('./index');
|
|
Gun.chain.set = function(item, cb, opt){
|
|
var gun = this, soul, tmp;
|
|
cb = cb || function(){};
|
|
opt = opt || {}; opt.item = opt.item || item;
|
|
if(soul = ((item||'')._||'')['#']){ (item = {})[soul] = {'#': soul}; }
|
|
if(!Gun.is(item)){
|
|
if(Object.plain(item)){
|
|
soul = soul || Gun.node.soul(item) || uuid(); // this just key now, not a soul.
|
|
}
|
|
return gun.get(soul || uuid()).put(item, cb, opt);
|
|
}
|
|
gun.put(function(go){
|
|
item.get(function(soul, o, msg){ // TODO: BUG! We no longer have this option? & go error not handled?
|
|
if(!soul){ return cb.call(gun, {err: Gun.log('Only a node can be linked! Not "' + msg.put + '"!')}) }
|
|
(tmp = {})[soul] = {'#': soul}; go(tmp);
|
|
},true);
|
|
})
|
|
return item;
|
|
}
|
|
function uuid(){ return Gun.state().toString(36).replace('.','') + String.random(7) }
|
|
})(USE, './set');
|
|
|
|
;USE(function(module){
|
|
USE('./shim');
|
|
|
|
function Mesh(root){
|
|
var mesh = function(){};
|
|
var opt = root.opt || {};
|
|
opt.log = opt.log || console.log;
|
|
opt.gap = opt.gap || opt.wait || 0;
|
|
opt.pack = opt.pack || (opt.memory? (opt.memory * 999 * 999) : 300000000) * 0.3;
|
|
opt.puff = opt.puff || 9; // IDEA: do a start/end benchmark, divide ops/result.
|
|
var puff = setTimeout.turn || setTimeout;
|
|
var parse = JSON.parseAsync || function(t,cb,r){ var u; try{ cb(u, JSON.parse(t,r)) }catch(e){ cb(e) } }
|
|
var json = JSON.stringifyAsync || function(v,cb,r,s){ var u; try{ cb(u, JSON.stringify(v,r,s)) }catch(e){ cb(e) } }
|
|
|
|
var dup = root.dup, dup_check = dup.check, dup_track = dup.track;
|
|
|
|
var ST = +new Date, LT = ST;
|
|
|
|
var hear = mesh.hear = function(raw, peer){
|
|
if(!raw){ return }
|
|
if(opt.pack <= raw.length){ return mesh.say({dam: '!', err: "Message too big!"}, peer) }
|
|
if(mesh === this){
|
|
if('string' == typeof raw){ try{
|
|
var stat = console.STAT || {};
|
|
//console.log('HEAR:', peer.id, (raw||'').slice(0,250), ((raw||'').length / 1024 / 1024).toFixed(4));
|
|
|
|
console.log(setTimeout.turn.s.length, 'stacks', parseFloat((-(LT - (LT = +new Date))/1000).toFixed(3)), 'sec', parseFloat(((LT-ST)/1000 / 60).toFixed(1)), 'up', stat.peers||0, 'peers', stat.has||0, 'has', stat.memhused, stat.memused, stat.memax, 'heap mem max');
|
|
}catch(e){ console.log('DBG err', e) }}
|
|
|
|
hear.d += raw.length||0 ; ++hear.c } // STATS!
|
|
var tmp = raw[0], msg;
|
|
if('[' === tmp){
|
|
parse(raw, function(err, msg){
|
|
if(err || !msg){ return } //mesh.say({dam: '!', err: "DAM JSON parse error."}, peer) }
|
|
console.STAT && console.STAT(+new Date, msg.length, '# on hear batch');
|
|
var P = opt.puff;
|
|
(function go(){
|
|
var S = +new Date;
|
|
var i = 0, m; while(i < P && (m = msg[i++])){ hear(m, peer) }
|
|
msg = msg.slice(i); // slicing after is faster than shifting during.
|
|
console.STAT && console.STAT(S, +new Date - S, 'hear loop');
|
|
flush(peer); // force send all synchronously batched acks.
|
|
if(!msg.length){ return }
|
|
puff(go, 0);
|
|
}());
|
|
});
|
|
raw = ''; //
|
|
return;
|
|
}
|
|
if('{' === tmp || ((raw['#'] || Object.plain(raw)) && (msg = raw))){
|
|
if(msg){ return hear.one(msg, peer) }
|
|
//console.log("HEAR:", raw);
|
|
parse(raw, function(err, msg){
|
|
if(err || !msg){ return } //mesh.say({dam: '!', err: "DAM JSON parse error."}, peer) }
|
|
hear.one(msg, peer);
|
|
});
|
|
return;
|
|
}
|
|
}
|
|
hear.one = function(msg, peer){
|
|
var id, hash, tmp, ash, DBG;
|
|
if(msg.DBG){ msg.DBG = DBG = {DBG: msg.DBG} }
|
|
DBG && (DBG.hp = +new Date);
|
|
if(!(id = msg['#'])){ id = msg['#'] = String.random(9) }
|
|
if(tmp = dup_check(id)){ return }
|
|
// DAM logic:
|
|
if(!(hash = msg['##']) && false && u !== msg.put){ /*hash = msg['##'] = Type.obj.hash(msg.put)*/ } // disable hashing for now // TODO: impose warning/penalty instead (?)
|
|
if(hash && (tmp = msg['@'] || (msg.get && id)) && dup.check(ash = tmp+hash)){ return } // Imagine A <-> B <=> (C & D), C & D reply with same ACK but have different IDs, B can use hash to dedup. Or if a GET has a hash already, we shouldn't ACK if same.
|
|
(msg._ = function(){}).via = mesh.leap = peer;
|
|
if((tmp = msg['><']) && 'string' == typeof tmp){ tmp.slice(0,99).split(',').forEach(function(k){ this[k] = 1 }, (msg._).yo = {}) } // Peers already sent to, do not resend.
|
|
// DAM ^
|
|
if(tmp = msg.dam){
|
|
if(tmp = mesh.hear[tmp]){
|
|
tmp(msg, peer, root);
|
|
}
|
|
dup_track(id);
|
|
return;
|
|
}
|
|
var S = +new Date, ST;
|
|
DBG && (DBG.is = S);
|
|
root.on('in', mesh.last = msg);
|
|
//ECHO = msg.put || ECHO; !(msg.ok !== -3740) && mesh.say({ok: -3740, put: ECHO, '@': msg['#']}, peer);
|
|
DBG && (DBG.hd = +new Date);
|
|
console.STAT && (ST = +new Date - S) > 9 && console.STAT(S, ST, 'msg'); // TODO: PERF: caught one > 1.5s on tgif
|
|
(tmp = dup_track(id)).via = peer;
|
|
if(msg.get){ tmp.it = msg }
|
|
if(ash){ dup_track(ash) } //dup.track(tmp+hash, true).it = it(msg);
|
|
mesh.leap = mesh.last = null; // warning! mesh.leap could be buggy.
|
|
}
|
|
var tomap = function(k,i,m){m(k,true)};
|
|
var noop = function(){};
|
|
hear.c = hear.d = 0;
|
|
|
|
;(function(){
|
|
var SMIA = 0;
|
|
var loop;
|
|
mesh.hash = function(msg, peer){ var h, s, t;
|
|
json(msg.put, function hash(err, text){
|
|
var ss = (s || (s = t = text||'')).slice(0, 32768); // 1024 * 32
|
|
h = String.hash(ss, h); s = s.slice(32768);
|
|
if(s){ puff(hash, 0); return }
|
|
msg._.$put = t;
|
|
msg['##'] = h;
|
|
say(msg, peer);
|
|
delete msg._.$put;
|
|
})
|
|
}
|
|
var say = mesh.say = function(msg, peer){ var tmp;
|
|
return; // TODO: MANHATTAN STUB //OBVIOUSLY BUG! But squelch relay.
|
|
if((tmp = this) && (tmp = tmp.to) && tmp.next){ tmp.next(msg) } // compatible with middleware adapters.
|
|
if(!msg){ return false }
|
|
var id, hash, raw, ack = msg['@'];
|
|
var DBG = msg.DBG, S; if(!peer){ S = +new Date ; DBG && (DBG.y = S) }
|
|
var meta = msg._||(msg._=function(){});
|
|
if(!(id = msg['#'])){ id = msg['#'] = String.random(9) }
|
|
!loop && dup_track(id);//.it = it(msg); // track for 9 seconds, default. Earth<->Mars would need more! // always track, maybe move this to the 'after' logic if we split function.
|
|
if(msg.put && (msg.err || (dup.s[id]||'').err)){ return false } // stop relaying a invalid message, like failed SEA.
|
|
if(!(hash = msg['##']) && u !== msg.put && !meta.via && ack){ mesh.hash(msg, peer); return } // TODO: Should broadcasts be hashed?
|
|
if(!(raw = meta.raw)){ mesh.raw(msg, peer); return }
|
|
S && console.STAT && console.STAT(S, +new Date - S, 'say prep');
|
|
if(!peer && ack){ peer = ((tmp = dup.s[ack]) && (tmp.via || ((tmp = tmp.it) && (tmp = tmp._) && tmp.via))) || mesh.leap } // warning! mesh.leap could be buggy!
|
|
if(!peer && ack){
|
|
console.STAT && console.STAT(+new Date, ++SMIA, 'total no peer to ack to');
|
|
return false;
|
|
} // TODO: Temporary? If ack via trace has been lost, acks will go to all peers, which trashes browser bandwidth. Not relaying the ack will force sender to ask for ack again. Note, this is technically wrong for mesh behavior.
|
|
if(!peer && mesh.way){ return mesh.way(msg) }
|
|
if(!peer || !peer.id){
|
|
if(!Object.plain(peer || opt.peers)){ return false }
|
|
var P = opt.puff, ps = opt.peers, pl = Object.keys(peer || opt.peers || {}); // TODO: .keys( is slow
|
|
;(function go(){
|
|
var S = +new Date;
|
|
//Type.obj.map(peer || opt.peers, each); // in case peer is a peer list.
|
|
loop = 1; var wr = meta.raw; meta.raw = raw; // quick perf hack
|
|
var i = 0, p; while(i < 9 && (p = (pl||'')[i++])){
|
|
if(!(p = ps[p])){ continue }
|
|
say(msg, p);
|
|
}
|
|
meta.raw = wr; loop = 0;
|
|
pl = pl.slice(i); // slicing after is faster than shifting during.
|
|
console.STAT && console.STAT(S, +new Date - S, 'say loop');
|
|
if(!pl.length){ return }
|
|
puff(go, 0);
|
|
dup_track(ack); // keep for later
|
|
}());
|
|
return;
|
|
}
|
|
// TODO: PERF: consider splitting function here, so say loops do less work.
|
|
if(!peer.wire && mesh.wire){ mesh.wire(peer) }
|
|
if(id === peer.last){ return } peer.last = id; // was it just sent?
|
|
if(peer === meta.via){ return false } // don't send back to self.
|
|
if((tmp = meta.yo) && (tmp[peer.url] || tmp[peer.pid] || tmp[peer.id]) /*&& !o*/){ return false }
|
|
if(peer.batch){
|
|
peer.tail = (tmp = peer.tail || 0) + raw.length;
|
|
if(peer.tail <= opt.pack){
|
|
peer.batch += (tmp?',':'')+raw;
|
|
return;
|
|
}
|
|
flush(peer);
|
|
}
|
|
peer.batch = '['; // Prevents double JSON!
|
|
var S = +new Date, ST;
|
|
setTimeout(function(){
|
|
console.STAT && (ST = +new Date - S) > 9 && console.STAT(S, ST, '0ms TO', id, peer.id);
|
|
flush(peer);
|
|
}, opt.gap); // TODO: queuing/batching might be bad for low-latency video game performance! Allow opt out?
|
|
send(raw, peer);
|
|
}
|
|
mesh.say.c = mesh.say.d = 0;
|
|
// TODO: this caused a out-of-memory crash!
|
|
mesh.raw = function(msg, peer){ // TODO: Clean this up / delete it / move logic out!
|
|
if(!msg){ return '' }
|
|
var meta = (msg._) || {}, put, tmp;
|
|
if(tmp = meta.raw){ return tmp }
|
|
if('string' == typeof msg){ return msg }
|
|
var hash = msg['##'], ack = msg['@'];
|
|
if(hash && ack){
|
|
dup_track(ack+hash);//.it = it(msg);
|
|
if((tmp = (dup.s[ack]||'').it) || ((tmp = mesh.last) && ack === tmp['#'])){
|
|
if(hash === tmp['##']){ return false }
|
|
tmp['##'] = hash;
|
|
}
|
|
}
|
|
if(!msg.dam){
|
|
var i = 0, to = []; tmp = opt.peers;
|
|
for(var k in tmp){ var p = tmp[k]; // TODO: Make it up peers instead!
|
|
to.push(p.url || p.pid || p.id);
|
|
if(++i > 6){ break }
|
|
}
|
|
if(i > 1){ msg['><'] = to.join() }
|
|
}
|
|
if(put = meta.$put){
|
|
tmp = {}; Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] });
|
|
tmp.put = ':])([:';
|
|
json(tmp, function(err, raw){
|
|
if(err){ return } // TODO: Handle!!
|
|
tmp = raw.indexOf('"put":":])([:"');
|
|
res(u, raw = raw.slice(0, tmp+6) + put + raw.slice(tmp + 14));
|
|
});
|
|
return;
|
|
}
|
|
json(msg, res);
|
|
function res(err, raw){
|
|
if(err){ return } // TODO: Handle!!
|
|
meta.raw = raw; //if(meta && (raw||'').length < (999 * 99)){ meta.raw = raw } // HNPERF: If string too big, don't keep in memory.
|
|
say(msg, peer);
|
|
}
|
|
}
|
|
}());
|
|
|
|
function flush(peer){
|
|
var tmp = peer.batch, t = 'string' == typeof tmp, l;
|
|
if(t){ tmp += ']' }// TODO: Prevent double JSON!
|
|
peer.batch = peer.tail = null;
|
|
if(!tmp){ return }
|
|
if(t? 3 > tmp.length : !tmp.length){ return } // TODO: ^
|
|
if(!t){try{tmp = (1 === tmp.length? tmp[0] : JSON.stringify(tmp));
|
|
}catch(e){return opt.log('DAM JSON stringify error', e)}}
|
|
if(!tmp){ return }
|
|
send(tmp, peer);
|
|
}
|
|
// for now - find better place later.
|
|
function send(raw, peer){ try{
|
|
//console.log('SAY:', peer.id, (raw||'').slice(0,250), ((raw||'').length / 1024 / 1024).toFixed(4));
|
|
var wire = peer.wire;
|
|
if(peer.say){
|
|
peer.say(raw);
|
|
} else
|
|
if(wire.send){
|
|
wire.send(raw);
|
|
}
|
|
mesh.say.d += raw.length||0; ++mesh.say.c; // STATS!
|
|
}catch(e){
|
|
(peer.queue = peer.queue || []).push(raw);
|
|
}}
|
|
|
|
mesh.hi = function(peer){
|
|
var tmp = peer.wire || {};
|
|
if(peer.id){
|
|
opt.peers[peer.url || peer.id] = peer;
|
|
} else {
|
|
tmp = peer.id = peer.id || String.random(9);
|
|
mesh.say({dam: '?', pid: root.opt.pid}, opt.peers[tmp] = peer);
|
|
delete dup.s[peer.last]; // IMPORTANT: see https://gun.eco/docs/DAM#self
|
|
}
|
|
peer.met = peer.met || +(new Date);
|
|
if(!tmp.hied){ root.on(tmp.hied = 'hi', peer) }
|
|
// @rogowski I need this here by default for now to fix go1dfish's bug
|
|
tmp = peer.queue; peer.queue = [];
|
|
setTimeout.each(tmp||[],function(msg){
|
|
send(msg, peer);
|
|
},0,9);
|
|
//Type.obj.native && Type.obj.native(); // dirty place to check if other JS polluted.
|
|
}
|
|
mesh.bye = function(peer){
|
|
root.on('bye', peer);
|
|
var tmp = +(new Date); tmp = (tmp - (peer.met||tmp));
|
|
mesh.bye.time = ((mesh.bye.time || tmp) + tmp) / 2;
|
|
}
|
|
mesh.hear['!'] = function(msg, peer){ opt.log('Error:', msg.err) }
|
|
mesh.hear['?'] = function(msg, peer){
|
|
if(msg.pid){
|
|
if(!peer.pid){ peer.pid = msg.pid }
|
|
if(msg['@']){ return }
|
|
}
|
|
mesh.say({dam: '?', pid: opt.pid, '@': msg['#']}, peer);
|
|
delete dup.s[peer.last]; // IMPORTANT: see https://gun.eco/docs/DAM#self
|
|
}
|
|
|
|
root.on('create', function(root){
|
|
root.opt.pid = root.opt.pid || String.random(9);
|
|
this.to.next(root);
|
|
root.on('out', mesh.say);
|
|
});
|
|
|
|
root.on('bye', function(peer, tmp){
|
|
peer = opt.peers[peer.id || peer] || peer;
|
|
this.to.next(peer);
|
|
peer.bye? peer.bye() : (tmp = peer.wire) && tmp.close && tmp.close();
|
|
delete opt.peers[peer.id];
|
|
peer.wire = null;
|
|
});
|
|
|
|
var gets = {};
|
|
root.on('bye', function(peer, tmp){ this.to.next(peer);
|
|
if(tmp = console.STAT){ tmp.peers = (tmp.peers || 0) - 1 }
|
|
if(!(tmp = peer.url)){ return } gets[tmp] = true;
|
|
setTimeout(function(){ delete gets[tmp] },opt.lack || 9000);
|
|
});
|
|
root.on('hi', function(peer, tmp){ this.to.next(peer);
|
|
if(tmp = console.STAT){ tmp.peers = (tmp.peers || 0) + 1 }
|
|
if(!(tmp = peer.url) || !gets[tmp]){ return } delete gets[tmp];
|
|
if(opt.super){ return } // temporary (?) until we have better fix/solution?
|
|
setTimeout.each(Object.keys(root.next), function(soul){ var node = root.next[soul]; // TODO: .keys( is slow
|
|
tmp = {}; tmp[soul] = root.graph[soul]; tmp = String.hash(tmp); // TODO: BUG! This is broken.
|
|
mesh.say({'##': tmp, get: {'#': soul}}, peer);
|
|
});
|
|
});
|
|
|
|
return mesh;
|
|
}
|
|
var empty = {}, ok = true, u;
|
|
|
|
try{ module.exports = Mesh }catch(e){}
|
|
|
|
})(USE, './mesh');
|
|
|
|
;USE(function(module){
|
|
var Gun = USE('../index');
|
|
Gun.Mesh = USE('./mesh');
|
|
|
|
Gun.on('opt', function(root){
|
|
this.to.next(root);
|
|
if(root.once){ return }
|
|
var opt = root.opt;
|
|
if(false === opt.WebSocket){ return }
|
|
|
|
var env = Gun.window || {};
|
|
var websocket = opt.WebSocket || env.WebSocket || env.webkitWebSocket || env.mozWebSocket;
|
|
if(!websocket){ return }
|
|
opt.WebSocket = websocket;
|
|
|
|
var mesh = opt.mesh = opt.mesh || Gun.Mesh(root);
|
|
|
|
var wire = mesh.wire || opt.wire;
|
|
mesh.wire = opt.wire = open;
|
|
function open(peer){ try{
|
|
if(!peer || !peer.url){ return wire && wire(peer) }
|
|
var url = peer.url.replace(/^http/, 'ws');
|
|
var wire = peer.wire = new opt.WebSocket(url);
|
|
wire.onclose = function(){
|
|
opt.mesh.bye(peer);
|
|
reconnect(peer);
|
|
};
|
|
wire.onerror = function(error){
|
|
reconnect(peer);
|
|
};
|
|
wire.onopen = function(){
|
|
opt.mesh.hi(peer);
|
|
}
|
|
wire.onmessage = function(msg){
|
|
if(!msg){ return }
|
|
opt.mesh.hear(msg.data || msg, peer);
|
|
};
|
|
return wire;
|
|
}catch(e){}}
|
|
|
|
setTimeout(function(){ !opt.super && root.on('out', {dam:'hi'}) },1); // it can take a while to open a socket, so maybe no longer lazy load for perf reasons?
|
|
|
|
var wait = 2 * 999;
|
|
function reconnect(peer){
|
|
clearTimeout(peer.defer);
|
|
if(doc && peer.retry <= 0){ return } peer.retry = (peer.retry || opt.retry || 60) - 1;
|
|
peer.defer = setTimeout(function to(){
|
|
if(doc && doc.hidden){ return setTimeout(to,wait) }
|
|
open(peer);
|
|
}, wait);
|
|
}
|
|
var doc = (''+u !== typeof document) && document;
|
|
});
|
|
var noop = function(){}, u;
|
|
})(USE, './websocket');
|
|
|
|
;USE(function(module){
|
|
if(typeof Gun === 'undefined'){ return }
|
|
|
|
var noop = function(){}, store, u;
|
|
try{store = (Gun.window||noop).localStorage}catch(e){}
|
|
if(!store){
|
|
Gun.log("Warning: No localStorage exists to persist data to!");
|
|
store = {setItem: function(k,v){this[k]=v}, removeItem: function(k){delete this[k]}, getItem: function(k){return this[k]}};
|
|
}
|
|
Gun.on('create', function lg(root){
|
|
this.to.next(root);
|
|
var opt = root.opt, graph = root.graph, acks = [], disk, to;
|
|
if(false === opt.localStorage){ return }
|
|
opt.prefix = opt.file || 'gun/';
|
|
try{ disk = lg[opt.prefix] = lg[opt.prefix] || JSON.parse(store.getItem(opt.prefix)) || {};
|
|
}catch(e){ disk = lg[opt.prefix] = {}; }
|
|
|
|
root.on('get', function(msg){
|
|
this.to.next(msg);
|
|
var lex = msg.get, soul, data, tmp, u;
|
|
if(!lex || !(soul = lex['#'])){ return }
|
|
data = disk[soul] || u;
|
|
if(data && (tmp = lex['.'])){ // pluck!
|
|
data = Gun.state.ify({}, tmp, Gun.state.is(data, tmp), data[tmp], soul);
|
|
}
|
|
if(data){ (tmp = {})[soul] = data } // back into a graph.
|
|
root.on('in', {'@': msg['#'], put: tmp, lS:1});// || root.$});
|
|
});
|
|
|
|
root.on('put', function(msg){
|
|
this.to.next(msg); // remember to call next middleware adapter
|
|
var put = msg.put, soul = put['#'], key = put['.'], tmp; // pull data off wire envelope
|
|
//console.log('lS put:', key, put[':']);
|
|
disk[soul] = Gun.state.ify(disk[soul], key, put['>'], put[':'], soul); // merge into disk object
|
|
if(!msg['@']){ acks.push(msg['#']) } // then ack any non-ack write. // TODO: use batch id.
|
|
if(to){ return }
|
|
to = setTimeout(flush, opt.wait || 1); // that gets saved as a whole to disk every 1ms
|
|
});
|
|
function flush(){
|
|
var err, ack = acks; clearTimeout(to); to = false; acks = [];
|
|
try{store.setItem(opt.prefix, JSON.stringify(disk));
|
|
}catch(e){
|
|
Gun.log((err = (e || "localStorage failure")) + " Consider using GUN's IndexedDB plugin for RAD for more storage space, https://gun.eco/docs/RAD#install");
|
|
root.on('localStorage:error', {err: err, get: opt.prefix, put: disk});
|
|
}
|
|
if(!err && !Object.empty(opt.peers)){ return } // only ack if there are no peers. // Switch this to probabilistic mode
|
|
setTimeout.each(ack, function(id){
|
|
root.on('in', {'@': id, err: err, ok: 0}); // localStorage isn't reliable, so make its `ok` code be a low number.
|
|
});
|
|
}
|
|
|
|
});
|
|
})(USE, './localStorage');
|
|
|
|
}()); |