1 files changed, 0 insertions, 71 deletions
diff --git a/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php b/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php
deleted file mode 100644
index eab66566..00000000
--- a/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php
+++ /dev/null
@@ -1,71 +0,0 @@
-<?php
-/**
- * Converts a stream of HTMLPurifier_Token into an HTMLPurifier_Node,
- * and back again.
- *
- * @note This transformation is not an equivalence.  We mutate the input
- * token stream to make it so; see all [MUT] markers in code.
- */
-class HTMLPurifier_Arborize
-{
-    public static function arborize($tokens, $config, $context) {
-        $definition = $config->getHTMLDefinition();
-        $parent = new HTMLPurifier_Token_Start($definition->info_parent);
-        $stack = array($parent->toNode());
-        foreach ($tokens as $token) {
-            $token->skip = null; // [MUT]
-            $token->carryover = null; // [MUT]
-            if ($token instanceof HTMLPurifier_Token_End) {
-                $token->start = null; // [MUT]
-                $r = array_pop($stack);
-                assert($r->name === $token->name);
-                assert(empty($token->attr));
-                $r->endCol = $token->col;
-                $r->endLine = $token->line;
-                $r->endArmor = $token->armor;
-                continue;
-            }
-            $node = $token->toNode();
-            $stack[count($stack)-1]->children[] = $node;
-            if ($token instanceof HTMLPurifier_Token_Start) {
-                $stack[] = $node;
-            }
-        }
-        assert(count($stack) == 1);
-        return $stack[0];
-    }
-    public static function flatten($node, $config, $context) {
-        $level = 0;
-        $nodes = array($level => new HTMLPurifier_Queue(array($node)));
-        $closingTokens = array();
-        $tokens = array();
-        do {
-            while (!$nodes[$level]->isEmpty()) {
-                $node = $nodes[$level]->shift(); // FIFO
-                list($start, $end) = $node->toTokenPair();
-                if ($level > 0) {
-                    $tokens[] = $start;
-                }
-                if ($end !== NULL) {
-                    $closingTokens[$level][] = $end;
-                }
-                if ($node instanceof HTMLPurifier_Node_Element) {
-                    $level++;
-                    $nodes[$level] = new HTMLPurifier_Queue();
-                    foreach ($node->children as $childNode) {
-                        $nodes[$level]->push($childNode);
-                    }
-                }
-            }
-            $level--;
-            if ($level && isset($closingTokens[$level])) {
-                while ($token = array_pop($closingTokens[$level])) {
-                    $tokens[] = $token;
-                }
-            }
-        } while ($level > 0);
-        return $tokens;
-    }
-}

diff --git a/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php b/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php deleted file mode 100644 index eab66566..00000000 --- a/inc/3rdparty/htmlpurifier/HTMLPurifier/Arborize.php +++ /dev/null
@@ -1,71 +0,0 @@
1	<?php
2
3	/**
4	* Converts a stream of HTMLPurifier_Token into an HTMLPurifier_Node,
5	* and back again.
6	*
7	* @note This transformation is not an equivalence. We mutate the input
8	* token stream to make it so; see all [MUT] markers in code.
9	*/
10	class HTMLPurifier_Arborize
11	{
12	public static function arborize($tokens, $config, $context) {
13	$definition = $config->getHTMLDefinition();
14	$parent = new HTMLPurifier_Token_Start($definition->info_parent);
15	$stack = array($parent->toNode());
16	foreach ($tokens as $token) {
17	$token->skip = null; // [MUT]
18	$token->carryover = null; // [MUT]
19	if ($token instanceof HTMLPurifier_Token_End) {
20	$token->start = null; // [MUT]
21	$r = array_pop($stack);
22	assert($r->name === $token->name);
23	assert(empty($token->attr));
24	$r->endCol = $token->col;
25	$r->endLine = $token->line;
26	$r->endArmor = $token->armor;
27	continue;
28	}
29	$node = $token->toNode();
30	$stack[count($stack)-1]->children[] = $node;
31	if ($token instanceof HTMLPurifier_Token_Start) {
32	$stack[] = $node;
33	}
34	}
35	assert(count($stack) == 1);
36	return $stack[0];
37	}
38
39	public static function flatten($node, $config, $context) {
40	$level = 0;
41	$nodes = array($level => new HTMLPurifier_Queue(array($node)));
42	$closingTokens = array();
43	$tokens = array();
44	do {
45	while (!$nodes[$level]->isEmpty()) {
46	$node = $nodes[$level]->shift(); // FIFO
47	list($start, $end) = $node->toTokenPair();
48	if ($level > 0) {
49	$tokens[] = $start;
50	}
51	if ($end !== NULL) {
52	$closingTokens[$level][] = $end;
53	}
54	if ($node instanceof HTMLPurifier_Node_Element) {
55	$level++;
56	$nodes[$level] = new HTMLPurifier_Queue();
57	foreach ($node->children as $childNode) {
58	$nodes[$level]->push($childNode);
59	}
60	}
61	}
62	$level--;
63	if ($level && isset($closingTokens[$level])) {
64	while ($token = array_pop($closingTokens[$level])) {
65	$tokens[] = $token;
66	}
67	}
68	} while ($level > 0);
69	return $tokens;
70	}
71	}