/dports/multimedia/kvazaar/kvazaar-2.1.0/src/ |
H A D | Makefile.am | 140 strategies/strategies-dct.c \ 141 strategies/strategies-dct.h \ 142 strategies/strategies-intra.c \ 143 strategies/strategies-intra.h \ 144 strategies/strategies-ipol.c \ 145 strategies/strategies-ipol.h \ 146 strategies/strategies-nal.c \ 147 strategies/strategies-nal.h \ 150 strategies/strategies-quant.c \ 152 strategies/strategies-sao.c \ [all …]
|
H A D | strategyselector.c | 61 strategies.strategies = NULL; in kvz_strategyselector_init() 226 free(strategies.strategies); in kvz_strategyselector_init() 236 if (strategies->allocated == strategies->count) { in kvz_strategyselector_register() 242 strategies->strategies = new_strategies; in kvz_strategyselector_register() 247 strategy_t *new_strategy = &strategies->strategies[strategies->count++]; in kvz_strategyselector_register() 294 return strategies->strategies[i].fptr; in strategyselector_choose_for() 296 if (strategies->strategies[i].priority >= max_priority) { in strategyselector_choose_for() 298 max_priority = strategies->strategies[i].priority; in strategyselector_choose_for() 313 …stderr, "- %s (%d, %p)\n", strategies->strategies[i].strategy_name, strategies->strategies[i].prio… in strategyselector_choose_for() 315 …stderr, "> %s (%d, %p)\n", strategies->strategies[i].strategy_name, strategies->strategies[i].prio… in strategyselector_choose_for() [all …]
|
/dports/archivers/py-zstandard/zstandard-0.16.0/tests/ |
H A D | test_decompressor_fuzzing.py | 7 import hypothesis.strategies as strategies namespace 27 streaming=strategies.booleans(), 29 read_sizes=strategies.data(), 67 streaming=strategies.booleans(), 113 read_sizes=strategies.data(), 224 read_sizes=strategies.data(), 266 read_sizes=strategies.data(), 310 read_sizes=strategies.data(), 341 originals=strategies.data(), 345 read_sizes=strategies.data(), [all …]
|
H A D | test_compressor_fuzzing.py | 7 import hypothesis.strategies as strategies namespace 25 read_size=strategies.integers( 59 read_size=strategies.integers( 96 read_sizes=strategies.data(), 129 read_sizes=strategies.data(), 160 read_size=strategies.integers( 230 read_sizes=strategies.data(), 265 read_sizes=strategies.data(), 665 flushes=strategies.data(), 747 original=strategies.lists( [all …]
|
/dports/devel/mercurial/mercurial-6.0/contrib/python-zstandard/tests/ |
H A D | test_decompressor_fuzzing.py | 7 import hypothesis.strategies as strategies namespace 33 streaming=strategies.booleans(), 35 read_sizes=strategies.data(), 73 streaming=strategies.booleans(), 119 read_sizes=strategies.data(), 230 read_sizes=strategies.data(), 272 read_sizes=strategies.data(), 316 read_sizes=strategies.data(), 347 originals=strategies.data(), 351 read_sizes=strategies.data(), [all …]
|
H A D | test_compressor_fuzzing.py | 7 import hypothesis.strategies as strategies namespace 31 read_size=strategies.integers( 65 read_size=strategies.integers( 102 read_sizes=strategies.data(), 135 read_sizes=strategies.data(), 166 read_size=strategies.integers( 236 read_sizes=strategies.data(), 271 read_sizes=strategies.data(), 674 flushes=strategies.data(), 753 original=strategies.lists( [all …]
|
/dports/net/dictd/dictd-1.13.1/ |
H A D | strategy.c | 48 static dictStrategy **strategies = NULL; variable 91 xfree (strategies); in dict_destroy_strategies() 93 strategies = NULL; in dict_destroy_strategies() 140 return strategies [idx] -> number; in lookup_strategy() 161 return strategies [idx]; in lookup_strat() 181 if (strategies [i] == strat){ in dict_disable_strategy() 185 strategies + i, in dict_disable_strategy() 186 strategies + i + 1, in dict_disable_strategy() 232 strategies = xrealloc ( in dict_add_strategy() 233 strategies, sizeof (*strategies) * (strategy_count + 1)); in dict_add_strategy() [all …]
|
/dports/textproc/dict/dictd-1.13.1/ |
H A D | strategy.c | 48 static dictStrategy **strategies = NULL; variable 91 xfree (strategies); in dict_destroy_strategies() 93 strategies = NULL; in dict_destroy_strategies() 140 return strategies [idx] -> number; in lookup_strategy() 161 return strategies [idx]; in lookup_strat() 181 if (strategies [i] == strat){ in dict_disable_strategy() 185 strategies + i, in dict_disable_strategy() 186 strategies + i + 1, in dict_disable_strategy() 232 strategies = xrealloc ( in dict_add_strategy() 233 strategies, sizeof (*strategies) * (strategy_count + 1)); in dict_add_strategy() [all …]
|
/dports/textproc/dictfmt/dictd-1.13.1/ |
H A D | strategy.c | 48 static dictStrategy **strategies = NULL; variable 91 xfree (strategies); in dict_destroy_strategies() 93 strategies = NULL; in dict_destroy_strategies() 140 return strategies [idx] -> number; in lookup_strategy() 161 return strategies [idx]; in lookup_strat() 181 if (strategies [i] == strat){ in dict_disable_strategy() 185 strategies + i, in dict_disable_strategy() 186 strategies + i + 1, in dict_disable_strategy() 232 strategies = xrealloc ( in dict_add_strategy() 233 strategies, sizeof (*strategies) * (strategy_count + 1)); in dict_add_strategy() [all …]
|
/dports/math/gambit/gambit-16.0.1/src/python/gambit/tests/ |
H A D | test_strategic.py | 46 assert len(self.game.players[0].strategies) == 2 47 assert len(self.game.players[1].strategies) == 2 49 self.game.players[0].strategies[0].label = "Cooperate" 50 self.game.players[0].strategies[1].label = "Defect" 53 self.game.players[1].strategies[0].label = "Cooperate" 54 self.game.players[1].strategies[1].label = "Defect" 60 assert len(self.game.players[0].strategies) == 2 61 assert len(self.game.players[1].strategies) == 2 63 self.game.players[0].strategies[0].label = "Cooperate" 69 self.game.players[1].strategies[0].label = "Cooperate" [all …]
|
H A D | test_strategies.py | 16 assert len(self.game.players[0].strategies) == 2 17 assert len(self.game.players[1].strategies) == 2 21 self.game.players[0].strategies[0].label = "Cooperate" 23 self.game.players[0].strategies[1].label = "Cooperate" 28 self.game.players[0].strategies[0].label = "Cooperate" 29 s1 = self.game.players[0].strategies["Cooperate"] 34 assert_raises(IndexError, self.game.players[0].strategies.__getitem__, 3) 38 assert_raises(IndexError, self.game.players[0].strategies.__getitem__, "None") 43 …assert_raises(IndexError, self.game.players[0].strategies.__getitem__, self.game_2.players[0].stra… 47 assert_raises(TypeError, self.game.players[0].strategies.__getitem__, 1.3)
|
/dports/devel/py-nbdime/nbdime-3.1.1/nbdime/tests/ |
H A D | test_merge_notebooks_inline.py | 27 strategies = Strategies({"/foo": "fail"}) 107 strategies = Strategies({}) 201 strategies = Strategies({}) 275 strategies = Strategies({}) 305 strategies = Strategies({}) 363 strategies = Strategies() 370 strategies = Strategies(transients=[ 385 strategies = Strategies() 392 strategies = Strategies(transients=[ 418 strategies = Strategies() [all …]
|
/dports/devel/py-jsonschema/jsonschema-4.2.1/jsonschema/tests/ |
H A D | fuzz_validate.py | 9 from hypothesis import given, strategies 13 PRIM = strategies.one_of( 14 strategies.booleans(), 15 strategies.integers(), 16 strategies.floats(allow_nan=False, allow_infinity=False), 17 strategies.text(), 19 DICT = strategies.recursive( 20 base=strategies.one_of( 21 strategies.booleans(), 22 strategies.dictionaries(strategies.text(), PRIM), [all …]
|
/dports/misc/py-xgboost/xgboost-1.5.1/tests/python/ |
H A D | test_linear.py | 2 from hypothesis import strategies, given, settings, note 5 parameter_strategy = strategies.fixed_dictionaries({ 6 'booster': strategies.just('gblinear'), 7 'eta': strategies.floats(0.01, 0.25), 8 'tolerance': strategies.floats(1e-5, 1e-2), 9 'nthread': strategies.integers(1, 4), 12 coord_strategy = strategies.fixed_dictionaries({ 15 'top_k': strategies.integers(1, 10), 27 @given(parameter_strategy, strategies.integers(10, 50), 42 strategies.floats(1e-5, 2.0)) [all …]
|
H A D | test_updaters.py | 5 from hypothesis import given, strategies, settings, note 8 'nthread': strategies.integers(1, 4), 9 'max_depth': strategies.integers(1, 11), 11 'alpha': strategies.floats(0.0, 2.0), 12 'lambda': strategies.floats(1e-5, 2.0), 13 'eta': strategies.floats(0.01, 0.5), 14 'gamma': strategies.floats(0.0, 2.0), 15 'seed': strategies.integers(0, 10), 23 'max_depth': strategies.integers(1, 11), 24 'max_leaves': strategies.integers(0, 1024), [all …]
|
/dports/misc/xgboost/xgboost-1.5.1/tests/python/ |
H A D | test_linear.py | 2 from hypothesis import strategies, given, settings, note 5 parameter_strategy = strategies.fixed_dictionaries({ 6 'booster': strategies.just('gblinear'), 7 'eta': strategies.floats(0.01, 0.25), 8 'tolerance': strategies.floats(1e-5, 1e-2), 9 'nthread': strategies.integers(1, 4), 12 coord_strategy = strategies.fixed_dictionaries({ 15 'top_k': strategies.integers(1, 10), 27 @given(parameter_strategy, strategies.integers(10, 50), 42 strategies.floats(1e-5, 2.0)) [all …]
|
H A D | test_updaters.py | 5 from hypothesis import given, strategies, settings, note 8 'nthread': strategies.integers(1, 4), 9 'max_depth': strategies.integers(1, 11), 11 'alpha': strategies.floats(0.0, 2.0), 12 'lambda': strategies.floats(1e-5, 2.0), 13 'eta': strategies.floats(0.01, 0.5), 14 'gamma': strategies.floats(0.0, 2.0), 15 'seed': strategies.integers(0, 10), 23 'max_depth': strategies.integers(1, 11), 24 'max_leaves': strategies.integers(0, 1024), [all …]
|
/dports/sysutils/vector/vector-0.10.0/website/docs/setup/ |
H A D | deployment.md | 13 [daemon][docs.strategies#daemon], [sidecar][docs.strategies#sidecar], or 14 [service][docs.strategies#service]. You combine these strategies to form 17 Start by becoming familiar with the [deployment strategies][docs.strategies] 22 <Jump to="/docs/setup/deployment/strategies/">Strategies</Jump> 25 [docs.strategies#daemon]: /docs/setup/deployment/strategies/#daemon 26 [docs.strategies#service]: /docs/setup/deployment/strategies/#service 27 [docs.strategies#sidecar]: /docs/setup/deployment/strategies/#sidecar 28 [docs.strategies]: /docs/setup/deployment/strategies/
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ecm/ |
H A D | facul.cpp | 796 strategies->mfb[0] = rmfb; in facul_make_strategies() 805 strategies->BBB[0] = (double) rfbb * strategies->assume_prime_thresh[0]; in facul_make_strategies() 806 strategies->BBB[1] = (double) afbb * strategies->assume_prime_thresh[1]; in facul_make_strategies() 912 strategies->methods[r][a]; in facul_make_strategies() 930 return strategies; in facul_make_strategies() 937 if (strategies == NULL) in facul_clear_strategies() 979 free (strategies); in facul_clear_strategies() 992 strategies->lpb[0], strategies->lpb[1], in facul_fprint_strategies() 995 strategies->BBB[0], strategies->BBB[1]); in facul_fprint_strategies() 997 "mfb = [%d, %d]\n", strategies->mfb[0], strategies->mfb[1]); in facul_fprint_strategies() [all …]
|
/dports/devel/R-cran-BH/BH/inst/include/boost/geometry/algorithms/detail/distance/ |
H A D | point_to_geometry.hpp | 74 boost::ignore_unused(strategies); in apply() 75 return strategies.distance(p1, p2).apply(p1, p2); in apply() 101 Strategies const& strategies) in apply() 107 boost::ignore_unused(strategies); in apply() 138 Strategies const& strategies) in apply() 140 boost::ignore_unused(strategies); in apply() 236 >::apply(point, ring, strategies); in apply() 287 strategies); in apply() 298 strategies)) in apply() 368 >::apply(point, *it_min, strategies); in apply() [all …]
|
H A D | segment_to_box.hpp | 447 strategies); in apply() 458 strategies); in apply() 496 strategies); in apply() 575 strategies, result)) in non_negative_slope_segment() 585 strategies, result)) in non_negative_slope_segment() 626 strategies, result)) in negative_slope_segment() 636 strategies, result)) in negative_slope_segment() 745 >::apply(p[0], box, strategies); in apply() 767 strategies); in apply() 779 strategies); in apply() [all …]
|
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/doc/codewalk/ |
H A D | pig.go | 58 strategies := []strategy{strategy0, strategy1} 63 action := strategies[currentPlayer](s) 74 wins := make([]int, len(strategies)) 75 for i := 0; i < len(strategies); i++ { 76 for j := i + 1; j < len(strategies); j++ { 78 winner := play(strategies[i], strategies[j]) 111 strategies := make([]strategy, win) 112 for k := range strategies { 113 strategies[k] = stayAtK(k + 1) 115 wins, games := roundRobin(strategies) [all …]
|
/dports/editors/calligra/calligra-3.2.1/libs/flake/ |
H A D | KoSnapGuide.cpp | 47 qDeleteAll(strategies); in ~Private() 48 strategies.clear(); in ~Private() 54 QList<KoSnapStrategy*> strategies; member in KoSnapGuide::Private 67 d->strategies.append(new GridSnapStrategy()); in KoSnapGuide() 68 d->strategies.append(new NodeSnapStrategy()); in KoSnapGuide() 70 d->strategies.append(new ExtensionSnapStrategy()); in KoSnapGuide() 93 d->usedStrategies = strategies; in enableSnapStrategies() 106 d->strategies.append(customStrategy); in addCustomSnapStrategy() 229 int strategyCount = d->strategies.count(); in reset() 232 delete d->strategies[i]; in reset() [all …]
|
/dports/misc/py-xgboost/xgboost-1.5.1/tests/python-gpu/ |
H A D | test_gpu_updaters.py | 11 parameter_strategy = strategies.fixed_dictionaries({ 12 'max_depth': strategies.integers(0, 11), 13 'max_leaves': strategies.integers(0, 256), 14 'max_bin': strategies.integers(2, 1024), 16 'single_precision_histogram': strategies.booleans(), 17 'min_child_weight': strategies.floats(0.5, 2.0), 18 'seed': strategies.integers(0, 10), 21 'colsample_bytree': strategies.floats(0.5, 1.0), 22 'colsample_bylevel': strategies.floats(0.5, 1.0), 83 @given(strategies.integers(10, 400), strategies.integers(3, 8), [all …]
|
/dports/misc/xgboost/xgboost-1.5.1/tests/python-gpu/ |
H A D | test_gpu_updaters.py | 11 parameter_strategy = strategies.fixed_dictionaries({ 12 'max_depth': strategies.integers(0, 11), 13 'max_leaves': strategies.integers(0, 256), 14 'max_bin': strategies.integers(2, 1024), 16 'single_precision_histogram': strategies.booleans(), 17 'min_child_weight': strategies.floats(0.5, 2.0), 18 'seed': strategies.integers(0, 10), 21 'colsample_bytree': strategies.floats(0.5, 1.0), 22 'colsample_bylevel': strategies.floats(0.5, 1.0), 83 @given(strategies.integers(10, 400), strategies.integers(3, 8), [all …]
|