| 1 | # -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4 |
|---|
| 2 | # $Id$ |
|---|
| 3 | |
|---|
| 4 | PortSystem 1.0 |
|---|
| 5 | |
|---|
| 6 | name google-sparsehash |
|---|
| 7 | version 1.7 |
|---|
| 8 | categories devel |
|---|
| 9 | maintainers piu.fm:a |
|---|
| 10 | platforms darwin |
|---|
| 11 | description An extremely memory-efficient hash_map implementation |
|---|
| 12 | long_description \ |
|---|
| 13 | An extremely memory-efficient hash_map implementation. 2 \ |
|---|
| 14 | bits/entry overhead! The SparseHash library contains several \ |
|---|
| 15 | hash-map implementations, including implementations that optimize \ |
|---|
| 16 | for space or speed.\ |
|---|
| 17 | \ |
|---|
| 18 | These hashtable implementations are similar in API to SGI's \ |
|---|
| 19 | hash_map class, but with different performance \ |
|---|
| 20 | characteristics. It's easy to replace hash_map by sparse_hash_map \ |
|---|
| 21 | or dense_hash_map in C++ code. |
|---|
| 22 | |
|---|
| 23 | distname sparsehash-${version} |
|---|
| 24 | homepage http://code.google.com/p/google-sparsehash/ |
|---|
| 25 | master_sites http://google-sparsehash.googlecode.com/files/ |
|---|
| 26 | |
|---|
| 27 | checksums md5 8d8033d8e3b4e792eb6313a4afae5eec |
|---|
