all_ulab_rooted_trees.hpp

/*********************************************************************
 *
 *  Linear Arrangement Library - A library that implements a collection
 *  algorithms for linear arrangments of graphs.
 *
 *  Copyright (C) 2019 - 2021
 *
 *  This file is part of Linear Arrangement Library. To see the full code
 *  visit the webpage:
 *      https://github.com/lluisalemanypuig/linear-arrangement-library.git
 *
 *  Linear Arrangement Library is free software: you can redistribute it
 *  and/or modify it under the terms of the GNU Affero General Public License
 *  as published by the Free Software Foundation, either version 3 of the
 *  License, or (at your option) any later version.
 *
 *  Linear Arrangement Library is distributed in the hope that it will be
 *  useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 *  GNU Affero General Public License for more details.
 *
 *  You should have received a copy of the GNU Affero General Public License
 *  along with Linear Arrangement Library.  If not, see <http://www.gnu.org/licenses/>.
 *
 *  Contact:
 *
 *      Lluís Alemany Puig (lalemany@cs.upc.edu)
 *          LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)
 *          CQL (Complexity and Quantitative Linguistics Lab)
 *          Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *          Webpage: https://cqllab.upc.edu/people/lalemany/
 *
 *      Ramon Ferrer i Cancho (rferrericancho@cs.upc.edu)
 *          LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)
 *          CQL (Complexity and Quantitative Linguistics Lab)
 *          Office S124, Omega building
 *          Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *          Webpage: https://cqllab.upc.edu/people/rferrericancho/
 *
 ********************************************************************/
 
#pragma once
 
// lal includes
#include <lal/graphs/rooted_tree.hpp>
#include <lal/generate/tree_generator.hpp>
#include <lal/internal/data_array.hpp>
 
namespace lal {
namespace generate {
 
class all_ulab_rooted_trees : public _tree_generator<graphs::rooted_tree> {
public:
    /* CONSTRUCTORS */
 
    all_ulab_rooted_trees(uint32_t n) noexcept;
    all_ulab_rooted_trees(const all_ulab_rooted_trees& Gen) = default;
#ifndef SWIG
    all_ulab_rooted_trees(all_ulab_rooted_trees&& Gen) = delete;
#endif
    ~all_ulab_rooted_trees() noexcept = default;
 
    /* GETTERS */
 
    inline bool end() const noexcept { return m_reached_end; }
 
    /* MODIFIERS */
 
    void next() noexcept;
 
    inline void reset() noexcept {
        __reset();
        next();
    }
 
    inline graphs::rooted_tree yield_tree() noexcept {
        const auto t = get_tree();
        next();
        return t;
    }
 
protected:
    graphs::rooted_tree __get_tree() noexcept;
 
    void __reset() noexcept;
 
private:
    bool m_is_last = false;
    bool m_is_first = false;
    bool m_reached_end = false;
 
    uint32_t m_p = 0;
    internal::data_array<node> m_save;
    internal::data_array<node> m_prev;
    internal::data_array<node> m_L;
};
 
} // -- namespace generate
} // -- namespace lal