treebank_collection_reader.hpp

/*********************************************************************
 *
 * Linear Arrangement Library - A library that implements a collection
 * algorithms for linear arrangments of graphs.
 *
 * Copyright (C) 2019 - 2024
 *
 * This file is part of Linear Arrangement Library. The full code is available
 * at:
 *      https://github.com/LAL-project/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 (lluis.alemany.puig@upc.edu)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         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)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         CQL (Complexity and Quantitative Linguistics Lab)
 *         Office 220, Omega building
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://cqllab.upc.edu/people/rferrericancho/
 *
 ********************************************************************/
 
#pragma once
 
// C++ includes
#include <string>
 
// lal includes
#include <lal/io/treebank_file_error.hpp>
#include <lal/io/treebank_reader.hpp>
 
namespace lal {
namespace io {
 
class treebank_collection_reader {
public:
 
    [[nodiscard]] treebank_file_error init(const std::string& main_file) noexcept;
 
    [[nodiscard]] bool end() const noexcept { return m_reached_end; }
 
    void next_treebank() noexcept;
 
    [[nodiscard]] treebank_reader& get_treebank_reader() noexcept
    { return m_treebank_reader; }
 
private:
    std::string m_main_file = "none";
 
    std::string m_cur_treebank_id = "none";
    std::string m_cur_treebank_filename = "none";
 
    std::ifstream m_list;
    treebank_reader m_treebank_reader;
 
    bool m_reached_end = false;
    bool m_no_more_treebanks = false;
 
private:
    void step_line() noexcept {
        if (m_list >> m_cur_treebank_id >> m_cur_treebank_filename) {
            // do nothing, there are more trees
        }
        else {
            m_no_more_treebanks = true;
            m_cur_treebank_id = m_cur_treebank_filename = "!";
        }
    }
};
 
} // -- namespace io
} // -- namespace lal