| 1 |
// Copyright 2002 - 2008, 2010, 2011 National Technology Engineering |
| 2 |
// Solutions of Sandia, LLC (NTESS). Under the terms of Contract |
| 3 |
// DE-NA0003525 with NTESS, the U.S. Government retains certain rights |
| 4 |
// in this software. |
| 5 |
// |
| 6 |
// Redistribution and use in source and binary forms, with or without |
| 7 |
// modification, are permitted provided that the following conditions are |
| 8 |
// met: |
| 9 |
// |
| 10 |
// * Redistributions of source code must retain the above copyright |
| 11 |
// notice, this list of conditions and the following disclaimer. |
| 12 |
// |
| 13 |
// * Redistributions in binary form must reproduce the above |
| 14 |
// copyright notice, this list of conditions and the following |
| 15 |
// disclaimer in the documentation and/or other materials provided |
| 16 |
// with the distribution. |
| 17 |
// |
| 18 |
// * Neither the name of NTESS nor the names of its contributors |
| 19 |
// may be used to endorse or promote products derived from this |
| 20 |
// software without specific prior written permission. |
| 21 |
// |
| 22 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 23 |
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 24 |
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 25 |
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 26 |
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 27 |
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 28 |
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 29 |
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 30 |
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 31 |
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 32 |
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 33 |
// |
| 34 |
|
| 35 |
#include "gtest/gtest.h" |
| 36 |
#include "stk_util/util/SortedIntersect.hpp" |
| 37 |
#include <vector> |
| 38 |
|
| 39 |
TEST( SortedIntersect, bothEmpty) |
| 40 |
{ |
| 41 |
std::vector<int> sortedVecA; |
| 42 |
std::vector<int> sortedVecB; |
| 43 |
|
| 44 |
EXPECT_FALSE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 45 |
} |
| 46 |
|
| 47 |
TEST( SortedIntersect, firstEmpty) |
| 48 |
{ |
| 49 |
std::vector<int> sortedVecA; |
| 50 |
std::vector<int> sortedVecB = {1, 2, 3}; |
| 51 |
|
| 52 |
EXPECT_FALSE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 53 |
} |
| 54 |
|
| 55 |
TEST( SortedIntersect, secondEmpty) |
| 56 |
{ |
| 57 |
std::vector<int> sortedVecA = {1, 2, 3}; |
| 58 |
std::vector<int> sortedVecB; |
| 59 |
|
| 60 |
EXPECT_FALSE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 61 |
} |
| 62 |
|
| 63 |
TEST( SortedIntersect, firstFoundInSecond) |
| 64 |
{ |
| 65 |
std::vector<int> sortedVecA = {1, 2}; |
| 66 |
std::vector<int> sortedVecB = {0, 1, 3, 5}; |
| 67 |
|
| 68 |
EXPECT_TRUE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 69 |
} |
| 70 |
|
| 71 |
TEST( SortedIntersect, firstEndSmallerThanSecondBegin) |
| 72 |
{ |
| 73 |
std::vector<int> sortedVecA = {1, 2}; |
| 74 |
std::vector<int> sortedVecB = {3, 4, 5, 6}; |
| 75 |
|
| 76 |
EXPECT_FALSE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 77 |
} |
| 78 |
|
| 79 |
TEST( SortedIntersect, firstBeginBiggerThanSecondEnd) |
| 80 |
{ |
| 81 |
std::vector<int> sortedVecA = {3, 4, 5, 6}; |
| 82 |
std::vector<int> sortedVecB = {1, 2}; |
| 83 |
|
| 84 |
EXPECT_FALSE(stk::util::sorted_intersect_any(sortedVecA.begin(), sortedVecA.end(), sortedVecB.begin(), sortedVecB.end())); |
| 85 |
} |
| 86 |
|