Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q11186393> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Q11186393 subject Q7035718.
- Q11186393 subject Q8475378.
- Q11186393 abstract "Template:ForA 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 without lazy 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)".
- Q11186393 wikiPageExternalLink Finger-Trees.shtml.
- Q11186393 wikiPageExternalLink monoid-fingertree.html.
- Q11186393 wikiPageExternalLink immutability-in-c-part-eleven-a-working-double-ended-queue.aspx.
- Q11186393 wikiPageExternalLink jfingertree.
- Q11186393 wikiPageExternalLink cns!44B0A32C2CCF7488!582.entry.
- Q11186393 wikiPageExternalLink the-swiss-army-knife-of-data-structures-in-c.
- Q11186393 wikiPageExternalLink Data-Edison-Concrete-FingerTree.html.
- Q11186393 wikiPageExternalLink FingerTree.html.
- Q11186393 wikiPageExternalLink data.finger-tree.
- Q11186393 wikiPageExternalLink FingerTree.scala.
- Q11186393 wikiPageWikiLink Q1131652.
- Q11186393 wikiPageWikiLink Q131212.
- Q11186393 wikiPageWikiLink Q175263.
- Q11186393 wikiPageWikiLink Q208237.
- Q11186393 wikiPageWikiLink Q212587.
- Q11186393 wikiPageWikiLink Q2427787.
- Q11186393 wikiPageWikiLink Q300159.
- Q11186393 wikiPageWikiLink Q3229792.
- Q11186393 wikiPageWikiLink Q331716.
- Q11186393 wikiPageWikiLink Q34010.
- Q11186393 wikiPageWikiLink Q3410945.
- Q11186393 wikiPageWikiLink Q3571162.
- Q11186393 wikiPageWikiLink Q573952.
- Q11186393 wikiPageWikiLink Q629283.
- Q11186393 wikiPageWikiLink Q7035718.
- Q11186393 wikiPageWikiLink Q8475378.
- Q11186393 comment "Template:ForA 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.".
- Q11186393 label "Finger tree".