/dports/math/R-cran-qualityTools/qualityTools/R/ |
H A D | ort_s.r | 1 …, runs = 4, anzahl_spalten = 3, levels1 = 2, levels2 = 0, factors1 = 3, factors2 = 0, colOrder = c… nameattr 3 …, runs = 8, anzahl_spalten = 7, levels1 = 2, levels2 = 0, factors1 = 7, factors2 = 0, colOrder = c… nameattr 9 …, runs = 9, anzahl_spalten = 4, levels1 = 3, levels2 = 0, factors1 = 4, factors2 = 0, colOrder = c… nameattr 12 …iv_max = 2, runs = 12, anzahl_spalten = 11, levels1 = 2, levels2 = 0, factors1 = 11, factors2 = 0, nameattr 18 …iv_max = 2, runs = 15, anzahl_spalten = 15, levels1 = 2, levels2 = 0, factors1 = 15, factors2 = 0, nameattr 38 … niv_max = 3, runs = 18, anzahl_spalten = 8, levels1 = 2, levels2 = 3, factors1 = 1, factors2 = 7, nameattr 48 …iv_max = 3, runs = 27, anzahl_spalten = 13, levels1 = 3, levels2 = 0, factors1 = 13, factors2 = 0, nameattr 67 …iv_max = 2, runs = 32, anzahl_spalten = 31, levels1 = 2, levels2 = 0, factors1 = 31, factors2 = 0, nameattr 127 …niv_max = 4, runs = 32, anzahl_spalten = 10, levels1 = 2, levels2 = 4, factors1 = 1, factors2 = 9, nameattr 170 …iv_max = 5, runs = 15, anzahl_spalten = 12, levels1 = 2, levels2 = 5, factors1 = 1, factors2 = 11, nameattr [all …]
|
H A D | tag_e.r | 190 oaChoose = function(factors1, factors2, level1, level2, ia) { argument 191 params = list(factors1 = 0, factors2 = 0, level1 = 0, level2 = 0, ia = 0) nameattr 194 if (!missing(factors2)) 195 params$factors2 = factors2 200 taguchiChoose = function(factors1 = 0, factors2 = 0, level1 = 0, level2 = 0, ia = 0) { argument 201 if (factors1 == 0 & factors2 == 0 & level1 == 0 & level2 == 0 & ia == 0) { 214 if (factors2 <= 0) 218 Anzahl_Spalten = factors1 + factors2 + ia 222 …if (li$factors1 >= factors1 & li$factors2 >= factors2 & (li$levels1 == level1 | li$levels1 == leve… 229 …cat(paste(factors1, "factors on", level1, "levels and", factors2, "factors on", level2, "levels wi…
|
/dports/math/singular/Singular-Release-4-2-1/factory/ |
H A D | facFqFactorizeUtil.h | 27 const CFList& factors2, ///< [in] a list of polys in decompressAppend() argument 33 for (CFListIterator i= factors2; i.hasItem(); i++) in decompressAppend() 43 const CFList& factors2, ///< [in] a list of polys 67 const CFList& factors2, ///< [in] a list of polys 80 const CFList& factors2, ///< [in] a list of polys
|
H A D | facFqFactorizeUtil.cc | 22 void appendSwap (CFList& factors1, const CFList& factors2, const int in appendSwap() argument 25 for (CFListIterator i= factors2; i.hasItem(); i++) in appendSwap() 69 void appendSwapDecompress (CFList& factors1, const CFList& factors2, in appendSwapDecompress() argument 79 for (CFListIterator i= factors2; i.hasItem(); i++) in appendSwapDecompress() 87 void appendSwapDecompress (CFList& factors1, const CFList& factors2, in appendSwapDecompress() argument 110 for (CFListIterator i= factors2; i.hasItem(); i++) in appendSwapDecompress()
|
H A D | facFqBivarUtil.h | 31 const CFList& factors2 ///< [in] a list of polys 52 const CFList& factors2, ///< [in] a list of polys
|
H A D | facFqFactorize.cc | 1268 gcdFreeBasis (CFFList& factors1, CFFList& factors2) in gcdFreeBasis() argument 1272 int l= factors2.length(); in gcdFreeBasis() 1279 for (j= factors2; (m < l && j.hasItem()); j++, m++) in gcdFreeBasis() 1287 factors2.append (CFFactor (g, j.getItem().exp())); in gcdFreeBasis() 2025 CFListIterator iter1= factors1, iter2= factors2; in checkHelper() 2037 factors2= Difference (factors2, l2); in checkHelper() 2050 CFList bad1= factors2; in checkOneToOne() 2059 if ((pos= findItem (factors2, tmp))) in checkOneToOne() 2135 if (recombinations == factors2.length() - 1) in recombination() 2145 if (find (factors2, buf)) in recombination() [all …]
|
H A D | facFqFactorize.h | 376 const CFList& factors2, ///<[in] list univariate factors 657 CFFList& factors2 ///< [in,out] list of factors, returns gcd free
|
H A D | facFqBivarUtil.cc | 41 void append (CFList& factors1, const CFList& factors2) in TIMING_DEFINE_PRINT() 43 for (CFListIterator i= factors2; i.hasItem(); i++) in TIMING_DEFINE_PRINT() 70 void appendSwapDecompress (CFList& factors1, const CFList& factors2, in appendSwapDecompress() argument 90 for (CFListIterator i= factors2; i.hasItem(); i++) in appendSwapDecompress()
|
/dports/math/R-cran-qualityTools/qualityTools/man/ |
H A D | oaChoose.rd | 11 oaChoose(factors1, factors2, level1, level2, ia) 17 \item{factors2}{ 24 number of levels for factors2.
|
H A D | taguchiChoose.Rd | 11 taguchiChoose(factors1 = 0, factors2 = 0, level1 = 0, level2 = 0, ia = 0) 17 \item{factors2}{ 24 integer number of levels for factors2. By default set to \sQuote{0}
|
/dports/science/py-dlib/dlib-19.22/dlib/test/ |
H A D | graph_cuts.cpp | 36 matrix<value_type> factors2; member in __anon7734a6000111::dense_potts_problem 46 factors2 = make_symmetric(randm(num_nodes, num_nodes, rnd) > 0.5); in dense_potts_problem() 113 return factors2(idx1, idx2); in factor_value_disagreement() 128 matrix<value_type> factors2; member in __anon7734a6000111::image_potts_problem 146 factors2 = randm(num_nodes, 4, rnd) > 0.5; in image_potts_problem() 297 return factors2(idx1, get_neighbor_idx(idx1,idx2)); in factor_value_disagreement()
|
/dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
H A D | graph_cuts.cpp | 36 matrix<value_type> factors2; member in __anon25b08cba0111::dense_potts_problem 46 factors2 = make_symmetric(randm(num_nodes, num_nodes, rnd) > 0.5); in dense_potts_problem() 113 return factors2(idx1, idx2); in factor_value_disagreement() 128 matrix<value_type> factors2; member in __anon25b08cba0111::image_potts_problem 146 factors2 = randm(num_nodes, 4, rnd) > 0.5; in image_potts_problem() 297 return factors2(idx1, get_neighbor_idx(idx1,idx2)); in factor_value_disagreement()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/skia/ext/ |
H A D | convolver_unittest.cc | 159 static const float factors2[] = { 0.0f, 1.0f, 1.0f, 1.0f, 1.0f }; in TEST() local 160 filter.AddFilter(22, factors2, base::size(factors2)); in TEST()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/skia/ext/ |
H A D | convolver_unittest.cc | 159 static const float factors2[] = { 0.0f, 1.0f, 1.0f, 1.0f, 1.0f }; in TEST() local 160 filter.AddFilter(22, factors2, base::size(factors2)); in TEST()
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/ |
H A D | procmap.cpp | 784 int ProcMap::combine_factors(int n1, int **factors1, int n2, int **factors2, in combine_factors() argument 790 factors[m][0] = factors1[i][0]*factors2[j][0]; in combine_factors() 791 factors[m][1] = factors1[i][1]*factors2[j][1]; in combine_factors() 792 factors[m][2] = factors1[i][2]*factors2[j][2]; in combine_factors()
|
/dports/science/lammps/lammps-stable_29Sep2021/src/ |
H A D | procmap.cpp | 769 int ProcMap::combine_factors(int n1, int **factors1, int n2, int **factors2, in combine_factors() argument 775 factors[m][0] = factors1[i][0]*factors2[j][0]; in combine_factors() 776 factors[m][1] = factors1[i][1]*factors2[j][1]; in combine_factors() 777 factors[m][2] = factors1[i][2]*factors2[j][2]; in combine_factors()
|
/dports/games/tuxmath/tuxmath_w_fonts-2.0.3/data/images/sprites/ |
H A D | Makefile.am | 33 factors2.png \
|
/dports/devel/bloaty/bloaty-1.1/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1572 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, in c_inner_product() argument 1576 container_algorithm_internal::c_begin(factors2), in c_inner_product() 1585 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, in c_inner_product() argument 1589 container_algorithm_internal::c_begin(factors2), in c_inner_product()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1656 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1660 container_algorithm_internal::c_begin(factors2), 1669 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1673 container_algorithm_internal::c_begin(factors2),
|
/dports/devel/abseil/abseil-cpp-20211102.0/absl/algorithm/ |
H A D | container.h | 1703 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1707 container_algorithm_internal::c_begin(factors2), 1716 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1720 container_algorithm_internal::c_begin(factors2),
|
/dports/net-im/tg_owt/tg_owt-d578c76/src/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1656 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1660 container_algorithm_internal::c_begin(factors2), 1669 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1673 container_algorithm_internal::c_begin(factors2),
|
/dports/graphics/R-cran-s2/s2/src/absl/algorithm/ |
H A D | container.h | 1693 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1697 container_algorithm_internal::c_begin(factors2), 1706 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1710 container_algorithm_internal::c_begin(factors2),
|
/dports/www/firefox/firefox-99.0/third_party/libwebrtc/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1657 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1661 container_algorithm_internal::c_begin(factors2), 1670 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1674 container_algorithm_internal::c_begin(factors2),
|
/dports/devel/pecl-grpc/grpc-1.42.0/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1693 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1697 container_algorithm_internal::c_begin(factors2), 1706 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1710 container_algorithm_internal::c_begin(factors2),
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/abseil-cpp/absl/algorithm/ |
H A D | container.h | 1693 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1697 container_algorithm_internal::c_begin(factors2), 1706 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2, 1710 container_algorithm_internal::c_begin(factors2),
|