Search Results for "b-tree implementation"

Datahike is a durable Datalog database powered by an efficient Datalog query engine. This project started as a port of DataScript to the hitchhiker-tree. All DataScript tests are passing, but we are still working on the internals. Having said this we consider Datahike usable for medium sized projects, since DataScript is very mature and deployed in many applications and the hitchhiker-tree implementation is heavily tested through generative testing. We are building on the two projects and the storage backends for the hitchhiker-tree through konserve. ...

memfs is a JavaScript/TypeScript library that implements in-memory versions of the Node.js fs module API and the browser File System Access API. It provides adapters to convert between the Node fs API and the browser File System API, and includes utilities like printing directory trees, creating directory snapshots, and demos such as in-browser Git using an in-memory file system. This is particularly useful for testing, mocking filesystem operations, or using a file system layer inside...

olsrd is an implementation of the Optimized Link State Routing(OLSR, RFC3626) protocol. The implementation is extendable through the use of loadable plugins. Visit http://www.olsr.org for more info. <b>This sf.net page is OUTDATED!!</b> Visit www.olsr.or

Cross platform indexed file btree implementation in C#, java and Python: Commit/abort transactions, localized unicode string order, recovery of damaged files, and configurable memory footprint, hashing, prefixing, and object serialization.

Adaptations From the Avalon/JXTA World<br> a) James-JXTA (p2p email system) <br> b) IM on JXTA (Jabber)<br> c) JXTA Implementation on Avalon Framework <br>