head 1.3; access; symbols pkgsrc-2013Q2:1.3.0.8 pkgsrc-2013Q2-base:1.3 pkgsrc-2012Q4:1.3.0.6 pkgsrc-2012Q4-base:1.3 pkgsrc-2011Q4:1.3.0.4 pkgsrc-2011Q4-base:1.3 pkgsrc-2011Q2:1.3.0.2 pkgsrc-2011Q2-base:1.3 pkgsrc-2011Q1:1.2.0.42 pkgsrc-2011Q1-base:1.2 pkgsrc-2010Q4:1.2.0.40 pkgsrc-2010Q4-base:1.2 pkgsrc-2010Q3:1.2.0.38 pkgsrc-2010Q3-base:1.2 pkgsrc-2010Q2:1.2.0.36 pkgsrc-2010Q2-base:1.2 pkgsrc-2010Q1:1.2.0.34 pkgsrc-2010Q1-base:1.2 pkgsrc-2009Q4:1.2.0.32 pkgsrc-2009Q4-base:1.2 pkgsrc-2009Q3:1.2.0.30 pkgsrc-2009Q3-base:1.2 pkgsrc-2009Q2:1.2.0.28 pkgsrc-2009Q2-base:1.2 pkgsrc-2009Q1:1.2.0.26 pkgsrc-2009Q1-base:1.2 pkgsrc-2008Q4:1.2.0.24 pkgsrc-2008Q4-base:1.2 pkgsrc-2008Q3:1.2.0.22 pkgsrc-2008Q3-base:1.2 cube-native-xorg:1.2.0.20 cube-native-xorg-base:1.2 pkgsrc-2008Q2:1.2.0.18 pkgsrc-2008Q2-base:1.2 cwrapper:1.2.0.16 pkgsrc-2008Q1:1.2.0.14 pkgsrc-2008Q1-base:1.2 pkgsrc-2007Q4:1.2.0.12 pkgsrc-2007Q4-base:1.2 pkgsrc-2007Q3:1.2.0.10 pkgsrc-2007Q3-base:1.2 pkgsrc-2007Q2:1.2.0.8 pkgsrc-2007Q2-base:1.2 pkgsrc-2007Q1:1.2.0.6 pkgsrc-2007Q1-base:1.2 pkgsrc-2006Q4:1.2.0.4 pkgsrc-2006Q4-base:1.2 pkgsrc-2006Q3:1.2.0.2 pkgsrc-2006Q3-base:1.2 pkgsrc-2006Q2:1.1.1.1.0.10 pkgsrc-2006Q2-base:1.1.1.1 pkgsrc-2006Q1:1.1.1.1.0.8 pkgsrc-2006Q1-base:1.1.1.1 pkgsrc-2005Q4:1.1.1.1.0.6 pkgsrc-2005Q4-base:1.1.1.1 pkgsrc-2005Q3:1.1.1.1.0.4 pkgsrc-2005Q3-base:1.1.1.1 pkgsrc-2005Q2:1.1.1.1.0.2 pkgsrc-2005Q2-base:1.1.1.1 pkgsrc-base:1.1.1.1 TNF:1.1.1; locks; strict; comment @# @; 1.3 date 2011.05.29.15.12.26; author cheusov; state dead; branches; next 1.2; 1.2 date 2006.08.03.19.46.42; author wiz; state Exp; branches; next 1.1; 1.1 date 2005.03.26.23.08.45; author jschauma; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2005.03.26.23.08.45; author jschauma; state Exp; branches; next ; desc @@ 1.3 log @ Add LICENSE Take maintainership Update to v1.10 == 21 January 2011 == I've just released sparsehash 1.10. This fixes a performance regression in sparsehash 1.8, where sparse_hash_map would copy hashtable keys by value even when the key was explicitly a reference. It also fixes compiler warnings from MSVC 10, which uses some c++0x features that did not interact well with sparsehash. There is no reason to upgrade unless you use references for your hashtable keys, or compile with MSVC 10. A full list of changes is described in [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.10/ChangeLog ChangeLog]. === 24 September 2010 === I've just released sparsehash 1.9. This fixes a size regression in sparsehash 1.8, where the new allocator would take up space in `sparse_hash_map`, doubling the sparse_hash_map overhead (from 1-2 bits per bucket to 3 or so). All users are encouraged to upgrade. This change also marks enums as being Plain Old Data, which can speed up hashtables with enum keys and/or values. A full list of changes is described in [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.9/ChangeLog ChangeLog]. === 29 July 2010 === I've just released sparsehash 1.8. This includes improved support for `Allocator`, including supporting the allocator constructor arg and `get_allocator()` access method. To work around a bug in gcc 4.0.x, I've renamed the static variables `HT_OCCUPANCY_FLT` and `HT_SHRINK_FLT` to `HT_OCCUPANCY_PCT` and `HT_SHRINK_PCT`, and changed their type from float to int. This should not be a user-visible change, since these variables are only used in the internal hashtable classes (sparsehash clients should use `max_load_factor()` and `min_load_factor()` instead of modifying these static variables), but if you do access these constants, you will need to change your code. Internally, the biggest change is a revamp of the test suite. It now has more complete coverage, and a more capable timing tester. There are other, more minor changes as well. A full list of changes is described in the [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.8/ChangeLog ChangeLog]. === 31 March 2010 === I've just released sparsehash 1.7. The major news here is the addition of `Allocator` support. Previously, these hashtable classes would just ignore the `Allocator` template parameter. They now respect it, and even inherit `size_type`, `pointer`, etc. from the allocator class. By default, they use a special allocator we provide that uses libc `malloc` and `free` to allocate. The hash classes notice when this special allocator is being used, and use `realloc` when it can. This means that the default allocator is significantly faster than custom allocators are likely to be (since realloc-like functionality is not supported by STL allocators). There are a few more minor changes as well. A full list of changes is described in the [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.7/ChangeLog ChangeLog]. === 11 January 2010 === I've just released sparsehash 1.6. The API has widened a bit with the addition of `deleted_key()` and `empty_key()`, which let you query what values these keys have. A few rather obscure bugs have been fixed (such as an error when copying one hashtable into another when the empty_keys differ). A full list of changes is described in the [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.6/ChangeLog ChangeLog]. === 9 May 2009 === I've just released sparsehash 1.5.1. Hot on the heels of sparsehash 1.5, this release fixes a longstanding bug in the sparsehash code, where `equal_range` would always return an empty range. It now works as documented. All sparsehash users are encouraged to upgrade. === 7 May 2009 === I've just released sparsehash 1.5. This release introduces tr1 compatibility: I've added `rehash`, `begin(i)`, and other methods that are expected to be part of the `unordered_map` API once `tr1` in introduced. This allows `sparse_hash_map`, `dense_hash_map`, `sparse_hash_set`, and `dense_hash_set` to be (almost) drop-in replacements for `unordered_map` and `unordered_set`. There is no need to upgrade unless you need this functionality, or need one of the other, more minor, changes described in the [http://google-sparsehash.googlecode.com/svn/tags/sparsehash-1.5/ChangeLog ChangeLog]. @ text @$NetBSD: patch-aa,v 1.2 2006/08/03 19:46:42 wiz Exp $ --- Makefile.in.orig 2006-07-23 19:19:48.000000000 +0300 +++ Makefile.in @@@@ -93,8 +93,8 @@@@ googleinclude_HEADERS = \ src/google/type_traits.h -docdir = $(prefix)/share/doc/$(PACKAGE)-$(VERSION) -dist_doc_DATA = AUTHORS COPYING ChangeLog INSTALL NEWS README TODO \ +docdir = $(prefix)/share/doc/$(PACKAGE) +dist_doc_DATA = \ doc/dense_hash_map.html \ doc/dense_hash_set.html \ doc/sparse_hash_map.html \ @ 1.2 log @Update to 0.4, provided by Aleksey Cheusov in PR 34063: Mon May 2 07:04:46 2005 Google Inc. * sparsehash: version 0.2 release * Preliminary support for msvc++ compilation. (csilvers) * Documentation fixes -- some example code was incomplete! (csilvers) * Minimize size of config.h to avoid other-package conflicts (csilvers) * Contribute a C-based version of sparsehash that served as the inspiration for this code. One day, I hope to clean it up and support it, but for now it's just in experimental/, for playing around with. (csilvers) * Change default namespace from std to google. (csilvers) Thu Nov 3 20:12:31 2005 Google Inc. * sparsehash: version 0.3 release * Quiet compiler warnings on some compilers. (csilvers) * Some documentation fixes: example code for dense_hash_map. (csilvers) * Fix a bug where swap() wasn't swapping delete_key(). (csilvers) * set_deleted_key() and set_empty_key() now take a key only, allowing hash-map values to be forward-declared. (csilvers) * support for std::insert_iterator (and std::inserter). (csilvers) Sun Apr 23 22:42:35 2006 Google Inc. * sparsehash: version 0.4 release * Remove POD requirement for keys and values! (austern) * Add tr1-compatible type-traits system to speed up POD ops. (austern) * Fixed const-iterator bug where postfix ++ didn't compile. (csilvers) * Fixed iterator comparison bugs where <= was incorrect. (csilvers) * Clean up config.h to keep its #defines from conflicting. (csilvers) * Big documentation sweep and cleanup. (csilvers) * Update documentation to talk more about good hash fns. (csilvers) * Fixes to compile on MSVC (working around some MSVC bugs). (rennie) * Avoid resizing hashtable on operator[] lookups (austern) @ text @d1 1 a1 1 $NetBSD: patch-aa,v 1.1.1.1 2005/03/26 23:08:45 jschauma Exp $ @ 1.1 log @Initial revision @ text @d1 1 a1 1 $NetBSD: $ d3 4 a6 4 --- Makefile.in.orig 2005-03-26 17:55:20.000000000 -0500 +++ Makefile.in 2005-03-26 17:55:46.000000000 -0500 @@@@ -92,8 +92,8 @@@@ src/google/sparsetable d9 1 a9 1 -docdir = $(prefix)/doc/$(PACKAGE)-$(VERSION) d11 2 a12 2 +docdir = $(prefix)/share/doc/html/$(PACKAGE) +dist_doc_DATA = \ @ 1.1.1.1 log @Initial import of Google SparseHash, an extremely memory-efficient hash_map implementation. with 2 bits/entry overhead! The Google SparseHash project contains several hash-map implementations in use at Google, with different performance characteristics, including an implementation that optimizes for space and one that optimizes for speed. SparseHash is a template library; there are no binaries to install. SparseHash is distributed under the terms of the BSD License. @ text @@