Powerful functions for various tree operations.
Create Declarative frameworks that output tree structures with properties (e.g. ArtReact)
micromark factory to parse markdown space (found in lots of places)
micromark factory to parse markdown whitespace (found in lots of places)
A library for creating standardized query keys, useful for cache management in @tanstack/query
micromark factory to parse destinations (found in resources, definitions)
Tree-factory module
micromark factory to parse markdown titles (found in resources, definitions)
micromark factory to parse labels (found in media, definitions)
micromark factory to parse MDX expressions (found in JSX attributes, flow, text)
SortitionSumTreeFactory extracted from the Kleros core smart contracts.
An exchange for operation retry support in urql
A little factory function to create a broker for a JSON-RPC based Web Worker.
A little factory function to create a JSON-RPC based Web Worker implementation.
Converts .bt files into JavaScript files for consumption by the Behavior Tree Factory.
Resource pooling for Node.JS
TypeScript definitions for factory-girl
Implementation of the various Ethereum Transaction Types
A term-replace function-factory actor
A term-xsd-to-boolean function-factory actor
A term-floor function-factory actor
A term-year function-factory actor
A term-str-ends function-factory actor
A term-lang function-factory actor
a simple library for analyzing the dependencies between your factory_girl factories
With this gem you will save time creating factory model, with different options you will be able to create a full compatible factory tree from your database
Compose factory_bot factories into foundries that build complex trees of related records with a declarative DSL.
Factrey provides a declarative DSL to represent the creation plan of objects, for FactoryBot::Blueprint. The name Factrey is derived from the words factory and tree.
CallableTree provides a framework for organizing complex logic into a tree of callable nodes. It allows you to chain execution from a root node to leaf nodes based on matching conditions. Key features include multiple traversal strategies: `seekable` (like nested `if`/`case`), `broadcastable` (one-to-many execution), and `composable` (pipelined processing). Supports class-based, builder-style and factory-style definitions.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.