mirror of
https://github.com/friendica/friendica
synced 2025-04-25 19:10:11 +00:00
Replace existing autoloader with Composer-supplied
- Move Friendica namespace to `src` - Move required `ezyang/htmlpurifier` to vendor - Remove existing static autoloader - Change boot.php reference to the autoloader
This commit is contained in:
parent
cae0543629
commit
799e60aa62
419 changed files with 618 additions and 542 deletions
56
vendor/ezyang/htmlpurifier/library/HTMLPurifier/Queue.php
vendored
Normal file
56
vendor/ezyang/htmlpurifier/library/HTMLPurifier/Queue.php
vendored
Normal file
|
@ -0,0 +1,56 @@
|
|||
<?php
|
||||
|
||||
/**
|
||||
* A simple array-backed queue, based off of the classic Okasaki
|
||||
* persistent amortized queue. The basic idea is to maintain two
|
||||
* stacks: an input stack and an output stack. When the output
|
||||
* stack runs out, reverse the input stack and use it as the output
|
||||
* stack.
|
||||
*
|
||||
* We don't use the SPL implementation because it's only supported
|
||||
* on PHP 5.3 and later.
|
||||
*
|
||||
* Exercise: Prove that push/pop on this queue take amortized O(1) time.
|
||||
*
|
||||
* Exercise: Extend this queue to be a deque, while preserving amortized
|
||||
* O(1) time. Some care must be taken on rebalancing to avoid quadratic
|
||||
* behaviour caused by repeatedly shuffling data from the input stack
|
||||
* to the output stack and back.
|
||||
*/
|
||||
class HTMLPurifier_Queue {
|
||||
private $input;
|
||||
private $output;
|
||||
|
||||
public function __construct($input = array()) {
|
||||
$this->input = $input;
|
||||
$this->output = array();
|
||||
}
|
||||
|
||||
/**
|
||||
* Shifts an element off the front of the queue.
|
||||
*/
|
||||
public function shift() {
|
||||
if (empty($this->output)) {
|
||||
$this->output = array_reverse($this->input);
|
||||
$this->input = array();
|
||||
}
|
||||
if (empty($this->output)) {
|
||||
return NULL;
|
||||
}
|
||||
return array_pop($this->output);
|
||||
}
|
||||
|
||||
/**
|
||||
* Pushes an element onto the front of the queue.
|
||||
*/
|
||||
public function push($x) {
|
||||
array_push($this->input, $x);
|
||||
}
|
||||
|
||||
/**
|
||||
* Checks if it's empty.
|
||||
*/
|
||||
public function isEmpty() {
|
||||
return empty($this->input) && empty($this->output);
|
||||
}
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue