| /dports/devel/hyperscan/boost_1_75_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 110 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
113 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
118 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
185 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
187 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
203 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
239 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
242 box_type box_exp(ch_i.first); in choose_by_minimum_content_cost()
247 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 112 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
115 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
120 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
187 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
189 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
205 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
241 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
244 box_type box_exp(ch_i.first); in choose_by_minimum_content_cost()
249 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 110 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
113 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
118 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
185 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
187 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
203 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
239 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
242 box_type box_exp(ch_i.first); in choose_by_minimum_content_cost()
247 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 110 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
113 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
118 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
185 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
187 box_type box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
203 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
239 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
242 box_type box_exp(ch_i.first); in choose_by_minimum_content_cost()
247 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 99 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
102 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
107 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
169 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
171 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
187 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
221 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
224 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
229 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 84 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
87 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
92 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
150 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
152 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
168 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
205 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
208 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
213 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 87 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
90 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
95 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
153 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
155 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
171 … overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first); in choose_by_minimum_overlap_cost_first_n()
208 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
211 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
216 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 109 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
112 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
117 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
184 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
186 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
202 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
238 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
241 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
246 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 109 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
112 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
117 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
184 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
186 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
202 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
238 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
241 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
246 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/geometry/index/detail/rtree/rstar/ |
| H A D | choose_next_node.hpp | 109 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost() local
112 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost()
117 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_overlap_cost()
184 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n() local
186 Box box_exp(ch_i.first); in choose_by_minimum_overlap_cost_first_n()
202 …overlap_diff += overlap_exp - index::detail::intersection_content(ch_i.first, ch_j.first, strategy… in choose_by_minimum_overlap_cost_first_n()
238 child_type const& ch_i = children[i]; in choose_by_minimum_content_cost() local
241 Box box_exp(ch_i.first); in choose_by_minimum_content_cost()
246 content_type content_diff = content - index::detail::content(ch_i.first); in choose_by_minimum_content_cost()
|
| /dports/misc/iio-oscilloscope/iio-oscilloscope-0.14-master/plugins/ |
| H A D | dac_data_manager.c | 84 struct dds_channel ch_i; member
1808 tx->ch_i.t1.number = 1; in dds_tx_init()
1809 tx->ch_i.t2.number = 2; in dds_tx_init()
1815 tx->ch_i.parent = tx; in dds_tx_init()
1817 tx->ch_i.t1.parent = &tx->ch_i; in dds_tx_init()
1818 tx->ch_i.t2.parent = &tx->ch_i; in dds_tx_init()
1834 tx->ch_i.t1.number = 1; in dds_non_iq_tx_init()
1835 tx->ch_i.t2.number = 2; in dds_non_iq_tx_init()
1841 tx->ch_i.parent = tx; in dds_non_iq_tx_init()
1843 tx->ch_i.t1.parent = &tx->ch_i; in dds_non_iq_tx_init()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/spirit/home/support/detail/lexer/parser/tokeniser/ |
| H A D | re_tokeniser_helper.hpp | 526 CharT ch_i = static_cast<CharT> (start_); in charset_range() local
529 (std::isupper (ch_i, state_._locale) || in charset_range()
530 std::islower (ch_i, state_._locale))) in charset_range()
532 CharT upper_ = std::toupper (ch_i, state_._locale); in charset_range()
533 CharT lower_ = std::tolower (ch_i, state_._locale); in charset_range()
540 chars_ += (ch_i); in charset_range()
|
| /dports/biology/subread/subread-2.0.2-source/src/ |
| H A D | tx-unique.c | 330 int tx_i, ex_i, ch_i; in txunique_process_gene() local
338 for(ch_i = 0; ch_i < chro_list->numOfElements; ch_i++){ in txunique_process_gene()
339 char * t_chro = ArrayListGet(chro_list, ch_i); in txunique_process_gene()
349 for(ch_i = 0; ch_i < chro_list -> numOfElements; ch_i ++){ in txunique_process_gene()
351 char * chro = ArrayListGet(chro_list, ch_i); in txunique_process_gene()
|
| /dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
| H A D | ewalds_multipole_sr.fypp | 339 ch_i = HUGE(0.0_dp)
347 ch_i = charges(atom_b)
359 eloc = eloc + ch_i*tij*ch_j
362 fr(1) = fr(1) - ch_j * tij_a(1) * ch_i
363 fr(2) = fr(2) - ch_j * tij_a(2) * ch_i
364 fr(3) = fr(3) - ch_j * tij_a(3) * ch_i
372 ef0_j = ef0_j + tij * ch_i
380 ef1_j(1) = ef1_j(1) + tij_a(1) * ch_i
544 - ch_i*(tij_a(1)*dp_j(1)+&
551 + ch_i*(damptji_a(1)*dp_j(1)+&
[all …]
|
| /dports/science/cp2k-data/cp2k-7.1.0/src/ |
| H A D | ewalds_multipole_sr.fypp | 339 ch_i = HUGE(0.0_dp)
347 ch_i = charges(atom_b)
359 eloc = eloc + ch_i*tij*ch_j
362 fr(1) = fr(1) - ch_j * tij_a(1) * ch_i
363 fr(2) = fr(2) - ch_j * tij_a(2) * ch_i
364 fr(3) = fr(3) - ch_j * tij_a(3) * ch_i
372 ef0_j = ef0_j + tij * ch_i
380 ef1_j(1) = ef1_j(1) + tij_a(1) * ch_i
544 - ch_i*(tij_a(1)*dp_j(1)+&
551 + ch_i*(damptji_a(1)*dp_j(1)+&
[all …]
|
| /dports/graphics/opencollada/OpenCOLLADA-1.6.68/Externals/MayaDataModel/include/ |
| H A D | MayaDMCacheFile.h | 41 void setChannel(size_t ch_i,const string& ch) in setChannel() argument
44 fprintf(mFile,"\tsetAttr \".ch[%i]\" -type \"string\" ",ch_i); in setChannel()
193 void getChannel(size_t ch_i)const in getChannel() argument
195 fprintf(mFile,"\"%s.ch[%i]\"",mName.c_str(),ch_i); in getChannel()
|
| /dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Framework/src/ |
| H A D | LzAri.cpp | 185 int i, c, ch_i, ch_sym; in UpdateModel() local
197 ch_i = sym_to_char[i]; ch_sym = sym_to_char[sym]; in UpdateModel()
198 sym_to_char[i] = ch_sym; sym_to_char[sym] = ch_i; in UpdateModel()
199 char_to_sym[ch_i] = sym; char_to_sym[ch_sym] = i; in UpdateModel()
|
| /dports/biology/ugene/ugene-40.1/src/corelibs/U2View/src/util_smith_waterman/ |
| H A D | SubstMatrixDialog.cpp | 86 char ch_i = alphaChars.at(i); in prepareTable() local
88 float score = m.getScore(ch_i, ch_j); in prepareTable()
|
| /dports/misc/urbit/urbit-urbit-0.6.0/vere/ |
| H A D | main.c | 73 c3_i ch_i; in _main_getopt() local
94 while ( (ch_i=getopt(argc, argv,"G:B:A:H:I:w:u:t:f:k:l:n:p:r:NabcdgqsvxFMPDXR")) != -1 ) { in _main_getopt()
95 switch ( ch_i ) { in _main_getopt()
|