How to Install and Uninstall libkdtree++-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 16,2024

1. Install "libkdtree++-dev" package

Please follow the steps below to install libkdtree++-dev on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libkdtree++-dev
            
                    
    
    Copied

2. Uninstall "libkdtree++-dev" package

This tutorial shows how to uninstall libkdtree++-dev on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libkdtree++-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libkdtree++-dev package on Ubuntu 21.10 (Impish Indri)

Package: libkdtree++-dev
Architecture: all
Version: 0.7.1+git20101123-5build3
Priority: optional
Section: universe/libdevel
Source: libkdtree++
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian QA Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 108
Filename: pool/universe/libk/libkdtree++/libkdtree++-dev_0.7.1+git20101123-5build3_all.deb
Size: 28404
MD5sum: 30c9a40dfe6f8fb64b3c4784bcfc7688
SHA1: bb381af42b4442467e7928ccb6a9650db31abb4e
SHA256: 91f5101fe08ebdb64b549019a06061e59dc99525ac1f3e3515de8deebf3d2b20
SHA512: e2d8eaf4ba13173da579bda194b6afc0c39c9f4f3c23798241cb7e48e389c4fb9fa9e10d6375e7124bcd8527b0e97022c744c838d304ddf5588a7a8e7008b629
Homepage: https://alioth.debian.org/projects/libkdtree/
Description-en: 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: f2b5ff5c3b424919637540e27417235b