Home
last modified time | relevance | path

Searched refs:bvl (Results 26 – 50 of 397) sorted by relevance

12345678910>>...16

/dports/math/reduce/Reduce-svn5758-src/jlisp/core/
H A DFns.java199 LispObject bvl = fn.car; in applyInner() local
204 for (b = bvl; in applyInner()
209 if (passed < nvars) Jlisp.error("not enough args provided", bvl); in applyInner()
214 if (nrest > 1) Jlisp.error("may only have one &rest arg", bvl); in applyInner()
219 Jlisp.error("too many args provided", bvl); in applyInner()
231 for (LispObject b1 = bvl; !b1.atom; b1 = b1.cdr) in applyInner()
248 for (LispObject b1 = bvl; !b1.atom; b1 = b1.cdr) in applyInner()
/dports/math/reduce/Reduce-svn5758-src/jslisp/src/java/org/mathpiper/mpreduce/functions/builtin/
H A DFns.java186 LispObject bvl = fn.car; in applyInner() local
191 for (b = bvl; in applyInner()
196 if (passed < nvars) Jlisp.error("not enough args provided", bvl); in applyInner()
201 if (nrest > 1) Jlisp.error("may only have one &rest arg", bvl); in applyInner()
206 Jlisp.error("too many args provided", bvl); in applyInner()
218 for (LispObject b1 = bvl; !b1.atom; b1 = b1.cdr) in applyInner()
234 for (LispObject b1 = bvl; !b1.atom; b1 = b1.cdr) in applyInner()
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/cl/
H A Dcltab.red169 asserted procedure cl_gentheo(theo: List, f: Formula, bvl: List);
171 % quantifier-free formula; [bvl] is a list of variables. Returns a
175 % in $\Theta$ do not involve variables in [bvl].
177 w := cl_gentheo0(f,bvl);
181 asserted procedure cl_gentheo0(f: Formula, bvl: List): DottedPair;
182 % Generate theory. [f] is a quantifier-free formula; [bvl] is a
184 % is a list of inequations not containing variables from [bvl], and
188 while car (w:=cl_gentheo1(f,bvl)) do <<
196 asserted procedure cl_gentheo1(f: Formula, bvl: List): DottedPair;
197 % Generate theory subroutine. [f] is a formula; [bvl] is a list of
[all …]
H A Dclnf.red233 begin scalar fvl, bvl, avl, x, replacel;
234 fvl . bvl := cl_varl1 f; % We assume that [fvl] and [bvl] do not contain duplicates.
235 avl := append(fvl, bvl);
236 while bvl do <<
237 x := pop bvl;
336 return fvl . bvl;
339 fvl . bvl := cl_varl2(s, fvl, cbvl, bvl);
340 return fvl . bvl
346 fvl . bvl := cl_varl2(rl_b f, fvl, cbvl, bvl);
352 bvl := lto_insertq(v, bvl)
[all …]
/dports/lang/gnatdroid-sysroot/android-19-arm/usr/include/linux/
H A Dbio.h148 …_for_each_segment(bvl, bio, i, start_idx) for (bvl = bio_iovec_idx((bio), (start_idx)), i = (sta… argument
150 #define bio_for_each_segment(bvl, bio, i) __bio_for_each_segment(bvl, bio, i, (bio)->bi_idx) argument
/dports/lang/gnatdroid-sysroot-x86/android-19-x86/usr/include/linux/
H A Dbio.h148 …_for_each_segment(bvl, bio, i, start_idx) for (bvl = bio_iovec_idx((bio), (start_idx)), i = (sta… argument
150 #define bio_for_each_segment(bvl, bio, i) __bio_for_each_segment(bvl, bio, i, (bio)->bi_idx) argument
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/acfsf/
H A Dacfsfqe.red57 begin scalar w,qblkl,qff,bvl;
64 bvl := caddr w;
66 if null intersection(rl_varlat atf,bvl) then {atf};
67 xbvl := nconc(bvl,xbvl);
78 procedure acfsf_qeblk(qblk,f,theo,bvl);
81 % theory; [bvl] is a list of variables. Returns a formula
84 acfsf_qeblk1(cdr qblk,f,theo,bvl)
88 procedure acfsf_qeblk1(vl,f,theo,bvl);
92 % [bvl] is a list of variables. Returns a formula.
97 acfsf_qeblk2(vl,c,theo,bvl);
[all …]
/dports/math/reduce/Reduce-svn5758-src/contrib/boxdisplay/sml/
H A Dsmltest.red104 scalar bvl, body, env;
105 bvl := car (ff := cdr ff);
108 env := smlpair(bvl, arg, env);
277 if idp bvl then (bvl . arg) . env % A simple identifier
279 if bvl = arg then env
289 else if eqcar(bvl, 'smltuple) then smlpairlist(cdr bvl, arg, env)
295 if eqcar(arg, car bvl) then smlpairlist(cdr bvl, cdr arg, env)
332 if idp bvl then (bvl . '!?) . env % A simple identifier
342 smldummypairlist(cdr bvl, env)
384 bvl := env1;
[all …]
/dports/net/openldap25-client/openldap-2.5.9/libraries/libldap/
H A Dldifutil.c117 struct berval **bvl, bv; in ldap_parse_ldif_record_x() local
405 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
418 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
422 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
426 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
428 bvl[k] = NULL; in ldap_parse_ldif_record_x()
530 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
541 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
548 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
553 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
[all …]
/dports/net/openldap25-server/openldap-2.5.9/libraries/libldap/
H A Dldifutil.c117 struct berval **bvl, bv; in ldap_parse_ldif_record_x() local
405 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
418 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
422 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
426 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
428 bvl[k] = NULL; in ldap_parse_ldif_record_x()
530 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
541 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
548 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
553 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
[all …]
/dports/net/openldap26-client/openldap-2.6.0/libraries/libldap/
H A Dldifutil.c117 struct berval **bvl, bv; in ldap_parse_ldif_record_x() local
405 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
418 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
422 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
426 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
428 bvl[k] = NULL; in ldap_parse_ldif_record_x()
530 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
541 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
548 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
553 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
[all …]
/dports/net/openldap26-server/openldap-2.6.0/libraries/libldap/
H A Dldifutil.c117 struct berval **bvl, bv; in ldap_parse_ldif_record_x() local
405 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
418 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
422 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
426 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
428 bvl[k] = NULL; in ldap_parse_ldif_record_x()
530 bvl = (struct berval **)(pmods+nmods+1); in ldap_parse_ldif_record_x()
541 bvl[k++] = NULL; in ldap_parse_ldif_record_x()
548 lr->lr_lm[j].mod_bvalues = bvl+k; in ldap_parse_ldif_record_x()
553 bvl[k++] = lr->lr_vals+i; in ldap_parse_ldif_record_x()
[all …]
/dports/misc/vxl/vxl-3.3.2/core/doc/book/
H A Dchapter_vsl.texi52 vsl_b_ofstream bfs("my_object.bvl");
55 vcl_cerr<<"Failed to open my_object.bvl for output."<<vcl_endl;
69 vsl_b_ifstream bfs("my_object.bvl");
72 vcl_cerr<<"Failed to open my_object.bvl for input."<<vcl_endl;
104 vsl_quick_file_save("my_object.bvl",my_object);
105 vsl_quick_file_load("my_object.bvl",my_new_object);
120 vsl_b_ofstream bfs("my_object.bvl");
123 vcl_cerr<<"Failed to open my_object.bvl for output."<<vcl_endl;
158 vsl_b_ofstream bfs("data.bvl");
173 vsl_b_ifstream bfs("data.bvl");
[all …]
/dports/math/maxima/maxima-5.43.2/src/
H A Ddefcal.lisp18 (defun make-parser-fun-def (op p bvl body)
22 ,(car bvl)
27 ,(make-parser-fun-def (car op) p bvl body)
/dports/cad/alliance/alliance/src/proof/src/
H A DMakefile.am6 -I$(top_srcdir)/bvl/src \
16 -L$(top_builddir)/bvl/src/.libs \
/dports/math/cvc4/CVC4-1.7/src/theory/strings/
H A Dregexp_elim.cpp313 Node bvl = nm->mkNode(BOUND_VAR_LIST, non_greedy_find_vars); in eliminateConcat() local
314 res = nm->mkNode(EXISTS, bvl, body); in eliminateConcat()
444 Node bvl = nm->mkNode(BOUND_VAR_LIST, k); in eliminateConcat() local
445 body = nm->mkNode(EXISTS, bvl, body); in eliminateConcat()
531 Node bvl = nm->mkNode(BOUND_VAR_LIST, index); in eliminateStar() local
532 Node res = nm->mkNode(FORALL, bvl, body); in eliminateStar()
559 Node bvl = nm->mkNode(BOUND_VAR_LIST, index); in eliminateStar() local
560 Node res = nm->mkNode(FORALL, bvl, body); in eliminateStar()
/dports/lang/clisp/clisp-df3b9f6fdcff22832898e89a989eb499c0f842ed/src/
H A Dsequence.d2082 while (bvi != bvl) { in seq_filterop()
2134 var uintV bvi = bvl; in remove_help()
2197 while (bvi != bvl) { in remove_help()
2358 for (; bvl > 0; bvl--) { in remove_op()
2427 for (; bvl > 0; bvl--) { in delete_op()
2551 var uintV l1 = bvl; in remove_duplicates_list_from_start()
2635 var uintV l1 = bvl; in delete_duplicates_list_from_start()
2713 var uintV l1 = bvl; in delete_duplicates_list_from_end()
2827 if (bvl < 10) in seq_duplicates()
3221 while (bvi != bvl) { in substitute_help()
[all …]
/dports/cad/alliance/alliance/src/bvl/src/
H A DMakefile.am3 include_HEADERS = bvl.h
5 bvl_bedef.h bvl_drive.c bvl.h bvl_util.c \
/dports/multimedia/v4l_compat/linux-5.13-rc2/include/linux/
H A Dbvec.h141 #define for_each_bvec(bvl, bio_vec, iter, start) \ argument
144 ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \
145 bvec_iter_advance_single((bio_vec), &(iter), (bvl).bv_len))
/dports/multimedia/libv4l/linux-5.13-rc2/include/linux/
H A Dbvec.h141 #define for_each_bvec(bvl, bio_vec, iter, start) \ argument
144 ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \
145 bvec_iter_advance_single((bio_vec), &(iter), (bvl).bv_len))
/dports/multimedia/v4l-utils/linux-5.13-rc2/include/linux/
H A Dbvec.h141 #define for_each_bvec(bvl, bio_vec, iter, start) \ argument
144 ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \
145 bvec_iter_advance_single((bio_vec), &(iter), (bvl).bv_len))
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/ofsf/
H A Dofsfvsblock.red170 putv(db, 4, 'undefined); % [bvl]: do not make assumptions on variables in [bvl]
203 procedure vsdb_putbvl(db, bvl); putv(db, 4, bvl);
219 vsdb_putbvl(db, bvl);
297 db := vsdb_mk(vl, f, theo, bvl, ans);
392 begin scalar vl, f, theo, bvl, sltd, v, oo, de, del;
396 bvl := vsdb_bvl db;
401 de := vsde_mk(v, ofsf_reorder f, ofsf_reorderl theo, bvl);
550 begin scalar vl, f, theo, bvl, v, oo, de;
555 bvl := vsdb_bvl db;
569 begin scalar vl, f, theo, bvl, sltd, v, oo, de, del;
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/sygus/
H A Dsygus_grammar_cons.cpp420 Node bvl, in mkSygusDefaultGrammar() argument
433 if (!bvl.isNull()) in mkSygusDefaultGrammar()
435 for (unsigned i = 0, size = bvl.getNumChildren(); i < size; ++i) in mkSygusDefaultGrammar()
437 if (term_irrelevant.find(bvl[i]) == term_irrelevant.end()) in mkSygusDefaultGrammar()
439 sygus_vars.push_back(bvl[i]); in mkSygusDefaultGrammar()
444 << "...synth var " << bvl[i] << " has been marked irrelevant." in mkSygusDefaultGrammar()
597 datatypes.back().setSygus(types[i].toType(), bvl.toExpr(), true, true); in mkSygusDefaultGrammar()
755 datatypes[i].setSygus( types[i].toType(), bvl.toExpr(), true, true ); in mkSygusDefaultGrammar()
909 datatypes.back().setSygus( btype.toType(), bvl.toExpr(), true, true ); in mkSygusDefaultGrammar()
930 Node bvl, in mkSygusDefaultType() argument
[all …]
/dports/net/openldap24-server/openldap-2.4.59/servers/slapd/back-ldif/
H A Dldif.c731 # define BVL_NAME(bvl) ((char *) ((bvl) + 1)) argument
838 bvlist *bvl, **prev; in ldif_readdir() local
850 bvl = SLAP_MALLOC( BVL_SIZE( fname_len ) ); in ldif_readdir()
851 if ( bvl == NULL ) { in ldif_readdir()
856 strcpy( BVL_NAME( bvl ), dir->d_name ); in ldif_readdir()
865 bvl->inum = strtol( idxp, &endp2, 10 ); in ldif_readdir()
871 bvl->inum = INT_MIN; in ldif_readdir()
873 bvl->trunc = trunc; in ldif_readdir()
874 bvl->savech = *trunc; in ldif_readdir()
883 *prev = bvl; in ldif_readdir()
[all …]
/dports/net/openldap24-client/openldap-2.4.59/servers/slapd/back-ldif/
H A Dldif.c731 # define BVL_NAME(bvl) ((char *) ((bvl) + 1)) argument
838 bvlist *bvl, **prev; in ldif_readdir() local
850 bvl = SLAP_MALLOC( BVL_SIZE( fname_len ) ); in ldif_readdir()
851 if ( bvl == NULL ) { in ldif_readdir()
856 strcpy( BVL_NAME( bvl ), dir->d_name ); in ldif_readdir()
865 bvl->inum = strtol( idxp, &endp2, 10 ); in ldif_readdir()
871 bvl->inum = INT_MIN; in ldif_readdir()
873 bvl->trunc = trunc; in ldif_readdir()
874 bvl->savech = *trunc; in ldif_readdir()
883 *prev = bvl; in ldif_readdir()
[all …]

12345678910>>...16