simplexD2indexed< INDX > Class Template Reference

Indexed triangle. More...

#include <simplexD2indexed.h>

Collaboration diagram for simplexD2indexed< INDX >:

List of all members.

Public Member Functions
	simplexD2indexed ()
	Construct a null triangle.
	simplexD2indexed (INDX const a, INDX const b, INDX const c)
	Construct a triangle.
boolc	operator== (simplexD2indexed< INDX > const &t) const
	Are two triangles the same?
void	setnull ()
	Set all fields to 0.
boolc	isnull () const
	Is this a triangle? Are all the fields set to zero?
ostream &	print (ostream &os) const
	Global << calls this.
	operator stringc () const
	Serialize this object.
Public Attributes
INDX	pi [3]
	Indexes to points or vertexes.

---

Detailed Description

template<typename INDX = uint>
class simplexD2indexed< INDX >

Indexed triangle.

The indexes refer to points. These may or may not be ordered depending on the application.

Definition at line 16 of file simplexD2indexed.h.

---

Constructor & Destructor Documentation

template<typename INDX = uint>

simplexD2indexed< INDX >::simplexD2indexed

(

)

[inline]

Construct a null triangle.

Definition at line 24 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

    { pi[0] = pi[1] = pi[2] = 0; }

template<typename INDX = uint>

simplexD2indexed< INDX >::simplexD2indexed	(	INDX const	a,
		INDX const	b,
		INDX const	c
	)			[inline]

Construct a triangle.

Definition at line 27 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

    { pi[0]=a; pi[1]=b; pi[2]=c; }

---

Member Function Documentation

template<typename INDX >

boolc simplexD2indexed< INDX >::isnull

(

)

const [inline]

Is this a triangle? Are all the fields set to zero?

Definition at line 76 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

{
//  I have commented this out but I have no idea why I wrote this code.
//  It is here in case something breaks as continuous integration(the death star)
//  is not operational.
/*
  if (pi[0]==0)
    return true;

  if (pi[1]==0)
    return true;

  if (pi[2]==0)
    return true;

  return false;
*/

  if (pi[0]!=0)
    return false;

  if (pi[1]!=0)
    return false;

  if (pi[2]!=0)
    return false;

  return true;
}

template<typename INDX >

simplexD2indexed< INDX >::operator stringc

(

)

const [inline]

Serialize this object.

Definition at line 55 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

{
  stringstream ss;
  ss << pi[0] << " " << pi[1] << " " << pi[2];
  return ss.str();
}

template<typename INDX >

boolc simplexD2indexed< INDX >::operator==

(

simplexD2indexed< INDX > const &

t

)

const [inline]

Are two triangles the same?

Definition at line 64 of file simplexD2indexed.h.

References sequencesequal3().

{
//  for (uint k=0; k<3; ++k)
//    if (((pi[k]==t.pi[0])||(pi[k]==t.pi[1])||(pi[k]==t.pi[2]))==false)
//      return false;

  return sequencesequal3(pi,t.pi);
}

template<typename INDX = uint>

ostream& simplexD2indexed< INDX >::print

(

ostream &

os

)

const [inline]

Global << calls this.

Definition at line 40 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

    { return os << pi[0] << " " << pi[1] << " " << pi[2]; }

template<typename INDX = uint>

void simplexD2indexed< INDX >::setnull

(

)

[inline]

Set all fields to 0.

Definition at line 34 of file simplexD2indexed.h.

References simplexD2indexed< INDX >::pi.

    { pi[0] = pi[1] = pi[2] = 0; }

---

Member Data Documentation

template<typename INDX = uint>

INDX simplexD2indexed< INDX >::pi[3]

Indexes to points or vertexes.

Definition at line 21 of file simplexD2indexed.h.

Referenced by delaunaysimpleD2< PT, PD, INDX >::get(), simplexD2indexed< INDX >::isnull(), simplexD2indexed< INDX >::operator stringc(), simplexD2indexed< INDX >::print(), simplexD2indexed< INDX >::setnull(), and simplexD2indexed< INDX >::simplexD2indexed().

---

The documentation for this class was generated from the following file:

• compgeomlib/simplexD2indexed.h