Age | Commit message (Collapse) | Author |
|
The old cache system will be going away now, so if you need it for anything,
grab a version before this commit.
Oh, also, happy 1,000th commit!
|
|
|
|
it works very, very differently, but the interface is proving much easier to
use and it should be much faster, not to mention thread-safe.
|
|
The new cache is really coming along now.
|
|
computers.
|
|
testing now. The idea is that it makes it easy to use a bi-directional stream
like a tcpstream that requires a seperate filter instance for each read and
write side.
|
|
for Bu::Hash, which tests the basics alright, but not the synchro part. I'm
still trying to figure out a good test for that.
|
|
encapsulation, at least for the read/write guy. Also started work on a
thread-safe wrapper for the standard hash. There is a lot of functionality we
just have to leave out in this, it's just too dangerous in a thread-safe class.
|
|
two classes, one for the store, one for the cache itself. The index will have
to go with the store, which I find a little odd, but it'll...probably work out.
|
|
|
|
Creating an experimental new cache system that's controlled primarily with a
subclass. This should cut down significantly on the amount of code needed to
use the cache. The new one also features a required (for now) base class for
objects that use the cache. This simplifies so many different things.
|
|
|
|
|
|
Bu::RandomBase::rand functions visible in the Bu::RandomCmwc class.
|