mwpowellhtx 

Code generator for [FlagsEnumeration]-decorated types. Automatically generates bitwise operator overloads corresponding with your derived Enumeration assets. This package references all required and recommended... More information

Provides a re-factoring and re-imagining of the Code Fixes elements deployed in the default Analysis and Code Fixes project template. This particular assembly focuses on Code Fixes only as part of that... More information

Provides a set of helpful Combinatoric Permutations assets for use during operation.

Provides Protocol Buffer Parser and Listener assets which build a subset of the Abstract Syntax Tree (AST) Descriptors.

Demonstrates usage of the Xunit.Theoretical Test Cases base class.

Provides the basis for a first class experience specifying SAT-CP solver parameters.

Provides the core problem solver abstraction for use with Google OR-tools Constraint Solver and Linear Solver wrappers.

Provides the ability to List items in Concurrent manner.

Provides a set of features making it possible to emulate C++ Variants for dotnet.

Provides the ability to List items in Concurrent manner.

The Engine relies on a set of Registries of Generated Code for purposes of determining whether re-generation ought to occur.

Provides a simple set of list based extensions for Queue operation.

Provides a simple set of list based extensions for Stack operation.

The framework BitArray is helpful but it has a serious flaw in the fact that it is not immutable. This is the primary motivation for working on this package in order to achieve just such an ImmutableBitArray.... More information

The Engine leverages a set of Service Managers in order to facilite when Code Generation is absolutely required.

The framework Enumerations provides a solid baseline of features emulating a Java style enumeration structure for .NET. Simple Ordinal based Enumerations are supported, as are more complex Flags-like Bitwise... More information

Enumerations tests framework is provided as an NUnit based framework sufficient to exercise the majority of boilerplate issues concerning both Ordinal as well as Bitwise Enumerations.

Provides a set of helpful Combinatoric assets for use during operation.

Provides a convenient, easy to use wrapper for Constraint Satisfaction Programming based on the Google OR-tools.

Provides a handful of helpful extension methods for use during verification of Microsoft Roslyn Code Analysis, Code Generation, and so on. The package is intentionally left bereft of specific unit test... More information