TrapsList Class Reference

Simple class containing a list of TrapEdgeLists representing a complex path Each TrapEdgeList represents a sub-path of the overall source path. More...

#include <pathtrap.h>

Inheritance diagram for TrapsList:

List of all members.

Public Member Functions
	TrapsList (INT32 Repeat=0)
	Constructor.
	~TrapsList ()
	Destructor.
UINT32	GetNumTraps (void)
TrapEdgeList *	GetTrapEdgeList (UINT32 index)
TrapEdgeList *	GetLastTrapEdgeList (void)
TrapEdgeList *	AddEdgeList (void)
	Add a new TrapEdgeList object to this list.
BOOL	PostProcessLists (ProcessPathToTrapezoids *pProcessor, TrapTravelType TravelType)
	Scans the recorded list of TrapEdgeLists and fills in the remaining information (normals and position values) for all trapezoids therein.
INT32	GetRepeatLength (void)
Protected Member Functions
BOOL	ExpandArray (void)
	(Internal method) Expands the storage structure of the list to allow more entries to be used. Called automatically by AddEdgeList if it needs more edges.
Protected Attributes
UINT32	Used
UINT32	CurrentSize
TrapEdgeList **	pTraps
INT32	RepeatLength

---

Detailed Description

Simple class containing a list of TrapEdgeLists representing a complex path Each TrapEdgeList represents a sub-path of the overall source path.

Author:

Jason_Williams (Xara Group Ltd) <camelotdev@xara.com>

Date:

30/12/96

Notes: Sorry, Jim, but I've had to use inlining to keep common operations efficient

Definition at line 369 of file pathtrap.h.

---

Constructor & Destructor Documentation

TrapsList::TrapsList (  INT32  Repeat = 0  )

Constructor. Author: Jason_Williams (Xara Group Ltd) <camelotdev@xara.com> Date: 30/12/96 Parameters: Repeat  - 0 to generate a single stroke (TrapEdgeList) per subpath, which [INPUTS] will cause the stroke to be stretched along the entire path, or... a millipoint repeat distance (which will cause many TrapEdgelists to be generated), such that the stroke repeats along the path. Definition at line 683 of file pathtrap.cpp. { Used = 0; CurrentSize = 0; pTraps = NULL; RepeatLength = Repeat; }

TrapsList::~TrapsList (   )

Destructor. Author: Jason_Williams (Xara Group Ltd) <camelotdev@xara.com> Date: 30/12/96 Definition at line 704 of file pathtrap.cpp. { if (pTraps != NULL) { for (UINT32 Index = 0; Index < Used; Index++) delete pTraps[Index]; CCFree(pTraps); } }

---

Member Function Documentation

TrapEdgeList * TrapsList::AddEdgeList (  void   )

