One list per file.
Unlimited strings per list.
Unlimited string lengths.
Any kind of data stored as strings, nulls OK.
Update: I will be updating the Cache Class and String Class to a more simple version.
(it's also a file-based string stack OR file-based string queue)
Each list item can hold two strings, second string may be ignored; pass null string.
(blocks need to be powers of 2, there was an extra 4 bytes in list item node; might as well use it)
The list is mainly to test the File Cache Class and the File String Class.
The File Cache Class keeps file blocks in memory for fast access.
The File String Class uses the cache for fast access to strings.
More than one cache object may be used on same file.
High priority structures given high cache maximum value; nodes, key strings, etc…
You can download the entire source files, and test app, at the bottom of the page;
File Based String List Class: FStrList1.zip.
There are 7 include files - too many to post.
Public domain; use at your own risk.
Unlimited strings per list.
Unlimited string lengths.
Any kind of data stored as strings, nulls OK.
Update: I will be updating the Cache Class and String Class to a more simple version.
(it's also a file-based string stack OR file-based string queue)
Each list item can hold two strings, second string may be ignored; pass null string.
(blocks need to be powers of 2, there was an extra 4 bytes in list item node; might as well use it)
The list is mainly to test the File Cache Class and the File String Class.
The File Cache Class keeps file blocks in memory for fast access.
The File String Class uses the cache for fast access to strings.
More than one cache object may be used on same file.
High priority structures given high cache maximum value; nodes, key strings, etc…
You can download the entire source files, and test app, at the bottom of the page;
File Based String List Class: FStrList1.zip.
There are 7 include files - too many to post.
Public domain; use at your own risk.
Comment