aboutsummaryrefslogtreecommitdiffhomepage
path: root/inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php
diff options
context:
space:
mode:
authorNicolas LÅ“uillet <nicolas@loeuillet.org>2015-01-18 20:07:46 +0100
committerNicolas LÅ“uillet <nicolas@loeuillet.org>2015-01-18 20:07:46 +0100
commitadf17b677edeb2387671f6a0f12123e7497b5938 (patch)
tree8fd87d7bf5699488ffc12afa991011e80ac1011b /inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php
parent894cd087f41d605f2f093aaad1300825f705e009 (diff)
downloadwallabag-adf17b677edeb2387671f6a0f12123e7497b5938.tar.gz
wallabag-adf17b677edeb2387671f6a0f12123e7497b5938.tar.zst
wallabag-adf17b677edeb2387671f6a0f12123e7497b5938.zip
remove 3rd libraries
Diffstat (limited to 'inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php')
-rw-r--r--inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php56
1 files changed, 0 insertions, 56 deletions
diff --git a/inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php b/inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php
deleted file mode 100644
index a75894d4..00000000
--- a/inc/3rdparty/htmlpurifier/HTMLPurifier/Queue.php
+++ /dev/null
@@ -1,56 +0,0 @@
1<?php
2
3/**
4 * A simple array-backed queue, based off of the classic Okasaki
5 * persistent amortized queue. The basic idea is to maintain two
6 * stacks: an input stack and an output stack. When the output
7 * stack runs out, reverse the input stack and use it as the output
8 * stack.
9 *
10 * We don't use the SPL implementation because it's only supported
11 * on PHP 5.3 and later.
12 *
13 * Exercise: Prove that push/pop on this queue take amortized O(1) time.
14 *
15 * Exercise: Extend this queue to be a deque, while preserving amortized
16 * O(1) time. Some care must be taken on rebalancing to avoid quadratic
17 * behaviour caused by repeatedly shuffling data from the input stack
18 * to the output stack and back.
19 */
20class HTMLPurifier_Queue {
21 private $input;
22 private $output;
23
24 public function __construct($input = array()) {
25 $this->input = $input;
26 $this->output = array();
27 }
28
29 /**
30 * Shifts an element off the front of the queue.
31 */
32 public function shift() {
33 if (empty($this->output)) {
34 $this->output = array_reverse($this->input);
35 $this->input = array();
36 }
37 if (empty($this->output)) {
38 return NULL;
39 }
40 return array_pop($this->output);
41 }
42
43 /**
44 * Pushes an element onto the front of the queue.
45 */
46 public function push($x) {
47 array_push($this->input, $x);
48 }
49
50 /**
51 * Checks if it's empty.
52 */
53 public function isEmpty() {
54 return empty($this->input) && empty($this->output);
55 }
56}