-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathfirepad.js
5390 lines (4628 loc) · 178 KB
/
firepad.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
/*
* Firepad http://www.firepad.io/
*
* Copyright 2013 Firebase
* with code from ot.js (Copyright 2012-2013 Tim Baumann)
*/
var Firepad = (function() {
var firepad = firepad || { };
firepad.utils = { };
firepad.utils.makeEventEmitter = function(clazz, opt_allowedEVents) {
clazz.prototype.allowedEvents_ = opt_allowedEVents;
clazz.prototype.on = function(eventType, callback, context) {
this.validateEventType_(eventType);
this.eventListeners_ = this.eventListeners_ || { };
this.eventListeners_[eventType] = this.eventListeners_[eventType] || [];
this.eventListeners_[eventType].push({ callback: callback, context: context });
};
clazz.prototype.off = function(eventType, callback) {
this.validateEventType_(eventType);
this.eventListeners_ = this.eventListeners_ || { };
var listeners = this.eventListeners_[eventType] || [];
for(var i = 0; i < listeners.length; i++) {
if (listeners[i].callback === callback) {
listeners.splice(i, 1);
return;
}
}
};
clazz.prototype.trigger = function(eventType /*, args ... */) {
this.eventListeners_ = this.eventListeners_ || { };
var listeners = this.eventListeners_[eventType] || [];
for(var i = 0; i < listeners.length; i++) {
listeners[i].callback.apply(listeners[i].context, Array.prototype.slice.call(arguments, 1));
}
};
clazz.prototype.validateEventType_ = function(eventType) {
if (this.allowedEvents_) {
var allowed = false;
for(var i = 0; i < this.allowedEvents_.length; i++) {
if (this.allowedEvents_[i] === eventType) {
allowed = true;
break;
}
}
if (!allowed) {
throw new Error('Unknown event "' + eventType + '"');
}
}
};
};
firepad.utils.elt = function(tag, content, attrs) {
var e = document.createElement(tag);
if (typeof content === "string") {
firepad.utils.setTextContent(e, content);
} else if (content) {
for (var i = 0; i < content.length; ++i) { e.appendChild(content[i]); }
}
for(var attr in (attrs || { })) {
e.setAttribute(attr, attrs[attr]);
}
return e;
};
firepad.utils.setTextContent = function(e, str) {
e.innerHTML = "";
e.appendChild(document.createTextNode(str));
};
firepad.utils.on = function(emitter, type, f, capture) {
if (emitter.addEventListener) {
emitter.addEventListener(type, f, capture || false);
} else if (emitter.attachEvent) {
emitter.attachEvent("on" + type, f);
}
};
firepad.utils.off = function(emitter, type, f, capture) {
if (emitter.removeEventListener) {
emitter.removeEventListener(type, f, capture || false);
} else if (emitter.detachEvent) {
emitter.detachEvent("on" + type, f);
}
};
firepad.utils.preventDefault = function(e) {
if (e.preventDefault) {
e.preventDefault();
} else {
e.returnValue = false;
}
};
firepad.utils.stopPropagation = function(e) {
if (e.stopPropagation) {
e.stopPropagation();
} else {
e.cancelBubble = true;
}
};
firepad.utils.stopEvent = function(e) {
firepad.utils.preventDefault(e);
firepad.utils.stopPropagation(e);
};
firepad.utils.stopEventAnd = function(fn) {
return function(e) {
fn(e);
firepad.utils.stopEvent(e);
return false;
};
};
firepad.utils.trim = function(str) {
return str.replace(/^\s+/g, '').replace(/\s+$/g, '');
};
firepad.utils.assert = function assert (b, msg) {
if (!b) {
throw new Error(msg || "assertion error");
}
};
firepad.utils.log = function() {
if (typeof console !== 'undefined' && typeof console.log !== 'undefined') {
var args = ['Firepad:'];
for(var i = 0; i < arguments.length; i++) {
args.push(arguments[i]);
}
console.log.apply(console, args);
}
};
var firepad = firepad || { };
firepad.Span = (function () {
function Span(pos, length) {
this.pos = pos;
this.length = length;
}
Span.prototype.end = function() {
return this.pos + this.length;
};
return Span;
}());
var firepad = firepad || { };
firepad.TextOp = (function() {
var utils = firepad.utils;
// Operation are essentially lists of ops. There are three types of ops:
//
// * Retain ops: Advance the cursor position by a given number of characters.
// Represented by positive ints.
// * Insert ops: Insert a given string at the current cursor position.
// Represented by strings.
// * Delete ops: Delete the next n characters. Represented by negative ints.
function TextOp(type) {
this.type = type;
this.chars = null;
this.text = null;
this.attributes = null;
if (type === 'insert') {
this.text = arguments[1];
utils.assert(typeof this.text === 'string');
this.attributes = arguments[2] || { };
utils.assert (typeof this.attributes === 'object');
} else if (type === 'delete') {
this.chars = arguments[1];
utils.assert(typeof this.chars === 'number');
} else if (type === 'retain') {
this.chars = arguments[1];
utils.assert(typeof this.chars === 'number');
this.attributes = arguments[2] || { };
utils.assert (typeof this.attributes === 'object');
}
}
TextOp.prototype.isInsert = function() { return this.type === 'insert'; };
TextOp.prototype.isDelete = function() { return this.type === 'delete'; };
TextOp.prototype.isRetain = function() { return this.type === 'retain'; };
TextOp.prototype.equals = function(other) {
return (this.type === other.type &&
this.text === other.text &&
this.chars === other.chars &&
this.attributesEqual(other.attributes));
};
TextOp.prototype.attributesEqual = function(otherAttributes) {
for (var attr in this.attributes) {
if (this.attributes[attr] !== otherAttributes[attr]) { return false; }
}
for (attr in otherAttributes) {
if (this.attributes[attr] !== otherAttributes[attr]) { return false; }
}
return true;
};
TextOp.prototype.hasEmptyAttributes = function() {
var empty = true;
for (var attr in this.attributes) {
empty = false;
break;
}
return empty;
};
return TextOp;
})();
var firepad = firepad || { };
firepad.TextOperation = (function () {
'use strict';
var TextOp = firepad.TextOp;
var utils = firepad.utils;
// Constructor for new operations.
function TextOperation () {
if (!this || this.constructor !== TextOperation) {
// => function was called without 'new'
return new TextOperation();
}
// When an operation is applied to an input string, you can think of this as
// if an imaginary cursor runs over the entire string and skips over some
// parts, deletes some parts and inserts characters at some positions. These
// actions (skip/delete/insert) are stored as an array in the "ops" property.
this.ops = [];
// An operation's baseLength is the length of every string the operation
// can be applied to.
this.baseLength = 0;
// The targetLength is the length of every string that results from applying
// the operation on a valid input string.
this.targetLength = 0;
}
TextOperation.prototype.equals = function (other) {
if (this.baseLength !== other.baseLength) { return false; }
if (this.targetLength !== other.targetLength) { return false; }
if (this.ops.length !== other.ops.length) { return false; }
for (var i = 0; i < this.ops.length; i++) {
if (!this.ops[i].equals(other.ops[i])) { return false; }
}
return true;
};
// After an operation is constructed, the user of the library can specify the
// actions of an operation (skip/insert/delete) with these three builder
// methods. They all return the operation for convenient chaining.
// Skip over a given number of characters.
TextOperation.prototype.retain = function (n, attributes) {
if (typeof n !== 'number' || n < 0) {
throw new Error("retain expects a positive integer.");
}
if (n === 0) { return this; }
this.baseLength += n;
this.targetLength += n;
attributes = attributes || { };
var prevOp = (this.ops.length > 0) ? this.ops[this.ops.length - 1] : null;
if (prevOp && prevOp.isRetain() && prevOp.attributesEqual(attributes)) {
// The last op is a retain op with the same attributes => we can merge them into one op.
prevOp.chars += n;
} else {
// Create a new op.
this.ops.push(new TextOp('retain', n, attributes));
}
return this;
};
// Insert a string at the current position.
TextOperation.prototype.insert = function (str, attributes) {
if (typeof str !== 'string') {
throw new Error("insert expects a string");
}
if (str === '') { return this; }
attributes = attributes || { };
this.targetLength += str.length;
var prevOp = (this.ops.length > 0) ? this.ops[this.ops.length - 1] : null;
var prevPrevOp = (this.ops.length > 1) ? this.ops[this.ops.length - 2] : null;
if (prevOp && prevOp.isInsert() && prevOp.attributesEqual(attributes)) {
// Merge insert op.
prevOp.text += str;
} else if (prevOp && prevOp.isDelete()) {
// It doesn't matter when an operation is applied whether the operation
// is delete(3), insert("something") or insert("something"), delete(3).
// Here we enforce that in this case, the insert op always comes first.
// This makes all operations that have the same effect when applied to
// a document of the right length equal in respect to the `equals` method.
if (prevPrevOp && prevPrevOp.isInsert() && prevPrevOp.attributesEqual(attributes)) {
prevPrevOp.text += str;
} else {
this.ops[this.ops.length - 1] = new TextOp('insert', str, attributes);
this.ops.push(prevOp);
}
} else {
this.ops.push(new TextOp('insert', str, attributes));
}
return this;
};
// Delete a string at the current position.
TextOperation.prototype['delete'] = function (n) {
if (typeof n === 'string') { n = n.length; }
if (typeof n !== 'number' || n < 0) {
throw new Error("delete expects a positive integer or a string");
}
if (n === 0) { return this; }
this.baseLength += n;
var prevOp = (this.ops.length > 0) ? this.ops[this.ops.length - 1] : null;
if (prevOp && prevOp.isDelete()) {
prevOp.chars += n;
} else {
this.ops.push(new TextOp('delete', n));
}
return this;
};
// Tests whether this operation has no effect.
TextOperation.prototype.isNoop = function () {
return this.ops.length === 0 ||
(this.ops.length === 1 && (this.ops[0].isRetain() && this.ops[0].hasEmptyAttributes()));
};
TextOperation.prototype.clone = function() {
var clone = new TextOperation();
for(var i = 0; i < this.ops.length; i++) {
if (this.ops[i].isRetain()) {
clone.retain(this.ops[i].chars, this.ops[i].attributes);
} else if (this.ops[i].isInsert()) {
clone.insert(this.ops[i].text, this.ops[i].attributes);
} else {
clone['delete'](this.ops[i].chars);
}
}
return clone;
};
// Pretty printing.
TextOperation.prototype.toString = function () {
// map: build a new array by applying a function to every element in an old
// array.
var map = Array.prototype.map || function (fn) {
var arr = this;
var newArr = [];
for (var i = 0, l = arr.length; i < l; i++) {
newArr[i] = fn(arr[i]);
}
return newArr;
};
return map.call(this.ops, function (op) {
if (op.isRetain()) {
return "retain " + op.chars;
} else if (op.isInsert()) {
return "insert '" + op.text + "'";
} else {
return "delete " + (op.chars);
}
}).join(', ');
};
// Converts operation into a JSON value.
TextOperation.prototype.toJSON = function () {
var ops = [];
for(var i = 0; i < this.ops.length; i++) {
// We prefix ops with their attributes if non-empty.
if (!this.ops[i].hasEmptyAttributes()) {
ops.push(this.ops[i].attributes);
}
if (this.ops[i].type === 'retain') {
ops.push(this.ops[i].chars);
} else if (this.ops[i].type === 'insert') {
ops.push(this.ops[i].text);
} else if (this.ops[i].type === 'delete') {
ops.push(-this.ops[i].chars);
}
}
// Return an array with /something/ in it, since an empty array will be treated as null by Firebase.
if (ops.length === 0) {
ops.push(0);
}
return ops;
};
// Converts a plain JS object into an operation and validates it.
TextOperation.fromJSON = function (ops) {
var o = new TextOperation();
for (var i = 0, l = ops.length; i < l; i++) {
var op = ops[i];
var attributes = { };
if (typeof op === 'object') {
attributes = op;
i++;
op = ops[i];
}
if (typeof op === 'number') {
if (op > 0) {
o.retain(op, attributes);
} else {
o['delete'](-op);
}
} else {
utils.assert(typeof op === 'string');
o.insert(op, attributes);
}
}
return o;
};
// Apply an operation to a string, returning a new string. Throws an error if
// there's a mismatch between the input string and the operation.
TextOperation.prototype.apply = function (str, oldAttributes, newAttributes) {
var operation = this;
oldAttributes = oldAttributes || [];
newAttributes = newAttributes || [];
if (str.length !== operation.baseLength) {
throw new Error("The operation's base length must be equal to the string's length.");
}
var newStringParts = [], j = 0, k, attr;
var oldIndex = 0;
var ops = this.ops;
for (var i = 0, l = ops.length; i < l; i++) {
var op = ops[i];
if (op.isRetain()) {
if (oldIndex + op.chars > str.length) {
throw new Error("Operation can't retain more characters than are left in the string.");
}
// Copy skipped part of the retained string.
newStringParts[j++] = str.slice(oldIndex, oldIndex + op.chars);
// Copy (and potentially update) attributes for each char in retained string.
for(k = 0; k < op.chars; k++) {
var currAttributes = oldAttributes[oldIndex + k] || { }, updatedAttributes = { };
for(attr in currAttributes) {
updatedAttributes[attr] = currAttributes[attr];
utils.assert(updatedAttributes[attr] !== false);
}
for(attr in op.attributes) {
if (op.attributes[attr] === false) {
delete updatedAttributes[attr];
} else {
updatedAttributes[attr] = op.attributes[attr];
}
utils.assert(updatedAttributes[attr] !== false);
}
newAttributes.push(updatedAttributes);
}
oldIndex += op.chars;
} else if (op.isInsert()) {
// Insert string.
newStringParts[j++] = op.text;
// Insert attributes for each char.
for(k = 0; k < op.text.length; k++) {
var insertedAttributes = { };
for(attr in op.attributes) {
insertedAttributes[attr] = op.attributes[attr];
utils.assert(insertedAttributes[attr] !== false);
}
newAttributes.push(insertedAttributes);
}
} else { // delete op
oldIndex += op.chars;
}
}
if (oldIndex !== str.length) {
throw new Error("The operation didn't operate on the whole string.");
}
var newString = newStringParts.join('');
utils.assert(newString.length === newAttributes.length);
return newString;
};
// Computes the inverse of an operation. The inverse of an operation is the
// operation that reverts the effects of the operation, e.g. when you have an
// operation 'insert("hello "); skip(6);' then the inverse is 'delete("hello ");
// skip(6);'. The inverse should be used for implementing undo.
TextOperation.prototype.invert = function (str) {
var strIndex = 0;
var inverse = new TextOperation();
var ops = this.ops;
for (var i = 0, l = ops.length; i < l; i++) {
var op = ops[i];
if (op.isRetain()) {
inverse.retain(op.chars);
strIndex += op.chars;
} else if (op.isInsert()) {
inverse['delete'](op.text.length);
} else { // delete op
inverse.insert(str.slice(strIndex, strIndex + op.chars));
strIndex += op.chars;
}
}
return inverse;
};
// Compose merges two consecutive operations into one operation, that
// preserves the changes of both. Or, in other words, for each input string S
// and a pair of consecutive operations A and B,
// apply(apply(S, A), B) = apply(S, compose(A, B)) must hold.
TextOperation.prototype.compose = function (operation2) {
var operation1 = this;
if (operation1.targetLength !== operation2.baseLength) {
throw new Error("The base length of the second operation has to be the target length of the first operation");
}
function composeAttributes(first, second, firstOpIsInsert) {
var merged = { }, attr;
for(attr in first) {
merged[attr] = first[attr];
}
for(attr in second) {
if (firstOpIsInsert && second[attr] === false) {
delete merged[attr];
} else {
merged[attr] = second[attr];
}
}
return merged;
}
var operation = new TextOperation(); // the combined operation
var ops1 = operation1.clone().ops, ops2 = operation2.clone().ops;
var i1 = 0, i2 = 0; // current index into ops1 respectively ops2
var op1 = ops1[i1++], op2 = ops2[i2++]; // current ops
var attributes;
while (true) {
// Dispatch on the type of op1 and op2
if (typeof op1 === 'undefined' && typeof op2 === 'undefined') {
// end condition: both ops1 and ops2 have been processed
break;
}
if (op1 && op1.isDelete()) {
operation['delete'](op1.chars);
op1 = ops1[i1++];
continue;
}
if (op2 && op2.isInsert()) {
operation.insert(op2.text, op2.attributes);
op2 = ops2[i2++];
continue;
}
if (typeof op1 === 'undefined') {
throw new Error("Cannot compose operations: first operation is too short.");
}
if (typeof op2 === 'undefined') {
throw new Error("Cannot compose operations: first operation is too long.");
}
if (op1.isRetain() && op2.isRetain()) {
attributes = composeAttributes(op1.attributes, op2.attributes);
if (op1.chars > op2.chars) {
operation.retain(op2.chars, attributes);
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
operation.retain(op1.chars, attributes);
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
operation.retain(op1.chars, attributes);
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
} else if (op1.isInsert() && op2.isDelete()) {
if (op1.text.length > op2.chars) {
op1.text = op1.text.slice(op2.chars);
op2 = ops2[i2++];
} else if (op1.text.length === op2.chars) {
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
op2.chars -= op1.text.length;
op1 = ops1[i1++];
}
} else if (op1.isInsert() && op2.isRetain()) {
attributes = composeAttributes(op1.attributes, op2.attributes, /*firstOpIsInsert=*/true);
if (op1.text.length > op2.chars) {
operation.insert(op1.text.slice(0, op2.chars), attributes);
op1.text = op1.text.slice(op2.chars);
op2 = ops2[i2++];
} else if (op1.text.length === op2.chars) {
operation.insert(op1.text, attributes);
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
operation.insert(op1.text, attributes);
op2.chars -= op1.text.length;
op1 = ops1[i1++];
}
} else if (op1.isRetain() && op2.isDelete()) {
if (op1.chars > op2.chars) {
operation['delete'](op2.chars);
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
operation['delete'](op2.chars);
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
operation['delete'](op1.chars);
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
} else {
throw new Error(
"This shouldn't happen: op1: " +
JSON.stringify(op1) + ", op2: " +
JSON.stringify(op2)
);
}
}
return operation;
};
function getSimpleOp (operation) {
var ops = operation.ops;
switch (ops.length) {
case 1:
return ops[0];
case 2:
return ops[0].isRetain() ? ops[1] : (ops[1].isRetain() ? ops[0] : null);
case 3:
if (ops[0].isRetain() && ops[2].isRetain()) { return ops[1]; }
}
return null;
}
function getStartIndex (operation) {
if (operation.ops[0].isRetain()) { return operation.ops[0].chars; }
return 0;
}
// When you use ctrl-z to undo your latest changes, you expect the program not
// to undo every single keystroke but to undo your last sentence you wrote at
// a stretch or the deletion you did by holding the backspace key down. This
// This can be implemented by composing operations on the undo stack. This
// method can help decide whether two operations should be composed. It
// returns true if the operations are consecutive insert operations or both
// operations delete text at the same position. You may want to include other
// factors like the time since the last change in your decision.
TextOperation.prototype.shouldBeComposedWith = function (other) {
if (this.isNoop() || other.isNoop()) { return true; }
var startA = getStartIndex(this), startB = getStartIndex(other);
var simpleA = getSimpleOp(this), simpleB = getSimpleOp(other);
if (!simpleA || !simpleB) { return false; }
if (simpleA.isInsert() && simpleB.isInsert()) {
return startA + simpleA.text.length === startB;
}
if (simpleA.isDelete() && simpleB.isDelete()) {
// there are two possibilities to delete: with backspace and with the
// delete key.
return (startB + simpleB.chars === startA) || startA === startB;
}
return false;
};
// Decides whether two operations should be composed with each other
// if they were inverted, that is
// `shouldBeComposedWith(a, b) = shouldBeComposedWithInverted(b^{-1}, a^{-1})`.
TextOperation.prototype.shouldBeComposedWithInverted = function (other) {
if (this.isNoop() || other.isNoop()) { return true; }
var startA = getStartIndex(this), startB = getStartIndex(other);
var simpleA = getSimpleOp(this), simpleB = getSimpleOp(other);
if (!simpleA || !simpleB) { return false; }
if (simpleA.isInsert() && simpleB.isInsert()) {
return startA + simpleA.text.length === startB || startA === startB;
}
if (simpleA.isDelete() && simpleB.isDelete()) {
return startB + simpleB.chars === startA;
}
return false;
};
TextOperation.transformAttributes = function(attributes1, attributes2) {
var attributes1prime = { }, attributes2prime = { };
var attr, allAttrs = { };
for(attr in attributes1) { allAttrs[attr] = true; }
for(attr in attributes2) { allAttrs[attr] = true; }
for (attr in allAttrs) {
var attr1 = attributes1[attr], attr2 = attributes2[attr];
utils.assert(attr1 != null || attr2 != null);
if (attr1 == null) {
// Only modified by attributes2; keep it.
attributes2prime[attr] = attr2;
} else if (attr2 == null) {
// only modified by attributes1; keep it
attributes1prime[attr] = attr1;
} else if (attr1 === attr2) {
// Both set it to the same value. Nothing to do.
} else {
// attr1 and attr2 are different. Prefer attr1.
attributes1prime[attr] = attr1;
}
}
return [attributes1prime, attributes2prime];
};
// Transform takes two operations A and B that happened concurrently and
// produces two operations A' and B' (in an array) such that
// `apply(apply(S, A), B') = apply(apply(S, B), A')`. This function is the
// heart of OT.
TextOperation.transform = function (operation1, operation2) {
if (operation1.baseLength !== operation2.baseLength) {
throw new Error("Both operations have to have the same base length");
}
var operation1prime = new TextOperation();
var operation2prime = new TextOperation();
var ops1 = operation1.clone().ops, ops2 = operation2.clone().ops;
var i1 = 0, i2 = 0;
var op1 = ops1[i1++], op2 = ops2[i2++];
while (true) {
// At every iteration of the loop, the imaginary cursor that both
// operation1 and operation2 have that operates on the input string must
// have the same position in the input string.
if (typeof op1 === 'undefined' && typeof op2 === 'undefined') {
// end condition: both ops1 and ops2 have been processed
break;
}
// next two cases: one or both ops are insert ops
// => insert the string in the corresponding prime operation, skip it in
// the other one. If both op1 and op2 are insert ops, prefer op1.
if (op1 && op1.isInsert()) {
operation1prime.insert(op1.text, op1.attributes);
operation2prime.retain(op1.text.length);
op1 = ops1[i1++];
continue;
}
if (op2 && op2.isInsert()) {
operation1prime.retain(op2.text.length);
operation2prime.insert(op2.text, op2.attributes);
op2 = ops2[i2++];
continue;
}
if (typeof op1 === 'undefined') {
throw new Error("Cannot transform operations: first operation is too short.");
}
if (typeof op2 === 'undefined') {
throw new Error("Cannot transform operations: first operation is too long.");
}
var minl;
if (op1.isRetain() && op2.isRetain()) {
// Simple case: retain/retain
var attributesPrime = TextOperation.transformAttributes(op1.attributes, op2.attributes);
if (op1.chars > op2.chars) {
minl = op2.chars;
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
minl = op2.chars;
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
minl = op1.chars;
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
operation1prime.retain(minl, attributesPrime[0]);
operation2prime.retain(minl, attributesPrime[1]);
} else if (op1.isDelete() && op2.isDelete()) {
// Both operations delete the same string at the same position. We don't
// need to produce any operations, we just skip over the delete ops and
// handle the case that one operation deletes more than the other.
if (op1.chars > op2.chars) {
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
// next two cases: delete/retain and retain/delete
} else if (op1.isDelete() && op2.isRetain()) {
if (op1.chars > op2.chars) {
minl = op2.chars;
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
minl = op2.chars;
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
minl = op1.chars;
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
operation1prime['delete'](minl);
} else if (op1.isRetain() && op2.isDelete()) {
if (op1.chars > op2.chars) {
minl = op2.chars;
op1.chars -= op2.chars;
op2 = ops2[i2++];
} else if (op1.chars === op2.chars) {
minl = op1.chars;
op1 = ops1[i1++];
op2 = ops2[i2++];
} else {
minl = op1.chars;
op2.chars -= op1.chars;
op1 = ops1[i1++];
}
operation2prime['delete'](minl);
} else {
throw new Error("The two operations aren't compatible");
}
}
return [operation1prime, operation2prime];
};
return TextOperation;
}());
var firepad = firepad || { };
// TODO: Rewrite this (probably using a splay tree) to be efficient. Right now it's based on a linked list
// so all operations are O(n), where n is the number of spans in the list.
firepad.AnnotationList = (function () {
var Span = firepad.Span;
function assert(bool, text) {
if (!bool) {
throw new Error('AnnotationList assertion failed' + (text ? (': ' + text) : ''));
}
}
function OldAnnotatedSpan(pos, node) {
this.pos = pos;
this.length = node.length;
this.annotation = node.annotation;
this.attachedObject_ = node.attachedObject;
}
OldAnnotatedSpan.prototype.getAttachedObject = function() {
return this.attachedObject_;
};
function NewAnnotatedSpan(pos, node) {
this.pos = pos;
this.length = node.length;
this.annotation = node.annotation;
this.node_ = node;
}
NewAnnotatedSpan.prototype.attachObject = function(object) {
this.node_.attachedObject = object;
};
var NullAnnotation = { equals: function() { return false; } };
function AnnotationList(changeHandler) {
// There's always a head node; to avoid special cases.
this.head_ = new Node(0, NullAnnotation);
this.changeHandler_ = changeHandler;
}
AnnotationList.prototype.insertAnnotatedSpan = function(span, annotation) {
this.wrapOperation_(new Span(span.pos, 0), function(oldPos, old) {
assert(!old || old.next === null); // should be 0 or 1 nodes.
var toInsert = new Node(span.length, annotation);
if (!old) {
return toInsert;
} else {
assert (span.pos > oldPos && span.pos < oldPos + old.length);
var newNodes = new Node(0, NullAnnotation);
// Insert part of old before insertion point.
newNodes.next = new Node(span.pos - oldPos, old.annotation);
// Insert new node.
newNodes.next.next = toInsert;
// Insert part of old after insertion point.
toInsert.next = new Node(oldPos + old.length - span.pos, old.annotation);
return newNodes.next;
}
});
};
AnnotationList.prototype.removeSpan = function(removeSpan) {
if (removeSpan.length === 0) { return; }
this.wrapOperation_(removeSpan, function(oldPos, old) {
assert (old !== null);
var newNodes = new Node(0, NullAnnotation), current = newNodes;
// Add new node for part before the removed span (if any).
if (removeSpan.pos > oldPos) {
current.next = new Node(removeSpan.pos - oldPos, old.annotation);
current = current.next;
}
// Skip over removed nodes.
while (removeSpan.end() > oldPos + old.length) {
oldPos += old.length;
old = old.next;
}
// Add new node for part after the removed span (if any).
var afterChars = oldPos + old.length - removeSpan.end();
if (afterChars > 0) {
current.next = new Node(afterChars, old.annotation);
}
return newNodes.next;
});
};
AnnotationList.prototype.updateSpan = function (span, updateFn) {
if (span.length === 0) { return; }
this.wrapOperation_(span, function(oldPos, old) {
assert (old !== null);
var newNodes = new Node(0, NullAnnotation), current = newNodes, currentPos = oldPos;
// Add node for any characters before the span we're updating.
var beforeChars = span.pos - currentPos;
assert(beforeChars < old.length);
if (beforeChars > 0) {
current.next = new Node(beforeChars, old.annotation);
current = current.next;
currentPos += current.length;
}
// Add updated nodes for entirely updated nodes.
while (old !== null && span.end() >= oldPos + old.length) {
var length = oldPos + old.length - currentPos;
current.next = new Node(length, updateFn(old.annotation, length));
current = current.next;
oldPos += old.length;
old = old.next;
currentPos = oldPos;
}
// Add updated nodes for last node.
var updateChars = span.end() - currentPos;
if (updateChars > 0) {
assert(updateChars < old.length);
current.next = new Node(updateChars, updateFn(old.annotation, updateChars));
current = current.next;
currentPos += current.length;
// Add non-updated remaining part of node.
current.next = new Node(oldPos + old.length - currentPos, old.annotation);
}
return newNodes.next;
});
};
AnnotationList.prototype.wrapOperation_ = function(span, operationFn) {
if (span.pos < 0) {
throw new Error('Span start cannot be negative.');
}
var oldNodes = [], newNodes = [];
var res = this.getAffectedNodes_(span);
var tail;
if (res.start !== null) {
tail = res.end.next;
// Temporarily truncate list so we can pass it to operationFn. We'll splice it back in later.
res.end.next = null;
} else {
// start and end are null, because span is empty and lies on the border of two nodes.