36 if (!(prec >= 0 && prec <= maxprec_))
40 if (isnan(x) || isnan(y)) {
44 char grid[2 + 2 * maxprec_];
46 xh = int(floor(x / tile_)),
47 yh = int(floor(y / tile_));
54 grid[z++] = letters_[(tilegrid_ - (yh / tilegrid_) - 1)
55 * tilegrid_ + (xh / tilegrid_)];
56 grid[z++] = letters_[(tilegrid_ - (yh % tilegrid_) - 1)
57 * tilegrid_ + (xh % tilegrid_)];
59 real mult =
real(pow(
real(base_), max(tilelevel_ - prec, 0)));
61 ix = int(floor(xf / mult)),
62 iy = int(floor(yf / mult));
63 for (
int c = min(prec,
int(tilelevel_)); c--;) {
64 grid[z + c] = digits_[ ix % base_ ];
66 grid[z + c + prec] = digits_[ iy % base_ ];
69 if (prec > tilelevel_) {
70 xf -= floor(xf / mult);
71 yf -= floor(yf / mult);
72 mult =
real(pow(
real(base_), prec - tilelevel_));
73 ix = int(floor(xf * mult));
74 iy = int(floor(yf * mult));
75 for (
int c = prec - tilelevel_; c--;) {
76 grid[z + c + tilelevel_] = digits_[ ix % base_ ];
78 grid[z + c + tilelevel_ + prec] = digits_[ iy % base_ ];
82 int mlen = z + 2 * prec;
84 copy(grid, grid + mlen, gridref.begin());