Proposal for new "datastructures" package

[Daniel Kraft]

Hi Carnë and all!

As discussed on the OctConf, I would like to create a "datastructures"
package that could hold classes for (algorithmically-efficient)
datastructures like stacks, queues, heaps, trees and so on.

In particular, I would like to start it with the stack class that is
attached.  It implements a data structure that allows efficient addition
of elements to a list (at the end), without having to preallocate the
size.  Even though everything is written as m-file, it is still more
efficient than naive appending to a large matrix if the "element size"
is large enough -- see the demo.  This could have practical applications
for instance to solving PDEs with automatically-controlled timesteps.

If there are no objections, please create a new Git repository for this
package on Sourceforge.  I already have a "packaged" version of the
class ready and will push it there.  Afterwards, we can think about
extensions with other things; for instance, we could move the legacy
"dict" class from general to the new package and rework it with
classdef, among other things.

Yours,
Daniel

-- 
http://www.domob.eu/
OpenPGP: 1142 850E 6DFF 65BA 63D6  88A8 B249 2AC4 A733 0737
Namecoin: id/domob -> https://nameid.org/?name=domob
--
Done:  Arc-Bar-Cav-Hea-Kni-Ran-Rog-Sam-Tou-Val-Wiz
To go: Mon-Pri

stack.m
Description: Text Data

signature.asc
Description: OpenPGP digital signature