BlackMATov/flat.hpp
1
0
Fork 0
mirror of https://github.com/BlackMATov/flat.hpp.git synced 2025-12-15 02:12:23 +07:00
Code Issues Packages Projects Releases Wiki Activity

impl debug assets for sorted ranges

Browse Source
This commit is contained in:
Matvey Cherevko
2019-05-31 09:18:59 +07:00
parent 8fe5c749ff
commit 9038cd38e5
2 changed files with 64 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
headers/flat.hpp/detail/is_sorted.hpp
View File

@@ -10,17 +10,29 @@ namespace flat_hpp::detail
{ {
template < typename Iter, typename Compare > template < typename Iter, typename Compare >
bool is_sorted(Iter first, Iter last, Compare comp) { bool is_sorted(Iter first, Iter last, Compare comp) {
(void)first; if ( first != last ) {
(void)last; Iter next = first;
(void)comp; while ( ++next != last ) {
if ( comp(*next, *first) ) {
return false;
}
++first;
}
}
return true; return true;
} }
template < typename Iter, typename Compare > template < typename Iter, typename Compare >
bool is_sorted_unique(Iter first, Iter last, Compare comp) { bool is_sorted_unique(Iter first, Iter last, Compare comp) {
(void)first; if ( first != last ){
(void)last; Iter next = first;
(void)comp; while ( ++next != last ) {
if ( !comp(*first, *next) ) {
return false;
}
++first;
}
}
return true; return true;
} }
} }

46
untests/flat_tests.cpp Normal file
View File

@@ -0,0 +1,46 @@
/*******************************************************************************
* This file is part of the "https://github.com/blackmatov/flat.hpp"
* For conditions of distribution and use, see copyright notice in LICENSE.md
* Copyright (C) 2019, by Matvey Cherevko (blackmatov@gmail.com)
******************************************************************************/
#define CATCH_CONFIG_FAST_COMPILE
#include <catch2/catch.hpp>
#include <flat.hpp/detail/is_sorted.hpp>
using namespace flat_hpp;
namespace
{
}
TEST_CASE("flat_map_detail") {
SECTION("is_sorted") {
auto i1 = {1,2,3,4};
REQUIRE(detail::is_sorted(i1.begin(), i1.end(), std::less<int>()));
REQUIRE_FALSE(detail::is_sorted(i1.begin(), i1.end(), std::greater<int>()));
auto i2 = {4,3,2,1};
REQUIRE(detail::is_sorted(i2.begin(), i2.end(), std::greater<int>()));
REQUIRE_FALSE(detail::is_sorted(i2.begin(), i2.end(), std::less<int>()));
auto i3 = {2,1,3,4};
REQUIRE_FALSE(detail::is_sorted(i3.begin(), i3.end(), std::less<int>()));
REQUIRE_FALSE(detail::is_sorted(i3.begin(), i3.end(), std::greater<int>()));
}
SECTION("is_sorted_unique") {
auto i1 = {1,2,3,4};
auto i1d = {1,2,2,3,4};
REQUIRE(detail::is_sorted_unique(i1.begin(), i1.end(), std::less<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i1d.begin(), i1d.end(), std::less<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i1.begin(), i1.end(), std::greater<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i1d.begin(), i1d.end(), std::greater<int>()));
auto i2 = {4,3,2,1};
auto i2d = {4,3,2,1,1};
REQUIRE(detail::is_sorted_unique(i2.begin(), i2.end(), std::greater<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i2d.begin(), i2d.end(), std::greater<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i2.begin(), i2.end(), std::less<int>()));
REQUIRE_FALSE(detail::is_sorted_unique(i2d.begin(), i2d.end(), std::less<int>()));
}
}