2002-06-28 Phil Edwards <pme@gcc.gnu.org>

	PR libstdc++/7157, PR libstdc++/7158, PR libstdc++/7161
	* include/std/std_queue.h:  Include deque.tcc, vector.tcc.
	* include/std/std_stack.h:  Include deque.tcc.
	* testsuite/23_containers/adaptors.cc:  New file.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@55090 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 79 insertions, 0 deletions

diff --git a/libstdc++-v3/testsuite/23_containers/adaptors.cc b/libstdc++-v3/testsuite/23_containers/adaptors.cc
new file mode 100644
index 00000000000..e0bd8618300
--- /dev/null
+++ b/libstdc++-v3/testsuite/23_containers/adaptors.cc
@@ -0,0 +1,79 @@
+// 2002-06-28 pme
+
+// Copyright (C) 2002 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 2, 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 COPYING.  If not, write to the Free
+// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+// USA.
+
+// 23.2.3 container adaptros
+
+#include <queue>
+#include <stack>
+#include <testsuite_hooks.h>
+
+// libstdc++/7157
+void
+test01()
+{
+  std::queue<int> q;
+
+  q.push(1);
+  q.front();
+  q.pop();
+}
+
+
+// libstdc++/7158
+void
+test02()
+{
+  std::stack<int> st;
+
+  st.push(1);
+  st.top() = 42;
+  st.pop();
+}
+
+
+// libstdc++/7161
+void
+test03()
+{
+  int data[] = {1, 2, 3};
+  std::priority_queue<int> pq;
+  std::size_t size = pq.size();
+
+  for (int i = 0; i < 3; ++i)
+    pq.push(data[i]);
+
+  size = pq.size();
+  pq.top();
+  for (int i = 0; i < 2; ++i)
+    pq.pop();
+
+  while (!pq.empty())
+    pq.pop();
+}
+
+
+int main()
+{
+  test01();
+  test02();
+  test03();
+
+  return 0;
+}