qbit86 


Indexed collection like usual List<T>, but with less allocations. Enables reusing instances of inner array via ArrayPool<T>.Shared. Provides ToRist() extension method which perfectly replaces conventional ToList() for materializing LINQ queries. MoveToArray() method releases ownership of internal... More information
Abstractions for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used types: Phlogopite.AggregateLogger<TProperty> Phlogopite.ILogger<TProperty> Phlogopite.SpanBuilder<TProperty>
Default implementation of abstractions for Phlogopite library — structured logging for .NET with low memory footprint. Commonly used types: Phlogopite.CategoryLogger Phlogopite.MediatorLogger Phlogopite.NamedProperty Phlogopite.Extensions.Tag.TagLoggerExtensions
Data structures for graphs, and policy models to manipulate them. Commonly used types: • IndexedIncidenceGraph • IndexedIncidenceGraphPolicy • SimpleIncidenceGraph • SimpleIncidenceGraphPolicy
Minimalistic state machine. Commonly used types: Machinery.IState<TContext, TEvent> Machinery.StateMachine<TContext, TEvent> Machinery.StateMachine<TContext, TEvent, TState, TPolicy>
A thin wrapper around System.DateTime which guarantees Kind to be Utc. Commonly used types: Instantia.UtcDateTime
Associative collection like usual Dictionary<K, V>, but with comparer type preserved instead of hiding behind the interface. Enables devirtualization of calls to the key comparer. Enables reusing instances of inner array of entries via ArrayPool<T>.Shared. Provides ToFictionary() extension methods... More information
  • 392 total downloads
  • last updated 7/5/2020
  • Latest version: 0.1.1
  • graph abstraction
The interface for graphs and some collections to be examined and manipulated in a data-structure agnostic fashion. Commonly used types: IIncidenceGraph<TVertex, TEdge, TEdges> IMapPolicy<TMap, TKey, TValue>
  • 255 total downloads
  • last updated 9/23/2020
  • Latest version: 0.4.0
  • graph primitive
Basic blocks for building algorithms and data structures. Commonly used types: • Endpoints • ArrayPrefix<T> • ArrayPrefixEnumerator<T>
Graph traversal algorithms: DFS, BFS. Commonly used types: • Bfs<TGraph, TEdge, TEdgeEnumerator> • Dfs<TGraph, TEdge, TEdgeEnumerator> • InstantDfs<TGraph, TVertex, TEdge, TEdgeEnumerator, TColorMap, TGraphPolicy, TColorMapPolicy> • IDfsHandler<TGraph, TVertex, TEdge>