container/experimental/segmented_find_last_if_test.cpp

//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2025-2026. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/container for documentation.
//
//////////////////////////////////////////////////////////////////////////////

#include <boost/container/experimental/segmented_find_last_if.hpp>
#include <boost/core/lightweight_test.hpp>
#include "segmented_test_helper.hpp"
#include <boost/container/vector.hpp>

using namespace boost::container;

struct is_negative
{
   bool operator()(int x) const { return x < 0; }
};

struct equals_val
{
   int v;
   equals_val(int x) : v(x) {}
   bool operator()(int x) const { return x == v; }
};

void test_find_last_if_present()
{
   test_detail::seg_vector<int> sv;
   int a1[] = {1, -2, 3};
   int a2[] = {-4, 5, -6};
   sv.add_segment_range(a1, a1 + 3);
   sv.add_segment_range(a2, a2 + 3);

   test_detail::seg_vector<int>::iterator it =
      segmented_find_last_if(sv.begin(), sv.end(), is_negative());
   BOOST_TEST(it != sv.end());
   BOOST_TEST_EQ(*it, -6);
}

void test_find_last_if_present_first_segment()
{
   test_detail::seg_vector<int> sv;
   int a1[] = {1, -2, 3};
   int a2[] = {4, 5, 6};
   sv.add_segment_range(a1, a1 + 3);
   sv.add_segment_range(a2, a2 + 3);

   test_detail::seg_vector<int>::iterator it =
      segmented_find_last_if(sv.begin(), sv.end(), is_negative());
   BOOST_TEST(it != sv.end());
   BOOST_TEST_EQ(*it, -2);
}

void test_find_last_if_not_present()
{
   test_detail::seg_vector<int> sv;
   sv.add_segment(3, 1);
   sv.add_segment(2, 2);

   test_detail::seg_vector<int>::iterator it =
      segmented_find_last_if(sv.begin(), sv.end(), is_negative());
   BOOST_TEST(it == sv.end());
}

void test_find_last_if_empty()
{
   test_detail::seg_vector<int> sv;
   test_detail::seg_vector<int>::iterator it =
      segmented_find_last_if(sv.begin(), sv.end(), is_negative());
   BOOST_TEST(it == sv.end());
}

void test_find_last_if_non_segmented()
{
   boost::container::vector<int> v;
   v.push_back(-1);
   v.push_back(-2);
   v.push_back(3);

   boost::container::vector<int>::iterator it =
      segmented_find_last_if(v.begin(), v.end(), is_negative());
   BOOST_TEST(it != v.end());
   BOOST_TEST_EQ(*it, -2);

   v.clear();
   v.push_back(1);
   v.push_back(2);
   v.push_back(3);
   it = segmented_find_last_if(v.begin(), v.end(), is_negative());
   BOOST_TEST(it == v.end());
}

void test_find_last_if_sentinel_segmented()
{
   test_detail::seg_vector<int> sv;
   int a1[] = {1, -2, 3};
   int a2[] = {-4, 5, -6};
   sv.add_segment_range(a1, a1 + 3);
   sv.add_segment_range(a2, a2 + 3);

   test_detail::seg_vector<int>::iterator it =
      segmented_find_last_if(sv.begin(), test_detail::make_sentinel(sv.end()), is_negative());
   BOOST_TEST(it != sv.end());
   BOOST_TEST_EQ(*it, -6);
}

void test_find_last_if_sentinel_non_segmented()
{
   boost::container::vector<int> v;
   v.push_back(-1);
   v.push_back(-2);
   v.push_back(3);

   boost::container::vector<int>::iterator it =
      segmented_find_last_if(v.begin(), test_detail::make_sentinel(v.end()), is_negative());
   BOOST_TEST(it != v.end());
   BOOST_TEST_EQ(*it, -2);
}

void test_find_last_if_seg2()
{
   test_detail::seg2_vector<int> sv2;
   int a1[] = {1, -2, 3};
   int a2[] = {-4, 5, -6};
   sv2.add_flat_segment_range(a1, a1 + 3);
   sv2.add_flat_segment_range(a2, a2 + 3);

   test_detail::seg2_vector<int>::iterator it =
      segmented_find_last_if(sv2.begin(), sv2.end(), is_negative());
   BOOST_TEST(it != sv2.end());
   BOOST_TEST_EQ(*it, -6);
}

void test_find_last_if_every_position()
{
   test_detail::seg_vector<int> sv;
   int a1[] = {10, 20, 30};
   int a2[] = {40, 50};
   int a3[] = {60, 70, 80, 90};
   sv.add_segment_range(a1, a1 + 3);
   sv.add_segment_range(a2, a2 + 2);
   sv.add_segment_range(a3, a3 + 4);

   int vals[] = {10, 20, 30, 40, 50, 60, 70, 80, 90};
   const int N = 9;
   typedef test_detail::seg_vector<int>::iterator iter_t;

   iter_t expected = sv.begin();
   for(int i = 0; i < N; ++i, ++expected) {
      iter_t it = segmented_find_last_if(sv.begin(), sv.end(), equals_val(vals[i]));
      BOOST_TEST(it != sv.end());
      BOOST_TEST_EQ(*it, vals[i]);
      BOOST_TEST(it == expected);
   }
   BOOST_TEST(segmented_find_last_if(sv.begin(), sv.end(), equals_val(999)) == sv.end());
}

void test_find_last_if_every_position_seg2()
{
   test_detail::seg2_vector<int> sv2;
   int a1[] = {10, 20, 30};
   int a2[] = {40, 50};
   int a3[] = {60, 70, 80, 90};
   sv2.add_flat_segment_range(a1, a1 + 3);
   sv2.add_flat_segment_range(a2, a2 + 2);
   sv2.add_flat_segment_range(a3, a3 + 4);

   int vals[] = {10, 20, 30, 40, 50, 60, 70, 80, 90};
   const int N = 9;
   typedef test_detail::seg2_vector<int>::iterator iter_t;

   iter_t expected = sv2.begin();
   for(int i = 0; i < N; ++i, ++expected) {
      iter_t it = segmented_find_last_if(sv2.begin(), sv2.end(), equals_val(vals[i]));
      BOOST_TEST(it != sv2.end());
      BOOST_TEST_EQ(*it, vals[i]);
      BOOST_TEST(it == expected);
   }
   BOOST_TEST(segmented_find_last_if(sv2.begin(), sv2.end(), equals_val(999)) == sv2.end());
}

int main()
{
   test_find_last_if_present();
   test_find_last_if_present_first_segment();
   test_find_last_if_not_present();
   test_find_last_if_empty();
   test_find_last_if_non_segmented();
   test_find_last_if_sentinel_segmented();
   test_find_last_if_sentinel_non_segmented();
   test_find_last_if_seg2();
   test_find_last_if_every_position();
   test_find_last_if_every_position_seg2();
   return boost::report_errors();
}