add some new tests
git-svn-id: https://semanticscuttle.svn.sourceforge.net/svnroot/semanticscuttle/trunk@754 b3834d28-1941-0410-a4f8-b48e95affb8f
This commit is contained in:
parent
5c65da5bff
commit
93e5201658
1 changed files with 122 additions and 46 deletions
|
@ -55,21 +55,56 @@ class SearchHistoryTest extends TestBase
|
|||
|
||||
|
||||
|
||||
/**
|
||||
* Set up all services
|
||||
*
|
||||
* @return void
|
||||
*/
|
||||
protected function setUp()
|
||||
{
|
||||
$this->us =SemanticScuttle_Service_Factory::get('User');
|
||||
$this->bs =SemanticScuttle_Service_Factory::get('Bookmark');
|
||||
$this->us = SemanticScuttle_Service_Factory::get('User');
|
||||
$this->bs = SemanticScuttle_Service_Factory::get('Bookmark');
|
||||
$this->bs->deleteAll();
|
||||
|
||||
$this->b2ts =SemanticScuttle_Service_Factory::get('Bookmark2Tag');
|
||||
$this->b2ts->deleteAll();
|
||||
$this->tts =SemanticScuttle_Service_Factory::get('Tag2Tag');
|
||||
|
||||
$this->tts = SemanticScuttle_Service_Factory::get('Tag2Tag');
|
||||
$this->tts->deleteAll();
|
||||
$this->tsts =SemanticScuttle_Service_Factory::get('TagStat');
|
||||
|
||||
$this->tsts = SemanticScuttle_Service_Factory::get('TagStat');
|
||||
$this->tsts->deleteAll();
|
||||
$this->shs =SemanticScuttle_Service_Factory::get('SearchHistory');
|
||||
|
||||
$this->shs = SemanticScuttle_Service_Factory::get('SearchHistory');
|
||||
$this->shs->deleteAll();
|
||||
}
|
||||
|
||||
/**
|
||||
* Tests if adding searches to the database works
|
||||
*/
|
||||
public function testAddSearch()
|
||||
{
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
|
||||
$this->assertTrue(
|
||||
$this->shs->addSearch('testsearchterm', 'all', 0)
|
||||
);
|
||||
$this->assertEquals(1, $this->shs->countSearches());
|
||||
}
|
||||
|
||||
/**
|
||||
* Tests if adding a search without terms should fail
|
||||
*/
|
||||
public function testAddSearchNoTerms()
|
||||
{
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
|
||||
$this->assertFalse(
|
||||
$this->shs->addSearch('', 'all', 0)
|
||||
);
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
}
|
||||
|
||||
public function testSearchHistory()
|
||||
{
|
||||
$shs = $this->shs;
|
||||
|
@ -107,12 +142,53 @@ class SearchHistoryTest extends TestBase
|
|||
$this->assertEquals($uId, $searches[1]['uId']);
|
||||
|
||||
//test distinct parameter
|
||||
$shs->addSearch($terms, $range, $nbResults, 30); // we repeat a search (same terms)
|
||||
$shs->addSearch(
|
||||
$terms, $range, $nbResults, 30
|
||||
); // we repeat a search (same terms)
|
||||
$searches = $shs->getAllSearches();
|
||||
$this->assertSame(3, count($searches));
|
||||
$searches = $shs->getAllSearches(NULL, NULL, NULL, NULL, true);
|
||||
$searches = $shs->getAllSearches(null, null, null, null, true);
|
||||
$this->assertSame(2, count($searches));
|
||||
}
|
||||
|
||||
/**
|
||||
* Deleting the oldest search without any historical searches
|
||||
*/
|
||||
public function testDeleteOldestSearchNone()
|
||||
{
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
$this->assertTrue($this->shs->deleteOldestSearch());
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
}
|
||||
|
||||
/**
|
||||
* Test deleting the oldest search
|
||||
*/
|
||||
public function testDeleteOldestSearchSome()
|
||||
{
|
||||
$this->assertEquals(0, $this->shs->countSearches());
|
||||
$this->shs->addSearch('testsearchterm1', 'all', 0);
|
||||
$this->shs->addSearch('testsearchterm2', 'all', 0);
|
||||
|
||||
$rows = $this->shs->getAllSearches();
|
||||
$this->assertEquals(2, count($rows));
|
||||
|
||||
$highestId = -1;
|
||||
foreach ($rows as $row) {
|
||||
if ($row['shId'] > $highestId) {
|
||||
$highestId = $row['shId'];
|
||||
}
|
||||
}
|
||||
|
||||
$this->shs->deleteOldestSearch();
|
||||
|
||||
$rows = $this->shs->getAllSearches();
|
||||
$this->assertEquals(1, count($rows));
|
||||
$this->assertEquals(
|
||||
$highestId,
|
||||
$rows[0]['shId']
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
|
Loading…
Reference in a new issue