FasterTrie.hpp

Go to the documentation of this file.

#ifndef AI_TOOLBOX_FACTORED_FASTER_TRIE_HEADER_FILE
#define AI_TOOLBOX_FACTORED_FASTER_TRIE_HEADER_FILE
 
#include <random>
#include <AIToolbox/Factored/Types.hpp>
#include <AIToolbox/Factored/Utils/Core.hpp>
 
namespace AIToolbox::Factored {
    class FasterTrie {
        public:
            using Entry = std::pair<size_t, PartialFactors>;
            using Entries = std::vector<Entry>;
 
            FasterTrie(Factors f);
 
            size_t insert(PartialFactors pf);
 
            void erase(size_t id, const PartialFactors & pf);
 
            std::vector<size_t> filter(const Factors & f) const;
 
            std::tuple<Entries, Factors> reconstruct(const PartialFactors & pf, bool remove = false);
 
            size_t size() const;
 
            const Factors & getF() const;
 
        private:
            Factors F;
            size_t counter_;
 
            std::vector<std::vector<Entries>> keys_;
 
            mutable std::ranlux24_base rand_; // Fastest engine possible, don't care about quality
            mutable std::vector<std::vector<size_t>> orders_;
    };
}
 
#endif