aboutsummaryrefslogtreecommitdiff
path: root/paludis/util/fast_unique_copy_TEST.cc
blob: 95a55918d6d7c92b000751a0ebe2203b6f044e9f (plain)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/* vim: set sw=4 sts=4 et foldmethod=syntax : */

/*
 * Copyright (c) 2006, 2007 Ciaran McCreesh <ciaranm@ciaranm.org>
 *
 * This file is part of the Paludis package manager. Paludis is free software;
 * you can redistribute it and/or modify it under the terms of the GNU General
 * Public License version 2, as published by the Free Software Foundation.
 *
 * Paludis is distributed in the hope that it will be useful, but WITHOUT ANY
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
 * Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include "fast_unique_copy.hh"
#include <test/test_framework.hh>
#include <test/test_runner.hh>
#include <paludis/util/join.hh>
#include <vector>

using namespace test;
using namespace paludis;

namespace test_cases
{
    struct FastUniqueCopySimpleSequenceTest : TestCase
    {
        FastUniqueCopySimpleSequenceTest() : TestCase("fast_unique_copy simple sequence") { }

        void run()
        {
            for (unsigned sz = 0 ; sz < 20 ; ++sz)
            {
                TestMessageSuffix s("sz=" + stringify(sz));
                std::vector<unsigned> v;
                for (unsigned x = 0 ; x < sz ; ++x)
                    v.push_back(x);

                std::vector<unsigned> r;
                fast_unique_copy(v.begin(), v.end(), std::back_inserter(r), std::less<int>());

                TestMessageSuffix vs("v=" + join(v.begin(), v.end(), ","));
                TestMessageSuffix rs("r=" + join(r.begin(), r.end(), ","));

                TEST_CHECK_EQUAL(r.size(), sz);
                for (unsigned x = 0 ; x < sz ; ++x)
                    TEST_CHECK_EQUAL(r[x], x);
            }
        }

    } test_fast_unique_copy_simple_sequence;

    struct FastUniqueCopyRepeatedElementTest : TestCase
    {
        FastUniqueCopyRepeatedElementTest() : TestCase("fast_unique_copy single repeated element") { }

        void run()
        {
            for (unsigned sz = 0 ; sz < 20 ; ++sz)
            {
                TestMessageSuffix s("sz=" + stringify(sz));
                std::vector<unsigned> v;
                for (unsigned x = 0 ; x < sz ; ++x)
                    v.push_back(42);

                std::vector<unsigned> r;
                fast_unique_copy(v.begin(), v.end(), std::back_inserter(r));

                TestMessageSuffix vs("v=" + join(v.begin(), v.end(), ","));
                TestMessageSuffix rs("r=" + join(r.begin(), r.end(), ","));

                if (sz == 0)
                    TEST_CHECK_EQUAL(r.size(), std::size_t(0));
                else
                {
                    TEST_CHECK_EQUAL(r.size(), std::size_t(1));
                    TEST_CHECK_EQUAL(r[0], 42u);
                }
            }
        }

    } test_fast_unique_copy_repeated_element;

    struct FastUniqueCopyNxNTest : TestCase
    {
        FastUniqueCopyNxNTest() : TestCase("fast_unique_copy nxn") { }

        void run()
        {
            for (unsigned sz = 0 ; sz < 20 ; ++sz)
            {
                TestMessageSuffix s("sz=" + stringify(sz));
                std::vector<unsigned> v;
                for (unsigned x = 0 ; x < sz ; ++x)
                    for (unsigned y = 0 ; y < x ; ++y)
                        v.push_back(x);

                std::vector<unsigned> r;
                fast_unique_copy(v.begin(), v.end(), std::back_inserter(r));

                TestMessageSuffix vs("v=" + join(v.begin(), v.end(), ","));
                TestMessageSuffix rs("r=" + join(r.begin(), r.end(), ","));
                if (sz == 0)
                    TEST_CHECK_EQUAL(r.size(), std::size_t(0));
                else
                {
                    TEST_CHECK_EQUAL(r.size(), sz - 1);
                    for (unsigned x = 0 ; x < sz - 1 ; ++x)
                        TEST_CHECK_EQUAL(r[x], x + 1);
                }
            }
        }

    } test_fast_unique_copy_nxn;
}