C support libraries
- Thread starter goon
- Start date
There's an Array structure in now.
There's starter code of an OOP Actor library in here (with source code) :
sourceforge.net
There's starter code of an OOP Actor library in here (with source code) :
libactorc - Browse Files at SourceForge.net
libactorc files. Full list of files for libactorc, An OOP Actor library coded in C
sourceforge.net
libactorc1 is now at version 0.1.6. It should be usable and only has one malloc system call (stdlib.h/malloc.h). Source code is here : http://sf.net/p/libactorc
I will start compiling both libraries later on.
There might come a recent MacOS version of both.
I will start compiling both libraries later on.
There might come a recent MacOS version of both.
Yes, there's indeed a paid for version on the latest linux tarball.
It has a HashMap en surplus on the common tarball and is WIP.
It uses a list of values and offsets, where the offsets represent a list value addition towards the following value. A (hashmap)value has a target on the hash map, meaning a return value on the ref of the hashmap. So you backtrack enough (hashmap)offset structures to find the value on length - sum of offsets with values in between then returning the correct value if it exists (else you return 0/NULL or something).
The key indexes are a id/voidp (void*) which target 0x0000 to 0xffff on a 32 bit machine. The offsets are therein, the keys are in this range.
So you could make a binary string containing every index in that range but mine has hashmapoffset structures to diminish the length of the binary string for example.
I am always glad to use my G4 for it.
It has a HashMap en surplus on the common tarball and is WIP.
It uses a list of values and offsets, where the offsets represent a list value addition towards the following value. A (hashmap)value has a target on the hash map, meaning a return value on the ref of the hashmap. So you backtrack enough (hashmap)offset structures to find the value on length - sum of offsets with values in between then returning the correct value if it exists (else you return 0/NULL or something).
The key indexes are a id/voidp (void*) which target 0x0000 to 0xffff on a 32 bit machine. The offsets are therein, the keys are in this range.
So you could make a binary string containing every index in that range but mine has hashmapoffset structures to diminish the length of the binary string for example.
I am always glad to use my G4 for it.
Last edited: