Debian Codegraph @

lib/database/src/so/nodes/nurbs/libnurbs/flist.c++

raw
1 /*
2 *
3 * Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
9 *
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
14 *
15 * Further, this software is distributed without any warranty that it is
16 * free of the rightful claim of any third person regarding infringement
17 * or the like. Any license provided herein, whether implied or
18 * otherwise, applies only to this software file. Patent licenses, if
19 * any, provided herein do not apply to combinations of this program with
20 * other software, or any other product whatsoever.
21 *
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with this library; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 *
26 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
27 * Mountain View, CA 94043, or:
28 *
29 * http://www.sgi.com
30 *
31 * For further information regarding this notice, see:
32 *
33 * http://oss.sgi.com/projects/GenInfo/NoticeExplan/
34 *
35 */
36
37 /*
38 * flist.c++ - $Revision: 1.1.1.1 $
39 * Derrick Burns - 1991
40 */
41
42 #include "glimports.h"
43 #include "myassert.h"
44 #include "mystdio.h"
45 #include "flist.h"
46
47 /*----------------------------------------------------------------------------
48 * Flist::Flist - initialize a REAL number array
49 *----------------------------------------------------------------------------
50 */
51 Flist::Flist( void )
52 {
53 npts = 0;
54 pts = 0;
55 start = end = 0;
56 }
57
58 /*----------------------------------------------------------------------------
59 * Flist::~Flist - free a REAL number array
60 *----------------------------------------------------------------------------
61 */
62 Flist::~Flist( void )
63 {
64 if( npts ) delete[] pts;
65 }
66
67 void
68 Flist::add( REAL x )
69 {
70 pts[end++] = x;
71 assert( end <= npts );
72 }
73
74 /*----------------------------------------------------------------------------
75 * Flist::filter - remove duplicate numbers from array
76 *----------------------------------------------------------------------------
77 */
78 void Flist::filter( void )
79 {
80 sorter.qsort( pts, end );
81 start = 0;
82
83 int j = 0;
84 for( int i = 1; i < end; i++ ) {
85 if( pts[i] == pts[i-j-1] )
86 j++;
87 pts[i-j] = pts[i];
88 }
89 end -= j;
90 }
91
92 /*----------------------------------------------------------------------------
93 * Flist::grow - ensure that array is large enough
94 *----------------------------------------------------------------------------
95 */
96 void Flist::grow( int maxpts )
97 {
98 if( npts < maxpts ) {
99 if( npts ) delete[] pts;
100 npts = 2 * maxpts;
101 pts = new REAL[npts];
102 assert( pts );
103 }
104 start = end = 0;
105 }
106
107 /*----------------------------------------------------------------------------
108 * Flist::taper - ignore head and tail of array
109 *----------------------------------------------------------------------------
110 */
111 void Flist::taper( REAL from, REAL to )
112 {
113 while( pts[start] != from )
114 start++;
115
116 while( pts[end-1] != to )
117 end--;
118 }
119
120