ONE PIECE HACKING

Ngiler SH3LL 360
: / home / tbf / tbf.ro / vendor / aws / aws-sdk-php / src /

Information Server
MySQL : OFF Perl : OFF CURL : ON WGET : OFF PKEXEC : OFF

Directive	Local Value
IP Address	89.40.16.97
System	Linux server.atelieruldeit.ro 3.10.0-1160.el7.x86_64 #1 SMP Mon Oct 19 16:18:59 UTC 2020 x86_64
User	tbf
PHP Version	7.3.33
Software	Apache
Doc root	Writable

Edit File : LruArrayCache.php \| Size : 2.16 KB
<?php namespace Aws; /** * Simple in-memory LRU cache that limits the number of cached entries. * * The LRU cache is implemented using PHP's ordered associative array. When * accessing an element, the element is removed from the hash and re-added to * ensure that recently used items are always at the end of the list while * least recently used are at the beginning. When a value is added to the * cache, if the number of cached items exceeds the allowed number, the first * N number of items are removed from the array. / class LruArrayCache implements CacheInterface, \Countable { /* @var int / private $maxItems; /* @var array / private $items = array(); /* * @param int $maxItems Maximum number of allowed cache items. */ public function __construct($maxItems = 1000) { $this->maxItems = $maxItems; } public function get($key) { if (!isset($this->items[$key])) { return null; } $entry = $this->items[$key]; // Ensure the item is not expired. if (!$entry[1] \|\| time() < $entry[1]) { // LRU: remove the item and push it to the end of the array. unset($this->items[$key]); $this->items[$key] = $entry; return $entry[0]; } unset($this->items[$key]); return null; } public function set($key, $value, $ttl = 0) { // Only call time() if the TTL is not 0/false/null $ttl = $ttl ? time() + $ttl : 0; $this->items[$key] = [$value, $ttl]; // Determine if there are more items in the cache than allowed. $diff = count($this->items) - $this->maxItems; // Clear out least recently used items. if ($diff > 0) { // Reset to the beginning of the array and begin unsetting. reset($this->items); for ($i = 0; $i < $diff; $i++) { unset($this->items[key($this->items)]); next($this->items); } } } public function remove($key) { unset($this->items[$key]); } public function count() { return count($this->items); } } Back

Edit File : LruArrayCache.php | Size : 2.16 KB

<?php
namespace Aws;

/**
 * Simple in-memory LRU cache that limits the number of cached entries.
 *
 * The LRU cache is implemented using PHP's ordered associative array. When
 * accessing an element, the element is removed from the hash and re-added to
 * ensure that recently used items are always at the end of the list while
 * least recently used are at the beginning. When a value is added to the
 * cache, if the number of cached items exceeds the allowed number, the first
 * N number of items are removed from the array.
 */
class LruArrayCache implements CacheInterface, \Countable
{
    /** @var int */
    private $maxItems;

/** @var array */
    private $items = array();

/**
     * @param int $maxItems Maximum number of allowed cache items.
     */
    public function __construct($maxItems = 1000)
    {
        $this->maxItems = $maxItems;
    }

public function get($key)
    {
        if (!isset($this->items[$key])) {
            return null;
        }

$entry = $this->items[$key];

// Ensure the item is not expired.
        if (!$entry[1] || time() < $entry[1]) {
            // LRU: remove the item and push it to the end of the array.
            unset($this->items[$key]);
            $this->items[$key] = $entry;
            return $entry[0];
        }

unset($this->items[$key]);
        return null;
    }

public function set($key, $value, $ttl = 0)
    {
        // Only call time() if the TTL is not 0/false/null
        $ttl = $ttl ? time() + $ttl : 0;
        $this->items[$key] = [$value, $ttl];

// Determine if there are more items in the cache than allowed.
        $diff = count($this->items) - $this->maxItems;

// Clear out least recently used items.
        if ($diff > 0) {
            // Reset to the beginning of the array and begin unsetting.
            reset($this->items);
            for ($i = 0; $i < $diff; $i++) {
                unset($this->items[key($this->items)]);
                next($this->items);
            }
        }
    }

public function remove($key)
    {
        unset($this->items[$key]);
    }

public function count()
    {
        return count($this->items);
    }
}

Back