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

Last updated: November 07,2024

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

Please follow the guidelines below to install libjs-functional-red-black-tree on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

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

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

Please follow the guidance below to uninstall libjs-functional-red-black-tree on Kali Linux:


    
        
            $
        

        
            
                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 Kali Linux

Package: libjs-functional-red-black-tree
Source: node-functional-red-black-tree
Version: 1.0.1+20181105-7
Installed-Size: 89
Maintainer: Debian Javascript Maintainers
Architecture: all
Recommends: javascript-common
Size: 25152
SHA256: 1c53865149ce7869105d2d071876b5ef6018bf5531c9707d24fcededb153c54e
SHA1: 5fd1cce50a90bb8ac5d666c0eacdf2d26026af63
MD5sum: bb6dea17d581aba3d8f56bb7a8e0e3f4
Description: 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:
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/libjs-functional-red-black-tree_1.0.1+20181105-7_all.deb