How to Install and Uninstall libparallel-hashmap-dev Package on Kali Linux

Last updated: May 20,2024

1. Install "libparallel-hashmap-dev" package

This guide let you learn how to install libparallel-hashmap-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libparallel-hashmap-dev
            
                    
    
    Copied

2. Uninstall "libparallel-hashmap-dev" package

Learn how to uninstall libparallel-hashmap-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libparallel-hashmap-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libparallel-hashmap-dev package on Kali Linux

Package: libparallel-hashmap-dev
Source: parallel-hashmap
Version: 1.3.12+ds-1
Installed-Size: 995
Maintainer: Debian Science Maintainers
Architecture: all
Suggests: libjs-jquery, libjs-jquery-flot, libjs-jquery-mousewheel
Size: 197172
SHA256: ec19de986d95d230f296e351993564fc946cd5eb0300b843a8c7a687f1d42d14
SHA1: 1f90be6c14105cec5986f727ddd1bd476bbecf34
MD5sum: 117c5f2cc878079055741ae1dcbcaa9f
Description: header-only hash map implementation
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.
Description-md5:
Homepage: https://github.com/greg7mdp/parallel-hashmap
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/p/parallel-hashmap/libparallel-hashmap-dev_1.3.12+ds-1_all.deb