/* * 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 * 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 #include "triples.h" #include "pairs.h" namespace ePiX { // basic edge data: ordered endpoints and visibility flag template 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

edge3d; typedef edge_data edge2d; } // end of namespace #endif /* EPIX_EDGE_DATA */