Mirroristas/gun
2
0
Fork 0
mirror of https://github.com/amark/gun.git synced 2026-03-10 18:54:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

ugh, still have to sort :(, really should polyfill weakmap then

Browse Source
This commit is contained in:
Mark Nadal
2021-07-08 11:59:39 -07:00
parent 4d92aa69ea
commit ead5893dfb
2 changed files with 32 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
axe.js
View File

@@ -31,17 +31,17 @@
Gun.on('opt', function(at){ start(at) ; this.to.next(at) }); // make sure to call the "next" middleware adapter.
function start(at){
if(at.axe){ return }
var opt = at.opt, peers = opt.peers;
function start(root){
if(root.axe){ return }
var opt = root.opt, peers = opt.peers;
if(false === opt.axe){ return }
if((typeof process !== "undefined") && 'false' === ''+(process.env||'').AXE){ return }
if(!Gun.window){ return }
var axe = at.axe = {}, tmp, id;
var axe = root.axe = {}, tmp, id;
tmp = peers[id = 'http://localhost:8765/gun'] = peers[id] || {};
tmp.id = tmp.url = id;
tmp.retry = tmp.retry || 2; // BUG: Check 0?
console.log("Attempting to discover network via (1) local peer (2) last used peers (3) hardcoded peers!");
tmp.retry = tmp.retry || 0; // BUG: Check 0?
console.log("AXE enabled: Trying to find network via (1) local peer (2) last used peers (3) hard coded peers.");
var last = JSON.parse((localStorage||'')[(opt.file||'')+'axe/']||null) || {};
Object.keys(last.peers||'').forEach(function(key){
tmp = peers[id = key] = peers[id] || {};
@@ -49,6 +49,21 @@
});
tmp = peers[id = 'https://gun-manhattan.herokuapp.com/gun'] = peers[id] || {};
tmp.id = tmp.url = id;
var mesh = opt.mesh = opt.mesh || Gun.Mesh(root); // DAM!
mesh.way = function(msg){
if(root.$ === msg.$ || (msg._||'').via){
mesh.say(msg, opt.peers);
return;
}
var at = (msg.$||'')._;
if(!at){ mesh.say(msg, opt.peers); return }
if(msg.get){
if(at.axe){ return } // don't ask for it again!
at.axe = {};
}
mesh.say(msg, opt.peers);
}
}
var empty = {}, yes = true, u;

21
gun.js
View File

@@ -309,7 +309,7 @@
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? Keys itself is not O(1) either, create ES5 shim over ?weak map? or custom which is constant.
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? Keys itself is not O(1) either, create ES5 shim over ?weak map? or custom which is constant.
console.STAT && console.STAT(S, ((DBG||ctx).pk = +new Date) - S, 'put sort');
var ni = 0, nj, kl, soul, node, states, err, tmp;
(function pop(o){
@@ -588,22 +588,17 @@
get['#'] = get['#'] || at.soul;
msg['#'] || (msg['#'] = text_rand(9)); // A3120 ?
back = (root.$.get(get['#'])._);
if(!(get = get['.'])){
if(!(get = get['.'])){ // soul
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];
//'pub' === get && console.log("what the freak?", get, back.id);
(back.ask || (back.ask = {}))[get] = back.$.get(get)._;
back.on('in', {get: get, put: {'#': back.soul, '.': get, ':': back.put[get], '>': state_is(root.graph[back.soul], get)}});
if(tmp){ return }
@@ -798,10 +793,10 @@
$: at.$,
'@': msg['@']
});
(tmp = at.Q) && setTimeout.each(Object.keys(tmp), function(id){ // TODO: Temporary testing, not integrated or being used, probably delete.
/*(tmp = at.Q) && setTimeout.each(Object.keys(tmp), function(id){ // TODO: Temporary testing, not integrated or being used, probably delete.
Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] }, tmp = {}); tmp['@'] = id; // copy message
root.on('in', tmp);
}); delete at.Q;
}); delete at.Q;*/
return;
}
(msg._||{}).miss = 1;
@@ -1376,8 +1371,14 @@
msg['##'] = h;
say(msg, peer);
delete msg._.$put;
})
}, sort);
}
function sort(k, v){ var tmp;
if(!(v instanceof Object)){ return v }
Object.keys(v).sort().forEach(sorta, {to: tmp = {}, on: v});
return tmp;
} function sorta(k){ this.to[k] = this.on[k] }
var say = mesh.say = function(msg, peer){ var tmp;
if((tmp = this) && (tmp = tmp.to) && tmp.next){ tmp.next(msg) } // compatible with middleware adapters.
if(!msg){ return false }