How to Install and Uninstall libkdtree++-dev Package on Ubuntu 16.04 LTS (Xenial Xerus)
Last updated: November 26,2024
1. Install "libkdtree++-dev" package
This guide covers the steps necessary to install libkdtree++-dev on Ubuntu 16.04 LTS (Xenial Xerus)
$
sudo apt update
Copied
$
sudo apt install
libkdtree++-dev
Copied
2. Uninstall "libkdtree++-dev" package
This guide let you learn how to uninstall libkdtree++-dev on Ubuntu 16.04 LTS (Xenial Xerus):
$
sudo apt remove
libkdtree++-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libkdtree++-dev package on Ubuntu 16.04 LTS (Xenial Xerus)
Package: libkdtree++-dev
Priority: optional
Section: universe/libdevel
Installed-Size: 108
Maintainer: Ubuntu Developers
Original-Maintainer: Sebastian Ramacher
Architecture: all
Source: libkdtree++
Version: 0.7.1+git20101123-4build3
Filename: pool/universe/libk/libkdtree++/libkdtree++-dev_0.7.1+git20101123-4build3_all.deb
Size: 28228
MD5sum: 972b2100fce3b61811edae111fea6bcf
SHA1: 1f0c7da711b8f4c233a4cd2203fa9ca5c54ad6b8
SHA256: d7a8096cb9f3ffe3b7e25f18b1d74646d9a8514050bb19a4ada13584fd7aac85
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
Homepage: https://alioth.debian.org/projects/libkdtree/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Priority: optional
Section: universe/libdevel
Installed-Size: 108
Maintainer: Ubuntu Developers
Original-Maintainer: Sebastian Ramacher
Architecture: all
Source: libkdtree++
Version: 0.7.1+git20101123-4build3
Filename: pool/universe/libk/libkdtree++/libkdtree++-dev_0.7.1+git20101123-4build3_all.deb
Size: 28228
MD5sum: 972b2100fce3b61811edae111fea6bcf
SHA1: 1f0c7da711b8f4c233a4cd2203fa9ca5c54ad6b8
SHA256: d7a8096cb9f3ffe3b7e25f18b1d74646d9a8514050bb19a4ada13584fd7aac85
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
Homepage: https://alioth.debian.org/projects/libkdtree/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu