File: robust_against_adl_on_new.pass.cpp

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (37 lines) | stat: -rw-r--r-- 1,020 bytes parent folder | download | duplicates (6) 
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
 
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// <algorithm>

#include <algorithm>
#include <functional>

#include "test_macros.h"

struct A {
    int i = 0;
    bool operator<(const A& rhs) const { return i < rhs.i; }
    static bool isEven(const A& a) { return a.i % 2 == 0; }
};

void *operator new(size_t, A*) = delete;

int main(int, char**)
{
    A a[4] = {};
    std::sort(a, a+4);
    std::sort(a, a+4, std::less<A>());
    std::partition(a, a+4, A::isEven);
    std::stable_sort(a, a+4);
    std::stable_sort(a, a+4, std::less<A>());
    std::stable_partition(a, a+4, A::isEven);
    std::inplace_merge(a, a+2, a+4);
    std::inplace_merge(a, a+2, a+4, std::less<A>());

    return 0;
}