summaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/23_containers/list/operations/42352.cc
blob: d4ebccc98f3d5d9a52a81bd61eb48fdbd9e395cd (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
// { dg-do run { target c++11 } }

// Copyright (C) 2009-2019 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library 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 library; see the file COPYING3.  If not see
// <http://www.gnu.org/licenses/>.

#include <list>
#include <testsuite_hooks.h>

// PR libstdc++/42352
void test01()
{
  std::list<int> l{3, 2, 4, 1, 5, 9, 0, 8, 6, 7};

  l.sort();

  for (auto it = l.begin(); it != l.end(); ++it)
    {
      static int nn = 0;
      VERIFY( *it == nn++ );
    }
}

void test02()
{
  std::list<int> l{3, 2, 4, 1, 5, 9, 0, 8, 6, 7};

  struct compare
  {
    bool
    operator()(int const& one, int const& two) const
    { return one > two; }
  };

  l.sort(compare());

  for (auto it = l.begin(); it != l.end(); ++it)
    {
      static int nn = 9;
      VERIFY( *it == nn-- );
    }
}

int main()
{
  test01();
  test02();
  return 0;
}