1/*
2 * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
3 * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
11 *
12 * The above copyright notice including the dates of first publication and
13 * either this permission notice or a reference to
14 * http://oss.sgi.com/projects/FreeB/
15 * shall be included in all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
21 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
22 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 * SOFTWARE.
24 *
25 * Except as contained in this notice, the name of Silicon Graphics, Inc.
26 * shall not be used in advertising or otherwise to promote the sale, use or
27 * other dealings in this Software without prior written authorization from
28 * Silicon Graphics, Inc.
29 */
30
31/*
32 * jarcloc.h
33 *
34 */
35
36#ifndef __glujarcloc_h_
37#define __glujarcloc_h_
38
39#include "arc.h"
40
41class Jarcloc {
42private:
43    Arc_ptr 		arc;
44    TrimVertex		*p;
45    TrimVertex		*plast;
46public:
47    inline void		init( Arc_ptr a, long first, long last ) { arc = a; p=&a->pwlArc->pts[first]; plast = &a->pwlArc->pts[last]; }
48    inline TrimVertex *	getnextpt( void );
49    inline TrimVertex *	getprevpt( void );
50    inline void		reverse();
51};
52
53inline void
54Jarcloc::reverse()
55{
56    if( plast == &arc->pwlArc->pts[0] )
57	plast =  &arc->pwlArc->pts[arc->pwlArc->npts - 1];
58    else
59	plast =  &arc->pwlArc->pts[0];
60}
61
62inline TrimVertex *
63Jarcloc::getnextpt()
64{
65    assert( p <= plast );
66    if( p == plast ) {
67	arc = arc->next;
68	p = &arc->pwlArc->pts[0];
69	plast = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
70	assert( p < plast );
71    }
72    return p++;
73}
74
75inline TrimVertex *
76Jarcloc::getprevpt()
77{
78    assert( p >= plast );
79    if( p == plast ) {
80	arc = arc->prev;
81	p = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
82	plast = &arc->pwlArc->pts[0];
83	assert( p > plast );
84    }
85    return p--;
86}
87#endif /* __glujarcloc_h_ */
88