Releases: ledjon-behluli/DurableStateMachines
1.0.0-alpha.9
- Adds
Contains(T item)toIDurableRingBuffer<T>. - Adds
Contains(T item)toIDurableTimeWindowBuffer<T>.
1.0.0-alpha.8
- Adds
IDurableTimeWindowBuffer<T> - Adds
IDurableTimeWindowBufferCollection<TKey, TValue> - Adjusts
IDurableCancellationTokenSourceto respect the currentTimeProvider
1.0.0-alpha.7
The GetOrCreate(key, capacity) method on IDurableRingBufferCollection<TKey, TValue> has been removed and replaced with a new method: EnsureBuffer(key, capacity).
-
Old Behavior (GetOrCreate): The capacity parameter was only used when creating a new buffer. It was ignored if the buffer already existed.
-
New Behavior (EnsureBuffer): The capacity parameter is always enforced. If the buffer exists, its capacity will be overwritten with the new value (if it differs from the old).
This change prevents bugs where capacity could be unintentionally preserved, and the new name EnsureBuffer more accurately reflects the method's (new) behavior.
This change has no impact on existing persisted data.
1.0.0-alpha.6
- Adds
IDurableRingBuffer<T> - Adds
IDurableRingBufferCollection<TKey, TValue>
1.0.0-alpha.5
- Adds
CopyTo(array, arrayIndex)toDurableOrderedSet<T>which copies the elements in their original insertion order. - Adds
TryGetValue(equalValue, actualValue)toDurableOrderedSet<T>when looking to retrieve the actual stored instance of a value (based on equality), which might differ from the inputequalValue(e.g., different reference butEquals()returns true).
1.0.0-alpha.4
- Adds a new durable collection of type
IDurableOrderedSet<T>. - Adds a new durable collection of type
IDurableOrderedSetLookup<TKey, TValue>. - Adds a new method
Contains(TKey key, TValue value)for the existingIDurableSetLookup<TKey, TValue>. - Adds a new method
Contains(TKey key, TValue value)for the existingIDurableListLookup<TKey, TValue>.
1.0.0-alpha.3
Added support for DurableObject<T>
1.0.0-alpha.2
Added support for DurableCancellationTokenSource.
1.0.0-alpha.1
Initial release which comes with these state machines:
IDurableStack<T>IDurablePriorityQueue<TElement, TPriority>IDurableListLookup<TKey, TValue>IDurableSetLookup<TKey, TValue>IDurableTree<T>IDurableGraph<TNode, TEdge>