src.libs/CjNS_prev.hh

/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
 * mitie
 * Copyright (C) Jason Spencer 2009 <mitie@jasonspencer.org>
 * 
 * mitie 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.
 * 
 * mitie 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, see <http://www.gnu.org/licenses/>.
 */

#ifndef _CJNS_PREV_H_
#define _CJNS_PREV_H_ 1

#include "CjNodeSelector.hh"
#include <string>
#include "JLOG.hh"

namespace jmitie {
        namespace corelib {
class CjNS_prev: public CjNodeSelector {
public:
static std::string getName_static() { return "prev"; }
virtual std::string getName() const { return getName_static(); }
std::string getProperty(const std::string & prop) const { return getProperty_static(prop); }
static std::string getProperty_static(const std::string & opt) {
        if(opt=="desc") return "Selects a node from a previous operation.";
        if(opt=="usage") return getProperty_static("desc") + "\n" +
                        getName_static() + "={(rem,add),(bigD|smallD|old|new)}\n"\
                        "Where\trem states that the choice should be between the two nodes most recently disconnected.\n"\
                        "\tadd that the choice should be between the two nodes most recently connected.\n"\
                        "\tbigD selects the node with the higher degree of the two.\n"\
                        "\tsmallD selects the node with the smaller degree of the two.\n"\
                        "\told selects the node with the lower node number of the two.\n"\
                        "\tnew selects the node with the higher node number of the two.\n";
                        getName_static() + "=M\tAlways selects node number M.\n";
        throw std::invalid_argument("CjNS_prev::getProperty_static(" + opt + "): Unknown property requested.");
}

CjNS_prev(std::string args, const ctor_va_t & );
virtual bool selectNode( select_arg_t &, unsigned int & node );
virtual ~CjNS_prev() { JLOG(5, std::cout << "CjNS_prev being destroyed." << std::endl; ) };

protected:
bool m_add_remove;      // if false then check last added link, otherwise last removed
enum prev_selection_type_t { NONE, BIGD, SMALLD, OLDER, NEWER };
prev_selection_type_t m_selecta;        // Selecta! This is the criteria on which we are to select the node

};
} // namespace corelib
} // namespace jmitie

#endif // _CJNS_PREV_H_