completed cassandra read/write (and bench) + added transactional vector and ref + cleaned up transactional state hierarchy + rewrote tx state wiring
This commit is contained in:
parent
e9f7162245
commit
7dec0a747c
60 changed files with 4481 additions and 6283 deletions
|
|
@ -13,7 +13,12 @@ trait Transactional {
|
|||
private[kernel] def rollback
|
||||
}
|
||||
|
||||
sealed trait State[K, V] extends Transactional {
|
||||
/**
|
||||
* 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 {
|
||||
def put(key: K, value: V)
|
||||
def remove(key: K)
|
||||
def get(key: K): V
|
||||
|
|
@ -24,87 +29,134 @@ sealed trait State[K, V] extends Transactional {
|
|||
}
|
||||
|
||||
/**
|
||||
* Base class for all persistent state implementations should extend.
|
||||
* Implements a Unit of Work, records changes into a change set.
|
||||
*
|
||||
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
||||
*/
|
||||
sealed class InMemoryState[K, V] extends State[K, V] {
|
||||
private[kernel] var state = new HashTrie[K, V]
|
||||
private[kernel] var snapshot = state
|
||||
abstract class PersistentTransactionalMap[K, V] extends TransactionalMap[K, V] {
|
||||
protected[kernel] val changeSet = new HashMap[K, V]
|
||||
|
||||
private[kernel] override def begin = {
|
||||
snapshot = state
|
||||
}
|
||||
|
||||
private[kernel] override def commit = {
|
||||
snapshot = state
|
||||
}
|
||||
|
||||
private[kernel] override def rollback = {
|
||||
state = snapshot
|
||||
}
|
||||
|
||||
override def put(key: K, value: V) = {
|
||||
state = state.update(key, value)
|
||||
}
|
||||
|
||||
override def remove(key: K) = {
|
||||
state = state - key
|
||||
}
|
||||
|
||||
def get(key: K): V = state.get(key).getOrElse { throw new NoSuchElementException("No value for key [" + key + "]") }
|
||||
|
||||
def contains(key: K): Boolean = state.contains(key)
|
||||
|
||||
def elements: Iterator[(K, V)] = state.elements
|
||||
|
||||
def size: Int = state.size
|
||||
|
||||
def clear = state = new HashTrie[K, V]
|
||||
}
|
||||
|
||||
//final class InMemoryStringState extends InMemoryState[String, String]
|
||||
//final class InMemoryObjectState extends InMemoryState[String, AnyRef]
|
||||
//
|
||||
/**
|
||||
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
||||
*/
|
||||
trait UnitOfWork[K, V] extends State[K, V] with Transactional {
|
||||
this: InMemoryState[K, V] =>
|
||||
private[kernel] val changeSet = new HashMap[K, V]
|
||||
|
||||
abstract override def begin = {
|
||||
super.begin
|
||||
override def begin = {
|
||||
changeSet.clear
|
||||
}
|
||||
|
||||
abstract override def put(key: K, value: V) = {
|
||||
super.put(key, value)
|
||||
override def put(key: K, value: V) = {
|
||||
changeSet += key -> value
|
||||
}
|
||||
|
||||
abstract override def remove(key: K) = {
|
||||
super.remove(key)
|
||||
override def remove(key: K) = {
|
||||
changeSet -= key
|
||||
}
|
||||
|
||||
def getRange(start: Int, count: Int)
|
||||
}
|
||||
|
||||
/**
|
||||
* 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]
|
||||
}
|
||||
|
||||
/**
|
||||
* 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 }
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//class VectorState[T] {
|
||||
// private[kernel] var state: Vector[T] = EmptyVector
|
||||
// private[kernel] var snapshot = state
|
||||
// private[kernel] var unitOfWork: List[T] = Nil
|
||||
//
|
||||
// private[kernel] def record = {
|
||||
// snapshot = state
|
||||
// unitOfWork = Nil
|
||||
// }
|
||||
//
|
||||
// def add(elem: T): VectorState[T] = {
|
||||
// state = state + elem
|
||||
// unitOfWork ::= elem
|
||||
// }
|
||||
//
|
||||
// def get(index: Int): T = state(index)
|
||||
//
|
||||
// def size: Int = state.size
|
||||
//}
|
||||
//
|
||||
//
|
||||
/**
|
||||
* 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
|
||||
}
|
||||
|
||||
/**
|
||||
* Implements an in-memory transactional vector.
|
||||
*
|
||||
* Not thread-safe, but should only be using from within an Actor, e.g. one single thread at a time.
|
||||
*/
|
||||
class InMemoryTransactionalVector[T] extends TransactionalVector[T] {
|
||||
private[kernel] var state: Vector[T] = EmptyVector
|
||||
private[kernel] var snapshot = state
|
||||
|
||||
override def begin = snapshot = state
|
||||
override def commit = snapshot = state
|
||||
override def rollback = state = snapshot
|
||||
|
||||
override def add(elem: T) = state = state + elem
|
||||
override def get(index: Int): T = state(index)
|
||||
override def size: Int = state.size
|
||||
}
|
||||
|
||||
/**
|
||||
* 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
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue