Signed-off-by: Aritra Majumder <aritramajumder8438@gmail.com>

…nship check

This commit introduces several improvements and new functionality to the Braid and Bead modules:

Key changes:
1. **Bead Parents Refactor**:
   - Changed the `parents` field in the `Bead` struct from a `HashSet<BeadHash>` to a `HashMap<BeadHash, Time>`.
   - This change enables faster lookups of parent beads directly using the `BeadHash`, improving performance for parent-child relationship checks.

2. **Function Visibility Refactor**:
   - Refactored several private functions in the `Braid` implementation to use `pub(crate)` visibility, ensuring they remain private but accessible throughout the crate for better modularity and testing.

3. **New Parent-Child Relationship Function**:
   - Added a new function `is_parent_of` to the `Bead` struct.
   - This function checks whether a bead is the parent of another bead by verifying the `parents` field of the child bead.
   - The function returns a `Result<bool, BeadLoadError>` to handle cases where the child bead is not found in memory.

These changes improve the efficiency of parent lookups, enhance code maintainability, and add functionality for verifying parent-child relationships between beads.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

…ability

This commit introduces a `children` field to the `Bead` struct, enabling the tracking of child beads. The field is implemented as a `RefCell<HashSet<BeadHash>`, allowing for interior mutability while maintaining Rust's borrowing rules.

Key changes:
- Added a `children: RefCell<HashSet<BeadHash>>` field to the `Bead` struct.
  - This field is used to store the `BeadHash` values of child beads.
  - The use of `RefCell` allows mutation of the `children` field even when the `Bead` instance is immutable.
- Added a public method `is_parent_of` to check if the current bead is a parent of a given child bead.
  - This method uses the `children` field to verify the relationship.
- Updated the `Bead` struct to support interior mutability for child bead relationships.

These changes improve the functionality of the `Bead` struct by enabling dynamic updates to child bead relationships while adhering to Rust's safety guarantees.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

…anization

This commit moves all bead-related functions, such as `is_genesis_bead`, `is_orphaned`, and `is_parent_of`, into the `impl Bead` block. This change improves code organization and readability by grouping functionality directly related to the `Bead` struct within its implementation.

Key changes:
- Moved `is_genesis_bead` to the `impl Bead` block, as it directly operates on bead data.
- Moved `is_orphaned` and `is_parent_of` to the `impl Bead` block for consistency.
- Updated references to these functions to reflect their new location.

This refactor ensures that bead-related logic is encapsulated within the `Bead` struct, making the codebase more modular and easier to maintain.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

This commit introduces a `children` field to the `Bead` struct as an optimization. The `children` field is implemented as a `RefCell<HashSet<BeadHash>>`, allowing efficient tracking of child beads while maintaining Rust's borrowing rules.

Key changes:
- Added a `children` field to the `Bead` struct to store the `BeadHash` values of child beads.
- Implemented the `is_parent_of` method to check if the current bead is a parent of a given child bead using the `children` set.
- Added the `get_children` method to retrieve all child beads as a `Children` collection.

These changes improve the performance of parent-child relationship checks and make the `Bead` struct more efficient for operations involving child beads.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

This commit introduces a new `update_children` function to the `Bead` struct, allowing dynamic updates to the `children` field. This function provides a convenient way to manage child bead relationships efficiently.

Key changes:
- Added the `update_children` function to modify the `children` field in the `Bead` struct.
- The function uses the `RefCell` interior mutability pattern to safely update the `HashSet` of child beads.
- Ensures that child relationships can be dynamically updated without violating Rust's borrowing rules.

This addition improves the flexibility of the `Bead` struct by enabling efficient updates to child bead relationships.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

…nd pruning

This commit introduces optimizations to the `Braid` struct by caching the genesis beads during the creation or pruning of a DAG. This ensures that genesis beads are never recalculated, improving performance and reducing redundant computations.

Key changes:
- Added a `genesis_beads` field to the `Braid` struct to cache the set of genesis beads.
- Updated the `new` and `generate_from_previous_dag` functions to initialize and maintain the `genesis_beads` cache.
- Ensured that the `genesis_beads` cache is updated appropriately during DAG pruning or bead addition.

These changes improve the efficiency of operations involving genesis beads by avoiding unnecessary recalculations and leveraging the cached values.

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>

Signed-off-by: Calisto Mathias <calistomathias.work@gmail.com>