File: test_index_vstree.cpp

package info (click to toggle)
seqan2 2.4.0+dfsg-11~bpo9+1
  • links: PTS, VCS
  • area: main
  • in suites: stretch-backports
  • size: 223,500 kB
  • sloc: cpp: 256,886; ansic: 91,672; python: 8,339; sh: 995; xml: 570; makefile: 251; awk: 51
file content (167 lines) | stat: -rw-r--r-- 6,904 bytes parent folder | download | duplicates (3)
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
// ==========================================================================
//                 SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2018, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of Knut Reinert or the FU Berlin nor the names of
//       its contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
// Author: Enrico Siragusa <enrico.siragusa@fu-berlin.de>
// ==========================================================================

#include <seqan/basic.h>
#include <seqan/index.h>

#include "test_index_helpers.h"

using namespace seqan;

// ==========================================================================
// Types
// ========================================================================== 

// ========================================================================== 
// Test Classes
// ========================================================================== 

// --------------------------------------------------------------------------
// Class IndexIteratorTest
// --------------------------------------------------------------------------

template <typename TIndex, typename TSpec>
class IndexIteratorTest : public IndexTest<TIndex>
{
public:
    typedef IndexTest<TIndex>                       TBase;
    typedef typename Iterator<TIndex, TSpec>::Type  TIter;

    // Disable base class index creation since iterators uses lazy construction.
    void setUp()
    {
        createText(this->text, typename TBase::TValue());
    }
};

// --------------------------------------------------------------------------
// Class TopDownIndexIteratorTest
// --------------------------------------------------------------------------

template <typename TIndex>
class TopDownIndexIteratorTest : public IndexIteratorTest<TIndex, TopDown<> > {};

SEQAN_TYPED_TEST_CASE(TopDownIndexIteratorTest, TrieIndexTypes);

// ==========================================================================
// TopDown Iterator Tests
// ==========================================================================

// --------------------------------------------------------------------------
// Test Constructor
// --------------------------------------------------------------------------

SEQAN_TYPED_TEST(TopDownIndexIteratorTest, Constructor)
{
    typename TestFixture::TIter it(this->index);

    SEQAN_ASSERT(isRoot(it));
    // NOTE(esiragusa): An empty index must yield isLeaf(it) == true
    SEQAN_ASSERT_NOT(isLeaf(it));

    // NOTE(esiragusa): Actual behavior is:
    SEQAN_ASSERT_EQ(countOccurrences(it), lengthSum(this->text) + countSequences(this->index));
    // NOTE(esiragusa): Correct behavior should be:
//    SEQAN_ASSERT_EQ(countOccurrences(it), lengthSum(this->text));
}

// --------------------------------------------------------------------------
// Test goDown()
// --------------------------------------------------------------------------

SEQAN_TYPED_TEST(TopDownIndexIteratorTest, GoDown)
{
    typename TestFixture::TIter it(this->index);

    SEQAN_ASSERT(goDown(it));
    SEQAN_ASSERT_EQ(repLength(it), 1u);

    goRoot(it);

    SEQAN_ASSERT(goDown(it, front(concat(this->text))));
    SEQAN_ASSERT_EQ(parentEdgeLabel(it), front(concat(this->text)));
    SEQAN_ASSERT_EQ(repLength(it), 1u);

    goRoot(it);

    // NOTE(esiragusa): Actual behavior is:
//    SEQAN_ASSERT(goDown(it, prefix(concat(this->text), 5u)));
//    SEQAN_ASSERT_EQ(repLength(it), 5u);
}

// --------------------------------------------------------------------------
// Test goRight()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test isRoot()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test isLeaf()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test range()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test countOccurrences()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test getOccurrences()
// --------------------------------------------------------------------------

// --------------------------------------------------------------------------
// Test representative()
// --------------------------------------------------------------------------

// ==========================================================================
// ParentLinks TopDown Iterator Tests
// ==========================================================================

// --------------------------------------------------------------------------
// Test goUp()
// --------------------------------------------------------------------------

// ========================================================================== 
// Functions
// ========================================================================== 

int main(int argc, char const ** argv)
{
    TestSystem::init(argc, argv);
    return TestSystem::runAll();
}