123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242 |
- // Copyright 2012 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 "butil/stl_util.h"
- #include <set>
- #include <gtest/gtest.h>
- namespace {
- // Used as test case to ensure the various butil::STLXxx functions don't require
- // more than operators "<" and "==" on values stored in containers.
- class ComparableValue {
- public:
- explicit ComparableValue(int value) : value_(value) {}
- bool operator==(const ComparableValue& rhs) const {
- return value_ == rhs.value_;
- }
- bool operator<(const ComparableValue& rhs) const {
- return value_ < rhs.value_;
- }
- private:
- int value_;
- };
- }
- namespace butil {
- namespace {
- TEST(STLUtilTest, STLIsSorted) {
- {
- std::set<int> set;
- set.insert(24);
- set.insert(1);
- set.insert(12);
- EXPECT_TRUE(STLIsSorted(set));
- }
- {
- std::set<ComparableValue> set;
- set.insert(ComparableValue(24));
- set.insert(ComparableValue(1));
- set.insert(ComparableValue(12));
- EXPECT_TRUE(STLIsSorted(set));
- }
- {
- std::vector<int> vector;
- vector.push_back(1);
- vector.push_back(1);
- vector.push_back(4);
- vector.push_back(64);
- vector.push_back(12432);
- EXPECT_TRUE(STLIsSorted(vector));
- vector.back() = 1;
- EXPECT_FALSE(STLIsSorted(vector));
- }
- }
- TEST(STLUtilTest, STLSetDifference) {
- std::set<int> a1;
- a1.insert(1);
- a1.insert(2);
- a1.insert(3);
- a1.insert(4);
- std::set<int> a2;
- a2.insert(3);
- a2.insert(4);
- a2.insert(5);
- a2.insert(6);
- a2.insert(7);
- {
- std::set<int> difference;
- difference.insert(1);
- difference.insert(2);
- EXPECT_EQ(difference, STLSetDifference<std::set<int> >(a1, a2));
- }
- {
- std::set<int> difference;
- difference.insert(5);
- difference.insert(6);
- difference.insert(7);
- EXPECT_EQ(difference, STLSetDifference<std::set<int> >(a2, a1));
- }
- {
- std::vector<int> difference;
- difference.push_back(1);
- difference.push_back(2);
- EXPECT_EQ(difference, STLSetDifference<std::vector<int> >(a1, a2));
- }
- {
- std::vector<int> difference;
- difference.push_back(5);
- difference.push_back(6);
- difference.push_back(7);
- EXPECT_EQ(difference, STLSetDifference<std::vector<int> >(a2, a1));
- }
- }
- TEST(STLUtilTest, STLSetUnion) {
- std::set<int> a1;
- a1.insert(1);
- a1.insert(2);
- a1.insert(3);
- a1.insert(4);
- std::set<int> a2;
- a2.insert(3);
- a2.insert(4);
- a2.insert(5);
- a2.insert(6);
- a2.insert(7);
- {
- std::set<int> result;
- result.insert(1);
- result.insert(2);
- result.insert(3);
- result.insert(4);
- result.insert(5);
- result.insert(6);
- result.insert(7);
- EXPECT_EQ(result, STLSetUnion<std::set<int> >(a1, a2));
- }
- {
- std::set<int> result;
- result.insert(1);
- result.insert(2);
- result.insert(3);
- result.insert(4);
- result.insert(5);
- result.insert(6);
- result.insert(7);
- EXPECT_EQ(result, STLSetUnion<std::set<int> >(a2, a1));
- }
- {
- std::vector<int> result;
- result.push_back(1);
- result.push_back(2);
- result.push_back(3);
- result.push_back(4);
- result.push_back(5);
- result.push_back(6);
- result.push_back(7);
- EXPECT_EQ(result, STLSetUnion<std::vector<int> >(a1, a2));
- }
- {
- std::vector<int> result;
- result.push_back(1);
- result.push_back(2);
- result.push_back(3);
- result.push_back(4);
- result.push_back(5);
- result.push_back(6);
- result.push_back(7);
- EXPECT_EQ(result, STLSetUnion<std::vector<int> >(a2, a1));
- }
- }
- TEST(STLUtilTest, STLSetIntersection) {
- std::set<int> a1;
- a1.insert(1);
- a1.insert(2);
- a1.insert(3);
- a1.insert(4);
- std::set<int> a2;
- a2.insert(3);
- a2.insert(4);
- a2.insert(5);
- a2.insert(6);
- a2.insert(7);
- {
- std::set<int> result;
- result.insert(3);
- result.insert(4);
- EXPECT_EQ(result, STLSetIntersection<std::set<int> >(a1, a2));
- }
- {
- std::set<int> result;
- result.insert(3);
- result.insert(4);
- EXPECT_EQ(result, STLSetIntersection<std::set<int> >(a2, a1));
- }
- {
- std::vector<int> result;
- result.push_back(3);
- result.push_back(4);
- EXPECT_EQ(result, STLSetIntersection<std::vector<int> >(a1, a2));
- }
- {
- std::vector<int> result;
- result.push_back(3);
- result.push_back(4);
- EXPECT_EQ(result, STLSetIntersection<std::vector<int> >(a2, a1));
- }
- }
- TEST(STLUtilTest, STLIncludes) {
- std::set<int> a1;
- a1.insert(1);
- a1.insert(2);
- a1.insert(3);
- a1.insert(4);
- std::set<int> a2;
- a2.insert(3);
- a2.insert(4);
- std::set<int> a3;
- a3.insert(3);
- a3.insert(4);
- a3.insert(5);
- EXPECT_TRUE(STLIncludes<std::set<int> >(a1, a2));
- EXPECT_FALSE(STLIncludes<std::set<int> >(a1, a3));
- EXPECT_FALSE(STLIncludes<std::set<int> >(a2, a1));
- EXPECT_FALSE(STLIncludes<std::set<int> >(a2, a3));
- EXPECT_FALSE(STLIncludes<std::set<int> >(a3, a1));
- EXPECT_TRUE(STLIncludes<std::set<int> >(a3, a2));
- }
- } // namespace
- } // namespace butil
|