Searched refs:Int (Results 1 - 25 of 55) sorted by relevance

123

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DsampleComp.h41 Int leftStartIndex, Int botLeftIndex,
43 Int rightStartIndex, Int botRightIndex,
46 Int gridIndex1, Int gridIndex2,
47 Int up_leftCornerWhere,
48 Int up_leftCornerIndex,
49 Int up_rightCornerWhere,
50 Int up_rightCornerInde
[all...]
H A DsampleCompTop.h40 Int leftStartIndex,
42 Int rightStartIndex,
45 Int gridIndex1,
46 Int up_leftCornerWhere,
47 Int up_leftCornerIndex,
48 Int up_rightCornerWhere,
49 Int up_rightCornerIndex,
54 Int leftStartIndex,
56 Int rightStartIndex,
59 Int gridIndex
[all...]
H A DsampleCompRight.h40 Int largeIndex,
41 Int smallIndex,
43 Int vlineIndex,
44 Int ulineSmallIndex,
45 Int ulineLargeIndex,
47 Int gridLineUp /*1 if grid line is above the trim lines */
52 Int topRightIndex,
53 Int botRightIndex,
55 Int rightGridChainStartIndex,
56 Int rightGridChainEndInde
[all...]
H A DsampleCompBot.h39 Int leftEnd,
40 Int leftCorner,
42 Int& ret_index_mono,
43 Int& ret_index_pass);
46 Int rightEnd,
47 Int rightCorner,
49 Int& ret_index_mono,
50 Int& ret_index_pass);
55 Int rightEnd,
56 Int segIndexMon
[all...]
H A DrectBlock.h40 Int upGridLineIndex;
41 Int lowGridLineIndex;
42 Int* leftIndices; //up to bottome
43 Int* rightIndices; //up to bottom
46 rectBlock(gridBoundaryChain* left, gridBoundaryChain* right, Int beginVline, Int endVline);
49 Int get_upGridLineIndex() {return upGridLineIndex;}
50 Int get_lowGridLineIndex() {return lowGridLineIndex;}
51 Int* get_leftIndices() {return leftIndices;}
52 Int* get_rightIndice
[all...]
H A DgridWrap.h43 Int n_ulines;
44 Int n_vlines;
55 Int is_uniform;
59 gridWrap(Int nUlines, Int nVlines,
65 gridWrap(Int nUlines, Real *uvals,
66 Int nVlines, Real *vvlas
71 Int get_n_ulines() {return n_ulines;}
72 Int get_n_vlines() {return n_vlines;}
78 Real get_u_value(Int
[all...]
H A DpartitionX.h38 Int isCuspX(directedLine *v);
39 Int isReflexX(directedLine *v);
40 Int cuspTypeX(directedLine *v);
43 void findInteriorCuspsX(directedLine* polygon, Int& ret_n_interior_cusps,
46 Int numInteriorCuspsX(directedLine* polygon);
H A DsampleMonoPoly.h41 void triangulateXYMono(Int n_upper, Real upperVerts[][2],
42 Int n_lower, Real lowerVerts[][2],
46 Int largeIndex,
47 Int smallIndex,
49 Int vlineIndex,
50 Int ulineSmallIndex,
51 Int ulineLargeIndex,
53 Int gridLineUp
56 Int beginLeftIndex,
57 Int endLeftInde
[all...]
H A DpartitionY.h58 Int isBelow(directedLine *v, directedLine *e);
61 Int isAbove(directedLine *v, directedLine *e);
67 Int cuspType(directedLine *v);
72 Int leftType; /*either a vertex (leftType=0) or an edge (leftType =1) */
74 Int rightType; /*either a vertex (rightType=0) or an edge (rightType =1) */
77 sweepRange* sweepRangeMake(directedLine* left, Int leftType,
78 directedLine* right, Int rightType);
81 Int sweepRangeEqual(sweepRange* sr1, sweepRange* sr2);
88 void sweepY(Int nVertices, directedLine **sortedVerteces, sweepRange** ret_ranges);
93 void findDiagonals(Int total_num_edge
[all...]
H A DmonoTriangulation.h50 Int isIncreasing;
51 Int index_queue;
52 Int size_queue; /*allocated size*/
55 reflexChain(Int size, Int isIncreasing);
79 Int index;
80 Int size;
82 vertexArray(Int s);
83 vertexArray(Real vertices[][2], Int nVertices);
86 Real* getVertex(Int
[all...]
H A DpolyDBG.h40 Int DBG_edgesIntersectGen(Real A[2], Real B[2], Real C[2], Real D[2]);
41 Int DBG_intersectChain(vertexArray* chain, Int start, Int end, Real A[2], Real B[2]);
44 Int DBG_edgesIntersect(directedLine* l1, directedLine* l2);
45 Int DBG_polygonSelfIntersect(directedLine* poly);
46 Int DBG_edgeIntersectPoly(directedLine* edge, directedLine* poly);
47 Int DBG_polygonsIntersect(directedLine* p1, directedLine* p2);
48 Int DBG_polygonListIntersect(directedLine* pList);
50 Int DBG_isCounterclockwis
[all...]
H A Ddefinitions.h37 typedef int Int; typedef in typeref:typename:int
H A DprimitiveStream.h45 Int *lengths; /*length[i]=number of vertices of ith primitive*/
46 Int *types; /*each primive has a type: FAN or STREAM*/
50 Int index_lengths; /*the current available entry*/
51 Int size_lengths; /*the allocated size of the array: lengths*/
52 Int index_vertices;
53 Int size_vertices;
59 Int counter;
62 primStream(Int sizeLengths, Int sizeVertices);
65 Int get_n_prim
[all...]
H A DprimitiveStream.cc46 Int primStream::num_triangles()
48 Int i;
49 Int ret=0;
77 for(Int i=0; i<index_vertices; i++)
93 void primStream::end(Int type)
95 Int i;
102 Int* temp = (Int*) malloc(sizeof(Int) * (2*size_lengths + 2));
104 Int* tempType
[all...]
H A DsampleComp.cc53 Int leftStartIndex, Int leftEndIndex,
55 Int rightStartIndex, Int rightEndIndex,
58 Int gridIndex1, Int gridIndex2,
59 Int up_leftCornerWhere,
60 Int up_leftCornerIndex,
61 Int up_rightCornerWhere,
62 Int up_rightCornerInde
[all...]
H A DsampledLine.h39 Int npoints;
43 sampledLine(Int n_points);
44 sampledLine(Int n_points, Real pts[][2]);
49 void init(Int n_points, Real2 *pts);//special, careful about memory
51 void setPoint(Int i, Real p[2]) ;
56 Int get_npoints() {return npoints;}
H A DrectBlock.cc47 rectBlock::rectBlock(gridBoundaryChain* left, gridBoundaryChain* right, Int beginVline, Int endVline)
49 Int i;
56 Int n = upGridLineIndex-lowGridLineIndex+1; //number of grid lines
57 leftIndices = (Int*) malloc(sizeof(Int) * n);
59 rightIndices = (Int*) malloc(sizeof(Int) * n);
78 Int i;
90 Int
[all...]
H A DmonoChain.h51 Int isIncrease;
77 Int numChainsSingleLoop();
78 Int numChainsAllLoops();
79 monoChain** toArrayAllLoops(Int& num_chains);
80 Int toArraySingleLoop(monoChain** array, Int index);
82 Int isKey;
95 Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges);
97 void MC_findDiagonals(Int total_num_edge
[all...]
H A DpolyUtil.h42 Int pointLeftLine(Real A[2], Real B[2], Real P[2]);
43 Int pointLeft2Lines(Real A[2], Real B[2], Real C[2], Real P[2]);
H A DdirectedLine.h55 Int rootBit; /*1 if this is a root of the polygon, set by setRootBit*/
71 Real* getVertex(Int i); /*points[i] if INCREASING, points[n-1-i] otherwise*/
72 Int get_npoints() {return sline->get_npoints();}
106 Int compInY(directedLine* nl);
107 Int compInX(directedLine* nl);
114 Int numEdges();
115 Int numEdgesAllPolygons();
116 Int numPolygons();
135 Int toArraySinglePolygon(directedLine** array, Int inde
[all...]
H A DpolyUtil.cc64 Int pointLeftLine(Real A[2], Real B[2], Real P[2])
78 Int pointLeft2Lines(Real A[2], Real B[2], Real C[2], Real P[2])
80 Int C_left_AB = (area(A, B, C)>0);
81 Int P_left_AB = (area(A, B, P)>0);
82 Int P_left_BC = (area(B, C, P)>0);
H A DgridWrap.cc54 gridWrap::gridWrap(Int nUlines, Real* uvals,
55 Int nVlines, Real* vvals)
72 Int i;
79 gridWrap::gridWrap(Int nUlines, Int nVlines,
96 Int i;
137 void gridWrap::outputFanWithPoint(Int v, Int uleft, Int uright, Real vert[2], primStream* pStream)
139 Int
[all...]
H A DsampleCompBot.cc53 Int leftEnd,
54 Int leftCorner,
56 Int& ret_index_mono,
57 Int& ret_index_pass)
59 Int i;
79 Int rightEnd,
80 Int rightCorner,
82 Int& ret_index_mono,
83 Int& ret_index_pass)
85 Int
[all...]
H A DsampleCompRight.cc57 Int leftStartIndex, Int leftEndIndex,
59 Int rightStartIndex, Int rightEndIndex,
61 Int gridIndex1, Int gridIndex2,
62 Int up_rightCornerWhere,
63 Int up_rightCornerIndex,
64 Int down_rightCornerWhere,
65 Int down_rightCornerInde
[all...]
H A DsampleCompTop.cc54 Int leftStart,
55 Int leftEnd,
57 Int& ret_index_small,
58 Int& ret_index_large
61 Int i;
81 Int rightStart,
82 Int rightEnd,
84 Int& ret_index_small,
85 Int& ret_index_large)
87 Int
[all...]

Completed in 19 milliseconds

123