Home
last modified time | relevance | path

Searched refs:kleft (Results 1 – 25 of 138) sorted by relevance

123456

/dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/
H A Ds1219.c141 if (et[kleft] <= ax && ax < et[kleft+1]) ;
146 kleft = in - 1;
148 kleft = ik - 1;
152 else if (et[kleft+1] <= ax && ax < et[kleft+2])
153 kleft += 1;
154 else if (kleft > 0 && et[kleft-1] <= ax && ax < et[kleft])
155 kleft -= 1;
169 while (ax < et[kleft] || et[kleft+1] <= ax)
172 kmax = kleft;
174 kmin = kleft;
[all …]
H A Dnewknots.c118 int kleft = 0; /* Position in knot vector. */ local
135 s1219(et,ik,in,&kleft,tpar,&kstat);
140 if (tpar-et[kleft] < aeps)
142 tpar = et[kleft];
144 kj<=kleft && DEQUAL(et[kleft],et[kleft-kj]);
147 else if (et[kleft+1]-tpar < aeps)
149 tpar = et[kleft+1];
151 kleft+kj<in+ik && DEQUAL(et[kleft+1],et[kleft+kj]);
H A Ds1389.c122 int kleft=0; /* Pointer into knot vector */ local
152 kleft = kk - 1;
158 while (kleft < kn)
165 tpar = st[kleft];
174 s1221(pc1,kder,tpar,&kleft,scorn1,&kstat);
179 tdiff1 = st[kleft+1] - st[kleft];
183 tparx = st[kleft+1];
184 kdumlft = kleft;
197 kleft += 1;
H A Ds1227.c169 int kleft=0; /* Local version of ileft which is used in order to local
234 s1219(st,kk,kn,&kleft,ax,&kstat);
240 kmult = s6knotmult(st,kk,kn,&kleft,ax,&kstat);
244 if (ax == st[kleft] && kleft > kk-1) kn = kleft-kmult+1;
270 kleft = *ileft;
278 for (ki=kleft-kk+1; ki<=kleft; ki++)
H A Ds1252.c156 s1221(pcurve,kder,tnext,&kleft,sval,&kstat);
167 s1252_s6corr(&td,tnext,st,kn,kk,&kleft,&kdir);
181 s1221(pcurve,kder,tnext,&kleft,sval,&kstat);
185 s1227(pcurve,kder,tnext,&kleft,sval,&kstat);
202 s1221(pcurve,kder,tnext+td,&kleft,sval,&kstat);
207 s1227(pcurve,kder,tnext+td,&kleft,sval,&kstat);
221 s1252_s6corr(&td,tnext,st,kn,kk,&kleft,&kdir);
251 if (DEQUAL(tnext,pcurve->et[kleft]))
252 *cpos = pcurve->et[kleft];
253 else if (DEQUAL(tnext,pcurve->et[kleft+1]))
[all …]
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/GraphBLAS/Source/
H A DGB_bracket.h30 int64_t *kleft,
36 if (len > 0 && X [(*kleft)] < imin)
39 int64_t pleft = (*kleft) ;
42 (*kleft) = pleft ;
59 const int64_t kleft, in GB_bracket_right() argument
68 int64_t pleft = kleft ; in GB_bracket_right()
101 int64_t kleft = kleft_in ;
107 (*kleft_new ) = kleft ;
108 (*kright_new) = kleft-1 ;
121 ASSERT (GB_IMPLIES (kleft > kleft_in, X [kleft-1] < imin)) ;
[all …]
/dports/graphics/vigra/vigra-8acd73a/include/vigra/
H A Dseparableconvolution.hxx77 int kw = kright - kleft + 1; in internalConvolveLineOptimistic()
259 if(w-x <= -kleft) in internalConvolveLineWrap()
284 else if(w-x <= -kleft) in internalConvolveLineWrap()
360 if(w-x <= -kleft) in internalConvolveLineClip()
386 else if(w-x <= -kleft) in internalConvolveLineClip()
457 if(w-x <= -kleft) in internalConvolveLineZeropad()
542 if(w-x <= -kleft) in internalConvolveLineReflect()
641 if(w-x <= -kleft) in internalConvolveLineRepeat()
716 if(w + kleft < stop) in internalConvolveLineAvoid()
717 stop = w + kleft; in internalConvolveLineAvoid()
[all …]
/dports/graphics/panomatic/panomatic-0.9.4/vigra/include/vigra/
H A Dseparableconvolution.hxx96 else if(w-x <= -kleft) in internalConvolveLineWrap()
105 int x0 = -kleft - w + x + 1; in internalConvolveLineWrap()
175 else if(w-x <= -kleft) in internalConvolveLineClip()
186 int x0 = -kleft - w + x + 1; in internalConvolveLineClip()
253 else if(w-x <= -kleft) in internalConvolveLineReflect()
262 int x0 = -kleft - w + x + 1; in internalConvolveLineReflect()
328 else if(w-x <= -kleft) in internalConvolveLineRepeat()
337 int x0 = -kleft - w + x + 1; in internalConvolveLineRepeat()
542 vigra_precondition(kleft <= 0, in convolveLine()
684 vigra_precondition(kleft <= 0, in separableConvolveX()
[all …]
/dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/DALTON/pdpack/
H A Djacobi.F89 kleft=Mod(kmax-kmin+1,4)
90 If ( kleft.eq.1 ) then
118 kmin=kmin+kleft
139 kleft=Mod(kmax-kmin+1,4)
141 If ( kleft.eq.1 ) then
178 kmin=kmin+kleft
204 kleft=Mod(kmax-kmin+1,4)
206 If ( kleft.eq.1 ) then
243 kmin=kmin+kleft
278 If ( kleft.eq.1 ) then
[all …]

123456