96 lines
3.4 KiB
PHP
96 lines
3.4 KiB
PHP
<?php
|
|
|
|
declare(strict_types=1);
|
|
|
|
/*
|
|
* The MIT License (MIT)
|
|
*
|
|
* Copyright (c) 2013 Jonathan Vollebregt (jnvsor@gmail.com), Rokas Šleinius (raveren@gmail.com)
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
* this software and associated documentation files (the "Software"), to deal in
|
|
* the Software without restriction, including without limitation the rights to
|
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
|
* the Software, and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
* copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
|
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
|
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
|
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
namespace Kint\Parser;
|
|
|
|
use Kint\Zval\Representation\Representation;
|
|
use Kint\Zval\Value;
|
|
|
|
// Note: Interaction with ArrayLimitPlugin:
|
|
// Any array limited children will be shown in tables identically to
|
|
// non-array-limited children since the table only shows that it is an array
|
|
// and it's size anyway. Because ArrayLimitPlugin halts the parse on finding
|
|
// a limit all other plugins including this one are stopped, so you cannot get
|
|
// a tabular representation of an array that is longer than the limit.
|
|
class TablePlugin extends AbstractPlugin
|
|
{
|
|
public function getTypes(): array
|
|
{
|
|
return ['array'];
|
|
}
|
|
|
|
public function getTriggers(): int
|
|
{
|
|
return Parser::TRIGGER_SUCCESS;
|
|
}
|
|
|
|
public function parse(&$var, Value &$o, int $trigger): void
|
|
{
|
|
if (empty($o->value->contents)) {
|
|
return;
|
|
}
|
|
|
|
$array = $this->parser->getCleanArray($var);
|
|
|
|
if (\count($array) < 2) {
|
|
return;
|
|
}
|
|
|
|
// Ensure this is an array of arrays and that all child arrays have the
|
|
// same keys. We don't care about their children - if there's another
|
|
// "table" inside we'll just make another one down the value tab
|
|
$keys = null;
|
|
foreach ($array as $elem) {
|
|
if (!\is_array($elem) || \count($elem) < 2) {
|
|
return;
|
|
}
|
|
|
|
if (null === $keys) {
|
|
$keys = \array_keys($elem);
|
|
} elseif (\array_keys($elem) !== $keys) {
|
|
return;
|
|
}
|
|
}
|
|
|
|
// Ensure none of the child arrays are recursion or depth limit. We
|
|
// don't care if their children are since they are the table cells
|
|
foreach ($o->value->contents as $childarray) {
|
|
if (empty($childarray->value->contents)) {
|
|
return;
|
|
}
|
|
}
|
|
|
|
// Objects by reference for the win! We can do a copy-paste of the value
|
|
// representation contents and just slap a new hint on there and hey
|
|
// presto we have our table representation with no extra memory used!
|
|
$table = new Representation('Table');
|
|
$table->contents = $o->value->contents;
|
|
$table->hints[] = 'table';
|
|
$o->addRepresentation($table, 0);
|
|
}
|
|
}
|