You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
53 lines
1.0 KiB
53 lines
1.0 KiB
4 months ago
|
// Copyright 2014 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 "base/containers/adapters.h"
|
||
|
|
|
||
|
|
#include <vector>
|
||
|
|
|
||
|
|
#include "testing/gtest/include/gtest/gtest.h"
|
||
|
|
|
||
|
|
namespace {
|
||
|
|
|
||
|
|
TEST(AdaptersTest, Reversed) {
|
||
|
|
std::vector<int> v;
|
||
|
|
v.push_back(3);
|
||
|
|
v.push_back(2);
|
||
|
|
v.push_back(1);
|
||
|
|
int j = 0;
|
||
|
|
for (int& i : base::Reversed(v)) {
|
||
|
|
EXPECT_EQ(++j, i);
|
||
|
|
i += 100;
|
||
|
|
}
|
||
|
|
EXPECT_EQ(103, v[0]);
|
||
|
|
EXPECT_EQ(102, v[1]);
|
||
|
|
EXPECT_EQ(101, v[2]);
|
||
|
|
}
|
||
|
|
|
||
|
|
TEST(AdaptersTest, ReversedArray) {
|
||
|
|
int v[3] = {3, 2, 1};
|
||
|
|
int j = 0;
|
||
|
|
for (int& i : base::Reversed(v)) {
|
||
|
|
EXPECT_EQ(++j, i);
|
||
|
|
i += 100;
|
||
|
|
}
|
||
|
|
EXPECT_EQ(103, v[0]);
|
||
|
|
EXPECT_EQ(102, v[1]);
|
||
|
|
EXPECT_EQ(101, v[2]);
|
||
|
|
}
|
||
|
|
|
||
|
|
TEST(AdaptersTest, ReversedConst) {
|
||
|
|
std::vector<int> v;
|
||
|
|
v.push_back(3);
|
||
|
|
v.push_back(2);
|
||
|
|
v.push_back(1);
|
||
|
|
const std::vector<int>& cv = v;
|
||
|
|
int j = 0;
|
||
|
|
for (int i : base::Reversed(cv)) {
|
||
|
|
EXPECT_EQ(++j, i);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace
|