File: ZOrderLayout.cpp

package info (click to toggle)
tulip 4.6.0dfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 139,284 kB
  • ctags: 35,942
  • sloc: cpp: 289,758; ansic: 27,264; python: 1,256; sh: 923; yacc: 522; xml: 337; makefile: 258; php: 66; lex: 55
file content (87 lines) | stat: -rw-r--r-- 2,455 bytes parent folder | download
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/**
 *
 * This file is part of Tulip (www.tulip-software.org)
 *
 * Authors: David Auber and the Tulip development Team
 * from LaBRI, University of Bordeaux
 *
 * Tulip is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tulip is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 *
 */

#include <iostream>
#include <cmath>
#include <climits>

#include "ZOrderLayout.h"

using namespace std;
using namespace pocore;

//===============================================================
namespace {
inline Vec2i zorderPoint(const unsigned int key, const unsigned char order) {
  //  cerr << "========" << endl;
  unsigned char bits;
  Vec2i point;
  point.fill(0);

  for (char i = order - 1; i >= 0; --i) {
    //read two bits;
    bits = (key >> (i << 1))  & 3;
    point[1] += (bits & 1) << i;
    point[0] += ((bits >> 1) ) << i;
  }

  return point;
}

inline unsigned int zorderKey(const Vec2i &p, const unsigned char order) {
  //  cerr << "========" << endl;
  unsigned int key = 0;
  unsigned char bits;

  for (char i = order - 1; i >= 0; --i) {
    //read two bits;
    bits = (p[1] >> i)  & 1;
    bits += ((p[0] >> i)  & 1) << 1;
    key += bits << (i << 1);
  }

  return key;
}
}
//===============================================================
namespace pocore {
ZorderLayout::ZorderLayout(unsigned char order):order(order) {
  shift = (int)rint(sqrt(pow(4., order))/2.);
}
//==============================================================
unsigned int ZorderLayout::unproject(const Vec2i &point) const {
  //    cerr << point << " ==> " << shift << " order=" << (int)order << endl;
  Vec2i p;

  if (point[0] <= -shift || point[0] >= shift)
    return UINT_MAX;

  if (point[1] <= -shift || point[1] >= shift)
    return UINT_MAX;

  p[0] = point[0] + shift;
  p[1] = point[1] + shift;
  return zorderKey(p, order);
}
//==============================================================
Vec2i ZorderLayout::project(const unsigned int id) const {
  return zorderPoint(id, order)-=shift;
}
}
//==============================================================================