How to Install and Uninstall libstree Package on Kali Linux
Last updated: November 22,2024
1. Install "libstree" package
This guide covers the steps necessary to install libstree on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libstree
Copied
2. Uninstall "libstree" package
Please follow the step by step instructions below to uninstall libstree on Kali Linux:
$
sudo apt remove
libstree
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libstree package on Kali Linux
Package: libstree
Version: 0.4.2-1kali2
Architecture: amd64
Maintainer: Kali Developers
Installed-Size: 121
Depends: libc6 (>= 2.14)
Homepage: http://www.icir.org/christian/libstree/index.html
Priority: optional
Section: utils
Filename: pool/main/libs/libstree/libstree_0.4.2-1kali2_amd64.deb
Size: 27088
SHA256: 4709b54a9bfbac1e376276a3f5ac6eafd08c8f380710fdbb8b4eb6668cff685b
SHA1: 69df28ede49cb1cdc4802625e4620cb73725e9e3
MD5sum: 24dbab63d1e81465fc402a50807a0df9
Description: Generic suffix tree library
libstree is a generic suffix tree implementation, written
in C. It can handle arbitrary data structures as elements
of a string. Unlike most demo implementations, it is not
limited to simple ASCII character strings. Suffix tree
generation in libstree is highly efficient and implemented
using the algorithm by Ukkonen. This means that libstree
builds suffix trees in time linear to the length of the
strings, assuming that string element comparisons can be
done in constant time.
Description-md5:
Version: 0.4.2-1kali2
Architecture: amd64
Maintainer: Kali Developers
Installed-Size: 121
Depends: libc6 (>= 2.14)
Homepage: http://www.icir.org/christian/libstree/index.html
Priority: optional
Section: utils
Filename: pool/main/libs/libstree/libstree_0.4.2-1kali2_amd64.deb
Size: 27088
SHA256: 4709b54a9bfbac1e376276a3f5ac6eafd08c8f380710fdbb8b4eb6668cff685b
SHA1: 69df28ede49cb1cdc4802625e4620cb73725e9e3
MD5sum: 24dbab63d1e81465fc402a50807a0df9
Description: Generic suffix tree library
libstree is a generic suffix tree implementation, written
in C. It can handle arbitrary data structures as elements
of a string. Unlike most demo implementations, it is not
limited to simple ASCII character strings. Suffix tree
generation in libstree is highly efficient and implemented
using the algorithm by Ukkonen. This means that libstree
builds suffix trees in time linear to the length of the
strings, assuming that string element comparisons can be
done in constant time.
Description-md5: