src/map/ENC/atlasdata.cpp

   1 #include "atlasdata.h"
   2
   3 using namespace ENC;
   4
   5 bool AtlasData::pointCb(const QString *map, void *context)
   6 {
   7         PointCTX *ctx = (PointCTX*)context;
   8
   9         ctx->lock.lock();
  10
  11         MapData *cached = ctx->cache.object(map);
  12
  13         if (!cached) {
  14                 MapData *data = new MapData(*map);
  15                 data->points(ctx->rect, ctx->points);
  16                 if (!ctx->cache.insert(map, data))
  17                         delete data;
  18         } else
  19                 cached->points(ctx->rect, ctx->points);
  20
  21         ctx->lock.unlock();
  22
  23         return true;
  24 }
  25
  26 bool AtlasData::polyCb(const QString *map, void *context)
  27 {
  28         PolyCTX *ctx = (PolyCTX*)context;
  29
  30         ctx->lock.lock();
  31
  32         MapData *cached = ctx->cache.object(map);
  33
  34         if (!cached) {
  35                 MapData *data = new MapData(*map);
  36                 data->polygons(ctx->rect, ctx->polygons);
  37                 data->lines(ctx->rect, ctx->lines);
  38                 if (!ctx->cache.insert(map, data))
  39                         delete data;
  40         } else {
  41                 cached->polygons(ctx->rect, ctx->polygons);
  42                 cached->lines(ctx->rect, ctx->lines);
  43         }
  44
  45         ctx->lock.unlock();
  46
  47         return true;
  48 }
  49
  50 AtlasData::~AtlasData()
  51 {
  52         MapTree::Iterator it;
  53         for (_tree.GetFirst(it); !_tree.IsNull(it); _tree.GetNext(it))
  54                 delete _tree.GetAt(it);
  55 }
  56
  57 void AtlasData::addMap(const RectC &bounds, const QString &path)
  58 {
  59         double min[2], max[2];
  60
  61         min[0] = bounds.left();
  62         min[1] = bounds.bottom();
  63         max[0] = bounds.right();
  64         max[1] = bounds.top();
  65
  66         _tree.Insert(min, max, new QString(path));
  67 }
  68
  69 void AtlasData::polys(const RectC &rect, QList<MapData::Poly> *polygons,
  70   QList<MapData::Line> *lines)
  71 {
  72         double min[2], max[2];
  73         PolyCTX polyCtx(rect, polygons, lines, _cache, _lock);
  74
  75         min[0] = rect.left();
  76         min[1] = rect.bottom();
  77         max[0] = rect.right();
  78         max[1] = rect.top();
  79
  80         _tree.Search(min, max, polyCb, &polyCtx);
  81 }
  82
  83 void AtlasData::points(const RectC &rect, QList<MapData::Point> *points)
  84 {
  85         double min[2], max[2];
  86         PointCTX pointCtx(rect, points, _cache, _lock);
  87
  88         min[0] = rect.left();
  89         min[1] = rect.bottom();
  90         max[0] = rect.right();
  91         max[1] = rect.top();
  92
  93         _tree.Search(min, max, pointCb, &pointCtx);
  94 }