[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#1021041: marked as done (ITP: parallel-hashmap -- <insert up to 60 chars description>)

Your message dated Wed, 8 Mar 2023 09:13:55 +0200
with message-id <dd9f247a-9440-fcbc-8571-2a634fb15679@debian.org>
and subject line 1021041: accepted to unstable, closing
has caused the Debian Bug report #1021041,
regarding ITP: parallel-hashmap -- <insert up to 60 chars description>
to be marked as done.

This means that you claim that the problem has been dealt with.
If this is not the case it is now your responsibility to reopen the
Bug report if necessary, and/or fix the problem forthwith.

(NB: If you are a system administrator and have no idea what this
message is talking about, this may indicate a serious mail system
misconfiguration somewhere. Please contact owner@bugs.debian.org
immediately.)


-- 
1021041: https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=1021041
Debian Bug Tracking System
Contact owner@bugs.debian.org with problems
--- Begin Message --- 
Package: wnpp
Severity: wishlist

Subject: ITP: parallel-hashmap -- <insert up to 60 chars description>
Package: wnpp
Owner: Steffen Moeller <moeller@debian.org>
Severity: wishlist

* Package name    : parallel-hashmap
  Version         : 1.37
  Upstream Author : Copyright:
* URL             : https://github.com/greg7mdp/parallel-hashmap
* License         : Apache-2.0
  Programming Lang: C
  Description     : <insert up to 60 chars description>
 This repository aims to provide a set of excellent hash map
 implementations, as well as a btree alternative to std::map and std::set,
 with the following characteristics:
 .
 * Header only: nothing to build, just copy the parallel_hashmap directory
   to your project and you are good to go.
 * drop-in replacement for std::unordered_map, std::unordered_set,
   std::map and std::set
 * Compiler with C++11 support required, C++14 and C++17 APIs are provided
   (such as try_emplace)
 * Very efficient, significantly faster than your compiler's unordered
   map/set or Boost's, or than sparsepp
 * Memory friendly: low memory usage, although a little higher than
   sparsepp
 * Supports heterogeneous lookup
 * Easy to forward declare: just include phmap_fwd_decl.h in your header
   files to forward declare Parallel Hashmap containers [note: this does
   not work currently for hash maps with pointer keys]
 * Dump/load feature: when a flat hash map stores data that is
   std::trivially_copyable, the table can be dumped to disk and restored
   as a single array, very efficiently, and without requiring any hash
   computation. This is typically about 10 times faster than doing
   element-wise serialization to disk, but it will use 10% to 60% extra
   disk space. See examples/serialize.cc. (flat hash map/set only)
 * Tested on Windows (vs2015 & vs2017, vs2019, Intel compiler 18 and 19),
   linux (g++ 4.8.4, 5, 6, 7, 8, clang++ 3.9, 4.0, 5.0) and MacOS (g++
   and clang++) - click on travis and appveyor icons above for detailed
   test status.
 * Automatic support for boost's hash_value() method for providing the
   hash function (see examples/hash_value.h). Also default hash support
   for std::pair and std::tuple.

Remark: This package is maintained by Debian Science Maintainers at
   https://salsa.debian.org/science-team/parallel-hashmap

--- End Message ---
--- Begin Message --- 
Version: 1.3.8+ds-2

Closing an ITP bug which was not closed automatically.

Andrius

--- End Message ---
Reply to: