Junxiao Shi | 5640ec8 | 2015-01-07 21:51:19 -0700 | [diff] [blame] | 1 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /** |
| 3 | * Copyright (c) 2014-2015, Regents of the University of California, |
| 4 | * Arizona Board of Regents, |
| 5 | * Colorado State University, |
| 6 | * University Pierre & Marie Curie, Sorbonne University, |
| 7 | * Washington University in St. Louis, |
| 8 | * Beijing Institute of Technology, |
| 9 | * The University of Memphis. |
| 10 | * |
| 11 | * This file is part of NFD (Named Data Networking Forwarding Daemon). |
| 12 | * See AUTHORS.md for complete list of NFD authors and contributors. |
| 13 | * |
| 14 | * NFD is free software: you can redistribute it and/or modify it under the terms |
| 15 | * of the GNU General Public License as published by the Free Software Foundation, |
| 16 | * either version 3 of the License, or (at your option) any later version. |
| 17 | * |
| 18 | * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; |
| 19 | * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR |
| 20 | * PURPOSE. See the GNU General Public License for more details. |
| 21 | * |
| 22 | * You should have received a copy of the GNU General Public License along with |
| 23 | * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>. |
| 24 | */ |
| 25 | |
| 26 | #include "core/algorithm.hpp" |
| 27 | |
| 28 | #include "tests/test-common.hpp" |
| 29 | |
| 30 | namespace nfd { |
| 31 | namespace tests { |
| 32 | |
Spyridon Mastorakis | d0381c0 | 2015-02-19 10:29:41 -0800 | [diff] [blame^] | 33 | BOOST_FIXTURE_TEST_SUITE(TestAlgorithm, BaseFixture) |
Junxiao Shi | 5640ec8 | 2015-01-07 21:51:19 -0700 | [diff] [blame] | 34 | |
| 35 | BOOST_AUTO_TEST_CASE(FindLastIf) |
| 36 | { |
| 37 | std::vector<int> vec{1, 2, 3, 4, 5, 6, 7, 8, 9}; |
| 38 | |
| 39 | int hit1 = 0; |
| 40 | std::vector<int>::const_iterator found1 = find_last_if(vec.begin(), vec.end(), |
| 41 | [&hit1] (int n) -> bool { |
| 42 | ++hit1; |
| 43 | return n % 2 == 0; |
| 44 | }); |
| 45 | BOOST_REQUIRE(found1 != vec.end()); |
| 46 | BOOST_CHECK_EQUAL(*found1, 8); |
| 47 | BOOST_CHECK_LE(hit1, vec.size()); |
| 48 | |
| 49 | int hit2 = 0; |
| 50 | std::vector<int>::const_iterator found2 = find_last_if(vec.begin(), vec.end(), |
| 51 | [&hit2] (int n) -> bool { |
| 52 | ++hit2; |
| 53 | return n < 0; |
| 54 | }); |
| 55 | BOOST_CHECK(found2 == vec.end()); |
| 56 | BOOST_CHECK_LE(hit2, vec.size()); |
| 57 | } |
| 58 | |
| 59 | BOOST_AUTO_TEST_SUITE_END() |
| 60 | |
| 61 | } // namespace tests |
| 62 | } // namespace nfd |