Clean up periodic cleaning and merging of lists. Now we have a list of dirty posting lists, which can be merged periodically. This is a lot better than iterating over the entire hashmap, and finding dirty lists there. Also, allow for clog to be nil, to make loading fast.

Use cache for streaming entries instead of opening files for each posting list. Use iterator instead of channel while streaming entries.

Loads of fixes and tweaks to make data loading work. Largely, the system is really fast in inserting data, but memory becomes a problem. So, running continuous memory checks, and if the db exceeds set memory, then stopping in world in batch load mode to deal with it first. In server mode, same code runs but without stopping the world.

Moved lcache to lmap, a bucket based concurrent hash map. But, the behaviour is still erratic, with 28% of Gets (with inserts) taking over 10us.

Randomize input to avoid contention for RDFs containing the same subject. Don't call assigner clean(), because it hangs the entire process.

Real world use cases. Allow for dots in names. Handle backspace. Run automatic mutation merging. Load multiple rdf gzips, etc.

Optimized Posting List, yes! AddMutation now largely runs in O(log M + log N), plus potential element shift for mindex. Also reduced complexity.

Handle reading rdf data from files. Use underscores for uid and xid, keeping it in sync with internal usage. Output uids as hex.

Make list matrix work, yeah! This would serialize uids for the next query, which would then again return a matrix, so on and so forth.

BREAKING change: convert to JSON. Given we're not tracking uids for each query uid, this will cause problems for the result. So, have to re-structure stuff here.