summaryrefslogtreecommitdiffstats
path: root/raslib/minterval.icc
blob: aec847fd003d513308103576abf85d6aa2bd1516 (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
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
/*
* This file is part of rasdaman community.
*
* Rasdaman community is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Rasdaman community 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.
*
* You should have received a copy of the GNU General Public License
* along with rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * INLINE SOURCE: minterval.icc
 *
 * MODULE:  raslib
 * CLASS:   r_Minterval
 *
 * COMMENTS:
 *
*/

// -*-C++-*- (for Emacs)
#include "raslib/rminit.hh"
#include "raslib/error.hh"

inline r_Dimension 
r_Minterval::dimension() const
{
  return dimensionality;
}

inline const bool 
r_Minterval::is_origin_fixed() const
{
  bool retval=true;

  if(!dimensionality)
  {
     retval=false;
  }
  else
  {
  for(r_Dimension i=0; i < dimensionality; i++)
     retval &= intervals[i].is_low_fixed();
  }
   
  return retval;
}

inline const bool
r_Minterval::is_high_fixed() const
{
  bool retval=true;
  
  if(!dimensionality)
  {
   //we have an uninitialized interval
   retval=false;
  }   
  else
  {
   for(r_Dimension i=0; i < dimensionality; i++)
      retval &= intervals[i].is_high_fixed();
  }
   
  return retval;
}



inline const bool
r_Minterval::covers( const r_Point& pnt ) const
	{
	bool retval = true;
	if (dimensionality == pnt.dimension())
		{
		for (r_Dimension i = 0; i < pnt.dimension(); i++)
			{
			if ((intervals[i].is_low_fixed() && pnt[i] < intervals[i].low()) || (intervals[i].is_high_fixed() && pnt[i] > intervals[i].high()))
				{
				retval = false;
				break;
				}
			}
		}
	else	{
		RMInit::logOut << "r_Minterval::covers(" << pnt << ") dimensions do not match" << endl;
		retval=false;
		}
		
	return retval;
	}


inline const bool
r_Minterval::covers( const r_Minterval& inter2  ) const 
	{
	bool retval = true;
	if (dimensionality == inter2.dimension())
		{
		for (r_Dimension i = 0; i < dimensionality ; i++)
			{
			// first check if i am low fixed and the other isn't: false
			// both are low fixed
			// check if i am smaller than the other: false
			// second check if i am high fixed and the other isn't: false
			// both are high fixed
			// check if i am smaller than the other: false
			if 	(
				(intervals[i].is_low_fixed() && (!(inter2[i].is_low_fixed()) || intervals[i].low() > inter2[i].low()))
				||
				(intervals[i].is_high_fixed() && (!(inter2[i].is_high_fixed()) || intervals[i].high() < inter2[i].high()))
				)
				{
				retval = false;
				break;
				}
			}
		}
	else	{
		RMInit::logOut << "r_Minterval::covers(" << inter2 << ") dimensions do not match" << endl;
		retval=false;
		}
		
	return retval;
	}