A draft implementation that runs builds concurrently (probably buggy right now). Is CBT "reactive" now ;)?

1 files changed, 33 insertions, 0 deletions

diff --git a/stage1/KeyLockedLazyCache.scala b/stage1/KeyLockedLazyCache.scala
new file mode 100644
index 0000000..c8b37ea
--- /dev/null
+++ b/stage1/KeyLockedLazyCache.scala
@@ -0,0 +1,33 @@
+/*
+package cbt
+import java.util.concurrent.ConcurrentHashMap
+import scala.concurrent.Future
+
+/**
+A cache that lazily computes values if needed during lookup.
+Locking occurs on the key, so separate keys can be looked up
+simultaneously without a deadlock.
+*/
+final private[cbt] class KeyLockedLazyCache[Key <: AnyRef,Value]{
+  private val keys = new ConcurrentHashMap[Key,LockableKey]()
+  private val builds = new ConcurrentHashMap[LockableKey,Value]()
+
+  private class LockableKey
+  def get( key: Key, value: => Value ): Value = {
+    val keyObject = keys.synchronized{    
+      if( ! (keys containsKey key) ){
+        keys.put( key, new LockableKey )
+      }
+      keys get key
+    }
+    // synchronizing on key only, so asking for a particular key does
+    // not block the whole cache, but just that cache entry
+    key.synchronized{
+      if( ! (builds containsKey keyObject) ){
+        builds.put( keyObject, value )
+      }
+      builds get keyObject      
+    }
+  }
+}
+*/