-
Notifications
You must be signed in to change notification settings - Fork 0
/
mathquill.js
4925 lines (4357 loc) · 166 KB
/
mathquill.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
/**
* MathQuill v0.10.1 http://mathquill.com
* by Han, Jeanine, and Mary [email protected]
*
* This Source Code Form is subject to the terms of the
* Mozilla Public License, v. 2.0. If a copy of the MPL
* was not distributed with this file, You can obtain
* one at http://mozilla.org/MPL/2.0/.
*/
(function() {
var jQuery = window.jQuery,
undefined,
mqCmdId = 'mathquill-command-id',
mqBlockId = 'mathquill-block-id',
min = Math.min,
max = Math.max;
function noop() {}
/**
* A utility higher-order function that makes defining variadic
* functions more convenient by letting you essentially define functions
* with the last argument as a splat, i.e. the last argument "gathers up"
* remaining arguments to the function:
* var doStuff = variadic(function(first, rest) { return rest; });
* doStuff(1, 2, 3); // => [2, 3]
*/
var __slice = [].slice;
function variadic(fn) {
var numFixedArgs = fn.length - 1;
return function() {
var args = __slice.call(arguments, 0, numFixedArgs);
var varArg = __slice.call(arguments, numFixedArgs);
return fn.apply(this, args.concat([ varArg ]));
};
}
/**
* A utility higher-order function that makes combining object-oriented
* programming and functional programming techniques more convenient:
* given a method name and any number of arguments to be bound, returns
* a function that calls it's first argument's method of that name (if
* it exists) with the bound arguments and any additional arguments that
* are passed:
* var sendMethod = send('method', 1, 2);
* var obj = { method: function() { return Array.apply(this, arguments); } };
* sendMethod(obj, 3, 4); // => [1, 2, 3, 4]
* // or more specifically,
* var obj2 = { method: function(one, two, three) { return one*two + three; } };
* sendMethod(obj2, 3); // => 5
* sendMethod(obj2, 4); // => 6
*/
var send = variadic(function(method, args) {
return variadic(function(obj, moreArgs) {
if (method in obj) return obj[method].apply(obj, args.concat(moreArgs));
});
});
/**
* A utility higher-order function that creates "implicit iterators"
* from "generators": given a function that takes in a sole argument,
* a "yield_" function, that calls "yield_" repeatedly with an object as
* a sole argument (presumably objects being iterated over), returns
* a function that calls it's first argument on each of those objects
* (if the first argument is a function, it is called repeatedly with
* each object as the first argument, otherwise it is stringified and
* the method of that name is called on each object (if such a method
* exists)), passing along all additional arguments:
* var a = [
* { method: function(list) { list.push(1); } },
* { method: function(list) { list.push(2); } },
* { method: function(list) { list.push(3); } }
* ];
* a.each = iterator(function(yield_) {
* for (var i in this) yield_(this[i]);
* });
* var list = [];
* a.each('method', list);
* list; // => [1, 2, 3]
* // Note that the for-in loop will yield 'each', but 'each' maps to
* // the function object created by iterator() which does not have a
* // .method() method, so that just fails silently.
*/
function iterator(generator) {
return variadic(function(fn, args) {
if (typeof fn !== 'function') fn = send(fn);
var yield_ = function(obj) { return fn.apply(obj, [ obj ].concat(args)); };
return generator.call(this, yield_);
});
}
/**
* sugar to make defining lots of commands easier.
* TODO: rethink this.
*/
function bind(cons /*, args... */) {
var args = __slice.call(arguments, 1);
return function() {
return cons.apply(this, args);
};
}
/**
* a development-only debug method. This definition and all
* calls to `pray` will be stripped from the minified
* build of mathquill.
*
* This function must be called by name to be removed
* at compile time. Do not define another function
* with the same name, and only call this function by
* name.
*/
function pray(message, cond) {
if (!cond) throw new Error('prayer failed: '+message);
}
var P = (function(prototype, ownProperty, undefined) {
// helper functions that also help minification
function isObject(o) { return typeof o === 'object'; }
function isFunction(f) { return typeof f === 'function'; }
// used to extend the prototypes of superclasses (which might not
// have `.Bare`s)
function SuperclassBare() {}
return function P(_superclass /* = Object */, definition) {
// handle the case where no superclass is given
if (definition === undefined) {
definition = _superclass;
_superclass = Object;
}
// C is the class to be returned.
//
// It delegates to instantiating an instance of `Bare`, so that it
// will always return a new instance regardless of the calling
// context.
//
// TODO: the Chrome inspector shows all created objects as `C`
// rather than `Object`. Setting the .name property seems to
// have no effect. Is there a way to override this behavior?
function C() {
var self = new Bare;
if (isFunction(self.init)) self.init.apply(self, arguments);
return self;
}
// C.Bare is a class with a noop constructor. Its prototype is the
// same as C, so that instances of C.Bare are also instances of C.
// New objects can be allocated without initialization by calling
// `new MyClass.Bare`.
function Bare() {}
C.Bare = Bare;
// Set up the prototype of the new class.
var _super = SuperclassBare[prototype] = _superclass[prototype];
var proto = Bare[prototype] = C[prototype] = C.p = new SuperclassBare;
// other variables, as a minifier optimization
var extensions;
// set the constructor property on the prototype, for convenience
proto.constructor = C;
C.mixin = function(def) {
Bare[prototype] = C[prototype] = P(C, def)[prototype];
return C;
}
return (C.open = function(def) {
extensions = {};
if (isFunction(def)) {
// call the defining function with all the arguments you need
// extensions captures the return value.
extensions = def.call(C, proto, _super, C, _superclass);
}
else if (isObject(def)) {
// if you passed an object instead, we'll take it
extensions = def;
}
// ...and extend it
if (isObject(extensions)) {
for (var ext in extensions) {
if (ownProperty.call(extensions, ext)) {
proto[ext] = extensions[ext];
}
}
}
// if there's no init, we assume we're inheriting a non-pjs class, so
// we default to applying the superclass's constructor.
if (!isFunction(proto.init)) {
proto.init = _superclass;
}
return C;
})(definition);
}
// as a minifier optimization, we've closured in a few helper functions
// and the string 'prototype' (C[p] is much shorter than C.prototype)
})('prototype', ({}).hasOwnProperty);
/*************************************************
* Base classes of edit tree-related objects
*
* Only doing tree node manipulation via these
* adopt/ disown methods guarantees well-formedness
* of the tree.
************************************************/
// L = 'left'
// R = 'right'
//
// the contract is that they can be used as object properties
// and (-L) === R, and (-R) === L.
var L = -1;
var R = 1;
function prayDirection(dir) {
pray('a direction was passed', dir === L || dir === R);
}
/**
* Tiny extension of jQuery adding directionalized DOM manipulation methods.
*
* Funny how Pjs v3 almost just works with `jQuery.fn.init`.
*
* jQuery features that don't work on $:
* - jQuery.*, like jQuery.ajax, obviously (Pjs doesn't and shouldn't
* copy constructor properties)
*
* - jQuery(function), the shortcut for `jQuery(document).ready(function)`,
* because `jQuery.fn.init` is idiosyncratic and Pjs doing, essentially,
* `jQuery.fn.init.apply(this, arguments)` isn't quite right, you need:
*
* _.init = function(s, c) { jQuery.fn.init.call(this, s, c, $(document)); };
*
* if you actually give a shit (really, don't bother),
* see https://github.com/jquery/jquery/blob/1.7.2/src/core.js#L889
*
* - jQuery(selector), because jQuery translates that to
* `jQuery(document).find(selector)`, but Pjs doesn't (should it?) let
* you override the result of a constructor call
* + note that because of the jQuery(document) shortcut-ness, there's also
* the 3rd-argument-needs-to-be-`$(document)` thing above, but the fix
* for that (as can be seen above) is really easy. This problem requires
* a way more intrusive fix
*
* And that's it! Everything else just magically works because jQuery internally
* uses `this.constructor()` everywhere (hence calling `$`), but never ever does
* `this.constructor.find` or anything like that, always doing `jQuery.find`.
*/
var $ = P(jQuery, function(_) {
_.insDirOf = function(dir, el) {
return dir === L ?
this.insertBefore(el.first()) : this.insertAfter(el.last());
};
_.insAtDirEnd = function(dir, el) {
return dir === L ? this.prependTo(el) : this.appendTo(el);
};
});
var Point = P(function(_) {
_.parent = 0;
_[L] = 0;
_[R] = 0;
_.init = function(parent, leftward, rightward) {
this.parent = parent;
this[L] = leftward;
this[R] = rightward;
};
this.copy = function(pt) {
return Point(pt.parent, pt[L], pt[R]);
};
});
/**
* MathQuill virtual-DOM tree-node abstract base class
*/
var Node = P(function(_) {
_[L] = 0;
_[R] = 0
_.parent = 0;
var id = 0;
function uniqueNodeId() { return id += 1; }
this.byId = {};
_.init = function() {
this.id = uniqueNodeId();
Node.byId[this.id] = this;
this.ends = {};
this.ends[L] = 0;
this.ends[R] = 0;
};
_.dispose = function() { delete Node.byId[this.id]; };
_.toString = function() { return '{{ MathQuill Node #'+this.id+' }}'; };
_.jQ = $();
_.jQadd = function(jQ) { return this.jQ = this.jQ.add(jQ); };
_.jQize = function(jQ) {
// jQuery-ifies this.html() and links up the .jQ of all corresponding Nodes
var jQ = $(jQ || this.html());
function jQadd(el) {
if (el.getAttribute) {
var cmdId = el.getAttribute('mathquill-command-id');
var blockId = el.getAttribute('mathquill-block-id');
if (cmdId) Node.byId[cmdId].jQadd(el);
if (blockId) Node.byId[blockId].jQadd(el);
}
for (el = el.firstChild; el; el = el.nextSibling) {
jQadd(el);
}
}
for (var i = 0; i < jQ.length; i += 1) jQadd(jQ[i]);
return jQ;
};
_.createDir = function(dir, cursor) {
prayDirection(dir);
var node = this;
node.jQize();
node.jQ.insDirOf(dir, cursor.jQ);
cursor[dir] = node.adopt(cursor.parent, cursor[L], cursor[R]);
return node;
};
_.createLeftOf = function(el) { return this.createDir(L, el); };
_.selectChildren = function(leftEnd, rightEnd) {
return Selection(leftEnd, rightEnd);
};
_.bubble = iterator(function(yield_) {
for (var ancestor = this; ancestor; ancestor = ancestor.parent) {
var result = yield_(ancestor);
if (result === false) break;
}
return this;
});
_.postOrder = iterator(function(yield_) {
(function recurse(descendant) {
descendant.eachChild(recurse);
yield_(descendant);
})(this);
return this;
});
_.isEmpty = function() {
return this.ends[L] === 0 && this.ends[R] === 0;
};
_.children = function() {
return Fragment(this.ends[L], this.ends[R]);
};
_.eachChild = function() {
var children = this.children();
children.each.apply(children, arguments);
return this;
};
_.foldChildren = function(fold, fn) {
return this.children().fold(fold, fn);
};
_.withDirAdopt = function(dir, parent, withDir, oppDir) {
Fragment(this, this).withDirAdopt(dir, parent, withDir, oppDir);
return this;
};
_.adopt = function(parent, leftward, rightward) {
Fragment(this, this).adopt(parent, leftward, rightward);
return this;
};
_.disown = function() {
Fragment(this, this).disown();
return this;
};
_.remove = function() {
this.jQ.remove();
this.postOrder('dispose');
return this.disown();
};
});
function prayWellFormed(parent, leftward, rightward) {
pray('a parent is always present', parent);
pray('leftward is properly set up', (function() {
// either it's empty and `rightward` is the left end child (possibly empty)
if (!leftward) return parent.ends[L] === rightward;
// or it's there and its [R] and .parent are properly set up
return leftward[R] === rightward && leftward.parent === parent;
})());
pray('rightward is properly set up', (function() {
// either it's empty and `leftward` is the right end child (possibly empty)
if (!rightward) return parent.ends[R] === leftward;
// or it's there and its [L] and .parent are properly set up
return rightward[L] === leftward && rightward.parent === parent;
})());
}
/**
* An entity outside the virtual tree with one-way pointers (so it's only a
* "view" of part of the tree, not an actual node/entity in the tree) that
* delimits a doubly-linked list of sibling nodes.
* It's like a fanfic love-child between HTML DOM DocumentFragment and the Range
* classes: like DocumentFragment, its contents must be sibling nodes
* (unlike Range, whose contents are arbitrary contiguous pieces of subtrees),
* but like Range, it has only one-way pointers to its contents, its contents
* have no reference to it and in fact may still be in the visible tree (unlike
* DocumentFragment, whose contents must be detached from the visible tree
* and have their 'parent' pointers set to the DocumentFragment).
*/
var Fragment = P(function(_) {
_.init = function(withDir, oppDir, dir) {
if (dir === undefined) dir = L;
prayDirection(dir);
pray('no half-empty fragments', !withDir === !oppDir);
this.ends = {};
if (!withDir) return;
pray('withDir is passed to Fragment', withDir instanceof Node);
pray('oppDir is passed to Fragment', oppDir instanceof Node);
pray('withDir and oppDir have the same parent',
withDir.parent === oppDir.parent);
this.ends[dir] = withDir;
this.ends[-dir] = oppDir;
// To build the jquery collection for a fragment, accumulate elements
// into an array and then call jQ.add once on the result. jQ.add sorts the
// collection according to document order each time it is called, so
// building a collection by folding jQ.add directly takes more than
// quadratic time in the number of elements.
//
// https://github.com/jquery/jquery/blob/2.1.4/src/traversing.js#L112
var accum = this.fold([], function (accum, el) {
accum.push.apply(accum, el.jQ.get());
return accum;
});
this.jQ = this.jQ.add(accum);
};
_.jQ = $();
// like Cursor::withDirInsertAt(dir, parent, withDir, oppDir)
_.withDirAdopt = function(dir, parent, withDir, oppDir) {
return (dir === L ? this.adopt(parent, withDir, oppDir)
: this.adopt(parent, oppDir, withDir));
};
_.adopt = function(parent, leftward, rightward) {
prayWellFormed(parent, leftward, rightward);
var self = this;
self.disowned = false;
var leftEnd = self.ends[L];
if (!leftEnd) return this;
var rightEnd = self.ends[R];
if (leftward) {
// NB: this is handled in the ::each() block
// leftward[R] = leftEnd
} else {
parent.ends[L] = leftEnd;
}
if (rightward) {
rightward[L] = rightEnd;
} else {
parent.ends[R] = rightEnd;
}
self.ends[R][R] = rightward;
self.each(function(el) {
el[L] = leftward;
el.parent = parent;
if (leftward) leftward[R] = el;
leftward = el;
});
return self;
};
_.disown = function() {
var self = this;
var leftEnd = self.ends[L];
// guard for empty and already-disowned fragments
if (!leftEnd || self.disowned) return self;
self.disowned = true;
var rightEnd = self.ends[R]
var parent = leftEnd.parent;
prayWellFormed(parent, leftEnd[L], leftEnd);
prayWellFormed(parent, rightEnd, rightEnd[R]);
if (leftEnd[L]) {
leftEnd[L][R] = rightEnd[R];
} else {
parent.ends[L] = rightEnd[R];
}
if (rightEnd[R]) {
rightEnd[R][L] = leftEnd[L];
} else {
parent.ends[R] = leftEnd[L];
}
return self;
};
_.remove = function() {
this.jQ.remove();
this.each('postOrder', 'dispose');
return this.disown();
};
_.each = iterator(function(yield_) {
var self = this;
var el = self.ends[L];
if (!el) return self;
for (; el !== self.ends[R][R]; el = el[R]) {
var result = yield_(el);
if (result === false) break;
}
return self;
});
_.fold = function(fold, fn) {
this.each(function(el) {
fold = fn.call(this, fold, el);
});
return fold;
};
});
/**
* Registry of LaTeX commands and commands created when typing
* a single character.
*
* (Commands are all subclasses of Node.)
*/
var LatexCmds = {}, CharCmds = {};
/********************************************
* Cursor and Selection "singleton" classes
*******************************************/
/* The main thing that manipulates the Math DOM. Makes sure to manipulate the
HTML DOM to match. */
/* Sort of singletons, since there should only be one per editable math
textbox, but any one HTML document can contain many such textboxes, so any one
JS environment could actually contain many instances. */
//A fake cursor in the fake textbox that the math is rendered in.
var Cursor = P(Point, function(_) {
_.init = function(initParent, options) {
this.parent = initParent;
this.options = options;
var jQ = this.jQ = this._jQ = $('<span class="mq-cursor">​</span>');
//closured for setInterval
this.blink = function(){ jQ.toggleClass('mq-blink'); };
this.upDownCache = {};
};
_.show = function() {
this.jQ = this._jQ.removeClass('mq-blink');
if ('intervalId' in this) //already was shown, just restart interval
clearInterval(this.intervalId);
else { //was hidden and detached, insert this.jQ back into HTML DOM
if (this[R]) {
if (this.selection && this.selection.ends[L][L] === this[L])
this.jQ.insertBefore(this.selection.jQ);
else
this.jQ.insertBefore(this[R].jQ.first());
}
else
this.jQ.appendTo(this.parent.jQ);
this.parent.focus();
}
this.intervalId = setInterval(this.blink, 500);
return this;
};
_.hide = function() {
if ('intervalId' in this)
clearInterval(this.intervalId);
delete this.intervalId;
this.jQ.detach();
this.jQ = $();
return this;
};
_.withDirInsertAt = function(dir, parent, withDir, oppDir) {
var oldParent = this.parent;
this.parent = parent;
this[dir] = withDir;
this[-dir] = oppDir;
// by contract, .blur() is called after all has been said and done
// and the cursor has actually been moved
if (oldParent !== parent && oldParent.blur) oldParent.blur();
};
_.insDirOf = function(dir, el) {
prayDirection(dir);
this.jQ.insDirOf(dir, el.jQ);
this.withDirInsertAt(dir, el.parent, el[dir], el);
this.parent.jQ.addClass('mq-hasCursor');
return this;
};
_.insLeftOf = function(el) { return this.insDirOf(L, el); };
_.insRightOf = function(el) { return this.insDirOf(R, el); };
_.insAtDirEnd = function(dir, el) {
prayDirection(dir);
this.jQ.insAtDirEnd(dir, el.jQ);
this.withDirInsertAt(dir, el, 0, el.ends[dir]);
el.focus();
return this;
};
_.insAtLeftEnd = function(el) { return this.insAtDirEnd(L, el); };
_.insAtRightEnd = function(el) { return this.insAtDirEnd(R, el); };
/**
* jump up or down from one block Node to another:
* - cache the current Point in the node we're jumping from
* - check if there's a Point in it cached for the node we're jumping to
* + if so put the cursor there,
* + if not seek a position in the node that is horizontally closest to
* the cursor's current position
*/
_.jumpUpDown = function(from, to) {
var self = this;
self.upDownCache[from.id] = Point.copy(self);
var cached = self.upDownCache[to.id];
if (cached) {
cached[R] ? self.insLeftOf(cached[R]) : self.insAtRightEnd(cached.parent);
}
else {
var pageX = self.offset().left;
to.seek(pageX, self);
}
};
_.offset = function() {
//in Opera 11.62, .getBoundingClientRect() and hence jQuery::offset()
//returns all 0's on inline elements with negative margin-right (like
//the cursor) at the end of their parent, so temporarily remove the
//negative margin-right when calling jQuery::offset()
//Opera bug DSK-360043
//http://bugs.jquery.com/ticket/11523
//https://github.com/jquery/jquery/pull/717
var self = this, offset = self.jQ.removeClass('mq-cursor').offset();
self.jQ.addClass('mq-cursor');
return offset;
}
_.unwrapGramp = function() {
var gramp = this.parent.parent;
var greatgramp = gramp.parent;
var rightward = gramp[R];
var cursor = this;
var leftward = gramp[L];
gramp.disown().eachChild(function(uncle) {
if (uncle.isEmpty()) return;
uncle.children()
.adopt(greatgramp, leftward, rightward)
.each(function(cousin) {
cousin.jQ.insertBefore(gramp.jQ.first());
})
;
leftward = uncle.ends[R];
});
if (!this[R]) { //then find something to be rightward to insLeftOf
if (this[L])
this[R] = this[L][R];
else {
while (!this[R]) {
this.parent = this.parent[R];
if (this.parent)
this[R] = this.parent.ends[L];
else {
this[R] = gramp[R];
this.parent = greatgramp;
break;
}
}
}
}
if (this[R])
this.insLeftOf(this[R]);
else
this.insAtRightEnd(greatgramp);
gramp.jQ.remove();
if (gramp[L].siblingDeleted) gramp[L].siblingDeleted(cursor.options, R);
if (gramp[R].siblingDeleted) gramp[R].siblingDeleted(cursor.options, L);
};
_.startSelection = function() {
var anticursor = this.anticursor = Point.copy(this);
var ancestors = anticursor.ancestors = {}; // a map from each ancestor of
// the anticursor, to its child that is also an ancestor; in other words,
// the anticursor's ancestor chain in reverse order
for (var ancestor = anticursor; ancestor.parent; ancestor = ancestor.parent) {
ancestors[ancestor.parent.id] = ancestor;
}
};
_.endSelection = function() {
delete this.anticursor;
};
_.select = function() {
var anticursor = this.anticursor;
if (this[L] === anticursor[L] && this.parent === anticursor.parent) return false;
// Find the lowest common ancestor (`lca`), and the ancestor of the cursor
// whose parent is the LCA (which'll be an end of the selection fragment).
for (var ancestor = this; ancestor.parent; ancestor = ancestor.parent) {
if (ancestor.parent.id in anticursor.ancestors) {
var lca = ancestor.parent;
break;
}
}
pray('cursor and anticursor in the same tree', lca);
// The cursor and the anticursor should be in the same tree, because the
// mousemove handler attached to the document, unlike the one attached to
// the root HTML DOM element, doesn't try to get the math tree node of the
// mousemove target, and Cursor::seek() based solely on coordinates stays
// within the tree of `this` cursor's root.
// The other end of the selection fragment, the ancestor of the anticursor
// whose parent is the LCA.
var antiAncestor = anticursor.ancestors[lca.id];
// Now we have two either Nodes or Points, guaranteed to have a common
// parent and guaranteed that if both are Points, they are not the same,
// and we have to figure out which is the left end and which the right end
// of the selection.
var leftEnd, rightEnd, dir = R;
// This is an extremely subtle algorithm.
// As a special case, `ancestor` could be a Point and `antiAncestor` a Node
// immediately to `ancestor`'s left.
// In all other cases,
// - both Nodes
// - `ancestor` a Point and `antiAncestor` a Node
// - `ancestor` a Node and `antiAncestor` a Point
// `antiAncestor[R] === rightward[R]` for some `rightward` that is
// `ancestor` or to its right, if and only if `antiAncestor` is to
// the right of `ancestor`.
if (ancestor[L] !== antiAncestor) {
for (var rightward = ancestor; rightward; rightward = rightward[R]) {
if (rightward[R] === antiAncestor[R]) {
dir = L;
leftEnd = ancestor;
rightEnd = antiAncestor;
break;
}
}
}
if (dir === R) {
leftEnd = antiAncestor;
rightEnd = ancestor;
}
// only want to select Nodes up to Points, can't select Points themselves
if (leftEnd instanceof Point) leftEnd = leftEnd[R];
if (rightEnd instanceof Point) rightEnd = rightEnd[L];
this.hide().selection = lca.selectChildren(leftEnd, rightEnd);
this.insDirOf(dir, this.selection.ends[dir]);
this.selectionChanged();
return true;
};
_.clearSelection = function() {
if (this.selection) {
this.selection.clear();
delete this.selection;
this.selectionChanged();
}
return this;
};
_.deleteSelection = function() {
if (!this.selection) return;
this[L] = this.selection.ends[L][L];
this[R] = this.selection.ends[R][R];
this.selection.remove();
this.selectionChanged();
delete this.selection;
};
_.replaceSelection = function() {
var seln = this.selection;
if (seln) {
this[L] = seln.ends[L][L];
this[R] = seln.ends[R][R];
delete this.selection;
}
return seln;
};
});
var Selection = P(Fragment, function(_, super_) {
_.init = function() {
super_.init.apply(this, arguments);
this.jQ = this.jQ.wrapAll('<span class="mq-selection"></span>').parent();
//can't do wrapAll(this.jQ = $(...)) because wrapAll will clone it
};
_.adopt = function() {
this.jQ.replaceWith(this.jQ = this.jQ.children());
return super_.adopt.apply(this, arguments);
};
_.clear = function() {
// using the browser's native .childNodes property so that we
// don't discard text nodes.
this.jQ.replaceWith(this.jQ[0].childNodes);
return this;
};
_.join = function(methodName) {
return this.fold('', function(fold, child) {
return fold + child[methodName]();
});
};
});
/*********************************************
* Controller for a MathQuill instance,
* on which services are registered with
*
* Controller.open(function(_) { ... });
*
********************************************/
var Controller = P(function(_) {
_.init = function(root, container, options) {
this.id = root.id;
this.data = {};
this.root = root;
this.container = container;
this.options = options;
root.controller = this;
this.cursor = root.cursor = Cursor(root, options);
// TODO: stop depending on root.cursor, and rm it
};
_.handle = function(name, dir) {
var handlers = this.options.handlers;
if (handlers && handlers.fns[name]) {
var mq = handlers.APIClasses[this.KIND_OF_MQ](this);
if (dir === L || dir === R) handlers.fns[name](dir, mq);
else handlers.fns[name](mq);
}
};
var notifyees = [];
this.onNotify = function(f) { notifyees.push(f); };
_.notify = function() {
for (var i = 0; i < notifyees.length; i += 1) {
notifyees[i].apply(this.cursor, arguments);
}
return this;
};
});
/*********************************************************
* The publicly exposed MathQuill API.
********************************************************/
var API = {}, Options = P(), optionProcessors = {}, Progenote = P(), EMBEDS = {};
/**
* Interface Versioning (#459, #495) to allow us to virtually guarantee
* backcompat. v0.10.x introduces it, so for now, don't completely break the
* API for people who don't know about it, just complain with console.warn().
*
* The methods are shimmed in outro.js so that MQ.MathField.prototype etc can
* be accessed.
*/
function insistOnInterVer() {
if (window.console) console.warn(
'You are using the MathQuill API without specifying an interface version, ' +
'which will fail in v1.0.0. You can fix this easily by doing this before ' +
'doing anything else:\n' +
'\n' +
' MathQuill = MathQuill.getInterface(1);\n' +
' // now MathQuill.MathField() works like it used to\n' +
'\n' +
'See also the "`dev` branch (2014\u20132015) \u2192 v0.10.0 Migration Guide" at\n' +
' https://github.com/mathquill/mathquill/wiki/%60dev%60-branch-(2014%E2%80%932015)-%E2%86%92-v0.10.0-Migration-Guide'
);
}
// globally exported API object
function MathQuill(el) {
insistOnInterVer();
return MQ1(el);
};
MathQuill.prototype = Progenote.p;
MathQuill.interfaceVersion = function(v) {
// shim for #459-era interface versioning (ended with #495)
if (v !== 1) throw 'Only interface version 1 supported. You specified: ' + v;
insistOnInterVer = function() {
if (window.console) console.warn(
'You called MathQuill.interfaceVersion(1); to specify the interface ' +
'version, which will fail in v1.0.0. You can fix this easily by doing ' +
'this before doing anything else:\n' +
'\n' +
' MathQuill = MathQuill.getInterface(1);\n' +
' // now MathQuill.MathField() works like it used to\n' +
'\n' +
'See also the "`dev` branch (2014\u20132015) \u2192 v0.10.0 Migration Guide" at\n' +
' https://github.com/mathquill/mathquill/wiki/%60dev%60-branch-(2014%E2%80%932015)-%E2%86%92-v0.10.0-Migration-Guide'
);
};
insistOnInterVer();
return MathQuill;
};
MathQuill.getInterface = getInterface;
var MIN = getInterface.MIN = 1, MAX = getInterface.MAX = 2;
function getInterface(v) {
if (!(MIN <= v && v <= MAX)) throw 'Only interface versions between ' +
MIN + ' and ' + MAX + ' supported. You specified: ' + v;
/**
* Function that takes an HTML element and, if it's the root HTML element of a
* static math or math or text field, returns an API object for it (else, null).
*
* var mathfield = MQ.MathField(mathFieldSpan);
* assert(MQ(mathFieldSpan).id === mathfield.id);
* assert(MQ(mathFieldSpan).id === MQ(mathFieldSpan).id);
*
*/
function MQ(el) {
if (!el || !el.nodeType) return null; // check that `el` is a HTML element, using the
// same technique as jQuery: https://github.com/jquery/jquery/blob/679536ee4b7a92ae64a5f58d90e9cc38c001e807/src/core/init.js#L92
var blockId = $(el).children('.mq-root-block').attr(mqBlockId);
var ctrlr = blockId && Node.byId[blockId].controller;
return ctrlr ? APIClasses[ctrlr.KIND_OF_MQ](ctrlr) : null;
};
var APIClasses = {};
MQ.L = L;
MQ.R = R;
function config(currentOptions, newOptions) {
if (newOptions && newOptions.handlers) {
newOptions.handlers = { fns: newOptions.handlers, APIClasses: APIClasses };
}
for (var name in newOptions) if (newOptions.hasOwnProperty(name)) {
var value = newOptions[name], processor = optionProcessors[name];
currentOptions[name] = (processor ? processor(value) : value);
}
}
MQ.config = function(opts) { config(Options.p, opts); return this; };
MQ.registerEmbed = function(name, options) {
if (!/^[a-z][a-z0-9]*$/i.test(name)) {
throw 'Embed name must start with letter and be only letters and digits';
}
EMBEDS[name] = options;
};
var AbstractMathQuill = APIClasses.AbstractMathQuill = P(Progenote, function(_) {
_.init = function(ctrlr) {