2000-07-24 13:53:19 +00:00
|
|
|
/* This file is part of
|
|
|
|
* ======================================================
|
|
|
|
*
|
|
|
|
* LyX, The Document Processor
|
|
|
|
*
|
|
|
|
* Copyright 1995 Matthias Ettrich
|
|
|
|
* Copyright 1995-2000 The LyX Team.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* ====================================================== */
|
|
|
|
|
|
|
|
#ifdef __GNUG__
|
|
|
|
#pragma implementation
|
|
|
|
#endif
|
|
|
|
|
2000-07-17 18:27:53 +00:00
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include "counters.h"
|
|
|
|
#include "debug.h"
|
|
|
|
|
|
|
|
#ifdef SIGC_CXX_NAMESPACES
|
|
|
|
using SigC::Connection;
|
|
|
|
using SigC::slot;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
using std::endl;
|
|
|
|
|
|
|
|
|
|
|
|
Counter::Counter()
|
|
|
|
{
|
|
|
|
reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counter::set(int v)
|
|
|
|
{
|
|
|
|
value_ = v;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counter::addto(int v)
|
|
|
|
{
|
|
|
|
value_ += v;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int Counter::value() const
|
|
|
|
{
|
|
|
|
return value_;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counter::step()
|
|
|
|
{
|
|
|
|
++value_;
|
|
|
|
onstep.emit();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counter::reset()
|
|
|
|
{
|
|
|
|
value_ = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Counters::~Counters()
|
|
|
|
{
|
|
|
|
// We need this since we store the Counter's as pointers in
|
|
|
|
// the counterList.
|
|
|
|
for (CounterList::iterator it = counterList.begin();
|
|
|
|
it != counterList.end();
|
|
|
|
++it)
|
|
|
|
delete (*it).second;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counters::newCounter(string const & newc)
|
|
|
|
{
|
|
|
|
// First check if newc already exist
|
2000-09-26 13:54:57 +00:00
|
|
|
CounterList::iterator cit = counterList.find(newc);
|
2000-07-17 18:27:53 +00:00
|
|
|
// if alrady exist give warning and return
|
|
|
|
if (cit != counterList.end()) {
|
|
|
|
lyxerr << "The new counter already exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
counterList[newc] = new Counter;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counters::newCounter(string const & newc, string const & oldc)
|
|
|
|
{
|
|
|
|
// First check if newc already exist
|
2000-09-26 13:54:57 +00:00
|
|
|
CounterList::iterator cit = counterList.find(newc);
|
2000-07-17 18:27:53 +00:00
|
|
|
// if already existant give warning and return
|
|
|
|
if (cit != counterList.end()) {
|
|
|
|
lyxerr << "The new counter already exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// then check if oldc exist
|
|
|
|
CounterList::iterator it = counterList.find(oldc);
|
|
|
|
// if not give warning and return
|
|
|
|
if (it == counterList.end()) {
|
|
|
|
lyxerr << "The old counter does not exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
Counter * tmp = new Counter;
|
|
|
|
(*it).second->onstep.connect(slot(tmp,
|
|
|
|
&Counter::reset));
|
|
|
|
counterList[newc] = tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counters::set(string const & ctr, int val)
|
|
|
|
{
|
|
|
|
CounterList::iterator it = counterList.find(ctr);
|
|
|
|
if (it == counterList.end()) {
|
|
|
|
lyxerr << "Counter does not exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(*it).second->set(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counters::addto(string const & ctr, int val)
|
|
|
|
{
|
|
|
|
CounterList::iterator it = counterList.find(ctr);
|
|
|
|
if (it == counterList.end()) {
|
|
|
|
lyxerr << "Counter does not exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(*it).second->addto(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int Counters::value(string const & ctr) const
|
|
|
|
{
|
|
|
|
CounterList::const_iterator cit = counterList.find(ctr);
|
|
|
|
if (cit == counterList.end()) {
|
|
|
|
lyxerr << "Counter does not exist." << endl;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return (*cit).second->value();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Counters::step(string const & ctr)
|
|
|
|
{
|
|
|
|
CounterList::iterator it = counterList.find(ctr);
|
|
|
|
if (it == counterList.end()) {
|
|
|
|
lyxerr << "Counter does not exist." << endl;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(*it).second->step();
|
|
|
|
}
|