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
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2026, 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: David Weese <david.weese@fu-berlin.de>
// ==========================================================================
#ifndef SEQAN_HEADER_TEST_PIPE_H
#define SEQAN_HEADER_TEST_PIPE_H
namespace seqan2
{
template < typename TBuffer >
void permute(TBuffer buf)
{
typename Size<TBuffer>::Type i, j, s = length(buf);
// srand( (unsigned)time( NULL ) );
for(i = 0; i < s; i++)
buf[i] = s - i - 1;
for (i = 0; i < s; i++)
{
if (i > 0)
{
j = i - (rand() % i) - 1;
SEQAN_ASSERT_LT(j, s);
}
else
{
j = 0;
}
std::swap(buf[i], buf[j]);
}
}
template < typename TBuffer >
void randomize(TBuffer buf)
{
typename Size<TBuffer>::Type i, s = length(buf);
for(i = 0; i < s; i++)
buf[i] = rand() % s;
}
template < typename TValue >
struct IdentityMap : public std::function<TValue ( TValue)>
{
inline TValue operator() (TValue const i)
{
return i;
}
};
template < typename TValue >
struct SimpleCompare : public std::function<int ( TValue const, TValue const)>
{
inline int operator() (TValue const a, TValue const b) const
{
if (a < b) return -1;
if (a > b) return 1;
return 0;
}
};
template <typename TPipe1, typename TPipe2>
void comparePipes(TPipe1 &pipe1, TPipe2 &pipe2)
{
typedef typename Size<TPipe1>::Type TSize;
SEQAN_ASSERT_EQ(length(pipe1), length(pipe2));
beginRead(pipe1);
beginRead(pipe2);
TSize actualLen;
for (actualLen = 0; !eof(pipe1) && !eof(pipe2); ++actualLen)
{
SEQAN_ASSERT_EQ(eos(pipe1), eos(pipe2));
SEQAN_ASSERT_EQ(*pipe1, *pipe2);
++pipe1;
++pipe2;
}
SEQAN_ASSERT_EQ(eos(pipe1), eos(pipe2));
SEQAN_ASSERT_EQ(eof(pipe1), eof(pipe2));
SEQAN_ASSERT_EQ(actualLen, length(pipe1));
endRead(pipe1);
endRead(pipe2);
}
}
#endif
|
