Файловый менеджер - Редактировать - /home/skymarketplace/public_html/uploads/test.tar
Назад
Console_Getopt/tests/001-getopt.phpt 0000644 00000002316 15004366340 0013332 0 ustar 00 --TEST-- Console_Getopt --FILE-- <?php require_once 'Console/Getopt.php'; PEAR::setErrorHandling(PEAR_ERROR_PRINT, "%s\n\n"); function test($argstr, $optstr) { $argv = preg_split('/[[:space:]]+/', $argstr); if (PEAR::isError($options = Console_Getopt::getopt($argv, $optstr))) { return; } $opts = $options[0]; $non_opts = $options[1]; $i = 0; print "options: "; foreach ($opts as $o => $d) { if ($i++ > 0) { print ", "; } print $d[0] . '=' . $d[1]; } print "\n"; print "params: " . implode(", ", $non_opts) . "\n"; print "\n"; } test("-abc", "abc"); test("-abc foo", "abc"); test("-abc foo", "abc:"); test("-abc foo bar gazonk", "abc"); test("-abc foo bar gazonk", "abc:"); test("-a -b -c", "abc"); test("-a -b -c", "abc:"); test("-abc", "ab:c"); test("-abc foo -bar gazonk", "abc"); ?> --EXPECT-- options: a=, b=, c= params: options: a=, b=, c= params: foo options: a=, b=, c=foo params: options: a=, b=, c= params: foo, bar, gazonk options: a=, b=, c=foo params: bar, gazonk options: a=, b=, c= params: Console_Getopt: option requires an argument --c options: a=, b=c params: options: a=, b=, c= params: foo, -bar, gazonk Console_Getopt/tests/bug10557.phpt 0000644 00000000756 15004366340 0012717 0 ustar 00 --TEST-- Console_Getopt [bug 10557] --SKIPIF-- --FILE-- <?php $_SERVER['argv'] = $argv = array('hi', '-fjjohnston@mail.com', '--to', '--mailpack', '--debug'); require_once 'Console/Getopt.php'; $ret = Console_Getopt::getopt(Console_Getopt::readPHPArgv(), 'f:t:', array('from=','to=','mailpack=','direction=','verbose','debug')); if(PEAR::isError($ret)) { echo $ret->getMessage()."\n"; echo 'FATAL'; exit; } print_r($ret); ?> --EXPECT-- Console_Getopt: option requires an argument --to FATAL Console_Getopt/tests/bug11068.phpt 0000644 00000001431 15004366340 0012704 0 ustar 00 --TEST-- Console_Getopt [bug 11068] --SKIPIF-- --FILE-- <?php $_SERVER['argv'] = $argv = array('hi', '-fjjohnston@mail.com', '--to', 'hi', '-'); require_once 'Console/Getopt.php'; $ret = Console_Getopt::getopt(Console_Getopt::readPHPArgv(), 'f:t:', array('from=','to=','mailpack=','direction=','verbose','debug')); if(PEAR::isError($ret)) { echo $ret->getMessage()."\n"; echo 'FATAL'; exit; } print_r($ret); ?> --EXPECT-- Array ( [0] => Array ( [0] => Array ( [0] => f [1] => jjohnston@mail.com ) [1] => Array ( [0] => --to [1] => hi ) ) [1] => Array ( [0] => - ) ) Console_Getopt/tests/bug13140.phpt 0000644 00000002505 15004366340 0012700 0 ustar 00 --TEST-- Console_Getopt [bug 13140] --SKIPIF-- --FILE-- <?php $_SERVER['argv'] = $argv = array('--bob', '--foo' , '-bar', '--test', '-rq', 'thisshouldbehere'); require_once 'Console/Getopt.php'; $cg = new Console_GetOpt(); print_r($cg->getopt2($cg->readPHPArgv(), 't', array('test'), true)); print_r($cg->getopt2($cg->readPHPArgv(), 'bar', array('foo'), true)); ?> --EXPECT-- Array ( [0] => Array ( [0] => Array ( [0] => --test [1] => ) ) [1] => Array ( [0] => thisshouldbehere ) ) Array ( [0] => Array ( [0] => Array ( [0] => --foo [1] => ) [1] => Array ( [0] => b [1] => ) [2] => Array ( [0] => a [1] => ) [3] => Array ( [0] => r [1] => ) [4] => Array ( [0] => r [1] => ) ) [1] => Array ( [0] => thisshouldbehere ) ) Structures_Graph/tests/AcyclicTestTest.php 0000644 00000002434 15004366340 0014776 0 ustar 00 <?php require_once dirname(__FILE__) . '/helper.inc'; require_once 'Structures/Graph/Manipulator/AcyclicTest.php'; class AcyclicTestTest extends PHPUnit_Framework_TestCase { public function testIsAcyclicFalse() { $graph = new Structures_Graph(); $node1 = new Structures_Graph_Node(); $graph->addNode($node1); $node2 = new Structures_Graph_Node(); $graph->addNode($node2); $node1->connectTo($node2); $node3 = new Structures_Graph_Node(); $graph->addNode($node3); $node2->connectTo($node3); $node3->connectTo($node1); $this->assertFalse( Structures_Graph_Manipulator_AcyclicTest::isAcyclic($graph), 'Graph is cyclic' ); } public function testIsAcyclicTrue() { $graph = new Structures_Graph(); $node1 = new Structures_Graph_Node(); $graph->addNode($node1); $node2 = new Structures_Graph_Node(); $graph->addNode($node2); $node1->connectTo($node2); $node3 = new Structures_Graph_Node(); $graph->addNode($node3); $node2->connectTo($node3); $this->assertTrue( Structures_Graph_Manipulator_AcyclicTest::isAcyclic($graph), 'Graph is acyclic' ); } } ?> Structures_Graph/tests/AllTests.php 0000644 00000000674 15004366340 0013466 0 ustar 00 <?php require_once dirname(__FILE__) . '/helper.inc'; class Structures_Graph_AllTests { public static function main() { PHPUnit_TextUI_TestRunner::run(self::suite()); } public static function suite() { $suite = new PHPUnit_Framework_TestSuite('Structures_Graph Tests'); $dir = new GlobIterator(dirname(__FILE__) . '/*Test.php'); $suite->addTestFiles($dir); return $suite; } } Structures_Graph/tests/BasicGraphTest.php 0000644 00000021552 15004366340 0014574 0 ustar 00 <?php /* vim: set expandtab tabstop=4 shiftwidth=4 foldmethod=marker: */ // +-----------------------------------------------------------------------------+ // | Copyright (c) 2003 S�rgio Gon�alves Carvalho | // +-----------------------------------------------------------------------------+ // | This file is part of Structures_Graph. | // | | // | Structures_Graph is free software; you can redistribute it and/or modify | // | it under the terms of the GNU Lesser General Public License as published by | // | the Free Software Foundation; either version 2.1 of the License, or | // | (at your option) any later version. | // | | // | Structures_Graph 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 Lesser General Public License for more details. | // | | // | You should have received a copy of the GNU Lesser General Public License | // | along with Structures_Graph; if not, write to the Free Software | // | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA | // | 02111-1307 USA | // +-----------------------------------------------------------------------------+ // | Author: S�rgio Carvalho <sergio.carvalho@portugalmail.com> | // +-----------------------------------------------------------------------------+ // require_once dirname(__FILE__) . '/helper.inc'; /** * @access private */ class BasicGraph extends PHPUnit_Framework_TestCase { var $_graph = null; function test_create_graph() { $this->_graph = new Structures_Graph(); $this->assertTrue(is_a($this->_graph, 'Structures_Graph')); } function test_add_node() { $this->_graph = new Structures_Graph(); $data = 1; $node = new Structures_Graph_Node($data); $this->_graph->addNode($node); $node = new Structures_Graph_Node($data); $this->_graph->addNode($node); $node = new Structures_Graph_Node($data); $this->_graph->addNode($node); } function test_connect_node() { $this->_graph = new Structures_Graph(); $data = 1; $node1 = new Structures_Graph_Node($data); $node2 = new Structures_Graph_Node($data); $this->_graph->addNode($node1); $this->_graph->addNode($node2); $node1->connectTo($node2); $node =& $this->_graph->getNodes(); $node =& $node[0]; $node = $node->getNeighbours(); $node =& $node[0]; /* ZE1 == and === operators fail on $node,$node2 because of the recursion introduced by the _graph field in the Node object. So, we'll use the stupid method for reference testing */ $node = true; $this->assertTrue($node2); $node = false; $this->assertFalse($node2); } function test_data_references() { $this->_graph = new Structures_Graph(); $data = 1; $node = new Structures_Graph_Node(); $node->setData($data); $this->_graph->addNode($node); $data = 2; $dataInNode =& $this->_graph->getNodes(); $dataInNode =& $dataInNode[0]; $dataInNode =& $dataInNode->getData(); $this->assertEquals($data, $dataInNode); } function test_metadata_references() { $this->_graph = new Structures_Graph(); $data = 1; $node = new Structures_Graph_Node(); $node->setMetadata('5', $data); $data = 2; $dataInNode =& $node->getMetadata('5'); $this->assertEquals($data, $dataInNode); } function test_metadata_key_exists() { $this->_graph = new Structures_Graph(); $data = 1; $node = new Structures_Graph_Node(); $node->setMetadata('5', $data); $this->assertTrue($node->metadataKeyExists('5')); $this->assertFalse($node->metadataKeyExists('1')); } function test_directed_degree() { $this->_graph = new Structures_Graph(true); $node = array(); $node[] = new Structures_Graph_Node(); $node[] = new Structures_Graph_Node(); $node[] = new Structures_Graph_Node(); $this->_graph->addNode($node[0]); $this->_graph->addNode($node[1]); $this->_graph->addNode($node[2]); $this->assertEquals(0, $node[0]->inDegree(), 'inDegree test failed for node 0 with 0 arcs'); $this->assertEquals(0, $node[1]->inDegree(), 'inDegree test failed for node 1 with 0 arcs'); $this->assertEquals(0, $node[2]->inDegree(), 'inDegree test failed for node 2 with 0 arcs'); $this->assertEquals(0, $node[0]->outDegree(), 'outDegree test failed for node 0 with 0 arcs'); $this->assertEquals(0, $node[1]->outDegree(), 'outDegree test failed for node 1 with 0 arcs'); $this->assertEquals(0, $node[2]->outDegree(), 'outDegree test failed for node 2 with 0 arcs'); $node[0]->connectTo($node[1]); $this->assertEquals(0, $node[0]->inDegree(), 'inDegree test failed for node 0 with 1 arc'); $this->assertEquals(1, $node[1]->inDegree(), 'inDegree test failed for node 1 with 1 arc'); $this->assertEquals(0, $node[2]->inDegree(), 'inDegree test failed for node 2 with 1 arc'); $this->assertEquals(1, $node[0]->outDegree(), 'outDegree test failed for node 0 with 1 arc'); $this->assertEquals(0, $node[1]->outDegree(), 'outDegree test failed for node 1 with 1 arc'); $this->assertEquals(0, $node[2]->outDegree(), 'outDegree test failed for node 2 with 1 arc'); $node[0]->connectTo($node[2]); $this->assertEquals(0, $node[0]->inDegree(), 'inDegree test failed for node 0 with 2 arcs'); $this->assertEquals(1, $node[1]->inDegree(), 'inDegree test failed for node 1 with 2 arcs'); $this->assertEquals(1, $node[2]->inDegree(), 'inDegree test failed for node 2 with 2 arcs'); $this->assertEquals(2, $node[0]->outDegree(), 'outDegree test failed for node 0 with 2 arcs'); $this->assertEquals(0, $node[1]->outDegree(), 'outDegree test failed for node 1 with 2 arcs'); $this->assertEquals(0, $node[2]->outDegree(), 'outDegree test failed for node 2 with 2 arcs'); } function test_undirected_degree() { $this->_graph = new Structures_Graph(false); $node = array(); $node[] = new Structures_Graph_Node(); $node[] = new Structures_Graph_Node(); $node[] = new Structures_Graph_Node(); $this->_graph->addNode($node[0]); $this->_graph->addNode($node[1]); $this->_graph->addNode($node[2]); $this->assertEquals(0, $node[0]->inDegree(), 'inDegree test failed for node 0 with 0 arcs'); $this->assertEquals(0, $node[1]->inDegree(), 'inDegree test failed for node 1 with 0 arcs'); $this->assertEquals(0, $node[2]->inDegree(), 'inDegree test failed for node 2 with 0 arcs'); $this->assertEquals(0, $node[0]->outDegree(), 'outDegree test failed for node 0 with 0 arcs'); $this->assertEquals(0, $node[1]->outDegree(), 'outDegree test failed for node 1 with 0 arcs'); $this->assertEquals(0, $node[2]->outDegree(), 'outDegree test failed for node 2 with 0 arcs'); $node[0]->connectTo($node[1]); $this->assertEquals(1, $node[0]->inDegree(), 'inDegree test failed for node 0 with 1 arc'); $this->assertEquals(1, $node[1]->inDegree(), 'inDegree test failed for node 1 with 1 arc'); $this->assertEquals(0, $node[2]->inDegree(), 'inDegree test failed for node 2 with 1 arc'); $this->assertEquals(1, $node[0]->outDegree(), 'outDegree test failed for node 0 with 1 arc'); $this->assertEquals(1, $node[1]->outDegree(), 'outDegree test failed for node 1 with 1 arc'); $this->assertEquals(0, $node[2]->outDegree(), 'outDegree test failed for node 2 with 1 arc'); $node[0]->connectTo($node[2]); $this->assertEquals(2, $node[0]->inDegree(), 'inDegree test failed for node 0 with 2 arcs'); $this->assertEquals(1, $node[1]->inDegree(), 'inDegree test failed for node 1 with 2 arcs'); $this->assertEquals(1, $node[2]->inDegree(), 'inDegree test failed for node 2 with 2 arcs'); $this->assertEquals(2, $node[0]->outDegree(), 'outDegree test failed for node 0 with 2 arcs'); $this->assertEquals(1, $node[1]->outDegree(), 'outDegree test failed for node 1 with 2 arcs'); $this->assertEquals(1, $node[2]->outDegree(), 'outDegree test failed for node 2 with 2 arcs'); } } ?> Structures_Graph/tests/TopologicalSorterTest.php 0000644 00000003525 15004366340 0016244 0 ustar 00 <?php require_once dirname(__FILE__) . '/helper.inc'; require_once 'Structures/Graph/Manipulator/TopologicalSorter.php'; class TopologicalSorterTest extends PHPUnit_Framework_TestCase { public function testSort() { $graph = new Structures_Graph(); $name1 = 'node1'; $node1 = new Structures_Graph_Node(); $node1->setData($name1); $graph->addNode($node1); $name11 = 'node11'; $node11 = new Structures_Graph_Node(); $node11->setData($name11); $graph->addNode($node11); $node1->connectTo($node11); $name12 = 'node12'; $node12 = new Structures_Graph_Node(); $node12->setData($name12); $graph->addNode($node12); $node1->connectTo($node12); $name121 = 'node121'; $node121 = new Structures_Graph_Node(); $node121->setData($name121); $graph->addNode($node121); $node12->connectTo($node121); $name2 = 'node2'; $node2 = new Structures_Graph_Node(); $node2->setData($name2); $graph->addNode($node2); $name21 = 'node21'; $node21 = new Structures_Graph_Node(); $node21->setData($name21); $graph->addNode($node21); $node2->connectTo($node21); $nodes = Structures_Graph_Manipulator_TopologicalSorter::sort($graph); $this->assertCount(2, $nodes[0]); $this->assertEquals('node1', $nodes[0][0]->getData()); $this->assertEquals('node2', $nodes[0][1]->getData()); $this->assertCount(3, $nodes[1]); $this->assertEquals('node11', $nodes[1][0]->getData()); $this->assertEquals('node12', $nodes[1][1]->getData()); $this->assertEquals('node21', $nodes[1][2]->getData()); $this->assertCount(1, $nodes[2]); $this->assertEquals('node121', $nodes[2][0]->getData()); } } ?> Structures_Graph/tests/helper.inc 0000644 00000000551 15004366340 0013166 0 ustar 00 <?php if ('/opt/alt/php80/usr/share/pear' == '@'.'php_dir'.'@') { // This package hasn't been installed. // Adjust path to ensure includes find files in working directory. set_include_path(dirname(dirname(__FILE__)) . PATH_SEPARATOR . dirname(__FILE__) . PATH_SEPARATOR . get_include_path()); } require_once 'Structures/Graph.php'; XML_RPC/tests/actual-request.php 0000644 00000003451 15004366340 0012526 0 ustar 00 <?php /** * Actually performs an XML_RPC request. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: actual-request.php 300957 2010-07-02 23:55:00Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.5.3 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC/Dump.php'; $debug = 0; $params = array( new XML_RPC_Value('php.net', 'string'), ); $msg = new XML_RPC_Message('domquery', $params); $client = new XML_RPC_Client('/api/xmlrpc', 'www.adamsnames.com'); $client->setDebug($debug); $resp = $client->send($msg); if (!$resp) { echo 'Communication error: ' . $client->errstr; exit(1); } if ($resp->faultCode()) { /* * Display problems that have been gracefully cought and * reported by the xmlrpc.php script */ echo 'Fault Code: ' . $resp->faultCode() . "\n"; echo 'Fault Reason: ' . $resp->faultString() . "\n"; exit(1); } $val = $resp->value(); XML_RPC_Dump($val); XML_RPC/tests/allgot.inc 0000644 00000002400 15004366340 0011024 0 ustar 00 <?php /** * Parses the "return" value from some of our test scripts. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: allgot.inc 293223 2010-01-07 15:32:19Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.4.4 */ ob_start(); function returnAllGot($params) { $out = ''; $count = count($params->params); for ($i = 0; $i < $count; $i++) { $param = $params->getParam($i); if (!XML_RPC_Value::isValue($param)) { $out .= "parameter $i was error: $param\n"; continue; } $got = XML_RPC_Decode($param); $out .= "param $i: " . var_export($got, true) . "\n"; } $val = new XML_RPC_Value($out, 'string'); return new XML_RPC_Response($val); } $server = new XML_RPC_Server( array( 'allgot' => array( 'function' => 'returnAllGot', ), ) ); $got = ob_get_clean(); if ($got == $expect) { echo "passed\n"; } else { echo "FAILED\n"; echo "Expected:\n$expect\n"; echo "Got:\n$got\n"; } XML_RPC/tests/empty-value-struct.php 0000644 00000003413 15004366340 0013357 0 ustar 00 <?php /** * Tests how the XML_RPC server handles a parameter with an empty struct without * any spaces in the XML after the empty value. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: empty-value-struct.php 300957 2010-07-02 23:55:00Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.4.4 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC/Server.php'; $GLOBALS['HTTP_RAW_POST_DATA'] = <<<EOPOST <?xml version="1.0"?> <methodCall> <methodName>allgot</methodName> <params> <param> <value> <struct> <member> <name>fld1</name><value></value></member></struct></value> </param> </params> </methodCall> EOPOST; $expect = <<<EOEXP <?xml version="1.0" encoding="UTF-8"?> <methodResponse> <params> <param> <value><string>param 0: array ( 'fld1' => '', ) </string></value> </param> </params> </methodResponse> EOEXP; include './allgot.inc'; XML_RPC/tests/empty-value.php 0000644 00000003371 15004366340 0012040 0 ustar 00 <?php /** * Tests how the XML_RPC server handles parameters with empty values. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: empty-value.php 300957 2010-07-02 23:55:00Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.4.4 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC/Server.php'; $GLOBALS['HTTP_RAW_POST_DATA'] = <<<EOPOST <?xml version="1.0"?> <methodCall> <methodName>allgot</methodName> <params> <param><value><string></string></value></param> <param><value>first</value></param> <param><value> </value></param> <param><value></value></param> </params> </methodCall> EOPOST; $expect = <<<EOEXP <?xml version="1.0" encoding="UTF-8"?> <methodResponse> <params> <param> <value><string>param 0: '' param 1: 'first' param 2: ' ' param 3: '' </string></value> </param> </params> </methodResponse> EOEXP; include './allgot.inc'; XML_RPC/tests/encode.php 0000644 00000004321 15004366340 0011021 0 ustar 00 <?php /** * Tests encoding values. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: extra-lines.php 293218 2010-01-07 14:20:08Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.5.3 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC.php'; $input = array(10, 11, 12); $expect = <<<EOT <?xml version="1.0" encoding="UTF-8"?> <methodCall> <methodName>nada</methodName> <params> <param> <value><array> <data> <value><int>10</int></value> <value><int>11</int></value> <value><int>12</int></value> </data> </array></value> </param> </params> </methodCall> EOT; $expect = trim(preg_replace("/\r\n/", "\n", $expect)); $msg = new XML_RPC_Message('nada', array(XML_RPC_encode($input))); $msg->createPayload(); $actual = trim(preg_replace("/\r\n/", "\n", $msg->payload)); if ($actual == $expect) { echo "passed\n"; } else { echo "PROBLEM\n"; echo $actual; } $msg = new XML_RPC_Message('nada', array( new XML_RPC_Value( array( new XML_RPC_Value(10, 'int'), new XML_RPC_Value(11, 'int'), new XML_RPC_Value(12, 'int'), ), 'array' ) ) ); $msg->createPayload(); $actual = trim(preg_replace("/\r\n/", "\n", $msg->payload)); if ($actual == $expect) { echo "passed\n"; } else { echo "PROBLEM\n"; echo $actual; } XML_RPC/tests/extra-lines.php 0000644 00000004311 15004366340 0012016 0 ustar 00 <?php /** * Tests how the XML_RPC server handles parameters with empty values. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: extra-lines.php 300958 2010-07-02 23:58:51Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.4.4 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC.php'; $input = "First lfs\n\nSecond crlfs\r\n\r\nThird crs\r\rFourth line"; $expect_removed = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<methodCall>\r\n<methodName>nada</methodName>\r\n<params>\r\n<param>\r\n<value><string>First lfs\r\nSecond crlfs\r\nThird crs\r\nFourth line</string></value>\r\n</param>\r\n</params>\r\n</methodCall>\r\n"; $expect_not_removed = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<methodCall>\r\n<methodName>nada</methodName>\r\n<params>\r\n<param>\r\n<value><string>First lfs\r\n\r\nSecond crlfs\r\n\r\nThird crs\r\n\r\nFourth line</string></value>\r\n</param>\r\n</params>\r\n</methodCall>\r\n"; $msg = new XML_RPC_Message('nada', array(XML_RPC_encode($input))); $msg->createPayload(); if ($msg->payload == $expect_removed) { echo "passed\n"; } else { echo "PROBLEM\n"; } $msg = new XML_RPC_Message('nada', array(XML_RPC_encode($input))); $msg->remove_extra_lines = false; $msg->createPayload(); if ($msg->payload == $expect_not_removed) { echo "passed\n"; } else { echo "PROBLEM\n"; } XML_RPC/tests/protoport.php 0000644 00000025007 15004366340 0011640 0 ustar 00 <?php /** * Tests that properties of XML_RPC_Client get properly set * * Any individual tests that fail will have their name, expected result * and actual result printed out. So seeing no output when executing * this file is a good thing. * * Can be run via CLI or a web server. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: protoport.php 300957 2010-07-02 23:55:00Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.2 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC.php'; /** * Compare the test result to the expected result * * If the test fails, echo out the results. * * @param array $expect the array of object properties you expect * from the test * @param object $actual the object results from the test * @param string $test_name the name of the test * * @return void */ function compare($expect, $actual, $test_name) { $actual = get_object_vars($actual); if (count(array_diff($actual, $expect))) { echo "$test_name failed.\nExpect: "; print_r($expect); echo "Actual: "; print_r($actual); echo "\n"; } } if (php_sapi_name() != 'cli') { echo "<pre>\n"; } $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 80, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver'); compare($x, $c, 'defaults'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 80, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'http://theserver'); compare($x, $c, 'defaults with http'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 443, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'https://theserver'); compare($x, $c, 'defaults with https'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 443, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'ssl://theserver'); compare($x, $c, 'defaults with ssl'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 65, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver', 65); compare($x, $c, 'port 65'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 65, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'http://theserver', 65); compare($x, $c, 'port 65 with http'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 65, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'https://theserver', 65); compare($x, $c, 'port 65 with https'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 65, 'proxy' => '', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'ssl://theserver', 65); compare($x, $c, 'port 65 with ssl'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 80, 'proxy' => 'theproxy', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver', 0, 'theproxy'); compare($x, $c, 'defaults proxy'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 80, 'proxy' => 'theproxy', 'proxy_protocol' => 'http://', 'proxy_port' => 8080, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'http://theserver', 0, 'http://theproxy'); compare($x, $c, 'defaults with http proxy'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 443, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 443, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'https://theserver', 0, 'https://theproxy'); compare($x, $c, 'defaults with https proxy'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 443, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 443, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'ssl://theserver', 0, 'ssl://theproxy'); compare($x, $c, 'defaults with ssl proxy'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 65, 'proxy' => 'theproxy', 'proxy_protocol' => 'http://', 'proxy_port' => 6565, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver', 65, 'theproxy', 6565); compare($x, $c, 'port 65 proxy 6565'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 65, 'proxy' => 'theproxy', 'proxy_protocol' => 'http://', 'proxy_port' => 6565, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'http://theserver', 65, 'http://theproxy', 6565); compare($x, $c, 'port 65 with http proxy 6565'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 65, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 6565, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'https://theserver', 65, 'https://theproxy', 6565); compare($x, $c, 'port 65 with https proxy 6565'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 65, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 6565, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'ssl://theserver', 65, 'ssl://theproxy', 6565); compare($x, $c, 'port 65 with ssl proxy 6565'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'ssl://', 'port' => 443, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 443, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver', 443, 'theproxy', 443); compare($x, $c, 'port 443 no protocol and proxy port 443 no protocol'); $x = array( 'path' => 'thepath', 'server' => 'theserver', 'protocol' => 'http://', 'port' => 80, 'proxy' => 'theproxy', 'proxy_protocol' => 'ssl://', 'proxy_port' => 6565, 'proxy_user' => '', 'proxy_pass' => '', 'errno' => 0, 'errstring' => '', 'debug' => 0, 'username' => '', 'password' => '', ); $c = new XML_RPC_Client('thepath', 'theserver', 0, 'ssl://theproxy', 6565); compare($x, $c, 'port 443 no protocol and proxy port 443 no protocol'); echo "\nIf no other output was produced, these tests passed.\n"; XML_RPC/tests/test_Dump.php 0000644 00000004130 15004366340 0011526 0 ustar 00 <?php /** * Actually performs an XML_RPC request. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: test_Dump.php 300962 2010-07-03 02:24:24Z danielc $ * @link http://pear.php.net/package/XML_RPC */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC/Dump.php'; $val = new XML_RPC_Value(array( 'title' =>new XML_RPC_Value('das ist der Titel', 'string'), 'startDate'=>new XML_RPC_Value(mktime(0,0,0,13,11,2004), 'dateTime.iso8601'), 'endDate' =>new XML_RPC_Value(mktime(0,0,0,15,11,2004), 'dateTime.iso8601'), 'arkey' => new XML_RPC_Value( array( new XML_RPC_Value('simple string'), new XML_RPC_Value(12345, 'int') ), 'array') ) ,'struct'); XML_RPC_Dump($val); echo '==============' . "\r\n"; $val2 = new XML_RPC_Value(44353, 'int'); XML_RPC_Dump($val2); echo '==============' . "\r\n"; $val3 = new XML_RPC_Value('this should be a string', 'string'); XML_RPC_Dump($val3); echo '==============' . "\r\n"; $val4 = new XML_RPC_Value(true, 'boolean'); XML_RPC_Dump($val4); echo '==============' . "\r\n"; echo 'Next we will test the error handling...' . "\r\n"; $val5 = new XML_RPC_Value(array( 'foo' => 'bar' ), 'struct'); XML_RPC_Dump($val5); echo '==============' . "\r\n"; echo 'DONE' . "\r\n"; XML_RPC/tests/types.php 0000644 00000004767 15004366340 0010746 0 ustar 00 <?php /** * Tests how the XML_RPC server handles a bunch of different parameter * data types. * * PHP versions 4 and 5 * * @category Web Services * @package XML_RPC * @author Daniel Convissor <danielc@php.net> * @copyright 2005-2010 The PHP Group * @license http://www.php.net/license/3_01.txt PHP License * @version SVN: $Id: types.php 300957 2010-07-02 23:55:00Z danielc $ * @link http://pear.php.net/package/XML_RPC * @since File available since Release 1.4.4 */ /* * If the package version number is found in the left hand * portion of the if() expression below, that means this file has * come from the PEAR installer. Therefore, let's test the * installed version of XML_RPC which should be in the include path. * * If the version has not been substituted in the if() expression, * this file has likely come from a SVN checkout or a .tar file. * Therefore, we'll assume the tests should use the version of * XML_RPC that has come from there as well. */ if ('1.5.5' == '@'.'package_version'.'@') { ini_set('include_path', '../' . PATH_SEPARATOR . '.' . PATH_SEPARATOR . ini_get('include_path') ); } require_once 'XML/RPC/Server.php'; $GLOBALS['HTTP_RAW_POST_DATA'] = <<<EOPOST <?xml version="1.0"?> <methodCall> <methodName>allgot</methodName> <params> <param><value>default to string</value></param> <param><value><string>inside string</string></value></param> <param><value><int>8</int></value></param> <param><value><datetime.iso8601>20050809T01:33:44</datetime.iso8601></value></param> <param> <value> <array> <data> <value> <string>a</string> </value> <value> <string>b</string> </value> </data> </array> </value> </param> <param> <value> <struct> <member> <name>a</name> <value> <string>ay</string> </value> </member> <member> <name>b</name> <value> <string>be</string> </value> </member> </struct> </value> </param> </params> </methodCall> EOPOST; $expect = <<<EOEXP <?xml version="1.0" encoding="UTF-8"?> <methodResponse> <params> <param> <value><string>param 0: 'default to string' param 1: 'inside string' param 2: '8' param 3: '20050809T01:33:44' param 4: array ( 0 => 'a', 1 => 'b', ) param 5: array ( 'a' => 'ay', 'b' => 'be', ) </string></value> </param> </params> </methodResponse> EOEXP; include './allgot.inc'; XML_Util/tests/AbstractUnitTests.php 0000644 00000000650 15004366340 0013504 0 ustar 00 <?php /* * Allow for PHPUnit 4.* while XML_Util is still usable on PHP 5.4 */ if (!class_exists('PHPUnit_Framework_TestCase')) { class PHPUnit_Framework_TestCase extends \PHPUnit\Framework\TestCase {} } abstract class AbstractUnitTests extends \PHPUnit_Framework_TestCase { public function setUp() { // ensure the class is defined, and thus its constants are declared new XML_Util(); } } XML_Util/tests/ApiVersionTests.php 0000644 00000000335 15004366340 0013160 0 ustar 00 <?php class ApiVersionTests extends AbstractUnitTests { /** * @covers XML_Util::apiVersion() */ public function testApiVersion() { $this->assertEquals('1.4', XML_Util::apiVersion()); } } XML_Util/tests/AttributesToStringTests.php 0000644 00000017026 15004366340 0014726 0 ustar 00 <?php class AttributesToStringTests extends AbstractUnitTests { /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringBasicUsage() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " boo=\"baz\" foo=\"bar\""; $this->assertEquals($expected, XML_Util::attributesToString($original)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithExplicitSortTrue() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " boo=\"baz\" foo=\"bar\""; $sort = true; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithExplicitSortFalse() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " foo=\"bar\" boo=\"baz\""; $sort = false; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithMultilineFalse() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " boo=\"baz\" foo=\"bar\""; $sort = true; $multiline = false; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithMultilineTrue() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = <<< EOF boo="baz" foo="bar" EOF; $sort = true; $multiline = true; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithExplicitIndent() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " boo=\"baz\"\n foo=\"bar\""; $sort = true; $multiline = true; $indent = ' '; // 8 spaces $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $indent)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithExplicitLinebreak() { $original = array('foo' => 'bar','boo' => 'baz',); $expected = " boo=\"baz\"\n^foo=\"bar\""; $sort = true; $multiline = true; $linebreak = '^'; // some dummy character $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $linebreak)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithOptionsThatIncludesSort() { $original = array('foo' => 'bar','boo' => 'baz',); $options = array( 'multiline' => true, 'indent' => '----', 'linebreak' => "^", 'entities' => XML_UTIL_ENTITIES_XML, 'sort' => true, ); $expected = " boo=\"baz\"\n----foo=\"bar\""; $this->assertEquals($expected, XML_Util::attributesToString($original, $options)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithOptionsThatExcludesSort() { $original = array('foo' => 'bar','boo' => 'baz',); $options = array( 'multiline' => true, 'indent' => '----', 'linebreak' => "^", 'entities' => XML_UTIL_ENTITIES_XML, ); $expected = " boo=\"baz\"\n----foo=\"bar\""; $this->assertEquals($expected, XML_Util::attributesToString($original, $options)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithEntitiesNone() { $original = array("foo" => "b@&r", "boo" => "b><z"); $expected = " boo=\"b><z\" foo=\"b@&r\""; $sort = true; $multiline = false; $linebreak = ' '; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $linebreak, PHP_EOL, XML_UTIL_ENTITIES_NONE)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithEntitiesXml() { $original = array("foo" => "b@&r", "boo" => "b><z"); $expected = " boo=\"b><z\" foo=\"b@&r\""; $sort = true; $multiline = false; $linebreak = ' '; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $linebreak, PHP_EOL, XML_UTIL_ENTITIES_XML)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithEntitiesXmlRequired() { $original = array("foo" => "b@&r", "boo" => "b><z"); $expected = " boo=\"b><z\" foo=\"b@&r\""; $sort = true; $multiline = false; $linebreak = ' '; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $linebreak, PHP_EOL, XML_UTIL_ENTITIES_XML_REQUIRED)); } /** * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithEntitiesHtml() { $original = array("foo" => "b@&r", "boo" => "b><z"); $expected = " boo=\"b><z\" foo=\"b@&r\""; $sort = true; $multiline = false; $linebreak = ' '; $this->assertEquals($expected, XML_Util::attributesToString($original, $sort, $multiline, $linebreak, PHP_EOL, XML_UTIL_ENTITIES_HTML)); } /** * Tag attributes should not be treated as CDATA, * so the operation will instead quietly use XML_UTIL_ENTITIES_XML. * * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithCDataSectionForSingleAttribute() { $original = array('foo' => 'bar'); // need exactly one attribute here $options = array( 'sort' => true, // doesn't matter for this testcase 'multiline' => false, // doesn't matter for this testcase 'indent' => null, // doesn't matter for this testcase 'linebreak' => null, // doesn't matter for this testcase 'entities' => XML_UTIL_CDATA_SECTION, // DOES matter for this testcase ); $expected = " foo=\"bar\""; $this->assertEquals($expected, XML_Util::attributesToString($original, $options)); } /** * Tag attributes should not be treated as CDATA, * so the operation will instead quietly use XML_UTIL_ENTITIES_XML. * * @covers XML_Util::attributesToString() */ public function testAttributesToStringWithCDataSectionForMultipleAttributesAndMultilineFalse() { $original = array('foo' => 'bar', 'boo' => 'baz'); // need more than one attribute here $options = array( 'sort' => true, // doesn't matter for this testcase 'multiline' => false, // DOES matter for this testcase, must be false 'indent' => null, // doesn't matter for this testcase 'linebreak' => null, // doesn't matter for this testcase 'entities' => XML_UTIL_CDATA_SECTION, // DOES matter for this testcase ); $expected = " boo=\"baz\" foo=\"bar\""; $this->assertEquals($expected, XML_Util::attributesToString($original, $options)); } } XML_Util/tests/Bug18343Tests.php 0000644 00000003316 15004366340 0012223 0 ustar 00 <?php /** * Bug #18343 "Entities in file names decoded during packaging" * * No matter what flags are given to createTagFromArray(), * an attribute must *always* be at least ENTITIES_XML encoded. * * @link https://pear.php.net/bugs/bug.php?id=18343 */ class Bug18343Tests extends AbstractUnitTests { private $tagArray = array( "qname" => "install", "attributes" => array( "as" => "Horde/Feed/fixtures/lexicon/http-p.moreover.com-cgi-local-page%2Fo=rss&s=Newsweek", "name" => "test/Horde/Feed/fixtures/lexicon/http-p.moreover.com-cgi-local-page%2Fo=rss&s=Newsweek", ) ); public function getFlagsToTest() { new XML_Util(); // for constants to be declared return array( array('no flag', null), array('false', false), array('ENTITIES_NONE', XML_UTIL_ENTITIES_NONE), array('ENTITIES_XML', XML_UTIL_ENTITIES_XML), array('ENTITIES_XML_REQUIRED', XML_UTIL_ENTITIES_XML_REQUIRED), array('ENTITIES_HTML', XML_UTIL_ENTITIES_HTML), array('REPLACE_ENTITIES', XML_UTIL_REPLACE_ENTITIES), ); } /** * @dataProvider getFlagsToTest() */ public function testCreateTagFromArrayForBug18343($key, $flag) { // all flags for the candidate input should return the same result $expected = <<< EOF <install as="Horde/Feed/fixtures/lexicon/http-p.moreover.com-cgi-local-page%2Fo=rss&s=Newsweek" name="test/Horde/Feed/fixtures/lexicon/http-p.moreover.com-cgi-local-page%2Fo=rss&s=Newsweek" /> EOF; $this->assertEquals($expected, XML_Util::createTagFromArray($this->tagArray, $flag), "Failed bugcheck for $key."); } } XML_Util/tests/Bug21177Tests.php 0000644 00000002036 15004366340 0012220 0 ustar 00 <?php /** * Bug #21177 "XML_Util::collapseEmptyTags() can return NULL" * * PREG returns NULL when it encounters an error. * In this case, it was encountering PREG_BACKTRACK_LIMIT_ERROR. * * @link https://pear.php.net/bugs/bug.php?id=21177 */ class Bug21177Tests extends AbstractUnitTests { public function getTestCandidate() { $expected = '<id_mytest_yesorno />'; return array( array('<idmytestyesorno></idmytestyesorno>', '<idmytestyesorno />'), array('<idmytestyesorno />', '<idmytestyesorno />'), array('<id_mytest_yesorno></id_mytest_yesorno>', '<id_mytest_yesorno />'), array('<id_mytest_yesorno />', '<id_mytest_yesorno />'), ); } /** * @dataProvider getTestCandidate() */ public function testCollapseEmptyTagsForBug21177($original, $expected) { $this->assertEquals($expected, XML_Util::collapseEmptyTags($original, XML_UTIL_COLLAPSE_ALL), "Failed bugcheck."); } } XML_Util/tests/Bug21184Tests.php 0000644 00000000702 15004366340 0012214 0 ustar 00 <?php /** * Bug #21184 * * PREG returns NULL when it encounters an error. * In this case, it was encountering PREG_BACKTRACK_LIMIT_ERROR. * * @link https://pear.php.net/bugs/bug.php?id=21177 */ class Bug21184 extends AbstractUnitTests { public function testBug21184() { $xml = '<XML_Serializer_Tag>one</XML_Serializer_Tag>'; $this->assertEquals($xml, XML_Util::collapseEmptyTags($xml, XML_UTIL_COLLAPSE_ALL)); } } XML_Util/tests/Bug4950Tests.php 0000644 00000001331 15004366340 0012135 0 ustar 00 <?php /** * Bug #4950 "Incorrect CDATA serializing" * * Content that looks like CDATA end characters and tags * should still be recognized solely as content text. * * @link https://pear.php.net/bugs/bug.php?id=4950 */ class Bug4950Tests extends AbstractUnitTests { public function testCreateTagForBug4950() { $qname = "test"; $attributes = array(); $content = "Content ]]></test> here!"; $namespaceUrl = null; $expected = "<test><![CDATA[Content ]]]]><![CDATA[></test> here!]]></test>"; $result = XML_Util::createTag($qname, $attributes, $content, $namespaceUrl, XML_UTIL_CDATA_SECTION); $this->assertEquals($expected, $result, "Failed bugcheck."); } } XML_Util/tests/Bug5392Tests.php 0000644 00000001377 15004366340 0012150 0 ustar 00 <?php /** * Bug #5392 "encoding of ISO-8859-1 is the only supported encoding" * * Original characters of the given encoding that are "replaced" * should then "reverse" back to perfectly match the original. * * @link https://pear.php.net/bugs/bug.php?id=5392 */ class Bug5392Tests extends AbstractUnitTests { public function testReplaceEntitiesForBug5392() { $original = 'This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê'; $replacedResult = XML_Util::replaceEntities($original, XML_UTIL_ENTITIES_HTML, "UTF-8"); $reversedResult = XML_Util::reverseEntities($replacedResult, XML_UTIL_ENTITIES_HTML, "UTF-8"); $this->assertEquals($original, $reversedResult, "Failed bugcheck."); } } XML_Util/tests/CollapseEmptyTagsTests.php 0000644 00000010401 15004366340 0014474 0 ustar 00 <?php class CollapseEmptyTagsTests extends AbstractUnitTests { /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsBasicUsage() { $emptyTag = "<foo></foo>"; $expected = "<foo />"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsBasicUsageAlongsideNonemptyTag() { $emptyTag = "<foo></foo>"; $otherTag = "<bar>baz</bar>"; $expected = "<foo /><bar>baz</bar>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagWithCollapseAll() { $emptyTag = "<foo></foo>"; $expected = "<foo />"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag, XML_UTIL_COLLAPSE_ALL)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagAlongsideNonemptyTagWithCollapseAll() { $emptyTag = "<foo></foo>"; $otherTag = "<bar>baz</bar>"; $expected = "<foo /><bar>baz</bar>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag, XML_UTIL_COLLAPSE_ALL)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagAlongsideNonemptyTagAlongsideEmptyTagWithCollapseAll() { $emptyTag = "<foo></foo>"; $otherTag = "<bar>baz</bar>"; $expected = "<foo /><bar>baz</bar><foo />"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag . $emptyTag, XML_UTIL_COLLAPSE_ALL)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyPrefixedTagAlongsideNonemptyTagAlongsideEmptyPrefixedTagWithCollapseAll() { $emptyTag = "<foo:foo2></foo:foo2>"; $otherTag = "<bar>baz</bar>"; $expected = "<foo:foo2 /><bar>baz</bar><foo:foo2 />"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag . $emptyTag, XML_UTIL_COLLAPSE_ALL)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyNsPrefixedTagAlongsideNonemptyTagAlongsideEmptyNsPrefixedTagWithCollapseAll() { $emptyTag = "<http://foo.com:foo2></http://foo.com:foo2>"; $otherTag = "<bar>baz</bar>"; $expected = "<http://foo.com:foo2 /><bar>baz</bar><http://foo.com:foo2 />"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag . $emptyTag, XML_UTIL_COLLAPSE_ALL)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagWithCollapseXhtml() { $emptyTag = "<foo></foo>"; $expected = "<foo></foo>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag, XML_UTIL_COLLAPSE_XHTML_ONLY)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagAlongsideNonemptyTagWithCollapseXhtml() { $emptyTag = "<foo></foo>"; $otherTag = "<bar>baz</bar>"; $xhtmlTag = "<br></br>"; $expected = "<foo></foo><br /><bar>baz</bar>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $xhtmlTag . $otherTag, XML_UTIL_COLLAPSE_XHTML_ONLY)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagWithCollapseNone() { $emptyTag = "<foo></foo>"; $expected = "<foo></foo>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag, XML_UTIL_COLLAPSE_NONE)); } /** * @covers XML_Util::collapseEmptyTags() */ public function testCollapseEmptyTagsOnOneEmptyTagAlongsideNonemptyTagWithCollapseNone() { $emptyTag = "<foo></foo>"; $otherTag = "<bar>baz</bar>"; $expected = "<foo></foo><bar>baz</bar>"; $this->assertEquals($expected, XML_Util::collapseEmptyTags($emptyTag . $otherTag, XML_UTIL_COLLAPSE_NONE)); } } XML_Util/tests/CreateCDataSectionTests.php 0000644 00000000552 15004366340 0014527 0 ustar 00 <?php class CreateCDataSectionTests extends AbstractUnitTests { /** * @covers XML_Util::createCDataSection() */ public function testCreateCDataSectionBasicUsage() { $original = "I am content."; $expected ="<![CDATA[I am content.]]>"; $this->assertEquals($expected, XML_Util::createCDataSection($original)); } } XML_Util/tests/CreateCommentTests.php 0000644 00000000524 15004366340 0013627 0 ustar 00 <?php class CreateCommentTests extends AbstractUnitTests { /** * @covers XML_Util::createComment() */ public function testCreateCommentBasicUsage() { $original = "I am comment."; $expected = "<!-- I am comment. -->"; $this->assertEquals($expected, XML_Util::createComment($original)); } } XML_Util/tests/CreateEndElementTests.php 0000644 00000001145 15004366340 0014245 0 ustar 00 <?php class CreateEndElementTests extends AbstractUnitTests { /** * @covers XML_Util::createEndElement() */ public function testCreateEndElementBasicUsage() { $original = "myTag"; $expected = "</myTag>"; $this->assertEquals($expected, XML_Util::createEndElement($original)); } /** * @covers XML_Util::createEndElement() */ public function testCreateEndElementWithNamespacedTag() { $original = "myNs:myTag"; $expected = "</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createEndElement($original)); } } XML_Util/tests/CreateStartElementTests.php 0000644 00000012442 15004366340 0014636 0 ustar 00 <?php class CreateStartElementTests extends AbstractUnitTests { /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagOnly() { $original = "myNs:myTag"; $expected = "<myNs:myTag>"; $this->assertEquals($expected, XML_Util::createStartElement($original)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributes() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $expected = "<myNs:myTag foo=\"bar\">"; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithEmptyAttributes() { $originalTag = "myNs:myTag"; $originalAttributes = ""; $expected = "<myNs:myTag>"; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespace() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\" xmlns:myNs=\"http://www.w3c.org/myNs#\">"; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithEmptyAttributesAndNonUriNamespace() { $originalTag = "myTag"; $originalAttributes = ""; $originalNamespace = "foo"; $expected = "<myTag xmlns=\"foo\">"; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespaceWithMultiline() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = <<< EOF <myNs:myTag foo="bar" xmlns:myNs="http://www.w3c.org/myNs#"> EOF; $multiline = true; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace, $multiline)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespaceWithMultilineAndIndent() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = <<< EOF <myNs:myTag foo="bar" xmlns:myNs="http://www.w3c.org/myNs#"> EOF; $multiline = true; $indent = " "; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace, $multiline, $indent)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespaceWithMultilineAndIndentAndLinebreak() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">"; $multiline = true; $indent = " "; $linebreak = "^"; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace, $multiline, $indent, $linebreak)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespaceWithMultilineAndIndentAndLinebreakAndSortAttributesIsTrue() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar", "boo" => "baz"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag boo=\"baz\"^ foo=\"bar\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">"; $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = true; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace, $multiline, $indent, $linebreak, $sortAttributes)); } /** * @covers XML_Util::createStartElement() */ public function testCreateStartElementForTagWithAttributesAndNamespaceWithMultilineAndIndentAndLinebreakAndSortAttributesIsFalse() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar", "boo" => "baz"); $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\"^ boo=\"baz\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">"; $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = false; $this->assertEquals($expected, XML_Util::createStartElement($originalTag, $originalAttributes, $originalNamespace, $multiline, $indent, $linebreak, $sortAttributes)); } } XML_Util/tests/CreateTagFromArrayTests.php 0000644 00000032264 15004366340 0014571 0 ustar 00 <?php class CreateTagFromArrayTests extends AbstractUnitTests { /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQname() { $original = array( "qname" => "foo:bar", ); $expected = "<foo:bar />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespace() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", ); $expected = "<foo:bar xmlns:foo=\"http://foo.com\" />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributes() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), ); $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\" xmlns:foo=\"http://foo.com\" />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContent() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\" xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndAttributesAndContent() { $original = array( "qname" => "foo:bar", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndContent() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "content" => "I'm inside the tag", ); $expected = "<foo:bar xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithEntitiesNone() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\" xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_ENTITIES_NONE)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntities() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\" xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineFalse() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = false; $expected = "<foo:bar argh=\"fruit&vegetable\" key=\"value\" xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineTrue() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = true; $expected = <<< EOF <foo:bar argh="fruit&vegetable" key="value" xmlns:foo="http://foo.com">I'm inside the tag</foo:bar> EOF; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineTrueAndIndent() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = true; $indent = " "; $expected = <<< EOF <foo:bar argh="fruit&vegetable" key="value" xmlns:foo="http://foo.com">I'm inside the tag</foo:bar> EOF; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreak() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = true; $indent = " "; $linebreak = "^"; $expected = "<foo:bar argh=\"fruit&vegetable\"^ key=\"value\"^ xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreakAndSortAttributesTrue() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = true; $expected = "<foo:bar argh=\"fruit&vegetable\"^ key=\"value\"^ xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak, $sortAttributes)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameAndNamespaceAndAttributesAndContentWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreakAndSortAttributesFalse() { $original = array( "qname" => "foo:bar", "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = false; $expected = "<foo:bar key=\"value\"^ argh=\"fruit&vegetable\"^ xmlns:foo=\"http://foo.com\">I'm inside the tag</foo:bar>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak, $sortAttributes)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithInvalidArray() { $badArray = array( "foo" => "bar", ); $expectedError = "You must either supply a qualified name (qname) or local tag name (localPart)."; $this->assertEquals($expectedError, XML_Util::createTagFromArray($badArray)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithNamespaceAndAttributesAndContentButWithoutQname() { $original = array( "namespaceUri" => "http://foo.com", "attributes" => array( "key" => "value", "argh" => "fruit&vegetable" ), "content" => "I'm inside the tag", ); $expectedError = "You must either supply a qualified name (qname) or local tag name (localPart)."; $this->assertEquals($expectedError, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithNonScalarContent() { $badArray = array( 'content' => array('foo', 'bar'), ); $expectedError = "Supplied non-scalar value as tag content"; $this->assertEquals($expectedError, XML_Util::createTagFromArray($badArray)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithArrayOfNamespaces() { $original = array( 'qname' => 'foo:bar', 'namespaces' => array('ns1' => 'uri1', 'ns2' => 'uri2'), ); $expected = "<foo:bar xmlns:ns1=\"uri1\" xmlns:ns2=\"uri2\" />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameDerivedFromNamespaceUriAndLocalPart() { $original = array( 'namespaceUri' => 'http://bar.org', 'localPart' => 'foo' ); $expected = "<foo xmlns=\"http://bar.org\" />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameDerivedFromNamespaceAndLocalPart() { $original = array( 'namespace' => 'http://foo.org', 'localPart' => 'bar' ); $expected = "<http://foo.org:bar />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithQnameDerivedFromLocalPart() { $original = array( 'namespace' => '', 'localPart' => 'bar' ); $expected = "<bar />"; $this->assertEquals($expected, XML_Util::createTagFromArray($original)); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayWithImplicitlyEmptyContentAndCollapseNoneDoesNotCollapseTag() { $original = array('qname' => 'tag1'); $expected = "<tag1></tag1>"; $actual = XML_Util::createTagFromArray( $original, XML_UTIL_REPLACE_ENTITIES, // default $replaceEntities false, // default $multiline '_auto', // default $indent "\n", // default $linebreak true, // default $sortAttributes XML_UTIL_COLLAPSE_NONE ); $this->assertEquals($expected, $actual); } /** * @covers XML_Util::createTagFromArray() */ public function testCreateTagFromArrayForCdataWithExplicitlyEmptyContentDoesNotCollapseTag() { $original = array('qname' => 'tag1', 'content' => ''); $expected = "<tag1><![CDATA[]]></tag1>"; $this->assertEquals($expected, XML_Util::createTagFromArray($original, XML_UTIL_CDATA_SECTION)); } } XML_Util/tests/CreateTagTests.php 0000644 00000017452 15004366340 0012750 0 ustar 00 <?php class CreateTagTests extends AbstractUnitTests { /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributes() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $expected = "<myNs:myTag foo=\"bar\" />"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContent() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag"; $expected = "<myNs:myTag foo=\"bar\">This is inside the tag</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespace() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag"; $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\" xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithCDataSection() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\" xmlns:myNs=\"http://www.w3c.org/myNs#\"><![CDATA[This is inside the tag and has < & @ > in it]]></myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_CDATA_SECTION)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntities() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $expected = "<myNs:myTag foo=\"bar\" xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag and has < & @ > in it</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineFalse() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = false; $expected = "<myNs:myTag foo=\"bar\" xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag and has < & @ > in it</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineTrue() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = true; $expected = <<< EOF <myNs:myTag foo="bar" xmlns:myNs="http://www.w3c.org/myNs#">This is inside the tag and has < & @ > in it</myNs:myTag> EOF; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineTrueAndIndent() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = true; $indent = " "; $expected = <<< EOF <myNs:myTag foo="bar" xmlns:myNs="http://www.w3c.org/myNs#">This is inside the tag and has < & @ > in it</myNs:myTag> EOF; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreak() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = true; $indent = " "; $linebreak = "^"; $expected = "<myNs:myTag foo=\"bar\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag and has < & @ > in it</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreakAndSortAttributesTrue() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar", "boo" => "baz"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = true; $expected = "<myNs:myTag boo=\"baz\"^ foo=\"bar\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag and has < & @ > in it</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak, $sortAttributes)); } /** * @covers XML_Util::createTag() */ public function testCreateTagForTagWithAttributesAndContentAndNamespaceWithReplaceEntitiesAndMultilineTrueAndIndentAndLinebreakAndSortAttributesFalse() { $originalTag = "myNs:myTag"; $originalAttributes = array("foo" => "bar", "boo" => "baz"); $originalContent = "This is inside the tag and has < & @ > in it"; $originalNamespace = "http://www.w3c.org/myNs#"; $multiline = true; $indent = " "; $linebreak = "^"; $sortAttributes = false; $expected = "<myNs:myTag foo=\"bar\"^ boo=\"baz\"^ xmlns:myNs=\"http://www.w3c.org/myNs#\">This is inside the tag and has < & @ > in it</myNs:myTag>"; $this->assertEquals($expected, XML_Util::createTag($originalTag, $originalAttributes, $originalContent, $originalNamespace, XML_UTIL_REPLACE_ENTITIES, $multiline, $indent, $linebreak, $sortAttributes)); } } XML_Util/tests/GetDocTypeDeclarationTests.php 0000644 00000003363 15004366340 0015262 0 ustar 00 <?php class GetDocTypeDeclarationTests extends AbstractUnitTests { /** * @covers XML_Util::getDocTypeDeclaration() */ public function testGetDocTypeDeclarationUsingRoot() { $expected = "<!DOCTYPE rootTag>"; $this->assertEquals($expected, XML_Util::getDocTypeDeclaration("rootTag")); } /** * @covers XML_Util::getDocTypeDeclaration() */ public function testGetDocTypeDeclarationUsingRootAndStringUri() { $expected = "<!DOCTYPE rootTag SYSTEM \"myDocType.dtd\">"; $this->assertEquals($expected, XML_Util::getDocTypeDeclaration("rootTag", "myDocType.dtd")); } /** * @covers XML_Util::getDocTypeDeclaration() */ public function testGetDocTypeDeclarationUsingRootAndArrayUri() { $uri = array( 'uri' => 'http://pear.php.net/dtd/package-1.0', 'id' => '-//PHP//PEAR/DTD PACKAGE 0.1' ); $expected = "<!DOCTYPE rootTag PUBLIC \"-//PHP//PEAR/DTD PACKAGE 0.1\" \"http://pear.php.net/dtd/package-1.0\">"; $this->assertEquals($expected, XML_Util::getDocTypeDeclaration("rootTag", $uri)); } /** * @covers XML_Util::getDocTypeDeclaration() */ public function testGetDocTypeDeclarationUsingRootAndArrayUriAndInternalDtd() { $uri = array( 'uri' => 'http://pear.php.net/dtd/package-1.0', 'id' => '-//PHP//PEAR/DTD PACKAGE 0.1' ); $dtdEntry = '<!ELEMENT additionalInfo (#PCDATA)>'; $expected = <<< EOF <!DOCTYPE rootTag PUBLIC "-//PHP//PEAR/DTD PACKAGE 0.1" "http://pear.php.net/dtd/package-1.0" [ <!ELEMENT additionalInfo (#PCDATA)> ]> EOF; $this->assertEquals($expected, XML_Util::getDocTypeDeclaration("rootTag", $uri, $dtdEntry)); } } XML_Util/tests/GetXmlDeclarationTests.php 0000644 00000002214 15004366340 0014445 0 ustar 00 <?php class GetXMLDeclarationTests extends AbstractUnitTests { /** * @covers XML_Util::getXMLDeclaration() */ public function testGetXMLDeclarationUsingVersion() { $version = "1.0"; $expected = "<?xml version=\"1.0\"?>"; $this->assertEquals($expected, XML_Util::getXMLDeclaration($version)); } /** * @covers XML_Util::getXMLDeclaration() */ public function testGetXMLDeclarationUsingVersionAndEncodingAndStandalone() { $version = "1.0"; $encoding = "UTF-8"; $standalone = true; $expected = "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"yes\"?>"; $this->assertEquals($expected, XML_Util::getXMLDeclaration($version, $encoding, $standalone)); } /** * @covers XML_Util::getXMLDeclaration() */ public function testGetXMLDeclarationUsingVersionAndStandalone() { $version = "1.0"; $encoding = null; $standalone = true; $expected = "<?xml version=\"1.0\" standalone=\"yes\"?>"; $this->assertEquals($expected, XML_Util::getXMLDeclaration($version, $encoding, $standalone)); } } XML_Util/tests/IsValidNameTests.php 0000644 00000003677 15004366340 0013251 0 ustar 00 <?php class IsValidNameTests extends AbstractUnitTests { /** * @covers XML_Util::isValidName() */ public function testIsValidNameForTagNameThatIsValid() { $tagName = "alpha-x_y_z.123"; $result = XML_Util::isValidName($tagName); $this->assertTrue($result); } /** * @covers XML_Util::isValidName() */ public function testIsValidNameForTagNameWithInvalidCharacter() { $tagName = "invalidTag?"; $result = XML_Util::isValidName($tagName); $this->assertInstanceOf('PEAR_Error', $result); $expectedError = "XML names may only contain alphanumeric chars, period, hyphen, colon and underscores"; $this->assertEquals($expectedError, $result->getMessage()); } /** * @covers XML_Util::isValidName() */ public function testIsValidNameForTagNameWithInvalidStartingCharacter() { $tagName = "1234five"; $result = XML_Util::isValidName($tagName); $this->assertInstanceOf('PEAR_Error', $result); $expectedError = "XML names may only start with letter or underscore"; $this->assertEquals($expectedError, $result->getMessage()); } /** * @covers XML_Util::isValidName() */ public function testIsValidNameForInt() { $tagName = 1; $result = XML_Util::isValidName($tagName); $this->assertInstanceOf('PEAR_Error', $result); $expectedError = "XML names may only start with letter or underscore"; $this->assertEquals($expectedError, $result->getMessage()); } /** * @covers XML_Util::isValidName() */ public function testIsValidNameForEmptyString() { $tagName = ''; $result = XML_Util::isValidName($tagName); $this->assertInstanceOf('PEAR_Error', $result); $expectedError = "XML names may only start with letter or underscore"; $this->assertEquals($expectedError, $result->getMessage()); } } XML_Util/tests/RaiseErrorTests.php 0000644 00000000700 15004366340 0013152 0 ustar 00 <?php class RaiseErrorTests extends AbstractUnitTests { /** * @covers XML_Util::raiseError() */ public function testRaiseError() { $code = 12345; $message = "I am an error"; $error = XML_Util::raiseError($message, $code); $this->assertInstanceOf('PEAR_Error', $error); $this->assertEquals($message, $error->getMessage()); $this->assertEquals($code, $error->getCode()); } } XML_Util/tests/ReplaceEntitiesTests.php 0000644 00000010341 15004366340 0014157 0 ustar 00 <?php class ReplaceEntitiesTests extends AbstractUnitTests { protected function getSimpleData() { return 'This string contains < & >.'; } protected function getUtf8Data() { return 'This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê'; } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleData() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData())); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithInvalidOptionReturnsOriginalData() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), 'INVALID_OPTION')); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesXml() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesXmlAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML, $encoding)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForUtf8DataWithEntitiesXmlAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::replaceEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_XML, $encoding)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesXmlRequired() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML_REQUIRED)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesXmlRequiredAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML_REQUIRED, $encoding)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForUtf8DataWithEntitiesXmlRequiredAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::replaceEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_XML_REQUIRED, $encoding)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesHtml() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_HTML)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForSimpleDataWithEntitiesHtmlAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::replaceEntities($this->getSimpleData(), XML_UTIL_ENTITIES_HTML, $encoding)); } /** * @covers XML_Util::replaceEntities() */ public function testReplaceEntitiesForUtf8DataWithEntitiesHtmlAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::replaceEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_HTML, $encoding)); } } XML_Util/tests/ReverseEntitiesTests.php 0000644 00000010326 15004366340 0014222 0 ustar 00 <?php class ReverseEntitiesTests extends AbstractUnitTests { protected function getSimpleData() { return 'This string contains < & >.'; } protected function getUtf8Data() { return 'This data contains special chars like <, >, & and " as well as ä, ö, ß, à and ê'; } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleData() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData())); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithInvalidOptionReturnsOriginalData() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), 'INVALID_OPTION')); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesXml() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesXmlAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML), $encoding); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForUtf8DataWithEntitiesXmlAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and \" as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::reverseEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_XML), $encoding); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesXmlRequired() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML_REQUIRED)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesXmlRequiredAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_XML_REQUIRED, $encoding)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForUtf8DataWithEntitiesXmlRequiredAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and \" as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::reverseEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_XML_REQUIRED, $encoding)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesHtml() { $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_HTML)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForSimpleDataWithEntitiesHtmlAndEncoding() { $encoding = "UTF-8"; $expected = "This string contains < & >."; $this->assertEquals($expected, XML_Util::reverseEntities($this->getSimpleData(), XML_UTIL_ENTITIES_HTML, $encoding)); } /** * @covers XML_Util::reverseEntities() */ public function testReverseEntitiesForUtf8DataWithEntitiesHtmlAndEncoding() { $encoding = "UTF-8"; $expected = "This data contains special chars like <, >, & and \" as well as ä, ö, ß, à and ê"; $this->assertEquals($expected, XML_Util::reverseEntities($this->getUtf8Data(), XML_UTIL_ENTITIES_HTML, $encoding)); } } XML_Util/tests/SplitQualifiedNameTests.php 0000644 00000001507 15004366340 0014623 0 ustar 00 <?php class SplitQualifiedNameTests extends AbstractUnitTests { /** * @covers XML_Util::splitQualifiedName() */ public function testSplitQualifiedNameWithoutNamespace() { $original = "xslt:stylesheet"; $expected = array( 'namespace' => 'xslt', 'localPart' => 'stylesheet', ); $this->assertEquals($expected, XML_Util::splitQualifiedName($original)); } /** * @covers XML_Util::splitQualifiedName() */ public function testSplitQualifiedNameWithNamespace() { $original = "stylesheet"; $namespace = "myNs"; $expected = array( 'namespace' => 'myNs', 'localPart' => 'stylesheet', ); $this->assertEquals($expected, XML_Util::splitQualifiedName($original, $namespace)); } } __init__.py 0000644 00000000057 15004413005 0006647 0 ustar 00 # Dummy file to make this directory a package. __pycache__/__init__.cpython-311.pyc 0000644 00000000331 15004413005 0013202 0 ustar 00 � ��bg/ � � � d S )N� r � �l/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/__init__.py�<module>r s �� � r __pycache__/support.cpython-311.pyc 0000644 00000015253 15004413005 0013170 0 ustar 00 � ��bg� � �� � d Z ddlZddlZddlZddlZddlZ G d� de� � Z G d� de� � Z G d� de� � Z d Z dZ G d � d � � Z dd �Z dd �Zd� Z G d� dej � � ZdS )ziSupporting definitions for the Heapy regression test. Addapted from Python standard module test_support. � Nc � � e Zd ZdZdS )�Errorz*Base class for regression test exceptions.N��__name__� __module__� __qualname__�__doc__� � �k/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/support.pyr r s � � � � � �4�4�4�4r r c � � e Zd ZdZdS )� TestFailedz Test failed.Nr r r r r r s � � � � � ����r r c � � e Zd ZdZdS )� TestSkippeda! Test skipped. This can be raised to indicate that a test was deliberatly skipped, but not because a feature wasn't available. For example, if some resource can't be used, such as the network appears to be unavailable, this should be raised instead of TestFailed. Nr r r r r r s � � � � � �� � � r r � c � � e Zd Zd� ZdS )�BasicTestRunnerc �B � t j � � } ||� � |S �N)�unittest� TestResult)�self�test�results r �runzBasicTestRunner.run( s" � ��$�&�&�� ��V� � � �� r N)r r r r r r r r r ' s# � � � � � �� � � � r r c � � t r!t j t j d�� � }nt � � }|� | � � }|� � � s�t |j � � dk r|j s|j d d }nYt |j � � dk r|j s|j d d }n&|�d}nd|j �d|j ��}t |� � �t |� � �dS ) z2Run tests from a unittest.TestSuite-derived class.� )� verbosityr r Nz0errors occurred; run in verbose mode for detailszerrors occurred in �.)�verboser �TextTestRunner�sys�stdoutr r � wasSuccessful�len�errors�failuresr r r )�suite� testclass�runnerr �err�msgs r � run_suiter- . s � �� #��(���q�A�A�A��� �"�"�� �Z�Z�� � �F� � � � !� !� � �v�}� � �� "� "�6�?� "��-��"�1�%�C�C� �� � !� !�Q� &� &�v�}� &��/�!�$�Q�'�C�C�� �H��� !� #�-�-�-�y�/A�/A�C�� �S�/�/� !���o�o� � � r c �~ � t j | � � }|r|� � � dS t || � � dS )z1Run tests from a unittest.TestCase-derived class.N)r � makeSuite�debugr- )r) r0 r( s r � run_unittestr1 E sA � � � �y� )� )�E� � $� � � � � � � � ��%��#�#�#�#�#r c �( � t | d�� � dS )z4 Debug tests from a unittest.TestCase-derived class.r )r0 N)r1 )r) s r �debug_unittestr3 N s � ���!�$�$�$�$�$�$r c �L � e Zd Zd� Zd d�Zd d�Zd� Zej d d�� � Z dS ) �TestCasec �b � ddl m} |� � | _ | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ | j j | _ t j | _ d S )Nr )�Root) �guppyr7 �python�heapy�Part�ImpSet�Use�View�iso�idsetr" � version_info)r r7 s r �setUpzTestCase.setUpU s� � � � � � � � ��d�f�f�� ��[�&�� ��Z�%�� ��J�O�� ��j�'�� ��:�>����J�O�� ��8�<����X�^�� � � ,����r r c �� � ||k rXt d|� � t d|� � |dk r4|dk rt j � � d S | � d� � d S d S d S )Nzaseq: Expected: b = �Got actually : a = r ��print�pdb� set_trace� assertTrue�r �a�b�conts r �aseqz TestCase.aseqb st � � ��6�6� �(�!� ,� ,� ,� �(�!� ,� ,� ,��q�y�y��!�8�8��M�O�O�O�O�O��O�O�A�&�&�&�&�&� �6� �yr c �� � ||urXt d|� � t d|� � |dk r4|dk rt j � � d S | � d� � d S d S d S )Nzasis: Expected: b = rD r rE rJ s r �asisz TestCase.asisl st � � �A�:�:� �(�!� ,� ,� ,� �(�!� ,� ,� ,��q�y�y��!�8�8��M�O�O�O�O�O��O�O�A�&�&�&�&�&� �:� �yr c � � d S r r )r s r �tearDownzTestCase.tearDownv s � � �r Tc # � K � t j � � }d� } || � � d V � ||� � d S # ||� � w xY w)Nc � � t j � � }|| k rd S | rt j � � d S t j � � d S r )� tracemalloc� is_tracing�start�stop)� new_enabled� cur_enableds r � set_enabledz/TestCase.tracemalloc_state.<locals>.set_enabled} sR � �%�0�2�2�K��k�)�)���� #��!�#�#�#�#�#�� �"�"�"�"�"r )rU rV )�enabled� orig_enabledr[ s r �tracemalloc_statezTestCase.tracemalloc_statey so � � � �"�-�/�/� � #� #� #� � �G� � � � &� �E�E�E� �K� � %� %� %� %� %��K�K� � %� %� %� %���s �6 � AN�r )T) r r r rB rN rP rR � contextlib�contextmanagerr^ r r r r5 r5 T s~ � � � � � � -� -� -�'� '� '� '�'� '� '� '� � � � � �&� &� &� � �&� &� &r r5 r r_ )r r` r rG r" rU � Exceptionr r r r � use_resourcesr r- r1 r3 r5 r r r �<module>rd sd ��� � � � � � ���� � � � � � � � � � � � �5� 5� 5� 5� 5�I� 5� 5� 5�� � � � �� � � �� � � � �%� � � � ��� �� � � � � � � � � � � �.$� $� $� $�%� %� %� 8&� 8&� 8&� 8&� 8&�x� � 8&� 8&� 8&� 8&� 8&r __pycache__/test_Classifiers.cpython-311.pyc 0000644 00000157263 15004413005 0014772 0 ustar 00 � ��bg�q � �� � d dl mZ d dlZdZ G d� dej � � Z G d� de� � Z G d� d e� � Z G d � d e� � Z G d � d e� � Z G d� de� � Z dd�Z dS )� )�supportN� c �, � e Zd Zd� Zd� Zd� Zd� Zd� ZdS )�TestCasec �� � t j � | � � d| j _ | j j x| _ }| j j x| _ }d|_ d� | _ |j j | _ |j | _ |j | _ |j | _ |j | _ |j | _ G d� d� � } G d� d� � } |� � }|| _ || _ || _ d S )NFzhp.c � � | j S �N)�dictof��xs �t/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_Classifiers.py�<lambda>z TestCase.setUp.<locals>.<lambda> s � �A�H� � c � � e Zd Zd� ZdS )�TestCase.setUp.<locals>.C1c � � dS )Nr � ��selfs r r z TestCase.setUp.<locals>.C1.x � � ��qr N��__name__� __module__� __qualname__r r r r �C1r �# � � � � � � � � � � r r c � � e Zd ZdS )�TestCase.setUp.<locals>.C2N�r r r r r r �C2r � � � � � � � �Dr r )r r �setUp�View�is_rg_update_all�heapy�UniSet�US�Use�reprefix�do�Anything�fam�un�Type�ty�Rcs�rc�iso�Nothingr r �c1)r r' r( r r r4 s r r" zTestCase.setUp s � ��� � �t�$�$�$�%*�� �"��z�(�(���"� �� �'���3� �� �$�$����,�"����(����'����7���� �� ��z�� � � � � � � � � � � � � � � � � � �R�T�T������������r c �8 � | � ||k � � d S r �� assertTrue�r �a�bs r �ltz TestCase.lt& s � � ����A�� � � � � r c �8 � | � ||k � � d S r r6 r8 s r �eqz TestCase.eq) s � � ����Q�� � � � � r c �� � | � ||k � � | � ||k � � | � ||z � � | � |� |� � � � d S r �r7 �disjointr8 s r �djz TestCase.dj, sl � � ���A��F� �#�#�#� ���A��F� �#�#�#� ���A��E� �"�"�"� ���� � �1� � �&�&�&�&�&r c �� � | � ||k � � | � ||k � � | � ||z � � | � |� |� � � � d S r r? r8 s r �nrz TestCase.nr3 sm � � ���A��F� �#�#�#� ���A��F� �#�#�#� ����A�� � � � ���A�J�J�q�M�M�)�*�*�*�*�*r N)r r r r" r; r= rA rC r r r r r s_ � � � � � � � � �< � � � � � �'� '� '�+� +� +� +� +r r c �8 � e Zd Zd� Zd� Zd� Zd� Zd� Zdgfd�ZdS ) � SpecialCasesc � � � � j }� j }� j }� j }� j }� j }� j }� j }� j } � j } � fd�} g } i } g }d} |t � � } |t � � }� � | | z |k � � | |t � � || | |� � z || |� � � � | |t � � |t � � z || | ||� � z || | |� � � � | || |� � |t � � z |t � � � � | |t � � || |� � z |t � � � � | || |� � ||� � z || � � � � | ||� � || |� � z || � � � � | || | |� � |t � � z || |� � � � | |t � � || | |� � z || |� � � � | |t � � || | � � z |t � � || � � z � � | || | � � |t � � z |t � � || � � z � � | |t � � |t � � z || | � � z |t � � |t � � z || � � z � � | || | � � |t � � |t � � z z |t � � |t � � z || � � z � � | |t � � || | � � z |t � � || � � z � � | || | � � |t � � z |t � � || � � z � � | |t � � || | � � z |t � � || � � z � � | || | � � |t � � z |t � � || � � z � � | || |� � || � � z || | |� � � � | || |� � || |� � z || | � � � � | || |� � || |� � z |� � | || |� � |t � � k d� � | || | � � |t � � |t � � z k d� � | |t � � || |� � k d� � | |t � � |t � � z || | � � k d� � d S )Nc � �� �� | |k � � �� t | � � t |� � k � � d S r )r7 �str�r9 r: r s �r r= z SpecialCases.test_1.<locals>.eqI sB �� � �O�O�A��F� #� #� #� �O�O�C��F�F�c�!�f�f� ,� -� -� -� -� -r r T)r- r/ r* r1 r2 r+ r3 r r r4 �int�dictr7 �list�tuple)r r- r/ r* r1 r2 �Allr3 r r r4 r= �e1�e2�e3�e4r9 r: s ` r �test_1zSpecialCases.test_1= s� �� � �W�� �W�� �W�� �W���h���m���,�� �W�� �W�� �W�� .� .� .� .� .� �� �� �� �� �B�s�G�G�� �B�t�H�H�� �����a�R��7�*�+�+�+� ��2�2�d�8�8�c�c�"�b�"�o�o� %�s�s�2�r�{�{�3�3�3� ��B�B�t�H�H�r�r�$�x�x� �3�3�r�2�r�2�#6�#6� 6���B��B���H�H�H� ��3�3�r�2�;�;���D��� !�2�2�d�8�8�,�,�,� ��2�2�d�8�8�c�c�"�b�k�k� !�2�2�d�8�8�,�,�,� ��3�3�r�2�;�;���R��� �#�#�b�'�'�*�*�*� ��C�C��G�G�8�c�c�"�b�k�k� !�3�3�r�7�7�+�+�+� ��3�3�r�2�r�?�?�R�R��X�X� %�s�s�2�r�{�{�3�3�3� ��B�B�t�H�H�9�s�s�2�r�2��� &���B�� � �4�4�4� ��2�2�d�8�8�c�c�"�b�k�k� !�2�2�d�8�8�c�c�"�g�g�#5�6�6�6� ��3�3�r�2�;�;���D��� !�2�2�d�8�8�c�c�"�g�g�#5�6�6�6� ��B�B�t�H�H�r�r�%�y�y� �C�C��B�K�K� /�"�"�T�(�(�R�R��Y�Y�2F�#�#�b�'�'�1Q�R�R�R� ��3�3�r�2�;�;�"�"�T�(�(�R�R��Y�Y�.� /�"�"�T�(�(�R�R��Y�Y�2F�#�#�b�'�'�1Q�R�R�R� ��B�B�t�H�H�9�s�s�2�r�{�{� "�R�R��X�X�I���B���$7�8�8�8� ��3�3�r�2�;�;�"�"�T�(�(�� "�R�R��X�X�I���B���$7�8�8�8� ��2�2�d�8�8�c�c�"�b�k�k� !�2�2�d�8�8�c�c�"�g�g�#5�6�6�6� ��C�C��B�K�K�<�"�"�T�(�(� "�B�B�t�H�H�s�s�2�w�w�$6�7�7�7� ��3�3�r�2�;�;���R��� �#�#�b�"�b�/�/�2�2�2� ��3�3�r�2�;�;���R���� $�c�c�"�b�k�k�2�2�2� ��3�3�r�2�;�;���R���� $�g�.�.�.� ��3�3�r�2�;�;�"�"�T�(�(� "�D�)�)�)� ��3�3�r�2�;�;�"�"�T�(�(�R�R��X�X�-� -�t�4�4�4� ��2�2�d�8�8�s�s�2�r�{�{� "�D�)�)�)� ��2�2�d�8�8�b�b��h�h� �#�#�b�"�+�+� -�t�4�4�4�4�4r c � � � � j }� j }� j }� j }� j }� j }� j }� j }� j } � j } G d� dt � � } � fd�} � fd�} � j } | t |t � � |t � � z v � � | g |t � � |t � � z v � � | i |t � � |t � � z v � � | t |t � � |t � � z |t t � � � � z v � � | t |t � � |i � � z � � g k � � ddlm} dd l}dd l} |� � } ||� � } ||� � }d } | ||� � |� � d S )Nc � � e Zd Zd� ZdS )� SpecialCases.test_2.<locals>.C3c � � dS �Nr r r s r r z!SpecialCases.test_2.<locals>.C3.x r r Nr r r r �C3rV ~ r r rY c �2 �� �� | � � d S r r6 �r r s �r �asrtz!SpecialCases.test_2.<locals>.asrt� s �� � �O�O�A� � � � � r c �4 �� �� | � � d S r r6 r[ s �r �noz SpecialCases.test_2.<locals>.no� s �� � �O�O��E� "� "� "� "� "r r �� getrefcount)r- r/ r* r1 r2 r+ r3 r r r4 �object�aseqrK rJ �typerL �sysr` �types)r r- r/ r* r1 r2 rN r3 r r r4 rY r\ r^ r= �grcrd re �cr s ` r �test_2zSpecialCases.test_2r s �� � �W�� �W�� �W�� �W���h���m���,�� �W�� �W�� �W�� � � � � �� � � � � � � � � #� #� #� #� #� �Y�� ��4�B�B�t�H�H�r�r�#�w�w�&� '�(�(�(� ��2�"�"�T�(�(�R�R��W�W�$� %�&�&�&� ��R�B�B�t�H�H�r�r�#�w�w�&� '�(�(�(� ��T�b�b��h�h���C���(�2�2�d�4�j�j�>�>�9� :�;�;�;� ��T�"�"�T�(�(�S�S��W�W�$� %� %�� +�,�,�,� +�*�*�*�*�*�� � � �� � � � �B�D�D�� �S��V�V�� �C��F�F�� �� ��3�3�q�6�6�2�����r c � � dd l }ddlm} | j }| j }| j }| j }| j j � � � }| j � i g� � }i } |� � � |t |� � d � � } || � � } ||� � } ||� � } ||j � � }| j j j }d}d}t# |� � D ]E}t% || � � j |�� � t% ||j � � j |�� � �F |� � � |� � }t# |� � D ]'} || � � j ||j � � j �( |� � |z }|dk rn|dz }�o|� � � t# |� � D ]?}t% ||� j |�� � t% ||j � � j |�� � �@|� � � |� � }t# |� � D ]!} ||� j ||j � � j �" |� � |z }| � |d |z k � � |� � � | j � d � t# |� � D � � � � }t# |� � D ]4}t% |t |� � | � � j |�� � �5|� � � | j � d � t# |� � D � � � � } |� � }t# |� � D ]%} |t |� � | � � j �& |� � |z }| j � d � t# |� � D � � � � }|� � � t% d � |j j � |� � D � � |�� � | j � d� t# |� � D � � � � }|� � � |� � }d� |j j � |� � D � � |� � |z }| � |d |z k � � |� � � |� � � | � |t |� � d � � | � � | � || � � | � � | � ||� � | � � | � ||� � | � � | � ||j � � |� � | � |� � � d� d| j � � � � d S )Nr r_ � �2 ��filer � �?� g �?c � � g | ]}i ��S r r ��.0�is r � <listcomp>z/SpecialCases.test_dictowner.<locals>.<listcomp>� � � �"8�"8�"8�!�2�"8�"8�"8r c � � g | ]}i ��S r r rq s r rt z/SpecialCases.test_dictowner.<locals>.<listcomp>� ru r c � � g | ]}i ��S r r rq s r rt z/SpecialCases.test_dictowner.<locals>.<listcomp> ru r c � � g | ] }|d �� S �r r �rr r s r rt z/SpecialCases.test_dictowner.<locals>.<listcomp> s � �@�@�@��q��t�@�@�@r c � � g | ]}i ��S r r rq s r rt z/SpecialCases.test_dictowner.<locals>.<listcomp> ru r c � � g | ] }|d �� S ry r rz s r rt z/SpecialCases.test_dictowner.<locals>.<listcomp> s � �:�:�:�!��1��:�:�:r a� dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict (no owner) dict (no owner) dict (no owner) dict (no owner) [hp.Nothing.dictof] �<Module>) �gcrd r` r( r r4 r2 �python�io�StringIOr# � immnodeset�collectrL �__dict__�time� process_time�range�print�kindr7 �Clodo� classifier� partitionrb �getvalue�replacer )r r~ rf r( r r4 r2 �o�d1�d3�rcd1�rcd3�rcC1�rcc1�rcdc1�clock�N�Mrs �t�fast�slow�dns r �test_dictownerzSpecialCases.test_dictowner� s� � � � � � �*�*�*�*�*�*��h�� �W�� �W���h�� �K�N� #� #� %� %�� �Y� !� !�2�$� '� '�� �� � � � � � ��s�4��8�8�A�;� � ���s�2�w�w���s�2�w�w���s�2�w�w����B�K� � ��� � �-�� �� �� �q��� 1� 1�A� �#�#�b�'�'�,�Q� '� '� '� '� �#�#�b�k�"�"�'�a� 0� 0� 0� 0� 0� � �J�J�L�L�L�����A��1�X�X� &� &����B��� � ���B�K� � �%�%�%��5�7�7�1�9�D��s�{�{���Q��� �" � � � � � ��q��� 1� 1�A� �#�#�r�(�-�a� (� (� (� (� �#�#�b�k�"�"�'�a� 0� 0� 0� 0� 0� � � � � � � �E�G�G���q��� "� "�A� �C��H�M�M� �C�� � � � !� !� !��u�w�w�q�y�� �����D��(�)�)�)� � � � � � � �Y� !� !�"8�"8�u�Q�x�x�"8�"8�"8� 9� 9���q��� 1� 1�A� �#�#�d�2�h�h�q�k�"�"�'�a� 0� 0� 0� 0� 0� � � � � � � �Y� !� !�"8�"8�u�Q�x�x�"8�"8�"8� 9� 9�� �E�G�G���q��� "� "�A� �C��R���� � � � !� !� !��u�w�w�q�y�� �Y� !� !�"8�"8�u�Q�x�x�"8�"8�"8� 9� 9�� � � � � � � �@�@�S�Y� 1� ;� ;�B� ?� ?�@�@�@�q�I�I�I�I� �Y� !� !�"8�"8�u�Q�x�x�"8�"8�"8� 9� 9�� � � � � � � �E�G�G��:�:�s�y�+�5�5�b�9�9�:�:�:�:��u�w�w�q�y�� �����D��(�)�)�)� � � � � � � � � � � � � � � �#�#�d�2�h�h�q�k�"�"�D�)�)�)� � � �#�#�b�'�'�4� � � � � � �#�#�b�'�'�4� � � � � � �#�#�b�'�'�4� � � � � � �#�#�b�k�"�"�E�*�*�*� � � �!�*�*�,�,� !�6 �G�J���(�(�7 *� *� *� *� *r c �~ � d| _ ddlm} dd l}| j }| j }| j } ||� � }| j j � � � }t ||� � j j |�� � ||� � j j }t ||�� � | � | ||� � z ||� � � � |� � } | � | ||| � � z ||� � � � || � � j j }| � | ||| � � z || � � � � |� � } | � | ||| � � z || � � � � d }d } |� � � |� � � | � ||� � |� � d S )Nr} r r_ rl )r rd r` r~ r r4 r2 r r� r� r� �byrcsr� rb r� ) r rf r~ r r4 r2 r� r� �sr s r �test_retclasetzSpecialCases.test_retclaset5 s� � � %���*�*�*�*�*�*�� � � � �W�� �W���h���s�2�w�w�� �K�N� #� #� %� %�� �c�c�"�g�g�m� �q�)�)�)�)� �C��G�G�M� �� �a�a����� � � �!�c�c�"�g�g�+�s�s�2�w�w�'�'�'� �B�D�D�� � � �!�c�c�"�a�j�j�.�#�#�b�'�'�*�*�*� �C��F�F�L� �� � � �!�c�c�"�a�j�j�.�#�#�a�&�&�)�)�)� �B�D�D�� � � �!�c�c�"�a�j�j�.�#�#�a�&�&�)�)�)� �� �� � � � � � � � � � � � � � � �#�#�b�'�'�4� � � � � r c �( � dd l }| j }g }| j � g g� � }||g}| j j }| j � � � }|� � � |� |� � | � ||| v � � | � |t |� � d dk � � |� � � d }d| j _ |� � � ||� � j | � || j j � � � v � � | � t |� � d | j j � � � v � � | j j j } ||� � } d} |� � } t% | � � D ] } | j � |� � | z } | dk rn| dz } �= |� � } t% | � � D ]4} | j j � |g� � | j j | �5 |� � | z } ||� } |� � } t% | � � D ] } | j � |� � | z }| � || dz k � � d S ) Nr r Ti� r rn ro � )r~ r2 r# r� �hv� nodegraphr� �update_referrers_completelyr7 rL �clearr$ � referrers�rg� get_domainr r� r� r� � domain_covers)r r~ r2 r9 r: r r� r� r� r� r� r� rs r� �fasterr� s r �test_alt_retclasetz SpecialCases.test_alt_retclaset\ s � � � � � ��h�� �� �I� � �"�� &� &�� ��F�� �Y�\�� �Y� � � "� "�� � � � � � � �&�&�r�*�*�*� ����R��U� �#�#�#� ����4��7�7�1�:��'�1�2�2�2� ��� � � � �� &*�� �"� � � � � � � ��A����� ����T�Y�\� 4� 4� 6� 6�6�7�7�7� ����Q���� �d�i�l�&=�&=�&?�&?�?�@�@�@�� � �-�� �C��F�F�� �� �����A��1�X�X� � ��� � � ��5�7�7�1�9�D��s�{�{�� ��F�A� � �E�G�G���q��� � �A� �I�L� &� &��s� +� +� +� �I�L��O�O�O�������� �C��G�� �E�G�G���q��� � �A� �K�K�K��u�w�w��{�� ���D�4�!�8�O�+�,�,�,�,�,r �vc �> � ddl m} dd l}| j }| j }i }d}t |� � }|||< |||< ||� � } ||� � } ||� � } | � | j j |� dddd� � k p%| j j |� dddd� � k � � ~ |� � � |� � � | � ||� � | � � | � ||� � | � � d S ) Nr r_ )�kz_.f_locals['v']z _[('k',)]z _[('v',)]z _.keys()[1]z _.keys()[0]) rd r` r~ r2 r( rM r7 �byviar� �Viar� rb ) r �vlistrf r~ r2 �hp�dr� r� �rck�rcvr� s r �test_viazSpecialCases.test_via� s6 � � +�*�*�*�*�*�� � � ��h�� �X�� �� �� �%�L�L����!����!���c�!�f�f���c�!�f�f�� �C��F�F�� ����� ����/@�+�{�\i�(j�(j�j� k��� ����/@�+�{�\i�(j�(j�j� l� l� l� � � � � � � � � � � � � � � � �#�#�a�&�&�#� � � � � � �#�#�a�&�&�#� � � � � r N) r r r rS rh r� r� r� r� r r r rE rE ; s� � � � � � �35� 35� 35�j+� +� +�ZT*� T*� T*�l%!� %!� %!�N5-� 5-� 5-�n "�W� � � � � � r rE c � � e Zd Zd� ZdS )� RenderCasec �l �� dd l }dd l}| j }| j }| j } G d� dt � � }g }i }g } | j j � � � �d� | j j _ �fd�} | |dd� � � � | |ddd � � � � | ||� � � � | |||� � � � | ||| � � � � | || j j � � � � � � � | |d � � � � | ||t |� � � � | |t t |� � � � | | |� � � � � � | | |� � � � � � | ||� � � � | ||� � � � | |t" � � � � | || j � � � � | ||j � � � � | | |� � j � � � � | ||j � � � � | | |� � j � � � � | |i � � � � | ||j � � � � | ||j � � � � ddz n(# t* $ r |� � � \ } } } Y nw xY w | || � � � � | || j � � � � t1 j d � � }|� d | j � � }| j d k r|� d d� � }| � �� � � |� � t> rd S | j j � � � � |t" |dddd�d|j j ddgdd |j |� � j |j |� � j |t dd|t t! d � � |� � |� � |j � � }tC |��� � tC |j" ��� � | |� � � � j# }tC |��� � d� d | j � � }| � �� � � |� � d S )Nr c � � e Zd Zd� ZdS )�%RenderCase.test_rendering.<locals>.C3c � � dS rX r r s r r z'RenderCase.test_rendering.<locals>.C3.x� r r Nr r r r rY r� � r r rY c � � dS )Nz <address>r r s r r z+RenderCase.test_rendering.<locals>.<lambda>� s � �K� r c �4 �� t | j ��� � d S )Nrl )r� �brief)r r� s �r �psz%RenderCase.test_rendering.<locals>.ps� s �� � �!�'�� "� "� "� "� "� "r r ro g @g @a� <2 int: 1, 2> <3 (float | int): <2 float: 2.0, 3.0> | <1 int: 1>> <1 list: <address>*0> <2 (dict (no owner) | list): <1 dict (no owner): <address>*0> | <1 list: <ad...> <2 list: <address>*0, <address>*0> <1 TypeError: <address>> <1 builtins.NoneType: None> <3 module: guppy.heapy.test.support, sys, types> <3 type: <Module>.C3, int, type> <1 <Module>.C1: <address>> <1 <Module>.C3: <address>> <1 type: <Module>.C1> <1 type: <Module>.C3> <1 types.BuiltinMethodType: len> <1 types.MethodType: <<Module>.RenderCase at <addre...> <1 function: <Module>.x> <1 types.MethodType: <<Module>.C1 at <address>>.x> <1 function: <Module>.x> <1 types.MethodType: <<Module>.C3 at <address>>.x> <1 dict (no owner): <address>*0> <1 dict of <Module>.C1: <address>> <1 dict of module: types> <1 types.TracebackType: <in frame <test_rendering at <address>> at <address>>> <1 types.FrameType: <test_rendering at <address>>> r} )� � zbuiltins.NoneTypeztypes.NoneTypey �? @r� )r r� g �?rL l h�] �string)rM rl a� Partition of a set of 24 objects. Total size = 2128 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 3 12 1272 60 1272 60 type 1 4 17 144 7 1416 67 types.MethodType 2 1 4 136 6 1552 73 dict (no owner) 3 1 4 136 6 1688 79 dict of <Module>.C1 4 1 4 60 3 1748 82 list 5 1 4 56 3 1804 85 function 6 2 8 48 2 1852 87 module 7 1 4 44 2 1896 89 class 8 1 4 32 2 1928 91 <Module>.C1 9 1 4 32 2 1960 92 str <8 more rows. Type e.g. '_.more' to view.> Index Count % Size % Cumulative % Kind (class / dict of class) 10 1 4 32 2 1992 94 types.BuiltinMethodType 11 1 4 28 1 2020 95 <Module>.C3 12 1 4 28 1 2048 96 tuple 13 1 4 24 1 2072 97 complex 14 1 4 20 1 2092 98 long 15 1 4 16 1 2108 99 float 16 1 4 12 1 2120 100 int 17 1 4 8 0 2128 100 types.NoneType Partition of a set of 1 object. Total size = 32 bytes. Index Count % Size % Cumulative % Type 0 1 100 32 100 32 100 types.InstanceType )$rd re r2 r r4 ra r r� r� r' � summary_str� str_address�builtins� TypeErrorr rJ rc �lenr" r r� �ZeroDivisionError�exc_info�tb_frame�textwrap�dedentr� r � version_inforb r� � PORTABLE_TEST�__func__r� �more�bytype)r rd re r2 r r4 rY rO rP rQ r� �typ�value� traceback�expectedr r� s @r �test_renderingzRenderCase.test_rendering� s� �� �� � � �� � � ��h�� �W�� �W�� � � � � �� � � � �� �� �� �K�N� #� #� %� %�� +@�*?����'� #� #� #� #� #� ��3�3�q�!�9�9� � � � ��3�3�q�#�s� � � � � � ��3�3�r�7�7� � � � ��3�3�r�2�;�;���� ��3�3�r�2�;�;���� ��3�3�t�{�#�-�-�/�/� 0� 0�1�1�1� ��3�3�t�9�9� � � � ��3�3�s�G�U� #� #�$�$�$� ��3�3�s�D�"� � � � � � ��3�3�r�r�t�t�9�9� � � � ��3�3�r�r�t�t�9�9� � � � ��3�3�r�7�7� � � � ��3�3�r�7�7� � � � ��3�3�s�8�8� � � � ��3�3�t�z�?�?���� ��3�3�r�t�9�9� � � � ��3�3�r�r�t�t�v�;�;���� ��3�3�r�t�9�9� � � � ��3�3�r�r�t�t�v�;�;���� ��3�3�r�7�7� � � � ��3�3�r�{� � � � � � ��3�3�u�~� � � � � � 3� �a�C�C�C�� � 3� 3� 3�$'�L�L�N�N� !�C�� � � � 3���� ��3�3�y�>�>���� ��3�3�y�!� "� "�#�#�#��?� $� � ��4 �#�#�J���@�@�� � �� '� '� �'�'�(;�=M�N�N�H� � � �!�*�*�,�,��)�)�)� � � �F� �K�N� #� #� %� %�� �C��R��Q�1� � �t�R�T�]�A��x� �d�B�D�"�"�$�$�&�"�$�������W��*�b�#�t�D�z�z�����b�b�d�d�B�K� � �� �a�a����� �a�f�1� � � � � �C�����I�I� �� �a�a������4 �G�J���(�(�5 �6 � � �!�*�*�,�,��)�)�)�)�)s �"J( �("K � K N)r r r r� r r r r� r� � s( � � � � � �R*� R*� R*� R*� R*r r� c �, � e Zd Zd� Zd� Zd� Zd� Zd� ZdS )�BaseCasec �T � | j j j }| j j }| j j }| � |g � � g � � | � |dg� � dg� � | � |ddg� � dg� � | � |ddg� � dg� � | � |g g g� � g g� � | � | |dg� � |ddg� � g� � |dg� � g� � | � | |dg� � |ddg� � |dg� � g� � |dg� � |dg� � g� � | � |g � � g � � | � |dg� � dg� � | � |ddg� � dg� � | � |ddg� � dg� � | � |g g g� � g g� � | � | |dg� � |ddg� � g� � |ddg� � g� � | � | |dg� � |ddg� � |dg� � g� � |ddg� � |dg� � g� � d S )Nr ro r� )�guppy�sets� immbitsetr' �minimals�maximalsrb )r r� �min�maxs r � test_minmaxzBaseCase.test_minmaxH s� � � �J�O� %���g� ���g� �� � � �#�#�b�'�'�2� � � � � � �#�#�q�c�(�(�Q�C� � � � � � �#�#�q�!�f�+�+��s�#�#�#� � � �#�#�q�!�f�+�+��s�#�#�#� � � �#�#�r�2�h�-�-�"��&�&�&� � � �#�#�q�q�!��v�v�q�q�!�Q��y�y�)�*�*�Q�Q��s�V�V�H�5�5�5� � � �#�#�q�q�!��v�v�q�q�!�Q��y�y�!�!�Q�C�&�&�1�2�2�Q�Q��s�V�V�Q�Q��s�V�V�4D�E�E�E� � � �#�#�b�'�'�2� � � � � � �#�#�q�c�(�(�Q�C� � � � � � �#�#�q�!�f�+�+��s�#�#�#� � � �#�#�q�!�f�+�+��s�#�#�#� � � �#�#�r�2�h�-�-�"��&�&�&� � � �#�#�q�q�!��v�v�q�q�!�Q��y�y�)�*�*�Q�Q��1�v�Y�Y�K�8�8�8� � � �#�#�q�q�!��v�v�q�q�!�Q��y�y�!�!�Q�C�&�&�1�2�2�Q�Q��1�v�Y�Y���1�#���4G�H�H�H�H�Hr c �� � | j }| j }| j }| j }| j }| j }| j }| j }| j } | j } | j } | j } | j } | j }|| |f |t � � | |t � � f |t � � | |t � � f |t � � | |f | |t � � � � | | |t � � � � f | |t � � � � | |f | |t � � � � | | |t � � � � f |d� � | |d� � f |d� � | |f |d� � | |d� � f |d� � | |t � � f |d� � | |t � � f|| |f|| |t � � f|| |d� � fg}|D �]\ }}} |||� � || u r | ||� � �$|| u rJ| � ||k � � | ||z ||z � � | ||z ||z � � | ||� � �r|| u r� | ||� � | ||z |� � | ||z |� � | ||z ||z � � | ||z |� � | ||z |z |� � | ||z ||z � � | ||z ||z � � | |||z � � | |||z � � ��||u r� |||� � | ||z ||z � � | ||z |z ||z � � | ||z |z |� � | ||z |z ||z � � | ||z ||z � � | |||z � � | |||z � � | ||z |� � | ||z |� � | ||z |� � | ||z |� � | ||z ||z � � | |||z � � | |||z � � ��d S )Nr ro )r- r/ r* r1 r2 r+ r3 r r r4 r; r= rA rC rJ rK rL r7 )r r- r/ r* r1 r2 rN r3 r r r4 r; r= rA rC �datar9 �cmpr: s r �test_base_classeszBaseCase.test_base_classes_ s� � � �W�� �W�� �W�� �W���h���m���,�� �W�� �W�� �W�� �W�� �W�� �W�� �W�� ��� $� �R��W�W����3��� (� �R��W�W����4��� )� �R��W�W��� $� �R���4���\�\�2���B�B�t�H�H� � � .� �R���4���\�\�2�� %� �R���4���\�\�2���B�B�t�H�H� � � .� �S��V�V����A��� '� �S��V�V��� $� �S��V�V����A��� '� �S��V�V����3��� (� �S��V�V����4��� )� ��� (� ����3��� (� ����A��� '�) ��0 � % � % �I�A�s�A� �C��1�I�I�I� �b�y�y���1�a�������������A��&�&�&���1�q�5�!�a�%� � � ���1�q�5�!�a�%� � � ���1�a�����������1�a������1�q�5�'�"�"�"���1�q�5�'�"�"�"���1�q�5�!�a�%� � � ���1�q�5�!� � � ���A��E�Q�;��"�"�"���1�q�5�!�a�%� � � ���1�q�5�!�a�%� � � ���1�a�!�e� � � ���1�a�!�e� � � � �������1�a������1�q�5�!�a�%� � � ���1�q�5�1�9�a�!�e�$�$�$���A��E�Q�;��(�(�(���A��E�Q�;��A��&�&�&���1�q�5�!�a�%� � � ���7�A��E�"�"�"���7�A��E�"�"�"���1�q�5�!� � � ���1�q�5�!� � � ���1�q�5�!� � � ���1�q�5�!� � � ���1�q�5�!�a�%� � � ���1�a�!�e� � � ���1�a�!�e� � � ��K% � % r c �R � ��� � j }d|_ d|_ � j �� j �� � t ��fd�� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t �fd �� � � � t �fd �� � � � t �fd �� � � � t �fd �� � � � t �fd �� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t �fd�� � � � t � �fd�� � d S )NFc � �� �� � � S r r )r4 r/ s ��r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �R�R��V�V� r c �, �� � t � � d k S r �rJ �r/ s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �R�R��W�W��_� r c �, �� d � t � � k S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� � �� �T�R�R��W�W�_� r c �, �� d � t � � k S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �> �� t � t � � � � S r )rL rJ r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �T�"�"�S�'�'�]�]� r c �> �� t � t � � � � S r )r� rJ r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �S���C���\�\� r c �* �� � t � � d z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� � �� �R�R��W�W�t�^� r c �* �� d � t � � z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� � �� �T�B�B�s�G�G�^� r c �* �� � t � � d z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �* �� d � t � � z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �* �� � t � � d z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �* �� d � t � � z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �* �� � t � � d z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �* �� d � t � � z S r r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� r� r c �, �� � t � � dgz S )N� r� r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �R�R��W�W��t�^� r c �4 �� � t � � t z S r )rJ rK r� s �r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �R�R��W�W�t�^� r c �4 �� �t � � � j z S r )rJ r )r r/ s ��r r z2BaseCase.test_invalid_operations.<locals>.<lambda>� s �� �R�R��W�W�t�w�->� r )r' �auto_convert_iter�auto_convert_typer/ r4 � assertRaisesr� )r r' r4 r/ s ` @@r �test_invalid_operationsz BaseCase.test_invalid_operations� sQ ���� � �W�� $�� � $�� � �W�� �W�� ���)�^�^�^�^�^�4�4�4� ���)�%<�%<�%<�%<�=�=�=� ���)�%<�%<�%<�%<�=�=�=� ���)�%<�%<�%<�%<�=�=�=� ���)�%:�%:�%:�%:�;�;�;� ���)�%9�%9�%9�%9�:�:�:� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%;�%;�%;�%;�<�<�<� ���)�%>�%>�%>�%>�%>�?�?�?�?�?r c �� � d| j _ | j }| j }| j }g }i }g }d} | |t � � |||gz |||� � � � ||||g |t � � z |||� � � � ||||g |t � � |t � � z z ||gk d� � |||g |t � � |t � � z z ||gk d� � | |||� � |t � � |t � � z z ||gk d� � | |||� � ||gz ||� � � � | |||� � ||gz ||||� � � � |||g |||� � z ||||� � � � | |||� � |gz ||� � � � |||g ||� � z ||� � � � ||||g |t � � z |||� � � � | |t � � |||gz |||� � � � | |||� � |gz ||||� � � � ||g |||� � z ||||� � � � |||g ||||� � k d� � |||g |t � � |t � � z k d� � | |t � � |t � � z ||gk d� � |||g |t � � k d� � |||g ||� � k d� � |||g ||||� � k d� � |||g |||� � k d� � | ||||� � ||gk d� � | |||� � ||gk d� � | ||||� � ||gk d� � | |||� � |||gk d� � d S )NTr F)r' r r= r2 r/ rL rK )r r= r2 r/ rO rP rQ rR s r �test_fancy_list_argsz BaseCase.test_fancy_list_args� s� � � %)���!� �W���h�� �W�� �� �� �� �� ��2�2�d�8�8�r�2�r�l� "�C�C��B�K�K�0�0�0� ��B��B�<�"�"�T�(�(� "�C�C��B�K�K�0�0�0� ��B��B�<�2�2�d�8�8�b�b��h�h�.� /�B��8� ;�T�B�B�B� ��B��8�r�r�$�x�x�"�"�T�(�(�*� +��B�x� 7��>�>�>� ��3�3�r�2�;�;�"�"�T�(�(�R�R��X�X�-� .�2�r�(� :�D�A�A�A� ��3�3�r�2�;�;�"�b�� !�3�3�r�7�7�+�+�+� ��3�3�r�2�;�;�"�b�� !�3�3�r�2�r�?�?�3�3�3� ��B��8�c�c�"�b�k�k� !�3�3�r�2�r�?�?�3�3�3� ��3�3�r�2�;�;�"�� �s�s�2�w�w�'�'�'� ��B��8�c�c�"�g�g� �s�s�2�w�w�'�'�'� ��B��B�<�"�"�T�(�(� "�C�C��B�K�K�0�0�0� ��B�B�t�H�H�9��B��|� #�S�S��R�[�[�1�1�1� ��3�3�r�2�;�;�"�� �s�s�2�r�2���/�/�/� ��B�4�#�#�b�"�+�+� �s�s�2�r�2���/�/�/� ��B��8�s�s�2�r�2��� &��-�-�-� ��B��8�r�r�$�x�x�"�"�T�(�(�*� *�D�1�1�1� ��B�B�t�H�H�r�r�$�x�x� �R��H� ,�d�3�3�3� ��B��8�r�r�$�x�x� ��'�'�'� ��B��8�s�s�2�w�w� ��&�&�&� ��B��8�s�s�2�r�2��� &��.�.�.� ��B��8�s�s�2�r�{�{� "�D�)�)�)� ��3�3�r�2�r�?�?�r�2�h� &��.�.�.� ��3�3�r�2�;�;�2�r�(� "�D�)�)�)� ��3�3�r�2�r�?�?�r�2�h� &��-�-�-� ��3�3�r�2�;�;�2�r�2�,� &��.�.�.�.�.r c �� � � d� j _ � j }� j }� j }� j }� j }� j }� j }� j }� j } � j } � fd�} g } i } g }d} | |t � � t � � | || | � � t z || � � � � | t || | � � z || � � � � | || | � � t z || � � |t � � z � � | t || | � � z || � � |t � � z � � | || | � � t z || � � � � | t || | � � z |t � � || � � z � � | || | |� � t z |t � � || � � z || |� � z � � d S )NTc �: �� �� | |k � � d S r r6 rI s �r r= z0BaseCase.test_fancy_type_conversions.<locals>.eq s �� � �O�O�A��F� #� #� #� #� #r r ) r' r r- r/ r* r1 r2 r+ r3 r r r4 rK )r r- r/ r* r1 r2 rN r3 r r r4 r= rO rP rQ rR s ` r �test_fancy_type_conversionsz$BaseCase.test_fancy_type_conversions� s �� � %)���!� �W�� �W�� �W�� �W���h���m���,�� �W�� �W�� �W�� $� $� $� $� $� �� �� �� �� ��2�2�d�8�8�T���� ��3�3�r�2�;�;�� �s�s�2�w�w�'�'�'� ��4�#�#�b�"�+�+� �s�s�2�w�w�'�'�'� ��3�3�r�2�;�;�� �s�s�2�w�w���D��� 1�2�2�2� ��4�#�#�b�"�+�+� �s�s�2�w�w���D��� 1�2�2�2� ��3�3�r�2�;�;�� �s�s�2�w�w�'�'�'� ��4�#�#�b�"�+�+� �r�r�$�x�x�#�#�b�'�'� 1�2�2�2� ��3�3�r�2�r�?�?�T� !�B�B�t�H�H�S�S��W�W�$4���B�� � �#C�D�D�D�D�Dr N)r r r r� r� r r r r r r r� r� G so � � � � � �I� I� I�.M � M � M �^@� @� @�:)/� )/� )/�V E� E� E� E� Er r� c � � e Zd Zd� ZdS )�LawsCasec �J ������ | j }| j }| j }| j }| j }| j }| j �| j }| j }| j } | j �| j �| j j j } | j } | j } | j } | j }| j }| j }| j }d�����fd� �d���fd� �| |t, � � |t/ | � � � � | |t0 � � � � || � � �g}|D ]�} ||� � |D ]�}||k r ||k r �||� � n �||� � n||k r �||� � | ||� � | ||� � |||� � |||� � |D ])} | |||� � ||||� � ||||� � �*����d S )Nr� c � �� �| |� � �| |z | � � �|| z | � � �| |z |� � �|| z |� � �| |z �� � �|| z || z � � �|| z | z |� � �| || z z |� � �| || z z �� � �|| z | z �� � �|| z | z || z � � �| || z z | � � |dk r*| �u r �|| z |� � d S �|| z ||dz � � d S d S )Nr r r )r9 r: �levelr3 r= �eqrr; �ltrs �����r r z LawsCase.test_laws.<locals>.ltr2 s� �� � �B�q�!�H�H�H� �B�q�1�u�a�L�L�L� �B�q�1�u�a�L�L�L� �B�q�1�u�a�L�L�L� �B�q�1�u�a�L�L�L� �B�q�1�u�g� � � � �C��A��q�1�u� � � � �B��A���{�A� � � � �B�q�A��E�{�A� � � � �B�q�A��E�{�G� $� $� $� �B��A���{�G� $� $� $� �B��A���{�Q��U� $� $� $� �B�q�A��E�{�A� � � ��q�y�y���<�<��B�q�1�u�a�L�L�L�L�L��C��A��q�%��'�*�*�*�*�*� �yr r c � �� �| |� � �| |z | � � �| |z | � � �| |z �� � �| |z �� � |r �|| |dz � � d S d S rX r )r9 r: r r3 r= r s ���r r z LawsCase.test_laws.<locals>.eqrF s� �� � �B�q�!�H�H�H� �B�q�1�u�a�L�L�L� �B�q�1�u�a�L�L�L� �B�q�1�u�g� � � � �B�q�1�u�g� � � �� %���A�q�%�!�)�$�$�$�$�$� %� %r )r� )r )r- r/ r* r1 r2 r+ r3 r r r4 r; r= r� r� �test� absorption� associative� commutative�deMorgan� distributive� idempotence� inclusionrJ rc rK )r r- r/ r* r1 r2 rN r r r4 r� r r r r r r r �classesr9 r: rg r3 r= r r; r s @@@@@r � test_lawszLawsCase.test_laws sO ������ � �W�� �W�� �W�� �W���h���m���,�� �W�� �W�� �W�� �W�� �W�� �J�O� ���\� ��m� ��m� ��:���~� ��m� ��K� � +� +� +� +� +� +� +� +� +� +�( %� %� %� %� %� %� %� %� ���3�����D��H�H� � �r�r�"�"�T�(�(�|�|�S�S��W�W�g�N��� *� *�A� �K��N�N�N� � *� *����6�6��A�v�v���A�q� � � � ���A�q� � � � ��!�V�V��C��1�I�I�I�� �1�a� � � �� �A�q�!�!�!�� �!�Q�������A���� � *� *�A� �K��1�a�(�(�(� �H�Q��1�%�%�%� �L��A�q�)�)�)�)�*� *� *� *r N)r r r r r r r r r s( � � � � � �J*� J*� J*� J*� J*r r c � � e Zd Zd� Zd� ZdS )�ClassificationCasec � � d| j _ | j }| j }| j j j } G d� d� � } G d� dt � � } |� � } |� � }dg i |||j |j g}|D ]=} | � || � � j j j t | � � � � �>|D ]�} | |j u r ||� � j } nS| |j u r ||� � j } n9t | � � t u r|j } n| |u r|j } nt | � � } | � || � � j j | � � �� |d� � j j } | � | j d � � |D ]+} | � || � � j j | � � �,|D ]K} | � || � � j j |� t+ | � � � � � � �Lt- |� � D ]�\ } } || � � j j } d| cxk rdk r;n n8| � | |j � t4 � � j � � | d k rA| � | |j � |� � t4 � � j � � | d k rA| � | |j � |� � t4 � � j � � ��d S ) NTc � � e Zd ZdS )�1ClassificationCase.test_classification.<locals>.ANr r r r �Ar! o r! r r" c � � e Zd ZdS )�1ClassificationCase.test_classification.<locals>.BNr r r r �Br$ r r! r r% r r ro rj � ) r# r$ r( r2 r% r& r� ra r� �asisr� r� �argrc rK r3 � __class__rb �byunity�byid�Id�id� enumerater� r� �sokindrL �refdby)r r( r2 �nodesetr" r% r9 r: �lir� r� �clars �cls r �test_classificationz&ClassificationCase.test_classificationh s � �%)�� �"��h���h���*�#�.�� � � � � � � � � � � � � �� � � � �A�C�C�� �A�C�C����R��A�q�z�1�:� 6��� 7� 7�A� �I�I�c�c�!�f�f�m�(�,�d�1�g�g� 6� 6� 6� 6�� -� -�A��A�J����s�1�v�v�{����a�j� � ��s�1�v�v�{����a���D� � ��{����a����{����A�w�w�� �I�I�c�c�!�f�f�k�o�t� ,� ,� ,� ,��c�"�g�g�o�"�� � � �#�'�4� � � �� 0� 0�A� �I�I�c�c�!�f�f�n�)�3� /� /� /� /�� 7� 7�A� �I�I�c�c�!�f�f�k�&����r�!�u�u� � � 6� 6� 6� 6� �b�M�M� @� @�D�A�q���Q��� �"�B��A�{�{�{�{��{�{�{�{�{�� � �"�c�i� .� .�t� 4� 4� ;�<�<�<��A�v�v�� � �"� 1�c�i� .� .�q� 1� 1�$� 7� 7� >�?�?�?��A�v�v�� � �"� 1�c�i� .� .�q� 1� 1�$� 7� 7� >�?�?�?�� @� @r c � � | j } G d� d� � } G d� dt � � } |� � } |� � }|� dg i |||j |j � � }|j |j |j |j |j f}i }|D ]T} d� |� | � � j D � � } | D ]+\ } } | |v r | � || | � � �&| || < �,�Ut |� � � � � D ]�\ } } | � | |z | � � t |� � � � � D ]�\ } }| � | | z |z | |z � � | � | | z |z | |z � � | � | | z |z | |z � � | � | | z |z || z � � | � | | z |z | |z � � ����d S )Nc � � e Zd ZdS )�,ClassificationCase.test_selection.<locals>.ANr r r r r" r8 � r! r r" c � � e Zd ZdS )�,ClassificationCase.test_selection.<locals>.BNr r r r r% r: � r! r r% � c � � g | ] }|j |f�� S r )r� )rr �avs r rt z5ClassificationCase.test_selection.<locals>.<listcomp>� s � �=�=�=�2�"�'�2� �=�=�=r )r( ra r2 r� �Unityr. r� r0 r� �byr� rb rL �items)r r( r" r% r9 r: r2 �allersr� �er�p�akr= �bk�bvs r �test_selectionz!ClassificationCase.test_selection� s> � � �h�� � � � � � � � � � � � � �� � � � �A�C�C�� �A�C�C�� �W�W�S�"�b�!�Q�� �A�J� ?� ?���)�S�X�s�y��'�3�7�$�� ��� � �B�=�=����r���)<�=�=�=�A�� � ���B���8�8��I�I�b��f�r�*�*�*�*� �B�r�F�F� � �2�8�8�:�:�&�&� 3� 3�F�B�� �I�I�b�2�g�r� "� "� "� �r�x�x�z�z�*�*� 3� 3���B�� � �2��7�b�.�"�r�'�2�2�2�� � �2��7�b�.�"�r�'�2�2�2�� � �2��7�b�.�"�r�'�2�2�2�� � �2��7�b�.�"�r�'�2�2�2�� � �2��7�b�.�"�r�'�2�2�2�2� 3� 3� 3r N)r r r r5 rG r r r r r g s6 � � � � � �+@� +@� +@�Z"3� "3� "3� "3� "3r r c � � t j t |� � t j t |� � t j t |� � t j t |� � t j t |� � d S r )r � run_unittestr� r r r� rE )� testrender�debugs r � test_mainrL � sh � � ���5�)�)�)� ��+�U�3�3�3� ���5�)�)�)� ���U�+�+�+� �� �u�-�-�-�-�-r )r r ) �guppy.heapy.testr r� r� r rE r� r� r r rL r r r �<module>rN sx �� $� $� $� $� $� $� ����� �1+� 1+� 1+� 1+� 1+�w� � 1+� 1+� 1+�hs � s � s � s � s �8� s � s � s �l S*� S*� S*� S*� S*�� S*� S*� S*�lOE� OE� OE� OE� OE�x� OE� OE� OE�dK*� K*� K*� K*� K*�x� K*� K*� K*�\P3� P3� P3� P3� P3�� P3� P3� P3�f.� .� .� .� .� .r __pycache__/test_ER.cpython-311.pyc 0000644 00000056362 15004413005 0013027 0 ustar 00 � ��bg:2 � � � d dl mZ d dlZd dlZ G d� dej � � Z G d� de� � Zd d�Zedk r d d l m Z e � � e� � dS dS ) � )�supportNc � � e Zd ZdS )�TestCaseN��__name__� __module__� __qualname__� � �k/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_ER.pyr r s � � � � � ��Dr r c �R � e Zd Zd� Zd� Zd� Zd� Zd� Zd� Zdd�Z d � Z d � Z d � Z d � Z d S )� FirstCasec �� � | j j }d|_ |� dddddd� � }|j |j z }|| } G d� d � � }|� |j g � � }d S ) N�hp.� � �asdfg333333 @g������ @� c � � e Zd ZdS )�FirstCase.test_1.<locals>.CNr r r r �Cr + � � � � � � � �Dr r )�heapy�Use�reprefix�iso�Type�Size�__dict__)�self�hp�a�ts�kr �dis r �test_1zFirstCase.test_1 s� � � �Z�^���� � �F�F�1�b�&�#�s�A� .� .���g��� �� �q�E�� � � � � � � � � �V�V�A�J�� #� #���r c �n � | j j }d|_ G d� d� � } G d� dt � � } |� � } |� � }ddl}dD ]N}t |||||d �i � � }t |� � } | � t | d |ii � � |� � �Ot d � � D ]�\ } }| d z } t |d |ii � � }t |j � � d } | � | j | � � t |� � } | � t | d |ii � � |� � ��dS ) z, Systematically test all kind constructors: r c � � e Zd ZdS )�FirstCase.test_2.<locals>.CNr r r r r r) > r r r c � � e Zd ZdS )�FirstCase.test_2.<locals>.TNr r r r �Tr+ A r r r, r N)zhp.Clodo(dictof=C)zhp.Clodo(dictof=T)zhp.Clodo(dictof=())z hp.Clodo(C)z hp.Clodo(T)z hp.Id(id(c))zhp.Module("sys")z hp.Prod()zhp.Prod("<string>")z hp.Prod(T)zhp.Prod("/foo.py", 1)zhp.Prod("/foo.py", None)zhp.Prod(None, 1)z&hp.Rcs(hp.Clodo.sokind(int)(dictof=C))zhp.Size(hp.iso(c).indisize)z"hp.Size(hp.iso(C).indisize).dictofz hp.Type(T)z hp.Type(int)z hp.Unity()zhp.Via())r! r r, �cr! ) z hp.Via('_.x')zhp.Via('_[0]')zhp.Via('_.keys()[0]')zhp.Via('_->abc')z hp.Via('_.__dict__.keys()[0]')zhp.Via('_.f_locals["abc"]')z hp.Via('_.f_locals ["abc"]')z hp.Via('_->f_valuestack[0]')zhp.Via('list(_)[0]')r ) r r r �object�sys�eval�repr�aseq� enumerate�list�arg�kind) r r! r r, r- �tr/ �s�x�rx�i�code�rels r �test_2zFirstCase.test_27 s� � � �Z�^���� � � � � � � � � � � � � � �� � � � �A�C�C�� �A�C�C��� � � � � 3� 3�A�8 �Q�r����:�:�B�?�?�A��a���B� �I�I�d�2��b�z�2�.�.�� 2� 2� 2� 2� � � � � 3� 3�D�A�q� �q�5�D��Q��r� �B�'�'�A��q�u�+�+�a�.�C� �I�I�c�h�� %� %� %��a���B� �I�I�d�2��b�z�2�.�.�� 2� 2� 2� 2�' 3� 3r c �� � | j j } G d� d� � } G d� dt � � } |� � } |� � }i }|� |j |j |� � }||fD ]�}|j } |� | �� � |� |� |� � j � � j |� |� � j j j |� |j � � j fD ]3} | � || z |� |j � � � � �4��|j j fD ].} | � || z |� |� � � � �/dS )z Test of dictof c � � e Zd ZdS )�FirstCase.test_3.<locals>.CNr r r r r rA � r r r c � � e Zd ZdZdS )�FirstCase.test_3.<locals>.T) r r" �br- �d�e�f�g�hN)r r r � __slots__r r r r, rC � s � � � � � � K�I�I�Ir r, )�dictofN)r r r. r r � __class__�Clodor �indisizerK �bysizer6 r2 �Nothing) r r! r r, r- r7 �dn�isodr9 �Xr$ s r �test_3zFirstCase.test_3} s� � � �Z�^�� � � � � � � � � K� K� K� K� K�� K� K� K� �A�C�C�� �A�C�C�� ���v�v�a�j�!�*�b�1�1���1�� 9� 9�A�� �A������"�"�������q� � �*�+�+�2����q� � � �%�,����q�z�"�"�'� � 9� 9�� � � �$��(�R�V�V�A�J�%7�%7�8�8�8�8� 9� �J� � � ,� ,�A� �I�I�d�Q�h����r� � � +� +� +� +� ,� ,r c � � G d� d� � } |� � }| j j }|� |j � � }|� d� � j }| � t |� � d� � dS )z Test of via c � � e Zd ZdS )�FirstCase.test_4.<locals>.CNr r r r r rW � r r r �Viazhpy().Via('.__dict__')N)r r r r �byr6 r2 r1 )r r r- r! rR r9 s r �test_4zFirstCase.test_4� s� � � � � � � � � � � �A�C�C�� �Z�^���v�v�a�j�!�!�� �G�G�E�N�N� �� � � �$�q�'�'�3�4�4�4�4�4r c �� � G d� d� � } |� � }i }|g}|� |� � ||_ | j j }d|_ |� |||j |� � }|� |||j |� � }| � ||� � |� |j |||j |� � � |j j j � � }t t |� � � � D ]f} || j }t |� � } t | d|ii � � } | � || � � | � || z || � � �gddl} | j } ~ |� | � � }|� |j j j � � }| � |t t |j � � d|ii � � z |� � dS )z6 Non-systematic tests that came up around Sep 14 2005 c � � e Zd ZdS )�FirstCase.test_5.<locals>.CNr r r r r r] � r r r r r! r N)�append�crefr r r r r r2 rY rM �refdby�range�lenr6 r1 r0 r/ �path�ModulerK )r r r- rE r_ r! r" rD r8 r; �ra�erar/ �pr9 s r �test_5zFirstCase.test_5� s� � � � � � � � � � � �A�C�C�� ���s�� � � �D������� �Z�^���� � �F�F�1�a���Q� '� '�� �F�F�1�a���Q� '� '�� � � �!�Q���� �F�F�1�:�q�!�Q�Z�� � ��b��� �/�0�0� � �s�1�v�v� � � � �A��!�� �A��a���B��r�D�"�:�r�*�*�C� �I�I�a�� � � � �I�I�a�#�g���d� � � � � � � � � �H�� � �F�F�1�I�I�� �D�D���!�(� )� )�� � � �!�d�4���<�<�$���R�8�8�8�!�<�<�<�<�<r c �� � | � � � 5 G d� d� � } |� � }i }|g}|� |� � ||_ | j j }d|_ |� |j |||j |t � � }dD ]F}t |t � � r|\ }}nd}t ||� � } | � | ||� � �G ddd� � dS # 1 swxY w Y dS )z Test of .refdby on all others c � � e Zd ZdS )�FirstCase.test_6.<locals>.CNr r r r r rk � � � � � � � ��r r r ) �UnityrM �Idrd �Prod)�Rcsr r r rX r N) �tracemalloc_stater^ r_ r r r r r �inspect� isinstance�tuple�getattr�er_test) r r r- rE r_ r! r8 �pre�level�ers r �test_6zFirstCase.test_6� sc � � � #� #� %� %� +� +� � � � � � � � � ����A��A��3�D� �K�K�� � � ��A�F��� �B� �B�K����q�z�1�a���Q��@�@�A� � +� +�� �c�5�)�)� �!$�J�C��� �E� �R��%�%��� � �R��E�*�*�*�*�! +� +� +� +� +� +� +� +� +� +� +� +� +���� +� +� +� +� +� +s �B>C!�!C%�(C%r c �< � | j j }t |� � }| � t |d|ii � � |� � |fD ]�}|� |� � }|j }t |� � } t | d|ii � � } | � | |d� � | � ||z |d� � | � || z |d� � ��|j } |j } |dk r6| � | ||dz � � | � | ||dz � � d S d S )Nr! ���r r ) r r r1 r2 r0 rY r6 r` rK rv ) r ry �setrx r! �rerr8 �sby�sk�rsk�ske� er_refdby� er_dictofs r rv zFirstCase.er_test� s* � � �Z�^���2�h�h�� � � �$�s�T�2�J��+�+�R�0�0�0��� &� &�A��$�$�r�(�(�C���B��r�(�(�C��s�T�2�J��+�+�C� �I�I�c�2�r� "� "� "� �I�I�a�"�f�a�� $� $� $� �I�I�a�#�g�q�"� %� %� %� %� �I� � �I� � �1�9�9� �L�L��C���� 3� 3� 3� �L�L��C���� 3� 3� 3� 3� 3� �9r c � � | j j } G d� d� � } G d� d|� � } G d� d|� � } G d� dt � � } G d � d |� � } G d � d |� � } |� � } |� � } |� � } |� � } |� � } |� � } |� g i || | | | | | j � � }|� d � � |� |� � fD ]�}|� d� � }|� d� � }|� d� � }|� d� � }|� d� � }||z ||z z ||z k sJ �||||||| z fD ]}||z ���ddl}|� � � |� |� d� � j � � }|� |� d� � j � � }| � |� | j � � |d k � � | � ||k � � |� � � |� |� d� � j � � }|� |� d� � j � � }| � |� | j � � |d k � � | � ||k � � dS )z# Test of alternative sets w. biper c � � e Zd ZdS )�FirstCase.test_7.<locals>.CNr r r r r r� ! r r r c � � e Zd ZdS )�FirstCase.test_7.<locals>.DNr r r r �Dr� $ r r r� c � � e Zd ZdS )�FirstCase.test_7.<locals>.ENr r r r �Er� ' r r r� c � � e Zd ZdS )�FirstCase.test_7.<locals>.TNr r r r r, r� * r r r, c � � e Zd ZdS )�FirstCase.test_7.<locals>.UNr r r r �Ur� - r r r� c � � e Zd ZdS )�FirstCase.test_7.<locals>.VNr r r r �Vr� 0 r r r� � �<�<=�>=z!=r N) r r r. r r r r �alt�gc�collectrY �biper� assertTrue)r r! r r� r� r, r� r� r- rE rF r7 �u�vr8 r$ �lt�le�ge�gt�ner" r� rD s r �test_7zFirstCase.test_7 s] � � �Z�^�� � � � � � � � � � � � � �� � � � � � � � �� � � � � � � � �� � � � � � � � �� � � � � � � � �� � � � �A�C�C�� �A�C�C�� �A�C�C�� �A�C�C�� �A�C�C�� �A�C�C�� �F�F�2�r�1�a��A�q�!�Q�Z� 8� 8�� �G�G�B�K�K� �G�G�A�J�J� � � �A� ���s���B����t���B����t���B����t���B����t���B���F�q�2�v�&�!�a�%�/�/�/�/��"�b�"�b�"��r�'�2� � ���A���� � � � � � � � � � � � �D�D����t���"� #� #�� �D�D����t���"� #� #�� ������q�z�*�*�a��d�2�3�3�3� ����Q�� � � � � � � � � � �D�D����t���"� #� #�� �D�D����t���"� #� #�� ������q�z�*�*�a��d�2�3�3�3� ����Q�� � � � � r c �� � | j j } G d� d� � } |� � }g }i }|� |||d� � }|� t � � df|� |� � df|� ||� � dffD ]U\ }}|� |j � � } | � | | j j j j d |� � �VdS )z Test of findex and biper c � � e Zd ZdS )�FirstCase.test_8.<locals>.CNr r r r r r� a r r r r r N) r r r r �dictrY r� r2 r6 �fam� classifier�kinds) r r! r r- �lir% r8 r$ r; rg s r �test_8zFirstCase.test_8[ s� � � �Z�^�� � � � � � � � � �A�C�C�� �� �� �F�F�2�r�1�a� � �� �W�W�T�]�]�A� � �V�V�A�Y�Y��N� �V�V�A�r�]�]�A� � � <� <�D�A�q� ���Q�W� � �A� �I�I�a��d�i�m�.�4�Q�7�� ;� ;� ;� ;� <� <r c �� �� ddl m} g d�} |� � ��fd�|D � � }|� d�j �j z f� � ddlm} |� � }t d� d� � d |� � � |D ]-}t |d � d � � d |� � � �.t |� � � |D ]�}t |d � d� � d |� � � |D ]L}t t |d |d k � � dd � � d � � d |� � � �Mt |� � � ��| � |� � � d� � dS )z Test the subrelation relation r )�hpy) rM rn �Idsetrd ro rp r r rm c �4 �� g | ]}|t �|� � f��S r )ru )�.0�namer! s �r � <listcomp>z$FirstCase.test_9.<locals>.<listcomp>{ s( �� �=�=�=�T��g�b�$�'�'�(�=�=�=r z Size&Type)�StringIOr � � )�end�file� )r� r Na� Clodo Id Idset Module Prod Rcs Size Type Unity Size&Type Clodo F F F F F F F T T F Id F F F F F F F F T F Idset F F F F F F F F T F Module F F F F F F F F T F Prod F F F F F F F F T F Rcs F F F F F F F F T F Size F F F F F F F F T F Type F F F F F F F F T F Unity F F F F F F F F F F Size&Type F F F F F F T T T F ) �guppyr� r^ r r �ior� �print�ljust�strr2 �getvalue) r r� �ernames�ersr� rG rD r" r! s @r �test_9zFirstCase.test_9q s� �� � � � � � � � � � �� �S�U�U��=�=�=�=�W�=�=�=�� � � �K���2�7�!2�3�4�4�4� � � � � � � �H�J�J�� �b�h�h�r�l�l��!�,�,�,�,�� 2� 2�A� �!�A�$�*�*�Q�-�-�S�q� 1� 1� 1� 1� 1� �1� � � � �� � �A� �!�A�$�*�*�R�.�.�c�� 2� 2� 2� 2�� H� H���c�1�Q�4�!�A�$�;�(�(��!��,�2�2�1�5�5�3�Q�G�G�G�G�G� �q�M�M�M�M�M� � � �!�*�*�,�,� !� � � � � r c � � � � | j j }| � � � 5 G d� d� � � t j � � j j }d� � t dd� ii � � } � � � � � � }}� � fd�} |� � \ }}|� d|||� � } | � | |� � � z |� d� � � � | � | |� dd� � z |� |� � � � | � | |� ||� � z |� |� � � � | � | |� ||� � z |� |� � � � | � | |� |� � z |� ||� � � � | � | |� t j � |� � � � z |� ||� � � � | � | |� | j � � z |� ||� � � � | � | |� |� � z |� |� � � � | � | |� d|� � � d � � z |� d|� � � d � � z |� |� � � � ddd� � n # 1 swxY w Y | � t" � � 5 |� d d� � � ddd� � n # 1 swxY w Y | � t" � � 5 |� d d� � � ddd� � n # 1 swxY w Y | � t" � � 5 |� d� � ddd� � n # 1 swxY w Y | � t" � � 5 |� dd� � ddd� � n # 1 swxY w Y | � t" � � 5 |� d d � � ddd� � n # 1 swxY w Y | � t" � � 5 |� d dd� � ddd� � dS # 1 swxY w Y dS )z Test of producer profile c � � e Zd ZdS )� FirstCase.test_10.<locals>.CNr r r r r r� � rl r r c �< � t j � � j j S �N)rr � currentframe�f_back�f_linenor r r �linenoz!FirstCase.test_10.<locals>.lineno� s � � �+�-�-�4�=�=r zC()c �, �� � � � �� � fS r� r )r r� s ��r �subfz FirstCase.test_10.<locals>.subf� s �� ��q�s�s�F�F�H�H�}�$r Nz<string>r r� r� r )r� )�filename�liner )r r rq rr r� �f_code� co_filenamer0 r r2 ro �osrc �dirname�test_10r� � assertRaises� TypeError) r r! r� �str_aloc� test_aloc�test_aloc_liner� � subf_aloc�subf_aloc_linerR r r� s @@r r� zFirstCase.test_10� sH ��� � �Z�^�� � #� #� %� %� ! )� ! )� � � � � � � � � �'�)�)�0�<�D� >� >� >� �E�C��8�R�0�0�H�()����V�V�X�X�~�I� %� %� %� %� %� %� )-���� %�I�~��6�6�$��)�Y�?�?�D� �I�I�d�R�W�W�Y�Y�&����t� � � 5� 5� 5� �I�I�d�R�W�W�Z�� 3� 3�3�R�V�V�H�5E�5E� F� F� F� �I�I�d�R�W�W�T�>� :� :�:�B�F�F�9�<M�<M� N� N� N� �I�I�d�R�W�W�T�>� :� :�:�B�F�F�9�<M�<M� N� N� N� �I�I�d�R�W�W�T�]�]�*�B�F�F�9�i�,H�,H� I� I� I� �I�I�d�R�W�W�R�W�_�_�T�%:�%:� ;� ;�;��f�f�Y� �2�2� 4� 4� 4� �I�I�d�R�W�W�T�\� 2� 2�2�B�F�F�9�i�4P�4P� Q� Q� Q� �I�I�d�R�W�W�T�]�]�*�B�F�F�9�,=�,=� >� >� >� �I�I�d�R�W�W�T�>� :� :� >� >�t� D� D�D��g�g�d�N�3�3�7�7��=�=�>��f�f�Y�'�'� )� )� )�?! )� ! )� ! )� ! )� ! )� ! )� ! )� ! )� ! )� ! )� ! )���� ! )� ! )� ! )� ! )�F � � �y� )� )� "� "� �G�G�B�q�G� !� !� !� "� "� "� "� "� "� "� "� "� "� "���� "� "� "� "� � � �y� )� )� )� )� �G�G�R�a�G� (� (� (� )� )� )� )� )� )� )� )� )� )� )���� )� )� )� )� � � �y� )� )� � � �G�G�D�M�M�M� � � � � � � � � � � ���� � � � � � � �y� )� )� � � �G�G�A�q�M�M�M� � � � � � � � � � � ���� � � � � � � �y� )� )� � � �G�G�B��O�O�O� � � � � � � � � � � ���� � � � � � � �y� )� )� � � �G�G�B��1� � � � � � � � � � � � � � � ���� � � � � � s~ �L M � M�M�0N�N�N�9O � O!�$O!�P$�$P(�+P(� Q,�,Q0�3Q0�R4�4R8�;R8�S>�>T�TN)r )r r r r& r> rT rZ rh rz rv r� r� r� r� r r r r r s� � � � � � �$� $� $�DD3� D3� D3�L#,� #,� #,�J 5� 5� 5� )=� )=� )=�V!+� !+� !+�F4� 4� 4� 4�:= � = � = �~<� <� <�,%� %� %�N7 � 7 � 7 � 7 � 7 r r c �: � t j t | � � d S r� )r � run_unittestr )�debugs r � test_mainr� � s � � ���E�*�*�*�*�*r �__main__)�off)r ) �guppy.heapy.testr rr �os.pathr� r r r� r �guppy.heapy.Remoter� r r r �<module>r� s� �� %� $� $� $� $� $� ���� ���� � � � � �w� � � � �{ � { � { � { � { �� { � { � { �| +� +� +� +� �z���&�&�&�&�&�&��C�E�E�E� �I�K�K�K�K�K� �r __pycache__/test_OutputHandling.cpython-311.pyc 0000644 00000006632 15004413005 0015461 0 ustar 00 � ��bg` � �d � d dl mZ G d� dej � � Zdd�Zedk r e� � dS dS )� )�supportc � � e Zd Zd� Zd� ZdS )� FirstCasec �f � t j � | � � | j j | _ d S �N)r �TestCase�setUp�heapy�OutputHandling�OH)�selfs �w/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_OutputHandling.pyr zFirstCase.setUp s) � ��� � �t�$�$�$��*�+����� c �4 � G d� d� � }| � t || d� � � � d� � || dd� � � }| � t |� � d� � |j }| � t |� � d� � | � t |j � � d� � | � t |j � � d � � || dd � � � � }| � t |� � d � � d S ) Nc � � e Zd Zdd�ZdS )�FirstCase.test_1.<locals>.TNc �b �� |j }�fd�}|| _ |� | |d||�� � d S )Nc 3 �> �K � t �� � D ] } d| z V � � d S )Nz%d)�range)�i�numliness �r � get_line_iterz;FirstCase.test_1.<locals>.T.__init__.<locals>.get_line_iter s5 �� � � � "�8�_�_� '� '�� "�Q�h�����'� 'r � )r �max_more_lines� get_num_lines� get_more_msg)r �mod�setup_printing)r �testr r r r r s ` r �__init__z$FirstCase.test_1.<locals>.T.__init__ sb �� ��g��'� '� '� '� '� ����"�"��"/�#$�"/�!-� #� /� /� /� /� /r )NN)�__name__� __module__� __qualname__r � r r �Tr s( � � � � � � /� /� /� /� /� /r r% r z0 1 2 3� c � � dS )Nr& r$ r$ r r �<lambda>z"FirstCase.test_1.<locals>.<lambda> s � �q� r z70 1 2 3 <Lines 0..3 of 6. Type e.g. '_.more' for more.>z4 5z 0 1 2 3 4 5c � � dd|z z S )Nz<%d more rows>r& r$ )�f�ts r r( z"FirstCase.test_1.<locals>.<lambda>' s � �1A�Q�q�S�1I� r )r z0 1 2 3 <3 more rows>)�aseq�str�more�top�all)r r% r+ �xs r �test_1zFirstCase.test_1 s, � � /� /� /� /� /� /� /� /� � � �#�a�a��a�j�j�/�/�<�0�0�0� �A�d�A�y�y� !� !�� � � � ��F�F�Q� S� S� S� �F�� � � �#�a�&�&�&�!�!�!� � � � ���J�J�U� W� W� W� � � �#�a�e�*�*� 0�1�1�1� �A�d�A�$I�$I� J� J� J�� � � �#�a�&�&�5�6�6�6�6�6r N)r! r" r# r r2 r$ r r r r s2 � � � � � �,� ,� ,� 7� 7� 7� 7� 7r r c �: � t j t | � � d S r )r � run_unittestr )�debugs r � test_mainr6 + s � � ���E�*�*�*�*�*r �__main__N)r )�guppy.heapy.testr r r r6 r! r$ r r �<module>r9 s} �� $� $� $� $� $� $�$7� $7� $7� $7� $7�� � $7� $7� $7�N+� +� +� +� �z��� �I�K�K�K�K�K� �r __pycache__/test_Part.cpython-311.pyc 0000644 00000037050 15004413005 0013420 0 ustar 00 � ��bg�( � � � d dl mZ dZ G d� dej � � Z G d� dej � � Z G d� dej � � Zd d �Zed k r e� � d S d S ) � )�support� c � � e Zd Zd� Zd� Zd� ZdS )� IdentityCasec � � dd l }dd l}dd l}t t d� � � � }|� |� � d� |D � � } | j |� j }|� d� � }| � t |� � dz t |j � � z dz d� ||dz t |� |gdz � � � � �� � � � | � t |j � � dz d � ||dz t |� |gdz � � � � �� � � � d S ) Nr �d c �, � g | ]}t |� � ��S � )�float)�.0�is �m/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_Part.py� <listcomp>z'IdentityCase.test_1.<locals>.<listcomp> s � � #� #� #�1�e�A�h�h� #� #� #� g � aJ Set of 100 <float> objects. Total size = {sztotal} bytes. Index Size % Cumulative % Value 0 {sz:>3} 1.0 {szacc[0]:>4} 1.0 0.0 1 {sz:>3} 1.0 {szacc[1]:>4} 2.0 1.0 2 {sz:>3} 1.0 {szacc[2]:>4} 3.0 2.0 3 {sz:>3} 1.0 {szacc[3]:>4} 4.0 3.0 4 {sz:>3} 1.0 {szacc[4]:>4} 5.0 4.0 5 {sz:>3} 1.0 {szacc[5]:>4} 6.0 5.0 6 {sz:>3} 1.0 {szacc[6]:>4} 7.0 6.0 7 {sz:>3} 1.0 {szacc[7]:>4} 8.0 7.0 8 {sz:>3} 1.0 {szacc[8]:>4} 9.0 8.0 9 {sz:>3} 1.0 {szacc[9]:>4} 10.0 9.0 <90 more rows. Type e.g. '_.more' to view.> Index Size % Cumulative % Value 10 {sz:>3} 1.0 {szacc[10]:>4} 11.0 10.0 11 {sz:>3} 1.0 {szacc[11]:>4} 12.0 11.0 12 {sz:>3} 1.0 {szacc[12]:>4} 13.0 12.0 13 {sz:>3} 1.0 {szacc[13]:>4} 14.0 13.0 14 {sz:>3} 1.0 {szacc[14]:>4} 15.0 14.0 15 {sz:>3} 1.0 {szacc[15]:>4} 16.0 15.0 16 {sz:>3} 1.0 {szacc[16]:>4} 17.0 16.0 17 {sz:>3} 1.0 {szacc[17]:>4} 18.0 17.0 18 {sz:>3} 1.0 {szacc[18]:>4} 19.0 18.0 19 {sz:>3} 1.0 {szacc[19]:>4} 20.0 19.0 <80 more rows. Type e.g. '_.more' to view.> � )�sz�sztotal�szacca� Set of 100 <float> objects. Total size = {sztotal} bytes. Index Size % Cumulative % Value 0 {sz:>3} 1.0 {szacc[0]:>4} 1.0 0.0 1 {sz:>3} 1.0 {szacc[1]:>4} 2.0 1.0 2 {sz:>3} 1.0 {szacc[2]:>4} 3.0 2.0 3 {sz:>3} 1.0 {szacc[3]:>4} 4.0 3.0 4 {sz:>3} 1.0 {szacc[4]:>4} 5.0 4.0 5 {sz:>3} 1.0 {szacc[5]:>4} 6.0 5.0 6 {sz:>3} 1.0 {szacc[6]:>4} 7.0 6.0 7 {sz:>3} 1.0 {szacc[7]:>4} 8.0 7.0 8 {sz:>3} 1.0 {szacc[8]:>4} 9.0 8.0 9 {sz:>3} 1.0 {szacc[9]:>4} 10.0 9.0 10 {sz:>3} 1.0 {szacc[10]:>4} 11.0 10.0 11 {sz:>3} 1.0 {szacc[11]:>4} 12.0 11.0 12 {sz:>3} 1.0 {szacc[12]:>4} 13.0 12.0 13 {sz:>3} 1.0 {szacc[13]:>4} 14.0 13.0 14 {sz:>3} 1.0 {szacc[14]:>4} 15.0 14.0 15 {sz:>3} 1.0 {szacc[15]:>4} 16.0 15.0 16 {sz:>3} 1.0 {szacc[16]:>4} 17.0 16.0 17 {sz:>3} 1.0 {szacc[17]:>4} 18.0 17.0 18 {sz:>3} 1.0 {szacc[18]:>4} 19.0 18.0 19 {sz:>3} 1.0 {szacc[19]:>4} 20.0 19.0 20 {sz:>3} 1.0 {szacc[20]:>4} 21.0 20.0 21 {sz:>3} 1.0 {szacc[21]:>4} 22.0 21.0 22 {sz:>3} 1.0 {szacc[22]:>4} 23.0 22.0 23 {sz:>3} 1.0 {szacc[23]:>4} 24.0 23.0 24 {sz:>3} 1.0 {szacc[24]:>4} 25.0 24.0 25 {sz:>3} 1.0 {szacc[25]:>4} 26.0 25.0 26 {sz:>3} 1.0 {szacc[26]:>4} 27.0 26.0 27 {sz:>3} 1.0 {szacc[27]:>4} 28.0 27.0 28 {sz:>3} 1.0 {szacc[28]:>4} 29.0 28.0 29 {sz:>3} 1.0 {szacc[29]:>4} 30.0 29.0 30 {sz:>3} 1.0 {szacc[30]:>4} 31.0 30.0 31 {sz:>3} 1.0 {szacc[31]:>4} 32.0 31.0 32 {sz:>3} 1.0 {szacc[32]:>4} 33.0 32.0 33 {sz:>3} 1.0 {szacc[33]:>4} 34.0 33.0 34 {sz:>3} 1.0 {szacc[34]:>4} 35.0 34.0 35 {sz:>3} 1.0 {szacc[35]:>4} 36.0 35.0 36 {sz:>3} 1.0 {szacc[36]:>4} 37.0 36.0 37 {sz:>3} 1.0 {szacc[37]:>4} 38.0 37.0 38 {sz:>3} 1.0 {szacc[38]:>4} 39.0 38.0 39 {sz:>3} 1.0 {szacc[39]:>4} 40.0 39.0 40 {sz:>3} 1.0 {szacc[40]:>4} 41.0 40.0 41 {sz:>3} 1.0 {szacc[41]:>4} 42.0 41.0 42 {sz:>3} 1.0 {szacc[42]:>4} 43.0 42.0 43 {sz:>3} 1.0 {szacc[43]:>4} 44.0 43.0 44 {sz:>3} 1.0 {szacc[44]:>4} 45.0 44.0 45 {sz:>3} 1.0 {szacc[45]:>4} 46.0 45.0 46 {sz:>3} 1.0 {szacc[46]:>4} 47.0 46.0 47 {sz:>3} 1.0 {szacc[47]:>4} 48.0 47.0 48 {sz:>3} 1.0 {szacc[48]:>4} 49.0 48.0 49 {sz:>3} 1.0 {szacc[49]:>4} 50.0 49.0 50 {sz:>3} 1.0 {szacc[50]:>4} 51.0 50.0 51 {sz:>3} 1.0 {szacc[51]:>4} 52.0 51.0 52 {sz:>3} 1.0 {szacc[52]:>4} 53.0 52.0 53 {sz:>3} 1.0 {szacc[53]:>4} 54.0 53.0 54 {sz:>3} 1.0 {szacc[54]:>4} 55.0 54.0 55 {sz:>3} 1.0 {szacc[55]:>4} 56.0 55.0 56 {sz:>3} 1.0 {szacc[56]:>4} 57.0 56.0 57 {sz:>3} 1.0 {szacc[57]:>4} 58.0 57.0 58 {sz:>3} 1.0 {szacc[58]:>4} 59.0 58.0 59 {sz:>3} 1.0 {szacc[59]:>4} 60.0 59.0 60 {sz:>3} 1.0 {szacc[60]:>4} 61.0 60.0 61 {sz:>3} 1.0 {szacc[61]:>4} 62.0 61.0 62 {sz:>3} 1.0 {szacc[62]:>4} 63.0 62.0 63 {sz:>3} 1.0 {szacc[63]:>4} 64.0 63.0 64 {sz:>3} 1.0 {szacc[64]:>4} 65.0 64.0 65 {sz:>3} 1.0 {szacc[65]:>4} 66.0 65.0 66 {sz:>3} 1.0 {szacc[66]:>4} 67.0 66.0 67 {sz:>3} 1.0 {szacc[67]:>4} 68.0 67.0 68 {sz:>3} 1.0 {szacc[68]:>4} 69.0 68.0 69 {sz:>3} 1.0 {szacc[69]:>4} 70.0 69.0 70 {sz:>3} 1.0 {szacc[70]:>4} 71.0 70.0 71 {sz:>3} 1.0 {szacc[71]:>4} 72.0 71.0 72 {sz:>3} 1.0 {szacc[72]:>4} 73.0 72.0 73 {sz:>3} 1.0 {szacc[73]:>4} 74.0 73.0 74 {sz:>3} 1.0 {szacc[74]:>4} 75.0 74.0 75 {sz:>3} 1.0 {szacc[75]:>4} 76.0 75.0 76 {sz:>3} 1.0 {szacc[76]:>4} 77.0 76.0 77 {sz:>3} 1.0 {szacc[77]:>4} 78.0 77.0 78 {sz:>3} 1.0 {szacc[78]:>4} 79.0 78.0 79 {sz:>3} 1.0 {szacc[79]:>4} 80.0 79.0 80 {sz:>3} 1.0 {szacc[80]:>4} 81.0 80.0 81 {sz:>3} 1.0 {szacc[81]:>4} 82.0 81.0 82 {sz:>3} 1.0 {szacc[82]:>4} 83.0 82.0 83 {sz:>3} 1.0 {szacc[83]:>4} 84.0 83.0 84 {sz:>3} 1.0 {szacc[84]:>4} 85.0 84.0 85 {sz:>3} 1.0 {szacc[85]:>4} 86.0 85.0 86 {sz:>3} 1.0 {szacc[86]:>4} 87.0 86.0 87 {sz:>3} 1.0 {szacc[87]:>4} 88.0 87.0 88 {sz:>3} 1.0 {szacc[88]:>4} 89.0 88.0 89 {sz:>3} 1.0 {szacc[89]:>4} 90.0 89.0 90 {sz:>3} 1.0 {szacc[90]:>4} 91.0 90.0 91 {sz:>3} 1.0 {szacc[91]:>4} 92.0 91.0 92 {sz:>3} 1.0 {szacc[92]:>4} 93.0 92.0 93 {sz:>3} 1.0 {szacc[93]:>4} 94.0 93.0 94 {sz:>3} 1.0 {szacc[94]:>4} 95.0 94.0 95 {sz:>3} 1.0 {szacc[95]:>4} 96.0 95.0 96 {sz:>3} 1.0 {szacc[96]:>4} 97.0 96.0 97 {sz:>3} 1.0 {szacc[97]:>4} 98.0 97.0 98 {sz:>3} 1.0 {szacc[98]:>4} 99.0 98.0 99 {sz:>3} 1.0 {szacc[99]:>4} 100.0 99.0 )� itertools�random�sys�list�range�shuffle�iso�byid� getsizeof�aseq�str�more�format� accumulate�all)�selfr r r �vs�xr s r �test_1zIdentityCase.test_1 si � ������ � � �� � � � �%��*�*� � �����r���� #� #�� #� #� #�� �D�H�b�M� �� �]�]�3� � �� � � �#�a�&�&��+�c�!�&�k�k�)�$�.� 1�4 �F�b�"�S�&��i�*�*�B�4�"�9�5�5�6�6� � 8� 8�5 9� 9� 9�: � � �#�a�e�*�*�T�/� g$�N �F�b�"�S�&��i�*�*�B�4�#�:�6�6�7�7� � 9� 9�Oh :� h :� h :� h :� h :r c �p � �� g }t d� � D ] }dD ]}|� ||z � � �� � j |� j }d� ��� fd�}t ddd� � D ] }||d � } |||j � � � � � |j d j |j d j j � � d S ) Nr �abcc � �� t | � � � d� � }|d � d� � �|dd � }|d � d� � r|� � � �fd�|D � � }|S )Nr r �Representation� ����<c �$ �� g | ] }|�d � �� S �Nr )r �line�dataposs �r r z3IdentityCase.test_2.<locals>.ae.<locals>.<listcomp>� s! �� �.�.�.�D��g�h�h� �.�.�.r )r �split�index� startswith�pop)r' �lines�sr3 s @r �aez IdentityCase.test_2.<locals>.ae� s� �� ���F�F�L�L��&�&�E��A�h�n�n�%5�6�6�G��a�b�b� �A���u� � ��$�$� �������.�.�.�.�A�.�.�.�A��Hr c �X �� �� �| � � �|� � � � d S r1 )r )r' �yr: r% s ��r �aeqz IdentityCase.test_2.<locals>.aeq� s- �� � �I�I�b�b��e�e�R�R��U�U� #� #� #� #� #r r i, �< r- )r �appendr r r �bysize�kind)r% �ssr �cr' r= �br: s ` @r �test_2zIdentityCase.test_2� s� ��� � ���s��� � �A�� � ��� � �!�A�#����� � �D�H�b�M� �� � � � $� $� $� $� $� $� �q�#�r�"�"� � �A��!�"�"��A� �C��1�6�N�N�N�N� � � �!�(�1�+�"�A�H�Q�K�$6�$;�<�<�<�<�<r c �p � | j } |j g g gt t d� � � � �R � j }|d |dd� |d |dd� |j d |j d g}|d j j }t t |� � � � D ]�}| � || ||dz t |� � z � � | � || j ||dz t |� � z j � � | � || j |� � ��d S )Nr i����i����� � r ) �User r r r �partsrA �lenr )r% �hpr' �eq�kr s r �test_3zIdentityCase.test_3� s � � �X�� �B�F�2�r� ,�D��r���O�O� ,� ,� ,� 1����f�a��B��i��2���"�R�%���g�c�l�A�G�B�K�)�� �c�F�K� ���s�2�w�w� � � %� %�A� �I�I�b��e�R��Q��#�b�'�'� 1� 2� 3� 3� 3� �I�I�b��e�j�"�a�!�e�s�2�w�w�%6�"7�"<� =� =� =� �I�I�b��e�j�!� $� $� $� $� %� %r N)�__name__� __module__� __qualname__r( rE rO r r r r r sE � � � � � �O:� O:� O:�b=� =� =�8%� %� %� %� %r r c � � e Zd Zd� ZdS )� MixedCasec � � | � dddddd� � }t s#| � t |� � d� � |j � � � D ]%}| � |j |j k � � �&d S )Nr r- g �?g @�1�2a Partition of a set of 6 objects. Total size = 204 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 2 33 100 49 100 49 str 1 2 33 56 27 156 76 int 2 2 33 48 24 204 100 float) r � PORTABLE_TESTr r � partition�get_rows� assertTrue�setrA )r% r' �rows r r( zMixedCase.test_1� s� � � �H�H�Q��3��S�#� .� .�� � 7� �I�I�c�!�f�f� 6� 7� 7� 7� �;�'�'�)�)� 1� 1�C� �O�O�C�G�s�x� /� 0� 0� 0� 0� 1� 1r N�rP rQ rR r( r r r rT rT � s# � � � � � � 1� 1� 1� 1� 1r rT c � � e Zd Zd� ZdS )�StatCasec � � | j } G d� d� � } |� � } G d� d� � } |� � }|� ||� � }|� |� � }|� |� � }| � |j d� � | � |d j d� � |� |� � }| � |j d� � | � |d j d� � |� |� � � � � }| � |j d� � | � |d j d� � |� � � � |� � }| � |j d� � | � |d j d� � d S ) Nc � � e Zd ZdS ��StatCase.test_1.<locals>.CN�rP rQ rR r r r �Crd � � � � � � � � �Dr rf c � � e Zd ZdS rc re r r r rf zStatCase.test_1.<locals>.C� rg r r r r. r- ���)rI r �diffr �count)r% rL rf �c0�c1r' r< �ds r r( zStatCase.test_1� s� � � �X�� � � � � � � � � �Q�S�S�� � � � � � � � � �Q�S�S�� �F�F�2�r�N�N�� �F�F�2�J�J�� �F�F�1�I�I�� � � �!�'�1� � � � � � �!�A�$�*�a� � � � �F�F�1�I�I�� � � �!�'�2� � � � � � �!�A�$�*�b�!�!�!� �F�F�2�6�6�8�8� � �� � � �!�'�1� � � � � � �!�A�$�*�a� � � � �F�F�H�H�M�M�!� � �� � � �!�'�2� � � � � � �!�A�$�*�b�!�!�!�!�!r Nr^ r r r r` r` � s# � � � � � �"� "� "� "� "r r` c � � t j t | � � t j t | � � t j t | � � d S r1 )r � run_unittestr` r rT )�debugs r � test_mainrr � sA � � ���5�)�)�)� �� �u�-�-�-� ���E�*�*�*�*�*r �__main__N)r ) �guppy.heapy.testr rX �TestCaser rT r` rr rP r r r �<module>rv s� �� $� $� $� $� $� $�� �~%� ~%� ~%� ~%� ~%�7�#� ~%� ~%� ~%�B 1� 1� 1� 1� 1�� � 1� 1� 1� "� "� "� "� "�w� � "� "� "�>+� +� +� +� �z��� �I�K�K�K�K�K� �r __pycache__/test_Path.cpython-311.pyc 0000644 00000141652 15004413005 0013412 0 ustar 00 � ��bgLs � �$ � d dl mZ d dlZd dlZ G d� dej � � Z G d� de� � Z G d� de� � Z G d � d e� � Z G d � d e� � Z G d � de� � Z G d� de� � Z dd�Z dd�Z e dk r e � � dS dS )� )�supportNc �8 � e Zd Zd� Zdd�Zd� Zd d�Zd� Zd d�ZdS ) �TestCasec �f � t j � | � � | j j | _ d S �N)r r �setUp�heapy�Path��selfs �m/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_Path.pyr zTestCase.setUp s( � ��� � �t�$�$�$��J�O�� � � � Nc � � | � ||� � }|�#| � t ||� � � � |�t |� � d S t |� � }|� d� � rs|� d� � s^| � |� d� � � � |dd� � d� � }| � ||v � � d S | � ||� � d S )N�<�>� ����,) �relation� assertTrue� isinstance�print�str� startswith�endswith�split�aseq)r �src�dst�relstr�clas�rel�srs r �chkrelzTestCase.chkrel s� � ��m�m�C��%�%�� � � �O�O�J�s�D� 1� 1� 2� 2� 2� �>� �#�J�J�J�J�J��S���B��}�}�S�!�!� &�&�*;�*;�C�*@�*@� &����� � �C� 0� 0�1�1�1���"��X�^�^�C�(�(������"� �-�-�-�-�-�� � �"�f�%�%�%�%�%r c �` � |D ]*}| � |t ||� � d|z � � �+d S )Nz%s.)r$ �getattr)r r �attrs�attrs r � chkrelattrzTestCase.chkrelattr sB � �� =� =�D� �K�K��W�S�$� /� /��t�� <� <� <� <� =� =r c � � | � ||� � }|�t |� � d S |� � � }t |� � dk r|d }| � t |� � t |� � d� � d S )Nr r r )�shpathsr �aslist�lenr r )r r r �expectr" �lis r �chkpathzTestCase.chkpath sv � ��l�l�3��$�$�� �>� �#�J�J�J�J�J���� � �B��2�w�w�!�|�|���U�� �I�I�c�"�g�g�s�6�{�{�B� /� /� /� /� /r c �8 � | j � ||� � S r )r r )r r r s r r zTestCase.relation( s � ��y�!�!�#�s�+�+�+r c �| � | � |� � }|�| � |� � } |j |g|�R i |��S r )�iso� get_shpaths)r r r �args�kwdss r r+ zTestCase.shpaths+ sI � � �h�h�s�m�m�� �?��(�(�3�-�-�C� �s��s�2�T�2�2�2�T�2�2�2r )NNr ) �__name__� __module__� __qualname__r r$ r) r0 r r+ � r r r r s} � � � � � �$� $� $� &� &� &� &� =� =� =�0� 0� 0� 0�,� ,� ,�3� 3� 3� 3� 3� 3r r c �n � e Zd Zd� Zd� Zd� Zd� Zd� Zd� Zd� Z d� Z d � Z d � Z d � Z d � Zd � Zd� Zd� Zd� ZdS )�RelationTestCasec �Z �� g ��fd�}| � |j d �d� � d S )Nc � �� � S r r: )� cellvalues �r �fz.RelationTestCase.test_cell_relation.<locals>.f: s �� � � r r z%s.cell_contents)r$ � __closure__)r r@ r? s @r �test_cell_relationz#RelationTestCase.test_cell_relation7 sE �� �� � � � � � � � � �A�M�!�$�i�1C�D�D�D�D�Dr c �� � � � fd�}|j }� � |dd� � d}� j dk r|dz }n|dz }� j dk r|d z }n|d z } � j |g|�R � d S ) Nc � �� d} �| fS )N� r: )�ar s �r r@ z.RelationTestCase.test_code_relation.<locals>.f? s �� ��A���7�Nr rE z%s.co_consts[1])�co_code� co_consts�co_names� co_filename�co_name�rE � )� co_varnames� co_freevars� co_cellvars)�co_exceptiontable� co_qualname)rE � )� co_linetable)� co_lnotab)�__code__r0 � version_infor) )r r@ �co�relAttrs ` r �test_code_relationz#RelationTestCase.test_code_relation> s� �� � � � � � � �Z�� � � �R�� -�.�.�.�-�� � �w� &� &� �D� D�G�G� �;� ;�G� � �� '� '� �(� (�G�G� �~� %�G�����%�W�%�%�%�%�%�%r c �J � d}d}d}d}t t d� � � � }t t dd� � � � }||||||i}| � ||d� � | � ||d� � | � ||d � � t | � ||� � � � t | � ||� � � � t | � ||� � � � g}|� � � | � |g d �� � d S ) N�k1�k2�v1�v2�d �� �%s['k1']z%s['k2']z%s[(0, 1, 2, 3, 4, 5, ...)])z %s.keys()[0]z %s.keys()[1]z %s.keys()[2])�tuple�ranger$ r r �sortr ) r r\ r] r^ r_ �k3�v3�x�kss r �test_dict_relationz#RelationTestCase.test_dict_relationR s � � �� �� �� �� �5��:�:� � �� �5��c�?�?� #� #�� ��R��R�� $�� � � �A�r�:�&�&�&� � � �A�r�:�&�&�&� � � �A�r�8�9�9�9��$�-�-��2�&�&�'�'��$�-�-��2�&�&�'�'��$�-�-��2�&�&�'�'�)�� ��� � � � � � �"�F�F�F�G�G�G�G�Gr c � �� d� G �fd�dt � � }|j }| � |�d� � | � |�d� � d S )Nr^ c � �� e Zd Z� ZdS )�3RelationTestCase.test_dictproxy_relation.<locals>.TN)r7 r8 r9 r\ )r^ s �r �Trm f s �� � � � � ��B�B�Br rn z%s->mapping['k1']rb )�object�__dict__r0 r$ )r rn rh r^ s @r �test_dictproxy_relationz(RelationTestCase.test_dictproxy_relationc sv �� � �� � � � � � � �� � � � �J�� � � �Q�� /�0�0�0� � � �A�r�:�&�&�&�&�&r c �� � �� t j � � }d� |_ � � |dddddd� � g }� � ||d� j j � � � g }g �d� �fd � } |d � � \ }}}~~� � |� d � j j � � � � � ||d� j j � � � � � |�d� j j � � � d S )Nc � � d S r r: r: r r �<lambda>z6RelationTestCase.test_frame_relation.<locals>.<lambda>n s � �D� r �f_back� f_builtins�f_code� f_globals�f_locals�f_tracez%s.f_locals['a'])r! rE c �4 �� t j � � }�|�fS r )�inspect� currentframe)rh �y�framer �zs ��r �funcz2RelationTestCase.test_frame_relation.<locals>.func} s �� ��(�*�*�E����>� !r r z%s.f_locals ['self']z%s.f_locals['x']z%s.f_locals ['z']�rE )r| r} rz r) r$ r � R_LOCAL_VAR�R_CELL) r r@ rF rh r� �_r �__r� s ` @r �test_frame_relationz$RelationTestCase.test_frame_relationl s ��� � � � "� "�� �L�� � ����8�\�8�[�"�I� /� /� /� �� � � �A�q�,�4�9�3H� �I�I�I� �� �� "� "� "� "� "� "� "� �t�A�w�w� ��5�"� �r� � � �E�4�!7�d�i�>N� �O�O�O� � � �A�q�,�4�9�3H� �I�I�I� � � �A�q�-�D�I�4D� �E�E�E�E�Er c �\ � � d � fd� }g |_ � � |ddddddd d � � d S ) NrE c � �� �S r r: )rh r~ r s �r r@ z2RelationTestCase.test_function_relation.<locals>.f� s �� ��Kr rV � __globals__� __defaults__rA �__doc__r7 rp rF r� )rF r) )r r@ s ` r �test_function_relationz'RelationTestCase.test_function_relation� s\ �� � � � � � � ���� ����:�}�n�%�y�*�j�� � � � � r c �l � G d� d� � } |� � }| � |j dd� � d S )Nc � � e Zd Zd� ZdS )�8RelationTestCase.test_instancemethod_relation.<locals>.Tc � � d S r r: �rh s r r@ z:RelationTestCase.test_instancemethod_relation.<locals>.T.f� s � ��r N)r7 r8 r9 r@ r: r r rn r� � s# � � � � � � � � � � r rn �__func__�__self__)r) r@ )r rn �ts r � test_instancemethod_relationz-RelationTestCase.test_instancemethod_relation� sU � � � � � � � � � � �A�C�C�� �����Z��4�4�4�4�4r c �� � d}d}t t dd� � � � }|||g}| � ||d� � | � ||d� � | � ||d� � d S �Nr^ r_ r` ra �%s[0]�%s[1]z%s[2]��listrd r$ �r r^ r_ rg rh s r �test_list_relationz#RelationTestCase.test_list_relation� �t � � �� �� �%��S�/�/� "� "�� ��R�L�� � � �A�r�7�#�#�#� � � �A�r�7�#�#�#� � � �A�r�7�#�#�#�#�#r c �B � g }| � |j |d� � d S )Nz %s.__self__)r$ �append)r rh s r �test_meth_relationz#RelationTestCase.test_meth_relation� s% � � �� � � �A�H�a� �/�/�/�/�/r c �> � | � t dd� � d S )Nrp r )r) �unittestr s r �test_module_relationz%RelationTestCase.test_module_relation� s � � ����*�j�9�9�9�9�9r c �J � d}d}||g}| j j � ||f||fg� � }| � ||d� � | � ||d� � | � ||d� � | � ||d� � | � ||ddg� � d S )Nr r z%s->edges[0].srcz%s->edges[1].srcz#<%s->edges[0].tgt,%s->edges[1].tgt>z%s->edges[0].tgtz%s->edges[1].tgt)r �heapyc� NodeGraphr$ r0 )r rF �b�rl�rgs r �test_nodegraph_relationz(RelationTestCase.test_nodegraph_relation� s� � � �� ����V�� �Z� � (� (�1�b�'�A�r�7�);� <� <�� � � �B��-�.�.�.� � � �B��-�.�.�.� � � �B�� A�B�B�B� � � �R�� .�/�/�/� � � �R�� 0�2D� E�F�F�F�F�Fr c �� � ddl m}m} dg} ||� � ||� � fD ]A}t t |� � � � D ]"}| � ||| d|z � � �#�Bd S )Nr )� immnodeset� mutnodesetrF z list(%%s)[%s])� guppy.setsr� r� rd r- r$ )r r� r� rh �s�is r �test_nodeset_relationz&RelationTestCase.test_nodeset_relation� s� � �5�5�5�5�5�5�5�5� �E�� �*�Q�-�-���A� � �/� :� :�A��3�q�6�6�]�]� :� :��� � �A�q��t�_�q�%8�9�9�9�9� :� :� :r c �F �� G d� dt � � } |� � �g }|�_ g }|�_ | � �|d� � | � �dd� � | � t �fd�� � G d� d|� � } |� � }||_ | � ||d � � | � ||d � � g }||_ | � ||d � � | � ||j d � � G d � d|� � } |� � }||_ | � |d� � G d� d|� � } | � � } || _ || _ || _ g | _ g | _ | � | dddddd� � | � | | j d � � | � | | j d� � | � | | j d � � | � | | j d� � | � | | j d� � G d� dt � � } G d� d| |� � } | � � } || _ || _ || _ | � | dddd� � | � | | j d � � | � | | j d� � | � | | j d � � | � | | j d � � | � | | j d d g� � | � | | j d � � d S )!Nc � � e Zd ZdZdS )�0RelationTestCase.test_object_relation.<locals>.T�rF r� N�r7 r8 r9 � __slots__r: r r rn r� � s � � � � � � �I�I�Ir rn z %s->ob_typerF r� c � �� � j S r )rp )r� s �r rt z7RelationTestCase.test_object_relation.<locals>.<lambda>� s �� �!�*� r c � � e Zd ZdS )�0RelationTestCase.test_object_relation.<locals>.UN�r7 r8 r9 r: r r �Ur� � � � � � � � � �Dr r� z%s->ob_type.__base__z%s.az%s.cz %s.__dict__c � � e Zd ZdS )�0RelationTestCase.test_object_relation.<locals>.VNr� r: r r �Vr� � r� r r� rp c � � e Zd ZdZdS )�0RelationTestCase.test_object_relation.<locals>.W)�c�dr� Nr� r: r r �Wr� � s � � � � � �%�I� �Dr r� r� r� �ez%s.bz%s.dz%s.__dict__['e']c � � e Zd Zg ZdS )�0RelationTestCase.test_object_relation.<locals>.RN)r7 r8 r9 �rvarr: r r �Rr� � � � � � � � ��D�D�Dr r� c � � e Zd Zg ZdS )�0RelationTestCase.test_object_relation.<locals>.SN)r7 r8 r9 �svarr: r r �Sr� � r� r r� z%s.__dict__['c']z %s->ob_type.__dict__['svar']z)%s->ob_type.__bases__[0].__dict__['rvar']z'%s->ob_type.__mro__[1].__dict__['rvar']z*%s->ob_type.__base__.__dict__['__slots__'])ro rF r� r$ r) � assertRaises�AttributeErrorr0 r� rp r� r� r� r� r� )r rn rF r� r� �ur� r� �vr� �wr� r� r� r� s @r �test_object_relationz%RelationTestCase.test_object_relation� s� �� � !� !� !� !� !�� !� !� !� �A�C�C�� ����� ����� � � �A�q�-�(�(�(� ����3��$�$�$� ���.�*<�*<�*<�*<�=�=�=� � � � � �� � � � �A�C�C����� � � �Q��1�2�2�2� � � �A�q�&�!�!�!� ����� � � �A�q�&�!�!�!� � � �A�q�z�=�1�1�1� � � � � �� � � � �A�C�C����� ����:�&�&�&� � � � � �� � � � �A�C�C����������������� ����:�s�C��c�3�?�?�?� � � �Q���V�$�$�$� � � �Q���V�$�$�$� � � �Q���V�$�$�$� � � �Q���V�$�$�$� � � �Q��� /�0�0�0� � � � � �� � � � � � � � ��1� � � � �A�C�C����������� ����:�s�C��5�5�5� � � �Q���V�$�$�$� � � �Q���V�$�$�$� � � �Q��� /�0�0�0� � � �Q��� >�?�?�?� � � �Q���!L�!J�!L� M� M� M� � � �Q�� �A� C� C� C� C� Cr c � � dd l } d� } |� � n(# t $ r |� � � \ }}}Y nw xY w| � |dd� � d S )Nr c � � ddz d S )Nr r r: r: r r �gz3RelationTestCase.test_traceback_relation.<locals>.g s � ��!����r �tb_next�tb_frame)�sys�ZeroDivisionError�exc_infor) )r r� r� �type�value� tracebacks r �test_traceback_relationz(RelationTestCase.test_traceback_relation s{ � �� � � � 4� � � � �A�C�C�C�C�� � 4� 4� 4�%(�\�\�^�^� "�D�%���� 4���� ��� �9�j�9�9�9�9�9s � �"9�9c �� � d}d}t t dd� � � � }|||f}| � ||d� � | � ||d� � | � ||d� � d S r� r� r� s r �test_tuple_relationz$RelationTestCase.test_tuple_relation r� r c �� � d}t }|f}ddi}t |||� � }| � ||j d� � | � ||j d� � | � |ddd� � d S ) Nrn r� r� z%s.__dict__['a']z%s.__dict__['__slots__']�__mro__�__base__� __bases__)ro r� r0 rF r� r) )r �name�base�bases�dictrn s r �test_type_relationz#RelationTestCase.test_type_relation s� � ���������Z�(�� ��u�d� #� #�� � � �Q��� /�0�0�0� � � �Q�� �%?�@�@�@� ����9�j�+�>�>�>�>�>r N)r7 r8 r9 rB rZ rj rq r� r� r� r� r� r� r� r� r� r� r� r� r: r r r< r< 4 s � � � � � �E� E� E�&� &� &�(H� H� H�"'� '� '�F� F� F�B � � �5� 5� 5�$� $� $�0� 0� 0�:� :� :� G� G� G�:� :� :�FC� FC� FC�P:� :� :�$� $� $� ?� ?� ?� ?� ?r r< c � � e Zd Zd� Zd� Zd� ZdS )� RootTestCasec � � dd l }dd l}| j j }t | � ||j � � � � }| � t |dz � � |j u � � | � |d� � t | � ||j � � � � }| � t |dz � � |j u � � | � |d� � t | � ||j � � � � }| � t |dz � � |j u � � | � |d� � dD ]Q}d|z }t | � |t ||� � � � � � }| � |d|z � � �R d dz d S # t $ �r� |� � � \ }}} |j d k rJt | � ||� � � � }| � t |dz � � |� � nhd D ]e}t | � |t |� � � � � � }| � t |dz � � t |� � � � �fd} | j } | j r| j } | d z } | j �t | � || � � � � }| � |� d � � � � t | � || j � � � � }| � t |dz � � | j � � | � |� d | z � � � � Y d S w xY w)Nr �rootz %s.i0_modules� %s.i0_sysdictz%s.i0_builtins)�codec_search_path�codec_search_cache�codec_error_registryzi0_%sz%%s.%sr rL )�exc_type� exc_value� exc_traceback�_f0z_f%d)r� �builtins�Viewr� r r �modulesr �evalr rp r& r� r� rW �asisr� ru r ) r r� r� r� r" r� r( r� r� r� �levelr s r �test_1zRootTestCase.test_1. s> � �� � � ������y�~�� �$�-�-��c�k�2�2�3�3�� ����S�6�\�*�*�c�k�9�:�:�:� � � �#��'�'�'��$�-�-��c�l�3�3�4�4�� ����S�6�\�*�*�c�l�:�;�;�;� � � �#��'�'�'��$�-�-��h�&7�8�8�9�9�� ����S�6�\�*�*�h�.?�?�@�@�@� � � �#�'�(�(�(�U� ,� ,�D��T�>�D��d�m�m�D�'�$��*=�*=�>�>�?�?�C� �I�I�c�8�d�?� +� +� +� +� :� �a�C�C�C�C�� � :� :� :�14� � � � � .�H�i� �� �7�*�*��$�-�-��i�8�8�9�9��� � �$�s�V�|�,�,�i�8�8�8�8� D� >� >�D� �d�m�m�D�$�t�*�*� =� =�>�>�C��I�I�d�3��<� 0� 0�$�t�*�*�=�=�=�=� �E�!�*�E��,� � � ���� �� �,� � �d�m�m�D�%�0�0�1�1�C� �O�O�C�L�L�� /� /� 0� 0� 0��d�m�m�D�-�*@�A�A�B�B�C� �I�I�d�3��<�(�(�-�*@� A� A� A� �O�O�C�L�L��%� � 8� 8� 9� 9� 9� 9� 9� 9�1 :���s �(F/ �/G M?�>M?c � � dd l }n # t $ r t d� � Y d S w xY w| j j }d� }d| _ |� || f� � | j s | j �| j }t | � ||� � � � }| � t |dz � � |� � d| _ | j s | j �d� }d| _ |� || f� � | j s | j �d S d S )Nr �%threading not enabled - skipping testc � � dd l } ddz d S # t $ r@ |� � � \ }}}|| _ d| _ | j r | j �d| _ Y d S w xY w)Nr r )r� r� r� r� �sync)r r� r� r� r� s r �taskz&RootTestCase.test_thread.<locals>.taskm s� � � �J�J�J� ��!������$� � � �58�\�\�^�^�2��)�]�!*��� �� ��i� �� �i� � �� � � � � ���s � �AA�Ar� c �< � | � � � d| _ d S �Nr )r r r s r r z&RootTestCase.test_thread.<locals>.task� s � � �K�K�M�M�M��D�I�I�Ir ) �_thread� ImportErrorr r� r� r �start_new_threadr� r r r� r� )r r r� r r� r" s r � test_threadzRootTestCase.test_threadd sV � � � �N�N�N�N��� � � � �9� :� :� :� �F�F� ���� �y�~�� � � � �� �� � ���w�/�/�/��)� � � �)� ��N� ��$�-�-��i�0�0�1�1�� � � �$�s�V�|�$�$�i�0�0�0��� ��)� � � �)� � � � � �� �� � ���w�/�/�/��)� � � �)� � � � � s � �$�$c �0 � dd l }|j dk rt d� � d S dd l}n # t $ r t d� � Y d S w xY wd}d| _ | j j � |d| i� � }| j j }dd l }|j }t | � ||� � � � }| � |d� � | j s | j �t | � || j � � � � }| � |d� � d| _ d S ) Nr )rE � z/multi-interpreter not supported past Python 3.9r z�import sys import _thread import time def task(): time.sleep(1) self.sysdict = sys.__dict__ self.sync = 1 while self.sync: pass _thread.start_new_thread(task, ()) r r� z %s.i1_sysdict)r� rW r r r r r r� � interpreterr� r� rp r r r �sysdict)r r� r � import_remote�thidr� r r" s r �test_secondary_interpreterz'RootTestCase.test_secondary_interpreter� s; � �� � � � � �v� %� %� �C� D� D� D� �F� � �N�N�N�N��� � � � �9� :� :� :� �F�F� ����� �" �� ��z� �,�,�]�V�T�N�K�K���y�~��� � � ��,���$�-�-��g�.�.�/�/�� � � �#��'�'�'��)� � � �)� � �$�-�-��d�l�3�3�4�4�� � � �#��'�'�'��� � � s �' �A�AN)r7 r8 r9 r r r r: r r r� r� - sC � � � � � �4:� 4:� 4:�l&� &� &�P-� -� -� -� -r r� c �@ � e Zd Zd� Zd d�Zd� Zd� Zd� Zd� Zd� Z d � Z dS ) � PathTestCasec �P � g }g }t |� � D ]}|� |g� � �|g|z }t |dz � � D ]\}g }t |� � D ]F}g }|� |� � t |� � D ] } |� || � � � �G|}�]|} | |fS r )rd r� ) r �width�lengthr �lsr� �xs�j�ys�kr s r � makegraphzPathTestCase.makegraph� s� � � �� ���u� � � � �A� �I�I�s�e� � � � ��U�U�]���v�a�x� � � � �A��B��5�\�\� %� %����� � �"� � � � �u� � � %� %�A��I�I�b��e�$�$�$�$�%��B�B����C�x�r Nc �f � | � ||� � \ }}| � |||� � d S r )r r0 )r r r r. r r s r �chkgraphzPathTestCase.chkgraph� s5 � ��>�>�%��0�0���S� � � �S�#�v�&�&�&�&�&r c � � d}| � |g|d� � | � g |g|d� � | � ||g|d� � | � |dg||dgg|d� � | � |dg|dgg|d� � | � dd� � \ }}| � ddd� � | � ddd � � | � ddddg� � | � d dg d �� � d S ) Nr r� r� z['%s[0]', '%s[1]']r � z['%s[0][0]', '%s[1][0]']r �%s[0][0]rE ) r# �%s[0][1]z%s[0][2]�%s[1][0]�%s[1][1]z%s[1][2]z%s[2][0]z%s[2][1]z%s[2][2])r0 r r )r r r s r � test_pathzPathTestCase.test_path� s6 � ��� � � �c�U�C��)�)�)� � � �b�#�Y��W�-�-�-� � � �c�3�Z��&:�;�;�;� � � �s�A�h��c�1�X�.��W�=�=�=� � � �s�A�h��a��)�3�0J�K�K�K��>�>�!�Q�'�'���S� � � �a��G�$�$�$� � � �a��J�'�'�'� � � �a��W�g� .�/�/�/� � � �a�� E� E� E� F� F� F� F� Fr c � � dD ]R\ }}| � ||� � \ }}| � ||� � }| � |j ||z � � �Sd S )N))r" r )� rE )rE r) )rS � )r r+ r �numpaths�r r r r r �ps r � test_numpathszPathTestCase.test_numpaths� sf � � A� 1� 1�O�U�F��~�~�e�V�4�4�H�C��� � �S�#�&�&�A� �I�I�a�j�%��-� 0� 0� 0� 0� 1� 1r c �B � | � dd� � \ }}| � ||� � }t |� � }g }|D ]$}|� t |� � � � �%|� � � | � |g d�� � d}d}d} | � ||� � \ }}| � ||� � }t |� � }t | � � D ]Z}t |� � } t | � � } t ||� � \ } } | � | dd|dz z z d| | fz z � � �[|}| � ||� � \ }}||d < | � ||� � }t |� � }t | � � D ]Z}t |� � } t | � � } t ||� � \ } } | � | d d|d z z z d| | fz z � � �[|dz }|� | � � |� |j |z � � fD ]W}t |� � D ]E\ }} t | � � } | � | dd |d z z |d z z z d ||z |z z z � � �F�Xd}d}|}|� ||� � D ]k} t | � � } t ||� � \ } } | � | d d|d z z z d| | fz z � � | � | j |� � |d z }�l| � ||� � d S )Nr" )r# r$ r% r& rM � r* �%s�[0]z[%d][%d]r r� rE �[%d]r � � ) r r+ �iterr� r re r rd �next�divmodr+ � enumerate�index)r r r r- �it�ssr� r r r+ �path�sp�div�mod�osrc� numfromend�start�stops r � test_iterzPathTestCase.test_iter� s{ � ��>�>�!�Q�'�'���S� �L�L��c� "� "�� �!�W�W�� ��� � �A� �I�I�c�!�f�f� � � � � ��� � � � � � �"�F�F�F�G�G�G� �������>�>�%��0�0���S� �L�L��c� "� "�� �!�W�W���x� � � I� I�A���8�8�D��T���B� �a��'�'�H�C�� �I�I�b�$�u�f�Q�h� /�/� �c�3�Z�0G�G� H� H� H� H� ���>�>�%��0�0���S���A�� �L�L��c� "� "�� �!�W�W���x� � � L� L�A���8�8�D��T���B� �a��'�'�H�C�� �I�I�b�'�%����"2�2�:��c� �3J�J� K� K� K� K� �Q�Y� ��6�6�:�+�&�&����q�z�*�/D�(E�(E�F� D� D�B�$�R�=�=� D� D���4���Y�Y��� � �"�d�F�e�A�g�$6�!�!�8�$%� %�%+�u�Z�/?��/A�%B� C� D� D� D� D� D� ���� ���F�F�5�$�'�'� � �D��T���B� �a��'�'�H�C�� �I�I�b�'�%����"2�2�:��c� �3J�J� K� K� K� �I�I�d�j�!� $� $� $� ��F�A�A� � � �!�T�����r c � � d}d}| � ||� � \ }}| � ||� � }d|_ | � t |� � d� � d|_ | � t |� � d� � d S )NrM � r z. 0: Src[0][0][0][0] <... 14640 more paths ...>r" �B 0: Src[0][0][0][0] 1: Src[0][0][0][1] <... 14639 more paths ...>)r r+ �maxpathsr r r, s r �test_strzPathTestCase.test_str1 s� � ������>�>�%��0�0���S� �L�L��c� "� "���� � � � �#�a�&�&�K�L�L�L��� � � � � ��F�F�Z� \� \� \� \� \r c �H � ddl m} |� � }|| j _ d}d}| � ||� � \ }}| � ||� � }d|_ | � t |� � d� � | � t |j � � d� � d S )Nr )�StringIOrM rG r" rH zB 2: Src[0][0][0][2] 3: Src[0][0][0][3] <... 14637 more paths ...>) �iorL r �outputr r+ rI r r �more)r rL rN r r r r r- s r � test_printingzPathTestCase.test_printing= s� � � � � � � � ������!�� �������>�>�%��0�0���S� �L�L��c� "� "���� � � � �#�a�&�&� � � � � � � �#�a�f�+�+� � � � � � r c � ��� d}d}| � ||� � \ }}| � ||� � �||z �| � ��j � � | � t �d � � dd|z z � � | � t �� � � dd|z z � � | � t �|dz � � dd|dz z z d|dz z z � � | � t �| � � dd|dz z z d z � � | � t �|dz � � dd|dz z z d z � � | � t ��dz � � dd|dz z |z z � � | � t �d � � dd|dz z |z z � � | � t ��fd �� � | � t ��fd �� � d S )NrE �( r r1 r2 r r3 r" z[1][0]z[1][1]r c � �� �� S r r: ��npr- s ��r rt z-PathTestCase.test_subscript.<locals>.<lambda>` s �� �a��e� r c � �� �� dz S r r: rT s ��r rt z-PathTestCase.test_subscript.<locals>.<lambda>a s �� �a���A��h� r )r r+ r r+ r r� � IndexError)r r r r r rU r- s @@r �test_subscriptzPathTestCase.test_subscriptP s� ��� ������>�>�%��0�0���S� �L�L��c� "� "�� �F�]�� � � �"�a�j�!�!�!� � � �#�a��d�)�)�T�%��,� .�/�/�/� � � �#�a���f�+�+�t�E�&�L� 0�1�1�1� � � �#�a��a��j�/�/�4��v�a�x�(8�#8�6�U�1�W�;M�#M�N�N�N� � � �#�a��h�-�-��e�V�A�X�&6�!6��!A�B�B�B� � � �#�a��a��j�/�/�4��v�a�x�(8�#8�8�#C�D�D�D� � � �#�a��1��g�,�,��f��a��&8�&�%@� @�A�A�A� � � �#�a��e�*�*�d�F�e�A�g�$6��#>� >�?�?�?� ���*�m�m�m�m�m�4�4�4� ���*�&6�&6�&6�&6�&6�7�7�7�7�7r r ) r7 r8 r9 r r r' r. rE rJ rP rX r: r r r r � s� � � � � � �� � �4'� '� '� '�F� F� F�"1� 1� 1� =� =� =�~ \� \� \� � � �&8� 8� 8� 8� 8r r c � � e Zd Zd� ZdS )� MultiTestCasec �d �� | j �g g g} �|d d � dz � � }�fd�|D � � }| j � ||� � }| � t |� � d� � | j � ||dd�� � }| � t |� � d� � d S )Nr" c �& �� g | ] } �|� � ��S r: r: )�.0rh r3 s �r � <listcomp>z)MultiTestCase.test_pp.<locals>.<listcomp>j s! �� �#�#�#�!�s�s�1�v�v�#�#�#r zI--- Dst[0] --- 0: Src[0] 1: Src[2] --- Dst[1] --- 0: Src[1] 1: Src[3]�A�B)�srcname�dstnamez=--- B[0] --- 0: A[0] 1: A[2] --- B[1] --- 0: A[1] 1: A[3])r3 r �shpgraphr r )r r r r- r3 s @r �test_ppzMultiTestCase.test_ppe s� �� ��h���2�h���c�#�a�a�a�&��(�m�m��#�#�#�#�s�#�#�#�� �I� � �s�C� (� (�� � � �#�a�&�&� � � � � �I� � �s�C��c� � B� B�� � � �#�a�&�&� � � � � � r N)r7 r8 r9 rd r: r r rZ rZ d s# � � � � � � � � � � r rZ c � � e Zd Zd� ZdS )� AvoidTestCasec � � dg}|}t d� � D ];}d|z g}d|z |g}|� |� � |� |� � |}�<|}| � ||� � }g dfdgdfdgd fd gd fddgd fdd gd fdd gdfg d�dfg d�dff D ]�\ }} | dz } | � || |j |� �� � } | � t | � � | � � |j |� } | � t | � � | � � |j |� } | � t | � � | � � ��|� d� � � d � � } | � t | � � d� � d S )Nr rE zb%dzc%dz %s[1][1][1]r z%s[2][1][1][1]r z%s[1][2][1][1]r" z%s[1][1][2][1]z%s[2][1][2][1][1]z%s[1][2][1][2][1]z%s[2][1][1][2][1])r r r" z%s[2][1][2][1][2][1])r" r r z 0: Src)� avoid_edgesz 0: Src[2][1][2][1][1])rd r� r+ �edges_atr r � copy_but_avoid_edges_at_levels�avoided) r r rF r� r� r� r r- �avoid�result�qs r r zAvoidTestCase.test_1~ s� � � �g�� ���q��� � �A���� �A����A��A� �H�H�Q�K�K�K� �H�H�Q�K�K�K��A�A��� �L�L��c� "� "�� � � &��S�(� )��S�(� )��S�(� )���V�+� ,���V�+� ,���V�+� ,� �Y�Y�.� /� �Y�Y�.� /� � &� &�M�E�6� �i�'�F�� � �S�#�:�1�:�u�3E� �F�F�A� �I�I�c�!�f�f�f� %� %� %�0��0�%�8�A� �I�I�c�!�f�f�f� %� %� %��� �5�!�A� �I�I�c�!�f�f�f� %� %� %� %� �I�I�a�L�L� � �� #� #�� � � �#�a�&�&�2�3�3�3�3�3r N)r7 r8 r9 r r: r r rf rf } s# � � � � � �+4� +4� +4� +4� +4r rf c �2 � e Zd Zd� Zd� Zd� Zd� Zd� Zd� ZdS )� NewTestCasec �t � dd l }| j j � � � }| j } ||j � � }t |j |�� � t |j � d� � |�� � t t |j � � |�� � t t |j � � |�� � g }|ggg} ||� � � ||� � � � }t ||�� � |� |� � t ||� � � ||� � � � |�� � g }|g}|g}t |||� � � ||� � � � |�� � G d� d� � } G d� d|t � � } | � � } || _ t ||� � � || � � � � |�� � | j j j } d� } t# | j dd � � | _ t# | j d d � � | _ | | _ |� � } ||� � � |||� � � � }t ||�� � t t |� � |�� � |D ] }| |j z } � | � | ||� � � � ||� � � || ||� � � � }t t/ |� � |�� � t t |� � |�� � |� � } t1 |� � D ]5\ }}| |j z } | � |j || j � � �6| � | || |� � � � t3 |� � }t5 |� � }d|_ t5 |� � }| � t/ |� � t/ |� � � � |� |� � |� | � � k rC| � |� � � d � d | j � � � � d S | � |� � � d � d | j � � � � d S ) Nr ��filec � � e Zd ZdS )� NewTestCase.test_1.<locals>.CNr� r: r r �Cru � r� r rv c � � e Zd ZdZdS )� NewTestCase.test_1.<locals>.Or� Nr� r: r r �Orx � s � � � � � � �I�I�Ir ry c � � dS )Nz <address>r: r� s r � str_addressz'NewTestCase.test_1.<locals>.str_address� s � �;�;r �_idpart_header�_idpart_sortrendera\ 0: hpy().Root.i0_sysdict 0: Src.i0_modules['sys'].__dict__ 0: hpy().Root.i0_sysdict 0: hpy().Root.i0_sysdict 0: Src[0][0][0] 0: Src[0][0][0] 0: Src[0] 0: Src.x 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 1: <1 __main__.O: <address>>.x 0: <1 list: <address>*1>[0] 1: <1 __main__.O: <address>>.x �__main__a\ 0: hpy().Root.i0_sysdict 0: Src.i0_modules['sys'].__dict__ 0: hpy().Root.i0_sysdict 0: hpy().Root.i0_sysdict 0: Src[0][0][0] 0: Src[0][0][0] 0: Src[0] 0: Src.x 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 0: <1 __main__.O: <address>>.x 1: <1 list: <address>*1>[0] 0: <1 __main__.O: <address>>.x 1: <1 list: <address>*1>[0] ) r� �pythonrM rL r3 rp r r+ rk �reprr4 r� ro rh r �UniSet� summary_strr& r{ r| r} r r r r9 r6 r� �isatend� getsizeof�getvalue�replacer8 )r r� �or3 rh r~ r> r� rv ry �obr� r{ r� �shpr- r� r; rF r� s r r zNewTestCase.test_1� s� � �� � � � �K�N� #� #� %� %���h�� �C�� � � �� �a�i�a� � � � � �a�i� � ��"�"��+�+�+�+� �d�1�9�o�o�A�&�&�&�&� �d�1�9�o�o�A�&�&�&�&� ���c�U�G�� �S��V�V� � ���A��� '� '�� �b�q����� ���� � � � �c�c�!�f�f� � ���Q���(�(�q�1�1�1�1� �� �C�� �C�� �c�c�!�Q�i�i�#�#�C�C��F�F�+�+�!�4�4�4�4� � � � � � � � � � � � � ��6� � � � �Q�S�S����� �c�c�!�f�f� � ���R���)�)��2�2�2�2� �j�'�3� �.�.�.�%,� � #�%5�t�&=� &=� �"�)0� � #�%9�4�*A� *A� �&�"-� � � �C�E�E���c�!�f�f� � ���Q����+�+�� �c������ �d�3�i�i�a� � � � �� � �A��A�E� �A�A� � � �!�S�S��V�V� � � ��c�!�f�f� � ���R��A� � �/�/�� �c�#�h�h�Q� � � � � �d�3�i�i�a� � � � � �C�E�E�� �c�N�N� )� )�D�A�q��A�E� �A� �I�I�a�e�S��V�Z� (� (� (� (� � � �!�S�S��Q�Z�Z� � � � �#�Y�Y�� ��H�H���� � ��H�H�� � � �#�a�&�&�#�a�&�&�!�!�!� �=�=�� � �c�m�m�B� /� /� /� /� �I�I�a�j�j�l�l� %� �G�J���(�(� *� *� *� *� *�" �I�I�a�j�j�l�l� %� �G�J���(�(� *� *� *� *� *r c �Z � | j j � � � }| j }g }|gdz }t t ||� � � ||� � � � � � |�� � t t ||� � � ||� � � � j � � |�� � ||� � � ||� � � � }t t |j � � |�� � | � |� � � d� � d S )Nr* rr av 0: Src[0] 1: Src[1] 2: Src[2] 3: Src[3] 4: Src[4] 5: Src[5] 6: Src[6] 7: Src[7] 8: Src[8] 9: Src[9] <... 10 more paths ...> 10: Src[10] 11: Src[11] 12: Src[12] 13: Src[13] 14: Src[14] 15: Src[15] 16: Src[16] 17: Src[17] 18: Src[18] 19: Src[19] 10: Src[10] 11: Src[11] 12: Src[12] 13: Src[13] 14: Src[14] 15: Src[15] 16: Src[16] 17: Src[17] 18: Src[18] 19: Src[19] ) r rM rL r3 r r� r4 rO r r� )r r� r3 r r r- s r �test_2zNewTestCase.test_2. s � � �K�N� #� #� %� %���h�����e�B�h�� �d�3�3�s�8�8�'�'���C���1�1�2�2��;�;�;�;� �d�3�3�s�8�8�'�'���C���1�1�6�7�7�a�@�@�@�@� �C��H�H� � ���S��� *� *�� �d�1�6�l�l��#�#�#�#� � � �!�*�*�,�,� !� � � � � r c �� � | j }g }| � t t ||� � � |� � � � � � � � dk � � d S )Nr )r3 r r- r� r4 )r r3 r s r � test_emptyzNewTestCase.test_empty_ sW � ��h���� ����D���S���!5�!5�c�c�e�e�!<�!<� =� =�>�>�!�C�D�D�D�D�Dr c � � | j }g } ||� � j }~| � dt |� d� � � � v� � g }|g} ||� � � ||� � � � }||d< ||� � } ||� � }| � |� |� � j dk � � g }|g} ||� � } ||� � }| � |� |� � j ||f� � G d� d� � } |� � } ||j � � }|j }t |� � ~|j } | � t | � � � � � d� � ~~ g }|gggg} ||� � } ||� � } | � | � � }| � t |� � d� � |� |� � ||_ | � t | � | � � � � d� � | � t |j � � d� � | � |j j j |� � d S )N�Edgesr c � � e Zd ZdS )� NewTestCase.test_3.<locals>.CNr� r: r r rv r� � r� r rv � z 0: Src[0][0][0][0]z<No more paths>)r3 r+ r r rk r4 r+ r �setsrp r� �stripr� �_XX_rO r� �top) r r3 r r� r rv r� �cdr- rn r� r� s r �test_3zNewTestCase.test_3e st � � �h�����c�#�h�h� �� � ����s�3�;�;�q�>�>�':�':�:�;�;�;����e���c�#�h�h�"�"�3�3�s�8�8�,�,����A���c�#�h�h���c�#�h�h�� �������,�,�5��:�;�;�;� ���e���c�#�h�h���c�#�h�h�� � � �#�/�/�#�&�&�+�c�3�Z�8�8�8� � � � � � � � � �A�C�C�� �S���_�_�� �J�� �Q���� � �J�� � � �$�q�'�'�-�-�/�/�2�&�&�&� �q� �����y�k�� �C��H�H�� �C��H�H�� �M�M�!� � �� � � �#�a�&�&�/�0�0�0� � � �1� � � ���� � � �#�a�m�m�A�&�&�'�'�)>�?�?�?� � � �#�a�f�+�+� 0�1�1�1� � � �!�&�*�.�!�$�$�$�$�$r c �: � | j }| j j � � � }g }|gdz } ||� � � ||� � � � }t t |� � |�� � | � |� � � d� � d S )NrM rr zz 0: Src[0] 1: Src[1] 2: Src[2] 3: Src[3] 4: Src[4] 5: Src[5] 6: Src[6] 7: Src[7] 8: Src[8] 9: Src[9] 10: Src[10] ) r3 r rM rL r4 r r r r� )r r3 r� r r r� s r �test_4zNewTestCase.test_4� s� � � �h�� �K�N� #� #� %� %�����e�b�j���c�#�h�h�"�"�3�3�s�8�8�,�,�� �c�#�h�h�Q� � � � � � � �!�*�*�,�,� !� � � � � r c �. � | j }g } ||� � � |||d�� � � � }t |� � ||� � � |t � � |t � � |i� � � � }t |� � d S )N)r r� )r3 r4 r ro )r r3 r r� s r �test_comparisonzNewTestCase.test_comparison� s� � � �h�����c�#�h�h�"�"�3�3�3�C�'8�'8�#9�#9�:�:�� �C�����c�#�h�h�"�"�3�3����#�v�x�x��'E�#F�#F�G�G�� �C�����r N) r7 r8 r9 r r� r� r� r� r� r: r r rp rp � sz � � � � � �*� *� *�B/� /� /�bE� E� E� E%� E%� E%�N� � �4 � � � � r rp c �0 � t j | |� � d S r )r � run_unittest)�case�debugs r �run_testr� � s � � ���u�%�%�%�%�%r c � � t t | � � t t | � � t t | � � t t | � � t t | � � t t | � � d S r )r� rp r< r� r rZ rf )r� s r � test_mainr� � si � � �[�%� � � � � �u�%�%�%� �\�5�!�!�!� �\�5�!�!�!� �]�E�"�"�"� �]�E�"�"�"�"�"r r~ )r )�guppy.heapy.testr r| r� r r< r� r rZ rf rp r� r� r7 r: r r �<module>r� s� �� $� $� $� $� $� $� ���� ����+3� +3� +3� +3� +3�w� � +3� +3� +3�\s?� s?� s?� s?� s?�x� s?� s?� s?�rL� L� L� L� L�8� L� L� L�^e8� e8� e8� e8� e8�8� e8� e8� e8�P � � � � �H� � � �2,4� ,4� ,4� ,4� ,4�H� ,4� ,4� ,4�^e� e� e� e� e�(� e� e� e�P &� &� &� &�#� #� #� #� �z��� �I�K�K�K�K�K� �r __pycache__/test_RefPat.cpython-311.pyc 0000644 00000054144 15004413005 0013676 0 ustar 00 � ��bgC � �� � d dl mZ d dlZd dlZd dlZd dlZ G d� dej � � Z G d� de� � Z G d� de� � Zd d �Z d � Z e d k r e � � dS dS ) � )�supportNc � � e Zd Zd� Zd� Zd� ZdS )�TestCasec � � t j � | � � | j j | _ | j j | _ d S �N)r r �setUp�heapy�RefPat�Use�iso)�selfs �o/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_RefPat.pyr zTestCase.setUp s4 � ��� � �t�$�$�$��j�'�� ��8�<����� c �P � g }g }t |� � D ]}|� |g� � �|g|z }t |dz � � D ]\}g }t |� � D ]F}g }|� |� � t |� � D ] } |� || � � � �G|}�]|} | |fS )N� )�range�append) r �width�length�dst�ls�i�xs�j�ys�k�srcs r � makegraphzTestCase.makegraph s� � � �� ���u� � � � �A� �I�I�s�e� � � � ��U�U�]���v�a�x� � � � �A��B��5�\�\� %� %����� � �"� � � � �u� � � %� %�A��I�I�b��e�$�$�$�$�%��B�B����C�x�r c � � | j }|� ||� � } ||� � j dd|i|��}d� |j j j _ |S )Nr c � � dS )Nz <address>� )�as r �<lambda>z TestCase.rp.<locals>.<lambda>- s � �+� r r! )r �get_rp�mod�UniSet� summary_str� str_address)r r r �kwdsr �rps r r* z TestCase.rp( sV � ��h�� �?��#�c�(�(�C� �S�S��X�X�_� -� -�� -�� -� -��0E�0E��� �!�-�� r N)�__name__� __module__� __qualname__r r r* r! r r r r sA � � � � � � � � � � � �4� � � � r r c �& � e Zd Zd� Zd� Zd� Zd� ZdS )� RefPatCasec � � g x}}|g}t d� � D ]}|g}|� |� � �| � ||d�� � }t |� � D ]9\ }}|t |� � k r!| � || |j � � �:| � |d j |d � � | � |d j |d � � | � ||d�� � }| � |d j |d � � | � |d j |d � � | � t |� � t |� � dz � � | � ||d�� � }| � t |� � t |� � dz � � | � |j j |d � � | � |j j |d � � | � ||d�� � }| � |j j |d � � | � |j j |d � � |d � |d � � |j � � � |j � | � |d � � � � | � |j j |d � � g }|� |� � |g}| � ||� � }| � |j j |� � | � |j | � ||� � � � | � |j |j � � | � |j |d � � d S ) N� � ��depthr ������r � )r r r* � enumerate�len�asis�theone�aseq�_r" �a2�View�clear_retainers�update_referrersr )r r r �listsr r* �xs r �test_basic_methodsz RefPatCase.test_basic_methods2 s4 � � ���c�����q��� � �A��%�C� �L�L�� � � � � �W�W�S�#�R�W� (� (�� �b�M�M� .� .�D�A�q��3�u�:�:�~�~�� � �%��(�A�H�-�-�-�� � � �"�Q�%�,��a��)�)�)� � � �"�R�&�-��r��+�+�+� �W�W�S�#�R�W� (� (�� � � �"�Q�%�,��a��)�)�)� � � �"�R�&�-��r��+�+�+� � � �#�b�'�'�3�u�:�:��>�*�*�*� �W�W�S�#�R�W� (� (�� � � �#�b�'�'�3�u�:�:��>�*�*�*� � � �"�$�+�u�Q�x�(�(�(� � � �"�$�+�u�Q�x�(�(�(� �W�W�S�#�R�W� (� (�� � � �"�%�,��a��)�)�)� � � �"�$�+�u�Q�x�(�(�(� �a�����a��!�!�!� �� � �!�!�!� �� � ����%��(�!3�!3�4�4�4� � � �"�$�+�u�Q�x�(�(�(� �� � � �3�����e�� �W�W�S�#� � �� � � �"�$�+�s�#�#�#� � � �"�$�����c�*�*�+�+�+� � � �"�$��� � � � � � �"�$��1�� � � � � r c �R � � � � t j � � � g }� fd�� � j }d� � fd� }g }|� |� � |||� � t d� � D ]}|}g }|� |� � � |||� � � � dd� � \ }} |||d�� � � � dd� � \ }} |||d�� � } � t |j � � � � � � dd � � \ }} |||d �� � }|j } � t |� � � � � t |j � � � � |j } � t | � � � � |j } � t | j � � � � � t | j � � � � � | j � � � | j � � � � dd � � \ }} |||d�� � } � |j � � � |j j � � � � dd � � \ }} |||d �� � } � |j � � � � ||d �� � } � |j � � � � � � � � d � � d S )Nc �* �� t | ��� � d S )N)�file)�print)rC �outputs �r �writez+RefPatCase.test_presentation.<locals>.writez s �� � �!�&� !� !� !� !� !� !r c �V �� �j | |fi |��} �t |� � � � |S r )r* �repr)r r �resultr) r* r rJ s ��r �test_ppz-RefPatCase.test_presentation.<locals>.test_pp~ s6 �� �����c�*�*�T�*�*�B� �E�$�r�(�(�O�O�O��Ir r1 � r2 r3 � r � �# � � a� Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 2: aa ---- [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 3: a3 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 4: a4 ------ [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 5: a5 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 6: a6 -------- [-] 5 list: <address>*5, <address>*5, <address>*5... 7: a7 [-] 1 list: <address>*5 8: a8 ---------- [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 2: aa ---- [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 3: a3 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 4: a4 ------ [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 5: a5 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 6: a6 -------- [-] 5 list: <address>*5, <address>*5, <address>*5... 7: a7 [-] 5 list: <address>*5, <address>*5, <address>*5... 8: a8 ---------- [-] 5 list: <address>*5, <address>*5, <address>*5... 9: a9 [-] 5 list: <address>*5, <address>*5, <address>*5... <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 5 list: <address>*5, <address>*5, <address>*5... 11: a11 [-] 5 list: <address>*5, <address>*5, <address>*5... 12: a12 ------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 13: a13 [-] 5 list: <address>*5, <address>*5, <address>*5... 14: a14 --------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 15: a15 [-] 5 list: <address>*5, <address>*5, <address>*5... 16: a16 ----------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 17: a17 [+] 1 list: <address>*5 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 20: a20 --------------------- [-] 1 list: <address>*1 21: a21 [-] 1 list: <address>*1 22: a22 ----------------------- [-] 1 list: <address>*1 23: a23 [-] 1 list: <address>*1 24: a24 ------------------------- [-] 1 list: <address>*1 25: a25 [-] 1 list: <address>*1 26: a26 --------------------------- [-] 1 list: <address>*1 27: a27 [-] 1 list: <address>*1 28: a28 ----------------------------- [-] 1 list: <address>*1 29: a29 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 20: a20 --------------------- [-] 1 list: <address>*1 21: a21 [-] 1 list: <address>*1 22: a22 ----------------------- [-] 1 list: <address>*1 23: a23 [-] 1 list: <address>*1 24: a24 ------------------------- [-] 1 list: <address>*1 25: a25 [-] 1 list: <address>*1 26: a26 --------------------------- [-] 1 list: <address>*1 27: a27 [-] 1 list: <address>*1 28: a28 ----------------------------- [-] 1 list: <address>*1 29: a29 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 30: a30 ------------------------------- [-] 1 list: <address>*1 31: a31 [R] 1 tuple: <address>*1 30: a30 ------------------------------- [-] 1 list: <address>*1 31: a31 [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <22 more lines. Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <12 more lines. Type e.g. '_.more' for more.> Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 10: a10 ----------- [+] 1 list: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 20: a20 --------------------- [+] 1 list: <address>*1 r )�io�StringIOr r r r rL �more�str�top�prevr* r< �getvalue) r r �RrN r r rC r* �m�m1�m2rI rJ s ` @@r �test_presentationz RefPatCase.test_presentationt s� ���� ��� � ���� "� "� "� "� "� �K�� � � � � � � � �� � � �3�������S�����q��� � �A��A��C� �H�H�S�M�M�M�M����S�����>�>�!�Q�'�'���S����S��#�#�#�#� �>�>�!�R�(�(���S� �W�S�#�R� (� (� (�� ��d�2�7�m�m� � � � �>�>�!�R�(�(���S� �W�S�#�R� (� (� (�� �G�� ��d�1�g�g���� ��d�1�6�l�l���� �V�� ��d�2�h�h���� �V�� ��d�2�7�m�m� � � � ��c�"�'�l�l���� ��b�f� � � � ��b�g���� �>�>�!�R�(�(���S� �W�S�#�R� (� (� (�� ��b�g���� ��b�g�l���� �>�>�!�R�(�(���S� �W�S�#�R� (� (� (�� ��b�g���� �W�W�S�#�R�W� (� (�� ��b�g���� � � �&�/�/�#�#� d&� d � d � d � d � d r c �^ � dd l }g }|g}|g}|f}|g}||g}| � ||� � }| � |j j |� � |� � � | � |j j |� � | � |j j | d |� � d S )Nr ) �gcr* r: r= r; �collect�aar? �rg) r rb r r" rd �b�bar r* s r �test_referrer_registrationz%RefPatCase.test_referrer_registrationq s� � �� � � � �� �E���S�� �F���S���2�h�� �W�W�S�#� � �� � � �"�$�+�s�#�#�#� � � � � � � � � �"�%�,��#�#�#� � � �"�'�*�Q�-��"�B�'�'�'�'�'r c �d � dd l }g }|g}|� |g� � | � ||dd�� � }| � |j j |� � | � |j j |� � g } G d� d� � } |� � }||_ d|i}||f}|� � � | � ||d�� � }d|j j _ t j |� � t j |j � � k rF| � |j j |� � | � |j j |j � � nE| � |j j |j � � | � |j j |� � t! |j j j � � }| � |dk � � ~~|j } d|j j _ ~|� � � t! | j j � � } | � | dk � � d S ) Nr r2 r )r4 �imdomc � � e Zd ZdS )�4RefPatCase.test_some_more_advanced_usages.<locals>.AN)r+ r, r- r! r r �Arl � s � � � � � � �Dr rm r r3 )rb r r* r: r= r; r" r rc r% r? �_is_clear_drg_enabled�sys� getsizeof�__dict__rf r9 �dict_ownership� assertTrue) r rb r r r* rm r" rf �lnr% �lnnows r � test_some_more_advanced_usagesz)RefPatCase.test_some_more_advanced_usages� s � �� � � � ���e�� � � �C�5���� �W�W�S�#�R�q�W� 1� 1�� � � �"�$�+�s�#�#�#� � � �"�$�+�s�#�#�#� �� � � � � � � � � �A�C�C����� �C�L���!�f�� � � � � � � �W�W�S�#�R�W� (� (��,-��� �)� �=�� � �c�m�A�J� 7� 7� 7� 7� �I�I�b�d�k�1� %� %� %� �I�I�b�d�k�1�:� .� .� .� .� �I�I�b�d�k�1�:� .� .� .� �I�I�b�d�k�1� %� %� %� ����+� ,� ,�� ����Q�� � � � � ��f��,-��� �)� � � � � � � ��C�H�+�,�,�� ����� �#�#�#�#�#r N)r+ r, r- rD r` rh rv r! r r r/ r/ 1 sX � � � � � �@ � @ � @ �D{� {� {�z(� (� (�44$� 4$� 4$� 4$� 4$r r/ c � � e Zd Zd� Zd� ZdS )�NewCasec �T � g }|g}|g}||g}| � ||� � }| � |j | � ||� � � � |� � � |� � � | � |j | � |� � � � d S r )r* r< r" r �pop�reset)r r r" rf r r* s r � test_resetzNewCase.test_reset� s� � � �� �E�� �E���!�f�� �W�W�S�#� � �� � � �"�$�����A���'�'�'� ������ ��� � � � � � �"�$����� � �$�$�$�$�$r c �8 � g }|gd gdz z }|g}||g}| � ||� � }d}| � t |� d� � � � |� � |d |� d� � � }| � t |� dd| � |� � i�� � � � |� � | � t |� dd d | � |� � g�� � � � |� � d S )N�( z�Paths from source 'a3' to target '_'. 0: a3 [0] @ [0] 1: aa [0] @ [0] 2: a [0] @ [0] 3: _ [0] = <1 list: <address>*0> 4: aa [0] @ [1] 5: a [1] @ [0] -> #3�a3z 4:r" )�andsets)r* r< rX �paths�indexr )r r r" rf r r* �expecteds r � test_pathszNewCase.test_paths� s � � �� �E�4�&��)�O�� �E���!�f�� �W�W�S�#� � �� �� � � �#�b�h�h�t�n�n�%�%�x�0�0�0�� 4�X�^�^�G� 4� 4� 4�5�� � � �#�b�h�h�t�c�4�8�8�A�;�;�-?�h�@�@�A�A�8�L�L�L� � � � ������d�D�H�H�Q�K�K�'@��A�A� B� B�H� N� N� N� N� Nr N)r+ r, r- r| r� r! r r rx rx � s7 � � � � � � %� %� %� N� N� N� N� Nr rx c �n � t j t | � � t j t | � � d S r )r � run_unittestr/ rx )�debugs r � test_mainr� � s. � � ���U�+�+�+� ���%�(�(�(�(�(r c �� � ddl m} dd l}dd l}dd l}d} | � � t d|z |� � � � � |dz }t � � |� � � | � � �W)Nr )� xmemstatsr z[%d]) �guppy.heapy.heapycr� rb ro �timerH �asctimer� rc )r� rb ro r� r s r � test_leakr� � s� � � -�,�,�,�,�,� �I�I�I��J�J�J��K�K�K� �A� �I�K�K�K�� �f�q�j�$�,�,�.�.�)�)�)� �Q���� � � � � � � � � �� � � � � r �__main__)r ) �guppy.heapy.testr rU ro �types�unittestr r/ rx r� r� r+ r! r r �<module>r� s �� $� $� $� $� $� $� � � � � � � � � � � � � ����&� &� &� &� &�w� � &� &� &�RN$� N$� N$� N$� N$�� N$� N$� N$�b .N� .N� .N� .N� .N�h� .N� .N� .N�b)� )� )� )� � � �$ �z��� �I�K�K�K�K�K� �r __pycache__/test_RetaGraph.cpython-311.pyc 0000644 00000000600 15004413005 0014356 0 ustar 00 � ��bg_ � �. � d dl mZ d dlZd dlZd dlmZ dS )� )� test_supportN)�pprint)�guppy.heapy.testr �sys�unittestr � � �r/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_RetaGraph.py�<module>r sA �� )� )� )� )� )� )� � � � � ���� � � � � � � � r __pycache__/test_Spec.cpython-311.pyc 0000644 00000002370 15004413005 0013401 0 ustar 00 � ��bg_ � � � d dl mZ d dlZd dlZ G d� dej � � Z G d� de� � Zedk r ej ed� � dS dS ) � )�supportNc � � e Zd ZdS )�TestCaseN)�__name__� __module__� __qualname__� � �m/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_Spec.pyr r s � � � � � ��Dr r c � � e Zd Zd� ZdS )� FirstCasec �| � | j j }|� |j � � }|� |� � d S )N)�heapy�Spec� mkTestEnv�_Specification_� test_contains)�selfr �TestEnvs r �test_1zFirstCase.test_1 s9 � ��z����.�.��!5�6�6��� � �d�#�#�#�#�#r N)r r r r r r r r r s# � � � � � �$� $� $� $� $r r �__main__� )�guppy.heapy.testr �sys�unittestr r r � run_unittestr r r �<module>r s� �� $� $� $� $� $� $� � � � � ���� � � � � �w� � � � �$� $� $� $� $�� $� $� $� �z����G���A�&�&�&�&�&� �r __pycache__/test_UniSet.cpython-311.pyc 0000644 00000007234 15004413005 0013722 0 ustar 00 � ��bg� � �d � d dl mZ G d� dej � � Zdd�Zedk r e� � dS dS ) � )�supportc �& � e Zd Zd� Zd� Zd� Zd� ZdS )� FirstCasec �D � t j � | � � d S �N)r �TestCase�setUp)�selfs �o/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_UniSet.pyr zFirstCase.setUp s � ��� � �t�$�$�$�$�$� c �v � | j }g }g }| � ||� � } |t |j � � dk � � |||v � � |||v � � |g |v� � |||v� � | � |j � � } ||j |j k � � |||k � � d S )N� )� assertTrue�iso�len�nodes�idset)r �asrt�a�b�c�ds r �test_1zFirstCase.test_1 s� � ���� �� �� �H�H�Q��N�N�� ��S���\�\�Q� � � � � ��Q�!�V� � � � ��Q�!�V� � � � ��R�q�[���� ��Q�a�Z���� �J�J�q�w� � �� ��Q�W��� � � � � ��Q�!�V� � � � � r c �� �� | j �g }i }d}g |g||g|||g|g||g|gf}| j j j � �fd�|D � � �fd�|D � � �fd�|D � � � � d S )N� c �& �� g | ] } �|� � ��S r r ��.0�x�Hs �r � <listcomp>z$FirstCase.test_2.<locals>.<listcomp>! s! �� � � � �a�Q�Q�q�T�T� � � r c �& �� g | ] } �|� � ��S r r r s �r r! z$FirstCase.test_2.<locals>.<listcomp>! s! �� � 2� 2� 2�!���1��� 2� 2� 2r c �& �� g | ] } �|� � ��S r r r s �r r! z$FirstCase.test_2.<locals>.<listcomp>! s! �� �4F�4F�4F�a�Q�Q�q�T�T�4F�4F�4Fr )r �guppy�sets�test�test_set_operations)r �e1�e2�e3�lar s @r �test_2zFirstCase.test_2 s� �� � �J�� �� �� �� �"���B�x�"�b�"� ��t�b�"�X��t� C�� � �� �0�0� � � � �2� � � � 2� 2� 2� 2�r� 2� 2� 2�4F�4F�4F�4F�2�4F�4F�4F� H� H� H� H� Hr c �r � | j }g }|g}|g}|| j _ ||� � }| � |j ||� � k � � | � |j ||� � � � | � |j j |� � | � |j |||� � � � d S r )r �View�rootr � referrers�aseq� referents�dominos)r r r r r r s r �test_3zFirstCase.test_3# s� � � �h�� �� �C�� �C���� �� �C��F�F�� ���� �s�s�1�v�v�-�.�.�.� � � �!�+���A���'�'�'� � � �!�+�'�!�,�,�,� � � �!�)�S�S��A�Y�Y�'�'�'�'�'r N)�__name__� __module__� __qualname__r r r, r4 r r r r r sS � � � � � �%� %� %�� � �"H� H� H�(� (� (� (� (r r Fc �: � t j t | � � d S r )r � run_unittestr )�debugs r � test_mainr; 5 s � � ���E�*�*�*�*�*r �__main__N)F)�guppy.heapy.testr r r r; r5 r r r �<module>r> s} �� $� $� $� $� $� $�.(� .(� .(� .(� .(�� � .(� .(� .(�b+� +� +� +� �z��� �I�K�K�K�K�K� �r __pycache__/test_View.cpython-311.pyc 0000644 00000036064 15004413005 0013430 0 ustar 00 � ��bg� � �� � d dl mZ G d� dej � � Z G d� de� � Z G d� de� � Z G d� d e� � Z G d � d e� � Zdd �Zed k r e� � dS dS )� )�supportc � � e Zd Zd� ZdS )�TestCasec �p � t j � | � � | j j j | _ d S �N)r r �setUp�heapy�UniSet�types)�selfs �m/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_View.pyr zTestCase.setUp s, � ��� � �t�$�$�$��Z�&�,�� � � � N)�__name__� __module__� __qualname__r � r r r r s# � � � � � �-� -� -� -� -r r c �8 � e Zd Zd� Zd� Zd� Zd� Zd� Zd� Zd� Z dS ) � FirstCasec �J � | j }| j }g }g } ||� � } ||� � }||z }| � |j j | j j k � � | � ||z j j | j j k � � | � |� ||� � � � j | j j k � � | � |� ||� � � � j | j j k � � g }| j j � |gg �� � } ||� � } ~| � | j j t | j j � � � � � k � � | j � � � } | � | | � | j � � z | j j � � | � | | � | j j � � z | j j � � d S )N)� hiding_tag)�View�iso� assertTrue� referrers�kindr � FrameType�guppy�sets� immnodeset�type�heap�aseq�Use�Nothing�__dict__) r �Vr �a�b�as_�bs�ab�c�chold�cs�hs r �test_cal_hidingzFirstCase.test_cal_hiding s� � � �I���h�� �� ���c�!�f�f�� �S��V�V�� �2�X�� ���� �)�T�Z�-A�A�B�B�B� ����r��,�1�T�Z�5I�I�J�J�J� ���� � �C�C��F�F�+�+�0�D�J�4H�H�I�I�I� ���� � �C�C��F�F�+�+�0�D�J�4H�H�I�I�I� ��� ��*�*� �C�� +� � �� �S��V�V�� � ���� �)�T� �J�O� &� &� (� (�.*� .*� *� +� +� +� �I�N�N� � �� � � �!�d�h�h�t�x�(�(�(�$�(�*:�;�;�;� � � �!�d�h�h�t�x� 0�1�1�1�4�8�3C�D�D�D�D�Dr c �� � | j }g }|g g}|g}| � ||� � j |||d � � � � | � ||� � j |||d � � j � � | � ||� � j ||� � � � ~| � ||� � j |||d |d d � � � � d S )N� r )r r" �dominos�domisize�indisize�r r �x�y�zs r � test_dominoszFirstCase.test_dominos- s� � ��h�� �� ��G�� �C�� � � �#�#�a�&�&�.�#�#�a��1��,�,�/�/�/� � � �#�#�a�&�&�/�3�3�q�!�A�$�<�<�#8�9�9�9� � � �#�#�a�&�&�.�#�#�a�&�&�)�)�)� � � � �#�#�a�&�&�.�#�#�a��1��q��t�A�w�"7�"7�8�8�8�8�8r c � � | j }g }|g g}|g} ||� � j j }| � | ||� � j � � d S r )r � referentsr5 r" )r r r7 r8 r9 �ps r � test_exportszFirstCase.test_exports9 sU � ��h�� �� ��G�� �C�� �C��F�F� � %�� � � �!�S�S��V�V�_�%�%�%�%�%r c � � | j }| j � � � }g }|� � � }| � | ||� � � � ~|� � � }| � | ||� � � � ~~|� � � }| � | |� � � � d S r )r r �horizon�newsr" )r r r/ r7 �hns r � test_horizonzFirstCase.test_horizonB s� � ��h�� �I� � � � �� �� �V�V�X�X�� � � �"�c�c�!�f�f� � � � � �V�V�X�X�� � � �"�c�c�!�f�f� � � � �r� �V�V�X�X�� � � �"�c�c�e�e� � � � � r c � � | j }g }|g g}||g}~~| � ||d � � j ||� � � � d S )Nr )r r" �imdomr6 s r � test_imdomzFirstCase.test_imdomO sU � ��h�� �� ��G�� ��F�� �q� � � �#�#�a��d�)�)�/�3�3�q�6�6�*�*�*�*�*r c � � | j }g }|g g}|g}| � ||� � j |� � � � | � ||� � j |||d � � � � | � ||� � j ||� � � � | � |||� � j ||||d � � � � d S �Nr2 )r r" r< r6 s r �test_referentszFirstCase.test_referentsW s� � ��h�� �� ��G�� �C�� � � �#�#�a�&�&�"�C�C�E�E�*�*�*� � � �#�#�a�&�&�"�C�C��1�Q�4�L�L�1�1�1� � � �#�#�a�&�&�"�C�C��F�F�+�+�+� � � �#�#�a��)�)�%�s�s�1�a��1����7�7�7�7�7r c �� � | j j }| � | j j |� � | � | j j j |� � | � | j j j |� � t � � }|| j _ | � | j j |� � | � | j j j |� � | � | j j j |� � || j _ | � | j j |� � | � | j j j |� � | � | j j j |� � d S r )r �root�assertIsr# �hv�object)r �old_root�objs r � test_rootzFirstCase.test_roota s � ��9�>�� � � �d�i�n�h�/�/�/� � � �d�h�m�(�(�3�3�3� � � �d�i�l�'��2�2�2��h�h�� �� �� � � �d�i�n�c�*�*�*� � � �d�h�m�(�#�.�.�.� � � �d�i�l�'��-�-�-�!�� �� � � �d�i�n�h�/�/�/� � � �d�h�m�(�(�3�3�3� � � �d�i�l�'��2�2�2�2�2r N) r r r r0 r: r> rC rF rI rQ r r r r r s� � � � � � � E� E� E�D 9� 9� 9�&� &� &� � � �+� +� +�8� 8� 8�3� 3� 3� 3� 3r r c �& � e Zd Zd� Zd� Zd� Zd� ZdS )�GCCasec �n �� ddl m} dd l} G d� d� � } |� � }g ��fd�} |||� � }||_ |� � � t |� � }| � t |� � � � |� � | � |� � |� � d }| � t |� � � � |� � | � �g � � |� � � | � |� � d � � | � �|g� � d S )Nr )�refc � � e Zd ZdS )�#GCCase.test_gc_mechanism.<locals>.CN)r r r r r r �CrW } s � � � � � � �Dr rX c �2 �� �� | � � d S r ��append)�wr�cbss �r �cbz$GCCase.test_gc_mechanism.<locals>.cb� s �� � �J�J�r�N�N�N�N�Nr )�weakrefrU �gcr7 �collect�strr" �asis) r rU r` rX r, r^ r\ �strcr] s @r �test_gc_mechanismzGCCase.test_gc_mechanismt sY �� � � � � � � �� � � � � � � � � � � � �A�C�C���� � � � � � �S��B�Z�Z����� � � � � � ��1�v�v�� � � �#�b�b�d�d�)�)�T�"�"�"� � � �"�"�$�$����� �� � � �#�b�b�d�d�)�)�T�"�"�"� � � �#�r���� � � � � � � � � �"�"�$�$�� � � � � � �#��t� � � � � r c �` �� g ��fd�}dd l }|� � � | j j � |� � }| � �g � � |� � � | � �dg� � d }|� � � | � �dg� � d S )Nc �2 �� � � d� � d S rH rZ )�hoss �r �hoz GCCase.test_gc_hook.<locals>.ho� s �� � �J�J�q�M�M�M�M�Mr r r2 )r` ra r r �gchookr" )r ri r` �hookrh s @r � test_gc_hookzGCCase.test_gc_hook� s� �� � �� � � � � � � � � � � � � � � ��z��%�%�b�)�)�� � � �#�r���� � � � � � � � � �#��s������ � � � � � � � � �#��s�����r c � � � d S r ) r` r rM � nodegraphrj �update_dictownersra �lenr r" � cli_clodo� partitionr% ) r r` r rM � clear_drg�_clear_drg_hook�lendrg�byclodorX r, �drgs @r � test_gc_drgzGCCase.test_gc_drg� s �� � �r c �6 � | j }| j j j }d| j _ dd l}|� � � g }|� � � | � t | j j � � dk � � |g}|g}||g} G d� d� � } | ||� � � � } | j � | � � | ||� � � � } | j � | � � | j � ||� � � � | � | || j j | � � v � � | � | || j j | � � v � � d } |� � � | j � ||� � � � | � | || j j | � � v � � | � | || j j | � � v� � |g} | � | | j � ||� � � � v� � |� � � | � | | j � ||� � � � v � � d S )NFr c � � e Zd Zd� ZdS )� GCCase.test_gc_rg.<locals>.Tc � � || _ d S r )�set)r r} s r �__init__z%GCCase.test_gc_rg.<locals>.T.__init__� s � � ����r N)r r r r~ r r r �Tr{ � s# � � � � � � � � � � r r ) r r r r r �is_rg_update_allr` ra r rp �rg�referrers_add_targetr ) r r r r` �dstr' r( r, r �ta�tb�ds r � test_gc_rgzGCCase.test_gc_rg� sq � ��h���Z�_�/� �%*�� �"�� � � � � � � � � ��� � � � � � � ����D�I�L�)�)�Q�.�/�/�/� �E�� �E�� ��F�� � � � � � � � � �Q�s�s�1�v�v�Y�Y�� � �&�&�r�*�*�*� �Q�s�s�1�v�v�Y�Y�� � �&�&�r�*�*�*� � ���C�C��F�F�#�#�#� ����Z�Z�� � �Q�� 8� 8�8�9�9�9� ����Z�Z�� � �Q�� 8� 8�8�9�9�9� �� � � � � � � � ���C�C��F�F�#�#�#� ����Z�Z�� � �Q�� 8� 8�8�9�9�9� ������D�I�L��O�!<�!<�<�=�=�=� �C�� ������!4�!4�S�S��V�V�!<�!<�<�=�=�=� � � � � � � ����T�Y� 0� 0���Q��� 8� 8�8�9�9�9�9�9r N)r r r re rl rx r� r r r rS rS s sR � � � � � � � � �@ � � �$$'� $'� $'�L0:� 0:� 0:� 0:� 0:r rS c � � e Zd Zd� ZdS )� AltHeapCasec �� � | j }| j } |g i � � }| j � � � }| j � � � }| j j � � � }| j j � � � } || j � � � � � }| � ||j ||� � |k � � | � |||� � |z � � d S r ) r �idset�ImpSet� mutnodesetr �observation_listr r r �observation_containersr �nodes) r r r� r' r( r, �excla�exclb�ocs r �test_observation_containersz'AltHeapCase.test_observation_containers s� � � �h��� �� �C��B�K�K�� �K� "� "� $� $�� �I� &� &� (� (�� � ��*�*�,�,��� ��*�*�,�,�� �U�4�9�3�3�5�5� 6� 6�� �����A�G�Q��*�*�b�0�1�1�1� ���S�S��� .� .�� 3�4�5�5�5�5�5r N)r r r r� r r r r� r� � s# � � � � � �6� 6� 6� 6� 6r r� c � � e Zd Zd� ZdS )�SpecialTypesCasec �h � | j }dd l}|� dd� � } ||� � j d S )Nr r( s asdf)r �array�size)r r r� r' s r � test_arrayzSpecialTypesCase.test_array s8 � ��h��� � � � �K�K��W� %� %�� ��A��� � � � r N)r r r r� r r r r� r� s# � � � � � �� � � � r r� c � � ddl m} |� � t j t | � � t j t | � � t j t | � � t j t | � � d S )Nr )�off)�guppy.heapy.Remoter� r � run_unittestr rS r� r� )�debugr� s r � test_mainr� % sr � �&�&�&�&�&�&��C�E�E�E� ���E�*�*�*� ����'�'�'� ���e�,�,�,� ��)�5�1�1�1�1�1r �__main__N)r ) �guppy.heapy.testr r r rS r� r� r� r r r r �<module>r� s6 �� $� $� $� $� $� $�-� -� -� -� -�w� � -� -� -� f3� f3� f3� f3� f3�� f3� f3� f3�RI:� I:� I:� I:� I:�X� I:� I:� I:�X6� 6� 6� 6� 6�(� 6� 6� 6�8� � � � �x� � � �2� 2� 2� 2� �z��� �I�K�K�K�K�K� �r __pycache__/test_all.cpython-311.pyc 0000644 00000002202 15004413005 0013251 0 ustar 00 � ��bg� � �J � d dl Z d dlZdZdZdd�Zedk r e� � dS dS )� N) � dependencies�gsl� Classifiers�heapyc�ER�OutputHandling�Part�Path�RefPat�UniSet�View)�menuleak�sfFc �� � t D ]j}d|z } t j |= n# t $ r Y nw xY wt j |� � }t d|� � |j } || �� � t j |= �kd S )Nzguppy.heapy.test.test_z imported:)�debug)� autotests�sys�modules�KeyError� importlib� import_module�print� test_main)r �name�testname�x�fs �l/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_all.pyr r s� � �� "� "��+�D�0�� �� �H�%�%��� � � � �D� ���� � #�H� -� -�� �k�8�$�$�$� �K�� ������� �K�� !� !� "� "s � � +�+�__main__)F)r r r �othersr �__name__� � r �<module>r$ s` �� � � � � � � � � � � �� "� "� "� "� �z��� �I�K�K�K�K�K� �r# __pycache__/test_dependencies.cpython-311.pyc 0000644 00000001175 15004413005 0015137 0 ustar 00 � ��bg� � �2 � dd�Z edk r e � � dS dS )� c �X � t d� � ddlm} |� � � d S )Nz Testing setsr )�test)�print� guppy.setsr � test_main)�debugr s �u/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_dependencies.pyr r s8 � � �.���� � � � � � ��N�N������ �__main__N)r )r �__name__� r r �<module>r s= �� � � � � �z��� �I�K�K�K�K�K� �r __pycache__/test_gsl.cpython-311.pyc 0000644 00000002173 15004413005 0013275 0 ustar 00 � ��bg� � �2 � dd�Z edk r e � � dS dS )� c � � ddl m} |� � j j }|j � � � |j � � � |j � � � |j � � � |j � � � |j � � � |j � � � d S )Nr )�Root) �guppyr �gsl�Document� _test_main_� DottedTree� test_main�FileIO� set_test_mode�Filer�Gsml�Main� SpecNodes)�debugr r s �l/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_gsl.pyr r s� � ������� �$�&�&�,� �C��L� � � � � ��N� � � � � ��J� � � � � ��I�������H�������H�������M��� � � � � � �__main__N)r )r �__name__� r r �<module>r s= �� � � � � �z��� �I�K�K�K�K�K� �r __pycache__/test_heapyc.cpython-311.pyc 0000644 00000075162 15004413005 0013771 0 ustar 00 � ��bgd> � �� � d dl mZ G d� dej � � Z G d� de� � Z G d� dej � � Z G d� d e� � Z G d � d e� � Zdd �Zedk r e� � dS dS )� )�supportc � � e Zd Zd� ZdS )�TestCasec � � t j � | � � | j j | _ t | j j d� � f}g | _ | j j j | _ | j � | j |� � | _ | j j | _ | j j | _ | j j | _ d S )N� _NyHeapDefs_)r r �setUp�guppy�sets�getattr�setsc�root�heapy�heapyc�HeapView�hv� immnodeset�nodeset� mutnodeset� NodeGraph� nodegraph)�self�heapdefss �o/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_heapyc.pyr zTestCase.setUp s� � ��� � �t�$�$�$��J�O�� ��4�9�?�N�;�;�<���� ��j�&�-�� ��+�&�&�t�y�(�;�;����y�+�� � �)�.��� ��.����� N)�__name__� __module__� __qualname__r � r r r r s# � � � � � � /� /� /� /� /r r c �2 � e Zd Zd� Zd� Zd� Zd� Zd� Zd� ZdS )� TestHeapViewc �� � | j j }g }| � |g� � }| � ||fg� � }| � | j � |g� � | � |g� � � � | � | j � |g� � | � |g� � � � ||_ | � | j � |g� � | � g � � � � ||_ | � | j � |g� � | � g � � � � g | j _ | � | j � |g� � | � |d g� � � � | � | j � |g� � | � |d g� � � � d S �N)r � _hiding_tag_r r �aseq�relimgr )r � hiding_tag�a�ns�ngs r �test_hiding_tagz TestHeapView.test_hiding_tag s� � ��W�)� � �� �_�_�a�S� !� !�� �^�^�a��V�H� %� %�� � � �$�'�.�.�"��&�&�� � �a�S�(9�(9�:�:�:� � � �$�'�.�.�"��&�&�� � �a�S�(9�(9�:�:�:�$��� � � �$�'�.�.�"��&�&�� � �R�(8�(8�9�9�9�$��� � � �$�'�.�.�"��&�&�� � �R�(8�(8�9�9�9� !��� � � � �$�'�.�.�"��&�&�� � �a��Y�(?�(?�@�@�@� � � �$�'�.�.�"��&�&�� � �a��Y�(?�(?�@�@�@�@�@r c �� ���� | j j j j �d}|g� G ���fd�d�� � � �� � }|� � � | � |�g� � k sJ �d S )N�xc � �� e Zd Z� ��fd�ZdS )�7TestHeapView.test_inheritance_from_heapview.<locals>.HVc �2 �� �� ��d� � S )Nr )�__new__)r �HVr �newroots ���r r0 z?TestHeapView.test_inheritance_from_heapview.<locals>.HV.__new__0 s �� � �'�'��G�R�8�8�8r N)r r r r0 )r1 r r2 s ���r r1 r. / s8 �� � � � � � 9� 9� 9� 9� 9� 9� 9� 9� 9r r1 )r r r r �heapr )r r, r r1 r r2 s @@@r � test_inheritance_from_heapviewz+TestHeapView.test_inheritance_from_heapview' s� ���� � �:�#�*�3�� ���#�� 9� 9� 9� 9� 9� 9� 9� 9� 9�� 9� 9� 9� �R�T�T���w�w�y�y�D�L�L�!�W� � 6� 6�6�6�6�6�6�6r c �n � �� � j �g �_ � j j }� j j }t |fD �]�} G d� d|� � } G d� d|� � } |� � } |� � }g |_ |� � }g |_ g |_ t t d� � � � } | D ]A} |� | � � |� | � � |� | � � �B�� |g� � } �� |g� � } �� |g� � } � � | | cxk o| k nc � � � � �� |g� � || � � � � � � �� |g� � || ||j gz � � � � � � �� |g� � || ||j |j gz � � � � �� fd�}� � ||| d � � ||| d � � � � � � ||| d � � ||| d � � � � � � |||j � � |||j � � � � |||j � � ���d S )Nc � � e Zd ZdZdS )�;TestHeapView.test_inheritance_from_special_types.<locals>.T)�tN�r r r � __slots__r r r �Tr7 E � � � � � � � � � � r r; c � � e Zd ZdZdS )�;TestHeapView.test_inheritance_from_special_types.<locals>.U)�uNr9 r r r �Ur> H r< r r@ � c � �� �� | |� � }�� |dt |� � z k � � |S )N)r )�relate� assertTrue�len)�src�tgt�rr r s ��r �relz=TestHeapView.test_inheritance_from_special_types.<locals>.relg s< �� ��I�I�c�3�'�'������U�3�q�6�6�\� 1�2�2�2��r � )r r# r r r �listr8 r? �range�append� indisize_sumrD r$ r% )r r r �baser; r@ r' r8 r? �datar, �za�zt�zurI r s ` @r �#test_inheritance_from_special_typesz0TestHeapView.test_inheritance_from_special_types6 s� ��� � �W�� ����Y�)� ��Y�)� ��:�&� , � , �D� !� !� !� !� !�D� !� !� !� !� !� !� !� !�A� !� !� !� ����A�����A��A�C�����A��A�C��A�C���b� � �?�?�D�� � ������ � � ����� � � ����� � � � � � � �!��%�%�B�� � �!��%�%�B�� � �!��%�%�B� �O�O�B��L�L�L�L�b�L�L�L�L� )� )� )� �I�I�b�i�i���n�n�j�j��&6�&6� 7� 7� 7� �I�I�b�i�i���n�n�j�j��q�!�#�h� �&?�&?� @� @� @� �I�I�b�i�i���n�n�j�j��q�!�#�q�s�m�1C�&D�&D� E� E� E� � � � � � � �I�I�c�c�!�T�!�W�o�o�s�s�1�d�1�g��� 7� 7� 7� �I�I�c�c�!�T�!�W�o�o�s�s�1�d�1�g��� 7� 7� 7� �I�I�c�c�!�Q�S�k�k�3�3�q�!�#�;�;� /� /� /� �C��1�3�K�K�K�K�Y, � , r c � � d S r" r �r s r �test_nodeset_circularityz%TestHeapView.test_nodeset_circularityq s � � �r c �\ � | j } G d� dt � � } G d� d|� � }|� |� � |� � } |� � } |� � }g }g }g } ||_ ||_ ||_ | |_ | j � |||g� � | j � |� � | j � |� � | j � |� � |� � � } | | v sJ �|| v sJ �|| v sJ �|| v sJ �|| v sJ �|| v sJ �|j |_ |j |_ |� � � } || vsJ �|| vsJ �|| vsJ �|| vsJ �|| v sJ �g } | |_ |� � � } | | v sJ �|| v sJ �|| v sJ �|| v sJ �|| v sJ �|| v sJ �d S )Nc � � e Zd ZdZdS )�0TestHeapView.test_registered_hiding.<locals>.Set��somer# �otherNr9 r r r �SetrZ } � � � � � � �7�I�I�Ir r^ c � � e Zd ZdS )�0TestHeapView.test_registered_hiding.<locals>.DerN�r r r r r r �Derra � � � � � � � � �Dr rc ) r �object�register__hiding_tag__typer\ r] r rM r3 r# ) r r r^ rc �s�dr8 r\ r] �dotherr, �hes r �test_registered_hidingz#TestHeapView.test_registered_hidingz sE � � �W�� 8� 8� 8� 8� 8�&� 8� 8� 8� � � � � �#� � � � �%�%�c�*�*�*� �C�E�E�� �C�E�E�� �C�E�E�������������������� � ���!�Q���#�#�#� � ������� � ������� � ������� �G�G�I�I����{�{�{�{��q�y�y�y�y���z�z�z�z��A�v�v�v�v��A�v�v�v�v��A�v�v�v�v�� ���� ��� �G�G�I�I���1�}�}�}�}��A�~�~�~�~���z�z�z�z���z�z�z�z��A�v�v�v�v� �� ��� �G�G�I�I����{�{�{�{��q�y�y�y�y���z�z�z�z��A�v�v�v�v��A�v�v�v�v��A�v�v�v�v�v�vr c �� � ddl m} | j }g }|g}| j � d|gz � � | j � t t d� � � � � � |� � }|� � � } |� � |z }t d|dt |� � � � G d� dt � � } G d� d |� � } |� |� � |� � } |j | _ | � � }|j |_ d | |gz | j dd �< |� � }|� � � } |� � |z } t d | dt |� � � � d S ) Nr )� process_timei�� �elapsed0zlen(x)c � � e Zd ZdZdS )�%TestHeapView.test_timing.<locals>.Setr[ Nr9 r r r r^ rp � r_ r r^ c � � e Zd ZdS )�%TestHeapView.test_timing.<locals>.DerNrb r r r rc rr � rd r rc i�a iP� �elapsed1) �timerm r r �extendrK rL r3 �printrE re rf r# ) r �clockr rh �h�startr, rn r^ rc rg rs s r � test_timingzTestHeapView.test_timing� s� � � /�.�.�.�.�.� �W�� �� �C�� � �������$�$�$� � ����e�F�m�m�,�,�-�-�-������ �G�G�I�I���5�7�7�U�?�� �j�(�H�c�!�f�f�5�5�5� 8� 8� 8� 8� 8�&� 8� 8� 8� � � � � �#� � � � �%�%�c�*�*�*� �C�E�E��� ��� �C�E�E��� ��� "�A�q�6�\�� �!�E�'������� �G�G�I�I���5�7�7�U�?�� �j�(�H�c�!�f�f�5�5�5�5�5r N) r r r r* r4 rT rW rk rz r r r r r ss � � � � � �A� A� A�* 7� 7� 7� 9� 9� 9�v � � �:� :� :�x&6� &6� &6� &6� &6r r c � � e Zd Zd� Zd� ZdS )�TestLeakc �� � � dd l }ddlm� t j � | � � | j j }t |j d� � f}g }| j j j }|j }|j } G d� dt � � } G d� d|� � } G d� d t � � } |� � � |� � } | g} | � | � � g } g }g } |� � }g }| |_ ||_ ||_ | � � }| |_ ||_ | |_ | � � }||_ d � t, fD � � } || | |||||| | | |t, g }� fd �|D � � }| |t- t/ d d � � � � z z } |� |� � � fd�|D � � } |d� |D � � � � }d }|� |� � | � |� � ||_ |� ||� � }|� |� � |� � � }| |v sJ �||v sJ �||v sJ �||_ |� � � }~~~| � |� � d }|� � � � fd�|D � � }| � ||� � g |d d �< | � � � � fd�|D � � } | � || � � d S )Nr �� getrefcountr c � � e Zd ZdZdS )�TestLeak.test_1.<locals>.T)r' r# �tonlyNr9 r r r r; r� � s � � � � � �4�I� �Dr r; c � � e Zd ZdZdS )�TestLeak.test_1.<locals>.U)�bNr9 r r r r@ r� � s � � � � � � �I� �Dr r@ c � � e Zd ZdZdS )�TestLeak.test_1.<locals>.V��cNr9 r r r �Vr� � s � � � � � � �I�I�Ir r� c � � g | ]}|��S r r ��.0r, s r � <listcomp>z#TestLeak.test_1.<locals>.<listcomp> s � � � � �1�Q� � � r c �& �� g | ] } �|� � ��S r r �r� r, �grcs �r r� z#TestLeak.test_1.<locals>.<listcomp> �! �� �$�$�$�A���Q���$�$�$r i' i' c �& �� g | ] } �|� � ��S r r r� s �r r� z#TestLeak.test_1.<locals>.<listcomp> s! �� �#�#�#�1���A���#�#�#r c � � g | ]}|��S r r r� s r r� z#TestLeak.test_1.<locals>.<listcomp> s � �o�o�o�Q�q�o�o�or c �& �� g | ] } �|� � ��S r r r� s �r r� z#TestLeak.test_1.<locals>.<listcomp>4 r� r c �& �� g | ] } �|� � ��S r r r� s �r r� z#TestLeak.test_1.<locals>.<listcomp>: s! �� �%�%�%�Q�#�#�a�&�&�%�%�%r ) �gc�sysr r r r r r r r r r r r re �collectrM r' r# r� r� r� rK rL ru �addr rf r3 �discardr$ �clear) r r� r r r r r r r; r@ r� r( r' r� rj r� r8 r� r? �v�li�rcli0�rcli�recr, r rx �nrcli�nrcli0r� s @r �test_1zTestLeak.test_1� su �� �� � � �*�*�*�*�*�*��� � �t�$�$�$��z����4�:�~�6�6�7������!�(���/���$� � � � � � �� � � � � � � � �� � � � � � � � �� � � � � � � � � � �W�Y�Y�� �D�� ���� � � � �� �� �� �A�C�C������������� �A�C�C����������� �A�C�C����� � ��� � � ���!�Q��1�a��A�q�!�R��$� ?��$�$�$�$��$�$�$�� �b�4��e�U�+�+�,�,�,�,�� � � �B����#�#�#�#��#�#�#���g�o�o�"�o�o�o�&�&�� �� � � �3���� ���s� � � � ��� �_�_�T�8� ,� ,�� �%�%�a�(�(�(� �G�G�I�I���A�v�v�v�v��A�v�v�v�v���z�z�z�z� ��� �G�G�I�I�� � � � � � �3������ � � � � � �$�$�$�$��$�$�$�� � � �$�� � � ���Q�Q�Q�� ��� � � �%�%�%�%�"�%�%�%�� � � �%�� � � � � r c �� �� dd l }ddlm} t j � | � � | j j }t |j d� � f}g }| j j j }|j }|j }|� � � g � |�� � } G �fd�dt � � } G d� d| � � } | | _ | � � } | � � } |� | � � |� | � � |� ||� � }|� � � }| |v sJ �d }d x} x} x} } g |d d �< |� � � |�� � }| � || � � d S )Nr r~ r c � �� e Zd Z� ZdS )� TestLeak.test_weaky.<locals>.TN)r r r r, )�probes �r r; r� U s �� � � � � ��A�A�Ar r; c � � e Zd ZdS )� TestLeak.test_weaky.<locals>.UNrb r r r r@ r� X rd r r@ )r� r� r r r r r r r r r r �NodeSetr r� re r@ rM r r3 r$ )r r� r� r r r r r r �rcprober; r@ r8 r? r r, �nrcprober� s @r � test_weakyzTestLeak.test_weaky> s� �� � � � � �*�*�*�*�*�*��� � �t�$�$�$��z����4�:�~�6�6�7������!�(���,���$� � � � � � � ����#�e�*�*�� � � � � � � �� � � � � � � � �� � � ���� �A�C�C�� �A�C�C�� � � �A���� � � �A���� �_�_�T�8� ,� ,�� �G�G�I�I���A�v�v�v�v� �� � �� �A� ��A���Q�Q�Q�� � � � � � ��3�u�:�:�� � � �(�G�$�$�$�$�$r N)r r r r� r� r r r r| r| � s6 � � � � � �W!� W!� W!�r/%� /%� /%� /%� /%r r| c � � e Zd Zd� Zd� ZdS )� TestNodeGraphc �0 � | � � � }|� dd� � |� ddgd� � t |� � }|� � � |g d�k sJ �|� � � }|� � � |g d�k sJ �|� � � }|� dd� � t |� � � � � }|� � � ||k sJ �t |� � }|� � � |g d �k sJ �|� g d �� � sJ �|� g d �� � rJ �|� ddg� � }|� � � | � ddg� � k sJ �t |� � }|� � � |d d gk sJ �|� � � | � ddg� � k sJ �|� � � t |� � }|� � � |ddgk sJ �|� � � } t | � � } | � � � | g d�k sJ �| � dg� � | � dg� � k sJ �| � g d�� � | � g d �� � k sJ �| � ddg� � | � g d�� � | � g d�� � k sJ �| � dg� � } | � g d�� � | � g d�� � k sJ �| � g d�� � | � g d�� � k sJ �t | d � � } | � � � | ddgk sJ �t% | � � dk sJ �d| d< t | d � � } | � � � | ddgk sJ �|� � � t |� � g k sJ �| � d g� � }t |� � d gk sJ �|j rJ �| � d�� � }|j sJ �t |� � g k sJ �|� dd� � t |� � d gk sJ �|d dk sJ �| � d �� � }|j rJ �| � d gd� � | � d gd� � � | � d gd�� � | � dd g� � � fD ]B}|j sJ �t |� � d gk sJ �|d dk sJ �d|d< |d dk sJ ��C| � � � }|� dd� � |� dd� � |j rJ �|d |j sJ �d S ) NrJ � � � � )�rJ r� �r� r� �r� r� )rJ r� r� r� r� r� � )r� r� r� )r� r� )rJ r� r� )rJ r� r� r� r� r� �r� rJ �r� r� )r� r� )r� r� )r� r� r� )r� � )r� � )rJ r� r� r� )r� � )rJ r� r� r� r� r� )r� r� r� T�� is_mappingF)�iterabler� )r� r� )r �add_edge� add_edges_n1rK �sort� as_flat_list�copy�__iter__� domain_covers�domain_restricted� get_domainr � get_range�invert�invertedr% �update�updatedrE r� r� � is_sorted) r r) �lng�fl�cp�lng1�lcp�rng�lrng�ing�ling�uing�tgtss r � test_constructor_and_methodsz*TestNodeGraph.test_constructor_and_methodsq s � � �^�^� � �� � � �A�q���� ����A���"�"�"��2�h�h�� ��� � � ��.�.�.�.�.�.�.� �_�_� � �� ��� � � ��'�'�'�'�'�'�'� �W�W�Y�Y�� � � �A�q�����B�K�K�M�M�"�"�� � � � � � ��s�{�{�{�{��2�h�h�� ��� � � ��6�6�6�6�6�6�6� � � � � � �*�*�*�*�*��#�#�L�L�L�1�1�1�1�1� �"�"�A�q�6�*�*���~�~� � �4�<�<��A��#7�#7�7�7�7�7��C�y�y�� � � � � � ����'�'�'�'�'��}�}���$�,�,��1�v�"6�"6�6�6�6�6� � � � � � ��C�y�y�� � � � � � ����'�'�'�'�'��k�k�m�m���C�y�y�� � � � � � ��/�/�/�/�/�/�/��z�z�1�#���$�,�,��s�"3�"3�3�3�3�3��z�z�)�)�)�$�$�� � �Y�Y�Y�(?�(?�?�?�?�?� � � �F�F�#�$�$�$��z�z�)�)�)�$�$�� � �\�\�\�(B�(B�B�B�B�B��{�{�F�8�$�$���z�z�)�)�)�$�$�� � �\�\�\�(B�(B�B�B�B�B��{�{�9�9�9�%�%�� � �o�o�o�)F�)F�F�F�F�F� �D��G�}�}�� � � � � � ���1�v�~�~�~�~��4�y�y�A�~�~�~�~���Q���D��G�}�}�� � � � � � ���1�v�~�~�~�~� ��� � � ��B�x�x�2�~�~�~�~� �^�^�V�H� %� %���B�x�x�F�8�#�#�#�#��=� � � � �^�^�t�^� ,� ,���}� � �}��B�x�x�2�~�~�~�~� � � �A�q�����B�x�x�F�8�#�#�#�#��!�u��z�z�z�z� �^�^�u�^� -� -���=� � � � �>�>�6�(�D�1�1��>�>�F�8��>�E�E��>�>�6�(�t�>�<�<��>�>�T�V�H�>�E�E�� � �B� �=� � �=���8�8��x�'�'�'�'��a�5�A�:�:�:�:��B�q�E��a�5�A�:�:�:�:�:� �^�^� � �� � � �A�q���� � � �A�q�����<� � � � �1����|���|��r c �< ��� G d� d| j j � � � �� � }|� dd� � |� dd� � |� � � ddgk sJ � �dd g� � }|� � � dd gk sJ ��| _ | � � � G ��fd �d �� � � �d � � }|j d k sJ �|j sJ �t |� � }|� � � |d d � ddgk sJ �t |� � � � � }|� � � |t t d � � � � k sJ �t |� � � � � }|dgd z k sJ �d S )Nc � � e Zd ZdZd� ZdS )�)TestNodeGraph.test_inheritance.<locals>.Tr, c �L � t | � � }|� � � |S r" )rK r� )r r' s r �as_sorted_listz8TestNodeGraph.test_inheritance.<locals>.T.as_sorted_list� s � ���J�J���������r N)r r r r: r� r r r r; r� � s( � � � � � ��I� � � � � r r; rJ r� r� r� )r� r� r� )r� r� c �, �� e Zd ZdZ� �fd�Zd� Zd� ZdS )�)TestNodeGraph.test_inheritance.<locals>.R)�stopc � �� �� �d�� � }|� t t |� � � � d� � ||_ |S )NrJ r� r )r0 r� rK rL r� )r r� rH �Rr; s ��r r0 z1TestNodeGraph.test_inheritance.<locals>.R.__new__ sF �� ��I�I�a�A�I�.�.�����t�E�$�K�K� 0� 0�!�4�4�4� ����r c �D � t | � � � � � S r" )rK r� rV s r �keysz.TestNodeGraph.test_inheritance.<locals>.R.keys s � ��D�O�O� -� -�.�.�.r c �^ � � � fd�t � � � � � � D � � S )Nc � �� g | ] }�| �� S r r )r� �kr s �r r� zDTestNodeGraph.test_inheritance.<locals>.R.values.<locals>.<listcomp> s �� �;�;�;�A��Q��;�;�;r )rK r� rV s `r �valuesz0TestNodeGraph.test_inheritance.<locals>.R.values s- �� �;�;�;�;��d�i�i�k�k�):�):�;�;�;�;r N)r r r r: r0 r� r� )r� r; s ��r r� r� � sV �� � � � � � �I� � � � � � � /� /� /� <� <� <� <� <r r� � ���)r� r )r� r r ) r r r� r� r r� r� r� rK r� r� rL r� )r r8 rH �lrr� r� r� r; s @@r �test_inheritancez TestNodeGraph.test_inheritance� s� ��� � � � � � �� �%� � � � �A�C�C�� � � �1�a���� � � �1�a����� � �!�!�f�f�%5�5�5�5�5� �A�v�v� � � ��� � �!�!�f�f�%5�5�5�5�5� ��� �)�)�+�+�+� <� <� <� <� <� <� <� <�� <� <� <� �A�b�E�E���v��|�|�|�|��|���|� �!�W�W�� ��� � � ��"�#�#�w�6�6�*�*�*�*�*��A�F�F�H�H�~�~�� � � � � � ��t�E�"�I�I���&�&�&�&��a�h�h�j�j�!�!���!��R�� � � � � � r N)r r r r� r� r r r r� r� p s6 � � � � � �r � r � r �h3 � 3 � 3 � 3 � 3 r r� c � � e Zd Zd� Zd� ZdS )�TestClassifiersc �` � d� }| j }| � � � }g }|g}|� ||� � |� |i i � � }|� |� � }| � ||� � d� � t d� � D ]}|� |� � �|� |� � }| � ||� � d� � t d� � D ])}t |� � |i} |� || � � �*|� |� � }d S )Nc � � t | � � } | � � � d� d� | D � � � � S )N�, c �4 � g | ]}d |j �d|j �d���S )�(r� �))�kind�relatorr� s r r� zATestClassifiers.test_inrel.<locals>.str_inrel.<locals>.<listcomp># s+ � � J� J� J�1�1�A�F�F�F�A�I�I�I� >� J� J� Jr )rK r� �joinr� s r � str_inrelz-TestClassifiers.test_inrel.<locals>.str_inrel s; � ��Q���A� �F�F�H�H�H��9�9� J� J�� J� J� J�K�K� Kr z(2, 0)r� z.(2, 0), (2, 1), (2, 2), (2, 3), (2, 4), (2, 5)) r r r� � cli_inrel�classifyr$ rL rM �str) r r� r �rgr, �y�clir� �irH s r � test_inrelzTestClassifiers.test_inrel s, � � L� L� L� �W�� �^�^� � �� �� �C�� � � �A�q�����l�l�2�r�2�&�&�� �L�L��O�O�� � � �)�)�A�,�,��)�)�)��q��� � �A� �H�H�Q�K�K�K�K� �L�L��O�O�� � � �)�)�A�,�,� P�Q�Q�Q��q��� � �A��Q���� �A� �K�K��1� � � � � �L�L��O�O���r c �� � | j }|� |� � � fi � � }|� d� � |� d� � }}| � ||k � � | � ||k � � | � ||k p||k � � | � ||k o||k � � | � ||k p||k � � | � ||k o||k � � |� d� � |� d� � }}| � ||k � � | � ||k � � | � ||k p||k � � | � ||k o||k � � | � ||k p||k � � | � ||k o||k � � d S )NrJ r� )r �cli_and�cli_idr� rD � assertFalse)r r r r' r� s r �test_nodetuple_richcomparez*TestClassifiers.test_nodetuple_richcompare8 s� � � �W���j�j�"�)�)�+�+� ��,�,���|�|�A���� � �Q���1�� ����Q�� � � � ����a�� � � � ����Q��(�!�q�&�)�)�)� ����a��*�A��F�+�+�+� ����A����Q��'�'�'� ����Q�� �1�q�5�)�)�)��|�|�A���� � �Q���1�� ����a�� � � � ����Q�� � � � ����Q��(�!�q�&�)�)�)� ����Q��)�1��6�*�*�*� ����Q�� �!�a�%�(�(�(� ����Q�� �1�q�5�)�)�)�)�)r N)r r r r r r r r r� r� s2 � � � � � � � � �2*� *� *� *� *r r� Fc �� � t j t | � � t j t | � � t j t | � � t j t | � � d S r" )r � run_unittestr� r� r| r )�debugs r � test_mainr P sT � � �� �%�0�0�0� �� ��.�.�.� ���5�)�)�)� �� �u�-�-�-�-�-r �__main__N)F) �guppy.heapy.testr r r r| r� r� r r r r r �<module>r sC �� $� $� $� $� $� $� /� /� /� /� /�w� � /� /� /�K6� K6� K6� K6� K6�8� K6� K6� K6�dJ%� J%� J%� J%� J%�w� � J%� J%� J%�Zh � h � h � h � h �H� h � h � h �V2*� 2*� 2*� 2*� 2*�h� 2*� 2*� 2*�j.� .� .� .� �z��� �I�K�K�K�K�K� �r __pycache__/test_menuleak.cpython-311.pyc 0000644 00000013515 15004413005 0014313 0 ustar 00 � ��bg| � � � d dl T d dlZd dlZ G d� de� � Zd� Zd� ZeefD ]Z ee� � ee� � �dS )� )�*Nc � � e Zd Zdd�ZdS )� FixedMenuNc � � t | j � � |�|}g }t | � |� � | � |� � dz � � D ]C}t | � |d� � � � }|| j v r|� |� � �D| j � | j d||� � |D ]}| � |� � �dS )z7Delete menu items between INDEX1 and INDEX2 (included).N� �command�delete) �print� _tclCommands�range�index�str� entrycget�append�tk�call�_w� deletecommand)�self�index1�index2�cmds�i�cs �q/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_menuleak.pyr zFixedMenu.delete s� � � �d� � � � � �>��F����t�z�z�&�)�)�4�:�:�f�+=�+=�a�+?�@�@� � �A��D�N�N�1�i�0�0�1�1�A��D�%�%�%� � � �A����� �� � �T�W�h���7�7�7�� "� "�A� � � �q� !� !� !� !� "� "� )N)�__name__� __module__� __qualname__r � r r r r s( � � � � � �"� "� "� "� "� "r r c �. � t j � � t � � }t |d�� � } | |� � }||d< d� }t j |� � }|� |�� � |� t � � }|� |� � t j � � t j |� � }t d| d�� � ||k rt d |d � � nt d |d � � |� � � d S ) N�Window��text�menuc �$ � t d� � d S )Nzcommand button pressed�r r r r r ztest1.<locals>.command& s � � �&�'�'�'�'�'r )r �leak test with class� ��end� failed: command is now hold by� references�!succeeded: command is now hold by) �gc�collect�Tk� Menubutton�sys� getrefcount� add_commandr �ENDr r �destroy)�M�root�buttonr% r �rc�idx�rc1s r �test1r> s � ��J�L�L�L� �4�4�D� ��8� ,� ,� ,�F� �1�V�9�9�D��F�6�N�(� (� (� � �� !� !�B����W��%�%�%� �*�*�S�/�/�C��K�K������J�L�L�L� �/�'� "� "�C� � �!��-�-�-�-� �b�y�y� �.��\�B�B�B�B� �1�3� �E�E�E��L�L�N�N�N�N�Nr c �V �� � � � t j � � t � � � t � d�� � } | |� � � � |d< �� � fd�}d� }� � fd�}d� |||fD � � }|� � � � � |d� � � � � t � � �� � |d � � � � � d � � � � � t � � � � � |d � � � � � t � � }� � � � t j � � d� |||fD � � }t d| d�� � ||k rt d|d|� � nt d|d� � � � � � d S )Nr" r# r% c �T �� t d� � �� � �� � d S )Nzcommand 0 button pressed)r r )�idx0�idx1r% s ���r �command0ztest2.<locals>.command0@ s/ �� � �(�)�)�)�� � � �D�$� � � � � r c �$ � t d� � d S )Nzcommand 1 button pressedr' r r r �command1ztest2.<locals>.command1E s � � �(�)�)�)�)�)r c � �� t d� � t d� � � � t � � �� � � d S )Nzcommand 2 button pressedzdeleting at END)r r r6 �quit)r% r9 s ��r �command2ztest2.<locals>.command2H sD �� � �(�)�)�)� � � � � � � � �C���� � � � � � � � r c �6 � g | ]}t j |� � ��S r �r3 r4 ��.0�xs r � <listcomp>ztest2.<locals>.<listcomp>M s" � � E� E� E��#�/�!� � � E� E� Er z press first)r �labelrE z no Command)rO z press lastc �6 � g | ]}t j |� � ��S r rJ rK s r rN ztest2.<locals>.<listcomp>[ s" � � F� F� F�!�3�?�1� � � F� F� Fr r( r) r* r, zreferences, should ber. r- ) r/ r0 r1 r2 �packr5 r r6 �add_radiobutton�mainloopr r7 ) r8 r: rC rE rH r; �idx2r= rA rB r% r9 s @@@@r �test2rU 7 s� ����� � �J�L�L�L� �4�4�D� ��8� ,� ,� ,�F� �1�V�9�9�D��F�6�N� � � � � � � � *� *� *�� � � � � � F� E�x��8�&D� E� E� E�B� �K�K�M�M�M����X�]��;�;�;� �:�:�c�?�?�D�������<�<�<����<��(�(�(� �:�:�c�?�?�D����X�\��:�:�:� �:�:�c�?�?�D��M�M�O�O�O��J�L�L�L� F� F��(�H�'E� F� F� F�C� � �!��-�-�-�-� �b�y�y� �.��*�B� 0� 0� 0� 0� �1�3� �E�E�E��L�L�N�N�N�N�Nr )�tkinterr3 r/ �Menur r> rU r8 r r r �<module>rX s� �� � � � � � � � � � � � �"� "� "� "� "�� "� "� "�0� � �2,� ,� ,�^ � � � � �A� �E�!�H�H�H� �E�!�H�H�H�H� � r __pycache__/test_sf.cpython-311.pyc 0000644 00000002140 15004413005 0013112 0 ustar 00 � ��bgG � � � d dl Z d� ZdS )� Nc � � ddl m} dd l}dd l}t j |j j � � | � � }d }|� � � }t |� � |� � � t |d � � t |d � � t |d � � |� � � t |t z � � ��)Nr )�hsp� � ) �guppyr �guppy.heapy.UniSet�gc� importlib�reload�heapy�UniSet�heap�print�collect�dict)r r r �hp�xs �k/builddir/build/BUILD/cloudlinux-venv-1.0.7/venv/lib64/python3.11/site-packages/guppy/heapy/test/test_sf.py�tr s� � ������� �!�!�!�!�� � � �����+�,�,�,� �S�U�U�� �� �G�G�I�I�� �a���� � � � � � � �a��d� � � � �a��d� � � � �a��d� � � � � � � � � � �a�$�h���� � )r r � r r �<module>r s* �� � � � �� � � � r support.py 0000644 00000007346 15004413005 0006634 0 ustar 00 """Supporting definitions for the Heapy regression test. Addapted from Python standard module test_support. """ import contextlib import unittest import pdb import sys import tracemalloc class Error(Exception): """Base class for regression test exceptions.""" class TestFailed(Error): """Test failed.""" class TestSkipped(Error): """Test skipped. This can be raised to indicate that a test was deliberatly skipped, but not because a feature wasn't available. For example, if some resource can't be used, such as the network appears to be unavailable, this should be raised instead of TestFailed. """ verbose = 1 # Flag set to 0 by regrtest.py use_resources = None # Flag set to [] by regrtest.py # ======================================================================= # Preliminary PyUNIT integration. class BasicTestRunner: def run(self, test): result = unittest.TestResult() test(result) return result def run_suite(suite, testclass=None): """Run tests from a unittest.TestSuite-derived class.""" if verbose: runner = unittest.TextTestRunner(sys.stdout, verbosity=2) else: runner = BasicTestRunner() result = runner.run(suite) if not result.wasSuccessful(): if len(result.errors) == 1 and not result.failures: err = result.errors[0][1] elif len(result.failures) == 1 and not result.errors: err = result.failures[0][1] else: if testclass is None: msg = "errors occurred; run in verbose mode for details" else: msg = "errors occurred in %s.%s" \ % (testclass.__module__, testclass.__name__) raise TestFailed(msg) raise TestFailed(err) def run_unittest(testclass, debug=0): """Run tests from a unittest.TestCase-derived class.""" suite = unittest.makeSuite(testclass) if debug: suite.debug() else: run_suite(suite, testclass) def debug_unittest(testclass): """ Debug tests from a unittest.TestCase-derived class.""" run_unittest(testclass, debug=1) # Base test case, tailored for heapy class TestCase(unittest.TestCase): def setUp(self): from guppy import Root self.python = Root() self.guppy = self.python.guppy self.heapy = self.guppy.heapy self.Part = self.heapy.Part self.ImpSet = self.heapy.ImpSet self.Use = self.heapy.Use self.View = self.heapy.View self.iso = self.Use.iso self.idset = self.Use.idset self.version_info = sys.version_info def aseq(self, a, b, cont=0): if a != b: print("aseq: Expected: b = ", b) print("Got actually : a = ", a) if cont <= 0: if cont < 0: pdb.set_trace() else: self.assertTrue(0) def asis(self, a, b, cont=0): if a is not b: print("asis: Expected: b = ", b) print("Got actually : a = ", a) if cont <= 0: if cont < 0: pdb.set_trace() else: self.assertTrue(0) def tearDown(self): pass @contextlib.contextmanager def tracemalloc_state(enabled=True): orig_enabled = tracemalloc.is_tracing() def set_enabled(new_enabled): cur_enabled = tracemalloc.is_tracing() if cur_enabled == new_enabled: return if new_enabled: tracemalloc.start() else: tracemalloc.stop() set_enabled(enabled) try: yield finally: set_enabled(orig_enabled) test_Classifiers.py 0000644 00000070603 15004413005 0010422 0 ustar 00 from guppy.heapy.test import support import textwrap PORTABLE_TEST = 1 # Relax tests to be more portable class TestCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.View.is_rg_update_all = False self.US = US = self.heapy.UniSet self.Use = Use = self.heapy.Use Use.reprefix = 'hp.' self.do = lambda x: x.dictof self.un = Use.Anything.fam self.ty = Use.Type self.rc = Use.Rcs self.iso = Use.iso self.Anything = US.Anything self.Nothing = US.Nothing class C1: def x(self): return 0 class C2: pass c1 = C1() self.C1 = C1 self.C2 = C2 self.c1 = c1 def lt(self, a, b): self.assertTrue(a < b) def eq(self, a, b): self.assertTrue(a == b) def dj(self, a, b): # disjoint; not related by <= or >=, and not overlapping self.assertTrue(not a <= b) self.assertTrue(not b <= a) self.assertTrue(not a & b) self.assertTrue(a.disjoint(b)) def nr(self, a, b): # not related by <= or >=, and overlapping self.assertTrue(not a <= b) self.assertTrue(not b <= a) self.assertTrue(a & b) self.assertTrue(not a.disjoint(b)) class SpecialCases(TestCase): # Special tests that catch cases that came up during development & debugging def test_1(self): un = self.un ty = self.ty do = self.do rc = self.rc iso = self.iso All = self.Anything Nothing = self.Nothing C1 = self.C1 C2 = self.C2 c1 = self.c1 def eq(a, b): self.assertTrue(a == b) self.assertTrue(str(a) == str(b)) e1 = [] e2 = {} e3 = [] e4 = () a = ty(int) b = ty(dict) self.assertTrue(~a & ~b != Nothing) eq(ty(list) & iso(e1, e2, e3), iso(e1, e3)) eq((ty(list) | ty(dict)) & iso(e1, e2, e3, e4), iso(e1, e2, e3)) eq(iso(e1, e3) | ty(list), ty(list)) eq(ty(list) | iso(e1, e3), ty(list)) eq(iso(e1, e3) - iso(e3), iso(e1)) eq(~iso(e3) & iso(e1, e3), iso(e1)) eq(iso(e1, e2, e3) - ty(dict), iso(e1, e3)) eq(~ty(dict) & iso(e1, e2, e3), iso(e1, e3)) eq(ty(dict) | iso(e1, e2), ty(dict) | iso(e1)) eq(iso(e1, e2) | ty(dict), ty(dict) | iso(e1)) eq((ty(dict) | ty(tuple)) | iso(e1, e2), (ty(dict) | ty(tuple)) | iso(e1)) eq(iso(e1, e2) | (ty(dict) | ty(tuple)), (ty(dict) | ty(tuple)) | iso(e1)) eq(~ty(dict) | iso(e1, e2), ~ty(dict) | iso(e2)) eq(iso(e1, e2) | ~ty(dict), ~ty(dict) | iso(e2)) eq(ty(dict) - iso(e1, e2), ty(dict) - iso(e2)) eq(~iso(e1, e2) & ty(dict), ty(dict) - iso(e2)) eq(iso(e1, e3) ^ iso(e2), iso(e1, e2, e3)) eq(iso(e1, e3) ^ iso(e2, e3), iso(e1, e2)) eq(iso(e1, e3) ^ iso(e1, e3), Nothing) eq(iso(e1, e3) <= ty(list), True) eq(iso(e1, e2) <= ty(list) | ty(dict), True) eq(ty(list) >= iso(e1, e3), True) eq(ty(list) | ty(dict) >= iso(e1, e2), True) def test_2(self): un = self.un ty = self.ty do = self.do rc = self.rc iso = self.iso All = self.Anything Nothing = self.Nothing C1 = self.C1 C2 = self.C2 c1 = self.c1 class C3(object): def x(self): return 1 def asrt(x): self.assertTrue(x) def no(x): self.assertTrue(not x) eq = self.aseq # Tests to do with Nothing being finite - having length and iteration no(dict in (ty(dict) | ty(int))) no([] in (ty(dict) | ty(int))) asrt({} in (ty(dict) | ty(int))) asrt(dict in (ty(dict) | ty(int) | ty(type(dict)))) asrt(list(ty(list) & iso({})) == []) # When creating ISO classes, we don't want to memoize them # which would leak the elements. from sys import getrefcount as grc import sys import types c = C1() rc = grc(c) x = iso(c) x = None eq(grc(c), rc) def test_dictowner(self): # Special test for dict ownership # motivated by: dicts that are not found in traversal, should not # cause repeated (unsuccessfull) updates of dict ownership # This is a performance question, requires special kind of testing # # Also tests that dict & dict owners are not leaked import gc from sys import getrefcount as grc Use = self.Use C1 = self.C1 c1 = self.c1 iso = self.iso o = self.python.io.StringIO() # Create a dict hidden from view d1 = self.View.immnodeset([{}]) d3 = {} # Remember the initial ref counts for target objects gc.collect() rcd1 = grc(list(d1)[0]) rcd3 = grc(d3) rcC1 = grc(C1) rcc1 = grc(c1) rcdc1 = grc(c1.__dict__) clock = self.python.time.process_time N = 5 M = 50 # This was the fast case, when only reachable dicts are classified for i in range(N): print(iso(d3).kind, file=o) print(iso(c1.__dict__).kind, file=o) # Now measure it while 1: gc.collect() t = clock() for i in range(M): iso(d3).kind iso(c1.__dict__).kind fast = clock()-t if fast >= 0.5: # Enough resolution? break else: M *= 2 # No, try more loops # This was a slow case; involving repeated classification of a unreachable dict # It was originally 4.97 times slower when N was 5 # The problem occurs for successive classifications of different dicts, # when at least one of them is unreachable. gc.collect() for i in range(N): print(iso(*d1).kind, file=o) print(iso(c1.__dict__).kind, file=o) gc.collect() # Now measure it t = clock() for i in range(M): iso(*d1).kind iso(c1.__dict__).kind slow = clock()-t self.assertTrue(slow <= 1.5*fast) # This is another slow case according to notes Nov 18 2004. # A succession of different unreachable dicts. gc.collect() dn = self.View.immnodeset([{} for i in range(N)]) for i in range(N): print(iso(list(dn)[i]).kind, file=o) # Now measure it gc.collect() dn = self.View.immnodeset([{} for i in range(M)]) t = clock() for i in range(M): iso(list(dn)[i]).kind slow = clock()-t # Sometimes M might be huge, and the vast majority of time it is not # doing the classification. # self.assertTrue(slow <= 1.5*fast) # Partition was likewise slow for unreachable dicts dn = self.View.immnodeset([{} for i in range(N)]) gc.collect() print([x[0] for x in Use.Clodo.classifier.partition(dn)], file=o) # Now measure it dn = self.View.immnodeset([{} for i in range(M)]) gc.collect() t = clock() [x[0] for x in Use.Clodo.classifier.partition(dn)] slow = clock()-t self.assertTrue(slow <= 1.5*fast) # Check that ref counts for target objects are the same as initially gc.collect() gc.collect() # Note May 17 2005 self.aseq(grc(list(d1)[0]), rcd1) self.aseq(grc(d3), rcd3) self.aseq(grc(c1), rcc1) self.aseq(grc(C1), rcC1) self.aseq(grc(c1.__dict__), rcdc1) self.aseq(o.getvalue(), """\ dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict of <Module>.C1 dict (no owner) dict (no owner) dict (no owner) dict (no owner) dict (no owner) [hp.Nothing.dictof] """.replace('<Module>', self.__module__)) def test_retclaset(self): # Test (A) that referrer classifications don't leak their classes # and (B) that selection is not disturbed by list arguments # (This is removed since it doesnt always work) # and (C) that selection does update referrer graph correctly self.__module__ = '<Module>' # Make the rendering independent on our name from sys import getrefcount as grc import gc C1 = self.C1 c1 = self.c1 iso = self.iso rcC1 = grc(C1) o = self.python.io.StringIO() print(iso(C1).byrcs.kind, file=o) s = iso(c1).byrcs.kind print(s, file=o) self.aseq(s & iso(c1), iso(c1)) x = C1() self.aseq(s & iso(c1, x), iso(c1)) s = iso(x).byrcs.kind self.aseq(s & iso(c1, x), iso(x)) x = C1() # (C) make sure referrer graph is updated by select self.aseq(s & iso(c1, x), iso(x)) s = None x = None gc.collect() gc.collect() # Note May 17 2005 self.aseq(grc(C1), rcC1) # (A) def test_alt_retclaset(self): # Test the alternative referrer memo update # On low level, and the speed of selection import gc iso = self.iso a = [] b = self.View.immnodeset([[]]) x = [a, b] hv = self.View.hv rg = self.View.nodegraph() gc.collect() hv.update_referrers_completely(rg) self.assertTrue(x in rg[a]) self.assertTrue(rg[list(b)[0]] == (None,)) rg.clear() rg = None # Test View functionality self.View.is_rg_update_all = True gc.collect() iso(a).referrers self.assertTrue(a in self.View.rg.get_domain()) self.assertTrue(list(b)[0] in self.View.rg.get_domain()) clock = self.python.time.process_time s = iso(a) N = 1000 while 1: t = clock() for i in range(N): s.referrers fast = clock()-t if fast >= 0.5: break N *= 2 # CPU is too fast to get good resolution, try more loops t = clock() for i in range(N): self.View.rg.domain_covers([a]) self.View.rg[a] faster = clock()-t s = iso(*b) t = clock() for i in range(N): s.referrers slow = clock() - t self.assertTrue(not slow > fast * 4) def test_via(self, vlist=['v', ]): # vlist is just to make v unoptimizable # Special tests for the via classifier from sys import getrefcount as grc import gc iso = self.iso hp = self.Use d = {} k = ('k',) v = tuple(vlist) # Make sure v is not optimized to a constant d[k] = v d[v] = v rck = grc(k) rcv = grc(v) s = iso(v) self.assertTrue(s.byvia.kind == hp.Via("_.f_locals['v']", "_[('k',)]", "_[('v',)]", '_.keys()[1]') or s.byvia.kind == hp.Via("_.f_locals['v']", "_[('k',)]", "_[('v',)]", '_.keys()[0]')) del s gc.collect() gc.collect() self.aseq(grc(k), rck) self.aseq(grc(v), rcv) class RenderCase(TestCase): def test_rendering(self): import sys import types iso = self.iso C1 = self.C1 c1 = self.c1 class C3(object): def x(self): return 1 e1 = [] e2 = {} e3 = [] o = self.python.io.StringIO() # str'ing of homogenous & inhoumogenous values self.US.summary_str.str_address = lambda x: '<address>' def ps(x): print(x.brief, file=o) ps(iso(1, 2)) ps(iso(1, 2.0, 3.0)) ps(iso(e1)) ps(iso(e1, e2)) ps(iso(e1, e3)) ps(iso(self.python.builtins.TypeError())) # ps(iso(type('MetaType', (type,), {})('MetaTypeIns', (), {}))) ps(iso(None)) ps(iso(sys, support, types)) ps(iso(int, type, C3)) ps(iso(C1())) ps(iso(C3())) ps(iso(C1)) ps(iso(C3)) ps(iso(len)) ps(iso(self.setUp)) ps(iso(C1.x)) ps(iso(C1().x)) ps(iso(C3.x)) ps(iso(C3().x)) ps(iso({})) ps(iso(c1.__dict__)) ps(iso(types.__dict__)) try: 1/0 except ZeroDivisionError: typ, value, traceback = sys.exc_info() ps(iso(traceback)) ps(iso(traceback.tb_frame)) expected = textwrap.dedent("""\ <2 int: 1, 2> <3 (float | int): <2 float: 2.0, 3.0> | <1 int: 1>> <1 list: <address>*0> <2 (dict (no owner) | list): <1 dict (no owner): <address>*0> | <1 list: <ad...> <2 list: <address>*0, <address>*0> <1 TypeError: <address>> <1 builtins.NoneType: None> <3 module: guppy.heapy.test.support, sys, types> <3 type: <Module>.C3, int, type> <1 <Module>.C1: <address>> <1 <Module>.C3: <address>> <1 type: <Module>.C1> <1 type: <Module>.C3> <1 types.BuiltinMethodType: len> <1 types.MethodType: <<Module>.RenderCase at <addre...> <1 function: <Module>.x> <1 types.MethodType: <<Module>.C1 at <address>>.x> <1 function: <Module>.x> <1 types.MethodType: <<Module>.C3 at <address>>.x> <1 dict (no owner): <address>*0> <1 dict of <Module>.C1: <address>> <1 dict of module: types> <1 types.TracebackType: <in frame <test_rendering at <address>> at <address>>> <1 types.FrameType: <test_rendering at <address>>> """) expected = expected.replace('<Module>', self.__module__) if self.version_info >= (3, 10): expected = expected.replace('builtins.NoneType', 'types.NoneType') self.aseq(o.getvalue(), expected) if PORTABLE_TEST: return o = self.python.io.StringIO() # The following is nonportable, sizes may change # In particular, the list size changed from 2.3 to 2.4 # The following test is only for 2.3 in 32-bit python # pp'ing prints in a nice form # This tests all types currently defined in Classifiers.Summary_str # and then some # Except: frametype; its size varies from time to time! x = iso(len, C1, 1.0+3j, {1: 2, 3: 4}, 1.25, C1.x.__func__, 1, ['list'], 100000000000, None, C1.x, C1().x, C3.x, C3().x, sys, support, 'string', ('tuple',), C3, int, type(None), # and some types not defined C1(), C3(), c1.__dict__ ) print(x, file=o) print(x.more, file=o) # Test instancetype; we need to replace the classifier with bytype x = iso(C1()).bytype print(x, file=o) expected = """\ Partition of a set of 24 objects. Total size = 2128 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 3 12 1272 60 1272 60 type 1 4 17 144 7 1416 67 types.MethodType 2 1 4 136 6 1552 73 dict (no owner) 3 1 4 136 6 1688 79 dict of <Module>.C1 4 1 4 60 3 1748 82 list 5 1 4 56 3 1804 85 function 6 2 8 48 2 1852 87 module 7 1 4 44 2 1896 89 class 8 1 4 32 2 1928 91 <Module>.C1 9 1 4 32 2 1960 92 str <8 more rows. Type e.g. '_.more' to view.> Index Count % Size % Cumulative % Kind (class / dict of class) 10 1 4 32 2 1992 94 types.BuiltinMethodType 11 1 4 28 1 2020 95 <Module>.C3 12 1 4 28 1 2048 96 tuple 13 1 4 24 1 2072 97 complex 14 1 4 20 1 2092 98 long 15 1 4 16 1 2108 99 float 16 1 4 12 1 2120 100 int 17 1 4 8 0 2128 100 types.NoneType Partition of a set of 1 object. Total size = 32 bytes. Index Count % Size % Cumulative % Type 0 1 100 32 100 32 100 types.InstanceType """.replace('<Module>', self.__module__) self.aseq(o.getvalue(), expected) class BaseCase(TestCase): def test_minmax(self): s = self.guppy.sets.immbitset min = self.US.minimals max = self.US.maximals self.aseq(min([]), []) self.aseq(min([1]), [1]) self.aseq(min([1, 1]), [1]) self.aseq(min([1, 2]), [1]) self.aseq(min([[], []]), [[]]) self.aseq(min([s([1]), s([1, 2])]), [s([1])]) self.aseq(min([s([1]), s([1, 2]), s([3])]), [s([1]), s([3])]) self.aseq(max([]), []) self.aseq(max([1]), [1]) self.aseq(max([1, 1]), [1]) self.aseq(max([1, 2]), [2]) self.aseq(max([[], []]), [[]]) self.aseq(max([s([1]), s([1, 2])]), [s([1, 2])]) self.aseq(max([s([1]), s([1, 2]), s([3])]), [s([1, 2]), s([3])]) def test_base_classes(self): un = self.un ty = self.ty do = self.do rc = self.rc iso = self.iso All = self.Anything Nothing = self.Nothing C1 = self.C1 C2 = self.C2 c1 = self.c1 lt = self.lt eq = self.eq dj = self.dj nr = self.nr data = [ (All, eq, All), (ty(int), eq, ty(int)), (ty(int), dj, ty(dict)), (ty(int), lt, All), (rc(ty(dict)), eq, rc(ty(dict))), (rc(ty(dict)), lt, All), (rc(ty(dict)), dj, rc(ty(list))), (iso(1), eq, iso(1)), (iso(1), lt, All), (iso(1), dj, iso(2)), (iso(1), lt, ty(int)), (iso(1), dj, ty(dict)), (Nothing, eq, Nothing), (Nothing, lt, ty(int)), (Nothing, lt, iso(1)), ] # Test relation of base classifications for a, cmp, b in data: cmp(a, b) # Test the four set-operations: & | - ^ # depending on the asserted argument relation if cmp is eq: eq(b, a) elif cmp is lt: self.assertTrue(b > a) eq(b ^ a, b - a) # Simple transformation eq(a ^ b, b - a) # -=-, indep. of type lt(a, b) elif cmp is dj: dj(b, a) # check that the dj relation is symmetric eq(a & b, Nothing) eq(b & a, Nothing) eq(a | b, b | a) eq(a - b, a) eq((a | b) - b, a) eq(a ^ b, a | b) eq(b ^ a, a | b) lt(a, a | b) lt(b, a | b) elif cmp is nr: nr(b, a) # symmetric as well eq(a & b, b & a) eq(a & b & b, a & b) eq((a & b) - b, Nothing) eq((a | b) - b, a - b) eq(a | b, b | a) lt(Nothing, a & b) lt(Nothing, b & a) lt(a & b, a) lt(a & b, b) lt(a - b, a) dj(a - b, b) lt(a ^ b, a | b) lt(a, a | b) lt(b, a | b) def test_invalid_operations(self): US = self.US US.auto_convert_iter = False US.auto_convert_type = False ty = self.ty c1 = self.c1 self.assertRaises(TypeError, lambda: ty(c1)) self.assertRaises(TypeError, lambda: ty(int) <= None) self.assertRaises(TypeError, lambda: None >= ty(int)) self.assertRaises(TypeError, lambda: None <= ty(int)) self.assertRaises(TypeError, lambda: list(ty(int))) self.assertRaises(TypeError, lambda: len(ty(int))) self.assertRaises(TypeError, lambda: ty(int) & None) self.assertRaises(TypeError, lambda: None & ty(int)) self.assertRaises(TypeError, lambda: ty(int) | None) self.assertRaises(TypeError, lambda: None | ty(int)) self.assertRaises(TypeError, lambda: ty(int) - None) self.assertRaises(TypeError, lambda: None - ty(int)) self.assertRaises(TypeError, lambda: ty(int) ^ None) self.assertRaises(TypeError, lambda: None ^ ty(int)) self.assertRaises(TypeError, lambda: ty(int) | [14]) self.assertRaises(TypeError, lambda: ty(int) | dict) self.assertRaises(TypeError, lambda: ty(int) | self.C1) def test_fancy_list_args(self): # Test the, normally disabled, possibility to use iterables as # right and left arguments in set expressions. # This option can cause problems as noted 22/11 2004. self.US.auto_convert_iter = True eq = self.eq iso = self.iso ty = self.ty e1 = [] e2 = {} e3 = [] e4 = () eq(ty(list) & [e1, e2, e3], iso(e1, e3)) eq([e1, e2, e3] & ty(list), iso(e1, e3)) # Requires __rand__ eq([e1, e2, e4] & (ty(dict) | ty(list)) == [e1, e2], True) eq([e1, e2] & (ty(dict) | ty(list)) == [e1, e2], True) eq(iso(e1, e2) & (ty(dict) | ty(list)) == [e1, e2], True) eq(iso(e1, e2) & [e1, e3], iso(e1)) eq(iso(e1, e2) | [e1, e3], iso(e1, e2, e3)) # Requires __ror__ eq([e1, e3] | iso(e1, e2), iso(e1, e2, e3)) eq(iso(e1, e3) - [e3], iso(e1)) eq([e1, e3] - iso(e3), iso(e1)) # Requires __rsub__ eq([e1, e2, e3] - ty(dict), iso(e1, e3)) eq(~ty(dict) & [e1, e2, e3], iso(e1, e3)) eq(iso(e1, e3) ^ [e2], iso(e1, e2, e3)) eq([e2] ^ iso(e1, e3), iso(e1, e2, e3)) # Requires __rxor__ eq([e1, e2] <= iso(e1, e2, e3), True) eq([e1, e2] <= ty(list) | ty(dict), True) eq((ty(list) | ty(dict)) >= [e1, e2], True) eq([e1, e2] <= ty(list), False) eq([e1, e2] <= iso(e1), False) eq([e1, e2] >= iso(e1, e2, e3), False) eq([e1, e2] >= iso(e1, e2), True) eq(iso(e1, e2, e3) <= [e1, e2], False) eq(iso(e1, e2) <= [e1, e2], True) eq(iso(e1, e2, e3) >= [e1, e2], True) eq(iso(e1, e2) >= [e1, e2, e3], False) def test_fancy_type_conversions(self): # Test the, perhaps optional, possibility to use types and classes # in classification set expressions. self.US.auto_convert_type = True un = self.un ty = self.ty do = self.do rc = self.rc iso = self.iso All = self.Anything Nothing = self.Nothing C1 = self.C1 C2 = self.C2 c1 = self.c1 def eq(a, b): self.assertTrue(a == b) e1 = [] e2 = {} e3 = [] e4 = () eq(ty(dict), dict) eq(iso(e1, e2) & dict, iso(e2)) eq(dict & iso(e1, e2), iso(e2)) eq(iso(e1, e2) | dict, iso(e1) | ty(dict)) eq(dict | iso(e1, e2), iso(e1) | ty(dict)) eq(iso(e1, e2) - dict, iso(e1)) eq(dict - iso(e1, e2), ty(dict) - iso(e2)) eq(iso(e1, e2, e3) ^ dict, (ty(dict)-iso(e2)) | iso(e1, e3)) class LawsCase(TestCase): def test_laws(self): un = self.un ty = self.ty do = self.do rc = self.rc iso = self.iso All = self.Anything Nothing = self.Nothing C1 = self.C1 C2 = self.C2 c1 = self.c1 lt = self.lt eq = self.eq t = self.guppy.sets.test absorption = t.absorption associative = t.associative commutative = t.commutative deMorgan = t.deMorgan distributive = t.distributive idempotence = t.idempotence inclusion = t.inclusion def ltr(a, b, level=3): lt(a, b) eq(a & b, a) eq(b & a, a) eq(a | b, b) eq(b | a, b) eq(a - b, Nothing) eqr(b - a, b - a) eq((b - a) | a, b) eq(a | (b - a), b) eq(a & (b - a), Nothing) eq((b - a) & a, Nothing) eq((b - a) - a, (b - a)) eq(a - (b - a), a) # note Nov 3 2004 if level > 0: if a is Nothing: eq(b - a, b) else: ltr(b - a, b, level-1) def eqr(a, b, level=1): eq(a, b) eq(a & b, a) eq(a | b, a) eq(a - b, Nothing) eq(a ^ b, Nothing) if level: eqr(b, a, level - 1) classes = [All, ty(int), ty(type(c1)), rc(ty(dict)), iso(c1), Nothing] for a in classes: idempotence(a) for b in classes: if a <= b: if b <= a: eqr(a, b) else: ltr(a, b) elif b <= a: ltr(b, a) absorption(a, b) commutative(a, b) inclusion(a, b) deMorgan(a, b) for c in classes: associative(a, b, c) deMorgan(a, b, c) distributive(a, b, c) class ClassificationCase(TestCase): def test_classification(self): # Test classification by the standard classifiers self.View.is_rg_update_all = True # Tricky details Note Apr 22 2005 Use = self.Use iso = self.iso nodeset = self.heapy.UniSet.immnodeset class A: pass class B(object): pass a = A() b = B() li = [1, [], {}, a, b, a.__dict__, b.__dict__] for o in li: self.asis(iso(o).bytype.kind.arg, type(o)) for o in li: if o is a.__dict__: kind = iso(a).kind elif o is b.__dict__: kind = iso(b).kind elif type(o) is dict: kind = Use.Nothing elif o is a: kind = a.__class__ else: kind = type(o) self.aseq(iso(o).kind.arg, kind) cla = iso(()).byunity.kind self.asis(cla.arg, None) for o in li: self.aseq(iso(o).byunity.kind, cla) for o in li: self.aseq(iso(o).byid.kind, Use.Id(id(o))) # self.View.update_referrers(nodeset(li)) for i, o in enumerate(li): cl = iso(o).byrcs.kind if 1 <= i <= 2: self.aseq(cl, Use.Clodo.sokind(list).refdby) if i == 5: self.aseq(cl, Use.Clodo.sokind(A)(list).refdby) if i == 6: self.aseq(cl, Use.Clodo.sokind(B)(list).refdby) def test_selection(self): # Test classifications operations via selection invariant Use = self.Use class A: pass class B(object): pass a = A() b = B() li = Use.iso(135, [], {}, a, b, a.__dict__, b.__dict__) allers = (Use.Unity, Use.Type, Use.Clodo, Use.Rcs, Use.Via) # , Use.Id ps = {} for er in allers: # p = er.classifier.partition(li.nodes) p = [(av.kind, av) for av in li.by(er).partition] for ak, av in p: if ak in ps: self.aseq(ps[ak], av) else: ps[ak] = av for ak, av in list(ps.items()): self.aseq(ak & li, av) for bk, bv in list(ps.items()): # Test set operations by selection definition self.aseq((ak & bk) & li, av & bv) self.aseq((ak | bk) & li, av | bv) self.aseq((ak - bk) & li, av - bv) self.aseq((bk - ak) & li, bv - av) self.aseq((ak ^ bk) & li, av ^ bv) def test_main(testrender=1, debug=0): support.run_unittest(BaseCase, debug) support.run_unittest(ClassificationCase, debug) support.run_unittest(LawsCase, debug) support.run_unittest(RenderCase, debug) support.run_unittest(SpecialCases, debug) test_ER.py 0000644 00000031072 15004413005 0006456 0 ustar 00 # Tests of equivalence relations. # These are also tested by test_Classifiers. # This is some more tests, tailored esp. to the user view. # (test_Classifiers was so slow already, so I start over) # o Intended to be exhaustive wrt all ER's defined # # o Intersection of ER's from guppy.heapy.test import support import inspect import os.path class TestCase(support.TestCase): pass class FirstCase(TestCase): def test_1(self): hp = self.heapy.Use hp.reprefix = 'hp.' a = hp.iso(1, '', 'asdf', 3.4, 3.7, 2) ts = (hp.Type & hp.Size) k = ts[a] # From Sep 1-2 2005 # (h&dict).by(hp.Id.dictof&hp.Size)._get_partition() # (h&dict).by((hp.Type&hp.Size).dictof&hp.Size) # These require with_referrers of refby/via classifier # after gc collect referrers graph will be empty # (h).by(hp.Module.refby.dictof) # (h).by(hp.Via.dictof) # How to construct RCS / refby # self.aseq(hp.Type.refby(int, list) , hp.Type.refby(list, int) class C: pass di = hp.iso(C.__dict__, []) # db = di.by('Rcs') # for i in (0, 1): # rk = repr(db[i].kind) # ek = eval(rk, {'hp': hp}, {}) # self.aseq(ek, db[i].kind) # self.aseq(db & ek, db[i]) def test_2(self): ' Systematically test all kind constructors: ' # wrt repr and evaluation of repr hp = self.heapy.Use hp.reprefix = 'hp.' class C: pass class T(object): pass c = C() t = T() import sys for s in ( 'hp.Clodo(dictof=C)', 'hp.Clodo(dictof=T)', 'hp.Clodo(dictof=())', 'hp.Clodo(C)', 'hp.Clodo(T)', 'hp.Id(id(c))', 'hp.Module("sys")', 'hp.Prod()', 'hp.Prod("<string>")', 'hp.Prod(T)', 'hp.Prod("/foo.py", 1)', 'hp.Prod("/foo.py", None)', 'hp.Prod(None, 1)', 'hp.Rcs(hp.Clodo.sokind(int)(dictof=C))', 'hp.Size(hp.iso(c).indisize)', 'hp.Size(hp.iso(C).indisize).dictof', 'hp.Type(T)', 'hp.Type(int)', 'hp.Unity()', 'hp.Via()', # Via is also specially tested below ): x = eval(s, {'hp': hp, 'C': C, 'T': T, 'c': c}, {}) rx = repr(x) self.aseq(eval(rx, {'hp': hp}, {}), x) for i, s in enumerate(( # Test Via construction. # One test for each relation kind defined in Path except IDENTITY and RELSRC. # In code order. "hp.Via('_.x')", "hp.Via('_[0]')", "hp.Via('_.keys()[0]')", "hp.Via('_->abc')", "hp.Via('_.__dict__.keys()[0]')", "hp.Via('_.f_locals[\"abc\"]')", "hp.Via('_.f_locals [\"abc\"]')", "hp.Via('_->f_valuestack[0]')", "hp.Via('list(_)[0]')", )): code = i + 1 x = eval(s, {'hp': hp}, {}) rel = list(x.arg)[0] self.aseq(rel.kind, code) rx = repr(x) self.aseq(eval(rx, {'hp': hp}, {}), x) def test_3(self): ' Test of dictof ' # Test of dictof on something that requires memoization, i.e. Size, & (and) hp = self.heapy.Use class C: pass class T(object): # The test works only if sizes of objects of class C and T differ. # At first test, T() was 4 bytes smaller than C(). # This might be brittle with different systems. # This is to make sure this diff gets significantly bigger: __slots__ = '__dict__', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h' c = C() t = T() dn = {} isod = hp.iso(c.__dict__, t.__dict__, dn) for x in ( t, c): X = x.__class__ for k in ( hp.Clodo(dictof=X), hp.Size(hp.iso(x).indisize).dictof, hp.iso(x).bysize.kind.dictof, hp.iso(x.__dict__).kind, ): self.aseq(isod & k, hp.iso(x.__dict__)) # Test no-owner selection for k in ( hp.Nothing.dictof, ): self.aseq(isod & k, hp.iso(dn)) def test_4(self): ' Test of via ' # Esp. representation, construction class C: pass c = C() hp = self.heapy.Use isod = hp.iso(c.__dict__) x = isod.by('Via').kind self.aseq(repr(x), "hpy().Via('.__dict__')") def test_5(self): ' Non-systematic tests that came up around Sep 14 2005 ' class C: pass c = C() d = {} cref = [c] cref.append(cref) c.cref = cref hp = self.heapy.Use hp.reprefix = 'hp.' # I thought these should be the same a = hp.iso(C, c, c.__dict__, d) b = hp.iso(C, c, c.__dict__, d) self.aseq(a, b) # This is a kind of nested refdby that has been a concern lately # -- how to represent it s = hp.iso(C.__dict__, C, c, c.__dict__, d).by(hp.Clodo.refdby.refdby) for i in range(len(s)): a = s[i].kind ra = repr(a) era = eval(ra, {'hp': hp}, {}) self.aseq(a, era) self.aseq(s & era, s[i]) import sys p = sys.path del sys s = hp.iso(p) x = s.by(hp.Module.dictof.refdby) self.aseq(s & eval(repr(x.kind), {'hp': hp}, {}), s) def test_6(self): ' Test of .refdby on all others ' with self.tracemalloc_state(): class C: pass c = C() d = {} cref = [c] cref.append(cref) c.cref = cref hp = self.heapy.Use hp.reprefix = 'hp.' s = hp.iso(C.__dict__, C, c, c.__dict__, d, inspect) for pre in ( 'Unity', 'Clodo', 'Id', 'Module', 'Prod', ('Rcs', 0), 'Size', 'Type', 'Via' ): if isinstance(pre, tuple): pre, level = pre else: level = 1 er = getattr(hp, pre) self.er_test(er, s, level) def er_test(self, er, set, level=1): # Tests what any eqv. rel. er should do hp = self.heapy.Use rer = repr(er) self.aseq(eval(rer, {'hp': hp}, {}), er) for s in (set,): sby = s.by(er) sk = sby.kind rsk = repr(sk) ske = eval(rsk, {'hp': hp}, {}) self.aseq(ske, sk, -1) self.aseq(s & sk, s, -1) self.aseq(s & ske, s, -1) # That it can do .refdby er_refdby = er.refdby # That it can do .dictof er_dictof = er.dictof if level > 0: self.er_test(er_refdby, set, level - 1) self.er_test(er_dictof, set, level - 1) def test_7(self): ' Test of alternative sets w. biper ' hp = self.heapy.Use class C: pass class D(C): pass class E(D): pass class T(object): pass class U(T): pass class V(U): pass c = C() d = D() e = E() t = T() u = U() v = V() s = hp.iso([], {}, c, d, e, t, u, v, d.__dict__) for k in ( hp.Size(32), hp.Type(U), ): lt = k.alt('<') le = k.alt('<=') ge = k.alt('>=') gt = k.alt('>=') ne = k.alt('!=') assert (s & le) & (s & ge) == s & k for a in (lt, le, ge, gt, ne, le & ~k): s & a import gc gc.collect() a = s.by(k.alt('>=').biper) b = s.by(k.alt('>=').biper) self.assertTrue(hp.iso(d.__dict__) <= a[0]) self.assertTrue(a == b) gc.collect() a = s.by(k.alt('<=').biper) b = s.by(k.alt('<=').biper) self.assertTrue(hp.iso(d.__dict__) <= a[0]) self.assertTrue(a == b) def test_8(self): ' Test of findex and biper ' # added Nov 3 2005 hp = self.heapy.Use class C: pass c = C() li = [] di = {} s = hp.iso(li, di, c, 1) for k, i in ( (hp.Type(dict), 0), (hp.iso(c), 1), (hp.iso(c, li), 1), ): p = s.by(k.biper) self.aseq(p[i].kind.fam.classifier.kinds[0], k) def test_9(self): ' Test the subrelation relation ' from guppy import hpy ernames = ['Clodo', 'Id', 'Idset', 'Module', 'Prod', 'Rcs', 'Size', 'Type', 'Unity'] hp = hpy() ers = [(name, getattr(hp, name)) for name in ernames] ers.append(('Size&Type', hp.Size & hp.Type)) from io import StringIO f = StringIO() print(''.ljust(10), end=' ', file=f) for b in ers: print(b[0].ljust(7), end=' ', file=f) print(file=f) for a in ers: print(a[0].ljust(10), end=' ', file=f) for b in ers: print(str((a[1] < b[1]))[:1].ljust(7), end=' ', file=f) print(file=f) self.aseq(f.getvalue(), """\ Clodo Id Idset Module Prod Rcs Size Type Unity Size&Type \n\ Clodo F F F F F F F T T F \n\ Id F F F F F F F F T F \n\ Idset F F F F F F F F T F \n\ Module F F F F F F F F T F \n\ Prod F F F F F F F F T F \n\ Rcs F F F F F F F F T F \n\ Size F F F F F F F F T F \n\ Type F F F F F F F F T F \n\ Unity F F F F F F F F F F \n\ Size&Type F F F F F F T T T F \n\ """) def test_10(self): ' Test of producer profile ' hp = self.heapy.Use with self.tracemalloc_state(): class C: pass file = inspect.currentframe().f_code.co_filename def lineno(): return inspect.currentframe().f_back.f_lineno str_aloc = eval('C()', {'C': C}, {}) test_aloc, test_aloc_line = C(), lineno() def subf(): return C(), lineno() subf_aloc, subf_aloc_line = subf() isod = hp.iso(None, str_aloc, test_aloc, subf_aloc) self.aseq(isod & hp.Prod(), hp.iso(None)) self.aseq(isod & hp.Prod('<string>', 1), hp.iso(str_aloc)) self.aseq(isod & hp.Prod(file, test_aloc_line), hp.iso(test_aloc)) self.aseq(isod & hp.Prod(file, subf_aloc_line), hp.iso(subf_aloc)) self.aseq(isod & hp.Prod(file), hp.iso(test_aloc, subf_aloc)) self.aseq(isod & hp.Prod(os.path.dirname(file)), hp.iso(test_aloc, subf_aloc)) self.aseq(isod & hp.Prod(self.test_10), hp.iso(test_aloc, subf_aloc)) self.aseq(isod & hp.Prod(subf), hp.iso(subf_aloc)) self.aseq(isod & hp.Prod(None, test_aloc_line).alt('>=') & hp.Prod(None, test_aloc_line).alt('<='), hp.iso(test_aloc)) with self.assertRaises(TypeError): hp.Prod('', lineno=1) with self.assertRaises(TypeError): hp.Prod(filename='', line=1) with self.assertRaises(TypeError): hp.Prod(None) with self.assertRaises(TypeError): hp.Prod(1, 1) with self.assertRaises(TypeError): hp.Prod('', '') with self.assertRaises(TypeError): hp.Prod('', 1, 2) def test_main(debug=0): support.run_unittest(FirstCase, debug) if __name__ == "__main__": from guppy.heapy.Remote import off off() test_main() test_OutputHandling.py 0000644 00000002540 15004413005 0011113 0 ustar 00 from guppy.heapy.test import support class FirstCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.OH = self.heapy.OutputHandling def test_1(self): class T: def __init__(self, test, numlines, get_num_lines=None, get_more_msg=None): mod = test.OH def get_line_iter(): for i in range(numlines): yield '%d' % i self.mod = mod mod.setup_printing( self, get_line_iter=get_line_iter, max_more_lines=4, get_num_lines=get_num_lines, get_more_msg=get_more_msg) self.aseq(str(T(self, 4)), '0\n1\n2\n3') t = T(self, 6, lambda: 6) self.aseq( str(t), "0\n1\n2\n3\n<Lines 0..3 of 6. Type e.g. '_.more' for more.>") x = t.more self.aseq(str(x), '4\n5') self.aseq( str(x.top), "0\n1\n2\n3\n<Lines 0..3 of 6. Type e.g. '_.more' for more.>") self.aseq(str(x.all), "0\n1\n2\n3\n4\n5") t = T(self, 6, get_more_msg=lambda f, t: '<%d more rows>' % (6-t)) self.aseq(str(t), '0\n1\n2\n3\n<3 more rows>') def test_main(debug=0): support.run_unittest(FirstCase, debug) if __name__ == "__main__": test_main() test_Part.py 0000644 00000024236 15004413005 0007062 0 ustar 00 from guppy.heapy.test import support PORTABLE_TEST = 1 # Relax tests to be more portable class IdentityCase(support.TestCase): def test_1(self): import itertools import random import sys vs = list(range(100)) random.shuffle(vs) vs = [float(i) for i in vs] x = self.iso(*vs).byid sz = sys.getsizeof(0.0) self.aseq(str(x)+'\n'+str(x.more)+'\n', """\ Set of 100 <float> objects. Total size = {sztotal} bytes. Index Size % Cumulative % Value 0 {sz:>3} 1.0 {szacc[0]:>4} 1.0 0.0 1 {sz:>3} 1.0 {szacc[1]:>4} 2.0 1.0 2 {sz:>3} 1.0 {szacc[2]:>4} 3.0 2.0 3 {sz:>3} 1.0 {szacc[3]:>4} 4.0 3.0 4 {sz:>3} 1.0 {szacc[4]:>4} 5.0 4.0 5 {sz:>3} 1.0 {szacc[5]:>4} 6.0 5.0 6 {sz:>3} 1.0 {szacc[6]:>4} 7.0 6.0 7 {sz:>3} 1.0 {szacc[7]:>4} 8.0 7.0 8 {sz:>3} 1.0 {szacc[8]:>4} 9.0 8.0 9 {sz:>3} 1.0 {szacc[9]:>4} 10.0 9.0 <90 more rows. Type e.g. '_.more' to view.> Index Size % Cumulative % Value 10 {sz:>3} 1.0 {szacc[10]:>4} 11.0 10.0 11 {sz:>3} 1.0 {szacc[11]:>4} 12.0 11.0 12 {sz:>3} 1.0 {szacc[12]:>4} 13.0 12.0 13 {sz:>3} 1.0 {szacc[13]:>4} 14.0 13.0 14 {sz:>3} 1.0 {szacc[14]:>4} 15.0 14.0 15 {sz:>3} 1.0 {szacc[15]:>4} 16.0 15.0 16 {sz:>3} 1.0 {szacc[16]:>4} 17.0 16.0 17 {sz:>3} 1.0 {szacc[17]:>4} 18.0 17.0 18 {sz:>3} 1.0 {szacc[18]:>4} 19.0 18.0 19 {sz:>3} 1.0 {szacc[19]:>4} 20.0 19.0 <80 more rows. Type e.g. '_.more' to view.> """.format(sz=sz, sztotal=sz*100, szacc=list(itertools.accumulate([sz] * 20)))) self.aseq(str(x.all)+'\n', """\ Set of 100 <float> objects. Total size = {sztotal} bytes. Index Size % Cumulative % Value 0 {sz:>3} 1.0 {szacc[0]:>4} 1.0 0.0 1 {sz:>3} 1.0 {szacc[1]:>4} 2.0 1.0 2 {sz:>3} 1.0 {szacc[2]:>4} 3.0 2.0 3 {sz:>3} 1.0 {szacc[3]:>4} 4.0 3.0 4 {sz:>3} 1.0 {szacc[4]:>4} 5.0 4.0 5 {sz:>3} 1.0 {szacc[5]:>4} 6.0 5.0 6 {sz:>3} 1.0 {szacc[6]:>4} 7.0 6.0 7 {sz:>3} 1.0 {szacc[7]:>4} 8.0 7.0 8 {sz:>3} 1.0 {szacc[8]:>4} 9.0 8.0 9 {sz:>3} 1.0 {szacc[9]:>4} 10.0 9.0 10 {sz:>3} 1.0 {szacc[10]:>4} 11.0 10.0 11 {sz:>3} 1.0 {szacc[11]:>4} 12.0 11.0 12 {sz:>3} 1.0 {szacc[12]:>4} 13.0 12.0 13 {sz:>3} 1.0 {szacc[13]:>4} 14.0 13.0 14 {sz:>3} 1.0 {szacc[14]:>4} 15.0 14.0 15 {sz:>3} 1.0 {szacc[15]:>4} 16.0 15.0 16 {sz:>3} 1.0 {szacc[16]:>4} 17.0 16.0 17 {sz:>3} 1.0 {szacc[17]:>4} 18.0 17.0 18 {sz:>3} 1.0 {szacc[18]:>4} 19.0 18.0 19 {sz:>3} 1.0 {szacc[19]:>4} 20.0 19.0 20 {sz:>3} 1.0 {szacc[20]:>4} 21.0 20.0 21 {sz:>3} 1.0 {szacc[21]:>4} 22.0 21.0 22 {sz:>3} 1.0 {szacc[22]:>4} 23.0 22.0 23 {sz:>3} 1.0 {szacc[23]:>4} 24.0 23.0 24 {sz:>3} 1.0 {szacc[24]:>4} 25.0 24.0 25 {sz:>3} 1.0 {szacc[25]:>4} 26.0 25.0 26 {sz:>3} 1.0 {szacc[26]:>4} 27.0 26.0 27 {sz:>3} 1.0 {szacc[27]:>4} 28.0 27.0 28 {sz:>3} 1.0 {szacc[28]:>4} 29.0 28.0 29 {sz:>3} 1.0 {szacc[29]:>4} 30.0 29.0 30 {sz:>3} 1.0 {szacc[30]:>4} 31.0 30.0 31 {sz:>3} 1.0 {szacc[31]:>4} 32.0 31.0 32 {sz:>3} 1.0 {szacc[32]:>4} 33.0 32.0 33 {sz:>3} 1.0 {szacc[33]:>4} 34.0 33.0 34 {sz:>3} 1.0 {szacc[34]:>4} 35.0 34.0 35 {sz:>3} 1.0 {szacc[35]:>4} 36.0 35.0 36 {sz:>3} 1.0 {szacc[36]:>4} 37.0 36.0 37 {sz:>3} 1.0 {szacc[37]:>4} 38.0 37.0 38 {sz:>3} 1.0 {szacc[38]:>4} 39.0 38.0 39 {sz:>3} 1.0 {szacc[39]:>4} 40.0 39.0 40 {sz:>3} 1.0 {szacc[40]:>4} 41.0 40.0 41 {sz:>3} 1.0 {szacc[41]:>4} 42.0 41.0 42 {sz:>3} 1.0 {szacc[42]:>4} 43.0 42.0 43 {sz:>3} 1.0 {szacc[43]:>4} 44.0 43.0 44 {sz:>3} 1.0 {szacc[44]:>4} 45.0 44.0 45 {sz:>3} 1.0 {szacc[45]:>4} 46.0 45.0 46 {sz:>3} 1.0 {szacc[46]:>4} 47.0 46.0 47 {sz:>3} 1.0 {szacc[47]:>4} 48.0 47.0 48 {sz:>3} 1.0 {szacc[48]:>4} 49.0 48.0 49 {sz:>3} 1.0 {szacc[49]:>4} 50.0 49.0 50 {sz:>3} 1.0 {szacc[50]:>4} 51.0 50.0 51 {sz:>3} 1.0 {szacc[51]:>4} 52.0 51.0 52 {sz:>3} 1.0 {szacc[52]:>4} 53.0 52.0 53 {sz:>3} 1.0 {szacc[53]:>4} 54.0 53.0 54 {sz:>3} 1.0 {szacc[54]:>4} 55.0 54.0 55 {sz:>3} 1.0 {szacc[55]:>4} 56.0 55.0 56 {sz:>3} 1.0 {szacc[56]:>4} 57.0 56.0 57 {sz:>3} 1.0 {szacc[57]:>4} 58.0 57.0 58 {sz:>3} 1.0 {szacc[58]:>4} 59.0 58.0 59 {sz:>3} 1.0 {szacc[59]:>4} 60.0 59.0 60 {sz:>3} 1.0 {szacc[60]:>4} 61.0 60.0 61 {sz:>3} 1.0 {szacc[61]:>4} 62.0 61.0 62 {sz:>3} 1.0 {szacc[62]:>4} 63.0 62.0 63 {sz:>3} 1.0 {szacc[63]:>4} 64.0 63.0 64 {sz:>3} 1.0 {szacc[64]:>4} 65.0 64.0 65 {sz:>3} 1.0 {szacc[65]:>4} 66.0 65.0 66 {sz:>3} 1.0 {szacc[66]:>4} 67.0 66.0 67 {sz:>3} 1.0 {szacc[67]:>4} 68.0 67.0 68 {sz:>3} 1.0 {szacc[68]:>4} 69.0 68.0 69 {sz:>3} 1.0 {szacc[69]:>4} 70.0 69.0 70 {sz:>3} 1.0 {szacc[70]:>4} 71.0 70.0 71 {sz:>3} 1.0 {szacc[71]:>4} 72.0 71.0 72 {sz:>3} 1.0 {szacc[72]:>4} 73.0 72.0 73 {sz:>3} 1.0 {szacc[73]:>4} 74.0 73.0 74 {sz:>3} 1.0 {szacc[74]:>4} 75.0 74.0 75 {sz:>3} 1.0 {szacc[75]:>4} 76.0 75.0 76 {sz:>3} 1.0 {szacc[76]:>4} 77.0 76.0 77 {sz:>3} 1.0 {szacc[77]:>4} 78.0 77.0 78 {sz:>3} 1.0 {szacc[78]:>4} 79.0 78.0 79 {sz:>3} 1.0 {szacc[79]:>4} 80.0 79.0 80 {sz:>3} 1.0 {szacc[80]:>4} 81.0 80.0 81 {sz:>3} 1.0 {szacc[81]:>4} 82.0 81.0 82 {sz:>3} 1.0 {szacc[82]:>4} 83.0 82.0 83 {sz:>3} 1.0 {szacc[83]:>4} 84.0 83.0 84 {sz:>3} 1.0 {szacc[84]:>4} 85.0 84.0 85 {sz:>3} 1.0 {szacc[85]:>4} 86.0 85.0 86 {sz:>3} 1.0 {szacc[86]:>4} 87.0 86.0 87 {sz:>3} 1.0 {szacc[87]:>4} 88.0 87.0 88 {sz:>3} 1.0 {szacc[88]:>4} 89.0 88.0 89 {sz:>3} 1.0 {szacc[89]:>4} 90.0 89.0 90 {sz:>3} 1.0 {szacc[90]:>4} 91.0 90.0 91 {sz:>3} 1.0 {szacc[91]:>4} 92.0 91.0 92 {sz:>3} 1.0 {szacc[92]:>4} 93.0 92.0 93 {sz:>3} 1.0 {szacc[93]:>4} 94.0 93.0 94 {sz:>3} 1.0 {szacc[94]:>4} 95.0 94.0 95 {sz:>3} 1.0 {szacc[95]:>4} 96.0 95.0 96 {sz:>3} 1.0 {szacc[96]:>4} 97.0 96.0 97 {sz:>3} 1.0 {szacc[97]:>4} 98.0 97.0 98 {sz:>3} 1.0 {szacc[98]:>4} 99.0 98.0 99 {sz:>3} 1.0 {szacc[99]:>4} 100.0 99.0 """.format(sz=sz, sztotal=sz*100, szacc=list(itertools.accumulate([sz] * 100)))) def test_2(self): # Slicing ss = [] for i in range(100): for c in 'abc': ss.append(c*i) x = self.iso(*ss).byid def ae(x): lines = str(x).split('\n') datapos = lines[1].index('Representation') s = lines[2:] if s[-1].startswith('<'): s.pop() s = [line[datapos:] for line in s] return s def aeq(x, y): self.aseq(ae(x), ae(y)) for i in range(0, 300, 60): b = x[i:] aeq(b, b.byid) # (B) in Notes Aug 26 2005 self.aseq(x.bysize[2].kind, x.bysize[2].bysize.kind) def test_3(self): # Some indexing cases. # Came up Sep 29 2005. # The kind of the result of indexing is to be # the result of the er of the partition. hp = self.Use x = hp.iso([], [], *list(range(20))).byid eq = [x[-10], x[-10:-9], x[12], x[12:13], x.parts[-10], x.parts[12]] k = x[-10].byid.kind for i in range(len(eq)): self.aseq(eq[i], eq[(i + 1) % len(eq)]) self.aseq(eq[i].kind, eq[(i + 1) % len(eq)].kind) self.aseq(eq[i].kind, k) class MixedCase(support.TestCase): def test_1(self): x = self.iso(1, 2, 1.0, 2.0, '1', '2') if not PORTABLE_TEST: self.aseq(str(x), """\ Partition of a set of 6 objects. Total size = 204 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 2 33 100 49 100 49 str 1 2 33 56 27 156 76 int 2 2 33 48 24 204 100 float""") for row in x.partition.get_rows(): self.assertTrue(row.set <= row.kind) class StatCase(support.TestCase): def test_1(self): hp = self.Use class C: pass c0 = C() class C: pass c1 = C() x = hp.iso(c0, c1) y = hp.iso(c1) d = x.diff(y) self.aseq(d.count, 1) self.aseq(d[0].count, 1) d = y.diff(x) self.aseq(d.count, -1) self.aseq(d[0].count, -1) d = x.diff(hp.iso()) self.aseq(d.count, 2) self.aseq(d[0].count, 2) d = hp.iso().diff(x) self.aseq(d.count, -2) self.aseq(d[0].count, -2) def test_main(debug=0): support.run_unittest(StatCase, debug) support.run_unittest(IdentityCase, debug) support.run_unittest(MixedCase, debug) if __name__ == "__main__": test_main() test_Path.py 0000644 00000071514 15004413005 0007051 0 ustar 00 from guppy.heapy.test import support import inspect import unittest class TestCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.Path = self.heapy.Path def chkrel(self, src, dst, relstr=None, clas=None): rel = self.relation(src, dst) if clas is not None: self.assertTrue(isinstance(rel, clas)) if relstr is None: print(rel) else: sr = str(rel) if sr.startswith('<') and not relstr.startswith('<'): self.assertTrue(sr.endswith('>')) sr = sr[1:-1].split(',') self.assertTrue(relstr in sr) else: self.aseq(sr, relstr) def chkrelattr(self, src, *attrs): for attr in attrs: self.chkrel(src, getattr(src, attr), '%s.'+attr) def chkpath(self, src, dst, expect=None): rel = self.shpaths(dst, src) if expect is None: print(rel) else: li = rel.aslist() if len(li) == 1: li = li[0] self.aseq(str(li), str(expect), -1) def relation(self, src, dst): return self.Path.relation(src, dst) def shpaths(self, dst, src=None, *args, **kwds): # return self.Path.shpaths(dst, src, *args, **kwds) dst = self.iso(dst) if src is not None: src = self.iso(src) return dst.get_shpaths(src, *args, **kwds) class RelationTestCase(TestCase): # Test relations from standard types and some simple paths def test_cell_relation(self): cellvalue = [] def f(): return cellvalue self.chkrel(f.__closure__[0], cellvalue, '%s.cell_contents') def test_code_relation(self): def f(): a = 3 return self, a co = f.__code__ # xxx brittle test but catches a bug self.chkpath(co, 3, '%s.co_consts[1]') # commented in notes Sep 27 2004 relAttr = ('co_code', 'co_consts', 'co_names', 'co_filename', 'co_name') if self.version_info < (3, 11): relAttr += ('co_varnames', 'co_freevars', 'co_cellvars') else: relAttr += ('co_exceptiontable', 'co_qualname') if self.version_info >= (3, 10): relAttr += ('co_linetable',) else: relAttr += ('co_lnotab',) self.chkrelattr(co, *relAttr) def test_dict_relation(self): k1 = 'k1' k2 = 'k2' v1 = 'v1' v2 = 'v2' k3 = tuple(range(100)) v3 = tuple(range(100, 200)) x = {k1: v1, k2: v2, k3: v3} self.chkrel(x, v1, "%s['k1']") self.chkrel(x, v2, "%s['k2']") self.chkrel(x, v3, "%s[(0, 1, 2, 3, 4, 5, ...)]") ks = [str(self.relation(x, k1)), str(self.relation(x, k2)), str(self.relation(x, k3))] ks.sort() self.aseq(ks, ['%s.keys()[0]', '%s.keys()[1]', '%s.keys()[2]']) def test_dictproxy_relation(self): v1 = 'v1' class T(object): k1 = v1 x = T.__dict__ self.chkpath(x, v1, "%s->mapping['k1']") self.chkrel(x, v1, "%s['k1']") def test_frame_relation(self): f = inspect.currentframe() f.f_trace = lambda: None self.chkrelattr(f, 'f_back', 'f_builtins', 'f_code', 'f_globals', 'f_locals', 'f_trace') a = [] # The representation of local variables is how they may be accessed # - not how they are really stored. # xxx this may be confusing/lack information? # The information is available in the relation object class, # it is just not represented with str()... self.chkrel(f, a, "%s.f_locals['a']", clas=self.Path.R_LOCAL_VAR) x = [] z = [] def func(x, y=3): frame = inspect.currentframe() return self, frame, z _, frame, __ = func(0) del _, __ self.chkrel(frame, self, "%s.f_locals ['self']", clas=self.Path.R_CELL) self.chkrel(f, x, "%s.f_locals['x']", clas=self.Path.R_LOCAL_VAR) self.chkrel(f, z, "%s.f_locals ['z']", clas=self.Path.R_CELL) # self becomes both a local var and a cell var, since it is an argument. # FIXME: But not in py3... it seems # self.chkrel(f, self, "<%s.f_locals['self'],%s.f_locals ['self']>") # Stack variables doesn't work (Because ceval.c doesn't update # the f_stacktop index.) so the corresponding part of frame_relate is not tested. def test_function_relation(self): def f(x, y=3): return self f.a = [] self.chkrelattr(f, '__code__', '__globals__', '__defaults__', '__closure__', '__doc__', '__name__', '__dict__', 'a') def test_instancemethod_relation(self): class T: def f(x): pass t = T() self.chkrelattr(t.f, '__func__', '__self__') def test_list_relation(self): v1 = 'v1' v2 = 'v2' v3 = list(range(100, 200)) x = [v1, v2, v3] self.chkrel(x, v1, '%s[0]') self.chkrel(x, v2, '%s[1]') self.chkrel(x, v3, '%s[2]') def test_meth_relation(self): x = [] self.chkrel(x.append, x, '%s.__self__') def test_module_relation(self): self.chkrelattr(unittest, '__dict__', 'TestCase') def test_nodegraph_relation(self): a = 0 b = 1 rl = [a, b] rg = self.heapy.heapyc.NodeGraph([(a, rl), (b, rl)]) self.chkrel(rg, a, '%s->edges[0].src') self.chkrel(rg, b, '%s->edges[1].src') self.chkrel(rg, rl, '<%s->edges[0].tgt,%s->edges[1].tgt>') self.chkpath(rg, a, '%s->edges[0].src') self.chkpath(rg, rl, ['%s->edges[0].tgt', '%s->edges[1].tgt']) def test_nodeset_relation(self): from guppy.sets import immnodeset, mutnodeset x = ['a'] for s in (immnodeset(x), mutnodeset(x)): for i in range(len(x)): self.chkrel(s, x[i], 'list(%%s)[%s]' % i) def test_object_relation(self): class T(object): __slots__ = 'a', 'b' t = T() a = [] t.a = a b = [] t.b = b # self.chkrel(t, T, 'type(%s)') self.chkrel(t, T, '%s->ob_type') self.chkrelattr(t, 'a', 'b') # We shouldn't have a __dict__ here - just make sure this is the case self.assertRaises(AttributeError, lambda: t.__dict__) class U(T): pass u = U() u.a = a self.chkpath(u, T, "%s->ob_type.__base__") self.chkrel(u, a, '%s.a') c = [] u.c = c self.chkrel(u, c, '%s.c') self.chkrel(u, u.__dict__, '%s.__dict__') class V(U): pass v = V() v.c = c self.chkrelattr(v, '__dict__') class W(V): __slots__ = 'c', 'd', 'b' pass w = W() w.a = a w.b = b w.c = c w.d = [] w.e = [] self.chkrelattr(w, '__dict__', 'a', 'b', 'c', 'd', 'e') self.chkpath(w, w.a, '%s.a') self.chkpath(w, w.b, '%s.b') self.chkpath(w, w.c, '%s.c') self.chkpath(w, w.d, '%s.d') self.chkpath(w, w.e, "%s.__dict__['e']") class R(object): rvar = [] class S(R, T): svar = [] s = S() s.a = a s.b = b s.c = c self.chkrelattr(s, '__dict__', 'a', 'b', 'c') self.chkpath(s, s.a, '%s.a') self.chkpath(s, s.b, '%s.b') self.chkpath(s, s.c, "%s.__dict__['c']") # Class variables are not directly related- should they be that? # Possibly, but the compression could as well be done in Python. # We just check that we can get the path. self.chkpath(s, s.svar, "%s->ob_type.__dict__['svar']") self.chkpath(s, s.rvar, ["%s->ob_type.__bases__[0].__dict__['rvar']", "%s->ob_type.__mro__[1].__dict__['rvar']"]) self.chkpath(s, s.__slots__, "%s->ob_type.__base__.__dict__['__slots__']") def test_traceback_relation(self): import sys try: def g(): 1/0 g() except ZeroDivisionError: type, value, traceback = sys.exc_info() self.chkrelattr(traceback, 'tb_next', 'tb_frame') def test_tuple_relation(self): v1 = 'v1' v2 = 'v2' v3 = list(range(100, 200)) x = (v1, v2, v3) self.chkrel(x, v1, '%s[0]') self.chkrel(x, v2, '%s[1]') self.chkrel(x, v3, '%s[2]') def test_type_relation(self): name = 'T' base = object bases = (base,) dict = {'__slots__': ('a', 'b')} T = type(name, bases, dict) # tp_dict can't be directly tested since .__dict__ returns a proxy # and the dict passed is not used directly. # We test it indirectly by getting a path through it. self.chkpath(T, T.a, "%s.__dict__['a']") # The C-struct __slots__ field can't be tested directly # This just tests the ordinary attribute self.chkpath(T, T.__slots__, "%s.__dict__['__slots__']") self.chkrelattr(T, '__mro__', '__base__', '__bases__') # tp_cache and tp_subclasses can also not be tested directly # Inheritance is tested via test_object_relation() class RootTestCase(TestCase): def test_1(self): import sys import builtins root = self.View.root # Interpreter attributes rel = str(self.relation(root, sys.modules)) self.assertTrue(eval(rel % 'root') is sys.modules) self.aseq(rel, '%s.i0_modules') rel = str(self.relation(root, sys.__dict__)) self.assertTrue(eval(rel % 'root') is sys.__dict__) self.aseq(rel, '%s.i0_sysdict') rel = str(self.relation(root, builtins.__dict__)) self.assertTrue(eval(rel % 'root') is builtins.__dict__) self.aseq(rel, '%s.i0_builtins') for name in "codec_search_path", "codec_search_cache", "codec_error_registry": attr = "i0_%s" % name rel = str(self.relation(root, getattr(root, attr))) self.aseq(rel, '%%s.%s' % attr) # Thread attributes try: 1/0 except ZeroDivisionError: exc_type, exc_value, exc_traceback = sys.exc_info() if sys.version_info >= (3, 11): rel = str(self.relation(root, exc_value)) self.asis(eval(rel % 'root'), exc_value) else: for name in 'exc_type', 'exc_value', 'exc_traceback': rel = str(self.relation(root, eval(name))) self.asis(eval(rel % 'root'), eval(name)) # There are more, untested, attributes, but the code is farily regular... # More complication is to do with frames which I concentrate on for now. # We need to find out what level we are at - count to lowest frame level = 0 frame = exc_traceback.tb_frame while frame.f_back: frame = frame.f_back level += 1 rel = str(self.relation(root, frame)) self.assertTrue(rel.endswith('_f0')) rel = str(self.relation(root, exc_traceback.tb_frame)) self.asis(eval(rel % 'root'), exc_traceback.tb_frame) self.assertTrue(rel.endswith('_f%d' % level)) def test_thread(self): try: import _thread except ImportError: print('threading not enabled - skipping test') return root = self.View.root def task(self): import sys try: 1/0 except ZeroDivisionError: exc_type, exc_value, exc_traceback = sys.exc_info() self.exc_value = exc_value self.sync = 1 while self.sync: pass self.sync = 1 self.sync = 0 _thread.start_new_thread(task, (self,)) while not self.sync: pass exc_value = self.exc_value rel = str(self.relation(root, exc_value)) self.asis(eval(rel % 'root'), exc_value) self.sync = 0 while not self.sync: pass def task(self): self.test_1() self.sync = 1 self.sync = 0 _thread.start_new_thread(task, (self,)) while not self.sync: pass def test_secondary_interpreter(self): import sys if sys.version_info >= (3, 9): print('multi-interpreter not supported past Python 3.9') return try: import _thread except ImportError: print('threading not enabled - skipping test') return import_remote = """\ import sys import _thread import time def task(): time.sleep(1) self.sysdict = sys.__dict__ self.sync = 1 while self.sync: pass _thread.start_new_thread(task, ()) """ self.sync = 0 thid = self.heapy.heapyc.interpreter(import_remote, {'self': self}) root = self.View.root import sys sysdict = sys.__dict__ rel = str(self.relation(root, sysdict)) self.aseq(rel, '%s.i0_sysdict') while not self.sync: pass rel = str(self.relation(root, self.sysdict)) self.aseq(rel, '%s.i1_sysdict') self.sync = 0 class PathTestCase(TestCase): def makegraph(self, width, length): # Generate a structure which will yield a high number # of shortest paths. # Returns a pair src, dst which are connected via a noncyclic graph # with many edges. # The length of each path (all shortest), number of edges will be length # The number of nodes will be 2 + width * (length - 1) # The number of paths will be # width ** length, if width >= 1 and length >= 1 dst = [] ls = [] for i in range(width): ls.append([dst]) ls = [dst] * width for i in range(length-1): xs = [] for j in range(width): ys = [] xs.append(ys) for k in range(width): ys.append(ls[k]) ls = xs src = ls return src, dst def chkgraph(self, width, length, expect=None): src, dst = self.makegraph(width, length) self.chkpath(src, dst, expect) def test_path(self): dst = 'dst' self.chkpath([dst], dst, '%s[0]') self.chkpath([[], dst], dst, '%s[1]') self.chkpath([dst, dst], dst, "['%s[0]', '%s[1]']") self.chkpath([[dst, 0], dst, [dst, 2]], dst, "%s[1]") self.chkpath([[dst, 0], [dst, 2]], dst, "['%s[0][0]', '%s[1][0]']") src, dst = self.makegraph(1, 1) self.chkgraph(1, 1, '%s[0]') self.chkgraph(1, 2, '%s[0][0]') self.chkgraph(2, 1, ['%s[0]', '%s[1]']) self.chkgraph(3, 2, ['%s[0][0]', '%s[0][1]', '%s[0][2]', '%s[1][0]', '%s[1][1]', '%s[1][2]', '%s[2][0]', '%s[2][1]', '%s[2][2]']) def test_numpaths(self): for (width, length) in [(2, 1), (7, 3), (3, 7), (10, 20)]: src, dst = self.makegraph(width, length) p = self.shpaths(dst, src) self.aseq(p.numpaths, width**length) def test_iter(self): src, dst = self.makegraph(2, 2) p = self.shpaths(dst, src) it = iter(p) ss = [] for i in it: ss.append(str(i)) ss.sort() self.aseq(ss, ['%s[0][0]', '%s[0][1]', '%s[1][0]', '%s[1][1]']) # Check that we can get some of the first values from the iterator # of a graph with an astronomical number of paths. width = 11 length = 13 numpaths = 20 src, dst = self.makegraph(width, length) p = self.shpaths(dst, src) it = iter(p) for i in range(numpaths): path = next(it) sp = str(path) div, mod = divmod(i, width) self.aseq(sp, '%s'+'[0]'*(length-2)+'[%d][%d]' % (div, mod)) # Check that the iterator works even if the graph initially # would yield astronomical numbers of dead ends. # (The initial algorithm took astronomically long time.) osrc = src src, dst = self.makegraph(width, length) src[0] = osrc p = self.shpaths(dst, src) it = iter(p) for i in range(numpaths): path = next(it) sp = str(path) div, mod = divmod(i, width) self.aseq(sp, '%s[1]'+'[0]'*(length-3)+'[%d][%d]' % (div, mod)) # Test iterating with a negative start and a large positive start numfromend = width / 2 for it in [p.iter(-numfromend), p.iter(p.numpaths-numfromend)]: for i, path in enumerate(it): sp = str(path) self.aseq(sp, '%s'+('[%d]' % (width-1)) * (length-1)+'[%d]' % (width-numfromend+i)) # Test iterating with start and stop start = 5 stop = 25 i = start for path in p.iter(start, stop): sp = str(path) div, mod = divmod(i, width) self.aseq(sp, '%s[1]'+'[0]'*(length-3)+'[%d][%d]' % (div, mod)) self.aseq(path.index, i) i += 1 self.aseq(i, stop) def test_str(self): # Make sure large number of paths will yield reasonable representations width = 11 length = 4 src, dst = self.makegraph(width, length) p = self.shpaths(dst, src) p.maxpaths = 1 self.aseq(str(p), " 0: Src[0][0][0][0]\n<... 14640 more paths ...>") p.maxpaths = 2 self.aseq( str(p), " 0: Src[0][0][0][0]\n 1: Src[0][0][0][1]\n<... 14639 more paths ...>") def test_printing(self): # Test the pretty-printing and moreing methods from io import StringIO output = StringIO() self.Path.output = output width = 11 length = 4 src, dst = self.makegraph(width, length) p = self.shpaths(dst, src) p.maxpaths = 2 self.aseq(str(p), """\ 0: Src[0][0][0][0] 1: Src[0][0][0][1] <... 14639 more paths ...>""") self.aseq(str(p.more), """\ 2: Src[0][0][0][2] 3: Src[0][0][0][3] <... 14637 more paths ...>""") def test_subscript(self): # Test subscripting width = 3 length = 40 src, dst = self.makegraph(width, length) p = self.shpaths(dst, src) np = width**length self.aseq(np, p.numpaths) # p[0].pp(p.output) self.aseq(str(p[0]), '%s'+'[0]'*length) self.aseq(str(p[-np]), '%s'+'[0]'*length) self.aseq(str(p[width-1]), '%s'+'[0]'*(length-1) + '[%d]' % (width-1)) self.aseq(str(p[width]), '%s'+'[0]'*(length-2) + '[1][0]') self.aseq(str(p[width+1]), '%s'+'[0]'*(length-2) + '[1][1]') self.aseq(str(p[np-1]), '%s'+('[%d]' % (width-1))*length) self.aseq(str(p[-1]), '%s'+('[%d]' % (width-1))*length) self.assertRaises(IndexError, lambda: p[np]) self.assertRaises(IndexError, lambda: p[-np-1]) class MultiTestCase(TestCase): def test_pp(self): # Test printing of multi relations iso = self.iso dst = [[], []] src = iso(dst[:]*2) dst = [iso(x) for x in dst] p = self.Path.shpgraph(dst, src) self.aseq(str(p), """\ --- Dst[0] --- 0: Src[0] 1: Src[2] --- Dst[1] --- 0: Src[1] 1: Src[3]""") p = self.Path.shpgraph(dst, src, srcname='A', dstname='B') self.aseq(str(p), """\ --- B[0] --- 0: A[0] 1: A[2] --- B[1] --- 0: A[1] 1: A[3]""") class AvoidTestCase(TestCase): def test_1(self): # Test that we can find new paths by avoiding edges # selected from previously found paths. # First we generate a graph with paths of various lengths... src = ['src'] a = src for i in range(3): b = ['b%d' % i] c = ['c%d' % i, b] a.append(b) a.append(c) a = b dst = a p = self.shpaths(dst, src) for avoid, result in [ ([], '%s[1][1][1]'), ([0], '%s[2][1][1][1]'), ([1], '%s[1][2][1][1]'), ([2], '%s[1][1][2][1]'), ([0, 1], '%s[2][1][2][1][1]'), ([1, 2], '%s[1][2][1][2][1]'), # ([1, -1], '%s[1][2][1][2][1]'), ([0, 2], '%s[2][1][1][2][1]'), ([0, 1, 2], '%s[2][1][2][1][2][1]'), ([2, 1, 0], '%s[2][1][2][1][2][1]'), ]: result = result % ' 0: Src' # Find new path by avoiding edges from the original path q = self.shpaths(dst, src, avoid_edges=p.edges_at(*avoid)) self.aseq(str(q), result) # Find the same path but via a direct method q = p.copy_but_avoid_edges_at_levels(*avoid) self.aseq(str(q), result) # The same, but via a shorter method name q = p.avoided(*avoid) self.aseq(str(q), result) # Test that the avoided set is carried on to copies q = p.avoided(0).avoided(2) self.aseq(str(q), ' 0: Src[2][1][2][1][1]') class NewTestCase(TestCase): def test_1(self): import sys o = self.python.io.StringIO() iso = self.iso x = iso(sys.__dict__) print(x.shpaths, file=o) # This used to include a path via parameter avoid_edges # which was confusing print(x.shpaths.avoided(0), file=o) # repr() used to be quite useless. I have it now defined as .pp(), # but without trailin newline. print(repr(x.shpaths), file=o) print(repr(x.shpaths), file=o) # The shpaths object could sometimes disturb a shpath calculation # because dst was free in it. x = [] y = [[[x]]] sp = iso(x).get_shpaths(iso(y)) print(sp, file=o) y.append(sp) print(iso(x).get_shpaths(iso(y)), file=o) # Test that the shortest paths to a set of objects, is the shortest # paths to those that can be reached by the shortest paths, only x = [] y = [x] z = [y] print(iso(x, y).get_shpaths(iso(z)), file=o) # Test that we can relate objects that inherits from a class and object # (Used to segfault) class C: pass class O(C, object): __slots__ = 'x', ob = O() ob.x = x print(iso(x).get_shpaths(iso(ob)), file=o) # Test that generalization to a set of sources makes some sense # The shortest paths are from the closest sources # Hack to make a constant address rendering, for test comparison. # This doesn't change anything permanently. # XXX come up with an official way to do this. summary_str = self.heapy.UniSet.summary_str def str_address(x): return '<address>' str_address._idpart_header = getattr( summary_str.str_address, '_idpart_header', None) str_address._idpart_sortrender = getattr( summary_str.str_address, '_idpart_sortrender', None) summary_str.str_address = str_address S = iso() shp = iso(x).get_shpaths(iso(y, z)) print(shp, file=o) print(repr(shp), file=o) for p in shp: S = S ^ p.src self.aseq(S, iso(y)) shp = iso(x).get_shpaths(iso(ob, y, z)) print(str(shp), file=o) print(repr(shp), file=o) S = iso() for i, p in enumerate(shp): S = S ^ p.src self.aseq(p.src, shp[i].src) self.aseq(S, iso(ob, y)) # Test that the iter can be restarted # even after multiple sources handling was added it = iter(shp) a = list(it) it.isatend = 0 b = list(it) self.aseq(str(a), str(b)) # The sort order is based on the source set's byid partition (see # Path.PathsIter.reset), which sorts based on the size, then render # (see Part.IdentityPartition.__init__) if sys.getsizeof(y) > sys.getsizeof(ob): self.aseq(o.getvalue(), """\ 0: hpy().Root.i0_sysdict 0: Src.i0_modules['sys'].__dict__ 0: hpy().Root.i0_sysdict 0: hpy().Root.i0_sysdict 0: Src[0][0][0] 0: Src[0][0][0] 0: Src[0] 0: Src.x 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 1: <1 __main__.O: <address>>.x 0: <1 list: <address>*1>[0] 1: <1 __main__.O: <address>>.x """.replace('__main__', self.__module__)) else: self.aseq(o.getvalue(), """\ 0: hpy().Root.i0_sysdict 0: Src.i0_modules['sys'].__dict__ 0: hpy().Root.i0_sysdict 0: hpy().Root.i0_sysdict 0: Src[0][0][0] 0: Src[0][0][0] 0: Src[0] 0: Src.x 0: <1 list: <address>*1>[0] 0: <1 list: <address>*1>[0] 0: <1 __main__.O: <address>>.x 1: <1 list: <address>*1>[0] 0: <1 __main__.O: <address>>.x 1: <1 list: <address>*1>[0] """.replace('__main__', self.__module__)) def test_2(self): # To assist interactivity, # the more attribute is defined to return an object which # the repr() of gives more lines; and has a similar more attribute. # Testing this functionality here. o = self.python.io.StringIO() iso = self.iso dst = [] src = [dst]*20 print(repr(iso(dst).get_shpaths(iso(src))), file=o) print(repr(iso(dst).get_shpaths(iso(src)).more), file=o) p = iso(dst).get_shpaths(iso(src)) print(repr(p.more), file=o) self.aseq(o.getvalue(), """\ 0: Src[0] 1: Src[1] 2: Src[2] 3: Src[3] 4: Src[4] 5: Src[5] 6: Src[6] 7: Src[7] 8: Src[8] 9: Src[9] <... 10 more paths ...> 10: Src[10] 11: Src[11] 12: Src[12] 13: Src[13] 14: Src[14] 15: Src[15] 16: Src[16] 17: Src[17] 18: Src[18] 19: Src[19] 10: Src[10] 11: Src[11] 12: Src[12] 13: Src[13] 14: Src[14] 15: Src[15] 16: Src[16] 17: Src[17] 18: Src[18] 19: Src[19] """) def test_empty(self): # Test empty paths iso = self.iso dst = [] self.assertTrue(len(list(iso(dst).get_shpaths(iso()))) == 0) def test_3(self): # Test that Edges is not included in the shortest path iso = self.iso dst = [] shp = iso(dst).shpaths del dst self.assertTrue('Edges' not in str(shp.avoided(0))) dst = [] src = [dst] shp = iso(dst).get_shpaths(iso(src)) src[0] = shp dst = iso(dst) src = iso(src) self.assertTrue(dst.get_shpaths(src).numpaths == 0) # Test the sets attribute dst = [] src = [dst] dst = iso(dst) src = iso(src) self.aseq(dst.get_shpaths(src).sets, (src, dst)) # Test that srs doesn't disturb the path calculation class C: pass c = C() cd = iso(c.__dict__) p = cd.shpaths repr(p) del c q = cd.shpaths self.aseq(repr(q).strip(), "") del p, q # Test that internals of ShortestPath are hidden in general # (via hiding_tag), to consistent result when used interactively, # as commented on in notes.txt per Nov 30 2004. dst = [] src = [[[[dst]]]] d = iso(dst) s = iso(src) p = d.get_shpaths(s) self.aseq(str(p), " 0: Src[0][0][0][0]") src.append(p) p._XX_ = dst # A shorter path, but it should be hidden self.aseq(str(d.get_shpaths(s)), " 0: Src[0][0][0][0]") # Test what .more prints finally self.aseq(str(p.more), '<No more paths>') # Test that .top is idempotent self.asis(p.more.top.top, p) def test_4(self): # Test that if one extra path will be printed if there are # exactly 11 paths iso = self.iso o = self.python.io.StringIO() dst = [] src = [dst] * 11 shp = iso(dst).get_shpaths(iso(src)) print(str(shp), file=o) self.aseq(o.getvalue(), """\ 0: Src[0] 1: Src[1] 2: Src[2] 3: Src[3] 4: Src[4] 5: Src[5] 6: Src[6] 7: Src[7] 8: Src[8] 9: Src[9] 10: Src[10] """) def test_comparison(self): # Test that non-compariable keys won't crash # output order may be arbitrary not the output is not tested iso = self.iso dst = [] shp = iso(dst).get_shpaths(iso({0: dst, '': dst})) str(shp) shp = iso(dst).get_shpaths(iso({object(): dst, object(): dst})) str(shp) def run_test(case, debug=0): support.run_unittest(case, debug) def test_main(debug=0): run_test(NewTestCase, debug) run_test(RelationTestCase, debug) run_test(RootTestCase, debug) run_test(PathTestCase, debug) run_test(MultiTestCase, debug) run_test(AvoidTestCase, debug) if __name__ == "__main__": test_main() test_RefPat.py 0000644 00000041404 15004413005 0007331 0 ustar 00 from guppy.heapy.test import support import io import sys import types import unittest class TestCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.RefPat = self.heapy.RefPat self.iso = self.Use.iso def makegraph(self, width, length): # Generate a structure which will yield a high number # of shortest paths. # Returns a pair src, dst which are connected via a noncyclic graph # with many edges. # The length of each path (all shortest), number of edges will be length # The number of nodes will be 2 + width * (length - 1) # The number of paths will be # width ** length, if width >= 1 and length >= 1 dst = [] ls = [] for i in range(width): ls.append([dst]) ls = [dst] * width for i in range(length-1): xs = [] for j in range(width): ys = [] xs.append(ys) for k in range(width): ys.append(ls[k]) ls = xs src = ls return src, dst def rp(self, dst, src, **kwds): iso = self.iso if src is not None: src = iso(src) rp = iso(dst).get_rp(src=src, **kwds) rp.mod.UniSet.summary_str.str_address = lambda a: '<address>' return rp class RefPatCase(TestCase): def test_basic_methods(self): # Test basic methods: iteration, indexing, length, tree addressing via attribute access # Test iteration dst = src = [] lists = [dst] for i in range(5): src = [src] lists.append(src) rp = self.rp(dst, src, depth=10) for i, x in enumerate(rp): if i < len(lists): self.asis(lists[i], x.theone) # Test indexing # First case, when already iterated over self.asis(rp[0].theone, lists[0]) self.asis(rp[-2].theone, lists[-1]) # Second case, when not iterated over before rp = self.rp(dst, src, depth=10) self.asis(rp[0].theone, lists[0]) self.asis(rp[-2].theone, lists[-1]) # Test length self.aseq(len(rp), len(lists) + 1) rp = self.rp(dst, src, depth=10) self.aseq(len(rp), len(lists) + 1) # Test attribute access self.asis(rp._.theone, lists[0]) self.asis(rp.a.theone, lists[1]) # Test attribute access, when not iterated over before rp = self.rp(dst, src, depth=10) self.asis(rp.a2.theone, lists[2]) self.asis(rp.a.theone, lists[1]) # Make sure attribute access is cached: # so it doesn't change when struct is changed lists[2].append(lists[0]) rp.View.clear_retainers() rp.View.update_referrers(self.iso(lists[0])) self.asis(rp.a.theone, lists[1]) # Test with recursive structure dst = [] dst.append(dst) src = [dst] rp = self.rp(dst, src) self.asis(rp._.theone, dst) self.aseq(rp.a, self.iso(dst, src)) self.aseq(rp.a, rp.a2) self.aseq(rp.a, rp[1]) def test_presentation(self): output = io.StringIO() src = [] def write(x): print(x, file=output) R = self.RefPat def test_pp(dst, src, result=None, **kwds): rp = self.rp(dst, src, **kwds) write(repr(rp)) return rp dst = [] src.append(dst) test_pp(dst, src) for i in range(5): x = dst dst = [] x.append(dst) test_pp(dst, src) src, dst = self.makegraph(5, 7) test_pp(dst, src, depth=10) # Test that pp() prints limited number of lines src, dst = self.makegraph(5, 17) rp = test_pp(dst, src, depth=17) write(repr(rp.more)) # Test more of more src, dst = self.makegraph(1, 30) rp = test_pp(dst, src, depth=35) m = rp.more write(repr(m)) write(repr(m.more)) m1 = m.more write(repr(m1)) m2 = m.more write(repr(m2.more)) write(str(m1.more)) # Test also that str() is the same as repr() # Test that we get back to start by .top write(m1.top) # Test that we get back to previous by .prev write(m1.prev) # Test that they won't say '...more lines...' if the # of lines is what is printed src, dst = self.makegraph(1, 30) rp = test_pp(dst, src, depth=10) # Test how no more lines is printed write(rp.more) write(rp.more.more) # Test that one more line is printed rather than '1 more line' src, dst = self.makegraph(1, 30) rp = test_pp(dst, src, depth=21) write(rp.more) # Test that we can do more without first printing rp = self.rp(dst, src, depth=20) write(rp.more) self.aseq(output.getvalue(), """\ Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 2: aa ---- [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 3: a3 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 4: a4 ------ [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 5: a5 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 6: a6 -------- [-] 5 list: <address>*5, <address>*5, <address>*5... 7: a7 [-] 1 list: <address>*5 8: a8 ---------- [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 2: aa ---- [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 3: a3 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 4: a4 ------ [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 5: a5 [-] 5 list: <address>*5, <address>*5, <address>*5, <address>*5... 6: a6 -------- [-] 5 list: <address>*5, <address>*5, <address>*5... 7: a7 [-] 5 list: <address>*5, <address>*5, <address>*5... 8: a8 ---------- [-] 5 list: <address>*5, <address>*5, <address>*5... 9: a9 [-] 5 list: <address>*5, <address>*5, <address>*5... <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 5 list: <address>*5, <address>*5, <address>*5... 11: a11 [-] 5 list: <address>*5, <address>*5, <address>*5... 12: a12 ------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 13: a13 [-] 5 list: <address>*5, <address>*5, <address>*5... 14: a14 --------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 15: a15 [-] 5 list: <address>*5, <address>*5, <address>*5... 16: a16 ----------------- [-] 5 list: <address>*5, <address>*5, <address>*5... 17: a17 [+] 1 list: <address>*5 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 20: a20 --------------------- [-] 1 list: <address>*1 21: a21 [-] 1 list: <address>*1 22: a22 ----------------------- [-] 1 list: <address>*1 23: a23 [-] 1 list: <address>*1 24: a24 ------------------------- [-] 1 list: <address>*1 25: a25 [-] 1 list: <address>*1 26: a26 --------------------------- [-] 1 list: <address>*1 27: a27 [-] 1 list: <address>*1 28: a28 ----------------------------- [-] 1 list: <address>*1 29: a29 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 20: a20 --------------------- [-] 1 list: <address>*1 21: a21 [-] 1 list: <address>*1 22: a22 ----------------------- [-] 1 list: <address>*1 23: a23 [-] 1 list: <address>*1 24: a24 ------------------------- [-] 1 list: <address>*1 25: a25 [-] 1 list: <address>*1 26: a26 --------------------------- [-] 1 list: <address>*1 27: a27 [-] 1 list: <address>*1 28: a28 ----------------------------- [-] 1 list: <address>*1 29: a29 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 30: a30 ------------------------------- [-] 1 list: <address>*1 31: a31 [R] 1 tuple: <address>*1 30: a30 ------------------------------- [-] 1 list: <address>*1 31: a31 [R] 1 tuple: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <22 more lines. Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <12 more lines. Type e.g. '_.more' for more.> Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 10: a10 ----------- [+] 1 list: <address>*1 Reference Pattern by <[dict of] class>. 0: _ --- [-] 1 list: <address>*0 1: a [-] 1 list: <address>*1 2: aa ---- [-] 1 list: <address>*1 3: a3 [-] 1 list: <address>*1 4: a4 ------ [-] 1 list: <address>*1 5: a5 [-] 1 list: <address>*1 6: a6 -------- [-] 1 list: <address>*1 7: a7 [-] 1 list: <address>*1 8: a8 ---------- [-] 1 list: <address>*1 9: a9 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 <Type e.g. '_.more' for more.> 10: a10 ----------- [-] 1 list: <address>*1 11: a11 [-] 1 list: <address>*1 12: a12 ------------- [-] 1 list: <address>*1 13: a13 [-] 1 list: <address>*1 14: a14 --------------- [-] 1 list: <address>*1 15: a15 [-] 1 list: <address>*1 16: a16 ----------------- [-] 1 list: <address>*1 17: a17 [-] 1 list: <address>*1 18: a18 ------------------- [-] 1 list: <address>*1 19: a19 [-] 1 list: <address>*1 20: a20 --------------------- [+] 1 list: <address>*1 """) def test_referrer_registration(self): import gc # The reference pattern should register itself as referrer target # so that after a gc, the rp target will still be included in the referrer target # Since the target is passed to referrers and update, it will still find the # referrers. It is an optimization issue: it should cover the referrers. # We test this by having two different-typed referrers # Accessing a referrer of the first one, then gc collecting, then checking that # the second one can be accessed without update: it was created automatically. # The test failed when not registering, but succeeded when registering was added. # It succeeds any case if no GC collection is made. dst = [] a = [dst] aa = [a] b = (dst,) ba = [b] src = [aa, ba] rp = self.rp(dst, src) self.asis(rp._.theone, dst) gc.collect() self.asis(rp.aa.theone, aa) self.asis(rp.View.rg[b][0], ba) def test_some_more_advanced_usages(self): import gc # Test immediate dominators dst = [] src = [dst] src.append([dst]) rp = self.rp(dst, src, depth=10, imdom=1) self.asis(rp._.theone, dst) self.asis(rp.a.theone, src) # Test with mixed types # In particular, dict owned by an instance dst = [] class A: pass a = A() a.dst = dst b = {'dst': dst} src = (a, b) gc.collect() rp = self.rp(dst, src, depth=10) rp.mod.View._is_clear_drg_enabled = 0 # Note Apr 19 2005 if sys.getsizeof(b) > sys.getsizeof(a.__dict__): self.asis(rp.a.theone, b) self.asis(rp.b.theone, a.__dict__) else: self.asis(rp.a.theone, a.__dict__) self.asis(rp.b.theone, b) # Test that the dict is eventually automatically removed from dictowners - # First test that dictowners is nonzero ln = len(rp.mod.View.dict_ownership) self.assertTrue(ln > 0) del src del a mod = rp.mod rp.mod.View._is_clear_drg_enabled = 1 del rp # It is cleared after GC gc.collect() lnnow = len(mod.View.dict_ownership) self.assertTrue(lnnow == 0) class NewCase(TestCase): # Some new tests as they come up def test_reset(self): # Test the .reset() method dst = [] a = [dst] b = [dst] src = [a, b] rp = self.rp(dst, src) self.aseq(rp.a, self.iso(a, b)) b.pop() rp.reset() self.aseq(rp.a, self.iso(a)) def test_paths(self): # Test the .paths() method dst = [] a = [dst]+[None]*40 # Make order well-defined. Note May 2 2005. b = [dst] src = [a, b] rp = self.rp(dst, src) expected = """\ Paths from source 'a3' to target '_'. 0: a3 [0] @ [0] 1: aa [0] @ [0] 2: a [0] @ [0] 3: _ [0] = <1 list: <address>*0> 4: aa [0] @ [1] 5: a [1] @ [0] -> #3""" self.aseq(str(rp.paths('a3')), expected) expected = expected[:expected.index('\n 4:')] # Test the andsets argument, given as a dict self.aseq(str(rp.paths('a3', andsets={'a': self.iso(a)})), expected) # Test the andsets argument, given as a list self.aseq( str(rp.paths('a3', andsets=[None, None, self.iso(a)])), expected) def test_main(debug=0): support.run_unittest(RefPatCase, debug) support.run_unittest(NewCase, debug) def test_leak(): # Runs the tests in a loop and prints memory statistics, # to see if there are underlying low-level memory problems. # Requires Python to be compiled with debug support. from guppy.heapy.heapyc import xmemstats import gc import sys import time i = 0 xmemstats() while 1: print('[%d]' % i, time.asctime()) i += 1 test_main() gc.collect() xmemstats() if __name__ == "__main__": test_main() test_RetaGraph.py 0000644 00000000137 15004413005 0010023 0 ustar 00 from guppy.heapy.test import test_support import sys import unittest from pprint import pprint test_Spec.py 0000644 00000000537 15004413005 0007044 0 ustar 00 from guppy.heapy.test import support import sys import unittest class TestCase(support.TestCase): pass class FirstCase(TestCase): def test_1(self): Spec = self.heapy.Spec TestEnv = Spec.mkTestEnv(Spec._Specification_) TestEnv.test_contains(Spec) if __name__ == "__main__": support.run_unittest(FirstCase, 1) test_UniSet.py 0000644 00000002331 15004413005 0007353 0 ustar 00 from guppy.heapy.test import support class FirstCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) def test_1(self): asrt = self.assertTrue a = [] b = [] c = self.iso(a, b) asrt(len(c.nodes) == 2) asrt(a in c) asrt(b in c) asrt([] not in c) asrt(c not in c) d = self.idset(c.nodes) asrt(c.nodes == d.nodes) asrt(c == d) def test_2(self): # Test standard set operations H = self.idset e1 = [] e2 = {} e3 = () la = [], [e1], [e1, e2], [e1, e2, e3], [e2], [e2, e3], [e3] self.guppy.sets.test.test_set_operations( [H(x) for x in la], [H(x) for x in la], [H(x) for x in la]) def test_3(self): # Test out-reaching iso = self.iso a = [] b = [a] c = [b] self.View.root = c x = iso(b) self.assertTrue(x.referrers == iso(c)) self.aseq(x.referents, iso(a)) self.aseq(x.referents.referrers, x) self.aseq(x.dominos, iso(a, b)) def test_main(debug=False): support.run_unittest(FirstCase, debug) if __name__ == "__main__": test_main() test_View.py 0000644 00000017764 15004413005 0007076 0 ustar 00 from guppy.heapy.test import support class TestCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.types = self.heapy.UniSet.types class FirstCase(TestCase): def test_cal_hiding(self): V = self.View iso = self.iso # Tests that our workspace nodesets are hidden. a = [] b = [] as_ = iso(a) bs = iso(b) ab = as_ | bs # Make sure hiding is carried on with set operations self.assertTrue(ab.referrers.kind == self.types.FrameType) self.assertTrue((as_ | bs).referrers.kind == self.types.FrameType) self.assertTrue(V.referrers(iso(a)).kind == self.types.FrameType) self.assertTrue(V.referrers(iso(b)).kind == self.types.FrameType) # Test that we can still see nodesets created with other hiding_tag c = [] chold = self.guppy.sets.immnodeset( [c], hiding_tag=[] # Make sure we see it whether or not View uses default or not ) cs = iso(c) del c self.assertTrue(cs.referrers.kind == type( self.guppy.sets.immnodeset())) h = self.View.heap() self.aseq(h & self.iso(self.Use), self.Use.Nothing) self.aseq(h & self.iso(self.Use.__dict__), self.Use.Nothing) def test_dominos(self): # Test dominos and domisize iso = self.iso x = [] y = [x, []] z = [y] self.aseq(iso(y).dominos, iso(y, y[1])) self.aseq(iso(y).domisize, iso(y, y[1]).indisize) self.aseq(iso(z).dominos, iso(z)) del y self.aseq(iso(z).dominos, iso(z, z[0], z[0][1])) def test_exports(self): # Test a few exports; the other defined in _unp_exports use the same mechanism iso = self.iso x = [] y = [x, []] z = [y] p = iso(z).referents.indisize self.aseq(p, iso(y).indisize) def test_horizon(self): iso = self.iso h = self.View.horizon() x = [] hn = h.news() self.aseq(hn, iso(x)) del hn hn = h.news() self.aseq(hn, iso(x)) del x, hn hn = h.news() self.aseq(hn, iso()) def test_imdom(self): iso = self.iso x = [] y = [x, []] z = [x, y] del x, y self.aseq(iso(z[0]).imdom, iso(z)) def test_referents(self): iso = self.iso x = [] y = [x, []] z = [y] self.aseq(iso(x).referents, iso()) self.aseq(iso(y).referents, iso(x, y[1])) self.aseq(iso(z).referents, iso(y)) self.aseq(iso(y, z).referents, iso(x, y, y[1])) def test_root(self): old_root = self.View.root self.assertIs(self.View.root, old_root) self.assertIs(self.Use.View.root, old_root) self.assertIs(self.View.hv.root, old_root) obj = object() self.View.root = obj self.assertIs(self.View.root, obj) self.assertIs(self.Use.View.root, obj) self.assertIs(self.View.hv.root, obj) self.View.root = old_root self.assertIs(self.View.root, old_root) self.assertIs(self.Use.View.root, old_root) self.assertIs(self.View.hv.root, old_root) class GCCase(TestCase): def test_gc_mechanism(self): # Test the underlying GC system for having the properties that # support the method of automatic reclamation of nodegraphs # that is relied on in other tests. Failure here, dependent on # changed GC behaviour, would explain the other failures. from weakref import ref import gc class C: pass c = C() cbs = [] def cb(wr): cbs.append(wr) wr = ref(c, cb) c.x = c gc.collect() strc = str(c) self.aseq(str(wr()), strc) self.asis(wr(), c) c = None self.aseq(str(wr()), strc) self.aseq(cbs, []) gc.collect() self.asis(wr(), None) self.aseq(cbs, [wr]) def test_gc_hook(self): # Test the GC hook as implemented in View hos = [] def ho(): hos.append(1) import gc gc.collect() hook = self.heapy.View.gchook(ho) self.aseq(hos, []) gc.collect() self.aseq(hos, [1]) hook = None gc.collect() self.aseq(hos, [1]) def test_gc_drg(self): # Test automatic reclamation issues for dict owner nodegraph # This mechanism changed so the old test here is # not valid anymore # FIXME MAKE NEW TEST return import gc View = self.View hv = View.hv drg = View.nodegraph() def clear_drg(): if drg.is_sorted: drg.clear() else: pass _clear_drg_hook = View.gchook(clear_drg) hv.update_dictowners(drg) gc.collect() lendrg = len(drg) self.assertTrue(lendrg > 0) # Before any use, it will not be cleared # Now it is used by taking its length gc.collect() self.aseq(len(drg), 0) byclodo = hv.cli_clodo(drg, {}) class C: pass c = C() byclodo.partition([c.__dict__]) self.assertTrue(len(drg) > 0) gc.collect() self.assertTrue(len(drg) == 0) def test_gc_rg(self): # Test automatic reclamation issues for referrer nodegraph iso = self.iso immnodeset = self.guppy.sets.immnodeset self.View.is_rg_update_all = False import gc gc.collect() dst = [] gc.collect() self.assertTrue(len(self.View.rg) == 0) # Test that rg is automatically updated with the set target(s) a = [dst] b = [dst] c = [a, b] class T: def __init__(self, set): self.set = set ta = T(iso(a)) self.View.referrers_add_target(ta) tb = T(iso(b)) self.View.referrers_add_target(tb) self.View.referrers(iso(c)) self.assertTrue(c in immnodeset(self.View.rg[a])) self.assertTrue(c in immnodeset(self.View.rg[b])) # Test that a referrers target is automatically collected when not referenced tb = None gc.collect() self.View.referrers(iso(c)) self.assertTrue(c in immnodeset(self.View.rg[a])) self.assertTrue(c not in immnodeset(self.View.rg[b])) # Test that adding a source automatically updates rg # even though domain of rg already includes its target # This requires gc collection d = [c] self.assertTrue(d not in self.View.referrers(iso(c))) gc.collect() self.assertTrue(d in self.View.referrers(iso(c))) class AltHeapCase(TestCase): # Tests for support of alternative heap as implemented around 27 Oct 2005 # and discussed in Notes at that time. def test_observation_containers(self): # Test the View.observation_containers method iso = self.iso idset = self.idset # These are to be included a = iso([], {}) b = self.ImpSet.mutnodeset() c = self.View.observation_list() # These are not to be included - have another hiding tag excla = self.guppy.sets.mutnodeset() exclb = self.guppy.sets.immnodeset() # Get possible containers oc = idset(self.View.observation_containers()) self.assertTrue(iso(a.nodes, b, c) <= oc) self.assertTrue(not (iso(excla, exclb) & oc)) class SpecialTypesCase(TestCase): # Some tests for special types def test_array(self): iso = self.iso import array a = array.array('b', b'asdf') iso(a).size def test_main(debug=0): from guppy.heapy.Remote import off off() support.run_unittest(FirstCase, debug) support.run_unittest(GCCase, debug) support.run_unittest(AltHeapCase, debug) support.run_unittest(SpecialTypesCase, debug) if __name__ == "__main__": test_main() test_all.py 0000644 00000001252 15004413005 0006715 0 ustar 00 import importlib import sys autotests = ( 'dependencies', 'gsl', 'Classifiers', 'heapyc', 'ER', 'OutputHandling', 'Part', 'Path', 'RefPat', 'UniSet', 'View', ) # These are not tested here others = ( 'menuleak', 'sf', ) def test_main(debug=False): for name in autotests: testname = 'guppy.heapy.test.test_'+name try: del sys.modules[testname] except KeyError: pass x = importlib.import_module(testname) print('imported:', testname) f = x.test_main f(debug=debug) del sys.modules[testname] if __name__ == '__main__': test_main() test_dependencies.py 0000644 00000000326 15004413005 0010574 0 ustar 00 # Test the libraries we are dependent on # Only sets right now. def test_main(debug=0): print('Testing sets') from guppy.sets import test test.test_main() if __name__ == "__main__": test_main() test_gsl.py 0000644 00000000645 15004413005 0006737 0 ustar 00 # Test the gsl subpackage # Ideally this should be a top level test. def test_main(debug=0): from guppy import Root gsl = Root().guppy.gsl gsl.Document._test_main_() gsl.DottedTree.test_main() gsl.FileIO.set_test_mode() gsl.Filer._test_main_() gsl.Gsml._test_main_() gsl.Main._test_main_() gsl.SpecNodes.test_main() # gsl.Text.test() if __name__ == "__main__": test_main() test_heapyc.py 0000644 00000037144 15004413005 0007427 0 ustar 00 from guppy.heapy.test import support class TestCase(support.TestCase): def setUp(self): support.TestCase.setUp(self) self.sets = self.guppy.sets heapdefs = getattr(self.sets.setsc, '_NyHeapDefs_'), self.root = [] self.heapyc = self.guppy.heapy.heapyc self.hv = self.heapyc.HeapView(self.root, heapdefs) self.nodeset = self.sets.immnodeset self.mutnodeset = self.sets.mutnodeset self.nodegraph = self.heapyc.NodeGraph class TestHeapView(TestCase): def test_hiding_tag(self): hiding_tag = self.hv._hiding_tag_ a = [] ns = self.mutnodeset([a]) ng = self.nodegraph([(a, a)]) self.aseq(self.hv.relimg([ns]), self.nodeset([a])) self.aseq(self.hv.relimg([ng]), self.nodeset([a])) ns._hiding_tag_ = hiding_tag self.aseq(self.hv.relimg([ns]), self.nodeset([])) ng._hiding_tag_ = hiding_tag self.aseq(self.hv.relimg([ng]), self.nodeset([])) self.hv._hiding_tag_ = [] self.aseq(self.hv.relimg([ns]), self.nodeset([a, None])) self.aseq(self.hv.relimg([ng]), self.nodeset([a, None])) def test_inheritance_from_heapview(self): # I am not using inheritance from HeapView, # but it would be kinda weird if it didn't work. HeapView = self.guppy.heapy.heapyc.HeapView x = 'x' newroot = [x] class HV(HeapView): def __new__(self): return HeapView.__new__(HV, newroot, ()) hv = HV() assert hv.heap() == self.nodeset([x, newroot]) def test_inheritance_from_special_types(self): # Test that relate, size & traverse function correctly for inherited types # as discussed in Notes Apr 14 2005. # Testing with a standard type (list) with specially size and relate definitions, # and a heapdef'd type (mutnodeset) with size, relate and traverse defs. # Test includes more than 1 level of inheritance, since the generic # method needs to go over all bases and not just the (first) base. hv = self.hv hv._hiding_tag_ = [] # Different from default nodeset's hiding_tag immnodeset = self.sets.immnodeset mutnodeset = self.sets.mutnodeset for base in (list, mutnodeset): class T(base): __slots__ = 't', class U(T): __slots__ = 'u', a = base() t = T() t.t = [] u = U() u.t = [] u.u = [] data = list(range(16)) for x in data: a.append(x) t.append(x) u.append(x) # Test size za = hv.indisize_sum([a]) zt = hv.indisize_sum([t]) zu = hv.indisize_sum([u]) self.assertTrue(za < zt < zu) # Test traverse self.aseq(hv.relimg([a]), immnodeset(data)) self.aseq(hv.relimg([t]), immnodeset(data+[T, t.t])) self.aseq(hv.relimg([u]), immnodeset(data+[U, u.t, u.u])) # Test relate def rel(src, tgt): r = hv.relate(src, tgt) self.assertTrue(r != ((),)*len(r)) return r self.aseq(rel(t, data[1]), rel(a, data[1])) self.aseq(rel(u, data[1]), rel(a, data[1])) self.aseq(rel(u, u.t), rel(t, t.t)) rel(u, u.u) def test_nodeset_circularity(self): # The traversal to function correctly for types inherited from nodeset # required a fix as discussed in Notes Apr 14 2005. # This method intends to test that this fix was harmless wrt gc & circularity. # To make this method fail, it was necessary to disable nodeset gc traversal. # xxx It seems I have not yet come around to write this test... pass def test_registered_hiding(self): hv = self.hv class Set(object): __slots__ = 'some', '_hiding_tag_', 'other' class Der(Set): pass hv.register__hiding_tag__type(Set) # Der is inherited and registration follows its base type. s = Set() d = Der() t = Set() some = [] other = [] dother = [] s.some = some s.other = other d.some = some d.other = dother self.root.append([s, t, d]) self.root.append(s) self.root.append(d) self.root.append(t) x = hv.heap() assert dother in x assert some in x assert other in x assert s in x assert d in x assert t in x s._hiding_tag_ = hv._hiding_tag_ d._hiding_tag_ = hv._hiding_tag_ x = hv.heap() assert some not in x assert other not in x assert s not in x assert d not in x assert t in x he = [] hv._hiding_tag_ = he x = hv.heap() assert dother in x assert some in x assert other in x assert s in x assert d in x assert t in x def test_timing(self): # Test some timing aspects of heap traversal from time import process_time as clock hv = self.hv d = [] h = [d] self.root.extend(100000*[h]) self.root.extend(list(range(100000))) start = clock() x = hv.heap() elapsed0 = clock() - start print('elapsed0', elapsed0, 'len(x)', len(x)) class Set(object): __slots__ = 'some', '_hiding_tag_', 'other' class Der(Set): pass hv.register__hiding_tag__type(Set) s = Set() s._hiding_tag_ = hv._hiding_tag_ d = Der() d._hiding_tag_ = hv._hiding_tag_ self.root[0:50000] = 25000*[s, d] start = clock() x = hv.heap() elapsed1 = clock() - start print('elapsed1', elapsed1, 'len(x)', len(x)) # This has failed a couple of times so I remove it now, (apr 5 2008) # xxx should look into this later ... #self.assert_(elapsed1 < 3.0 * elapsed0) class TestLeak(support.TestCase): def test_1(self): import gc from sys import getrefcount as grc support.TestCase.setUp(self) sets = self.guppy.sets heapdefs = getattr(sets.setsc, '_NyHeapDefs_'), root = [] heapyc = self.guppy.heapy.heapyc nodeset = sets.mutnodeset nodegraph = heapyc.NodeGraph class T(object): __slots__ = 'a', '_hiding_tag_', 'tonly' pass class U(T): __slots__ = 'b', pass class V(object): __slots__ = 'c', gc.collect() ns = nodeset() a = [ns] a.append(a) b = [] he = [] c = [] t = T() tonly = [] t.a = a t._hiding_tag_ = he t.tonly = tonly u = U() u.a = a u._hiding_tag_ = he u.b = b v = V() v.c = c a = [x for x in [list]] li = [he, a, b, c, t, u, v, T, U, V, ns, nodeset, list] rcli0 = [grc(x) for x in li] ns |= li + list(range(10000, 10010)) root.extend(li) rcli = [grc(x) for x in li] rec = nodeset([x for x in li]) x = None rec.append(rec) ns.add(rec) rec._hiding_tag_ = rec hv = heapyc.HeapView(root, heapdefs) hv.register__hiding_tag__type(T) h = hv.heap() assert a in h assert c in h assert tonly in h hv._hiding_tag_ = he h = hv.heap() del x del h del hv ns.discard(rec) rec = None gc.collect() nrcli = [grc(x) for x in li] self.aseq(rcli, nrcli) root[:] = [] ns.clear() nrcli0 = [grc(x) for x in li] self.aseq(rcli0, nrcli0) def test_weaky(self): # Test that the extra-type information in heapview # will still allow types to come, be used, and go, and be collected # This depends on that they are weakly-referenced # so internal heapview structures can remove them when they are # to be collected. import gc from sys import getrefcount as grc support.TestCase.setUp(self) sets = self.guppy.sets heapdefs = getattr(sets.setsc, '_NyHeapDefs_'), root = [] heapyc = self.guppy.heapy.heapyc nodeset = sets.NodeSet nodegraph = heapyc.NodeGraph gc.collect() probe = [] rcprobe = grc(probe) class T(object): x = probe class U(T): pass T.U = U # Make circular dependency t = T() u = U() root.append(t) root.append(u) hv = heapyc.HeapView(root, heapdefs) x = hv.heap() assert t in x x = None T = t = U = u = None root[:] = [] gc.collect() # 2 collections needed sometimes? Note Apr 15 2005 nrcprobe = grc(probe) self.aseq(nrcprobe, rcprobe) class TestNodeGraph(TestCase): def test_constructor_and_methods(self): # Test constructor w no arg ng = self.nodegraph() # Test add_edge ng.add_edge(1, 2) # Test add_edges_n1 ng.add_edges_n1([3, 4], 5) lng = list(ng) lng.sort() assert lng == [(1, 2), (3, 5), (4, 5)] # Test as_flat_list fl = ng.as_flat_list() fl.sort() assert fl == [1, 2, 3, 4, 5, 5] # Test copy cp = ng.copy() cp.add_edge(5, 6) # Test __iter__ explicitly lng1 = list(ng.__iter__()) lng1.sort() assert lng1 == lng lcp = list(cp) lcp.sort() assert lcp == [(1, 2), (3, 5), (4, 5), (5, 6)] # Test domain_covers assert ng.domain_covers([1, 3, 4]) assert not ng.domain_covers([1, 3, 4, 5]) # Test domain_restricted rng = ng.domain_restricted([1, 3]) # Test get_domain assert rng.get_domain() == self.nodeset([1, 3]) lrng = list(rng) lrng.sort() assert lrng == [(1, 2), (3, 5)] # Test get_range assert rng.get_range() == self.nodeset([2, 5]) # Test invert rng.invert() lrng = list(rng) lrng.sort() assert lrng == [(2, 1), (5, 3)] # Test inverted ing = ng.inverted() ling = list(ing) ling.sort() assert ling == [(2, 1), (5, 3), (5, 4)] # Test relimg assert ing.relimg([2]) == self.nodeset([1]) assert ing.relimg([2, 5, 3]) == self.nodeset([1, 3, 4]) # Test update ing.update([(3, 7), (4, 8)]) assert ing.relimg([2, 5, 3]) == self.nodeset([1, 3, 4, 7]) # Test updated uing = ing.updated([(2, 9)]) assert ing.relimg([2, 5, 3]) == self.nodeset([1, 3, 4, 7]) assert uing.relimg([2, 5, 3]) == self.nodeset([1, 3, 4, 7, 9]) # Test __getitem__ tgts = list(uing[2]) tgts.sort() assert tgts == [1, 9] # Test __len__ assert len(uing) == 6 uing[2] = (2, 8) # Test __setitem__ tgts = list(uing[2]) tgts.sort() assert tgts == [2, 8] # Test clear ng.clear() assert list(ng) == [] # Test constructor with iterable ng = self.nodegraph([(1, 2)]) assert list(ng) == [(1, 2)] assert not ng.is_mapping # Test constructor with is_mapping flag ng = self.nodegraph(is_mapping=True) assert ng.is_mapping assert list(ng) == [] ng.add_edge(1, 2) assert list(ng) == [(1, 2)] assert ng[1] == 2 ng = self.nodegraph(is_mapping=False) assert not ng.is_mapping # Test constructor with iterable & is_mapping flag for ng in (self.nodegraph([(1, 2)], True), self.nodegraph(iterable=[(1, 2)], is_mapping=True), self.nodegraph([(1, 2)], is_mapping=True), self.nodegraph(is_mapping=True, iterable=[(1, 2)]) ): assert ng.is_mapping assert list(ng) == [(1, 2)] assert ng[1] == 2 ng[1] = 3 assert ng[1] == 3 # Test is_sorted flag # though this behaviour is not fixed - may change with implementation ng = self.nodegraph() ng.add_edge(1, 2) ng.add_edge(2, 1) assert not ng.is_sorted ng[1] assert ng.is_sorted def test_inheritance(self): class T(self.heapyc.NodeGraph): __slots__ = 'x' def as_sorted_list(self): a = list(self) a.sort() return a t = T() t.add_edge(1, 2) t.add_edge(2, 3) assert t.as_sorted_list() == [(1, 2), (2, 3)] t = T([(4, 5), (6, 7)]) assert t.as_sorted_list() == [(4, 5), (6, 7)] # Test that the base type functionality has been inherited # by making test_constructor_and_methods think NodeGraph is T self.nodegraph = T self.test_constructor_and_methods() # Test with a constructor with new argument # and some more attributes class R(T): __slots__ = 'stop', def __new__(self, stop): r = T.__new__(R, is_mapping=1) r.add_edges_n1(list(range(stop)), 0) r.stop = stop return r def keys(self): return list(self.get_domain()) def values(self): return [self[k] for k in list(self.keys())] r = R(10) assert r.stop == 10 assert r.is_mapping lr = list(r) lr.sort() assert lr[-2:] == [(8, 0), (9, 0)] keys = list(r.keys()) keys.sort() assert keys == list(range(10)) values = list(r.values()) assert values == [0]*10 class TestClassifiers(TestCase): # Some new standalone classifiers tests. # Some old are also tested via test_Classifiers. def test_inrel(self): def str_inrel(c): c = list(c) c.sort() return ', '.join(['(%s, %r)' % (x.kind, x.relator) for x in c]) hv = self.hv rg = self.nodegraph() x = [] y = [x] rg.add_edge(x, y) cli = hv.cli_inrel(rg, {}, {}) c = cli.classify(x) self.aseq(str_inrel(c), '(2, 0)') for i in range(5): y.append(x) c = cli.classify(x) self.aseq(str_inrel(c), '(2, 0), (2, 1), (2, 2), (2, 3), (2, 4), (2, 5)') for i in range(5): r = {str(i): x} rg.add_edge(x, r) c = cli.classify(x) def test_nodetuple_richcompare(self): hv = self.hv cli = hv.cli_and((hv.cli_id(),), {}) a, b = cli.classify(1), cli.classify(2) self.assertTrue(a != b) self.assertFalse(a == b) self.assertTrue(a >= b or a <= b) self.assertFalse(a >= b and a <= b) self.assertTrue(a > b or a < b) self.assertFalse(a > b and a < b) a, b = cli.classify(1), cli.classify(1) self.assertFalse(a != b) self.assertTrue(a == b) self.assertTrue(a >= b or a <= b) self.assertTrue(a >= b and a <= b) self.assertFalse(a > b or a < b) self.assertFalse(a > b and a < b) def test_main(debug=False): support.run_unittest(TestClassifiers, debug) support.run_unittest(TestNodeGraph, debug) support.run_unittest(TestLeak, debug) support.run_unittest(TestHeapView, debug) if __name__ == "__main__": test_main() test_menuleak.py 0000644 00000006174 15004413005 0007756 0 ustar 00 from tkinter import * import sys import gc class FixedMenu(Menu): # A fix for the .delete() method in Menu. # To delete commands defined in the menu items deleted. # Also changed the comment: INDEX2 is actually INCLUDED. def delete(self, index1, index2=None): """Delete menu items between INDEX1 and INDEX2 (included).""" print(self._tclCommands) if index2 is None: index2 = index1 # First find out what entries have defined commands. cmds = [] for i in range(self.index(index1), self.index(index2)+1): c = str(self.entrycget(i, 'command')) if c in self._tclCommands: # I don't want to delete the command already, since it # seems mystical to do that while the entry is not yet deleted. cmds.append(c) # Delete the menu entries. self.tk.call(self._w, 'delete', index1, index2) # Now that the menu entries have been deleted, we can delete their commands. for c in cmds: self.deletecommand(c) def test1(M): # Test with a single command gc.collect() root = Tk() button = Menubutton(root, text='Window') menu = M(button) button['menu'] = menu def command(): print('command button pressed') rc = sys.getrefcount(command) menu.add_command(command=command) # or add_radiobutton etc idx = menu.index(END) menu.delete(idx) gc.collect() rc1 = sys.getrefcount(command) print('leak test with class', M, end=' ') if rc1 != rc: print('failed: command is now hold by', rc1, 'references') else: print('succeeded: command is now hold by', rc1, 'references') root.destroy() def test2(M): # Test with 3 commands, especially to see that deleting a range works. gc.collect() root = Tk() button = Menubutton(root, text='Window') menu = M(button) button['menu'] = menu def command0(): print('command 0 button pressed') 'deleting 0 and 1' menu.delete(idx0, idx1) def command1(): print('command 1 button pressed') def command2(): print('command 2 button pressed') print('deleting at END') menu.delete(END) root.quit() rc = [sys.getrefcount(x) for x in (command0, command1, command0)] button.pack() # or add_radiobutton etc menu.add_command(command=command0, label='press first') idx0 = menu.index(END) menu.add_radiobutton(command=command1, label='command1') # to see that delete works even when no command supplied menu.add_command(label='no Command') idx1 = menu.index(END) menu.add_command(command=command2, label='press last') idx2 = menu.index(END) root.mainloop() gc.collect() rc1 = [sys.getrefcount(x) for x in (command0, command1, command0)] print('leak test with class', M, end=' ') if rc1 != rc: print('failed: command is now hold by', rc1, 'references, should be', rc) else: print('succeeded: command is now hold by', rc1, 'references') root.destroy() for M in (Menu, FixedMenu,): test1(M) test2(M) test_sf.py 0000644 00000001107 15004413005 0006554 0 ustar 00 import importlib # This is to see that the total memory usage doesn't increase with time # i.e. no leakage / link between consecutive usages of hsp. # This will run for ever, to be monitored by the printout and some external monitor. def t(): from guppy import hsp while 1: import guppy.heapy.UniSet import gc importlib.reload(guppy.heapy.UniSet) hp = hsp() x = None x = hp.heap() print(x) gc.collect() print(x[0]) print(x[1]) print(x[2]) gc.collect() print(x & dict)
| ver. 1.4 |
Github
|
.
| PHP 8.1.31 | Генерация страницы: 0.02 |
proxy
|
phpinfo
|
Настройка