Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
5
votes
1
answer
226
views
Is there a history-independent rope data structure?
I'm experimenting with a toy (functional) programming language. One of my ideas is to aggressively hash cons everything, thus representing any data structure as a single integer. In that context, data …
9
votes
Why would one ever use an Octree over a KD-tree?
what are the advantages of octrees in spatial/temporal performance or otherwise, and in what situations are they most applicable (I've heard 3D graphics programming)?
k-D trees are balanced binar …
13
votes
What are the outstanding questions in purely functional data structures?
What other purely functional data structure problems are open?
Here's one:
What is the purely functional equivalent of a weak hash table?
2
votes
How do I choose a functional dictionary data structure?
What functional dictionary data structures are important to know about?
Height-balanced binary trees and tries of them are a good all-round compromise. Also:
Patricia trees.
Hash tries.
Wh …
5
votes
Higher-order algorithms
In graph algorithms, vertices and edges are usually thought of as being plain data but they can actually be productively generalized so that they are programmatically generated on-demand.
During my P …