Akka.Util Namespace |
Class | Description | |
---|---|---|
ArrayLinearSeqT |
TBD
| |
AtomicBoolean |
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.
| |
AtomicReferenceT |
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.
| |
Base64Encoding |
TBD
| |
BitArrayHelpers |
Extension method class to make it easier to work with BitArray instances
| |
ByteIterator |
TBD
| |
ConcurrentSetT |
TBD
| |
Either |
TBD
| |
EitherTA, TB |
TBD
| |
FastLazyT |
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
| |
FastLazyS, 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
| |
IndexTKey, TValue |
An implementation of a ConcurrentMultiMap - in CLR that would be something like
ConcurrentDictionaryTKey, TValue where TValue is another IEnumerableT.
Add/remove is serialized over the specified key.
Reads are fully concurrent.
| |
LeftT |
TBD
| |
LeftTA, TB |
TBD
| |
ListPriorityQueue |
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
| |
MurmurHash |
Murmur3 Hash implementation
| |
Resolve |
TBD
| |
ResolveTActor |
TBD
| |
Result |
TBD
| |
RightT |
TBD
| |
RightTA, TB |
TBD
| |
RuntimeDetector |
Used to detect specific .NET runtimes, to make it easier to adjust for platform specific
differences.
| |
StandardOutWriter |
This class contains methods for thread safe writing to the standard output stream.
| |
StringFormat |
TBD
| |
Switch |
An atomic switch that can be either on or off
| |
ThreadLocalRandom |
Create random numbers with Thread-specific seeds.
Borrowed form Jon Skeet's brilliant C# in Depth: http://csharpindepth.com/Articles/Chapter12/Random.aspx
| |
TickTimeTokenBucket |
Default implementation of TokenBucket that uses Ticks as the time source.
| |
TokenBucket |
INTERNAL API
| |
TypeExtensions |
Class TypeExtensions.
| |
Vector |
TBD
| |
WildcardMatch |
TBD
| |
WildcardTreeT |
A searchable nested dictionary, represents a searchable tree structure underneath
|
Structure | Description | |
---|---|---|
ResultT |
TBD
|
Interface | Description | |
---|---|---|
ILinearSeqT |
TBD
| |
IResolver |
TBD
| |
ISurrogate |
TBD
| |
ISurrogated |
Used for surrogate serialization.
|