Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Finger_tree> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- Finger_tree abstract "A finger tree is a purely functional data structure used in efficiently implementing other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, where data is stored, and also stores in each internal node the result of applying some associative operation to its descendants. This "summary" data stored in the internal nodes can be used to provide the functionality of data structures other than trees. For example, a priority queue can be implemented by labeling the internal nodes by the minimum priority of its children in the tree, or an indexed list/array can be implemented with a labeling of nodes by the count of the leaves in their children. Finger trees can provide amortized O(1) pushing, reversing, popping, O(log n) append and split; and can be adapted to be indexed or ordered sequences. And like all functional data structures, it is inherently persistent; that is, older versions of the tree are always preserved.They have since been used in the Haskell core libraries (in the implementation of Data.Sequence), and an implementation in OCaml exists which was derived from a proven-correct Coq specification; and a C# implementation of finger trees was published in 2008; the Yi text editor specializes finger trees to finger strings for efficient storage of buffer text. Finger trees can be implemented with or withoutlazy evaluation, but laziness allows for simpler implementations.They were first published in 1977 by Leonidas J. Guibas, and periodically refined since (e.g. a version using AVL trees, non-lazy finger trees, simpler 2-3 finger trees, B-Trees and so on)".
- Finger_tree wikiPageExternalLink monoid-fingertree.html.
- Finger_tree wikiPageExternalLink immutability-in-c-part-eleven-a-working-double-ended-queue.aspx.
- Finger_tree wikiPageExternalLink jfingertree.
- Finger_tree wikiPageExternalLink cns!44B0A32C2CCF7488!582.entry.
- Finger_tree wikiPageExternalLink the-swiss-army-knife-of-data-structures-in-c.
- Finger_tree wikiPageExternalLink Data-Edison-Concrete-FingerTree.html.
- Finger_tree wikiPageExternalLink FingerTree.scala.html.
- Finger_tree wikiPageExternalLink a-brief-look-at-fingertrees.
- Finger_tree wikiPageExternalLink FingerTree.html.
- Finger_tree wikiPageExternalLink data.finger-tree.
- Finger_tree wikiPageID "15262012".
- Finger_tree wikiPageRevisionID "605821607".
- Finger_tree hasPhotoCollection Finger_tree.
- Finger_tree subject Category:Functional_data_structures.
- Finger_tree subject Category:Trees_(data_structures).
- Finger_tree type Abstraction100002137.
- Finger_tree type Arrangement105726596.
- Finger_tree type Cognition100023271.
- Finger_tree type DataStructure105728493.
- Finger_tree type FunctionalDataStructures.
- Finger_tree type PsychologicalFeature100023100.
- Finger_tree type Structure105726345.
- Finger_tree comment "A finger tree is a purely functional data structure used in efficiently implementing other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, where data is stored, and also stores in each internal node the result of applying some associative operation to its descendants. This "summary" data stored in the internal nodes can be used to provide the functionality of data structures other than trees.".
- Finger_tree label "2-3 フィンガーツリー".
- Finger_tree label "Finger tree".
- Finger_tree sameAs 2-3_フィンガーツリー.
- Finger_tree sameAs m.03hnj39.
- Finger_tree sameAs Q11186393.
- Finger_tree sameAs Q11186393.
- Finger_tree sameAs Finger_tree.
- Finger_tree wasDerivedFrom Finger_tree?oldid=605821607.
- Finger_tree isPrimaryTopicOf Finger_tree.