DimonSmart 

This library generates complex mazes and finds a path through them. It is useful for learning and game development.

A cross-platform .NET library that intelligently trims PDF pages to actual content using content-based or bitmap-based analysis. Supports Windows, Linux, macOS and other .NET-compatible platforms. Perfect for... More information

Template that creates compact AI instructions for Copilot and Codex

Package Description

This package provide file by content comparision functionality with FileByContent class and IFileByContent interface

Package Description

A comprehensive library for processing and extracting structured content from Large Language Model (LLM) responses. Features include JSON extraction from mixed text responses, think tag parsing to separate... More information

Generate builder classes via source generation. Simplifies object creation with Builder pattern.

Simpliest ever Benchmarking library.

Calculate differences between two strings. Useful for display change history.

MCP server that exposes NuGet package metadata and API surface.

Trim all string properties (and remove extra spaces) with one simple call. " A B " => "A B"

EFSpecification: Simplify querying with the Specification pattern in Entity Framework Core. Build expressive, composable, and reusable query specifications to enhance your application's data retrieval... More information

Attribute based Regex unit test adapter

Package Description

Specification: Simplify querying with the Specification pattern over IQueryable interface. Base package for the DimonSmart.Specification.EntityFrameworkCore

Build time generation for trim all class strings. No more "Duplicate" data (with only extra space difference). Keep you database clean and consistent! Fully free license!

Attributes for marking strings with positive and negative matching samples for regex testing.

.NET global tool installer for Intent-Driven Development generated AI coding agent files.

Advanced progress indicator supporting sub-task measurement and estimated end time calculation for long-running loops.