<?php
/**
* SeekQuarry/Yioop --
* Open Source Pure PHP Search Engine, Crawler, and Indexer
*
* Copyright (C) 2009 - 2014 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 <http://www.gnu.org/licenses/>.
*
* END LICENSE
*
* @author Chris Pollett chris@pollett.org
* @package seek_quarry
* @subpackage test
* @license http://www.gnu.org/licenses/ GPL3
* @link http://www.seekquarry.com/
* @copyright 2009 - 2014
* @filesource
*/
if(!defined('BASE_DIR')) {echo "BAD REQUEST"; exit();}
/** Load search engine-wide configuration file */
require_once BASE_DIR.'/configs/config.php';
/** Load the priority queue class library we'll be testing */
require_once BASE_DIR."/lib/priority_queue.php";
/**
* Used to test the PriorityQueue class that is used to figure out which URL
* to crawl next
*
* @author Chris Pollett
* @package seek_quarry
* @subpackage test
*/
class PriorityQueueTest extends UnitTest
{
/**
* We setup two queue one that always returns the max element, one that
* always returns the min element
*/
function setUp()
{
$this->test_objects['FILE1'] =
new PriorityQueue(WORK_DIRECTORY."/queue1.txt",
100, 4, CrawlConstants::MAX);
$this->test_objects['FILE2'] =
new PriorityQueue(WORK_DIRECTORY."/queue2.txt",
100, 4, CrawlConstants::MIN);
}
/**
* Since our queues are persistent structures, we delete files that might be
* associated with them when we tear down
*/
function tearDown()
{
@unlink(WORK_DIRECTORY."/queue1.txt");
@unlink(WORK_DIRECTORY."/queue2.txt");
}
/**
* Insert five items into a priority queue. Checks that the resulting heap
* array matches the expected array calculated by hand. Weights of some
* elements of the queue are adjusted and the resulting heap array checked
* again. The results of polling the queue and normalizing the queue are
* tested
*/
function maxQueueTestCase()
{
$this->test_objects['FILE1']->insert("aaaa", 5.5);
$this->test_objects['FILE1']->insert("baaa", 6.5);
$this->test_objects['FILE1']->insert("caaa", 4.5);
$this->test_objects['FILE1']->insert("daaa", 5.0);
$this->test_objects['FILE1']->insert("eaaa", 7.5);
$expected_array = array(array("eaaa", 7.5), array("baaa", 6.5),
array("caaa", 4.5), array("daaa", 5.0), array("aaaa", 5.5));
$this->assertEqual(
$this->test_objects['FILE1']->getContents(), $expected_array,
"Insert into queue yields expected contents");
$this->test_objects['FILE1']->adjustWeight(3, 4.0);
$expected_array = array(array("caaa", 8.5), array("baaa", 6.5),
array("eaaa", 7.5), array("daaa", 5.0), array("aaaa", 5.5));
$this->assertEqual(
$this->test_objects['FILE1']->getContents(), $expected_array,
"Adjust elt weight yields expected contents");
$this->test_objects['FILE1']->normalize();
$queue_data = $this->test_objects['FILE1']->getContents();
$sum = 0;
$count = count($queue_data);
for($i = 0; $i < $count; $i++) {
$this->assertEqual($queue_data[$i][0], $expected_array[$i][0],
"key of $i th elt of queue unchanged by normalize");
$sum += $queue_data[$i][1];
}
$this->assertEqual(round($sum), NUM_URLS_QUEUE_RAM,
"Normalizations yields correct sum");
$elt = $this->test_objects['FILE1']->poll();
$this->assertEqual($elt[0], "caaa", "Remove caaa from queue okay");
$elt = $this->test_objects['FILE1']->poll();
$this->assertEqual($elt[0], "eaaa", "Remove eaaa from queue okay");
$elt = $this->test_objects['FILE1']->poll();
$this->assertEqual($elt[0], "baaa", "Remove baaa from queue okay");
$elt = $this->test_objects['FILE1']->poll();
$this->test_objects['FILE1']->normalize();
$expected_array = array(array("daaa", NUM_URLS_QUEUE_RAM));
$this->assertEqual(
$this->test_objects['FILE1']->getContents(), $expected_array,
"Queue after deletes has expected content");
}
/**
* Inserts five elements inserted into a minimum priority queue. The
* resulting heap array is compared to expected. Then repeated polling is
* done to make sure the objects come out in the correct order.
*/
function minQueueTestCase()
{
$this->test_objects['FILE2']->insert("aaaa", 5.5);
$this->test_objects['FILE2']->insert("baaa", 6.5);
$this->test_objects['FILE2']->insert("caaa", 4.5);
$this->test_objects['FILE2']->insert("daaa", 5.0);
$this->test_objects['FILE2']->insert("eaaa", 7.5);
$expected_array = array(array("caaa", 4.5), array("daaa", 5.0),
array("aaaa", 5.5), array("baaa", 6.5), array("eaaa", 7.5));
$this->assertEqual(
$this->test_objects['FILE2']->getContents(), $expected_array,
"Queue has expected order after initial inserts");
$elt = $this->test_objects['FILE2']->poll();
$this->assertEqual($elt[0], "caaa", "Remove caaa from queue okay");
$elt = $this->test_objects['FILE2']->poll();
$this->assertEqual($elt[0], "daaa", "Remove daaa from queue okay");
$elt = $this->test_objects['FILE2']->poll();
$this->assertEqual($elt[0], "aaaa", "Remove aaaa from queue okay");
$elt = $this->test_objects['FILE2']->poll();
$this->assertEqual($elt[0], "baaa", "Remove baaa from queue okay");
$elt = $this->test_objects['FILE2']->poll();
$this->assertEqual($elt[0], "eaaa", "Remove eaaa from queue okay");
$this->assertEqual(
$this->test_objects['FILE2']->getContents(),
array(), "Queue should be empty after deletes");
}
}
?>