-
Notifications
You must be signed in to change notification settings - Fork 0
/
gun.js
1478 lines (1425 loc) · 62.1 KB
/
gun.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
;(function(){
function Gun(o){
var gun = this;
if(!Gun.is(gun)){ return new Gun(o) }
if(Gun.is(o)){ return gun }
return gun.opt(o);
}
;(function(Util){ // Generic javascript utilities.
;(function(Type){
Type.fns = {is: function(fn){ return (fn instanceof Function)? true : false }};
Type.bi = {is: function(b){ return (b instanceof Boolean || typeof b == 'boolean')? true : false }}
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'? true : false }}
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 uppercase, 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() }
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){
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){
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
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)? true : false }}
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.constructor? false : o.constructor === Object? true : !o.constructor.call || o.constructor.toString().match(/\[native\ code\]/)? false : true }}
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 true;
}
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(b, f, d){ return b[f] = b[f] || (arguments.length >= 3? d : {}) }
Type.obj.has = function(o, t){ return o && Object.prototype.hasOwnProperty.call(o, t) }
Type.obj.empty = function(o, n){
if(!o){ return true }
return Type.obj.map(o,function(v,i){
if(n && (i === n || (Type.obj.is(n) && Type.obj.has(n, i)))){ return }
if(i){ return true }
})? false : true;
}
Type.obj.map = function(l, c, _){
var u, i = 0, ii = 0, x, r, rr, ll, lle, f = Type.fns.is(c),
t = function(k,v){
if(2 === arguments.length){
rr = rr || {};
rr[k] = v;
return;
} rr = rr || [];
rr.push(k);
};
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++){
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? rr : Type.list.index? 0 : -1;
}
Type.time = {};
Type.time.is = function(t){ return t? t instanceof Date : (+new Date().getTime()) }
Type.time.now = (function(){
var time = Type.time.is, last = -Infinity, n = 0, d = 1000;
return function(){
var t = time();
if(last < t){
n = 0;
return last = t;
}
return last = t + ((n += 1) / d);
}
}());
}(Util));
;(function(exports){ // On event emitter generic javascript utility.
function On(){};
On.create = function(){
var on = function(e){
on.event.e = e;
on.event.s[e] = on.event.s[e] || [];
return on;
};
on.emit = function(a){
var e = on.event.e, s = on.event.s[e], args = arguments, l = args.length;
exports.list.map(s, function(hear, i){
if(!hear.fn){ s.splice(i-1, 0); return; }
if(1 === l){ hear.fn(a); return; }
hear.fn.apply(hear, args);
});
if(!s.length){ delete on.event.s[e] }
}
on.event = function(fn, i){
var s = on.event.s[on.event.e]; if(!s){ return }
var e = {fn: fn, i: i || 0, off: function(){ return !(e.fn = false) }};
return s.push(e), i? s.sort(sort) : i, e;
}
on.event.s = {};
return on;
}
var sort = exports.list.sort('i');
exports.on = On.create();
exports.on.create = On.create;
}(Util));
;(function(exports){ // Generic javascript scheduler utility.
var schedule = function(state, cb){ // maybe use lru-cache?
schedule.waiting.push({when: state, event: cb || function(){}});
if(schedule.soonest < state){ return }
schedule.set(state);
}
schedule.waiting = [];
schedule.soonest = Infinity;
schedule.sort = exports.list.sort('when');
schedule.set = function(future){
if(Infinity <= (schedule.soonest = future)){ return }
var now = exports.time.now(); // WAS time.is() TODO: Hmmm, this would make it hard for every gun instance to have their own version of time.
future = (future <= now)? 0 : (future - now);
clearTimeout(schedule.id);
schedule.id = setTimeout(schedule.check, future);
}
schedule.check = function(){
var now = exports.time.now(), soonest = Infinity; // WAS time.is() TODO: Same as above about time. Hmmm.
schedule.waiting.sort(schedule.sort);
schedule.waiting = exports.list.map(schedule.waiting, function(wait, i, map){
if(!wait){ return }
if(wait.when <= now){
if(exports.fns.is(wait.event)){
setTimeout(function(){ wait.event() },0);
}
} else {
soonest = (soonest < wait.when)? soonest : wait.when;
map(wait);
}
}) || [];
schedule.set(soonest);
}
exports.schedule = schedule;
}(Util));
}(Gun));
;(function(Gun){ // Gun specific utilities.
Gun.version = 0.3;
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.
,'#':'soul'
,'.':'field'
,'=':'value'
,'>':'state'
}
Gun.is = function(gun){ return (gun instanceof Gun)? true : false } // 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.
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.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 id;
Gun.obj.map(v, function(s, f){ // map over the object...
if(id){ return 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.
id = s; // we found the soul!
} else {
return id = false; // if there exists anything else on the object that isn't the soul, then it is considered invalid.
}
});
if(id){ // a valid id was found.
return 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.
Gun.is.lex = function(l){ var r = true;
if(!Gun.obj.is(l)){ return false }
Gun.obj.map(l, function(v,f){
if(!Gun.obj.has(Gun._,f) || !(Gun.text.is(v) || Gun.obj.is(v))){ return r = false }
}); // TODO: What if the lex cursor has a document on the match, that shouldn't be allowed!
return r;
}
Gun.is.node = function(n, cb, t){ 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, function(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(cb){ cb.call(t, v, f, n) } // optionally callback each field/value.
});
}
return false; // nope! This was not a valid node.
}
Gun.is.node.ify = function(n, s, o){ // convert a shallow object into a node.
o = Gun.bi.is(o)? {force: o} : o || {}; // detect options.
n = Gun.is.node.soul.ify(n, s, o.force); // put a soul on it.
Gun.obj.map(n, function(v, f){ // iterate over each field/value.
if(Gun._.meta === f){ return } // ignore meta.
Gun.is.node.state.ify([n], f, v, o.state = o.state || Gun.time.now()); // and set the state for this field and value on this node.
});
return n; // This will only be a valid node if the object wasn't already deep!
}
Gun.is.node.soul = function(n, s){ return (n && n._ && n._[s || Gun._.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, s, o){ // put a soul on an object.
n = n || {}; // make sure it exists.
n._ = n._ || {}; // make sure meta exists.
n._[Gun._.soul] = o? s : n._[Gun._.soul] || s || Gun.text.random(); // if it already has a soul then use that instead - unless you force the soul you want with an option.
return n;
}
Gun.is.node.state = function(n, f){ return (f && n && n._ && n._[Gun._.state] && Gun.num.is(n._[Gun._.state][f]))? n._[Gun._.state][f] : false } // convenience function to get the state on a field on a node and return it.
Gun.is.node.state.ify = function(l, f, v, state){ // put a field's state and value on some nodes.
l = Gun.list.is(l)? l : [l]; // handle a list of nodes or just one node.
var l = l.reverse(), d = l[0]; // we might want to inherit the state from the last node in the list.
Gun.list.map(l, function(n, i){ // iterate over each node.
n = n || {}; // make sure it exists.
if(Gun.is.val(v)){ n[f] = v } // if we have a value, then put it.
n._ = n._ || {}; // make sure meta exists.
n = n._[Gun._.state] = n._[Gun._.state] || {}; // make sure HAM state exists.
if(i = d._[Gun._.state][f]){ n[f] = i } // inherit the state!
if(Gun.num.is(state)){ n[f] = state } // or manually set the state.
});
}
Gun.is.graph = function(g, cb, fn, t){ // checks to see if an object is a valid graph.
var exist = false;
if(!Gun.obj.is(g)){ return false } // must be an object.
return !Gun.obj.map(g, function(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, fn)){ return true } // it is true that this is an invalid graph.
(cb || function(){}).call(t, n, s, function(fn){ // optional callback for each node.
if(fn){ Gun.is.node(n, fn, t) } // where we then have an optional callback for each field/value.
});
exist = true;
}) && exist; // 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){ // TODO: Lester's comments on roll backs could be vulnerable to divergence, investigate!
if(machineState < incomingState){
// the incoming value is outside the boundary of the machine's state, it must be reprocessed in another state.
return {defer: true};
}
if(incomingState < currentState){
// the incoming value is within the boundary of the machine's state, but not within the range.
return {historical: true};
}
if(currentState < incomingState){
// the incoming value is within both the boundary and the range of the machine's state.
return {converge: true, incoming: true};
}
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"};
}
Gun.union = function(gun, prime, cb, opt){ // merge two graphs into the first.
var opt = opt || Gun.obj.is(cb)? cb : {};
var ctx = {graph: gun.__.graph, count: 0};
ctx.cb = function(){
cb = Gun.fns.is(cb)? cb() && null : null;
}
if(!ctx.graph){ ctx.err = {err: Gun.log("No graph!") } }
if(!prime){ ctx.err = {err: Gun.log("No data to merge!") } }
if(ctx.soul = Gun.is.node.soul(prime)){ prime = Gun.is.graph.ify(prime) }
if(!Gun.is.graph(prime, null, function(val, field, node){ var meta;
if(!Gun.num.is(Gun.is.node.state(node, field))){
return ctx.err = {err: Gun.log("No state on '" + field + "'!") }
}
}) || ctx.err){ return ctx.err = ctx.err || {err: Gun.log("Invalid graph!", prime)}, ctx }
function emit(at){
Gun.on('operating').emit(gun, at);
}
(function union(graph, prime){
var prime = Gun.obj.map(prime, function(n,s,t){t(n)}).sort(function(A,B){
var s = Gun.is.node.soul(A);
if(graph[s]){ return 1 }
return 0;
});
ctx.count += 1;
ctx.err = Gun.list.map(prime, function(node, soul){
soul = Gun.is.node.soul(node);
if(!soul){ return {err: Gun.log("Soul missing or mismatching!")} }
ctx.count += 1;
var vertex = graph[soul];
if(!vertex){ graph[soul] = vertex = Gun.is.node.ify({}, soul) }
Gun.union.HAM(vertex, node, function(vertex, field, val, state){
Gun.on('historical').emit(gun, {soul: soul, field: field, value: val, state: state, change: node});
gun.__.on('historical').emit({soul: soul, field: field, change: node});
}, function(vertex, field, val, state){
if(!vertex){ return }
var change = Gun.is.node.soul.ify({}, soul);
if(field){
Gun.is.node.state.ify([vertex, change, node], field, val);
}
emit({soul: soul, field: field, value: val, state: state, change: change});
}, function(vertex, field, val, state){
Gun.on('deferred').emit(gun, {soul: soul, field: field, value: val, state: state, change: node});
})(function(){
emit({soul: soul, change: node});
if(opt.soul){ opt.soul(soul) }
if(!(ctx.count -= 1)){ ctx.cb() }
}); // TODO: BUG? Handle error!
});
ctx.count -= 1;
})(ctx.graph, prime);
if(!ctx.count){ ctx.cb() }
return ctx;
}
Gun.union.ify = function(gun, prime, cb, opt){
if(gun){ gun = (gun.__ && gun.__.graph)? gun.__.graph : gun }
if(Gun.text.is(prime)){
if(gun && gun[prime]){
prime = gun[prime];
} else {
return Gun.is.node.ify({}, prime);
}
}
var vertex = Gun.is.node.soul.ify({}, Gun.is.node.soul(prime)), prime = Gun.is.graph.ify(prime) || prime;
if(Gun.is.graph(prime, null, function(val, field){ var node;
function merge(a, f, v){ Gun.is.node.state.ify(a, f, v) }
if(Gun.is.rel(val)){ node = gun? gun[field] || prime[field] : prime[field] }
Gun.union.HAM(vertex, node, function(){}, function(vert, f, v){
merge([vertex, node], f, v);
}, function(){})(function(err){
if(err){ merge([vertex], field, val) }
})
})){ return vertex }
}
Gun.union.HAM = function(vertex, delta, lower, now, upper){
upper.max = -Infinity;
now.end = true;
delta = delta || {};
vertex = vertex || {};
Gun.obj.map(delta._, function(v,f){
if(Gun._.state === f || Gun._.soul === f){ return }
vertex._[f] = v;
});
if(!Gun.is.node(delta, function update(incoming, field){
now.end = false;
var ctx = {incoming: {}, current: {}}, state;
ctx.drift = Gun.time.now(); // DANGEROUS!
ctx.incoming.value = Gun.is.rel(incoming) || incoming;
ctx.current.value = Gun.is.rel(vertex[field]) || vertex[field];
ctx.incoming.state = Gun.num.is(ctx.tmp = ((delta._||{})[Gun._.state]||{})[field])? ctx.tmp : -Infinity;
ctx.current.state = Gun.num.is(ctx.tmp = ((vertex._||{})[Gun._.state]||{})[field])? ctx.tmp : -Infinity;
upper.max = ctx.incoming.state > upper.max? ctx.incoming.state : upper.max;
state = Gun.HAM(ctx.drift, ctx.incoming.state, ctx.current.state, ctx.incoming.value, ctx.current.value);
if(state.err){
root.console.log(".!HYPOTHETICAL AMNESIA MACHINE ERR!.", state.err); // this error should never happen.
return;
}
if(state.state || state.historical || state.current){
lower.call(state, vertex, field, incoming, ctx.incoming.state);
return;
}
if(state.incoming){
now.call(state, vertex, field, incoming, ctx.incoming.state);
return;
}
if(state.defer){
upper.wait = true;
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(){})() }
});
}
})){ return function(fn){ if(fn){ fn({err: 'Not a node!'}) } } }
if(now.end){ now.call({}, vertex) } // TODO: Should HAM handle empty updates? YES.
return function(fn){
upper.last = fn || function(){};
if(!upper.wait){ upper.last() }
}
}
Gun.on.at = function(on){ // On event emitter customized for gun.
var proxy = function(e){ return proxy.e = e, proxy }
proxy.emit = function(at){
if(at.soul){
at.hash = Gun.on.at.hash(at);
//Gun.obj.as(proxy.mem, proxy.e)[at.soul] = at;
Gun.obj.as(proxy.mem, proxy.e)[at.hash] = at;
}
if(proxy.all.cb){ proxy.all.cb(at, proxy.e) }
on(proxy.e).emit(at);
return {chain: function(c){
if(!c || !c._ || !c._.at){ return }
return c._.at(proxy.e).emit(at)
}};
}
proxy.only = function(cb){
if(proxy.only.cb){ return }
return proxy.event(proxy.only.cb = cb);
}
proxy.all = function(cb){
proxy.all.cb = cb;
Gun.obj.map(proxy.mem, function(mem, e){
Gun.obj.map(mem, function(at, i){
cb(at, e);
});
});
}
proxy.event = function(cb, i){
i = on(proxy.e).event(cb, i);
return Gun.obj.map(proxy.mem[proxy.e], function(at){
i.stat = {first: true};
cb.call(i, at);
}), i.stat = {}, i;
}
proxy.map = function(cb, i){
return proxy.event(cb, i);
};
proxy.mem = {};
return proxy;
}
Gun.on.at.hash = function(at){ return (at.at && at.at.soul)? at.at.soul + (at.at.field || '') : at.soul + (at.field || '') }
Gun.on.at.copy = function(at){ return Gun.obj.del(at, 'hash'), Gun.obj.map(at, function(v,f,t){t(f,v)}) }
}(Gun));
;(function(Gun){ // Gun prototype chain methods.
Gun.chain = Gun.prototype;
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.
root.__.by = root.__.by || function(f){ return gun.__.by[f] = gun.__.by[f] || {} };
root.__.graph = root.__.graph || {};
root.__.opt = root.__.opt || {peers: {}};
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,{}) }) }
Gun.obj.map(opt.peers, function(v, f){
root.__.opt.peers[f] = v;
});
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];
});
if(!stun){ Gun.on('opt').emit(root, opt) }
return gun;
}
Gun.chain.chain = function(s){
var from = this, gun = !from.back? from : new this.constructor(from);//Gun(from);
gun._ = gun._ || {};
gun._.back = gun.back || from;
gun.back = gun.back || from;
gun.__ = gun.__ || from.__;
gun._.on = gun._.on || Gun.on.create();
gun._.at = gun._.at || Gun.on.at(gun._.on);
return gun;
}
Gun.chain.put = function(val, cb, opt){
opt = opt || {};
cb = cb || function(){}; cb.hash = {};
var gun = this, chain = gun.chain(), tmp = {val: val}, drift = Gun.time.now();
function put(at){
var val = tmp.val;
var ctx = {obj: val}; // prep the value for serialization
ctx.soul = at.field? at.soul : (at.at && at.at.soul) || at.soul; // figure out where we are
ctx.field = at.field? at.field : (at.at && at.at.field) || at.field; // did we come from some where?
if(Gun.is(val)){
if(!ctx.field){ return cb.call(chain, {err: ctx.err = Gun.log('No field to link node to!')}), chain._.at('err').emit(ctx.err) }
return val.val(function(node){
var soul = Gun.is.node.soul(node);
if(!soul){ return cb.call(chain, {err: ctx.err = Gun.log('Only a node can be linked! Not "' + node + '"!')}), chain._.at('err').emit(ctx.err) }
tmp.val = Gun.is.rel.ify(soul);
put(at);
});
}
if(cb.hash[at.hash = at.hash || Gun.on.at.hash(at)]){ return } // if we have already seen this hash...
cb.hash[at.hash] = true; // else mark that we're processing the data (failure to write could still occur).
ctx.by = chain.__.by(ctx.soul);
ctx.not = at.not || (at.at && at.at.not);
Gun.obj.del(at, 'not'); Gun.obj.del(at.at || at, 'not'); // the data is no longer not known! // TODO: BUG! It could have been asynchronous by the time we now delete these properties. Don't other parts of the code assume their deletion is synchronous?
if(ctx.field){ Gun.obj.as(ctx.obj = {}, ctx.field, val) } // if there is a field, then data is actually getting put on the parent.
else if(!Gun.obj.is(val)){ return cb.call(chain, ctx.err = {err: Gun.log("No node exists to put " + (typeof val) + ' "' + val + '" in!')}), chain._.at('err').emit(ctx.err) } // if the data is a primitive and there is no context for it yet, then we have an error.
// TODO: BUG? gun.get(key).path(field).put() isn't doing it as pseudo.
function soul(env, cb, map){ var eat;
if(!env || !(eat = env.at) || !env.at.node){ return }
if(!eat.node._){ eat.node._ = {} }
if(!eat.node._[Gun._.state]){ eat.node._[Gun._.state] = {} }
if(!Gun.is.node.soul(eat.node)){
if(ctx.obj === eat.obj){
Gun.obj.as(env.graph, eat.soul = Gun.obj.as(eat.node._, Gun._.soul, Gun.is.node.soul(eat.obj) || ctx.soul), eat.node);
cb(eat, eat.soul);
} else {
var path = function(err, node){
if(path.opt && path.opt.on && path.opt.on.off){ path.opt.on.off() }
if(path.opt.done){ return }
path.opt.done = true;
if(err){ env.err = err }
eat.soul = Gun.is.node.soul(node) || Gun.is.node.soul(eat.obj) || Gun.is.node.soul(eat.node) || Gun.text.random();
Gun.obj.as(env.graph, Gun.obj.as(eat.node._, Gun._.soul, eat.soul), eat.node);
cb(eat, eat.soul);
}; path.opt = {put: true};
(ctx.not)? path() : ((at.field || at.at)? gun._.back : gun).path(eat.path || [], path, path.opt);
}
}
if(!eat.field){ return }
eat.node._[Gun._.state][eat.field] = drift;
}
function end(err, ify){
ctx.ify = ify;
Gun.on('put').emit(chain, at, ctx, opt, cb, val);
if(err || ify.err){ return cb.call(chain, err || ify.err), chain._.at('err').emit(err || ify.err) } // check for serialization error, emit if so.
if(err = Gun.union(chain, ify.graph, {end: false, soul: function(soul){
if(chain.__.by(soul).end){ return }
Gun.union(chain, Gun.is.node.soul.ify({}, soul)); // fire off an end node if there hasn't already been one, to comply with the wire spec.
}}).err){ return cb.call(chain, err), chain._.at('err').emit(err) } // now actually union the serialized data, emit error if any occur.
if(Gun.fns.is(end.wire = chain.__.opt.wire.put)){
var wcb = function(err, ok, info){
if(err){ return Gun.log(err.err || err), cb.call(chain, err), chain._.at('err').emit(err) }
return cb.call(chain, err, ok);
}
end.wire(ify.graph, wcb, opt);
} else {
if(!Gun.log.count('no-wire-put')){ Gun.log("Warning! You have no persistence layer to save to!") }
cb.call(chain, null); // This is in memory success, hardly "success" at all.
}
if(ctx.field){
return gun._.back.path(ctx.field, null, {chain: opt.chain || chain});
}
if(ctx.not){
return gun.__.gun.get(ctx.soul, null, {chain: opt.chain || chain});
}
chain.get(ctx.soul, null, {chain: opt.chain || chain, at: gun._.at })
}
Gun.ify(ctx.obj, soul, {pure: true})(end); // serialize the data!
}
if(gun === gun.back){ // if we are the root chain...
put({soul: Gun.is.node.soul(val) || Gun.text.random(), not: true}); // then cause the new chain to save data!
} else { // else if we are on an existing chain then...
gun._.at('soul').map(put); // put data on every soul that flows through this chain.
var back = function(gun){
if(back.get || gun._.back === gun || gun._.not){ return } // TODO: CLEAN UP! Would be ideal to accomplish this in a more ideal way.
if(gun._.get){ back.get = true }
gun._.at('null').event(function(at){ this.off();
if(opt.init || gun.__.opt.init){ return Gun.log("Warning! You have no context to `.put`", val, "!") }
gun.init();
}, -999);
return back(gun._.back);
};
if(!opt.init && !gun.__.opt.init){ back(gun) }
}
chain.back = gun.back;
return chain;
}
Gun.chain.get = (function(){
Gun.on('operating').event(function(gun, at){
if(!gun.__.by(at.soul).node){ gun.__.by(at.soul).node = gun.__.graph[at.soul] }
if(at.field){ return } // TODO: It would be ideal to reuse HAM's field emit.
gun.__.on(at.soul).emit(at);
});
Gun.on('get').event(function(gun, at, ctx, opt, cb){
if(ctx.halt){ return } // TODO: CLEAN UP with event emitter option?
at.change = at.change || gun.__.by(at.soul).node;
if(opt.raw){ return cb.call(opt.on, at) }
if(!ctx.cb.no){ cb.call(ctx.by.chain, null, Gun.obj.copy(ctx.node || gun.__.by(at.soul).node)) }
gun._.at('soul').emit(at).chain(opt.chain);
},0);
Gun.on('get').event(function(gun, at, ctx){
if(ctx.halt){ ctx.halt = false; return } // TODO: CLEAN UP with event emitter option?
}, Infinity);
return function(lex, cb, opt){ // get opens up a reference to a node and loads it.
var gun = this, ctx = {
opt: opt || {},
cb: cb || function(){},
lex: (Gun.text.is(lex) || Gun.num.is(lex))? Gun.is.rel.ify(lex) : lex,
};
ctx.force = ctx.opt.force;
if(cb !== ctx.cb){ ctx.cb.no = true }
if(!Gun.obj.is(ctx.lex)){ return ctx.cb.call(gun = gun.chain(), {err: Gun.log('Invalid get request!', lex)}), gun }
if(!(ctx.soul = ctx.lex[Gun._.soul])){ return ctx.cb.call(gun = this.chain(), {err: Gun.log('No soul to get!')}), gun } // TODO: With `.all` it'll be okay to not have an exact match!
ctx.by = gun.__.by(ctx.soul);
ctx.by.chain = ctx.by.chain || gun.chain();
function load(lex){
var soul = lex[Gun._.soul];
var cached = gun.__.by(soul).node || gun.__.graph[soul];
if(ctx.force){ ctx.force = false }
else if(cached){ return false }
wire(lex, stream, ctx.opt);
return true;
}
function stream(err, data, info){
//console.log("wire.get <--", err, data);
Gun.on('wire.get').emit(ctx.by.chain, ctx, err, data, info);
if(err){
Gun.log(err.err || err);
ctx.cb.call(ctx.by.chain, err);
return ctx.by.chain._.at('err').emit({soul: ctx.soul, err: err.err || err}).chain(ctx.opt.chain);
}
if(!data){
ctx.cb.call(ctx.by.chain, null);
return ctx.by.chain._.at('null').emit({soul: ctx.soul, not: true}).chain(ctx.opt.chain);
}
if(Gun.obj.empty(data)){ return }
if(err = Gun.union(ctx.by.chain, data).err){
ctx.cb.call(ctx.by.chain, err);
return ctx.by.chain._.at('err').emit({soul: Gun.is.node.soul(data) || ctx.soul, err: err.err || err}).chain(ctx.opt.chain);
}
}
function wire(lex, cb, opt){
Gun.on('get.wire').emit(ctx.by.chain, ctx, lex, cb, opt);
if(Gun.fns.is(gun.__.opt.wire.get)){ return gun.__.opt.wire.get(lex, cb, opt) }
if(!Gun.log.count('no-wire-get')){ Gun.log("Warning! You have no persistence layer to get from!") }
cb(null); // This is in memory success, hardly "success" at all.
}
function on(at){
if(on.ran = true){ ctx.opt.on = this }
if(load(ctx.lex)){ return }
Gun.on('get').emit(ctx.by.chain, at, ctx, ctx.opt, ctx.cb, ctx.lex);
}
ctx.opt.on = (ctx.opt.at || gun.__.at)(ctx.soul).event(on);
ctx.by.chain._.get = ctx.lex;
if(!ctx.opt.ran && !on.ran){ on.call(ctx.opt.on, {soul: ctx.soul}) }
return ctx.by.chain;
}
}());
Gun.chain.key = (function(){
Gun.on('put').event(function(gun, at, ctx, opt, cb){
if(opt.key){ return }
Gun.is.graph(ctx.ify.graph, function(node, soul){
var key = {node: gun.__.graph[soul]};
if(!Gun.is.node.soul(key.node, 'key')){ return }
if(!gun.__.by(soul).end){ gun.__.by(soul).end = 1 }
Gun.is.node(key.node, function each(rel, s){
var n = gun.__.graph[s];
if(n && Gun.is.node.soul(n, 'key')){
Gun.is.node(n, each);
return;
}
rel = ctx.ify.graph[s] = ctx.ify.graph[s] || Gun.is.node.soul.ify({}, s);
Gun.is.node(node, function(v,f){ Gun.is.node.state.ify([rel, node], f, v) });
Gun.obj.del(ctx.ify.graph, soul);
})
});
});
Gun.on('get').event(function(gun, at, ctx, opt, cb){
if(ctx.halt){ return } // TODO: CLEAN UP with event emitter option?
if(opt.key && opt.key.soul){
at.soul = opt.key.soul;
gun.__.by(opt.key.soul).node = Gun.union.ify(gun, opt.key.soul); // TODO: Check performance?
gun.__.by(opt.key.soul).node._['key'] = 'pseudo';
at.change = Gun.is.node.soul.ify(Gun.obj.copy(at.change || gun.__.by(at.soul).node), at.soul, true); // TODO: Check performance?
return;
}
if(!(Gun.is.node.soul(gun.__.graph[at.soul], 'key') === 1)){ return }
var node = at.change || gun.__.graph[at.soul];
function map(rel, soul){ gun.__.gun.get(rel, cb, {key: ctx, chain: opt.chain || gun, force: opt.force}) }
ctx.halt = true;
Gun.is.node(node, map);
},-999);
return function(key, cb, opt){
var gun = this;
opt = Gun.text.is(opt)? {soul: opt} : opt || {};
cb = cb || function(){}; cb.hash = {};
if(!Gun.text.is(key) || !key){ return cb.call(gun, {err: Gun.log('No key!')}), gun }
function index(at){
var ctx = {node: gun.__.graph[at.soul]};
if(at.soul === key || at.key === key){ return }
if(cb.hash[at.hash = at.hash || Gun.on.at.hash(at)]){ return } cb.hash[at.hash] = true;
ctx.obj = (1 === Gun.is.node.soul(ctx.node, 'key'))? Gun.obj.copy(ctx.node) : Gun.obj.put({}, at.soul, Gun.is.rel.ify(at.soul));
Gun.obj.as((ctx.put = Gun.is.node.ify(ctx.obj, key, true))._, 'key', 1);
gun.__.gun.put(ctx.put, function(err, ok){cb.call(this, err, ok)}, {chain: opt.chain, key: true, init: true});
}
if(opt.soul){
index({soul: opt.soul});
return gun;
}
if(gun === gun.back){
cb.call(gun, {err: Gun.log('You have no context to `.key`', key, '!')});
} else {
gun._.at('soul').map(index);
}
return gun;
}
}());
Gun.chain.on = function(cb, opt){ // on subscribes to any changes on the souls.
var gun = this, u;
opt = Gun.obj.is(opt)? opt : {change: opt};
cb = cb || function(){};
function map(at){
opt.on = opt.on || this;
var ctx = {by: gun.__.by(at.soul)}, change = ctx.by.node;
if(opt.on.stat && opt.on.stat.first){ (at = Gun.on.at.copy(at)).change = ctx.by.node }
if(opt.raw){ return cb.call(opt.on, at) }
if(opt.once){ this.off() }
if(opt.change){ change = at.change }
if(!opt.empty && Gun.obj.empty(change, Gun._.meta)){ return }
cb.call(ctx.by.chain || gun, Gun.obj.copy(at.field? change[at.field] : change), at.field || (at.at && at.at.field));
};
opt.on = gun._.at('soul').map(map);
if(gun === gun.back){ Gun.log('You have no context to `.on`!') }
return gun;
}
Gun.chain.path = (function(){
Gun.on('get').event(function(gun, at, ctx, opt, cb, lex){
if(ctx.halt){ return } // TODO: CLEAN UP with event emitter option?
if(opt.path){ at.at = opt.path }
var xtc = {soul: lex[Gun._.soul], field: lex[Gun._.field]};
xtc.change = at.change || gun.__.by(at.soul).node;
if(xtc.field){ // TODO: future feature!
if(!Gun.obj.has(xtc.change, xtc.field)){ return }
ctx.node = Gun.is.node.soul.ify({}, at.soul); // TODO: CLEAN UP! ctx.node usage.
Gun.is.node.state.ify([ctx.node, xtc.change], xtc.field, xtc.change[xtc.field]);
at.change = ctx.node; at.field = xtc.field;
}
},-99);
Gun.on('get').event(function(gun, at, ctx, opt, cb, lex){
if(ctx.halt){ return } // TODO: CLEAN UP with event emitter option?
var xtc = {}; xtc.change = at.change || gun.__.by(at.soul).node;
if(!opt.put){ // TODO: CLEAN UP be nice if path didn't have to worry about this.
Gun.is.node(xtc.change, function(v,f){
var fat = Gun.on.at.copy(at); fat.field = f; fat.value = v;
Gun.obj.del(fat, 'at'); // TODO: CLEAN THIS UP! It would be nice in every other function every where else it didn't matter whether there was a cascading at.at.at.at or not, just and only whether the current context as a field or should rely on a previous field. But maybe that is the gotcha right there?
fat.change = fat.change || xtc.change;
if(v = Gun.is.rel(fat.value)){ fat = {soul: v, at: fat} }
gun._.at('path:' + f).emit(fat).chain(opt.chain);
});
}
if(!ctx.end){
ctx.end = gun._.at('end').emit(at).chain(opt.chain);
}
},99);
return function(path, cb, opt){
opt = opt || {};
cb = cb || (function(){ var cb = function(){}; cb.no = true; return cb }()); cb.hash = {};
var gun = this, chain = gun.chain(), f, c, u;
if(!Gun.list.is(path)){ if(!Gun.text.is(path)){ if(!Gun.num.is(path)){ // if not a list, text, or number
return cb.call(chain, {err: Gun.log("Invalid path '" + path + "'!")}), chain; // then complain
} else { return this.path(path + '', cb, opt) } } else { return this.path(path.split('.'), cb, opt) } } // else coerce upward to a list.
if(gun === gun.back){
cb.call(chain, opt.put? null : {err: Gun.log('You have no context to `.path`', path, '!')}, opt.put? gun.__.graph[(path||[])[0]] : u);
return chain;
}
gun._.at('path:' + path[0]).event(function(at){
if(opt.done){ this.off(); return } // TODO: BUG - THIS IS A FIX FOR A BUG! TEST #"context no double emit", COMMENT THIS LINE OUT AND SEE IT FAIL!
var ctx = {soul: at.soul, field: at.field, by: gun.__.by(at.soul)}, field = path[0];
var on = Gun.obj.as(cb.hash, at.hash, {off: function(){}});
if(at.soul === on.soul){ return }
else { on.off() }
if(ctx.rel = (Gun.is.rel(at.value) || Gun.is.rel(at.at && at.at.value))){
if(opt.put && 1 === path.length){
return cb.call(ctx.by.chain || chain, null, Gun.is.node.soul.ify({}, ctx.rel));
}
var get = function(err, node){
if(!err && 1 !== path.length){ return }
cb.call(this, err, node, field);
};
ctx.opt = {chain: opt.chain || chain, put: opt.put, path: {soul: (at.at && at.at.soul) || at.soul, field: field }};
gun.__.gun.get(ctx.rel || at.soul, cb.no? null : get, ctx.opt);
(opt.on = cb.hash[at.hash] = on = ctx.opt.on).soul = at.soul; // TODO: BUG! CB getting reused as the hash point for multiple paths potentially! Could cause problems!
return;
}
if(1 === path.length){ cb.call(ctx.by.chain || chain, null, at.value, ctx.field) }
chain._.at('soul').emit(at).chain(opt.chain);
});
gun._.at('null').only(function(at){
if(!at.field){ return }
if(at.not){
gun.put({}, null, {init: true});
if(opt.init || gun.__.opt.init){ return }
}
(at = Gun.on.at.copy(at)).field = path[0];
at.not = true;
chain._.at('null').emit(at).chain(opt.chain);
});
gun._.at('end').event(function(at){
this.off();
if(at.at && at.at.field === path[0]){ return } // TODO: BUG! THIS FIXES SO MANY PROBLEMS BUT DOES IT CATCH VARYING SOULS EDGE CASE?
var ctx = {by: gun.__.by(at.soul)};
if(Gun.obj.has(ctx.by.node, path[0])){ return }
(at = Gun.on.at.copy(at)).field = path[0];
at.not = true;
cb.call(ctx.by.chain || chain, null);
chain._.at('null').emit(at).chain(opt.chain);
});
if(path.length > 1){
(c = chain.path(path.slice(1), cb, opt)).back = gun;
}
return c || chain;
}
}());
Gun.chain.map = function(cb, opt){
var u, gun = this, chain = gun.chain();
cb = cb || function(){}; cb.hash = {};
opt = Gun.bi.is(opt)? {change: opt} : opt || {};
opt.change = Gun.bi.is(opt.change)? opt.change : true;
function path(err, val, field){
if(err || (val === u)){ return }
cb.call(this, val, field);
}
function each(val, field){
//if(!Gun.is.rel(val)){ path.call(this.gun, null, val, field);return;}
if(opt.node){
if(!Gun.is.rel(val)){
return;
}
}
cb.hash[this.soul + field] = cb.hash[this.soul + field] || this.gun.path(field, path, {chain: chain, via: 'map'}); // TODO: path should reuse itself! We shouldn't have to do it ourselves.
// TODO:
// 1. Ability to turn off an event. // automatically happens within path since reusing is manual?
// 2. Ability to pass chain context to fire on. // DONE
// 3. Pseudoness handled for us. // DONE
// 4. Reuse. // MANUALLY DONE
}
function map(at){
var ref = gun.__.by(at.soul).chain || gun;
Gun.is.node(at.change, each, {gun: ref, soul: at.soul});
}
gun.on(map, {raw: true, change: true}); // TODO: ALLOW USER TO DO map change false!
if(gun === gun.back){ Gun.log('You have no context to `.map`!') }
return chain;
}
Gun.chain.val = (function(){
Gun.on('get.wire').event(function(gun, ctx){
if(!ctx.soul){ return } var end;
(end = gun.__.by(ctx.soul)).end = (end.end || -1); // TODO: CLEAN UP! This should be per peer!
},-999);
Gun.on('wire.get').event(function(gun, ctx, err, data){
if(err || !ctx.soul){ return }
if(data && !Gun.obj.empty(data, Gun._.meta)){ return }
var end = gun.__.by(ctx.soul);
end.end = (!end.end || end.end < 0)? 1 : end.end + 1;
},-999);
return function(cb, opt){
var gun = this, args = Gun.list.slit.call(arguments);
cb = Gun.fns.is(cb)? cb : function(val, field){ root.console.log.apply(root.console, args.concat([field && (field += ':'), val])) }; cb.hash = {};
opt = opt || {};
function val(at){
var ctx = {by: gun.__.by(at.soul), at: at.at || at}, node = ctx.by.node, field = ctx.at.field, hash = Gun.on.at.hash({soul: ctx.at.key || ctx.at.soul, field: field});
if(cb.hash[hash]){ return }
if(at.field && Gun.obj.has(node, at.field)){
return cb.hash[hash] = true, cb.call(ctx.by.chain || gun, Gun.obj.copy(node[at.field]), at.field);
}
if(!opt.empty && Gun.obj.empty(node, Gun._.meta)){ return } // TODO: CLEAN UP! .on already does this without the .raw!
if(ctx.by.end < 0){ return }
return cb.hash[hash] = true, cb.call(ctx.by.chain || gun, Gun.obj.copy(node), field);
}
gun.on(val, {raw: true});
if(gun === gun.back){ Gun.log('You have no context to `.val`!') }
return gun;
}
}());
Gun.chain.not = function(cb, opt){
var gun = this, chain = gun.chain();
cb = cb || function(){};
opt = opt || {};
function not(at,e){
if(at.field){
if(Gun.obj.has(gun.__.by(at.soul).node, at.field)){ return Gun.obj.del(at, 'not'), chain._.at(e).emit(at) }
} else
if(at.soul && gun.__.by(at.soul).node){ return Gun.obj.del(at, 'not'), chain._.at(e).emit(at) }
if(!at.not){ return }
var kick = function(next){
if(++kick.c){ return Gun.log("Warning! Multiple `not` resumes!"); }
next._.at.all(function(on ,e){ // TODO: BUG? Switch back to .at? I think .on is actually correct so it doesn't memorize. // TODO: BUG! What about other events?
chain._.at(e).emit(on);
});
};
kick.c = -1
kick.chain = gun.chain();
kick.next = cb.call(kick.chain, opt.raw? at : (at.field || at.soul || at.not), kick);
kick.soul = Gun.text.random();
if(Gun.is(kick.next)){ kick(kick.next) }
kick.chain._.at('soul').emit({soul: kick.soul, field: at.field, not: true, via: 'not'});
}
gun._.at.all(not);
if(gun === gun.back){ Gun.log('You have no context to `.not`!') }
chain._.not = true; // TODO: CLEAN UP! Would be ideal if we could accomplish this in a more elegant way.
return chain;
}