linechoppedindexed< PT, PD, INDX > Class Template Reference

Maintain a linked list of chopped line segments, each having an index. More...

#include <linechopped.h>

Collaboration diagram for linechoppedindexed< PT, PD, INDX >:

List of all members.

Public Types
typedef list< pointindexed < point2< PD >, INDX > >::iterator	listiter
Public Member Functions
	linechoppedindexed (line< PT, PD > const &ln_, pointindexed< point2< PD >, INDX > const &seg)
	Pass in an initial line segment.
boolc	split (listiter &posnew, listiter pos, line< PT, PD > const &L2)
	Split into two segments.
Public Attributes
line< PT, PD >	ln
	The line.
list< pointindexed< point2< PD > , INDX > >	chain
	Chain segments.

---

Detailed Description

template<typename PT, typename PD, typename INDX>
class linechoppedindexed< PT, PD, INDX >

Maintain a linked list of chopped line segments, each having an index.

Definition at line 90 of file linechopped.h.

---

Member Typedef Documentation

template<typename PT, typename PD, typename INDX>

typedef list< pointindexed< point2<PD>, INDX > >::iterator linechoppedindexed< PT, PD, INDX >::listiter

Definition at line 110 of file linechopped.h.

---

Constructor & Destructor Documentation

template<typename PT, typename PD, typename INDX>

linechoppedindexed< PT, PD, INDX >::linechoppedindexed	(	line< PT, PD > const &	ln_,
		pointindexed< point2< PD >, INDX > const &	seg
	)			[inline]

Pass in an initial line segment.

Definition at line 102 of file linechopped.h.

References linechoppedindexed< PT, PD, INDX >::chain.

    : ln(ln_)
    { chain.push_back( seg ); }

---

Member Function Documentation

template<typename PT , typename PD , typename INDX >

boolc linechoppedindexed< PT, PD, INDX >::split	(	listiter &	posnew,
		listiter	pos,
		line< PT, PD > const &	L2
	)			[inline]

Split into two segments.

The order is maintained.

Definition at line 168 of file linechopped.h.

References solver< T >::d2linearequ(), line< PT, PD >::nml, and line< PT, PD >::pos.

{
  bool res;
  point2<PD> t;
  res = solver<PD>::d2linearequ
    (t,ln.nml,L2.nml*((PD)-1.0), L2.pos - ln.pos);

  if (res==false)
    return false;

  PD t0(t[0]);

  if (t0<(*pos).pt[0])
    return false;

  if (t0>(*pos).pt[1])
    return false;

  PD k0((*pos).pt[0]);
  (*pos).pt[0] = t0;
  
  posnew = chain.insert(pos,pointindexed< point2<PD>, INDX >( point2<PD>(k0,t0),0));

  return true;
}

---

Member Data Documentation

template<typename PT, typename PD, typename INDX>

list< pointindexed< point2<PD>, INDX> > linechoppedindexed< PT, PD, INDX >::chain

Chain segments.

Definition at line 98 of file linechopped.h.

Referenced by bsptreeD2< PT, PD, INDX >::find(), and linechoppedindexed< PT, PD, INDX >::linechoppedindexed().

template<typename PT, typename PD, typename INDX>

line<PT,PD> linechoppedindexed< PT, PD, INDX >::ln

The line.

Definition at line 95 of file linechopped.h.

Referenced by bsptreeD2< PT, PD, INDX >::find().

---

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

• mathlib/linechopped.h