Wala shell

Advanced PHP File Manager

Server IP: 127.0.0.1 | PHP Version: 8.3.30 | Domains Hosted: 54

Name	Size	Last Modified	Actions
📁 ..	-	2025-05-25 12:37
📄 LinkTester.php <?php class LinkTester extends Structures_LinkedList_DoubleNode { protected $_my_number; function __construct($num) { $this->_my_number = $num; } function getNumb() { return $this->_my_number; } function setNumb($numb) { $this->_my_number = $numb; } } $tester1 = new LinkTester(1); $tester2 = new LinkTester(2); $tester3 = new LinkTester(3); $tester4 = new LinkTester(4); $tester5 = new LinkTester(5); $tester6 = new LinkTester(6); ?>	492 B	2024-07-17 10:13
📄 SingleLinkTester.php <?php class LinkTester extends Structures_LinkedList_SingleNode { protected $_my_number; function __construct($num) { $this->_my_number = $num; } function getNumb() { return $this->_my_number; } function setNumb($numb) { $this->_my_number = $numb; } } $tester1 = new LinkTester(1); $tester2 = new LinkTester(2); $tester3 = new LinkTester(3); $tester4 = new LinkTester(4); $tester5 = new LinkTester(5); ?>	462 B	2024-07-17 10:13
📄 link_001.phpt --TEST-- link_001: Test linked list constructed with an initial link --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->appendNode($tester4); $link = $xyy->current(); print "Current: " . $link->getNumb() . "\n"; print "While: "; // test iteration with while() do { print $link->getNumb(); } while ($link = $xyy->next()); print "\nRewind: "; $link = $xyy->rewind(); print $link->getNumb(); print "\n"; print "Foreach: "; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } print "\nEnd: "; $link = $xyy->end(); print $link->getNumb(); print "\n"; print "While (in reverse): "; // test iteration with while() do { print $link->getNumb(); } while ($link = $xyy->previous()); ?> --EXPECT-- Current: 1 While: 1234 Rewind: 1 Foreach: 1234 End: 4 While (in reverse): 4321	987 B	2024-07-17 10:13
📄 link_002.phpt --TEST-- link_002: Append links to an initially empty linked list --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double(); $xyy->appendNode($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->insertNode($tester4, $tester2, true); $link = $xyy->current(); print $link->getNumb(); // test iteration with while() while ($link = $xyy->next()) { print $link->getNumb(); } $link = $xyy->rewind(); print "\n"; print $link->getNumb(); print "\n"; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- 1423 1 1423	675 B	2024-07-17 10:13
📄 link_003.phpt --TEST-- link_003: Append links in a specific order --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double(); // add initial link in the list $xyy->appendNode($tester1); print $tester1->getNumb() . "\n"; // add after initial link $xyy->appendNode($tester2); print $tester2->getNumb() . "\n"; // add after initial link, bumping #2 up $xyy->insertNode($tester3, $tester1); print $tester3->getNumb() . "\n"; // add after link #3, bumping #2 up again $xyy->insertNode($tester4, $tester3); print $tester4->getNumb() . "\n"; print "\n"; $link = $xyy->current(); print $link->getNumb(); print "\n"; // test iteration with while() while ($link = $xyy->next()) { print $link->getNumb(); print "\n"; } $link = $xyy->rewind(); print "\n"; print $link->getNumb(); print "\n"; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- 1 2 3 4 1 3 4 2 1 1342	1000 B	2024-07-17 10:13
📄 link_004.phpt --TEST-- link_004: Delete every link in the list --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->appendNode($tester4); // Delete all nodes from the list while ($link = $xyy->rewind()) { print "Deleted " . $link->getNumb() . "\n"; $xyy->deleteNode($link); } $link = $xyy->rewind(); print "Done\n"; ?> --EXPECT-- Deleted 1 Deleted 2 Deleted 3 Deleted 4 Done	544 B	2024-07-17 10:13
📄 link_005.phpt --TEST-- link_005: Pass different class types to constructors --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; class TesterExtend extends Structures_LinkedList_DoubleNode { protected $_my_number; function __construct($tester, $num) { $this->_my_number = $num; parent::__construct($tester); } } class TesterFail { protected $summary; protected $fulltext; function __construct($summary, $fulltext) { $this->summary = $summary; $this->fulltext = $fulltext; } } // This should work: TesterExtend extends the Structure_LinkedList_DoubleNode class $tester_extend = new TesterExtend(null, 1); $xyy = new Structures_LinkedList_Double($tester_extend); print "Checking for errors in the expected success case:\n"; // This should fail print "Checking for errors in the expected failure case:\n"; $tester_fail = new TesterFail(null, 1); $xyy_fail = new Structures_LinkedList_Double($tester_fail); ?> --EXPECTF-- Checking for errors in the expected success case: Checking for errors in the expected failure case: %satal error: Argument 1 passed to Structures_LinkedList_Double::__construct() must be an instance of Structures_LinkedList_DoubleNode%s	1.21 KB	2024-07-17 10:13
📄 link_006.phpt --TEST-- link_006: Corner case: add a node before the root --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double(); $xyy->prependNode($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->insertNode($tester4, $tester2, true); // Ensure we can increment the current node without messing up the list print "\nCurrent: " . $xyy->current()->getNumb() . "\n"; $link = $xyy->next(); print "Current: " . $link->getNumb() . "\n"; $xyy->insertNode($tester5, $tester1, true); print "\n"; $link = $xyy->current(); print "Current: " . $link->getNumb(); print "\n\nWhile: "; // test iteration with while() $link = $xyy->rewind(); do { print $link->getNumb(); } while ($link = $xyy->next()); print "\n\nForeach: "; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- Current: 1 Current: 4 Current: 4 While: 51423 Foreach: 51423	991 B	2024-07-17 10:13
📄 link_007.phpt --TEST-- link_007: Test many corner cases --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Double.php'; require 'LinkTester.php'; $xyy = new Structures_LinkedList_Double(); // prepend to an empty list corner case: 1 $xyy->prependNode($tester1); print "Current: {$xyy->current()->getNumb()}\n"; // prepend to a list with only one element: 21 $xyy->prependNode($tester2); print "Current: {$xyy->current()->getNumb()}\n"; // insert after tail node corner case: 213 $xyy->insertNode($tester3, $tester1); print "Current: {$xyy->current()->getNumb()}\n"; // insert before root node corner case: 4213 $xyy->insertNode($tester4, $tester2, true); print "Current: {$xyy->current()->getNumb()}\n"; // insert before tail node corner case: 42153 $xyy->insertNode($tester5, $tester3, true); print "Current: {$xyy->current()->getNumb()}\n"; // insert after root node corner case: 421653 $xyy->insertNode($tester6, $tester1); print "Current: {$xyy->current()->getNumb()}\n"; print "Foreach: "; foreach ($xyy as $node) { print $node->getNumb(); } print "\nWhile (in reverse): "; // test reverse iteration with while() $link = $xyy->end(); do { print $link->getNumb(); } while ($link = $xyy->previous()); ?> --EXPECT-- Current: 1 Current: 1 Current: 1 Current: 1 Current: 1 Current: 1 Foreach: 421653 While (in reverse): 356124	1.32 KB	2024-07-17 10:13
📄 single_link_001.phpt --TEST-- single_link_001: Test linked list constructed with an initial link --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->appendNode($tester4); $link = $xyy->current(); print "Current: " . $link->getNumb() . "\n"; print "While: "; // test iteration with while() do { print $link->getNumb(); } while ($link = $xyy->next()); print "\nRewind: "; $link = $xyy->rewind(); print $link->getNumb(); print "\n"; print "Foreach: "; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } print "\nEnd: "; $link = $xyy->end(); print $link->getNumb(); print "\n"; print "While (in reverse): "; // test iteration with while() do { print $link->getNumb(); } while ($link = $xyy->previous()); ?> --EXPECT-- Current: 1 While: 1234 Rewind: 1 Foreach: 1234 End: 4 While (in reverse): 4321	1000 B	2024-07-17 10:13
📄 single_link_002.phpt --TEST-- single_link_002: Append links to an initially empty linked list --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single(); $xyy->appendNode($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->insertNode($tester4, $tester2, true); $link = $xyy->current(); print $link->getNumb(); // test iteration with while() while ($link = $xyy->next()) { print $link->getNumb(); } $link = $xyy->rewind(); print "\n"; print $link->getNumb(); print "\n"; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- 1423 1 1423	688 B	2024-07-17 10:13
📄 single_link_003.phpt --TEST-- single_link_003: Append links in a specific order --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single(); // add initial link in the list $xyy->appendNode($tester1); print $tester1->getNumb() . "\n"; // add after initial link $xyy->appendNode($tester2); print $tester2->getNumb() . "\n"; // add after initial link, bumping #2 up $xyy->insertNode($tester3, $tester1); print $tester3->getNumb() . "\n"; // add after link #3, bumping #2 up again $xyy->insertNode($tester4, $tester3); print $tester4->getNumb() . "\n"; print "\n"; $link = $xyy->current(); print $link->getNumb(); print "\n"; // test iteration with while() while ($link = $xyy->next()) { print $link->getNumb(); print "\n"; } $link = $xyy->rewind(); print "\n"; print $link->getNumb(); print "\n"; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- 1 2 3 4 1 3 4 2 1 1342	1013 B	2024-07-17 10:13
📄 single_link_004.phpt --TEST-- single_link_004: Delete every link in the list --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->appendNode($tester4); // Delete all nodes from the list while ($link = $xyy->rewind()) { print "Deleted " . $link->getNumb() . "\n"; $xyy->deleteNode($link); } $link = $xyy->rewind(); print "Done\n"; ?> --EXPECT-- Deleted 1 Deleted 2 Deleted 3 Deleted 4 Done	557 B	2024-07-17 10:13
📄 single_link_005.phpt --TEST-- single_link_005: Pass different class types to constructors --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; class TesterExtend extends Structures_LinkedList_SingleNode { protected $_my_number; function __construct($tester, $num) { $this->_my_number = $num; parent::__construct($tester); } } class TesterFail { protected $summary; protected $fulltext; function __construct($summary, $fulltext) { $this->summary = $summary; $this->fulltext = $fulltext; } } // This should work: TesterExtend extends the Structure_LinkedList_SingleNode class $tester_extend = new TesterExtend(null, 1); $xyy = new Structures_LinkedList_Single($tester_extend); print "Checking for errors in the expected success case:\n"; // This should fail print "Checking for errors in the expected failure case:\n"; $tester_fail = new TesterFail(null, 1); $xyy_fail = new Structures_LinkedList_Single($tester_fail); ?> --EXPECTF-- Checking for errors in the expected success case: Checking for errors in the expected failure case: %satal error: Argument 1 passed to Structures_LinkedList_Single::__construct() must be an instance of Structures_LinkedList_SingleNode%s	1.22 KB	2024-07-17 10:13
📄 single_link_006.phpt --TEST-- single_link_006: Corner case: add a node before the root --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single(); $xyy->prependNode($tester1); $xyy->appendNode($tester2); $xyy->appendNode($tester3); $xyy->insertNode($tester4, $tester2, true); // Ensure we can increment the current node without messing up the list print "\nCurrent: " . $xyy->current()->getNumb() . "\n"; $link = $xyy->next(); print "Current: " . $link->getNumb() . "\n"; $xyy->insertNode($tester5, $tester1, true); print "\n"; $link = $xyy->current(); print "Current: " . $link->getNumb(); print "\n\nWhile: "; // test iteration with while() $link = $xyy->rewind(); do { print $link->getNumb(); } while ($link = $xyy->next()); print "\n\nForeach: "; // test foreach() iteration foreach ($xyy as $bull) { print $bull->getNumb(); } ?> --EXPECT-- Current: 1 Current: 4 Current: 4 While: 51423 Foreach: 51423	1004 B	2024-07-17 10:13
📄 single_link_007.phpt --TEST-- single_link_007: Test many corner cases --FILE-- <?php $dir = dirname(__FILE__); require 'Structures/LinkedList/Single.php'; require 'SingleLinkTester.php'; $xyy = new Structures_LinkedList_Single(); // prepend to an empty list corner case: 1 $xyy->prependNode($tester1); print "Current: {$xyy->current()->getNumb()}\n"; // prepend to a list with only one element: 21 $xyy->prependNode($tester2); print "Current: {$xyy->current()->getNumb()}\n"; // insert after tail node corner case: 213 $xyy->insertNode($tester3, $tester1); print "Current: {$xyy->current()->getNumb()}\n"; // insert before root node corner case: 4213 $xyy->insertNode($tester4, $tester2, true); print "Current: {$xyy->current()->getNumb()}\n"; // insert before tail node corner case: 42153 $xyy->insertNode($tester5, $tester3, true); print "Current: {$xyy->current()->getNumb()}\n"; print "Foreach: "; foreach ($xyy as $node) { print $node->getNumb(); } print "\nWhile (in reverse): "; // test reverse iteration with while() $link = $xyy->end(); do { print $link->getNumb(); } while ($link = $xyy->previous()); ?> --EXPECT-- Current: 1 Current: 1 Current: 1 Current: 1 Current: 1 Foreach: 42153 While (in reverse): 35124	1.19 KB	2024-07-17 10:13

Terminal