Search Results

Search found 4 results on 1 pages for 'zippers'.

Page 1/1 | 1 

• How well do zippers perform in practice, and when should they be used?

  - by Rob

  I think that the zipper is a beautiful idea; it elegantly provides a way to walk a list or tree and make what appear to be local updates in a functional way. Asymptotically, the costs appear to be reasonable. But traversing the data structure requires memory allocation at each iteration, where a normal list or tree traversal is just pointer chasing. This seems expensive (please correct me if I am wrong). Are the costs prohibitive? And what under what circumstances would it be reasonable to use a zipper?

  Read the article

• Am I really connected to multiple networks at the same time?

  - by Zippers

  I'm using my Droid Incredible to tether and I'm using my library's WiFi and I swear I'm streaming faster than when I'm just connected to one. Am I really connected to both networks at the same time? How is this possible? Does my phone act as its own wireless adapter?

  Read the article

• Effects of changing a node in a binary tree

  - by eSKay

  Suppose I want to change the orange node in the following tree. So, the only other change I'll need to make is in the left pointer of the green node. The blue node will remain the same. Am I wrong somewhere? Because according to this article (that explains zippers), even the blue node needs to be changed. Similarly, in this picture (recolored) from the same article, why do we change the orange nodes at all (when we change x)?

  Read the article

• Is there an open source immutable dictionary for C#, with fast 'With/Without' methods?

  - by Strilanc

  I'm looking for a proper C# immutable dictionary, with fast update methods (that create a partial copy of the dictionary with slight changes). I've implemented one myself, using zippers to update a red-black tree, but it's not particularly fast. By 'immutable dictionary' I don't just mean readonly or const. I want something that has reasonably fast 'With' and 'Without', or equivalent, methods that return a thing with slight modifications without modifying the original. An example from another language is map in Scala

  Read the article

1