PredicateIndex.hpp

/*
 
Copyright © 2023-24 Sean Holden. All rights reserved.
 
*/
/*
 
This file is part of Connect++.
 
Connect++ is free software: you can redistribute it and/or modify it 
under the terms of the GNU General Public License as published by the 
Free Software Foundation, either version 3 of the License, or (at your 
option) any later version.
 
Connect++ 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 General Public License for 
more details.
 
You should have received a copy of the GNU General Public License along 
with Connect++. If not, see <https://www.gnu.org/licenses/>. 
 
*/
 
#ifndef PREDICATEINDEX_HPP
#define PREDICATEINDEX_HPP
 
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<unordered_map>
 
#include "Predicate.hpp"
#include "FunctionHash.hpp"
 
using std::pair;
using std::vector;
using std::unordered_map;
using std::string;
using std::ostream;
using std::endl;
using std::cerr;
 
using PredIndexType = pair<string, Arity>;
using PredMapType = pair<PredIndexType, Predicate*>;
 
class PredicateIndex {
private:
    vector<Predicate*> preds;
    unordered_map<PredIndexType, Predicate*, fun_hash> name_index;
    ID next_index;
public:
    PredicateIndex();
    ~PredicateIndex();
    PredicateIndex(const PredicateIndex&) = delete;
    PredicateIndex(const PredicateIndex&&) = delete;
    PredicateIndex& operator=(const PredicateIndex&) = delete;
    PredicateIndex& operator=(const PredicateIndex&&) = delete;
    inline size_t get_num_preds() const { return preds.size(); }
    Predicate* add_predicate(const string&, Arity);
    Predicate* find_predicate(const string&, Arity);
    Arity find_maximum_arity() const;
    bool true_false_added() const;
    Predicate* operator[](size_t i) { return preds[i]; }
 
    friend ostream& operator<<(ostream&, const PredicateIndex&);
};
 
#endif