From 4c71e31c393e7829aba2d852912012c35d004efd Mon Sep 17 00:00:00 2001 From: David Höppner Date: Sun, 16 May 2010 15:26:18 +0200 Subject: New formula google-sparsehash An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed. These hashtable implementations are similar in API to SGI's hash_map class and the tr1 unordered_map class, but with different performance characteristics. It's easy to replace hash_map or unordered_map by sparse_hash_map or dense_hash_map in C++ code. --- Library/Formula/google-sparsehash.rb | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 Library/Formula/google-sparsehash.rb (limited to 'Library') diff --git a/Library/Formula/google-sparsehash.rb b/Library/Formula/google-sparsehash.rb new file mode 100644 index 000000000..b4484d580 --- /dev/null +++ b/Library/Formula/google-sparsehash.rb @@ -0,0 +1,13 @@ +require 'formula' + +class GoogleSparsehash