News in 0.3.0
-------------

Token trees:

- Recoded from scratch. Fundamental type changed from TTREE to TT. More
  object oriented design allows for backwards-compatibility even when
  huge changes are made internally.

- Ability to transparently use filesystem as data storage for large
  nodes.

- Faster node insertion. ([1] as opposed to [N], where N is the number of
  siblings on the branch).

- Hashing algorithm is RIPE-MD160.

- Lots of convenience functions.


Markup trees:

- Specializing in semantic markup representations, like XML.

- Based on token trees.


FIFO buffers:

- Major bugfixes.


Sockets:

- Re-implemented using FIFO buffers.


Communications:

- Now allow breadth-first serialization.

- Queues.


Proxies:

- Allow you to do non-blocking processing of multiple simultaneous tasks.


Token nets:

- Like token trees, but with network structure.

- Very basic.


Documentation:

- 1/3 of the references done, in HTML.


Other stuff:

- Runtime test suite.

- Beautification tools.

- Simple HTML doc skeleton generator.
