reference_cache.h

Go to the documentation of this file.

#ifndef REFERENCE_CACHE_H
#define REFERENCE_CACHE_H
#pragma once
/***************************************************************************
 *   Copyright (C) 2007-2013 Mike Kinghan, imk@burroingroingjoing.com      *
 *   All rights reserved.                                                  *
 *                                                                         *
 *   Contributed originally by Mike Kinghan, imk@burroingroingjoing.com    *
 *                                                                         *
 *   Redistribution and use in source and binary forms, with or without    *
 *   modification, are permitted provided that the following conditions    *
 *   are met:                                                              *
 *                                                                         *
 *   Redistributions of source code must retain the above copyright        *
 *   notice, this list of conditions and the following disclaimer.         *
 *                                                                         *
 *   Redistributions in binary form must reproduce the above copyright     *
 *   notice, this list of conditions and the following disclaimer in the   *
 *   documentation and/or other materials provided with the distribution.  *
 *                                                                         *
 *   Neither the name of Mike Kinghan nor the names of its contributors    *
 *   may be used to endorse or promote products derived from this software *
 *   without specific prior written permission.                            *
 *                                                                         *
 *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS   *
 *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT     *
 *   LIMITED TO, THE IMPLIED WARRANTIES OF  MERCHANTABILITY AND FITNESS    *
 *   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE        *
 *   COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,   *
 *   INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,  *
 *   BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS *
 *   OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED    *
 *   AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,*
 *   OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF *
 *   THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH  *
 *   DAMAGE.                                                               *
 *                                                                         *
 **************************************************************************/

#include "evaluation.h"
#include <string>
#include <map>

struct reference_cache
{
        struct entry
        {
                entry(
                        std::string const & expansion,
                        evaluation const & eval,
                        bool reported = false,
                        bool complete = true)
                :       _expansion(expansion),_eval(eval),_reported(reported),
                        _complete(complete){}

                std::string const & expansion() const {
                        return _expansion;
                }

                evaluation const & eval() const {
                        return _eval;
                }
                evaluation & eval() {
                        return _eval;
                }

                bool reported() const {
                        return _reported;
                }

                void set_reported(bool value = true) {
                        _reported = value;
                }

                bool complete() const {
                        return _complete;
                }

                void set_complete(bool value = true) {
                        _complete = value;
                }

        private:
                std::string _expansion;
                evaluation _eval;
                bool _reported;
                bool _complete;
        };

        using map = std::map<std::string,entry>;
        using value_type = map::value_type;
        using iterator = map::iterator;
        using const_iterator = map::const_iterator;
        using insert_result = std::pair<iterator,bool>;

        static iterator insert(value_type const & v, iterator hint) {
                return get_map().insert(hint,v);
        }


        static iterator
        insert(std::string const & key, entry const & e, iterator hint) {
                return insert(value_type(key,e),hint);
        }

        static iterator lower_bound(std::string const & key) {
                return get_map().lower_bound(key);
        }

        static void erase_symbol(std::string const & id){
                auto i = get_map().lower_bound(id);
                while (i != get_map().end()) {
                        std::string const & key = i->first;
                        if (key.find(id) == 0 &&
                                (key.length() == id.length() || key[id.length()] == '(')) {
                                i = get_map().erase(i);
                        } else {
                                break;
                        }
                }
        }

        static void clear() {
                get_map().clear();
        }

        template<class Iter>
        static bool at_end(Iter i) {
                return i == get_map().end();
        }

private:

        static map & get_map() {
                static map the_map;
                return the_map;
        }
};

#endif //EOF