| /dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
| H A D | CbcSimpleInteger.cpp | 337 down_[0] = rhs.down_[0]; in CbcIntegerBranchingObject()
338 down_[1] = rhs.down_[1]; in CbcIntegerBranchingObject()
362 down_[0] = rhs.down_[0]; in operator =()
363 down_[1] = rhs.down_[1]; in operator =()
447 iColumn, olb, oub, down_[0], down_[1]); in branch()
599 down_[0] = CoinMax(down_[0], lower); in tighten()
601 down_[1] = CoinMin(down_[1], upper); in tighten()
620 down_[0] = CoinMax(lower, down_[0]); in applyExtraBounds()
621 down_[1] = CoinMin(upper, down_[1]); in applyExtraBounds()
622 assert(down_[0] <= down_[1]); in applyExtraBounds()
[all …]
|
| H A D | CbcBranchCut.cpp | 128 down_ = OsiRowCut(); in CbcCutBranchingObject()
140 down_ = down; in CbcCutBranchingObject()
149 down_ = rhs.down_; in CbcCutBranchingObject()
160 down_ = rhs.down_; in operator =()
190 cut = &down_; in branch()
257 cut = &down_; in print()
298 const OsiRowCut &r0 = way_ == -1 ? down_ : up_; in compareOriginalObject()
299 const OsiRowCut &r1 = br->way_ == -1 ? br->down_ : br->up_; in compareOriginalObject()
317 OsiRowCut &r0 = way_ == -1 ? down_ : up_; in compareBranchingObject()
318 const OsiRowCut &r1 = br->way_ == -1 ? br->down_ : br->up_; in compareBranchingObject()
|
| H A D | CbcBranchLotsize.cpp | 644 down_[0] = 0.0; in CbcLotsizeBranchingObject()
645 down_[1] = 0.0; in CbcLotsizeBranchingObject()
671 down_[0] = lowerValue; in CbcLotsizeBranchingObject()
672 down_[1] = upperValue; in CbcLotsizeBranchingObject()
681 down_[0] = rhs.down_[0]; in CbcLotsizeBranchingObject()
682 down_[1] = rhs.down_[1]; in CbcLotsizeBranchingObject()
693 down_[0] = rhs.down_[0]; in operator =()
694 down_[1] = rhs.down_[1]; in operator =()
733 iColumn, olb, oub, down_[0], down_[1]); in branch()
735 assert(olb < down_[0] + 1.0e-7 && oub > down_[1] - 1.0e-7); in branch()
[all …]
|
| /dports/databases/py-alembic/alembic-1.7.5/tests/ |
| H A D | test_version_traversal.py | 17 def down_(self, rev): member in MigrationTest
143 [self.down_(self.e), self.down_(self.d)],
150 [self.down_(self.c), self.down_(self.b), self.down_(self.a)],
163 [self.down_(self.e), self.down_(self.d), self.down_(self.c)],
170 [self.down_(self.d)],
177 [self.down_(self.d), self.down_(self.c), self.down_(self.b)],
354 [self.down_(self.d2), self.down_(self.c2)],
363 [self.down_(self.d2)],
369 [self.down_(self.d2)],
624 [self.down_(self.d1), self.down_(self.c1)],
[all …]
|
| /dports/textproc/fldiff/fldiff-1.1/ |
| H A D | FavoritesWindow.cxx | 33 down_(320, 80, 25, 25, "@2>"), in FavoritesWindow()
49 down_.callback((Fl_Callback *)down_cb, this); in FavoritesWindow()
81 fw->down_.activate(); in browser_cb()
83 fw->down_.deactivate(); in browser_cb()
89 fw->down_.deactivate(); in browser_cb()
130 fw->down_.activate(); in delete_cb()
132 fw->down_.deactivate(); in delete_cb()
166 fw->down_.deactivate(); in down_cb()
210 down_.deactivate(); in load()
303 fw->down_.activate(); in up_cb()
|
| /dports/databases/py-alembic14/alembic-1.4.3/tests/ |
| H A D | test_version_traversal.py | 16 def down_(self, rev): member in MigrationTest
123 [self.down_(self.e), self.down_(self.d)],
130 [self.down_(self.c), self.down_(self.b), self.down_(self.a)],
143 [self.down_(self.e), self.down_(self.d), self.down_(self.c)],
150 [self.down_(self.d)],
157 [self.down_(self.d), self.down_(self.c), self.down_(self.b)],
297 self.down_(self.b),
316 [self.down_(self.d2), self.down_(self.c2), self.down_(self.d1)],
381 [self.down_(self.d1), self.down_(self.c1)],
464 [self.down_(self.d1), self.down_(self.c1)],
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/devel/hyperscan/boost_1_75_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true;
82 while (down_)
84 down_ = node_stack_.top ()->traverse (node_stack_,
88 while (!down_ && !node_stack_.empty ())
93 perform_op_stack_, down_);
95 if (!down_) node_stack_.pop ();
178 bool &down_) const = 0;
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/databases/percona57-server/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/databases/percona57-client/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/devel/boost-libs/boost_1_72_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/spirit/home/support/detail/lexer/parser/tree/ |
| H A D | node.hpp | 75 bool down_ = true; in copy() local
82 while (down_) in copy()
84 down_ = node_stack_.top ()->traverse (node_stack_, in copy()
88 while (!down_ && !node_stack_.empty ()) in copy()
93 perform_op_stack_, down_); in copy()
95 if (!down_) node_stack_.pop (); in copy()
178 bool &down_) const = 0;
|
| /dports/games/xgalaga++/xgalaga++-0.9/ |
| H A D | input.cc | 10 , up_ (false), down_ (false), last_is_up_(false) in Input()
53 down_ = true; in Update()
117 down_ = false; in Update()
135 if (!up_ && !down_) vmove_ = 0; in Update()
136 else if ( up_ && !down_) vmove_ = -1; in Update()
137 else if (!up_ && down_) vmove_ = 1; in Update()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Segment_Delaunay_graph_hierarchy_vertex_base_2.h | 49 : V_Base(), up_( Vertex_handle() ), down_( Vertex_handle() ) {} in Segment_Delaunay_graph_hierarchy_vertex_base_2()
53 : V_Base(ss,f), up_( Vertex_handle() ), down_( Vertex_handle() ) {} in Segment_Delaunay_graph_hierarchy_vertex_base_2()
57 Vertex_handle down() { return down_; } in down()
59 void set_down(Vertex_handle d) { down_ = d; } in set_down()
63 Vertex_handle down_; // same vertex one level below variable
|