How to Install and Uninstall libjs-functional-red-black-tree Package on Ubuntu 21.10 (Impish Indri)
Last updated: November 07,2024
1. Install "libjs-functional-red-black-tree" package
Learn how to install libjs-functional-red-black-tree on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
libjs-functional-red-black-tree
Copied
2. Uninstall "libjs-functional-red-black-tree" package
This is a short guide on how to uninstall libjs-functional-red-black-tree on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
libjs-functional-red-black-tree
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libjs-functional-red-black-tree package on Ubuntu 21.10 (Impish Indri)
Package: libjs-functional-red-black-tree
Architecture: all
Version: 1.0.1+20181105-4
Multi-Arch: foreign
Priority: optional
Section: universe/javascript
Source: node-functional-red-black-tree
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Javascript Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 86
Recommends: javascript-common
Filename: pool/universe/n/node-functional-red-black-tree/libjs-functional-red-black-tree_1.0.1+20181105-4_all.deb
Size: 23908
MD5sum: df00e8f85ceeb2006285f23281c49aa3
SHA1: 9fc993517550dcf6cd6ba7db4a074885555da613
SHA256: 54594d4cf4a692d4a23221b03bb8074be15c638ae01d726e1bb19fa43a915354
SHA512: 5cd06032f8e44e5bccaab31452224adcca49792a7029cb915bc88a18791e3186ef7d16c904edb9de066515c6c7439650c2119a9bd21755df4fe4fc043339419e
Homepage: https://github.com/mikolalysenko/functional-red-black-tree
Description-en: fully persistent balanced binary search tree - browser library
Functional-red-black-tree is a fully persistent red-black tree
written 100% in JavaScript.
.
Functional (or fully persistent) data structures
allow for non-destructive updates.
So if you insert an element into the tree,
it returns a new tree with the inserted element
rather than destructively updating the existing tree in place.
Doing this requires using extra memory,
and if one were naive it could cost as much as reallocating the entire tree.
Instead, this data structure saves some memory
by recycling references to previously allocated subtrees.
This requires using only O(log(n)) additional memory per update
instead of a full O(n) copy.
.
Some advantages of this is
that it is possible to apply insertions and removals to the tree
while still iterating over previous versions of the tree.
Functional and persistent data structures can also be useful
in many geometric algorithms
like point location within triangulations or ray queries,
and can be used to analyze the history of executing various algorithms.
This added power though comes at a cost,
since it is generally a bit slower to use a functional data structure
than an imperative version.
However, if your application needs this behavior
then you may consider using this module.
.
This package provides functional-red-black-tree
for use directly in web browsers.
Description-md5: 86500e9c963e53160fc6a57d43e54041
Architecture: all
Version: 1.0.1+20181105-4
Multi-Arch: foreign
Priority: optional
Section: universe/javascript
Source: node-functional-red-black-tree
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Javascript Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 86
Recommends: javascript-common
Filename: pool/universe/n/node-functional-red-black-tree/libjs-functional-red-black-tree_1.0.1+20181105-4_all.deb
Size: 23908
MD5sum: df00e8f85ceeb2006285f23281c49aa3
SHA1: 9fc993517550dcf6cd6ba7db4a074885555da613
SHA256: 54594d4cf4a692d4a23221b03bb8074be15c638ae01d726e1bb19fa43a915354
SHA512: 5cd06032f8e44e5bccaab31452224adcca49792a7029cb915bc88a18791e3186ef7d16c904edb9de066515c6c7439650c2119a9bd21755df4fe4fc043339419e
Homepage: https://github.com/mikolalysenko/functional-red-black-tree
Description-en: fully persistent balanced binary search tree - browser library
Functional-red-black-tree is a fully persistent red-black tree
written 100% in JavaScript.
.
Functional (or fully persistent) data structures
allow for non-destructive updates.
So if you insert an element into the tree,
it returns a new tree with the inserted element
rather than destructively updating the existing tree in place.
Doing this requires using extra memory,
and if one were naive it could cost as much as reallocating the entire tree.
Instead, this data structure saves some memory
by recycling references to previously allocated subtrees.
This requires using only O(log(n)) additional memory per update
instead of a full O(n) copy.
.
Some advantages of this is
that it is possible to apply insertions and removals to the tree
while still iterating over previous versions of the tree.
Functional and persistent data structures can also be useful
in many geometric algorithms
like point location within triangulations or ray queries,
and can be used to analyze the history of executing various algorithms.
This added power though comes at a cost,
since it is generally a bit slower to use a functional data structure
than an imperative version.
However, if your application needs this behavior
then you may consider using this module.
.
This package provides functional-red-black-tree
for use directly in web browsers.
Description-md5: 86500e9c963e53160fc6a57d43e54041