Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include "TreeBaseTest.h"
CPPUNIT_TEST_SUITE_NAMED_REGISTRATION ( TreeBaseTest, "bits" );
CPPUNIT_TEST_SUITE_REGISTRATION ( TreeBaseTest );
void TreeBaseTest::setUp ( ) {
}
void TreeBaseTest::tearDown ( ) {
}
void TreeBaseTest::testRegexps ( ) {
RegExpIteration iter ( std::shared_ptr < RegExpElement > ( new RegExpEmpty ( ) ) );
CPPUNIT_ASSERT ( iter.getChild ( )->getParent ( ) == & iter );
RegExpIteration iter2 ( iter );
RegExpIteration iter3 ( iter2 );
CPPUNIT_ASSERT ( iter3.getChild ( )->getParent ( ) == & iter3 );
iter3 = iter;
RegExpIteration iter4 ( std::shared_ptr < RegExpElement > ( new RegExpEpsilon ( ) ) );
iter3 = iter4;
CPPUNIT_ASSERT ( iter3.getChild ( )->getParent ( ) == & iter3 );
RegExpSymbol s ( 'x' );
const RegExpSymbol & sr = s;
sr.getElements ( );
}
void TreeBaseTest::testRankedTree ( ) {
RankedTreeNode node ( 'a', 1, { RankedTreeNode ( 'b', 1, { RankedTreeNode ( 'c', 0, { } ) } ) } );
const RankedTreeNode & cnode = node;
for ( const RankedTreeNode & child : cnode.getChildren ( ) )
CPPUNIT_ASSERT ( child.getParent ( ) == & cnode );
}
void TreeBaseTest::testUnrankedTree ( ) {
}