Todo List

page Borg IV
create a general purpose source fixer, includes copyright header, defines to avoid multiple inclusion definition of namespace and namespace to use as well as a collection of standard headers to include

Member ActiveTransition::recalc_token_combinations ()
this code should be joined with the outputting of the actual datacombinations.

Member PlaceDescriptor::insert (Table table)
we need to check here whether the column order is correct

Class Smart< ReferenceCountedObject >
actually check whether we cannot create a concurrency problem.

Class Smart< ReferenceCountedObject >
actually check whether we cannot create a concurrency problem.

Class Smart< ReferenceCountedObject >
actually check whether we cannot create a concurrency problem.

Class Smart< ReferenceCountedObject >
actually check whether we cannot create a concurrency problem.

Class Smart< ReferenceCountedObject >
actually check whether we cannot create a concurrency problem.

Class StdDawnTilDusk
The standard pool should be extended with

Class StdDawnTilDusk
The standard pool should be extended with

Class StdDawnTilDusk
The standard pool should be extended with

Member StringData::StringData (QString content)
thhis should lock the values table and then look for the string as to avoid a potential removal of the string before we can increase its reference count ourselves

Member StringData::StringData (QString content)
thhis should lock the values table and then look for the string as to avoid a potential removal of the string before we can increase its reference count ourselves

Member StringData::StringData (QString content)
thhis should lock the values table and then look for the string as to avoid a potential removal of the string before we can increase its reference count ourselves

Member main
: Is somebody trying to acquire a parent lock ? We test this with a lock acquisition.

Member global_lock
: this function should be split into setting up the zone identifiers (retrieving the zoneids and removing children if the parent will be locked) and into the actual acquisition of the locks

Member main
this command must return a reasonable status which can include 'aborting' since somebody else is trying to acquire a lock higher up in the hierarchy

Member ensure_zones_exist
after weeding out duplciates such as X and X/Y

Group ao
with respect to the compiler we should allow any block outside the active section.

Group ao
the compiler should export first all the global vars and then each active object one by one.

Group ao
active objects should be able to inherit from each other. If I is an interface and A the active object that must inherit from it, then we get BA: BI and MA: MI

Group ao
with respect to the compiler we should allow any block outside the active section.

Group ao
the compiler should export first all the global vars and then each active object one by one.

Group ao
active objects should be able to inherit from each other. If I is an interface and A the active object that must inherit from it, then we get BA: BI and MA: MI

Group ao
with respect to the compiler we should allow any block outside the active section.

Group ao
the compiler should export first all the global vars and then each active object one by one.

Group ao
active objects should be able to inherit from each other. If I is an interface and A the active object that must inherit from it, then we get BA: BI and MA: MI

Group data
We should replace the template array class with the generic message class which still resides in the hatchery. There is no need to use this complicated templating since it does not make programs perform much faster. Instead we seem to loose a lot of flexibility by using these templates.

Group data
We should replace the template array class with the generic message class which still resides in the hatchery. There is no need to use this complicated templating since it does not make programs perform much faster. Instead we seem to loose a lot of flexibility by using these templates.

Group memory
we need an update-keys program to exchange the keys automatically

we should reorganize this entire structure into a local subserver that connects to a parent server. Valuse that come down are cached and values that go up are updated this should make it straightforward to optimize many of the refernce count stuff. By avoiding double notifications we can effectively increase the throughput of the program

if we work with our own memory server then we can also delete files whenever we need to and have a more optimal file storage