Blame view
src/util/stl-utils-test.cc
7.35 KB
8dcb6dfcb
first commit
|
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 265 266 267 268 269 270 271 272 273 |
// util/stl-utils-test.cc
// Copyright 2009-2012 Microsoft Corporation; Saarland University
// Johns Hopkins University (Author: Daniel Povey)
// See ../../COPYING for clarification regarding multiple authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
// WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
// MERCHANTABLITY OR NON-INFRINGEMENT.
// See the Apache 2 License for the specific language governing permissions and
// limitations under the License.
#include "base/kaldi-common.h"
#include "util/stl-utils.h"
namespace kaldi {
static void TestIsSorted() {
for (int i = 0;i < 100;i++) {
std::vector<int> vec, vec2;
int len = Rand()%5;
for (int i = 0;i < len;i++)
vec.push_back(Rand() % 10);
vec2 = vec;
std::sort(vec2.begin(), vec2.end());
KALDI_ASSERT(IsSorted(vec) == (vec == vec2));
}
}
static void TestIsSortedAndUniq() {
for (int i = 0;i < 100;i++) {
std::vector<int> vec, vec2;
int len = Rand()%5;
for (int i = 0;i < len;i++)
vec.push_back(Rand() % 10);
if (!IsSortedAndUniq(vec)) {
bool ok = false;
for (size_t i = 0; i+1 < (size_t)len; i++)
if (vec[i] >= vec[i+1]) ok = true; // found out-of-order or dup.
KALDI_ASSERT(ok);
} else { // is sorted + uniq.
for (size_t i = 0; i+1 < (size_t)len; i++)
KALDI_ASSERT(vec[i] < vec[i+1]);
}
}
}
static void TestUniq() {
for (int i = 0;i < 100;i++) {
std::vector<int> vec;
int cur = 1; // sorted order.
int len = Rand()%5;
for (int i = 0;i < len;i++) {
cur += 1 + (Rand() % 100);
vec.push_back(cur);
}
std::vector<int> vec2;
for (int i = 0;i < len;i++) {
int count = 1 + Rand()%5;
for (int j = 0;j < count;j++) vec2.push_back(vec[i]);
}
Uniq(&vec2);
KALDI_ASSERT(vec2 == vec);
}
}
static void TestSortAndUniq() {
for (int i = 0;i < 100;i++) {
std::vector<int> vec;
int len = Rand()%5;
for (int i = 0;i < len;i++) {
int n = Rand() % 100;
bool ok = true;
for (size_t j = 0;j < vec.size();j++) if (vec[j] == n) ok = false;
if (ok) vec.push_back(n);
}
// don't sort.
std::vector<int> vec2(vec); // make sure all things in "vec" represented
// in vec2.
int len2 = Rand()%10;
if (vec.size() > 0) // add more, randomly.
for (int i = 0;i < len2;i++)
vec2.push_back(vec[Rand()%vec.size()]);
SortAndUniq(&vec2);
std::sort(vec.begin(), vec.end());
KALDI_ASSERT(vec == vec2);
}
}
void TestCopySetToVector() {
for (int p = 0; p < 100; p++) {
std::set<int> st;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) st.insert(Rand() % 10);
std::vector<int> v;
CopySetToVector(st, &v);
KALDI_ASSERT(st.size() == v.size());
for (size_t i = 0;i < v.size();i++) KALDI_ASSERT(st.count(v[i]) != 0);
}
}
void TestCopyMapToVector() {
for (int p = 0; p < 100; p++) {
std::map<int, int> mp;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) mp[Rand() % 10] = Rand() % 20;
std::vector<std::pair<int, int> > v;
CopyMapToVector(mp, &v);
KALDI_ASSERT(mp.size() == v.size());
for (size_t i = 0;i < v.size();i++)
KALDI_ASSERT(mp[v[i].first] == v[i].second);
}
}
void TestCopyMapKeysToVector() {
for (int p = 0; p < 100; p++) {
std::map<int, int> mp;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) mp[Rand() % 10] = Rand() % 20;
std::vector<int> v;
CopyMapKeysToVector(mp, &v);
KALDI_ASSERT(mp.size() == v.size());
for (size_t i = 0;i < v.size();i++) KALDI_ASSERT(mp.count(v[i]) == 1);
}
}
void TestCopyMapValuesToVector() {
for (int p = 0; p < 100; p++) {
std::map<int, int> mp;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) mp[Rand() % 10] = Rand() % 20;
std::vector<int> v;
CopyMapValuesToVector(mp, &v);
KALDI_ASSERT(mp.size() == v.size());
int i = 0;
for (std::map<int, int>::iterator iter = mp.begin(); iter != mp.end();
iter++) {
KALDI_ASSERT(v[i++] == iter->second);
}
}
}
void TestCopyMapKeysToSet() {
for (int p = 0; p < 100; p++) {
std::map<int, int> mp;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) mp[Rand() % 10] = Rand() % 20;
std::vector<int> v;
std::set<int> s;
CopyMapKeysToVector(mp, &v);
CopyMapKeysToSet(mp, &s);
std::set<int> s2;
CopyVectorToSet(v, &s2);
KALDI_ASSERT(s == s2);
}
}
void TestCopyMapValuesToSet() {
for (int p = 0; p < 100; p++) {
std::map<int, int> mp;
int sz = Rand() % 20;
for (int i = 0;i < sz;i++) mp[Rand() % 10] = Rand() % 20;
std::vector<int> v;
std::set<int> s;
CopyMapValuesToVector(mp, &v);
CopyMapValuesToSet(mp, &s);
std::set<int> s2;
CopyVectorToSet(v, &s2);
KALDI_ASSERT(s == s2);
}
}
void TestContainsNullPointers() {
for (int p = 0; p < 100; p++) {
std::vector<char*> vec;
int sz = Rand() % 3;
bool is_null = false;
for (int i = 0;i < sz;i++) {
vec.push_back(reinterpret_cast<char*>(static_cast<intptr_t>(Rand() % 2)));
if (vec.back() == NULL)
is_null = true;
}
KALDI_ASSERT(is_null == ContainsNullPointers(vec));
}
}
void TestReverseVector() {
for (int p = 0; p < 100; p++) {
std::vector<int> vec;
int sz = Rand() % 5;
for (int i = 0;i < sz;i++)
vec.push_back(Rand() % 4);
std::vector<int> vec2(vec), vec3(vec);
ReverseVector(&vec2);
ReverseVector(&vec2);
KALDI_ASSERT(vec2 == vec);
ReverseVector(&vec3);
for (size_t i = 0; i < vec.size(); i++)
KALDI_ASSERT(vec[i] == vec3[vec.size()-1-i]);
}
}
void TestMergePairVectorSumming() {
for (int p = 0; p < 100; p++) {
std::vector<std::pair<int32, int16> > v;
std::map<int32, int16> m;
int sz = Rand() % 10;
for (size_t i = 0; i < sz; i++) {
int32 key = Rand() % 10;
int16 val = (Rand() % 5) - 2;
v.push_back(std::make_pair(key, val));
if (m.count(key) == 0) m[key] = val;
else
m[key] += val;
}
MergePairVectorSumming(&v);
KALDI_ASSERT(IsSorted(v));
for (size_t i = 0; i < v.size(); i++) {
KALDI_ASSERT(v[i].second == m[v[i].first]);
KALDI_ASSERT(v[i].second != 0.0);
if (i > 0) KALDI_ASSERT(v[i].first > v[i-1].first);
}
for (std::map<int32, int16>::const_iterator iter = m.begin();
iter != m.end(); ++iter) {
if (iter->second != 0) {
size_t i;
for (i = 0; i < v.size(); i++)
if (v[i].first == iter->first) break;
KALDI_ASSERT(i != v.size()); // Or we didn't find this
// key in v.
}
}
}
}
} // end namespace kaldi
int main() {
using namespace kaldi;
TestIsSorted();
TestIsSortedAndUniq();
TestUniq();
TestSortAndUniq();
TestCopySetToVector();
TestCopyMapToVector();
TestCopyMapKeysToVector();
TestCopyMapValuesToVector();
TestCopyMapKeysToSet();
TestCopyMapValuesToSet();
TestContainsNullPointers();
TestReverseVector();
TestMergePairVectorSumming();
// CopyVectorToSet implicitly tested by last 2.
std::cout << "Test OK
";
}
|