| /dports/astro/gpstk/GPSTk-8.0.0/ext/lib/PosSol/ |
| H A D | Bancroft.cpp | 135 Vector<double> aux(4), alpha(N), solution1(4), solution2(4); in Compute() local
193 solution2 = M * BTBI * ( BT * DELTA2 * tau + BT * alpha ); in Compute()
194 double radius2(RSS(solution2(0), solution2(1), solution2(2))); in Compute()
205 X = solution2; in Compute()
212 SecondSolution = solution2; in Compute()
|
| /dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/io/file/test/ |
| H A D | backuprestore.cc | 109 DiscreteFunctionType2 solution2( "sol2", space2 ); in main() local
116 Dune::Fem::persistenceManager << solution2; in main()
121 Dune::Fem::interpolate( gridFunction, solution2 ); in main()
125 error.push_back( l2norm.distance( gridFunction, solution2 ) ); in main()
168 DiscreteFunctionType2 solution2( "sol2", space2 ); in main() local
173 Dune::Fem::persistenceManager << solution2; in main()
177 solution2.clear(); in main()
183 solution2.communicate(); in main()
190 errorNew.push_back( l2norm.distance( gridFunction, solution2 ) ); in main()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/base/ |
| H A D | parsed_convergence_table.h | 485 const VectorType & solution2, in difference() argument
488 AssertThrow(solution1.size() == solution2.size(), in difference()
489 ExcDimensionMismatch(solution1.size(), solution2.size())); in difference()
491 solution -= solution2; in difference()
506 const VectorType & solution2, in difference() argument
509 AssertThrow(solution1.size() == solution2.size(), in difference()
510 ExcDimensionMismatch(solution1.size(), solution2.size())); in difference()
512 solution -= solution2; in difference()
|
| /dports/graphics/polyclipping/polyclipping-6.4.2/C#/GuiDemo/GuiDemo/ |
| H A D | Form1.cs | 453 Polygons solution2 = new Polygons(); in DrawBitmap()
484 co.Execute(ref solution2, (double)nudOffset.Value * scale); in DrawBitmap()
487 solution2 = new Polygons(solution); in DrawBitmap()
489 foreach (Polygon pg in solution2) in DrawBitmap()
509 c.Execute(ClipType.ctUnion, solution2, GetPolyFillType(), GetPolyFillType()); in DrawBitmap()
510 foreach (Polygon pg in solution2) in DrawBitmap()
514 c.Execute(ClipType.ctUnion, solution2, GetPolyFillType(), GetPolyFillType()); in DrawBitmap()
515 foreach (Polygon pg in solution2) in DrawBitmap()
519 foreach (Polygon pg in solution2) in DrawBitmap()
521 c.Execute(ClipType.ctUnion, solution2, GetPolyFillType(), GetPolyFillType()); in DrawBitmap()
[all …]
|
| /dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/src/geometry/ |
| H A D | circle.cpp | 264 VECTOR2I solution2( x, -y ); in Intersect() local
265 solution2 = solution2.Rotate( rotAngle ); in Intersect()
266 solution2 += Center; in Intersect()
267 retval.push_back( solution2 ); in Intersect()
|
| /dports/games/openbubbles/openbubbles-1.2/src/ |
| H A D | bounce.cpp | 53 double & solution1,double & solution2) in quadraticFormula() argument
60 solution2=(-b-sqrt(determinant))/(2*a); in quadraticFormula()
|
| H A D | bounce.h | 43 double & solution1,double & solution2);
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-30/ |
| H A D | step-30.cc | 340 Vector<double> solution2; member in Step30::DGMethod
387 solution2.reinit(dof_handler.n_dofs()); in setup_system()
667 solution2, in refine_grid()
768 fe_v_subface.get_function_values(solution2, u); in set_anisotropic_flags()
769 fe_v_face_neighbor.get_function_values(solution2, in set_anisotropic_flags()
814 fe_v_face.get_function_values(solution2, u); in set_anisotropic_flags()
815 fe_v_face_neighbor.get_function_values(solution2, in set_anisotropic_flags()
858 fe_v_face.get_function_values(solution2, u); in set_anisotropic_flags()
859 fe_v_subface.get_function_values(solution2, in set_anisotropic_flags()
935 data_out.add_data_vector(solution2, "u"); in output_results()
[all …]
|
| /dports/misc/opennn/opennn-5.0.5/tests/ |
| H A D | correlations_test.cpp | 562 const type solution2 = static_cast<type>(2.6402); in test_linear_regression_missing_values() local
589 const type solution2 = static_cast<type>(0.017); in test_exponential_regression() local
616 const type solution2 = static_cast<type>(0.017); in test_exponential_regression_missing_values() local
643 const type solution2 = static_cast<type>(73.935); in test_logarithmic_regression() local
649 assert_true(lr.b - solution2 <= static_cast<type>(0.01), LOG); in test_logarithmic_regression()
670 const type solution2 = static_cast<type>(73.935); in test_logarithmic_regression_missing_values() local
677 assert_true(lr.b - solution2 <= static_cast<type>(0.01), LOG); in test_logarithmic_regression_missing_values()
698 const type solution2 = static_cast<type>(0.491); in test_power_regression() local
705 assert_true(pr.b - solution2 <= static_cast<type>(0.01), LOG); in test_power_regression()
727 const type solution2 = static_cast<type>(0.491); in test_power_regression_missing_values() local
|
| /dports/math/cbc/Cbc-releases-2.10.5/Cbc/examples/ |
| H A D | CbcSolver3.cpp | 119 const double *solution2 = temp.getColSolution(); in resolve() local
123 double value = solution2[i]; in resolve()
207 const double *solution2 = modelSmall.bestSolution(); in resolve() local
214 solution[iColumn] = solution2[i]; in resolve()
311 const double *solution2 = temp->primalColumnSolution(); in resolve() local
315 solution[iColumn] = solution2[i]; in resolve()
|
| H A D | CbcSolver2.cpp | 253 const double *solution2 = temp->primalColumnSolution(); in resolve() local
257 solution[iColumn] = solution2[i]; in resolve()
311 const double *solution2 = temp->primalColumnSolution(); in resolve() local
315 solution[iColumn] = solution2[i]; in resolve()
|
| /dports/misc/visp/visp-3.4.0/3rdparty/apriltag/ |
| H A D | apriltag_pose.cpp | 491 apriltag_pose_t* solution2, in estimate_tag_pose_orthogonal_iteration() argument
518 get_second_solution(v, p, solution1, solution2, nIters, err2); in estimate_tag_pose_orthogonal_iteration()
550 …atd_t* v[4], matd_t* p[4], apriltag_pose_t* solution1, apriltag_pose_t* solution2, int nIters, dou… in get_second_solution() argument
551 solution2->R = fix_pose_ambiguities(v, p, solution1->t, solution1->R, 4); in get_second_solution()
552 if (solution2->R) { in get_second_solution()
553 solution2->t = matd_create(3, 1); in get_second_solution()
554 *err2 = orthogonal_iteration(v, p, &solution2->t, &solution2->R, 4, nIters); in get_second_solution()
|
| /dports/www/dillo2/dillo-3.0.5/test/ |
| H A D | dw_imgbuf_mem_test.cc | 50 void solution2 () in solution2() function
103 solution2 (); in main()
|
| /dports/devel/hs-spago/spago-0.20.3/_cabal_deps/free-5.1.6/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/free-5.1.6/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/free-5.1.6/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/free-5.1.7/examples/ |
| H A D | Cabbage.lhs | 102 > solution2 :: Iter Situation
103 > solution2 = solution' initial function
115 *Cabbage> solution2
125 *Cabbage> retract solution2
135 *Cabbage> unsafeIter solution2
|
| /dports/www/hs-DAV/DAV-1.3.4/_cabal_deps/free-5.1.3/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/free-5.1.3/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/devel/elm-format/elm-format-0.8.3/_cabal_deps/free-5.1.3/examples/ |
| H A D | Cabbage.lhs | 101 > solution2 :: Iter Situation
102 > solution2 = solution' initial function
114 *Cabbage> solution2
124 *Cabbage> retract solution2
134 *Cabbage> unsafeIter solution2
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/platform/animation/ |
| H A D | timing_function.cc | 89 const double solution2 = bezier_->bezier().range_max(); in Range() local
99 *min_value = std::min(std::min(*min_value, solution1), solution2); in Range()
100 *max_value = std::max(std::max(*max_value, solution1), solution2); in Range()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/platform/animation/ |
| H A D | timing_function.cc | 84 const double solution2 = bezier_->bezier().range_max(); in Range() local
94 *min_value = std::min(std::min(*min_value, solution1), solution2); in Range()
95 *max_value = std::max(std::max(*max_value, solution1), solution2); in Range()
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_db.c | 595 struct derivation_step *solution2 = solution->next; in find_derivation() local
597 if (solution2->cost_hi < solution->cost_hi in find_derivation()
598 || (solution2->cost_hi == solution->cost_hi in find_derivation()
599 && solution2->cost_lo < solution->cost_lo)) in find_derivation()
600 solution = solution2; in find_derivation()
|
| /dports/devel/arm-none-eabi-newlib/newlib-2.4.0/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_db.c | 595 struct derivation_step *solution2 = solution->next; in find_derivation() local
597 if (solution2->cost_hi < solution->cost_hi in find_derivation()
598 || (solution2->cost_hi == solution->cost_hi in find_derivation()
599 && solution2->cost_lo < solution->cost_lo)) in find_derivation()
600 solution = solution2; in find_derivation()
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_db.c | 595 struct derivation_step *solution2 = solution->next; in find_derivation() local
597 if (solution2->cost_hi < solution->cost_hi in find_derivation()
598 || (solution2->cost_hi == solution->cost_hi in find_derivation()
599 && solution2->cost_lo < solution->cost_lo)) in find_derivation()
600 solution = solution2; in find_derivation()
|