How to Install and Uninstall libkdtree++-dev Package on Kali Linux

Last updated: September 20,2024

1. Install "libkdtree++-dev" package

Please follow the guidance below to install libkdtree++-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libkdtree++-dev
            
                    
    
    Copied

2. Uninstall "libkdtree++-dev" package

Here is a brief guide to show you how to uninstall libkdtree++-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libkdtree++-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libkdtree++-dev package on Kali Linux

Package: libkdtree++-dev
Source: libkdtree++
Version: 0.7.1+git20101123-6
Installed-Size: 123
Maintainer: Debian QA Group
Architecture: all
Size: 31876
SHA256: 3e72d0f2df2333eaa9f23f3b7ce764202b9ccdeaefc52fd163733a03d7c8b222
SHA1: e9c7a14f0e501f7e82ed14ee0c383f667c7e4a3d
MD5sum: 7d3f95d5bb287c47e9057742b221a60e
Description: C++ template container implementation of kd-tree sorting
libkdtree++ is a C++ template container implementation of k-dimensional space
sorting, using a kd-tree. It:
.
- supports an unlimited number of dimensions (in theory)
- can store any data structure, provided the data structure provides
operator[0 - k-1] to access the individual dimensional
components (arrays, std::vector already do) and a std::less
implementation for the type of dimensional components
- has support for custom allocators
- implements iterators
- provides standard find as well as range queries
- has amortised O(lg n) time (O(n lg n) worst case) on most
operations (insert/erase/find optimised) and worst-case O(n) space
- provides a means to rebalance and thus optimise the tree
- exists in its own namespace
- uses STL coding style, basing a lot of the code on stl_tree.h
.
libkdtree++ only exists as a -dev package as it's only a bunch of C++ header
files. Therefore, no static or shared library is necessary, allowing for
ultimate flexibility.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/nvmd/libkdtree
Tag: devel::lang:c++, devel::library, implemented-in::c++, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/libk/libkdtree++/libkdtree++-dev_0.7.1+git20101123-6_all.deb