Home
last modified time | relevance | path

Searched +refs:x +refs:pointer +refs:plus (Results 1 – 25 of 16241) sorted by relevance

12345678910>>...650

/dports/math/cln/cln-1.3.6/include/cln/
H A Dring.h66 { cl_inc_pointer_refcount((cl_heap*)r); pointer = r; } in CL_DEFINE_COPY_CONSTRUCTOR2()
69 { pointer = p; } in cl_ring()
72 { return (R1.pointer == R2.pointer); }
74 { return (R1.pointer != R2.pointer); }
76 { return (R1.pointer == R2); }
78 { return (R1.pointer != R2); }
169 …const _cl_ring_element (* plus) (cl_heap_ring* R, const _cl_ring_element& x, const _cl_ring_elemen… member
221 { return addops->plus(this,x,y); } in _plus()
257 const cl_ring_element plus (const cl_ring_element& x, const cl_ring_element& y) in plus() argument
324 { return x.ring()->plus(x,y); }
[all …]
H A Dmodinteger.h70 { return (R1.pointer == R2.pointer); }
72 { return (R1.pointer != R2.pointer); }
74 { return (R1.pointer == R2); }
76 { return (R1.pointer != R2); }
174 const _cl_MI (* plus) (cl_heap_modint_ring* R, const _cl_MI& x, const _cl_MI& y); member
237 { return addops->plus(this,x,y); } in _plus()
287 const cl_MI plus (const cl_MI& x, const cl_MI& y) in plus() argument
381 { return x.ring()->plus(x,y); }
383 { return x.ring()->plus(x,x.ring()->canonhom(y)); }
385 { return y.ring()->plus(y.ring()->canonhom(x),y); }
[all …]
H A Dunivpoly.h51 { return (R1.pointer == R2.pointer); }
53 { return (R1.pointer != R2.pointer); }
55 { return (R1.pointer == R2); }
57 { return (R1.pointer != R2); }
125 const _cl_UP (* plus) (cl_heap_univpoly_ring* R, const _cl_UP& x, const _cl_UP& y); member
198 { return addops->plus(this,x,y); } in _plus()
252 const cl_UP plus (const cl_UP& x, const cl_UP& y) in plus() argument
374 { return x.ring()->plus(x,y); }
568 const cl_UP_specialized<T> plus (const cl_UP_specialized<T>& x, const cl_UP_specialized<T>& y) in plus() argument
570 return The2(cl_UP_specialized<T>)(cl_heap_univpoly_ring::plus(x,y)); in plus()
[all …]
/dports/graphics/deegree-igeoportal/deegree-igeoportal/javascript/ext-3.0.0/resources/css/structure/
H A Dtree.css12 .x-tree-icon, .x-tree-ec-icon, .x-tree-elbow-line, .x-tree-elbow, .x-tree-elbow-end, .x-tree-elbow-…
22 .x-tree-node-collapsed .x-tree-node-icon, .x-tree-node-expanded .x-tree-node-icon, .x-tree-node-lea…
79 .x-tree-arrows .x-tree-elbow-plus{
91 .x-tree-arrows .x-tree-elbow-end-plus{
103 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-plus{
107 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-minus{
111 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-end-plus{
119 .x-tree-elbow-plus, .x-tree-elbow-minus, .x-tree-elbow-end-plus, .x-tree-elbow-end-minus{
120 cursor:pointer;
135 cursor:pointer;
[all …]
/dports/net-mgmt/glpi-plugins-fusioninventory-server/fusioninventory-for-glpi-glpi090-1.5/lib/extjs/resources/css/structure/
H A Dtree.css12 .x-tree-icon, .x-tree-ec-icon, .x-tree-elbow-line, .x-tree-elbow, .x-tree-elbow-end, .x-tree-elbow-…
22 .x-tree-node-collapsed .x-tree-node-icon, .x-tree-node-expanded .x-tree-node-icon, .x-tree-node-lea…
94 .x-tree-arrows .x-tree-elbow-plus{
106 .x-tree-arrows .x-tree-elbow-end-plus{
118 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-plus{
122 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-minus{
126 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-end-plus{
134 .x-tree-elbow-plus, .x-tree-elbow-minus, .x-tree-elbow-end-plus, .x-tree-elbow-end-minus{
135 cursor:pointer;
150 cursor:pointer;
[all …]
/dports/multimedia/tvheadend/tvheadend-4.2.8/vendor/ext-3.4.1/resources/css/structure/
H A Dtree.css26 .x-tree-icon, .x-tree-ec-icon, .x-tree-elbow-line, .x-tree-elbow, .x-tree-elbow-end, .x-tree-elbow-…
36 .x-tree-node-collapsed .x-tree-node-icon, .x-tree-node-expanded .x-tree-node-icon, .x-tree-node-lea…
108 .x-tree-arrows .x-tree-elbow-plus{
120 .x-tree-arrows .x-tree-elbow-end-plus{
132 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-plus{
136 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-minus{
140 .x-tree-arrows .x-tree-ec-over .x-tree-elbow-end-plus{
148 .x-tree-elbow-plus, .x-tree-elbow-minus, .x-tree-elbow-end-plus, .x-tree-elbow-end-minus{
149 cursor:pointer;
164 cursor:pointer;
[all …]
/dports/audio/libbpm/libbpm-0.3/documentation/latex/
H A Dgroup__wave.tex153 EXTERN int {\bf doublewf\_\-setvalues} ({\bf doublewf\_\-t} $\ast$w, double $\ast$x)
207 EXTERN int {\bf intwf\_\-setvalues} ({\bf intwf\_\-t} $\ast$w, int $\ast$x)
265 EXTERN int {\bf complexwf\_\-setvalues} ({\bf complexwf\_\-t} $\ast$w, {\bf complex\_\-t} $\ast$x)
500 …etlength{\rightskip}{0pt plus 5cm}EXTERN int doublewf\_\-setvalues ({\bf doublewf\_\-t} $\ast$ {\e…
503 Fills the waveform of doubles with the values from the array x. No check is performed whether x con…
506 \item[{\em w}]A pointer to the waveform of doubles \item[{\em x}]A pointer to the x values \end{des…
952 …]{\setlength{\rightskip}{0pt plus 5cm}EXTERN int intwf\_\-setvalues ({\bf intwf\_\-t} $\ast$ {\em …
955 Fills the waveform of integers with the values from the array x. No check is performed whether x co…
958 \item[{\em w}]A pointer to the waveform of integers \item[{\em x}]A pointer to the x values \end{de…
1423 Fills the complex waveform with the values from the array x. No check is performed whether x contai…
[all …]
H A Dstructfilter__t.tex116 \paragraph[fs]{\setlength{\rightskip}{0pt plus 5cm}double {\bf filter\_\-t::fs}}\hfill\label{struct…
125 \paragraph[f1]{\setlength{\rightskip}{0pt plus 5cm}double {\bf filter\_\-t::f1}}\hfill\label{struct…
245 pointer to complex filter representation, poles and zeros
254 number of x coefficients
263 pointer to array of x coefficients
272 number of anti-causal x coefficients
281 pointer to array of anti-causal x coefficients
299 pointer to array of y coefficients
315 pointer to array of anti-causal y coefficients
322 filter x buffer, used in apply\_\-filter
[all …]
/dports/biology/ncbi-toolkit/ncbi/corelib/
H A Dncbilcl.bsd102 #define SEEK_SET 0 /* Set file pointer to offset */
103 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
104 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
119 #define PROTO(x) x /* Prototypes are acceptable */
120 #define VPROTO(x) x /* Prototype for variable argument list */
148 #define EXP2(x) exp((x)*LN2)
149 #define LOG2(x) (log(x)*(1./LN2))
150 #define EXP10(x) exp((x)*LN10)
151 #define LOG10(x) log10(x)
H A Dncbilcl.beos113 #define SEEK_SET 0 /* Set file pointer to offset */
114 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
115 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
128 #define PROTO(x) x /* Prototypes are acceptable */
129 #define VPROTO(x) x /* Prototype for variable argument list */
157 #define EXP2(x) exp((x)*LN2)
158 #define LOG2(x) (log(x)*(1./LN2))
159 #define EXP10(x) exp((x)*LN10)
160 #define LOG10(x) log10(x)
H A Dncbilcl.fbd105 #define SEEK_SET 0 /* Set file pointer to offset */
106 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
107 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
128 #define PROTO(x) x /* Prototypes are acceptable */
129 #define VPROTO(x) x /* Prototype for variable argument list */
157 #define EXP2(x) exp((x)*LN2)
158 #define LOG2(x) (log(x)*(1./LN2))
159 #define EXP10(x) exp((x)*LN10)
160 #define LOG10(x) log10(x)
H A Dncbilcl.hlx103 #define SEEK_SET 0 /* Set file pointer to offset */
104 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
105 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
118 #define PROTO(x) x /* Prototypes are acceptable */
119 #define VPROTO(x) x /* Prototype for variable argument list */
147 #define EXP2(x) exp((x)*LN2)
148 #define LOG2(x) (log(x)*(1./LN2))
149 #define EXP10(x) exp((x)*LN10)
150 #define LOG10(x) log10(x)
H A Dncbilcl.lna101 #define SEEK_SET 0 /* Set file pointer to offset */
102 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
103 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
116 #define PROTO(x) x /* Prototypes are acceptable */
117 #define VPROTO(x) x /* Prototype for variable argument list */
150 #define EXP2(x) exp((x)*LN2)
151 #define LOG2(x) (log(x)*(1./LN2))
152 #define EXP10(x) exp((x)*LN10)
153 #define LOG10(x) log10(x)
H A Dncbilcl.qnx109 #define SEEK_SET 0 /* Set file pointer to offset */
110 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
111 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
124 #define PROTO(x) x /* Prototypes are acceptable */
125 #define VPROTO(x) x /* Prototype for variable argument list */
153 #define EXP2(x) exp((x)*LN2)
154 #define LOG2(x) (log(x)*(1./LN2))
155 #define EXP10(x) exp((x)*LN10)
156 #define LOG10(x) log10(x)
H A Dncbilcl.aov106 #define SEEK_SET 0 /* Set file pointer to offset */
107 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
108 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
129 #define PROTO(x) x /* Prototypes are acceptable */
130 #define VPROTO(x) x /* Prototype for variable argument list */
161 #define EXP2(x) exp((x)*LN2)
162 #define LOG2(x) (log(x)*(1./LN2))
163 #define EXP10(x) exp((x)*LN10)
164 #define LOG10(x) (log(x)*(1./LN10))
H A Dncbilcl.ibm129 #define SEEK_SET 0 /* Set file pointer to offset */
130 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
131 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
144 #define PROTO(x) x /* Prototypes are acceptable */
145 #define VPROTO(x) x /* Prototype for variable argument list */
173 #define EXP2(x) exp((x)*LN2)
174 #define LOG2(x) (log(x)*(1./LN2))
175 #define EXP10(x) exp((x)*LN10)
176 #define LOG10(x) log10(x)
H A Dncbilcl.dwn146 #define SEEK_SET 0 /* Set file pointer to offset */
147 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
148 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
169 #define PROTO(x) x /* Prototypes are acceptable */
170 #define VPROTO(x) x /* Prototype for variable argument list */
212 #define EXP2(x) exp((x)*LN2)
213 #define LOG2(x) (log(x)*(1./LN2))
214 #define EXP10(x) exp((x)*LN10)
215 #define LOG10(x) log10(x)
H A Dncbilcl.lnx177 #define SEEK_SET 0 /* Set file pointer to offset */
178 #define SEEK_CUR 1 /* Set file pointer to current plus offset */
179 #define SEEK_END 2 /* Set file pointer to EOF plus offset */
192 #define PROTO(x) x /* Prototypes are acceptable */
193 #define VPROTO(x) x /* Prototype for variable argument list */
227 #define EXP2(x) exp((x)*LN2)
228 #define LOG2(x) (log(x)*(1./LN2))
229 #define EXP10(x) exp((x)*LN10)
230 #define LOG10(x) log10(x)
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/utilib/src/utilib/
H A Dpvector.h51 typedef value_type* pointer; typedef
64 typedef _Tp *pointer;
81 typedef value_type* pointer;
174 void plus (const pvector<_Tp>& x, const pvector<_Tp>& y);
186 void plus (const pvector<_Tp>& x, const _Tp& z);
189 void minus (const pvector<_Tp>& x, const _Tp& z);
192 void times (const pvector<_Tp>& x, const _Tp& z);
195 void divide(const pvector<_Tp>& x, const _Tp& z);
201 pvector<_Tp>& operator+= (const pvector<_Tp>& x);
286 BINARYOP( operator+ , plus )
[all …]
/dports/x11-themes/gnome-icons-elementary/icons-6.1.0/cursors/
H A Dmeson.build31 'plus',
32 'pointer',
88 run_command('mkdir', join_paths (meson.build_root(), 'cursors', size + 'x' + size))
91 message('rendering: ' + size + 'x' + size + '/' + cursor + '.png')
96 …'--output', '@0@.png'.format(join_paths (meson.build_root(), 'cursors', size + 'x' + size, cursor)…
102 message('rendering: ' + size + 'x' + size + '/' + watch + '.png')
107 …'--output', '@0@.png'.format(join_paths (meson.build_root(), 'cursors', size + 'x' + size, watch)),
246 'pointer',
255 'plus',
/dports/devel/cc65/cc65-2.19/libsrc/c64/emd/
H A Dc64-dqbb.s178 ; MAP: Map the page in a/x into memory and return a pointer to the page in
198 sta window,x
247 ; COPYFROM: Copy from extended into linear memory. A pointer to a structure
266 ; - ptr1 contains the struct pointer
269 ; - ptr4 contains the page memory buffer plus offset
307 ; COPYTO: Copy from linear into extended memory. A pointer to a structure
325 ; - ptr1 contains the struct pointer
328 ; - ptr4 contains the page memory buffer plus offset
366 ; Helper function for COPYFROM and COPYTO: Store the pointer to the request
371 stx ptr1+1 ; Save passed pointer
[all …]
/dports/devel/art/art-0.9.02/regressions/features/
H A D013.c.artrep.right2 …eak; handle 0x from 'heap-memory' allocated at 013.c:11 not deallocated. Never operated. Bytes lea…
/dports/math/cln/cln-1.3.6/src/polynomial/elem/
H A Dcl_UP_number.h108 init1(cl_number, result[i]) (ops.plus(x[i],y[i])); in num_plus()
117 init1(cl_number, result[i]) (ops.plus(x[i],y[i])); in num_plus()
122 var cl_number hicoeff = ops.plus(x[i],y[i]); in num_plus()
127 init1(cl_number, result[i]) (ops.plus(x[i],y[i])); in num_plus()
248 result[i+j] = ops.plus(result[i+j],ops.mul(x[i],yj)); in num_mul()
278 result[i+j] = ops.plus(result[i+j],ops.mul(xi,x[j])); in num_square()
283 result[i] = ops.plus(result[i],result[i]); in num_square()
288 result[2*i] = ops.plus(result[2*i],ops.square(x[i])); in num_square()
422 z = ops.plus(ops.mul(z,y),x[i]); in num_eval()
471 static void cl_heap_num_univpoly_ring_destructor (cl_heap* pointer) in cl_heap_num_univpoly_ring_destructor() argument
[all …]
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/cwebdir/
H A Dcomm-bs.ch16 @x Section 23.
23 @x Section 27.
32 typedef name_info *name_pointer; /* pointer into array of |name_info|s */
48 typedef name_info *name_pointer; /* pointer into array of |name_info|s */
56 @x Section 29.
63 @x Section 30.
130 char *last; /* last character of section name, plus one */
141 char *last; /* last character of section name, plus one */
172 char **pfirst; /* pointer to beginning of comparison string */
181 char **pfirst; /* pointer to beginning of comparison string */
[all …]
/dports/devel/cweb/cweb-3.64a.a/
H A Dcomm-bs.ch16 @x Section 23.
23 @x Section 27.
32 typedef name_info *name_pointer; /* pointer into array of |name_info|s */
48 typedef name_info *name_pointer; /* pointer into array of |name_info|s */
56 @x Section 29.
63 @x Section 30.
130 char *last; /* last character of section name, plus one */
141 char *last; /* last character of section name, plus one */
172 char **pfirst; /* pointer to beginning of comparison string */
181 char **pfirst; /* pointer to beginning of comparison string */
[all …]

12345678910>>...650