/dports/science/rdkit/rdkit-Release_2021_03_5/Code/ForceField/UFF/ |
H A D | AngleBend.cpp | 107 d_order = order; in AngleBendContrib() 182 PRECONDITION(d_order == 0 || d_order == 1 || d_order == 2 || d_order == 3 || in getEnergyTerm() 183 d_order == 4, in getEnergyTerm() 189 if (d_order == 0) { in getEnergyTerm() 192 switch (d_order) { in getEnergyTerm() 210 res /= (double)(d_order * d_order); in getEnergyTerm() 216 PRECONDITION(d_order == 0 || d_order == 1 || d_order == 2 || d_order == 3 || in getThetaDeriv() 217 d_order == 4, in getThetaDeriv() 223 if (d_order == 0) { in getThetaDeriv() 233 switch (d_order) { in getThetaDeriv() [all …]
|
H A D | TorsionAngle.cpp | 126 d_order = 3; in calcTorsionParams() 140 d_order = 2; in calcTorsionParams() 145 d_order = 2; in calcTorsionParams() 151 d_order = 6; in calcTorsionParams() 160 d_order = 2; in calcTorsionParams() 168 d_order = 3; in calcTorsionParams() 177 PRECONDITION(d_order == 2 || d_order == 3 || d_order == 6, "bad order"); in getEnergy() 193 switch (d_order) { in getEnergy() 253 PRECONDITION(d_order == 2 || d_order == 3 || d_order == 6, "bad order"); in getThetaDeriv() 258 switch (d_order) { in getThetaDeriv() [all …]
|
/dports/print/ghostscript9-agpl-base/ghostscript-9.52/base/ |
H A D | gsht.c | 1347 gs_memory_t *memory = d_order ? d_order->data_memory->non_gc_memory : NULL; in gx_ht_construct_threshold() 1353 int num_repeat, shift, num_levels = d_order ? d_order->num_levels : 0; in gx_ht_construct_threshold() 1363 num_repeat = d_order->full_height / d_order->height; in gx_ht_construct_threshold() 1364 shift = d_order->shift; in gx_ht_construct_threshold() 1367 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in gx_ht_construct_threshold() 1401 for( i = 0; i < d_order->width * d_order->full_height; i++ ) { in gx_ht_construct_threshold() 1410 if (d_order->levels[shade] > d_order->levels[base_shade]) { in gx_ht_construct_threshold() 1413 for (j = d_order->levels[base_shade]; j < d_order->levels[shade]; j++) { in gx_ht_construct_threshold() 1415 code = d_order->procs->bit_index(d_order, j, &ppt); in gx_ht_construct_threshold() 1433 d_order->threshold = thresh; in gx_ht_construct_threshold() [all …]
|
/dports/print/ghostscript9-agpl-x11/ghostscript-9.52/base/ |
H A D | gsht.c | 1347 gs_memory_t *memory = d_order ? d_order->data_memory->non_gc_memory : NULL; in gx_ht_construct_threshold() 1353 int num_repeat, shift, num_levels = d_order ? d_order->num_levels : 0; in gx_ht_construct_threshold() 1363 num_repeat = d_order->full_height / d_order->height; in gx_ht_construct_threshold() 1364 shift = d_order->shift; in gx_ht_construct_threshold() 1367 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in gx_ht_construct_threshold() 1401 for( i = 0; i < d_order->width * d_order->full_height; i++ ) { in gx_ht_construct_threshold() 1410 if (d_order->levels[shade] > d_order->levels[base_shade]) { in gx_ht_construct_threshold() 1413 for (j = d_order->levels[base_shade]; j < d_order->levels[shade]; j++) { in gx_ht_construct_threshold() 1415 code = d_order->procs->bit_index(d_order, j, &ppt); in gx_ht_construct_threshold() 1433 d_order->threshold = thresh; in gx_ht_construct_threshold() [all …]
|
/dports/print/ghostscript9-x11/ghostscript-9.06/base/ |
H A D | gsht.c | 1452 num_repeat = d_order->full_height / d_order->height; in gx_ht_construct_threshold() 1453 shift = d_order->shift; in gx_ht_construct_threshold() 1455 if (d_order == NULL) return -1; in gx_ht_construct_threshold() 1458 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in gx_ht_construct_threshold() 1463 d_order->threshold_inverts = false; in gx_ht_construct_threshold() 1503 hsize = d_order->num_levels; in gx_ht_construct_threshold() 1511 while (l < d_order->num_levels) { in gx_ht_construct_threshold() 1513 if (d_order->levels[l] > d_order->levels[prev_l]) { in gx_ht_construct_threshold() 1532 for (j = d_order->levels[prev_l]; j < d_order->levels[l]; j++) { in gx_ht_construct_threshold() 1534 code = d_order->procs->bit_index(d_order, j, &ppt); in gx_ht_construct_threshold() [all …]
|
H A D | gdevtsep.c | 1615 gx_ht_order *d_order; in sep1_ht_order_to_thresholds() local 1672 num_repeat = d_order->full_height / d_order->height; in threshold_from_order() 1673 shift = d_order->shift; in threshold_from_order() 1678 d_order->width, d_order->height ); in threshold_from_order() 1680 d_order->num_levels, d_order->raster ); in threshold_from_order() 1684 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in threshold_from_order() 1690 d_order->width, d_order->height ); in threshold_from_order() 1692 d_order->num_levels, d_order->raster ); in threshold_from_order() 1699 *Width = d_order->width; in threshold_from_order() 1705 if( d_order->levels[l] > d_order->levels[prev_l] ) { in threshold_from_order() [all …]
|
/dports/print/ghostscript9-base/ghostscript-9.06/base/ |
H A D | gsht.c | 1452 num_repeat = d_order->full_height / d_order->height; in gx_ht_construct_threshold() 1453 shift = d_order->shift; in gx_ht_construct_threshold() 1455 if (d_order == NULL) return -1; in gx_ht_construct_threshold() 1458 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in gx_ht_construct_threshold() 1463 d_order->threshold_inverts = false; in gx_ht_construct_threshold() 1503 hsize = d_order->num_levels; in gx_ht_construct_threshold() 1511 while (l < d_order->num_levels) { in gx_ht_construct_threshold() 1513 if (d_order->levels[l] > d_order->levels[prev_l]) { in gx_ht_construct_threshold() 1532 for (j = d_order->levels[prev_l]; j < d_order->levels[l]; j++) { in gx_ht_construct_threshold() 1534 code = d_order->procs->bit_index(d_order, j, &ppt); in gx_ht_construct_threshold() [all …]
|
H A D | gdevtsep.c | 1615 gx_ht_order *d_order; in sep1_ht_order_to_thresholds() local 1672 num_repeat = d_order->full_height / d_order->height; in threshold_from_order() 1673 shift = d_order->shift; in threshold_from_order() 1678 d_order->width, d_order->height ); in threshold_from_order() 1680 d_order->num_levels, d_order->raster ); in threshold_from_order() 1684 thresh = (byte *)gs_malloc(memory, d_order->width * d_order->full_height, 1, in threshold_from_order() 1690 d_order->width, d_order->height ); in threshold_from_order() 1692 d_order->num_levels, d_order->raster ); in threshold_from_order() 1699 *Width = d_order->width; in threshold_from_order() 1705 if( d_order->levels[l] > d_order->levels[prev_l] ) { in threshold_from_order() [all …]
|
/dports/print/ghostscript8-x11/ghostscript-8.71/base/ |
H A D | gdevtsep.c | 1193 gx_ht_order *d_order; in sep1_ht_order_to_thresholds() local 1247 d_order->width, d_order->height ); in threshold_from_order() 1249 d_order->num_levels, d_order->raster ); in threshold_from_order() 1259 d_order->width, d_order->height ); in threshold_from_order() 1261 d_order->num_levels, d_order->raster ); in threshold_from_order() 1268 *Width = d_order->width; in threshold_from_order() 1269 *Height = d_order->height; in threshold_from_order() 1273 while( l < d_order->num_levels ) { in threshold_from_order() 1274 if( d_order->levels[l] > d_order->levels[prev_l] ) { in threshold_from_order() 1281 for( j=d_order->levels[prev_l]; j<d_order->levels[l]; j++) { in threshold_from_order() [all …]
|
/dports/print/ghostscript8-base/ghostscript-8.71/base/ |
H A D | gdevtsep.c | 1193 gx_ht_order *d_order; in sep1_ht_order_to_thresholds() local 1247 d_order->width, d_order->height ); in threshold_from_order() 1249 d_order->num_levels, d_order->raster ); in threshold_from_order() 1259 d_order->width, d_order->height ); in threshold_from_order() 1261 d_order->num_levels, d_order->raster ); in threshold_from_order() 1268 *Width = d_order->width; in threshold_from_order() 1269 *Height = d_order->height; in threshold_from_order() 1273 while( l < d_order->num_levels ) { in threshold_from_order() 1274 if( d_order->levels[l] > d_order->levels[prev_l] ) { in threshold_from_order() 1281 for( j=d_order->levels[prev_l]; j<d_order->levels[l]; j++) { in threshold_from_order() [all …]
|
/dports/math/qtiplot-doc/qtiplot-0.9.8.9/qtiplot/src/analysis/ |
H A D | PolynomialFit.cpp | 38 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 44 : Fit(parent, c), d_order(order), show_legend(legend) in PolynomialFit() 51 : Fit(parent, c), d_order(order), show_legend(legend) in PolynomialFit() 58 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 65 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 72 : Fit(parent, t), d_order(order), show_legend(legend) in PolynomialFit() 83 setOrder(d_order); in init() 89 d_order = order; in setOrder() 90 d_p = d_order + 1; in setOrder() 95 d_formula = generateFormula(d_order); in setOrder() [all …]
|
H A D | PolynomialFit.h | 49 int order(){return d_order;}; in order() 61 int d_order; variable
|
/dports/science/scidavis/scidavis-2.4.0/libscidavis/src/ |
H A D | PolynomialFit.cpp | 39 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 46 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 54 : Fit(parent, g), d_order(order), show_legend(legend) in PolynomialFit() 65 d_p = d_order + 1; in init() 71 d_formula = generateFormula(d_order); in init() 72 d_param_names = generateParameterList(d_order); in init()
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/MolCatalog/ |
H A D | MolCatalogEntry.h | 42 unsigned int getOrder() const { return d_order; }; in getOrder() 43 void setOrder(unsigned int order) { d_order = order; }; in setOrder() 102 unsigned int d_order{0};
|
H A D | MolCatalogEntry.cpp | 29 d_order = 0; in MolCatalogEntry() 43 d_order = other.d_order; in MolCatalogEntry()
|
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/ |
H A D | SUMA_MiscFunc.h | 116 SUMA_INDEXING_ORDER d_order, FILE *fout, 119 SUMA_INDEXING_ORDER d_order, FILE *fout, 122 SUMA_INDEXING_ORDER d_order, FILE *fout, 125 SUMA_INDEXING_ORDER d_order, FILE *fout, 128 SUMA_INDEXING_ORDER d_order, FILE *fout, 131 SUMA_INDEXING_ORDER d_order, FILE *fout, 134 SUMA_INDEXING_ORDER d_order, FILE *fout, 137 SUMA_INDEXING_ORDER d_order, FILE *fout,
|
H A D | SUMA_SurfSmooth.c | 1431 SUMA_INDEXING_ORDER d_order=SUMA_NO_ORDER; in main() local 1611 d_order = SUMA_COLUMN_MAJOR; in main() 1677 d_order = SUMA_COLUMN_MAJOR; in main() 2561 d_order = SUMA_ROW_MAJOR; in main() 2570 d_order, NULL, YUP); in main() 2590 d_order = SUMA_ROW_MAJOR; in main() 2599 d_order, NULL, YUP); in main() 2622 d_order = SUMA_ROW_MAJOR; in main() 2642 d_order, NULL, YUP); in main() 2661 d_order = SUMA_ROW_MAJOR; in main() [all …]
|
H A D | SUMA_GeomComp.h | 172 int vpn, SUMA_INDEXING_ORDER d_order, float *fout_user, 211 int vpn, SUMA_INDEXING_ORDER d_order, float *fout_user, 239 int N_iter, int vpn, SUMA_INDEXING_ORDER d_order, 266 int vpn, SUMA_INDEXING_ORDER d_order, 270 int vpn, SUMA_INDEXING_ORDER d_order, 276 int vpn, SUMA_INDEXING_ORDER d_order, 305 int vpn, SUMA_INDEXING_ORDER d_order,
|
H A D | SUMA_SurfaceToSurface.h | 50 …M_STRUCT *M2M, float *far_data, int ncol, int nrow, SUMA_INDEXING_ORDER d_order, int useClosest );
|
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/ |
H A D | inst_match_trie.cpp | 37 || (imtio && index == imtio->d_order.size())) in addInstMatch() 41 unsigned i_index = imtio ? imtio->d_order[index] : index; in addInstMatch() 93 Assert(!imtio || index < imtio->d_order.size()); in removeInstMatch() 94 unsigned i_index = imtio ? imtio->d_order[index] : index; in removeInstMatch() 100 || (imtio && (index + 1) == imtio->d_order.size())) in removeInstMatch() 117 || (imtio && index == imtio->d_order.size())) in recordInstLemma() 122 unsigned i_index = imtio ? imtio->d_order[index] : index; in recordInstLemma()
|
/dports/comms/gnuradio/gnuradio-3.8.4.0/gr-wavelet/lib/ |
H A D | wavelet_ff_impl.cc | 49 d_order(order), in wavelet_ff_impl() 52 d_wavelet = gsl_wavelet_alloc(gsl_wavelet_daubechies, d_order); in wavelet_ff_impl()
|
H A D | wavelet_ff_impl.h | 35 int d_order; variable
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/FragCatalog/ |
H A D | FragCatalogEntry.cpp | 38 d_order = path.size(); in FragCatalogEntry() 97 if (d_order != other->getOrder()) { in match() 202 tmpInt = d_order; in toStream() 246 d_order = tmpInt; in initFromStream()
|
/dports/science/sparta/sparta-20Oct2021/src/KOKKOS/ |
H A D | compute_sonine_grid_kokkos.cpp | 64 d_order = k_order.d_view; in ComputeSonineGridKokkos() 277 for (int n=1; n<d_order[m]; n++) { in operator ()() 284 for (int n=1; n<d_order[m]; n++) { in operator ()() 325 for (int n=1; n<d_order[m]; n++) { in operator ()() 332 for (int n=1; n<d_order[m]; n++) { in operator ()()
|
/dports/comms/gnuradio/gnuradio-3.8.4.0/gr-digital/lib/ |
H A D | costas_loop_cc_impl.h | 35 int d_order;
|