File: is_palindrome_test.cpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (76 lines) | stat: -rw-r--r-- 2,333 bytes parent folder | download | duplicates (14)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*
  Copyright (c) Alexander Zaitsev <zamazan4ik@gmail.com>, 2016

  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/ for latest version.
*/

#include <boost/config.hpp>
#include <boost/algorithm/is_palindrome.hpp>

#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>

#include <algorithm>
#include <iostream>
#include <list>
#include <vector>


namespace ba = boost::algorithm;


template <typename T>
bool funcComparator(const T& v1, const T& v2)
{
    return v1 == v2;
}

struct functorComparator
{
    template <typename T>
    bool operator()(const T& v1, const T& v2) const
    {
        return v1 == v2;
    }
};

void test_is_palindrome()
{
    const std::list<int> empty;
    const std::vector<char> singleElement(1, 'z');
    int oddNonPalindrome[] = {3,2,2};
    const int oddPalindrome[] = {1,2,3,2,1};
    const int evenPalindrome[] = {1,2,2,1};
    int evenNonPalindrome[] = {1,4,8,8};
    const char* stringNullPtr = NULL;

    // Test a default operator==
    BOOST_CHECK ( ba::is_palindrome(empty));
    BOOST_CHECK ( ba::is_palindrome(singleElement));
    BOOST_CHECK (!ba::is_palindrome(boost::begin(oddNonPalindrome),  boost::end(oddNonPalindrome)));
    BOOST_CHECK ( ba::is_palindrome(boost::begin(oddPalindrome),     boost::end(oddPalindrome)));
    BOOST_CHECK ( ba::is_palindrome(boost::begin(evenPalindrome),    boost::end(evenPalindrome)));
    BOOST_CHECK (!ba::is_palindrome(boost::begin(evenNonPalindrome), boost::end(evenNonPalindrome)));

    //Test the custom comparators
    BOOST_CHECK ( ba::is_palindrome(empty.begin(), empty.end(), functorComparator()));
    BOOST_CHECK (!ba::is_palindrome(boost::begin(oddNonPalindrome), boost::end(oddNonPalindrome), funcComparator<int>));
    BOOST_CHECK ( ba::is_palindrome(evenPalindrome, std::equal_to<int>()));
    
    //Test C-strings like cases
    BOOST_CHECK ( ba::is_palindrome(stringNullPtr));
    BOOST_CHECK ( ba::is_palindrome(""));
    BOOST_CHECK ( ba::is_palindrome("a"));
    BOOST_CHECK ( ba::is_palindrome("abacaba", std::equal_to<char>()));
    BOOST_CHECK ( ba::is_palindrome("abba"));
    BOOST_CHECK (!ba::is_palindrome("acab"));
}

BOOST_AUTO_TEST_CASE( test_main )
{
  test_is_palindrome ();
}