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
|
// Copyright 2004-present Facebook. All Rights Reserved.
#include <c10/util/irange.h>
#include <gtest/gtest.h>
using namespace ::testing;
TEST(irange_test, range_test) {
std::vector<int> test_vec;
for (const auto i : c10::irange(4, 11)) {
test_vec.push_back(i);
}
const std::vector<int> correct = {{4, 5, 6, 7, 8, 9, 10}};
ASSERT_EQ(test_vec, correct);
}
TEST(irange_test, end_test) {
std::vector<int> test_vec;
for (const auto i : c10::irange(5)) {
test_vec.push_back(i);
}
const std::vector<int> correct = {{0, 1, 2, 3, 4}};
ASSERT_EQ(test_vec, correct);
}
TEST(irange_test, neg_range_test) {
std::vector<int> test_vec;
for (const auto i : c10::irange(-2, 3)) {
test_vec.push_back(i);
}
const std::vector<int> correct = {{-2, -1, 0, 1, 2}};
ASSERT_EQ(test_vec, correct);
}
TEST(irange, empty_reverse_range_two_inputs) {
std::vector<int> test_vec;
for (const auto i : c10::irange(3, -3)) {
test_vec.push_back(i);
if (i > 20) { // Cap the number of elements we add if something goes wrong
break;
}
}
const std::vector<int> correct = {};
ASSERT_EQ(test_vec, correct);
}
TEST(irange, empty_reverse_range_one_input) {
std::vector<int> test_vec;
for (const auto i : c10::irange(-3)) {
test_vec.push_back(i);
if (i > 20) { // Cap the number of elements we add if something goes wrong
break;
}
}
const std::vector<int> correct = {};
ASSERT_EQ(test_vec, correct);
}
|
