How to Install and Uninstall node-functional-red-black-tree Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 18,2024

1. Install "node-functional-red-black-tree" package

Here is a brief guide to show you how to install node-functional-red-black-tree on Ubuntu 21.10 (Impish Indri)

$ sudo apt update $ sudo apt install node-functional-red-black-tree

2. Uninstall "node-functional-red-black-tree" package

This tutorial shows how to uninstall node-functional-red-black-tree on Ubuntu 21.10 (Impish Indri):

$ sudo apt remove node-functional-red-black-tree $ sudo apt autoclean && sudo apt autoremove

3. Information about the node-functional-red-black-tree package on Ubuntu 21.10 (Impish Indri)

Package: node-functional-red-black-tree
Architecture: all
Version: 1.0.1+20181105-4
Multi-Arch: foreign
Priority: optional
Section: universe/javascript
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Javascript Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 54
Depends: nodejs
Filename: pool/universe/n/node-functional-red-black-tree/node-functional-red-black-tree_1.0.1+20181105-4_all.deb
Size: 12956
MD5sum: 0d90c97c4194375df1412272fb3a7177
SHA1: 5d8d2612d6c8feba45fcea4c3756b41d4ff53b4f
SHA256: 2a8571b971d43e7889524850639fbd26f9f261ba294fd38cd0c4b7c4ce94abba
SHA512: d73e02a0ae3eae70c842936cc31b4a6229ac8fec750790df0b9d0bf1662412a939be7dc4973a69317ac9639048af4ec4b25c57d105fc4423c439b04969debf6d
Homepage: https://github.com/mikolalysenko/functional-red-black-tree
Description-en: fully persistent balanced binary search tree - Node.js 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 with Node.js -
an event-based server-side JavaScript engine.
Description-md5: 8b52b6529fbf208c5858092c86fd98dc