Korbs/Squire
0
Fork 0
mirror of https://github.com/fastmail/Squire.git synced 2025-01-03 05:00:13 -05:00
Code Issues Activity

Don't clean nodes that are already clean

Browse source
This commit is contained in:
Andy Kauffman 2016-05-12 21:36:02 -04:00
parent 241cd64227
commit 96e3243007
3 changed files with 28 additions and 21 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
build/squire-raw.js
View file

@ -1752,20 +1752,24 @@ var replaceStyles = function ( node, parent ) {
css = style[ attr ];
if ( css && converter.regexp.test( css ) ) {
el = converter.replace( doc, css );
if ( newTreeBottom ) {
newTreeBottom.appendChild( el );
}
newTreeBottom = el;
if ( !newTreeTop ) {
newTreeTop = el;
//No need to clean node that is already clean
if(el.style.cssText !== style.cssText) {
if ( newTreeBottom ) {
newTreeBottom.appendChild( el );
}
newTreeBottom = el;
if ( !newTreeTop ) {
newTreeTop = el;
}
node.style[ attr ] = '';
}
}
}
if ( newTreeTop ) {
newTreeBottom.appendChild( empty( node ) );
node.innerHTML = '';
node.appendChild( newTreeTop );
newTreeBottom.appendChild( node.cloneNode(true) );
parent.replaceChild( newTreeTop, node );
}
return newTreeBottom || node;

5
build/squire.js
View file

File diff suppressed because one or more lines are too long

22
source/Clean.js
View file

@ -86,20 +86,24 @@ var replaceStyles = function ( node, parent ) {
css = style[ attr ];
if ( css && converter.regexp.test( css ) ) {
el = converter.replace( doc, css );
if ( newTreeBottom ) {
newTreeBottom.appendChild( el );
}
newTreeBottom = el;
if ( !newTreeTop ) {
newTreeTop = el;
//No need to clean node that is already clean
if(el.style.cssText !== style.cssText) {
if ( newTreeBottom ) {
newTreeBottom.appendChild( el );
}
newTreeBottom = el;
if ( !newTreeTop ) {
newTreeTop = el;
}
node.style[ attr ] = '';
}
}
}
if ( newTreeTop ) {
newTreeBottom.appendChild( empty( node ) );
node.innerHTML = '';
node.appendChild( newTreeTop );
newTreeBottom.appendChild( node.cloneNode(true) );
parent.replaceChild( newTreeTop, node );
}
return newTreeBottom || node;