blob: 2bfbfee11e370ce83b07836c4f354e5cb23cdef5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
#pragma once
#include "../geometry/screenbase.hpp"
#include "../geometry/rect2d.hpp"
#include "../std/vector.hpp"
class Tiler
{
public:
struct RectInfo
{
int m_tileScale; //< bounds / (2 ^ m_tileScale) is a size of the grid for a tile,
//< could be larger than maximum model scale
int m_x;
int m_y;
m2::RectD m_rect;
RectInfo();
RectInfo(int tileScale, int x, int y);
void initRect();
};
private:
ScreenBase m_screen;
m2::PointD m_centerPt;
int m_tileScale;
size_t m_tileSize;
int getTileScale(ScreenBase const & s, int ts) const;
public:
Tiler();
/// seed tiler with new screenBase.
void seed(ScreenBase const & screenBase, m2::PointD const & centerPt, size_t tileSize);
void tiles(vector<RectInfo> & tiles, int depth);
bool isLeaf(RectInfo const & ri) const;
int tileScale() const;
};
struct LessByScaleAndDistance
{
m2::PointD m_pt;
LessByScaleAndDistance(m2::PointD const & pt);
bool operator()(Tiler::RectInfo const & l, Tiler::RectInfo const & r);
};
bool operator<(Tiler::RectInfo const & l, Tiler::RectInfo const & r);
bool operator==(Tiler::RectInfo const & l, Tiler::RectInfo const & r);
|