2009-04-19 10:58:20 +02:00
|
|
|
/**
|
|
|
|
|
* Copyright (C) 2009 Scalable Solutions.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
package se.scalablesolutions.akka.kernel
|
|
|
|
|
|
|
|
|
|
import se.scalablesolutions.akka.collection._
|
|
|
|
|
import scala.collection.mutable.HashMap
|
|
|
|
|
|
|
|
|
|
trait Transactional {
|
|
|
|
|
private[kernel] def begin
|
|
|
|
|
private[kernel] def commit
|
|
|
|
|
private[kernel] def rollback
|
|
|
|
|
}
|
|
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
/**
|
|
|
|
|
* Base trait for all state implementations (persistent or in-memory).
|
|
|
|
|
*
|
|
|
|
|
* TODO: Make this class inherit scala.collection.mutable.Map and/or java.util.Map
|
|
|
|
|
*/
|
|
|
|
|
trait TransactionalMap[K, V] extends Transactional {
|
2009-04-19 10:58:20 +02:00
|
|
|
def put(key: K, value: V)
|
|
|
|
|
def remove(key: K)
|
|
|
|
|
def get(key: K): V
|
|
|
|
|
def contains(key: K): Boolean
|
|
|
|
|
def elements: Iterator[(K, V)]
|
|
|
|
|
def size: Int
|
|
|
|
|
def clear
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
2009-04-27 19:55:57 +02:00
|
|
|
* Base class for all persistent state implementations should extend.
|
|
|
|
|
* Implements a Unit of Work, records changes into a change set.
|
|
|
|
|
*
|
2009-04-19 10:58:20 +02:00
|
|
|
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
|
|
|
|
*/
|
2009-04-27 19:55:57 +02:00
|
|
|
abstract class PersistentTransactionalMap[K, V] extends TransactionalMap[K, V] {
|
|
|
|
|
protected[kernel] val changeSet = new HashMap[K, V]
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
override def begin = {
|
|
|
|
|
changeSet.clear
|
2009-04-19 10:58:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
override def put(key: K, value: V) = {
|
2009-04-27 19:55:57 +02:00
|
|
|
changeSet += key -> value
|
2009-04-19 10:58:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
override def remove(key: K) = {
|
2009-04-27 19:55:57 +02:00
|
|
|
changeSet -= key
|
2009-04-19 10:58:20 +02:00
|
|
|
}
|
|
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
def getRange(start: Int, count: Int)
|
|
|
|
|
}
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
/**
|
|
|
|
|
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
|
|
|
|
*/
|
|
|
|
|
class InMemoryTransactionalMap[K, V] extends TransactionalMap[K, V] {
|
|
|
|
|
protected[kernel] var state = new HashTrie[K, V]
|
|
|
|
|
protected[kernel] var snapshot = state
|
|
|
|
|
|
|
|
|
|
override def begin = snapshot = state
|
|
|
|
|
override def commit = snapshot = state
|
|
|
|
|
override def rollback = state = snapshot
|
|
|
|
|
|
|
|
|
|
override def put(key: K, value: V) = state = state.update(key, value)
|
|
|
|
|
override def get(key: K): V = state.get(key).getOrElse(throw new NoSuchElementException("No value for key [" + key + "]"))
|
|
|
|
|
override def remove(key: K) = state = state - key
|
|
|
|
|
override def contains(key: K): Boolean = state.contains(key)
|
|
|
|
|
override def elements: Iterator[(K, V)] = state.elements
|
|
|
|
|
override def size: Int = state.size
|
|
|
|
|
override def clear = state = new HashTrie[K, V]
|
|
|
|
|
}
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
/**
|
|
|
|
|
* Implements a persistent state based on the Cassandra distributed P2P key-value storage.
|
|
|
|
|
*/
|
|
|
|
|
class CassandraPersistentTransactionalMap(val actorName: String) extends PersistentTransactionalMap[String, String] {
|
|
|
|
|
override def begin = {}
|
|
|
|
|
override def rollback = {}
|
|
|
|
|
|
|
|
|
|
override def commit = {
|
|
|
|
|
// FIXME: should use batch function once the bug is resolved
|
|
|
|
|
for (entry <- changeSet) {
|
|
|
|
|
val (key, value) = entry
|
|
|
|
|
CassandraNode.insertActorStorageEntry(actorName, key, value)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
override def get(key: String): String = CassandraNode.getActorStorageEntryFor(actorName, key)
|
|
|
|
|
.getOrElse(throw new NoSuchElementException("Could not find element for key [" + key + "]"))
|
|
|
|
|
|
|
|
|
|
override def contains(key: String): Boolean = CassandraNode.getActorStorageEntryFor(actorName, key).isDefined
|
|
|
|
|
|
|
|
|
|
override def size: Int = CassandraNode.getActorStorageSizeFor(actorName)
|
|
|
|
|
|
|
|
|
|
override def clear = CassandraNode.removeActorStorageFor(actorName)
|
|
|
|
|
|
|
|
|
|
override def getRange(start: Int, count: Int) = CassandraNode.getActorStorageRange(actorName, start, count)
|
|
|
|
|
|
|
|
|
|
override def elements: Iterator[Tuple2[String, String]] = {
|
|
|
|
|
new Iterator[Tuple2[String, String]] {
|
|
|
|
|
private val originalList: List[Tuple2[String, String]] = CassandraNode.getActorStorageFor(actorName)
|
|
|
|
|
private var elements = originalList.reverse
|
|
|
|
|
|
|
|
|
|
override def next: Tuple2[String, String]= synchronized {
|
|
|
|
|
val element = elements.head
|
|
|
|
|
elements = elements.tail
|
|
|
|
|
element
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
override def hasNext: Boolean = synchronized { !elements.isEmpty }
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
/**
|
|
|
|
|
* TODO: extend scala.Seq
|
|
|
|
|
* Base for all transactional vector implementations.
|
|
|
|
|
*/
|
|
|
|
|
abstract class TransactionalVector[T] extends Transactional {
|
|
|
|
|
def add(elem: T)
|
|
|
|
|
def get(index: Int): T
|
|
|
|
|
def size: Int
|
2009-04-19 10:58:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
2009-04-27 19:55:57 +02:00
|
|
|
* Implements an in-memory transactional vector.
|
|
|
|
|
*
|
2009-04-19 10:58:20 +02:00
|
|
|
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
|
|
|
|
*/
|
2009-04-27 19:55:57 +02:00
|
|
|
class InMemoryTransactionalVector[T] extends TransactionalVector[T] {
|
|
|
|
|
private[kernel] var state: Vector[T] = EmptyVector
|
|
|
|
|
private[kernel] var snapshot = state
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
override def begin = snapshot = state
|
|
|
|
|
override def commit = snapshot = state
|
|
|
|
|
override def rollback = state = snapshot
|
2009-04-19 10:58:20 +02:00
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
override def add(elem: T) = state = state + elem
|
|
|
|
|
override def get(index: Int): T = state(index)
|
|
|
|
|
override def size: Int = state.size
|
2009-04-19 10:58:20 +02:00
|
|
|
}
|
|
|
|
|
|
2009-04-27 19:55:57 +02:00
|
|
|
/**
|
|
|
|
|
* Implements a transactional reference.
|
|
|
|
|
*
|
|
|
|
|
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
|
|
|
|
*/
|
|
|
|
|
class TransactionalRef[T] extends Transactional {
|
|
|
|
|
private[kernel] var ref: Option[T] = None
|
|
|
|
|
private[kernel] var snapshot: Option[T] = None
|
|
|
|
|
|
|
|
|
|
override def begin = if (ref.isDefined) snapshot = Some(ref.get)
|
|
|
|
|
override def commit = if (ref.isDefined) snapshot = Some(ref.get)
|
|
|
|
|
override def rollback = if (snapshot.isDefined) ref = Some(snapshot.get)
|
|
|
|
|
|
|
|
|
|
def swap(elem: T) = ref = Some(elem)
|
|
|
|
|
def get: Option[T] = ref
|
|
|
|
|
def getOrElse(default: => T): T = ref.getOrElse(default)
|
|
|
|
|
def isDefined: Boolean= ref.isDefined
|
|
|
|
|
}
|