41 lines
1.2 KiB
PHP
41 lines
1.2 KiB
PHP
<?php
|
|
|
|
namespace MailPoet\Util;
|
|
|
|
use pQuery\DomNode;
|
|
|
|
class DOM {
|
|
/**
|
|
* Splits a DOM tree around the cut element, bringing it up to bound
|
|
* ancestor and splitting left and right siblings into subtrees along
|
|
* the way, retaining order and nesting level.
|
|
*/
|
|
public static function splitOn(DomNode $bound, DomNode $cutElement) {
|
|
$ignoreTextAndCommentNodes = false;
|
|
for ($parent = $cutElement->parent; $bound != $parent; $parent = $grandparent) {
|
|
// Clone parent node without children, but with attributes
|
|
$parent->after($parent->toString());
|
|
$right = $parent->getNextSibling($ignoreTextAndCommentNodes);
|
|
$right->clear();
|
|
|
|
while ($sibling = $cutElement->getNextSibling($ignoreTextAndCommentNodes)) {
|
|
$sibling->move($right);
|
|
}
|
|
|
|
// Reattach cut_element and right siblings to grandparent
|
|
$grandparent = $parent->parent;
|
|
$indexAfterParent = $parent->index() + 1;
|
|
$right->move($grandparent, $indexAfterParent);
|
|
$indexAfterParent = $parent->index() + 1;
|
|
$cutElement->move($grandparent, $indexAfterParent);
|
|
}
|
|
}
|
|
|
|
public static function findTopAncestor(DomNode $item) {
|
|
while ($item->parent->parent !== null) {
|
|
$item = $item->parent;
|
|
}
|
|
return $item;
|
|
}
|
|
}
|