<?php
/**
* SeekQuarry/Yioop --
* Open Source Pure PHP Search Engine, Crawler, and Indexer
*
* Copyright (C) 2009 - 2022 Chris Pollett chris@pollett.org
*
* LICENSE:
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*
* END LICENSE
*
* @author Chris Pollett chris@pollett.org
* @license https://www.gnu.org/licenses/ GPL3
* @link https://www.seekquarry.com/
* @copyright 2009 - 2022
* @filesource
*/
namespace seekquarry\yioop\tests;
use seekquarry\yioop\configs as C;
use seekquarry\yioop\library as L;
use seekquarry\yioop\library\HashTable;
use seekquarry\yioop\library\UnitTest;
/**
* Used to test that the HashTable class properly stores key value pairs,
* handles insert, deletes, collisions okay. It should also detect when
* table is full
*
* @author Chris Pollett
*/
class HashTableTest extends UnitTest
{
/**
* We'll use two different tables one more representative of how the table
* is going to be used by the web_queue_bundle, the other small enough that
* we can manually figure out what the result should be
*/
public function setUp()
{
$this->test_objects['FILE1'] = new HashTable(
C\WORK_DIRECTORY."/hash1.txt", 20000, 8, 8);
$this->test_objects['FILE2'] = new HashTable(C\WORK_DIRECTORY.
"/hash2.txt", 10, 8, 1);
}
/**
* Since a HashTable is a PersistentStructure it periodically saves
* itself to a file. To clean up we delete the files that might be created
*/
public function tearDown()
{
set_error_handler(null);
@unlink(C\WORK_DIRECTORY."/hash1.txt");
@unlink(C\WORK_DIRECTORY."/hash2.txt");
set_error_handler(C\NS_CONFIGS . "yioop_error_handler");
}
/**
* Check if for the big hash table we insert something then later look it
* up, that we in fact find it. Moreover, the value we associated with the
* insert key is as expected
*/
public function insertLookupTestCase()
{
$this->assertTrue(
$this->test_objects['FILE1']->insert(
L\crawlHash("http://www.cs.sjsu.edu/", true),
pack("H*", "0000147700000000")),
"Insert (hash(URL), value) succeeded");
$this->assertEqual(
$this->test_objects['FILE1']->lookup(
L\crawlHash("http://www.cs.sjsu.edu/", true)),
pack("H*", "0000147700000000"),
"Lookup value equals insert value");
}
/**
* Checks insert an item, delete that item, then look it up. Make sure we
* don't find it after deletion.
*/
public function insertDeleteLookupTestCase()
{
$this->assertTrue(
$this->test_objects['FILE1']->insert(
L\crawlHash("http://www.cs.sjsu.edu/", true),
pack("H*", "0000147700000000")),
"Insert (crawlHash(URL), value) succeeded");
$this->assertTrue(
$this->test_objects['FILE1']->delete(
L\crawlHash("http://www.cs.sjsu.edu/", true)),
"delete crawlHash(URL) succeeded");
$this->assertFalse(
$this->test_objects['FILE1']->lookup(
L\crawlHash("http://www.cs.sjsu.edu/", true)),
"delete crawlHash(URL) succeeded");
}
/**
* Completety fill table. Next insert should fail. Then delete all the
* items. Then check that we can't find any of them
*/
public function completeFillTestCase()
{
for ($i = 0; $i < 10; $i++) {
$this->assertTrue(
$this->test_objects['FILE2']->insert(
L\crawlHash("hi$i", true), "$i"),
"Insert item ".($i+1)." into table of size 10");
}
$this->assertFalse(
$this->test_objects['FILE2']->insert(
L\crawlHash("hi11", true), "a"),
"Insert item 11 into table of size 10");
for ($i = 0; $i < 10; $i++) {
$this->assertEqual(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi$i", true)), "$i",
"Inserted value ".($i+1)." equals lookup value");
}
$this->assertFalse(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi11", true)), "a",
"Item 11's value should not be in table");
for ($i = 0; $i < 10; $i++) {
$this->assertTrue(
$this->test_objects['FILE2']->delete(L\crawlHash("hi$i", true)),
"Item ".($i+1)." delete success");
}
for ($i = 0; $i < 11; $i++) {
$this->assertFalse(
$this->test_objects['FILE2']->lookup(L\crawlHash("hi$i", true)),
"Should not find Item ".($i+1)." after delete");
}
}
/**
* First check that inserting an item twice does not change its index in
* the table. Then inserts an item which should hash to the same value. So
* there is a collision which is resolved by linear offset. Check lookup of
* new item succeeds.Then delete first insert, check lookup of second insert
* still works. Check delete of second item, reinsert of first item and
* lookup. Index should change
*/
public function reinsertCollisionAndIndexTestCase()
{
$this->test_objects['FILE2']->insert(L\crawlHash("hi7", true), "7");
$index =
$this->test_objects['FILE2']->lookup(L\crawlHash("hi7", true),
HashTable::ALWAYS_RETURN_PROBE);
$this->test_objects['FILE2']->insert(L\crawlHash("hi7", true), "z");
$this->assertTrue(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi7", true)),
"z", "Reinsert Item hi7 overwrites old value");
$index2 =
$this->test_objects['FILE2']->lookup(L\crawlHash("hi7", true),
HashTable::ALWAYS_RETURN_PROBE);
$this->assertEqual(
$index, $index2, "Index of reinserted should not change");
$this->assertTrue(
$this->test_objects['FILE2']->insert(L\crawlHash("hi11", true),
"8"), "Item hi11 which collides with hi7 insert okay");
$this->assertEqual(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi11", true), HashTable::ALWAYS_RETURN_PROBE),
$index2 + 1, "Item hi11 located one after hi7");
$this->test_objects['FILE2']->delete(L\crawlHash("hi7", true));
$this->assertEqual(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi11", true), HashTable::ALWAYS_RETURN_PROBE),
$index2 + 1, "Item hi11 looked up succeed after hi7 deleted");
$this->test_objects['FILE2']->delete(L\crawlHash("hi11", true));
$this->test_objects['FILE2']->insert(L\crawlHash("hi7", true), "7");
$this->assertEqual(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi7", true)), "7",
"Reinserted Item hi7 lookup succeeds");
$this->assertEqual(
$this->test_objects['FILE2']->lookup(
L\crawlHash("hi7", true), HashTable::ALWAYS_RETURN_PROBE),
$index2 + 2,
"New Item hi7 location does not overwrite deleted items");
}
/**
* Test how fast insertion and deletions can be done
*/
public function timingTestCase()
{
$start_time = microtime(true);
$file1 = $this->test_objects['FILE1'];
for ($i = 0; $i < 10000; $i++) {
$file1->insert(L\crawlHash("hi$i", true),
"0000".L\packInt($i));
}
$this->assertTrue((L\changeInMicrotime($start_time) < 3),
"Insert 10000 into table of size 20000 takes less than 3 seconds");
$start_time = microtime(true);
for ($i = 0; $i < 10000; $i++) {
$file1->delete(L\crawlHash("hi$i", true));
}
$this->assertTrue((L\changeInMicrotime($start_time) < 3),
"Delete 10000 from table of size 20000 takes less than 3 seconds");
}
}