Search Results for "garbage"

...It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. ...

A programming language AL-IV (ALFOUR) is a high-level imperative object oriented programming language with minimal introduction level, easy porting to any platform claiming a very high level of safety and stability, with a controllable level of code protection, high efficiency of an executable code, full independence from a target platform, minimal enter level.

Reverse tracing exact garbage collector written in c++.

Portable smart pointer for C++11 with mark and sweep garbage collector. Both single-threaded and multi-threaded applications are supported

...The rest of the garbage collection process is managed automatically by MDX. The novel approach of allowing finalization to explicitly free memory offers the potential for improving garbage collection performance. This is achieved by moving some work from being done repetitively during every marking cycle, to being done once only when the memory's freed.