Click or drag to resize
Akka.NETAkka.Util Namespace
The Akka.Util namespace contains classes that provide utilitarian functionality.
Classes
  ClassDescription
Public classArrayLinearSeq<T>
TBD
Public classAtomicBoolean
Implementation of the java.concurrent.util.AtomicBoolean type. Uses MemoryBarrier() internally to enforce ordering of writes without any explicit locking. .NET's strong memory on write guarantees might already enforce this ordering, but the addition of the MemoryBarrier guarantees it.
Public classAtomicReference<T>
Implementation of the java.concurrent.util AtomicReference type. Uses Volatile internally to enforce ordering of writes without any explicit locking. .NET's strong memory on write guarantees might already enforce this ordering, but the addition of the Volatile guarantees it.
Public classBase64Encoding
TBD
Public classBitArrayHelpers
Extension method class to make it easier to work with BitArray instances
Public classByteIterator
TBD
Public classConcurrentSet<T>
TBD
Public classEither
TBD
Public classEither<TA, TB>
TBD
Public classFastLazy<T>
A fast, atomic lazy that only allows a single publish operation to happen, but allows executions to occur concurrently. Does not cache exceptions. Designed for use with T types that are IDisposable or are otherwise considered to be expensive to allocate. Read the full explanation here: https://github.com/Aaronontheweb/FastAtomicLazy#rationale
Public classFastLazy<S, T>
A fast, atomic lazy that only allows a single publish operation to happen, but allows executions to occur concurrently. Does not cache exceptions. Designed for use with T types that are IDisposable or are otherwise considered to be expensive to allocate. Read the full explanation here: https://github.com/Aaronontheweb/FastAtomicLazy#rationale
Public classIndex<TKey, TValue>
Public classLeft<T>
TBD
Public classLeft<TA, TB>
TBD
Public classListPriorityQueue
Priority queue implemented using a simple list with binary search for inserts. This specific implementation is cheap in terms of memory but weak in terms of performance. See http://visualstudiomagazine.com/articles/2012/11/01/priority-queues-with-c.aspx for original implementation This specific version is adapted for Envelopes only and calculates a priority of envelope.Message
Public classMurmurHash
Murmur3 Hash implementation
Public classResolve
TBD
Public classResolve<TActor>
TBD
Public classResult
TBD
Public classRight<T>
TBD
Public classRight<TA, TB>
TBD
Public classRuntimeDetector
Used to detect specific .NET runtimes, to make it easier to adjust for platform specific differences.
Public classStandardOutWriter
This class contains methods for thread safe writing to the standard output stream.
Public classStringFormat
TBD
Public classSwitch
An atomic switch that can be either on or off
Public classThreadLocalRandom
Create random numbers with Thread-specific seeds. Borrowed form Jon Skeet's brilliant C# in Depth: http://csharpindepth.com/Articles/Chapter12/Random.aspx
Public classTickTimeTokenBucket
Default implementation of TokenBucket that uses Ticks as the time source.
Public classTokenBucket
INTERNAL API
Public classTypeExtensions
Class TypeExtensions.
Public classVector
TBD
Public classWildcardMatch
TBD
Public classWildcardTree<T>
A searchable nested dictionary, represents a searchable tree structure underneath
Structures
Interfaces