Home
last modified time | relevance | path

Searched refs:max_repeats (Results 1 – 25 of 108) sorted by relevance

12345

/dports/misc/visp/visp-3.4.0/modules/robot/src/haptic-device/qbdevice/
H A DvpQbDevice.cpp130 m_max_repeats = max_repeats; in setMaxRepeats()
199 while (failures <= max_repeats) { in getCurrents()
213 while (failures <= max_repeats) { in getInfo()
231 while (failures <= max_repeats) { in getMeasurements()
260 while (failures <= max_repeats) { in getPositions()
278 while (failures <= max_repeats) { in getSerialPortsAndDevices()
285 if (failures >= max_repeats) { in getSerialPortsAndDevices()
387 while (failures <= max_repeats) { in isActive()
401 while (failures <= max_repeats) { in isConnected()
452 while (failures <= max_repeats) { in setCommandsAndWait()
[all …]
/dports/misc/visp/visp-3.4.0/modules/robot/include/visp3/robot/
H A DvpQbDevice.h72 void setMaxRepeats(const int &max_repeats);
78 virtual int activate(const int &id, const bool &command, const int &max_repeats);
79 virtual int activate(const int &id, const int &max_repeats);
81 virtual int deactivate(const int &id, const int &max_repeats);
83 virtual int getCurrents(const int &id, const int &max_repeats, std::vector<short int> &currents);
85 virtual int getInfo(const int &id, const int &max_repeats, std::string &info);
89 …virtual int getPositions(const int &id, const int &max_repeats, std::vector<short int> &positions);
90 virtual int getSerialPortsAndDevices(const int &max_repeats);
94 virtual int isActive(const int &id, const int &max_repeats, bool &status);
95 int isConnected(const int &id, const int &max_repeats);
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/devel/boost-python-libs/boost_1_72_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/math/pdal/PDAL-2.3.0/vendor/pdalboost/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/databases/percona57-server/boost_1_59_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/databases/xtrabackup/boost_1_59_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/databases/percona57-client/boost_1_59_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/devel/boost-libs/boost_1_72_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/devel/hyperscan/boost_1_75_0/libs/property_tree/examples/
H A Dspeed_test.cpp42 int max_repeats = 1000000 / size; in clock_push_back() local
43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
49 if (n >= max_repeats) in clock_push_back()
88 int max_repeats = 100000 / size; in clock_erase() local
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
92 for (int n = 0; n < max_repeats; ++n) in clock_erase()
100 if (n >= max_repeats) in clock_erase()
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/tests/
H A Dtest_os_utils.cpp71 const size_t max_repeats = 32; in test_get_cpu_cycle_counter() local
88 result.test_lt("CPU cycle counter eventually changes value", counts, max_repeats); in test_get_cpu_cycle_counter()
96 const size_t max_repeats = 128; in test_get_high_resolution_clock() local
108 result.test_lt("high resolution clock eventually changes value", counts, max_repeats); in test_get_high_resolution_clock()
/dports/security/botan2/Botan-2.18.2/src/tests/
H A Dtest_os_utils.cpp71 const size_t max_repeats = 32; in test_get_cpu_cycle_counter() local
88 result.test_lt("CPU cycle counter eventually changes value", counts, max_repeats); in test_get_cpu_cycle_counter()
96 const size_t max_repeats = 128; in test_get_high_resolution_clock() local
108 result.test_lt("high resolution clock eventually changes value", counts, max_repeats); in test_get_high_resolution_clock()
/dports/math/py-opt-einsum/opt_einsum-3.3.0/opt_einsum/
H A Dpath_random.py85 …def __init__(self, max_repeats=32, max_time=None, minimize='flops', parallel=False, pre_dispatch=1… argument
90 self.max_repeats = max_repeats
175 r_stop = r_start + self.max_repeats
388 random_greedy_128 = functools.partial(random_greedy, max_repeats=128)
/dports/sysutils/magicrescue/magicrescue-1.1.10/tools/
H A Dtextextract.c84 int score, max_repeats; in inspect_char() local
111 if (s->repeated_char == c && (max_repeats = replut[c])) { in inspect_char()
113 if (s->sum_repeats > max_repeats) { in inspect_char()
116 s->sum_repeats, max_repeats, (long long)s->offset); in inspect_char()
/dports/devel/boost-python-libs/boost_1_72_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/databases/percona57-server/boost_1_59_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/databases/xtrabackup/boost_1_59_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/databases/percona57-client/boost_1_59_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/devel/boost-libs/boost_1_72_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \
/dports/devel/boost-docs/boost_1_72_0/libs/spirit/workbench/
H A Dmeasure.hpp122 #define BOOST_SPIRIT_TEST_BENCHMARK(max_repeats, FSeq) \ argument
125 while (measured < 2.0 && repeats <= max_repeats) \

12345