About: Finger tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Finger tree Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Structure105726345, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FFinger_tree&invfp=IFP_OFF&sas=SAME_AS_OFF

In computer science, a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, which is where data is stored, and concatenation and splitting logarithmic time in the size of the smaller piece. It 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.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:WikicatFunctionalDataStructures yago:Structure105726345
rdfs:label	Finger tree (en) 2-3 フィンガーツリー (ja)
rdfs:comment	In computer science, a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, which is where data is stored, and concatenation and splitting logarithmic time in the size of the smaller piece. It 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. (en) 2-3フィンガーツリー(2-3 finger tree、または単にfinger tree)とは、列を表す永続データ構造の一種であり、で両端への追加・削除が可能であり、対数時間で連結・分割・挿入が可能である。また、分割演算を変更すると優先度付きキューや探索木などを実装できる。2006年にRalf HinzeとRoss Patersonが発表した。関数型プログラミング言語などで使われる。Haskellでは、containersパッケージに列に特化した実装のData.Sequenceが含まれ、列に限定しない汎用の実装もfingertreeパッケージとして存在する。Scalaでは標準ライブラリには含まれていないが、scalazなどのライブラリなどで実装されている。その他、様々なプログラミング言語で実装されている。 (ja)
foaf:depiction
dcterms:subject	Amortized data structures Functional data structures Trees (data structures)
Wikipage page ID	15262012 (xsd:integer)
Wikipage revision ID	1090059932 (xsd:integer)
Link from a Wikipage to another Wikipage	Amortized data structures Persistent data structure Double-ended queue Interval tree Coq Monoid Computer science Functional data structures Leonidas J. Guibas Priority queue Lazy evaluation 2-3 tree Purely functional data structure Haskell Isabelle (proof assistant) Trees (data structures) Zipper (data structure) OCaml Finger search tree Amortized constant time Ordered sequence AVL trees
Link from a Wikipage to an external page	http://apfelmus.nfshost.com/monoid-fingertree.html http://dnovatchev.wordpress.com/2008/07/20/the-swiss-army-knife-of-data-structures-in-c/ http://www.soi.city.ac.uk/~ross/papers/FingerTree.html http://hackage.haskell.org/packages/archive/EdisonCore/1.2.1.1/doc/html/Data-Edison-Concrete-FingerTree.html https://github.com/clojure/data.finger-tree https://github.com/scalaz/scalaz/blob/4bacca9d9aba7c2f0f613c3e5e57d3442b652b21/core/src/main/scala/scalaz/FingerTree.scala http://blogs.msdn.com/ericlippert/archive/2008/02/12/immutability-in-c-part-eleven-a-working-double-ended-queue.aspx http://code.google.com/p/jfingertree/
sameAs	Finger tree Finger tree Finger tree Finger tree Finger tree Finger tree
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:For dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/Finger-tree-queue.gif?width=300
has abstract	In computer science, a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, which is where data is stored, and concatenation and splitting logarithmic time in the size of the smaller piece. It 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. (en) 2-3フィンガーツリー(2-3 finger tree、または単にfinger tree)とは、列を表す永続データ構造の一種であり、で両端への追加・削除が可能であり、対数時間で連結・分割・挿入が可能である。また、分割演算を変更すると優先度付きキューや探索木などを実装できる。2006年にRalf HinzeとRoss Patersonが発表した。関数型プログラミング言語などで使われる。Haskellでは、containersパッケージに列に特化した実装のData.Sequenceが含まれ、列に限定しない汎用の実装もfingertreeパッケージとして存在する。Scalaでは標準ライブラリには含まれていないが、scalazなどのライブラリなどで実装されている。その他、様々なプログラミング言語で実装されている。 (ja)
prov:wasDerivedFrom	wikipedia-en:Finger_tree?oldid=1090059932&ns=0
page length (characters) of wiki page	13719 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Finger_tree
is Link from a Wikipage to another Wikipage of	List of data structures Leonidas J. Guibas 2–3 tree Splay tree Finger search tree 2-3 finger trees Finger-tree Finger string Finger trees Fingerstring Fingertree Fingertrees
is Wikipage redirect of	2-3 finger trees Finger-tree Finger string Finger trees Fingerstring Fingertree Fingertrees
is foaf:primaryTopic of	wikipedia-en:Finger_tree

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 56 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software