| /dports/math/boolector/boolector-3.2.2/examples/api/c/matrixmultass/ |
| H A D | matrixmultass.c | 14 BoolectorSort esort, in matrix_mult() argument
27 zero = boolector_zero (btor, esort); in matrix_mult()
64 BoolectorSort isort, esort, asort; in main() local
88 esort = boolector_bitvec_sort (btor, num_bits); in main()
89 asort = boolector_array_sort (btor, isort, esort); in main()
95 A_x_B = matrix_mult (btor, A, B, size, esort, asort, "AxB"); in main()
96 B_x_C = matrix_mult (btor, B, C, size, esort, asort, "BxC"); in main()
97 AB_x_C = matrix_mult (btor, A_x_B, C, size, esort, asort, "ABxC"); in main()
98 A_x_BC = matrix_mult (btor, A, B_x_C, size, esort, asort, "AxBC"); in main()
117 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/matrixmultcomm/ |
| H A D | matrixmultcomm.c | 14 BoolectorSort esort, in matrix_mult() argument
27 zero = boolector_zero (btor, esort); in matrix_mult()
64 BoolectorSort isort, esort, asort; in main() local
88 esort = boolector_bitvec_sort (btor, num_bits); in main()
89 asort = boolector_array_sort (btor, isort, esort); in main()
94 A_x_B = matrix_mult (btor, A, B, size, esort, asort, "AxB"); in main()
95 B_x_A = matrix_mult (btor, B, A, size, esort, asort, "BxA"); in main()
111 boolector_release_sort (btor, esort); in main()
|
| /dports/cad/calculix/CalculiX/cgx_2.18/src/ |
| H A D | foamFaces.c | 69 Esort *esort=NULL; in innerFacesHe8() local
254 esort[i].e0=iface[i].elem_nr; in innerFacesHe8()
255 esort[i].e1=iface[i].nod[4]; in innerFacesHe8()
256 esort[i].i=i; in innerFacesHe8()
258 qsort( esort, nif, sizeof(Esort), (void *)compareElems ); in innerFacesHe8()
265 iface2[i].elem_nr =iface[esort[i].i].elem_nr; in innerFacesHe8()
266 iface2[i].nr =iface[esort[i].i].nr ; in innerFacesHe8()
267 iface2[i].nod[4] =iface[esort[i].i].nod[4] ; in innerFacesHe8()
268 iface2[i].nod[5] =iface[esort[i].i].nod[5] ; in innerFacesHe8()
269 for(j=0; j<4; j++) iface2[i].nod[j]=iface[esort[i].i].nod[j]; in innerFacesHe8()
[all …]
|
| H A D | mergEntity.c | 278 Esort *esort=NULL; in mergeElem() local
298 if((esort=(Esort *)realloc((Esort *)esort, (sum_e+1)*sizeof(Esort)))==NULL) in mergeElem()
300 esort[i].nr=indx; in mergeElem()
302 for (; n<20; n++) esort[sum_e].nod[n]=0; in mergeElem()
315 n=compareNodesOfElems(&esort[j],&esort[i]); in mergeElem()
319 …++) for (k=0; k<line[jj].ne; k++) if( line[jj].elem[k] == esort[i].nr ) line[jj].elem[k] =esort[j]… in mergeElem()
320 …++) for (k=0; k<surf[jj].ne; k++) if( surf[jj].elem[k] == esort[i].nr ) surf[jj].elem[k] =esort[j]… in mergeElem()
321 …++) for (k=0; k<body[jj].ne; k++) if( body[jj].elem[k] == esort[i].nr ) body[jj].elem[k] =esort[j]… in mergeElem()
326 …e!=(char *)NULL)&&( getIndex(&set[jj].elem,set[jj].anz_e, esort[i].nr) >-1)) seta(jj,"e",esort[j].… in mergeElem()
332 delem[sum_delem]=esort[i].nr; in mergeElem()
[all …]
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/linearsearch/ |
| H A D | linearsearch.c | 13 BoolectorSort isort, esort, asort; in main() local
41 esort = boolector_bitvec_sort (btor, num_bits); in main()
42 asort = boolector_array_sort (btor, isort, esort); in main()
47 val = boolector_var (btor, esort, "search_val"); in main()
75 boolector_release_sort (btor, esort); in main()
|
| /dports/math/octave-forge-control/control-3.3.1/inst/ |
| H A D | esort.m | 17 ## @deftypefn {Function File} {@var{s} =} esort(@var{p})
18 ## @deftypefnx {Function File} {[@var{s}, @var{ndx}] =} esort(@var{p})
42 function [s, ndx] = esort(p) function
45 error("esort: argument must be a vector");
71 %! [s_obs, ndx_obs] = esort(p);
|
| H A D | dsort.m | 35 ## @seealso{eig, esort, pole, pzmap, sort, zero}
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/max/ |
| H A D | max.c | 12 BoolectorSort isort, esort, asort; in main() local
40 esort = boolector_bitvec_sort (btor, num_bits); in main()
41 asort = boolector_array_sort (btor, isort, esort); in main()
72 boolector_release_sort (btor, esort); in main()
|
| /dports/math/concorde/concorde/CUT/ |
| H A D | segments.c | 197 int *esort = (int *) NULL; in CCcut_linsub_allcuts() local
237 esort = CC_SAFE_MALLOC (ecount, int); in CCcut_linsub_allcuts()
238 if (eperm == (int *) NULL || esort == (int *) NULL) { in CCcut_linsub_allcuts()
243 esort[i] = (perm_inv[elist[2*i]] < perm_inv[elist[2*i+1]] in CCcut_linsub_allcuts()
248 CCutil_int_perm_quicksort (eperm, esort, ecount); in CCcut_linsub_allcuts()
268 CC_FREE (esort, int); in CCcut_linsub_allcuts()
293 CC_IFFREE (esort, int); in CCcut_linsub_allcuts()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/selectionsort/ |
| H A D | selectionsort.c | 14 BoolectorSort isort, esort, asort; in main() local
42 esort = boolector_bitvec_sort (btor, num_bits); in main()
43 asort = boolector_array_sort (btor, isort, esort); in main()
133 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/doublereversearray/ |
| H A D | doublereversearray.c | 139 BoolectorSort isort, esort, asort; in main() local
156 esort = boolector_bitvec_sort (btor, 8); in main()
157 asort = boolector_array_sort (btor, isort, esort); in main()
182 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/memcpy/ |
| H A D | memcpy.c | 43 BoolectorSort isort, esort, asort; in main() local
92 esort = boolector_bitvec_sort (btor, 8); in main()
93 asort = boolector_array_sort (btor, isort, esort); in main()
205 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/selectionsortmem/ |
| H A D | selectionsortmem.c | 16 BoolectorSort isort, esort, asort; in main() local
32 esort = boolector_bitvec_sort (btor, 8); in main()
33 asort = boolector_array_sort (btor, isort, esort); in main()
182 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/swapmem/ |
| H A D | swapmem.c | 81 BoolectorSort isort, esort, asort; in main() local
108 esort = boolector_bitvec_sort (btor, 8); in main()
110 asort = boolector_array_sort (btor, isort, esort); in main()
177 boolector_release_sort (btor, esort); in main()
|
| /dports/math/boolector/boolector-3.2.2/examples/api/c/sudoku/ |
| H A D | sudoku.c | 239 BoolectorSort isort, esort, asort; in main() local
264 esort = boolector_bitvec_sort (btor, SUDOKU_NUM_BITS_VAL); in main()
265 asort = boolector_array_sort (btor, isort, esort); in main()
275 for (i = 0; i <= 9; i++) values[i] = boolector_unsigned_int (btor, i, esort); in main()
282 vars[i] = boolector_var (btor, esort, varname); in main()
399 boolector_release_sort (btor, esort); in main()
|
| /dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/qmd/ |
| H A D | qmd_tdks_enmo.F | 202 double precision esort local
239 esort=dbl_mb(k_exe+j-1)
241 dbl_mb(k_exe+i-1)=esort
|
| /dports/science/nwchem-data/nwchem-7.0.2-release/src/qmd/ |
| H A D | qmd_tdks_enmo.F | 202 double precision esort
239 esort=dbl_mb(k_exe+j-1)
241 dbl_mb(k_exe+i-1)=esort
|
| /dports/mail/lurker/lurker-2.3/libesort/ |
| H A D | Makefile.am | 6 Transaction.h View.h esort.h io.h
|
| /dports/devel/libvirt/libvirt-7.10.0/tests/qemuxml2argvdata/ |
| H A D | s390-default-cpu-kvm-ccw-virtio-4.2.s390x-latest.args | 15 …ter=on,mepochptff=on,ap=on,vxeh=on,vxpd=on,esop=on,msa9_pckmo=on,vxeh2=on,esort=on,apqi=on,apft=on…
|
| H A D | default-video-type-s390x.s390x-latest.args | 15 …ter=on,mepochptff=on,ap=on,vxeh=on,vxpd=on,esop=on,msa9_pckmo=on,vxeh2=on,esort=on,apqi=on,apft=on…
|
| H A D | launch-security-s390-pv.s390x-latest.args | 15 …ter=on,mepochptff=on,ap=on,vxeh=on,vxpd=on,esop=on,msa9_pckmo=on,vxeh2=on,esort=on,apqi=on,apft=on…
|
| /dports/math/octave-forge-control/control-3.3.1/ |
| H A D | INDEX | 46 esort
|
| /dports/misc/talkfilters/talkfilters-2.3.8/ |
| H A D | dubya.l | 121 [Rr]esort gtf_puts_case("retort"); BEGIN(INW);
|
| /dports/cad/electric/electric-7.00/src/net/ |
| H A D | netdiff.cpp | 2389 esort(celllist1, cells1, sizeof (PCOMP *), net_sortbycelltype); in net_checkcomponenttypes()
2390 esort(celllist2, cells2, sizeof (PCOMP *), net_sortbycelltype); in net_checkcomponenttypes()
2894 esort(pnlist, total, sizeof (PNET *), net_sortpnetlist);
3351 esort(es1, c1, sizeof (EXPORTSYMGROUP), net_sortexportsymgroup); in net_analyzesymmetrygroups()
3352 esort(es2, c2, sizeof (EXPORTSYMGROUP), net_sortexportsymgroup); in net_analyzesymmetrygroups()
5785 esort(netnames1, total1, sizeof (CHAR *), sort_stringascending); in itemHitAction()
5807 esort(netnames2, total2, sizeof (CHAR *), sort_stringascending); in itemHitAction()
5951 esort(pn1list, pn1total, sizeof (PNET *), net_sortpnet); in putNetIntoDialog()
5969 esort(pn2list, pn2total, sizeof (PNET *), net_sortpnet); in putNetIntoDialog()
6248 esort(pc1list, pc1total, sizeof (PCOMP *), net_sortpcomp); in putCompIntoDialog()
[all …]
|
| /dports/www/tikiwiki/tiki-21.2/vendor_bundled/vendor/jason-munro/cypht/modules/imap/ |
| H A D | hm-imap.php | 1898 …public function get_message_sort_order($sort='ARRIVAL', $reverse=true, $filter='ALL', $esort=array… argument
1905 if (!empty($esort) && $this->is_supported('ESORT')) {
1906 …$valid = array_filter($esort, function($v) { return in_array($v, array('MIN', 'MAX', 'COUNT', 'ALL…
|