---

more/gen/hook.h

Go to the documentation of this file.

//  Copyright (C) 2001  Petter Urkedal (petter.urkedal@matfys.lth.se)

//  This file 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 2 of the License, or
//  (at your option) any later version.

//  This file 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 this program; if not, write to the Free Software
//  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

//  As a special exception, you may use this file as part of a free
//  software library without restriction.  Specifically, if other files
//  instantiate templates or use macros or inline functions from this
//  file, or you compile this file and link it with other files to
//  produce an executable, this file does not by itself cause the
//  resulting executable to be covered by the GNU General Public
//  License.  This exception does not however invalidate any other
//  reasons why the executable file might be covered by the GNU General
//  Public License.

//  $Id: hook.h,v 1.1 2002/05/30 18:01:37 petter_urkedal Exp $


#ifndef MORE_HOOK_H
#define MORE_HOOK_H

#include <vector>

namespace more {
namespace gen {

  template<typename Generator = void (*)(void)>
    struct hook {
        typedef Generator function_type;

        // Use vector to optimize for running and for LIFO insert/erase.
        typedef std::vector<function_type> container;

        int n_gc_mark_hook;
        void run() {
            for (typename container::iterator it = vect.begin();
                 it != vect.end(); ++it)
                (**it)();
        }
        void insert(function_type f) { vect.push_back(f); }
        void erase(function_type f) {
            // optimize for LIFO,
            typename container::reverse_iterator
                it = find(vect.rbegin(), vect.rend(), f);
            if (it == vect.rend()) return;
            vect.erase(vect.end() - ((it - vect.rbegin()) + 1));
        }
      private:
        container vect;
    };

}} // more::gen

#endif

---