mirrors/aria2
1
0
Fork 0
mirror of https://github.com/aria2/aria2.git synced 2025-04-05 05:27:38 +03:00
Code Issues Projects Releases Packages Wiki Activity

2009-02-03 Tatsuhiro Tsujikawa <t-tujikawa@users.sourceforge.net>

Browse source 
Extracted the algorithm to find the longest incremental sequence
	as max_sequence template.
	* src/LongestSequencePieceSelector.cc
	* src/a2algo.h
	* test/Makefile.am
	* test/a2algoTest.cc
This commit is contained in:
Tatsuhiro Tsujikawa 2009-02-03 14:46:33 +00:00
parent c41fec3a22
commit 23a6eff88e
6 changed files with 100 additions and 28 deletions
Download patch file Download diff file Expand all files Collapse all files

44
test/a2algoTest.cc Normal file
View file

@ -0,0 +1,44 @@
#include "a2algo.h"
#include <cppunit/extensions/HelperMacros.h>
#include "array_fun.h"
namespace aria2 {
class a2algoTest:public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(a2algoTest);
CPPUNIT_TEST(testSelect);
CPPUNIT_TEST_SUITE_END();
public:
void setUp() {}
void tearDown() {}
void testSelect();
};
CPPUNIT_TEST_SUITE_REGISTRATION(a2algoTest);
void a2algoTest::testSelect()
{
size_t A[] = { 1,2,3,4,7,10,11,12,13,14,15,100,112,113,114 };
std::pair<size_t*, size_t> p = max_sequence(&A[0], &A[arrayLength(A)]);
CPPUNIT_ASSERT_EQUAL(&A[5], p.first);
CPPUNIT_ASSERT_EQUAL((size_t)6, p.second);
p = max_sequence(&A[0], &A[0]);
CPPUNIT_ASSERT_EQUAL(&A[0], p.first);
CPPUNIT_ASSERT_EQUAL((size_t)0, p.second);
p = max_sequence(&A[0], &A[4]);
CPPUNIT_ASSERT_EQUAL(&A[0], p.first);
CPPUNIT_ASSERT_EQUAL((size_t)4, p.second);
}
} // namespace aria2