aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3
diff options
context:
space:
mode:
authorPaolo Carlini <pcarlini@suse.de>2006-01-09 11:37:17 +0000
committerPaolo Carlini <pcarlini@suse.de>2006-01-09 11:37:17 +0000
commit0d4fabee2948ebad6d4ec3b748ee91d9ecf28c76 (patch)
treedcaa899486398d5a63045f947a637b371fa68a10 /libstdc++-v3
parent85e1bb0c08c867d2a520823e927e239f32c24f5d (diff)
2006-01-09 Paolo Carlini <pcarlini@suse.de>
PR libstdc++/25658 * testsuite/23_containers/deque/cons/assign/1.cc: Divide sizes by 10. git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@109499 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3')
-rw-r--r--libstdc++-v3/ChangeLog6
-rw-r--r--libstdc++-v3/testsuite/23_containers/deque/cons/assign/1.cc14
2 files changed, 13 insertions, 7 deletions
diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 5e5e1b86ffd..34a6f9b73c3 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,9 @@
+2006-01-09 Paolo Carlini <pcarlini@suse.de>
+
+ PR libstdc++/25658
+ * testsuite/23_containers/deque/cons/assign/1.cc: Divide
+ sizes by 10.
+
2006-01-08 Paolo Carlini <pcarlini@suse.de>
PR libstdc++/22102 (insert as close to hint as possible)
diff --git a/libstdc++-v3/testsuite/23_containers/deque/cons/assign/1.cc b/libstdc++-v3/testsuite/23_containers/deque/cons/assign/1.cc
index 6b8a92c1543..df6c846064d 100644
--- a/libstdc++-v3/testsuite/23_containers/deque/cons/assign/1.cc
+++ b/libstdc++-v3/testsuite/23_containers/deque/cons/assign/1.cc
@@ -1,6 +1,6 @@
// 2005-12-12 Paolo Carlini <pcarlini@suse.de>
//
-// Copyright (C) 2005 Free Software Foundation, Inc.
+// Copyright (C) 2005, 2006 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
@@ -28,15 +28,15 @@ void test01()
bool test __attribute__((unused)) = true;
using namespace std;
- int data3[10000];
- fill(data3, data3 + 10000, 3);
+ int data3[1000];
+ fill(data3, data3 + 1000, 3);
- int data5[10000];
- fill(data5, data5 + 10000, 5);
+ int data5[1000];
+ fill(data5, data5 + 1000, 5);
- for (deque<int>::size_type i = 0; i < 10000; ++i)
+ for (deque<int>::size_type i = 0; i < 1000; ++i)
{
- deque<int> d(rand() % 5000, 1);
+ deque<int> d(rand() % 500, 1);
d.assign(i, i % 2 ? 3 : 5);
VERIFY( d.size() == i );