Hi, Am Dienstag, den 28.10.2008, 23:26 +0100 schrieb Alberto G. Corona : > Data.Tcache is a transactional cache with configurable persistence. It > tries to simulate Hibernate for Java or Rails for Ruby. The main > difference is that transactions are done in memory trough STM. There > are transactional cache implementations for some J2EE servers like > JBOSS. > > TCache uses STM . It can atomically apply a function to a list of > cached objects. The resulting objects go back to the cache > (withResources). It also can retrieve these objects (getResources). > Persistence can be syncronous (syncCache) or asyncronous, wtih > configurable time between cache writes and configurable cache > clearance strategy. the size of the cache can be configured too . All > of this can be done trough clearSyncCacheProc. Even the TVar variables > can be accessed directly (getTVar) to acceess all the semantic of > atomic blocks while maintaining the persistence of the TVar updates. > > Persistence can be defined for each object.: Each object must have a > defined key, a default filename path (if applicable). Persistence is > pre-defined in files, but the readResource writeResource and > delResource methods can be redefined to persist in databases or > whatever.
Interesting. Without much deep knowledge, this sounds similar to HAppS.State. Where are the differences? Greetings, Joachim -- Joachim "nomeata" Breitner mail: [EMAIL PROTECTED] | ICQ# 74513189 | GPG-Key: 4743206C JID: [EMAIL PROTECTED] | http://www.joachim-breitner.de/ Debian Developer: [EMAIL PROTECTED]
signature.asc
Description: Dies ist ein digital signierter Nachrichtenteil
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
