lyx_mirror/src/coordcache.h
Alfredo Braunstein a2cd656e25 CoordBranch merge
git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@9325 a592a061-630c-0410-9148-cb99ea01b6c8
2004-11-30 01:59:49 +00:00

114 lines
1.9 KiB
C++

#ifndef COORDCACHE_H
#define COORDCACHE_H
class InsetBase;
class LyXText;
class MathArray;
class Paragraph;
#include "support/types.h"
#include <boost/assert.hpp>
#include <map>
// All positions cached in this cache are only valid between subsequent
// updated. (x,y) == (0,0) is the upper left screen corner, x increases
// to the right, y increases downwords.
void lyxbreaker(void const * data, const char * hint, int size);
void lyxaborter(int x, int y);
struct Point {
Point()
: x_(0), y_(0)
{}
Point(int x, int y) : x_(x), y_(y)
{
BOOST_ASSERT(x > -3000);
BOOST_ASSERT(x < 4000);
BOOST_ASSERT(y > -3000);
BOOST_ASSERT(y < 4000);
}
int x_, y_;
};
template <class T> class CoordCacheBase {
public:
void clear()
{
data_.clear();
}
void add(T const * thing, int x, int y)
{
data_[thing] = Point(x, y);
}
int x(T const * thing) const
{
check(thing, "x");
return data_.find(thing)->second.x_;
}
int y(T const * thing) const
{
check(thing, "y");
return data_.find(thing)->second.y_;
}
Point xy(T const * thing) const
{
check(thing, "xy");
return data_.find(thing)->second;
}
bool has(T const * thing) const
{
return data_.find(thing) != data_.end();
}
// T * find(int x, int y) const
// {
// T *
// cache_type iter
// }
private:
friend class CoordCache;
void check(T const * thing, char const * hint) const
{
if (!has(thing))
lyxbreaker(thing, hint, data_.size());
}
typedef std::map<T const *, Point> cache_type;
cache_type data_;
};
class CoordCache {
public:
void clear();
Point get(LyXText const *, lyx::pit_type);
CoordCacheBase<MathArray> arrays_;
// all insets
CoordCacheBase<InsetBase> insets_;
// paragraph grouped by owning text
typedef std::map<lyx::pit_type, Point> InnerParPosCache;
typedef std::map<LyXText const *, InnerParPosCache> ParPosCache;
ParPosCache pars_;
};
extern CoordCache theCoords;
#endif