| /dports/math/cgl-conic/CGL-CONIC-releases-1.0.0-6-gc96de60/src/ |
| H A D | CglConicCutGenerator.hpp | 97 double * c2_; member in Disjunction
106 c2_ = new double[size]; in Disjunction()
107 std::copy (c2, c2+size, c2_); in Disjunction()
120 c2_ = new double[size_]; in Disjunction()
122 std::copy(other_c2, other_c2+size_, c2_); in Disjunction()
139 if (c2_) in operator =()
140 delete[] c2_; in operator =()
141 c2_ = new double[size_]; in operator =()
143 std::copy(rhs_c2, rhs_c2+size_, c2_); in operator =()
149 ~Disjunction() { delete[] c1_; delete[] c2_; } in ~Disjunction()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/step/linesearch/ |
| H A D | ROL_ScalarMinimizationLineSearch.hpp | 72 Real c2_; member in ROL::ScalarMinimizationLineSearch
122 const Real c2_; member in ROL::ScalarMinimizationLineSearch::LineSearchStatusTest
133 : phi_(phi), f0_(f0), g0_(g0), c1_(c1), c2_(c2), c3_(c3), in LineSearchStatusTest()
155 curvcond = (gx >= c2_*g0_); in check()
158 curvcond = (std::abs(gx) <= c2_*std::abs(g0_)); in check()
161 curvcond = (c2_*g0_ <= gx && gx <= -c3_*g0_); in check()
230 c2_ = ((c2_ < zero) ? p9 : c2_); in ScalarMinimizationLineSearch()
232 if ( c2_ <= c1_ ) { in ScalarMinimizationLineSearch()
234 c2_ = p9; in ScalarMinimizationLineSearch()
238 c2_ = p4; in ScalarMinimizationLineSearch()
[all …]
|
| H A D | ROL_LineSearch.hpp | 74 Real c2_; member in ROL::LineSearch
107 …c2_ = parlist.sublist("Step").sublist("Line Search").sublist("Curvature Condition").get(… in LineSearch()
115 c2_ = ((c2_ < zero) ? p9 : c2_); in LineSearch()
117 if ( c2_ <= c1_ ) { in LineSearch()
119 c2_ = p9; in LineSearch()
122 c2_ = p4; in LineSearch()
123 c3_ = std::min(one-c2_,c3_); in LineSearch()
237 && (sgnew >= c2_*sgold)) in status()
239 && (std::abs(sgnew) <= c2_*std::abs(sgold))) in status()
241 && (c2_*sgold <= sgnew && sgnew <= -c3_*sgold)) in status()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/elementwise/ |
| H A D | ROL_BinaryFunctions.hpp | 171 const Real c2_; member in ROL::Elementwise::ValueSet
177 threshold_(threshold), option_(option), c1_(c1), c2_(c2) {} in ValueSet()
180 Real result(c2_); in apply()
182 case LESS_THAN: { result = y < threshold_ ? c1_ : c2_; break; } in apply()
183 case EQUAL_TO: { result = y == threshold_ ? c1_ : c2_; break; } in apply()
184 case GREATER_THAN: { result = y > threshold_ ? c1_ : c2_; break; } in apply()
|
| /dports/science/tfel-edf/tfel-3.2.1/tfel-check/src/ |
| H A D | Comparison.cxx | 31 const std::shared_ptr<Column> c2_, in Comparison() argument
41 c2(c2_), in Comparison()
60 const std::shared_ptr<Column> c2_, in setParameters() argument
69 this->c2 = c2_; in setParameters()
|
| /dports/science/tfel/tfel-3.4.0/tfel-check/src/ |
| H A D | Comparison.cxx | 31 const std::shared_ptr<Column> c2_, in Comparison() argument
41 c2(c2_), in Comparison()
60 const std::shared_ptr<Column> c2_, in setParameters() argument
69 this->c2 = c2_; in setParameters()
|
| /dports/graphics/nplot/nplot-9a92e78/src/ |
| H A D | RectangleBrushes.cs | 59 private readonly Color c2_; field in NPlot.RectangleBrushes.Horizontal
69 c2_ = c2; in Horizontal()
79 return new LinearGradientBrush(rectangle, c1_, c2_, LinearGradientMode.Horizontal); in Get()
117 private readonly Color c2_; field in NPlot.RectangleBrushes.HorizontalCenterFade
127 c2_ = c2; in HorizontalCenterFade()
137 …LinearGradientBrush brush = new LinearGradientBrush(rectangle, c1_, c2_, LinearGradientMode.Horizo… in Get()
1341 private readonly Color c2_; field in NPlot.RectangleBrushes.Vertical
1351 c2_ = c2; in Vertical()
1361 return new LinearGradientBrush(rectangle, c1_, c2_, LinearGradientMode.Vertical); in Get()
1399 private readonly Color c2_; field in NPlot.RectangleBrushes.VerticalCenterFade
[all …]
|
| /dports/science/nest/nest-simulator-3.1/models/ |
| H A D | ginzburg_neuron.h | 143 double c2_; variable
156 c2_( 1.0 ) in gainfunction_ginzburg()
170 return rng->drand() < c1_ * h + c2_ * 0.5 * ( 1.0 + tanh( c3_ * ( h - theta_ ) ) ); in operator()
|
| H A D | ginzburg_neuron.cpp | 33 def< double >( d, names::c_2, c2_ ); in get()
42 updateValueParam< double >( d, names::c_2, c2_, node ); in set()
|
| /dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/libff/libff/algebra/fields/ |
| H A D | fp_aux.tcc | 165 #define COMBA_3_BY_3_MUL(c0_, c1_, c2_, res_, A_, B_) \ argument
230 : [c0] "=&r" (c0_), [c1] "=&r" (c1_), [c2] "=&r" (c2_) \
234 #define COMBA_3_BY_3_SQR(c0_, c1_, c2_, res_, A_) \ argument
290 : [c0] "=&r" (c0_), [c1] "=&r" (c1_), [c2] "=&r" (c2_) \
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/function/nlls/ |
| H A D | ROL_NonlinearLeastSquaresObjective.hpp | 78 ROL::Ptr<Vector<Real> > c1_, c2_, c1dual_, x_; member in ROL::NonlinearLeastSquaresObjective
94 c2_ = convec.clone(); in NonlinearLeastSquaresObjective()
115 con_->applyJacobian(*c2_,v,x,tol); in hessVec()
116 con_->applyAdjointJacobian(hv,c2_->dual(),x,tol); in hessVec()
|
| /dports/www/firefox-esr/firefox-91.8.0/testing/web-platform/tests/tools/third_party/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/lang/spidermonkey60/firefox-60.9.0/testing/web-platform/tests/tools/third_party/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/lang/spidermonkey60/firefox-60.9.0/third_party/python/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/www/firefox/firefox-99.0/testing/web-platform/tests/tools/third_party/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/mail/thunderbird/thunderbird-91.8.0/testing/web-platform/tests/tools/third_party/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/lang/spidermonkey78/firefox-78.9.0/testing/web-platform/tests/tools/third_party/attrs/tests/ |
| H A D | test_slots.py | 152 c2_ = C2Slots(x=1, y=2, z="test")
154 assert c2 == c2_
204 c2_ = C2Slots(x=1, y=2, z="test")
205 assert c2 == c2_
246 c2_ = C2Slots(x=1, y=2, z="test")
247 assert c2 == c2_
318 c2_ = C2Slots(x=1, y=2, z="test")
319 assert c2 == c2_
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/function/simopt/ |
| H A D | ROL_NonlinearLeastSquaresObjective_SimOpt.hpp | 81 ROL::Ptr<Vector<Real> > c1_, c2_, cdual_, udual_, z_; member in ROL::NonlinearLeastSquaresObjective_SimOpt
98 c2_ = cvec.clone(); in NonlinearLeastSquaresObjective_SimOpt()
121 con_->applyJacobian_1(*c2_,v,u,*z_,tol); in hessVec()
122 con_->applyAdjointJacobian_1(hv,c2_->dual(),u,*z_,tol); in hessVec()
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/function/dynamic/ |
| H A D | ROL_NonlinearLeastSquaresObjective_Dynamic.hpp | 84 Ptr<Vector<Real> > c1_, c2_, cdual_, udual_; member in ROL::NonlinearLeastSquaresObjective_Dynamic
102 c2_ = c.clone(); in NonlinearLeastSquaresObjective_Dynamic()
124 con_->applyJacobian_un(*c2_,v,*uo_,u,*z_,*ts_); in hessVec()
125 con_->applyAdjointJacobian_un(hv,c2_->dual(),*uo_,u,*z_,*ts_); in hessVec()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/third_party/python/attrs/tests/ |
| H A D | test_slots.py | 158 c2_ = C2Slots(x=1, y=2, z="test")
160 assert c2 == c2_
215 c2_ = C2Slots(x=1, y=2, z="test")
216 assert c2 == c2_
258 c2_ = C2Slots(x=1, y=2, z="test")
259 assert c2 == c2_
331 c2_ = C2Slots(x=1, y=2, z="test")
332 assert c2 == c2_
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/net/cert/internal/ |
| H A D | cert_issuer_source_sync_unittest.h | 65 ASSERT_TRUE(ReadTestCert("c2.pem", &c2_)); in SetUp()
83 AddCert(c2_); in AddAllCerts()
123 scoped_refptr<ParsedCertificate> c2_; variable
188 EXPECT_TRUE(this->IssuersMatch(this->c2_, {this->i1_1_, this->i1_2_})); in TYPED_TEST_P()
207 EXPECT_TRUE(this->IssuersMatch(this->c2_, {this->i1_2_})); in TYPED_TEST_P()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/net/cert/internal/ |
| H A D | cert_issuer_source_sync_unittest.h | 65 ASSERT_TRUE(ReadTestCert("c2.pem", &c2_)); in SetUp()
83 AddCert(c2_); in AddAllCerts()
123 scoped_refptr<ParsedCertificate> c2_; variable
188 EXPECT_TRUE(this->IssuersMatch(this->c2_, {this->i1_1_, this->i1_2_})); in TYPED_TEST_P()
207 EXPECT_TRUE(this->IssuersMatch(this->c2_, {this->i1_2_})); in TYPED_TEST_P()
|
| /dports/finance/quantlib/QuantLib-1.20/ql/math/distributions/ |
| H A D | normaldistribution.cpp | 85 const Real InverseCumulativeNormal::c2_ = -3.223964580411365e-01; member in QuantLib::InverseCumulativeNormal
117 z = (((((c1_*z+c2_)*z+c3_)*z+c4_)*z+c5_)*z+c6_) / in tail_value()
122 z = -(((((c1_*z+c2_)*z+c3_)*z+c4_)*z+c5_)*z+c6_) / in tail_value()
141 const Real MoroInverseCumulativeNormal::c2_ = 0.1607979714918209; member in QuantLib::MoroInverseCumulativeNormal
170 result = c0_+result*(c1_+result*(c2_+result*(c3_+result* in operator ()()
|
| /dports/finance/quantlib/QuantLib-1.20/ql/math/optimization/ |
| H A D | constraint.hpp | 154 : c1_(c1), c2_(c2) {} in Impl()
156 return c1_.test(params) && c2_.test(params); in test()
160 Array c2ub = c2_.upperBound(params); in upperBound()
169 Array c2lb = c2_.lowerBound(params); in lowerBound()
177 Constraint c1_, c2_; member in QuantLib::CompositeConstraint::Impl
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/distance/ |
| H A D | conservative_advancement_stack_data-inl.h | 58 int c1_, int c2_, S d_)
59 : P1(P1_), P2(P2_), c1(c1_), c2(c2_), d(d_)
|