File: 78346.cc

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-6
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,240 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,632; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (118 lines) | stat: -rw-r--r-- 2,900 bytes parent folder | download | duplicates (2)
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
// Copyright (C) 2017 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/>.

// { dg-do run { target c++11 } }

#include <algorithm>
#include <testsuite_hooks.h>

bool values[100];

unsigned next_id()
{
  static unsigned counter = 0;
  VERIFY(counter < 100);
  return counter++;
}

struct value
{
  int val;
  const unsigned id;

  value(int i = 0) : val(i), id(next_id()) { values[id] = true; }
  value(const value& v) : val(v.val), id(next_id()) { values[id] = true; }
  value& operator=(const value& v) { val = v.val; return *this; }
  ~value() { values[id] = false; }
};

bool operator<(const value& lhs, const value& rhs)
{
  if (!values[lhs.id])
    throw lhs.id;
  if (!values[rhs.id])
    throw rhs.id;
  return lhs.val < rhs.val;
}

bool operator==(const value& lhs, const value& rhs)
{
  if (!values[lhs.id])
    throw lhs.id;
  if (!values[rhs.id])
    throw rhs.id;
  return lhs.val == rhs.val;
}

// A forward iterator that fails to meet the requirement that for any
// two dereferenceable forward iterators, a == b implies &*a == &*b
struct stashing_iterator
{
  typedef std::forward_iterator_tag iterator_category;
  typedef value value_type;
  typedef value_type const* pointer;
  typedef value_type const& reference;
  typedef std::ptrdiff_t difference_type;

  stashing_iterator() : ptr(), stashed() { }
  stashing_iterator(pointer p) : ptr(p), stashed() { stash(); }
  stashing_iterator(const stashing_iterator&) = default;
  stashing_iterator& operator=(const stashing_iterator&) = default;

  stashing_iterator& operator++()
  {
    ++ptr;
    stash();
    return *this;
  }

  stashing_iterator operator++(int)
  {
    stashing_iterator i = *this;
    ++*this;
    return i;
  }

  reference operator*() const { return stashed; }
  pointer operator->() const { return &**this; }

  bool operator==(const stashing_iterator& i) const { return ptr == i.ptr; }
  bool operator!=(const stashing_iterator& i) const { return !(*this == i); }

private:
  void stash()
  {
    if (ptr)
      stashed = *ptr;
  }

  pointer ptr;
  value_type stashed;
};

void
test01()
{
  value s[] = { 0, 1, 2, 3, 4, 5 };
  std::search(s, s+6, stashing_iterator(s), stashing_iterator(s+4));
}

int
main()
{
  test01();
}