trunk/libstdc++-v3/testsuite/23_containers/headers/queue/synopsis.cc

   1 // { dg-do compile }
   2
   3 // Copyright (C) 2007, 2009 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 3, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING3.  If not see
  18 // <http://www.gnu.org/licenses/>.
  19
  20 #include <queue>
  21
  22 namespace std {
  23   template <class T, class Container> class queue;
  24   template <class T, class Container>
  25     bool operator==(const queue<T, Container>& x,
  26                     const queue<T, Container>& y);
  27
  28   template <class T, class Container>
  29     bool operator< (const queue<T, Container>& x,
  30                     const queue<T, Container>& y);
  31
  32   template <class T, class Container>
  33     bool operator!=(const queue<T, Container>& x,
  34                     const queue<T, Container>& y);
  35
  36   template <class T, class Container>
  37     bool operator> (const queue<T, Container>& x,
  38                     const queue<T, Container>& y);
  39
  40   template <class T, class Container>
  41     bool operator>=(const queue<T, Container>& x,
  42                     const queue<T, Container>& y);
  43
  44   template <class T, class Container>
  45     bool operator<=(const queue<T, Container>& x,
  46                     const queue<T, Container>& y);
  47
  48   template <class T, class Container, class Compare>
  49   class priority_queue;
  50 }