Expand description
§Module :: former
A flexible implementation of the Builder pattern supporting nested builders and collection-specific subformers.
§What is Former
?
The former
crate provides a powerful derive macro, #[ derive( Former ) ]
, that automatically implements the Builder pattern for your Rust structs and enums.
Its primary goal is to simplify the construction of complex objects, especially those with numerous fields, optional values, default settings, collections, or nested structures, making your initialization code more readable and maintainable.
§Why Use Former
?
Compared to manually implementing the Builder pattern or using other builder crates, former
offers several advantages:
- Reduced Boilerplate:
#[ derive( Former ) ]
automatically generates the builder struct, storage, and setters, saving you significant repetitive coding effort. - Fluent & Readable API: Construct objects step-by-step using clear, chainable methods (
.field_name( value )
). - Effortless Defaults & Optionals: Fields automatically use their
Default
implementation if not set.Option< T >
fields are handled seamlessly – you only set them if you have aSome( value )
. Custom defaults can be specified easily with#[ former( default = ... ) ]
. - Powerful Collection & Nested Struct Handling:
former
truly shines with its subformer system. Easily buildVec
,HashMap
,HashSet
, and other collections element-by-element, or configure nested structs using their own dedicated formers within the parent’s builder chain. This is often more complex to achieve with other solutions.
§Installation
Add former
to your Cargo.toml
:
cargo add former
The default features enable the Former
derive macro and support for standard collections, covering most common use cases.
§Basic Usage
Derive Former
on your struct and use the generated ::former()
method to start building:
use former::Former;
#[ derive( Debug, PartialEq, Former ) ]
pub struct UserProfile
{
age : i32, // Required field
username : String, // Required field
bio : Option< String >, // Optional field
}
let profile = UserProfile::former()
.age( 30 )
.username( "JohnDoe".to_string() )
// .bio is optional, so we don't *have* to call its setter
.form();
let expected = UserProfile
{
age : 30,
username : "JohnDoe".to_string(),
bio : None, // Defaults to None if not set
};
assert_eq!( profile, expected );
dbg!( &profile );
// > &profile = UserProfile {
// > age: 30,
// > username: "JohnDoe",
// > bio: None,
// > }
// Example setting the optional field:
let profile_with_bio = UserProfile::former()
.age( 30 )
.username( "JohnDoe".to_string() )
.bio( "Software Developer".to_string() ) // Set the optional bio
.form();
let expected_with_bio = UserProfile
{
age : 30,
username : "JohnDoe".to_string(),
bio : Some( "Software Developer".to_string() ),
};
assert_eq!( profile_with_bio, expected_with_bio );
dbg!( &profile_with_bio );
// > &profile_with_bio = UserProfile {
// > age: 30,
// > username: "JohnDoe",
// > bio: Some( "Software Developer" ),
// > }
Run this example locally | Try it online
§Handling Optionals and Defaults
Former
makes working with optional fields and default values straightforward:
-
Option< T >
Fields: As seen in the basic example, fields of typeOption< T >
automatically default toNone
. You only need to call the setter if you have aSome( value )
. -
Custom Defaults: For required fields that don’t implement
Default
, or when you need a specific default value other than the type’s default, use the#[ former( default = ... ) ]
attribute:
use former::Former;
#[ derive( Debug, PartialEq, Former ) ]
pub struct Config
{
#[ former( default = 1024 ) ] // Use 1024 if .buffer_size() is not called
buffer_size : i32,
timeout : Option< i32 >, // Defaults to None
#[ former( default = true ) ] // Default for bool
enabled : bool,
}
// Only set the optional timeout
let config1 = Config::former()
.timeout( 5000 )
.form();
assert_eq!( config1.buffer_size, 1024 ); // Got default
assert_eq!( config1.timeout, Some( 5000 ) );
assert_eq!( config1.enabled, true ); // Got default
// Set everything, overriding defaults
let config2 = Config::former()
.buffer_size( 4096 )
.timeout( 1000 )
.enabled( false )
.form();
assert_eq!( config2.buffer_size, 4096 );
assert_eq!( config2.timeout, Some( 1000 ) );
assert_eq!( config2.enabled, false );
§Building Collections & Nested Structs (Subformers)
Where former
significantly simplifies complex scenarios is in building collections (Vec
, HashMap
, etc.) or nested structs. It achieves this through subformers. Instead of setting the entire collection/struct at once, you get a dedicated builder for the field:
Example: Building a Vec
use former::Former;
#[ derive( Debug, PartialEq, Former ) ]
pub struct Report
{
title : String,
#[ subform_collection ] // Enables the `.entries()` subformer
entries : Vec< String >,
}
let report = Report::former()
.title( "Log Report".to_string() )
.entries() // Get the subformer for the Vec
.add( "Entry 1".to_string() ) // Use subformer methods to modify the Vec
.add( "Entry 2".to_string() )
.end() // Return control to the parent former (ReportFormer)
.form(); // Finalize the Report
assert_eq!( report.title, "Log Report" );
assert_eq!( report.entries, vec![ "Entry 1".to_string(), "Entry 2".to_string() ] );
dbg!( &report );
// > &report = Report {
// > title: "Log Report",
// > entries: [
// > "Entry 1",
// > "Entry 2",
// > ],
// > }
See Vec example | See HashMap example
former
provides different subform attributes (#[ subform_collection ]
, #[ subform_entry ]
, #[ subform_scalar ]
) for various collection and nesting patterns.
§Key Features Overview
- Automatic Builder Generation:
#[ derive( Former ) ]
for structs and enums. - Fluent API: Chainable setter methods for a clean construction flow.
- Defaults & Optionals: Seamless handling of
Default
values andOption< T >
fields. Custom defaults via#[ former( default = ... ) ]
. - Subformers: Powerful mechanism for building nested structures and collections:
#[ subform_scalar ]
: For fields whose type also derivesFormer
.#[ subform_collection ]
: For collections likeVec
,HashMap
,HashSet
, etc., providing methods like.add()
or.insert()
.#[ subform_entry ]
: For collections where each entry is built individually using its own former.
- Customization:
- Rename setters:
#[ scalar( name = ... ) ]
,#[ subform_... ( name = ... ) ]
. - Disable default setters:
#[ scalar( setter = false ) ]
,#[ subform_... ( setter = false ) ]
. - Define custom setters directly in
impl Former
. - Specify collection definitions:
#[ subform_collection( definition = ... ) ]
.
- Rename setters:
- Advanced Control:
- Storage-only fields:
#[ storage_fields( ... ) ]
. - Custom mutation logic:
#[ mutator( custom ) ]
+impl FormerMutator
. - Custom end-of-forming logic: Implement
FormingEnd
. - Custom collection support: Implement
Collection
traits.
- Storage-only fields:
- Component Model: Separate derives (
Assign
,ComponentFrom
,ComponentsAssign
,FromComponents
) for type-based field access and conversion (Seeformer_types
documentation).
§Where to Go Next
- Advanced Usage & Concepts: Dive deeper into subformers, customization options, storage, context, definitions, mutators, and custom collections.
- Examples Directory: Explore practical, runnable examples showcasing various features.
- API Documentation (docs.rs): Get detailed information on all public types, traits, and functions.
- Repository (GitHub): View the source code, contribute, or report issues.
Modules§
- dependency
- Namespace with dependencies.
- derive
- exposed
- Exposed namespace of the module.
- orphan
- Parented namespace of the module.
- own
- Own namespace of the module.
- prelude
- Prelude to use essentials:
use my_module::prelude::*
.
Structs§
- BTree
MapDefinition - Represents the formation definition for a hash map-like collection within the former framework.
- BTree
MapDefinition Types - Holds the generic parameters for the
BTreeMapDefinition
. - BTree
SetDefinition - Represents the formation definition for a binary tree set-like collection within the former framework.
- BTree
SetDefinition Types - Holds the generic parameters for the
BTreeSetDefinition
. - Binary
Heap Definition - Represents the formation definition for a binary heap-like collection within the former framework.
- Binary
Heap Definition Types - Holds the generic parameters for the
BinaryHeapDefinition
. - Collection
Former - A builder structure for constructing collections with a fluent and flexible interface.
- Forming
EndClosure - A wrapper around a closure to be used as a
FormingEnd
. - Hash
MapDefinition - Represents the formation definition for a hash map-like collection within the former framework.
- Hash
MapDefinition Types - Holds the generic parameters for the
HashMapDefinition
. - Hash
SetDefinition - Represents the formation definition for a hash set-like collection within the former framework.
- Hash
SetDefinition Types - Holds the generic parameters for the
HashSetDefinition
. - Linked
List Definition - Represents the formation definition for a list-like collection within the former framework.
- Linked
List Definition Types - Holds the generic parameters for the
LinkedListDefinition
. - NoEnd
- A placeholder
FormingEnd
used when no end operation is required or applicable. - Return
Preformed - A
FormingEnd
implementation that directly returns the formed collection as the final product of the forming process. - Return
Storage - A
FormingEnd
implementation that returns the storage itself as the formed entity, disregarding any contextual data. - VecDeque
Definition - Represents the formation definition for a vector deque-like collection within the former framework.
- VecDeque
Definition Types - Holds the generic parameters for the
VecDequeDefinition
. - Vector
Definition - Represents the formation definition for a vector-like collection within the former framework.
- Vector
Definition Types - Holds the generic parameters for the
VectorDefinition
.
Traits§
- Assign
- Provides a generic interface for setting a component of a certain type on an object.
- Assign
With Type - The
AssignWithType
trait provides a mechanism to set a component on an object, utilizing the type information explicitly. This trait extends the functionality ofAssign
by allowing implementers to specify the component’s type at the method call site, enhancing expressiveness in code that manipulates object states. - BTree
MapExt - Provides an extension method for hash maps to facilitate the use of the builder pattern.
- BTree
SetExt - Provides an extension method for binary tree sets to facilitate the use of the builder pattern.
- Binary
Heap Ext - Provides an extension method for binary heaps to facilitate the use of the builder pattern.
- Collection
- Represents a collection by defining the types of entries and values it handles.
- Collection
Add - Provides functionality to add individual entries to a collection.
- Collection
Assign - Defines the capability to replace all entries in a collection with a new set of entries.
- Collection
ValTo Entry - Provides a mechanism for transforming a value back into a collection-specific entry format.
- Entity
ToDefinition - Maps a type of entity to its corresponding former definition. This trait provides a linkage between the entity and its definition, allowing the formation logic to understand what definition to apply during the formation process.
- Entity
ToDefinition Types - Provides a mapping between a type of entity and its associated formation type definitions.
- Entity
ToFormer - Maps a type of entity to its corresponding former. This trait binds an entity type to a specific former, facilitating the use of custom formers in complex formation scenarios.
- Entity
ToStorage - Maps a type of entity to its storage type. This trait defines what storage structure is used to hold the interim state of an entity during its formation.
- Entry
ToVal - Facilitates the conversion of collection entries to their corresponding value representations.
- Former
Begin - A trait for initiating a structured subforming process with contextual and intermediary storage linkage.
- Former
Definition - Expands on
FormerDefinitionTypes
by incorporating an ending mechanism for the formation process. This trait connects the formation types with a specific endpoint, defining how the formation process concludes, including any necessary transformations or validations. - Former
Definition Types - Defines the fundamental components involved in the formation of an entity. This trait specifies the types of storage, the formed entity, and the context used during the formation process.
- Former
Mutator - Provides a mechanism for mutating the context and storage just before the forming process is completed.
- Forming
End - Defines a handler for the end of a subforming process, enabling the return of the original context.
- Hash
MapExt - Provides an extension method for hash maps to facilitate the use of the builder pattern.
- Hash
SetExt - Provides an extension method for
HashSet
to facilitate the use of the builder pattern. - Linked
List Ext - Provides an extension method for lists to facilitate the use of the builder pattern.
- Option
Ext - Extension trait to provide a method for setting a component on an
Option<Self>
if theOption
is currentlyNone
. If theOption
isSome
, the method will delegate to theAssign
trait’sassign
method. - Storage
- Defines the storage interface for entities being constructed using a forming pattern.
- Storage
Preform - Provides a mechanism to finalize the forming process by converting storage into its final formed state.
- ValTo
Entry - Facilitates the conversion of values back into entries for specific collection types.
- VecDeque
Ext - Provides an extension method for vector deques to facilitate the use of the builder pattern.
- VecExt
- Provides an extension method for vectors to facilitate the use of the builder pattern.
Type Aliases§
- BTree
MapFormer - Provides a streamlined builder interface for constructing hash map-like collections.
- BTree
SetFormer - Provides a streamlined builder interface for constructing binary tree set-like collections.
- Binary
Heap Former - Provides a streamlined builder interface for constructing binary heap-like collections.
- Hash
MapFormer - Provides a streamlined builder interface for constructing hash map-like collections.
- Hash
SetFormer - Provides a concise alias for
CollectionFormer
configured specifically forHashSet
-like collections. - Linked
List Former - Provides a streamlined builder interface for constructing list-like collections.
- VecDeque
Former - Provides a streamlined builder interface for constructing vector deque-like collections.
- Vector
Former - Provides a streamlined builder interface for constructing vector-like collections.
Derive Macros§
- Assign
- Derives the
Assign
trait for struct fields, allowing each field to be set with a value that can be converted into the field’s type. - Component
From - Macro to implement
From
for each component (field) of a structure. This macro simplifies the creation ofFrom
trait implementations for struct fields, enabling easy conversion from a struct reference to its field types. - Components
Assign - Derives the
ComponentsAssign
trait for a struct, enablingcomponents_assign
which set all fields at once. - Former
- Derive macro for generating a
Former
struct, applying a Builder Pattern to the annotated struct. - From
Components - A procedural macro to automatically derive the
From<T>
trait implementation for a struct, enabling instances of one type to be converted from instances of another type.