This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
[Patch] libstdc++/23465
- From: Paolo Carlini <pcarlini at suse dot de>
- To: libstdc++ <libstdc++ at gcc dot gnu dot org>
- Date: Wed, 24 Aug 2005 00:58:41 +0200
- Subject: [Patch] libstdc++/23465
Hi,
the below is a complete fix for the PR. Besides implementing the
std::swap bits, I figured out that the copy_code_from call did not make
any sense, fixed the bug in the m_allocate_node call and prepared and
tested (on x86-linux) a rather general testcase.
Assuming everyone is Ok with it (Chris, in particular) I mean to commit
it tomorrow to mainline and, after a few days, 4_0-branch too.
Paolo.
///////////////////
2005-08-24 Paolo Carlini <pcarlini@suse.de>
Chris Jefferson <chris@bubblescope.net>
PR libstdc++/23465
* include/tr1/hashtable (hash_code_base::m_swap): Use
std::swap.
(hashtable<>::hashtable(const hashtable&)): Remove junk
copy_code_from call.
* testsuite/tr1/6_containers/unordered/hashtable/23465.cc: New.
Index: include/tr1/hashtable
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/tr1/hashtable,v
retrieving revision 1.6
diff -u -r1.6 hashtable
--- include/tr1/hashtable 17 Aug 2005 02:14:09 -0000 1.6
+++ include/tr1/hashtable 23 Aug 2005 22:19:24 -0000
@@ -631,9 +631,9 @@
void
m_swap(hash_code_base& x)
{
- m_extract.m_swap(x);
- m_eq.m_swap(x);
- m_ranged_hash.m_swap(x);
+ std::swap(m_extract, x.m_extract);
+ std::swap(m_eq, x.m_eq);
+ std::swap(m_ranged_hash, x.m_ranged_hash);
}
protected:
@@ -703,10 +703,10 @@
void
m_swap(hash_code_base& x)
{
- m_extract.m_swap(x);
- m_eq.m_swap(x);
- m_h1.m_swap(x);
- m_h2.m_swap(x);
+ std::swap(m_extract, x.m_extract);
+ std::swap(m_eq, x.m_eq);
+ std::swap(m_h1, x.m_h1);
+ std::swap(m_h2, x.m_h2);
}
protected:
@@ -762,10 +762,10 @@
void
m_swap(hash_code_base& x)
{
- m_extract.m_swap(x);
- m_eq.m_swap(x);
- m_h1.m_swap(x);
- m_h2.m_swap(x);
+ std::swap(m_extract, x.m_extract);
+ std::swap(m_eq, x.m_eq);
+ std::swap(m_h1, x.m_h1);
+ std::swap(m_h2, x.m_h2);
}
protected:
@@ -1271,8 +1271,7 @@
node** tail = m_buckets + i;
while (n)
{
- *tail = m_allocate_node(n);
- (*tail).copy_code_from(n);
+ *tail = m_allocate_node(n->m_v);
tail = &((*tail)->m_next);
n = n->m_next;
}
Index: testsuite/tr1/6_containers/unordered/hashtable/23465.cc
===================================================================
RCS file: testsuite/tr1/6_containers/unordered/hashtable/23465.cc
diff -N testsuite/tr1/6_containers/unordered/hashtable/23465.cc
--- /dev/null 1 Jan 1970 00:00:00 -0000
+++ testsuite/tr1/6_containers/unordered/hashtable/23465.cc 23 Aug 2005 22:19:25 -0000
@@ -0,0 +1,64 @@
+// Copyright (C) 2005 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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+// USA.
+
+// 6.3 Unordered associative containers
+
+#include <tr1/unordered_set>
+#include <testsuite_hooks.h>
+
+// libstdc++/23465
+void test01()
+{
+ bool test __attribute__((unused)) = true;
+
+ for (float lf = 0.1; lf < 1001.0; lf *= 10.0)
+ for (unsigned size = 1; size <= 19683; size *= 3)
+ {
+ std::tr1::unordered_set<int> us1, us2;
+ typedef std::tr1::unordered_set<int>::local_iterator local_iterator;
+ typedef std::tr1::unordered_set<int>::size_type size_type;
+
+ us1.max_load_factor(lf);
+
+ for (unsigned i = 0; i < size; ++i)
+ us1.insert(i);
+
+ us2 = us1;
+
+ VERIFY( us2.size() == us1.size() );
+ VERIFY( us2.bucket_count() == us1.bucket_count() );
+
+ for (size_type b = 0; b < us1.bucket_count(); ++b)
+ {
+ size_type cnt = 0;
+ for (local_iterator it1 = us1.begin(b), it2 = us2.begin(b);
+ it1 != us1.end(b) && it2 != us2.end(b); ++it1, ++it2)
+ {
+ VERIFY( *it1 == *it2 );
+ ++cnt;
+ }
+ VERIFY( cnt == us1.bucket_size(b) );
+ }
+ }
+}
+
+int main()
+{
+ test01();
+ return 0;
+}