summaryrefslogtreecommitdiff
path: root/graphics/epix/edge_data.h
blob: 60d7a8bf563e8b554737b9694c51f017f5a6da0a (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
/* 
 * edge_data.h -- ePiX::edge implementation classes for polyline/polygon
 *
 * This file is part of ePiX, a C++ library for creating high-quality 
 * figures in LaTeX 
 *
 * Version 1.1.17
 * Last Change: September 13, 2007
 *
 * 
 * Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
 * Andrew D. Hwang <rot 13 nujnat at zngupf dot ubylpebff dot rqh>
 * Department of Mathematics and Computer Science
 * College of the Holy Cross
 * Worcester, MA, 01610-2395, USA
 *
 *
 * ePiX 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 2 of the License, or
 * (at your option) any later version.
 *
 * ePiX 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 ePiX; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 */
#ifndef EPIX_EDGE_DATA
#define EPIX_EDGE_DATA
#include <algorithm>

#include "triples.h"
#include "pairs.h"

namespace ePiX {

  // basic edge data: ordered endpoints and visibility flag
  template<typename T> class edge_data {
  public:
    edge_data(const T& fm, const T& to, bool seen)
      : m_tail(fm), m_head(to), m_seen(seen) { }

    T tail()    const { return m_tail; }
    T head()    const { return m_head; }
    bool is_seen() const { return m_seen; }
    bool is_null() const { return m_tail == m_head; }

    edge_data& reverse()
      {
	std::swap(m_tail, m_head);
	return *this;
      }

    double length() const
      {
	return norm(m_head - m_tail);
      }

    void seen(bool S) { m_seen=S; }

  private:
    T m_tail;
    T m_head;
    bool m_seen;
  };

  typedef edge_data<P>    edge3d;
  typedef edge_data<pair> edge2d;
} // end of namespace

#endif /* EPIX_EDGE_DATA */