Search Results for "linux disk fix"

Use own (user) data section for each Linked-List-Element (LLEl) including a fix Identifier which is for search via basic Lnkdlst function (fast ID-part-search, e.g. to find all elements with a specific bit in the ID set). Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max....

This was my first attempt at a persistent (disk-based) allocator, but I aimed too high, used too many obscure C++ features and it got away from me. You will need the version of v3c mentioned in configure.ac.in to build it. Like I said, it contains lots of really obscure C++, if you're curious. This project isn't being actively maintained anymore - see it's way-cooler C/C++ replacement here at SourceForge - treedb.

Java structure that handles writing objects to / from temporary files so you can increase storage without increasing memory.

This project is unmaintaned and obsolete. For caching in .NET, refer to System.Runtime.Caching built-in library. https://docs.microsoft.com/en-us/dotnet/framework/performance/caching-in-net-framework-applications Original description: An object cache for .NET, allowing in-memory storage of arbitrary objects tospeed up network or disk access. Developers can specify an absolute expiration for objects or a maximum age that is refreshed at each access.