File: STLUtilities_test.cpp

package info (click to toggle)
libstatgen 1.0.15-8
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 4,588 kB
  • sloc: cpp: 49,624; ansic: 1,408; makefile: 320; sh: 60
file content (264 lines) | stat: -rw-r--r-- 7,412 bytes parent folder | download | duplicates (4)
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
/*
 *  Copyright (C) 2010  Regents of the University of Michigan
 *
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
#include <string>
#include "STLUtilities.h"

//
#define _STLUTILITIES_BENCHMARK_
// This can turn on the benchmark of STLUtilities class and String class
//
#ifdef _STLUTILITIES_BENCHMARK_
#include "Performance.h"
#include "Random.h"
#include "StringBasics.h"
#endif /* _STLUTILITIES_BENCHMARK_ */


#include <gtest/gtest.h>

TEST(STLUtilitiesTest, tSTLUtilitiesTest)
{
#if 0
    std::string test;
    std::string::iterator result;

    test = "445566";
    result = trimSequence(test, '5', true);
    EXPECT_EQ(result - test.begin() , 2);

    test = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    result = trimSequence(test, 'A', true);
    EXPECT_TRUE(result == test.begin());
#endif


    using namespace STLUtilities; // for overloaded std::string << operator

    std::string toot;

    toot << "double: " << 0.123456 << " LL: " << -5LL << " UL: " << 999UL << " char: " << '!';

    EXPECT_TRUE(toot == "double: 0.123456 LL: -5 UL: 999 char: !");


    // same result as above using different methods
    toot.clear();

    append(toot, "double: ");

    append(toot, 0.123456);

    append(toot, " LL: ");

    append(toot, -5LL);

    append(toot, " UL: ");

    append(toot, 999UL);

    append(toot, " char: ");

    append(toot, (char) (' ' + 1));

    EXPECT_TRUE(toot == "double: 0.123456 LL: -5 UL: 999 char: !");


    toot.clear();

    std::vector<int> v;
    v.push_back(1);
    v.push_back(2);
    v.push_back(3);
    v.push_back(4);
    v.push_back(5);

    toot = "array: ";
    append(toot, v, "\t", true);

    EXPECT_TRUE(toot == "array: 0: 1\t1: 2\t2: 3\t3: 4\t4: 5");

    std::vector<std::string> tokens;

    Tokenize(tokens, "ab\tcd\tefg\thi\tjk", '\t');
    EXPECT_EQ(tokens.size(), 5U);
    EXPECT_TRUE(tokens[0] == "ab");
    EXPECT_TRUE(tokens[1] == "cd");
    EXPECT_TRUE(tokens[2] == "efg");
    EXPECT_TRUE(tokens[3] == "hi");
    EXPECT_TRUE(tokens[4] == "jk");


    Tokenize(tokens, "ab\tcd\tefg\thi\tjk\t", '\t');
    EXPECT_EQ(tokens.size(), 6U);
    EXPECT_TRUE(tokens[5] == "");

    // a single tab splits two empty fields, so should see two tokens here:
    Tokenize(tokens, "\t", '\t');
    EXPECT_EQ(tokens.size(), 2U);
    EXPECT_TRUE(tokens[0] == "");
    EXPECT_TRUE(tokens[1] == "");


    Tokenize(tokens, "bahbah", '\t');
    EXPECT_EQ(tokens.size(), 1U);
    EXPECT_TRUE(tokens[0] == "bahbah");

    //
    // no data on the line is the same as a single empty field.
    // the reason is we don't want to have a file with a single
    // column of data, but two separate values for .size().  Better
    // to let the caller simply say 'if tokens[0]==""'
    //
    Tokenize(tokens, "", '\t');
    EXPECT_EQ(tokens.size(), 1U);
    EXPECT_TRUE(tokens[0] == "");

#if 0
    toot = "";
    append(toot, tokens, '\t');
    std::cout << toot << std::endl;

    exit(0);
#endif
}

//
// Variadic templates necessary for reasonable printf implementation
// are only supported as an experimental feature that in theory is
// subject to changes in the future draft standard for C++.
// 
// Only defined when the g++ option -std=c++0x is used.
//
#if defined(__GXX_EXPERIMENTAL_CXX0X__)
TEST(STLUtilitiesTestPrintf, tSTLUtilitiesTestPrintf)
{
    using namespace STLUtilities; // for overloaded std::string << operator

    std::string result;

    sprintf(result, "Hello, world!");
    EXPECT_TRUE(result=="Hello, world!");

    sprintf(result, "n = %20.5lXXX", 123ULL);
    EXPECT_TRUE(result=="n =                   7bXX");

    sprintf(result, "hello, world! %20sand boo", "well then");
    EXPECT_TRUE(result=="hello, world!            well thenand boo");

    sprintf(result, "addr = %08xXXX", 1234);
    EXPECT_TRUE(result=="addr = 000004d2XXX");

    sprintf(result, "Hello, world!! Imagine: %d!", 2345.1234);
    EXPECT_TRUE(result=="Hello, world!! Imagine: 2345.12!");

}
#endif

#ifdef _STLUTILITIES_BENCHMARK_

//
// Compare StringBasics.h String with std::string and STLUtilities append methods
//
// NB: these are mostly inline with the exception of String::operator +(char c), which
// is a function call, so as currently implemented, String is at a disadvantage.
//
// However, all of these potentially suffer from limitations in g++, as I've noticed
// that it at times is unable to inline more than a few levels of nested functions
// deep even if all are trivially short and inlined.
//

TEST(STLUtilitiesTestPrintf, Benchmark1) {
    using namespace STLUtilities; // for overloaded std::string << operator

    std::string result;
    Random random;
    int range = 'z' - 'A';
    unsigned int round = 1e6;
    Timing timing;
    random.Reset(0);
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        result << (char)('A' + ( random.NextInt() % range));
    }
    timing.end();
    std::cout << "STLUtilities " << round << " times takes " << timing.interval() << " second " << std::endl;

    String s;
    random.Reset(0);
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        s += (char)('A' + ( random.NextInt() % range));
    }
    timing.end();
    std::cout << "String " << round << " times takes " << timing.interval() << " second " << std::endl;
    EXPECT_EQ(result, s.c_str());

    std::string st;
    random.Reset(0);
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        st += (char)('A' + ( random.NextInt() % range));
    }
    timing.end();
    std::cout << "std::string " << round << " times takes " << timing.interval() << " second " << std::endl;
    EXPECT_EQ(result, st);

}

TEST(STLUtilitiesTestPrintf, Benchmark2) {
    using namespace STLUtilities; // for overloaded std::string << operator

    std::string result;
    Random random;
    unsigned int round = 1e6;
    Timing timing;
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        result = "";
        for(int j=0; j<15; j++) result << (char) 'A';
    }
    timing.end();
    std::cout << "STLUtilities " << round << " times takes " << timing.interval() << " second " << std::endl;

    String s;
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        s = "";
        for(int j=0; j<15; j++) s += 'A';
    }
    timing.end();
    std::cout << "String " << round << " times takes " << timing.interval() << " second " << std::endl;
    EXPECT_EQ(result, s.c_str());

    std::string st;
    timing.start();
    for (unsigned int i = 0; i < round; i++)
    {
        st = "";
        for(int j=0; j<15; j++) st += 'A';
    }
    timing.end();
    std::cout << "std::string " << round << " times takes " << timing.interval() << " second " << std::endl;
    EXPECT_EQ(result, st);
}

#endif /* _STLUTILITIES_BENCHMARK_ */