| 1 |
Source: node-functional-red-black-tree |
| 2 |
Section: javascript |
| 3 |
Maintainer: Debian Javascript Maintainers <[email protected]> |
| 4 |
Uploaders: |
| 5 |
Jonas Smedegaard <[email protected]>, |
| 6 |
Build-Depends: |
| 7 |
brotli, |
| 8 |
node-tape <!nocheck>, |
| 9 |
debhelper-compat (= 13), |
| 10 |
pandoc <!nodoc>, |
| 11 |
pigz, |
| 12 |
uglifyjs (>= 3), |
| 13 |
Standards-Version: 4.7.3 |
| 14 |
Homepage: https://github.com/mikolalysenko/functional-red-black-tree |
| 15 |
Vcs-Browser: https://salsa.debian.org/js-team/node-functional-red-black-tree |
| 16 |
Vcs-Git: https://salsa.debian.org/js-team/node-functional-red-black-tree.git |
| 17 |
|
| 18 |
Package: node-functional-red-black-tree |
| 19 |
Architecture: all |
| 20 |
Multi-Arch: foreign |
| 21 |
Depends: |
| 22 |
nodejs:any, |
| 23 |
${misc:Depends}, |
| 24 |
Description: fully persistent balanced binary search tree - Node.js library |
| 25 |
Functional-red-black-tree is a fully persistent red-black tree |
| 26 |
written 100% in JavaScript. |
| 27 |
. |
| 28 |
Functional (or fully persistent) data structures |
| 29 |
allow for non-destructive updates. |
| 30 |
So if you insert an element into the tree, |
| 31 |
it returns a new tree with the inserted element |
| 32 |
rather than destructively updating the existing tree in place. |
| 33 |
Doing this requires using extra memory, |
| 34 |
and if one were naive it could cost as much as reallocating the entire tree. |
| 35 |
Instead, this data structure saves some memory |
| 36 |
by recycling references to previously allocated subtrees. |
| 37 |
This requires using only O(log(n)) additional memory per update |
| 38 |
instead of a full O(n) copy. |
| 39 |
. |
| 40 |
Some advantages of this is |
| 41 |
that it is possible to apply insertions and removals to the tree |
| 42 |
while still iterating over previous versions of the tree. |
| 43 |
Functional and persistent data structures can also be useful |
| 44 |
in many geometric algorithms |
| 45 |
like point location within triangulations or ray queries, |
| 46 |
and can be used to analyze the history of executing various algorithms. |
| 47 |
This added power though comes at a cost, |
| 48 |
since it is generally a bit slower to use a functional data structure |
| 49 |
than an imperative version. |
| 50 |
However, if your application needs this behavior |
| 51 |
then you may consider using this module. |
| 52 |
. |
| 53 |
This package provides functional-red-black-tree |
| 54 |
for use with Node.js - |
| 55 |
an event-based server-side JavaScript engine. |
| 56 |
|
| 57 |
Package: libjs-functional-red-black-tree |
| 58 |
Architecture: all |
| 59 |
Multi-Arch: foreign |
| 60 |
Depends: |
| 61 |
${misc:Depends}, |
| 62 |
Recommends: |
| 63 |
javascript-common, |
| 64 |
Description: fully persistent balanced binary search tree - browser library |
| 65 |
Functional-red-black-tree is a fully persistent red-black tree |
| 66 |
written 100% in JavaScript. |
| 67 |
. |
| 68 |
Functional (or fully persistent) data structures |
| 69 |
allow for non-destructive updates. |
| 70 |
So if you insert an element into the tree, |
| 71 |
it returns a new tree with the inserted element |
| 72 |
rather than destructively updating the existing tree in place. |
| 73 |
Doing this requires using extra memory, |
| 74 |
and if one were naive it could cost as much as reallocating the entire tree. |
| 75 |
Instead, this data structure saves some memory |
| 76 |
by recycling references to previously allocated subtrees. |
| 77 |
This requires using only O(log(n)) additional memory per update |
| 78 |
instead of a full O(n) copy. |
| 79 |
. |
| 80 |
Some advantages of this is |
| 81 |
that it is possible to apply insertions and removals to the tree |
| 82 |
while still iterating over previous versions of the tree. |
| 83 |
Functional and persistent data structures can also be useful |
| 84 |
in many geometric algorithms |
| 85 |
like point location within triangulations or ray queries, |
| 86 |
and can be used to analyze the history of executing various algorithms. |
| 87 |
This added power though comes at a cost, |
| 88 |
since it is generally a bit slower to use a functional data structure |
| 89 |
than an imperative version. |
| 90 |
However, if your application needs this behavior |
| 91 |
then you may consider using this module. |
| 92 |
. |
| 93 |
This package provides functional-red-black-tree |
| 94 |
for use directly in web browsers. |