process_treebank_base.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
 
// C++ includes
#include <array>
 
// lal includes
#include <lal/io/treebank_feature.hpp>
 
namespace lal {
namespace io {
 
class _process_treebank_base {
public:
    // MODIFIERS
 
    inline void add_feature(const treebank_feature& fs) noexcept
    { m_what_fs[ static_cast<size_t>(fs) ] = true; }
    inline void remove_feature(const treebank_feature& fs) noexcept
    { m_what_fs[ static_cast<size_t>(fs) ] = false; }
 
    // SETTERS
 
    inline void set_check_before_process(bool v) noexcept {
        m_check_before_process = v;
    }
 
    inline void clear_features() noexcept {
        std::fill(m_what_fs.begin(), m_what_fs.end(), false);
    }
 
    inline void set_separator(char c) noexcept { m_separator = c; }
    inline void set_verbosity(int k) noexcept { m_be_verbose = k; }
    inline void set_output_header(bool h) noexcept { m_output_header = h; }
 
    // GETTERS
 
    inline bool has_feature(const treebank_feature& fs) const noexcept
    { return m_what_fs[ static_cast<size_t>(fs) ]; }
 
protected:
    std::array<bool, __treebank_feature_size> m_what_fs;
 
    bool m_check_before_process = true;
    char m_separator = '\t';
    bool m_output_header = true;
    int m_be_verbose = 0;
};
 
} // -- namespace io
} // -- namespace lal