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
|
// Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "courgette/consecutive_range_visitor.h"
#include <stddef.h>
#include <string>
#include "testing/gtest/include/gtest/gtest.h"
namespace courgette {
TEST(ConsecutiveRangeVisitorTest, Basic) {
std::string s = "AAAAABZZZZOO";
ConsecutiveRangeVisitor<std::string::iterator> vis(s.begin(), s.end());
EXPECT_TRUE(vis.has_more());
EXPECT_EQ('A', *vis.cur());
EXPECT_EQ(5U, vis.repeat());
vis.advance();
EXPECT_TRUE(vis.has_more());
EXPECT_EQ('B', *vis.cur());
EXPECT_EQ(1U, vis.repeat());
vis.advance();
EXPECT_TRUE(vis.has_more());
EXPECT_EQ('Z', *vis.cur());
EXPECT_EQ(4U, vis.repeat());
vis.advance();
EXPECT_TRUE(vis.has_more());
EXPECT_EQ('O', *vis.cur());
EXPECT_EQ(2U, vis.repeat());
vis.advance();
EXPECT_FALSE(vis.has_more());
}
TEST(ConsecutiveRangeVisitorTest, UnitRanges) {
// Unsorted, no consecutive characters.
const char s[] = "elephant elephant";
ConsecutiveRangeVisitor<const char*> vis(std::begin(s), std::end(s) - 1);
for (const char* scan = &s[0]; *scan; ++scan) {
EXPECT_TRUE(vis.has_more());
EXPECT_EQ(*scan, *vis.cur());
EXPECT_EQ(1U, vis.repeat());
vis.advance();
}
EXPECT_FALSE(vis.has_more());
}
TEST(ConsecutiveRangeVisitorTest, SingleRange) {
for (size_t len = 1U; len < 10U; ++len) {
std::vector<int> v(len, 137);
ConsecutiveRangeVisitor<std::vector<int>::iterator> vis(v.begin(), v.end());
EXPECT_TRUE(vis.has_more());
EXPECT_EQ(137, *vis.cur());
EXPECT_EQ(len, vis.repeat());
vis.advance();
EXPECT_FALSE(vis.has_more());
}
}
TEST(ConsecutiveRangeVisitorTest, Empty) {
std::string s;
ConsecutiveRangeVisitor<std::string::iterator> vis(s.begin(), s.end());
EXPECT_FALSE(vis.has_more());
}
} // namespace courgette
|
