graph.hpp

Go to the documentation of this file.

// SPDX-FileCopyrightText: 2006-2025, Knut Reinert & Freie Universität Berlin
// SPDX-FileCopyrightText: 2016-2025, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause
 
#pragma once
 
#include <cstddef>  // for size_t
#include <optional> // for nullopt, optional
#include <vector>   // for vector
 
#include <hibf/layout/layout.hpp> // for layout
 
namespace seqan::hibf::layout
{
 
struct graph
{
 
    graph() = default;                          
    graph(graph const &) = default;             
    graph & operator=(graph const &) = default; 
    graph(graph &&) = default;                  
    graph & operator=(graph &&) = default;      
    ~graph() = default;                         
 
    graph(seqan::hibf::layout::layout const & hibf_layout);
 
    struct node
    {
        std::vector<node> children{};
 
        size_t parent_bin_index{};
        size_t max_bin_index{};
        size_t number_of_technical_bins{};
        std::optional<size_t> favourite_child_idx{std::nullopt};
        std::vector<layout::layout::user_bin> remaining_records{}; // non-merged bins (either split or single)
 
        bool max_bin_is_merged() const
        {
            return favourite_child_idx.has_value();
        }
 
        // Doesn't work, because the type is incomplete. To compare node, a comparison for the children member is needed.
        // But children is a std::vector<node>, so a comparison for node is needed to compare children.
        // https://godbolt.org/z/arrr4YKae
        // friend auto operator<=>(node const &, node const &) = default;
    };
    struct node {…};
 
    node root;
};
struct graph {…};
 
} // namespace seqan::hibf::layout