| Server IP : 35.236.43.222 / Your IP : 216.73.216.143 Web Server : Apache System : Linux order-form-vm-001 5.10.0-37-cloud-amd64 #1 SMP Debian 5.10.247-1 (2025-12-11) x86_64 User : deploy ( 1002) PHP Version : 8.1.31 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /var/www/mastersystem.app/public/wp-content/plugins/mailpoet/lib/Util/ |
Upload File : |
<?php // phpcs:ignore SlevomatCodingStandard.TypeHints.DeclareStrictTypes.DeclareStrictTypesMissing
namespace MailPoet\Util;
if (!defined('ABSPATH')) exit;
use MailPoetVendor\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;
$grandparent = $cutElement->parent;
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;
}
}