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 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
|
/*
* $Revision: 2615 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-16 14:23:36 +0200 (Mo, 16. Jul 2012) $
***************************************************************/
/** \file
* \brief Declaration and implementation of class Tuple2, Tuple3
* and Tuple4.
*
* \author Carsten Gutwenger
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program 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.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_TUPLE_H
#define OGDF_TUPLE_H
#include "basic.h"
#include "Hashing.h"
namespace ogdf {
//! Tuples of two elements (2-tuples).
/**
* @tparam E1 is the data type for the first element.
* @tparam E2 is the data type for the second element.
*/
template<class E1, class E2> class Tuple2 {
public:
E1 m_x1; //!< The first element.
E2 m_x2; //!< The second element.
//! Constructs a 2-tuple using default constructors.
Tuple2() { }
//! Constructs a 2-tuple for given values.
Tuple2(const E1 &y1, const E2 &y2) : m_x1(y1), m_x2(y2) { }
//! Constructs a 2-tuple that is a copy of \a t2.
Tuple2(const Tuple2<E1,E2> &t2) : m_x1(t2.m_x1), m_x2(t2.m_x2) { }
//! Returns a reference the first element.
const E1 &x1() const { return m_x1; }
//! Returns a reference the second element.
const E2 &x2() const { return m_x2; }
//! Returns a reference the first element.
E1 &x1() { return m_x1; }
//! Returns a reference the second element.
E2 &x2() { return m_x2; }
// default assignment operator
OGDF_NEW_DELETE
};
//! Equality operator for 2-tuples
template<class E1, class E2>
bool operator==(const Tuple2<E1,E2> &t1, const Tuple2<E1,E2> &t2)
{
return t1.x1() == t2.x1() && t1.x2() == t2.x2();
}
//! Inequality operator for 2-tuples
template<class E1, class E2>
bool operator!=(const Tuple2<E1,E2> &t1, const Tuple2<E1,E2> &t2)
{
return t1.x1() != t2.x1() || t1.x2() != t2.x2();
}
//! Output operator for 2-tuples.
template<class E1, class E2>
ostream &operator<<(ostream &os, const Tuple2<E1,E2> &t2)
{
os << "(" << t2.x1() << " " << t2.x2() << ")";
return os;
}
//! Tuples of three elements (3-tuples).
/**
* @tparam E1 is the data type for the first element.
* @tparam E2 is the data type for the second element.
* @tparam E3 is the data type for the third element.
*/
template<class E1, class E2, class E3> class Tuple3 {
public:
E1 m_x1; //!< The first element.
E2 m_x2; //!< The second element.
E3 m_x3; //!< The third element.
//! Constructs a 3-tuple using default constructors.
Tuple3() { }
//! Constructs a 3-tuple for given values.
Tuple3(const E1 &y1, const E2 &y2, const E3 &y3) :
m_x1(y1), m_x2(y2), m_x3(y3) { }
//! Constructs a 3-tuple that is a copy of \a t3.
Tuple3(const Tuple3<E1,E2,E3> &t3) :
m_x1(t3.m_x1), m_x2(t3.m_x2), m_x3(t3.m_x3) { }
//! Returns a reference the first element.
const E1 &x1() const { return m_x1; }
//! Returns a reference the second element.
const E2 &x2() const { return m_x2; }
//! Returns a reference the third element.
const E3 &x3() const { return m_x3; }
//! Returns a reference the first element.
E1 &x1() { return m_x1; }
//! Returns a reference the second element.
E2 &x2() { return m_x2; }
//! Returns a reference the third element.
E3 &x3() { return m_x3; }
// default assignment operator
OGDF_NEW_DELETE
};
//! Equality operator for 3-tuples
template<class E1, class E2, class E3>
bool operator==(const Tuple3<E1,E2,E3> &t1, const Tuple3<E1,E2,E3> &t2)
{
return t1.x1() == t2.x1() && t1.x2() == t2.x2() && t1.x3() == t2.x3();
}
//! Inequality operator for 3-tuples
template<class E1, class E2, class E3>
bool operator!=(const Tuple3<E1,E2,E3> &t1, const Tuple3<E1,E2,E3> &t2)
{
return t1.x1() != t2.x1() || t1.x2() != t2.x2() || t1.x3() != t2.x3();
}
//! Output operator for 3-tuples
template<class E1, class E2, class E3>
ostream &operator<<(ostream &os, const Tuple3<E1,E2,E3> &t3)
{
os << "(" << t3.x1() << " " << t3.x2() << " " << t3.x3() << ")";
return os;
}
//! Tuples of four elements (4-tuples).
/**
* @tparam E1 is the data type for the first element.
* @tparam E2 is the data type for the second element.
* @tparam E3 is the data type for the third element.
* @tparam E4 is the data type for the fourth element.
*/
template<class E1, class E2, class E3, class E4> class Tuple4 {
public:
E1 m_x1; //!< The first element.
E2 m_x2; //!< The second element.
E3 m_x3; //!< The third element.
E4 m_x4; //!< The fourth element.
//! Constructs a 4-tuple using default constructors.
Tuple4() { }
//! Constructs a 4-tuple for given values.
Tuple4(const E1 &y1, const E2 &y2, const E3 &y3, const E4 &y4) :
m_x1(y1), m_x2(y2), m_x3(y3), m_x4(y4) { }
//! Constructs a 4-tuple that is a copy of \a t4.
Tuple4(const Tuple4<E1,E2,E3,E4> &t4) :
m_x1(t4.m_x1), m_x2(t4.m_x2), m_x3(t4.m_x3), m_x4(t4.m_x4) { }
//! Returns a reference the first element.
const E1 &x1() const { return m_x1; }
//! Returns a reference the second element.
const E2 &x2() const { return m_x2; }
//! Returns a reference the third element.
const E3 &x3() const { return m_x3; }
//! Returns a reference the fourth element.
const E4 &x4() const { return m_x4; }
//! Returns a reference the first element.
E1 &x1() { return m_x1; }
//! Returns a reference the second element.
E2 &x2() { return m_x2; }
//! Returns a reference the third element.
E3 &x3() { return m_x3; }
//! Returns a reference the fourth element.
E4 &x4() { return m_x4; }
// default assignment operator
OGDF_NEW_DELETE
};
//! Equality operator for 4-tuples
template<class E1, class E2, class E3, class E4>
bool operator==(const Tuple4<E1,E2,E3,E4> &t1, const Tuple4<E1,E2,E3,E4> &t2)
{
return t1.x1() == t2.x1() && t1.x2() == t2.x2() &&
t1.x3() == t2.x3() && t1.x4() == t2.x4();
}
//! Inequality operator for 4-tuples
template<class E1, class E2, class E3, class E4>
bool operator!=(const Tuple4<E1,E2,E3,E4> &t1, const Tuple4<E1,E2,E3,E4> &t2)
{
return t1.x1() != t2.x1() || t1.x2() != t2.x2() ||
t1.x3() != t2.x3() || t1.x4() != t2.x4();
}
//! Output operator for 4-tuples
template<class E1, class E2, class E3, class E4>
ostream &operator<<(ostream &os, const Tuple4<E1,E2,E3,E4> &t4)
{
os << "(" << t4.x1() << " " << t4.x2() << " " <<
t4.x3() << " " << t4.x4() << ")";
return os;
}
template<typename K1_, typename K2_,
typename Hash1_ = DefHashFunc<K1_>,
typename Hash2_ = DefHashFunc<K2_> >
class HashFuncTuple
{
public:
HashFuncTuple() { }
HashFuncTuple(const Hash1_ &hash1, const Hash2_ &hash2)
: m_hash1(hash1), m_hash2(hash2) { }
size_t hash(const Tuple2<K1_,K2_> &key) const {
return 23*m_hash1.hash(key.x1()) + 443*m_hash2.hash(key.x2());
}
private:
Hash1_ m_hash1;
Hash2_ m_hash2;
};
} // namespace ogdf
#endif
|