Ubuntu
node-functional-red-black-tree package

node-functional-red-black-tree 1.0.1+20181105-4 source package in Ubuntu

Changelog

node-functional-red-black-tree (1.0.1+20181105-4) unstable; urgency=medium

  * fix autopkgtest path hacking regexes
  * mark Multi-Arch: foreign

 -- Jonas Smedegaard <email address hidden>  Wed, 04 Dec 2019 21:32:16 +0100

Upload details

Uploaded by:
Debian Javascript Maintainers
Uploaded to:
Sid
Original maintainer:
Debian Javascript Maintainers
Architectures:
all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release universe misc

Builds

Focal: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
node-functional-red-black-tree_1.0.1+20181105-4.dsc 2.4 KiB c9131baa2e8cc99bc1dec01522dfe594ec94a355b3229cca6f3ff49d6f9b0768
node-functional-red-black-tree_1.0.1+20181105.orig.tar.gz 10.0 KiB f9ed51fe54e7a43b52c123ca9856a007f4c8da73ca28e5c9bd212758ae4611d5
node-functional-red-black-tree_1.0.1+20181105-4.debian.tar.xz 6.0 KiB a1e4ff3e2df2a9bc443b7ddf0c4802729f59e8dd5317c0953ff0993c0a0939cc

No changes file available.

Binary packages built by this source

libjs-functional-red-black-tree: 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.

node-functional-red-black-tree: 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.