Add a new TrapEdgeList object to this list. Author: Jason_Williams (Xara Group Ltd) <camelotdev@xara.com> Date: 30/12/96 Returns: NULL if it failed to allocate memory, else a pointer to a new TrapEdgeList object for you to use Definition at line 731 of file pathtrap.cpp. { if (Used >= CurrentSize) // If we've run out of room in the array { if (!ExpandArray()) // Try to allocate more return(NULL); // And return NULl if we failed } TrapEdgeList *pObject = new TrapEdgeList(this); if (pObject == NULL) return(NULL); pTraps[Used] = pObject; Used++; return(pObject); }

BOOL TrapsList::ExpandArray (  void   )  [protected]

(Internal method) Expands the storage structure of the list to allow more entries to be used. Called automatically by AddEdgeList if it needs more edges. Author: Jason_Williams (Xara Group Ltd) <camelotdev@xara.com> Date: 30/12/96 Parameters: On  succesful exit, the member array of TrapEdgeList objects will be bigger [OUTPUTS] Returns: FALSE if it failed to allocate memory Notes: Internal storage is an array of TrapEdgeList _pointers_ To use an item, you must therefore Definition at line 770 of file pathtrap.cpp. { // Work out how many entries to allocate. // Each item is small, so we allocate a reasonably large number // Note that potential implementation of dashed lines could create a lot of // TrapEdgeLists (one per dash), so we need lots of spare capacity to cope // with this situation. I've therefore erred on the generous side. const INT32 AllocSize = CurrentSize + 64; if (pTraps == NULL) { // We have no array yet, so allocate one pTraps = (TrapEdgeList **) CCMalloc(AllocSize * sizeof(TrapEdgeList *)); if (pTraps == NULL) return(FALSE); } else { // We have an array - we must make it larger TrapEdgeList **pNewBuf = (TrapEdgeList **) CCRealloc(pTraps, AllocSize * sizeof(TrapEdgeList *)); if (pNewBuf == NULL) return(FALSE); pTraps = pNewBuf; } // Success. Update the current size value CurrentSize = AllocSize; // Initialise the pointers to safe values for (UINT32 Index = Used; Index < CurrentSize; Index++) pTraps[Index] = NULL; return(TRUE); }

TrapEdgeList* TrapsList::GetLastTrapEdgeList (  void   )  [inline]

Definition at line 384 of file pathtrap.h. { return((Used == 0) ? NULL : pTraps[Used-1]); };

UINT32 TrapsList::GetNumTraps (  void   )  [inline]

Definition at line 377 of file pathtrap.h. { return(Used); };

INT32 TrapsList::GetRepeatLength (  void   )  [inline]

Definition at line 394 of file pathtrap.h. { return(RepeatLength); };

TrapEdgeList* TrapsList::GetTrapEdgeList (  UINT32  index  )  [inline]

Definition at line 380 of file pathtrap.h. { ERROR3IF(index >= Used, "Out of range"); return(pTraps[index]); };

BOOL TrapsList::PostProcessLists (  ProcessPathToTrapezoids *  pProcessor, TrapTravelType  TravelType )

Scans the recorded list of TrapEdgeLists and fills in the remaining information (normals and position values) for all trapezoids therein. Author: Jason_Williams (Xara Group Ltd) <camelotdev@xara.com> Date: 30/12/96 Parameters: pProcessor  - The object which is calling us [INPUTS] TravelType - Describes how to record "positions" along the path: TrapTravel_None Don't record travel (FASTEST) TrapTravel_Parametric 0.0 to 1.0 parametric range TrapTravel_Millipoint Absolute millipoints distance On  succesful exit, the member TrapEdgeList objects will be complete [OUTPUTS] Returns: FALSE if it failed to complete the operation (Note: No error is set at this level) MUST be called on the list before trying to use the edge structures! Notes: TrapTravel_None will leave edge "Position" values TOTALLY UNINITIALISED Definition at line 838 of file pathtrap.cpp. { // There is a problem with fixed repeating vector brushes sometimes doing a bit // more than they should, in other words, a 6 repeat brush starting on the 7th // repeat, or at least adding 1 trap to the list for it... // The commented out stuff below was the last ever bit of code written by Jason. // It was intended as a fix, but I (Richard) never got round to getting it compiling // let alone testing it. Since the stroking job is now no more, and also since this // comment is still here, I suspect the problem still remains. To see it in action // you need to draw a wibbly filled freehand shape and pop the gallery up. The // symptoms are a bizarre line to the right of the preview. It's tricky to get a // repeating case... // Jason, if you decided to come back, good on you mate... If not, may I wish // whoever is reading this all the best with the stroking system - blimmin // fabby, innit ? /* BOOL DiscardPartialRepeats = TRUE; if (RepeatDist > 0 && DiscardPartialRepeats && Used > 1) { TrapEdge *pEdge = pTraps[Used-1]->GetLastTrapEdge(); if (pEdge != NULL && pEdge->Position < RepeatDist/2) { delete pTraps[Used-1]; pTraps[Used-1] = NULL; Used--; } }*/ for (UINT32 Index = 0; Index < Used; Index++) { if (pTraps[Index] != NULL) { if (!pTraps[Index]->ProcessEdgeNormals(pProcessor)) return(FALSE); if (!pTraps[Index]->ProcessEdgePositions(TravelType)) return(FALSE); } } return(TRUE); }

---

Member Data Documentation

UINT32 TrapsList::CurrentSize [protected]

Definition at line 403 of file pathtrap.h.

TrapEdgeList** TrapsList::pTraps [protected]

Definition at line 404 of file pathtrap.h.

INT32 TrapsList::RepeatLength [protected]

Definition at line 406 of file pathtrap.h.

UINT32 TrapsList::Used [protected]

Definition at line 402 of file pathtrap.h.

---

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

• Kernel/pathtrap.h (r1785/r1282)
• Kernel/pathtrap.cpp (r1785/r1282)

---