/dports/devel/boost-docs/boost_1_72_0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/devel/R-cran-BH/BH/inst/include/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = (std::numeric_limits<size_type>::max)() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/devel/boost-libs/boost_1_72_0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/devel/hyperscan/boost_1_75_0/boost/random/detail/ |
H A D | qrng_base.hpp | 143 os << s.dimension() << " " << s.seq_count << " " << s.curr_elem; in BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR() 182 !((x.seq_count < y.seq_count ? y.seq_count - x.seq_count : x.seq_count - y.seq_count) in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 187 …(x.seq_count + (x.curr_elem / dimension_value) == y.seq_count + (y.curr_elem / dimension_value)) && in BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR() 199 size_type curr_seq() const { return seq_count; } in curr_seq() 207 seq_count = seq; in reset_seq() 225 size_type new_seq = seq_count; in next_state() 226 if (BOOST_LIKELY(++new_seq > seq_count)) in next_state() 239 const boost::uintmax_t max_z = std::numeric_limits<size_type>::max() - seq_count; in discard_vector() 246 derived().seed(static_cast<size_type>(seq_count + z)); in discard_vector() 266 size_type seq_count; member in boost::random::qrng_detail::qrng_base
|
/dports/biology/py-biopython/biopython-1.79/Bio/AlignIO/ |
H A D | __init__.py | 262 if seq_count: 269 if len(records) == seq_count: 282 def parse(handle, format, seq_count=None): argument 322 if seq_count is not None and not isinstance(seq_count, int): 329 i = iterator_generator(fp, seq_count) 333 i = _SeqIO_to_alignment_iterator(fp, format, seq_count=seq_count) 340 def read(handle, format, seq_count=None): argument 384 iterator = parse(handle, format, seq_count) 394 if seq_count: 395 if len(alignment) != seq_count: [all …]
|
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/target/iscsi/ |
H A D | iscsi_target_seq_pdu_list.c | 129 seq_count++; in iscsit_randomize_pdu_lists() 146 seq_count = 0; in iscsit_randomize_pdu_lists() 151 if (seq_count) { in iscsit_randomize_pdu_lists() 174 u32 *array, seq_count = cmd->seq_count; in iscsit_randomize_seq_lists() local 177 seq_count--; in iscsit_randomize_seq_lists() 179 seq_count -= 2; in iscsit_randomize_seq_lists() 181 if (!seq_count) in iscsit_randomize_seq_lists() 204 u32 *seq_count, in iscsit_determine_counts_for_list() argument 233 *seq_count += 1; in iscsit_determine_counts_for_list() 271 *seq_count += 1; in iscsit_determine_counts_for_list() [all …]
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/target/iscsi/ |
H A D | iscsi_target_seq_pdu_list.c | 129 seq_count++; in iscsit_randomize_pdu_lists() 146 seq_count = 0; in iscsit_randomize_pdu_lists() 151 if (seq_count) { in iscsit_randomize_pdu_lists() 174 u32 *array, seq_count = cmd->seq_count; in iscsit_randomize_seq_lists() local 177 seq_count--; in iscsit_randomize_seq_lists() 179 seq_count -= 2; in iscsit_randomize_seq_lists() 181 if (!seq_count) in iscsit_randomize_seq_lists() 204 u32 *seq_count, in iscsit_determine_counts_for_list() argument 233 *seq_count += 1; in iscsit_determine_counts_for_list() 271 *seq_count += 1; in iscsit_determine_counts_for_list() [all …]
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/target/iscsi/ |
H A D | iscsi_target_seq_pdu_list.c | 129 seq_count++; in iscsit_randomize_pdu_lists() 146 seq_count = 0; in iscsit_randomize_pdu_lists() 151 if (seq_count) { in iscsit_randomize_pdu_lists() 174 u32 *array, seq_count = cmd->seq_count; in iscsit_randomize_seq_lists() local 177 seq_count--; in iscsit_randomize_seq_lists() 179 seq_count -= 2; in iscsit_randomize_seq_lists() 181 if (!seq_count) in iscsit_randomize_seq_lists() 204 u32 *seq_count, in iscsit_determine_counts_for_list() argument 233 *seq_count += 1; in iscsit_determine_counts_for_list() 271 *seq_count += 1; in iscsit_determine_counts_for_list() [all …]
|
/dports/biology/vsearch/vsearch-2.17.1/src/ |
H A D | fastqops.cc | 85 uint64_t seq_count = 0; in fastq_chars() local 95 seq_count++; in fastq_chars() 200 if (seq_count > 0) in fastq_chars() 277 if (seq_count > 0) in fastq_chars() 364 uint64_t seq_count = 0; in fastq_stats() local 398 seq_count++; in fastq_stats() 540 symb_accum += seq_count - length_accum; in fastq_stats() 574 100.0 * (seq_count - length_dist[i-1]) / seq_count); in fastq_stats() 607 double PctRecs = 100.0 * (seq_count - length_dist[i-1]) / seq_count; in fastq_stats() 676 seq_count, seq_count / 1.0e6); in fastq_stats() [all …]
|
/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/tlx/tests/algorithm/ |
H A D | multiway_merge_benchmark.cpp | 130 void test_multiway_merge(size_t seq_count, const size_t seq_size) { in test_multiway_merge() argument 137 size_t total_size = seq_count * seq_items; in test_multiway_merge() 138 size_t total_bytes = seq_count * seq_size; in test_multiway_merge() 142 std::vector<sequence_type> seqs(seq_count); in test_multiway_merge() 148 for (size_t i = 0; i < seq_count; ++i) in test_multiway_merge() 162 std::mt19937_64 randgen(1234 + seq_count + seq_size); in test_multiway_merge() 164 for (long i = 0; i < static_cast<long>(seq_count); ++i) in test_multiway_merge() 195 for (size_t i = 0; i < seq_count; ++i) { in test_multiway_merge() 322 << " seq_count=" << seq_count in test_multiway_merge() 345 void test_repeat(size_t seq_count, const size_t seq_size) { in test_repeat() argument [all …]
|
/dports/devel/tlx/tlx-0.5.20200222-5-g8982a9d/tests/algorithm/ |
H A D | multiway_merge_benchmark.cpp | 130 void test_multiway_merge(size_t seq_count, const size_t seq_size) { in test_multiway_merge() argument 137 size_t total_size = seq_count * seq_items; in test_multiway_merge() 138 size_t total_bytes = seq_count * seq_size; in test_multiway_merge() 142 std::vector<sequence_type> seqs(seq_count); in test_multiway_merge() 148 for (size_t i = 0; i < seq_count; ++i) in test_multiway_merge() 162 std::mt19937_64 randgen(1234 + seq_count + seq_size); in test_multiway_merge() 164 for (long i = 0; i < static_cast<long>(seq_count); ++i) in test_multiway_merge() 195 for (size_t i = 0; i < seq_count; ++i) { in test_multiway_merge() 322 << " seq_count=" << seq_count in test_multiway_merge() 345 void test_repeat(size_t seq_count, const size_t seq_size) { in test_repeat() argument [all …]
|
/dports/textproc/libcyaml/libcyaml-1.3.0/src/ |
H A D | save.c | 1012 uint64_t seq_count) in cyaml__write_value() argument 1124 unsigned seq_count = ctx->seq_count; in cyaml__write_doc() local 1132 seq_count); in cyaml__write_doc() 1187 seq_count); in cyaml__write_mapping() 1196 seq_count); in cyaml__write_mapping() 1250 seq_count); in cyaml__write_sequence() 1271 unsigned seq_count) in cyaml__validate_save_params() argument 1312 unsigned seq_count, in cyaml__save() argument 1318 .seq_count = seq_count, in cyaml__save() 1380 unsigned seq_count) in cyaml_save_file() argument [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/kokkos/example/build_cmake_in_tree/ |
H A D | cmake_example.cpp | 77 long seq_count = 0; in main() local 79 seq_count += (i % 2) == 0; in main() 83 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 87 return (count == seq_count) ? 0 : -1; in main()
|
/dports/devel/kokkos/kokkos-3.4.01/example/build_cmake_in_tree/ |
H A D | cmake_example.cpp | 77 long seq_count = 0; in main() local 79 seq_count += (i % 2) == 0; in main() 83 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 87 return (count == seq_count) ? 0 : -1; in main()
|
/dports/science/sparta/sparta-20Oct2021/lib/kokkos/example/build_cmake_in_tree/ |
H A D | cmake_example.cpp | 77 long seq_count = 0; in main() local 79 seq_count += (i % 2) == 0; in main() 83 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 87 return (count == seq_count) ? 0 : -1; in main()
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/kokkos/example/build_cmake_installed_different_compiler/ |
H A D | foo.cpp | 82 long seq_count = 0; in main() local 84 seq_count += (i % 2) == 0; in main() 88 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 92 return (count == seq_count) ? 0 : -1; in main()
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/kokkos/example/build_cmake_installed/ |
H A D | cmake_example.cpp | 84 long seq_count = 0; in main() local 86 seq_count += (i % 2) == 0; in main() 90 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 96 return (count == seq_count) ? 0 : -1; in main()
|
/dports/devel/kokkos/kokkos-3.4.01/example/build_cmake_installed/ |
H A D | cmake_example.cpp | 84 long seq_count = 0; in main() local 86 seq_count += (i % 2) == 0; in main() 90 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 96 return (count == seq_count) ? 0 : -1; in main()
|
/dports/devel/kokkos/kokkos-3.4.01/example/build_cmake_installed_different_compiler/ |
H A D | foo.cpp | 82 long seq_count = 0; in main() local 84 seq_count += (i % 2) == 0; in main() 88 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 92 return (count == seq_count) ? 0 : -1; in main()
|
/dports/science/sparta/sparta-20Oct2021/lib/kokkos/example/build_cmake_installed/ |
H A D | cmake_example.cpp | 84 long seq_count = 0; in main() local 86 seq_count += (i % 2) == 0; in main() 90 printf("Sequential: %ld %10.6f\n", seq_count, count_time); in main() 96 return (count == seq_count) ? 0 : -1; in main()
|