How to Install and Uninstall node-functional-red-black-tree Package on Kali Linux

Last updated: May 17,2024

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

Learn how to install node-functional-red-black-tree on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                node-functional-red-black-tree
            
                    
    
    Copied

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

In this section, we are going to explain the necessary steps to uninstall node-functional-red-black-tree on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                node-functional-red-black-tree
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the node-functional-red-black-tree package on Kali Linux

Package: node-functional-red-black-tree
Version: 1.0.1+20181105-7
Installed-Size: 57
Maintainer: Debian Javascript Maintainers
Architecture: all
Depends: nodejs
Size: 14100
SHA256: 3111417b832a829bac41335295a4b59f5d8f20d336f2db1a60828a843aaed577
SHA1: d374fe94c66d12bdce7600db72d4734750d0b656
MD5sum: f3eff4dfe9efa4396f3ada12d1446e61
Description: 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:
Multi-Arch: foreign
Homepage: https://github.com/mikolalysenko/functional-red-black-tree
Section: javascript
Priority: optional
Filename: pool/main/n/node-functional-red-black-tree/node-functional-red-black-tree_1.0.1+20181105-7_all.deb