Searched refs:strategy (Results 1 - 25 of 29) sorted by relevance

12

/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DTwoKeyAVLTree.h160 // internal use (not part of the strategy)
376 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); local
381 strategy.GetValue(node)));
385 fGetPrimaryKey(strategy.GetValue(
386 strategy.GetNode(node->left)))) == 0) {
387 node = strategy.GetNode(node->left);
391 return &strategy.GetValue(node);
395 node = strategy.GetNode(node->left);
397 node = strategy.GetNode(node->right);
408 const NodeStrategy& strategy local
463 NodeStrategy& strategy local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/
H A DTwoKeyAVLTree.h181 // internal use (not part of the strategy)
440 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); local
449 return &strategy.GetValue(node);
458 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); local
470 fGetPrimaryKey(strategy.GetValue(strategy.GetNode(node))));
485 return &strategy.GetValue(node);
494 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); local
499 strategy.GetValue(node)));
503 fGetPrimaryKey(strategy
556 NodeStrategy& strategy local
573 NodeStrategy& strategy local
602 const NodeStrategy& strategy = fTreeMap.GetNodeStrategy(); local
[all...]
H A DIndexImpl.h218 typename Policy::NodeTree::NodeStrategy strategy; local
219 return strategy.GetValue(treeNode);
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Drun-weavetest82 for strategy in $strategies ; do
99 echo "$jet $sep $pass $rows $f $g $arrangement $strategy"
H A Descp2-weavetest.c126 int color_jet_arrangement, int strategy, int quiet)
196 phys_lines, head_offset, strategy, flush_pass,
375 int strategy; local
390 &phys_lines, &color_jet_arrangement, &strategy);
396 color_jet_arrangement, strategy, 2);
402 if (previous_strategy != strategy)
404 printf("%s%d:", previous_strategy == -1 ? "" : "\n", strategy);
421 previous_strategy = strategy;
429 phys_lines, color_jet_arrangement, strategy);
450 fprintf(stderr, "Usage: %s jets separation hpasses vpasses subpasses rows start end arrangement strategy\
124 run_one_weavetest(int physjets, int physsep, int hpasses, int vpasses, int subpasses, int nrows, int first_line, int phys_lines, int color_jet_arrangement, int strategy, int quiet) argument
466 int strategy = atoi(argv[10]); local
[all...]
/haiku-fatelf/src/tests/system/kernel/util/
H A DVectorTest.cpp596 GenericPushPopFrontTest(ValueStrategy strategy, int32 maxNumber) argument
601 v.PushFront(strategy.Generate());
605 v.PushFront(strategy.Generate());
625 GenericPushPopBackTest(ValueStrategy strategy, int32 maxNumber) argument
630 v.PushBack(strategy.Generate());
634 v.PushBack(strategy.Generate());
654 GenericInsertTest1(ValueStrategy strategy, int32 maxNumber) argument
660 v.Insert(strategy.Generate(), index);
668 GenericInsertTest2(ValueStrategy strategy, int32 maxNumber) argument
674 v.Insert(strategy
704 GenericFill(TestVector<Value> &v, ValueStrategy strategy, int32 maxNumber) argument
719 GenericRemoveTest(ValueStrategy strategy, int32 maxNumber) argument
758 GenericEraseTest1(ValueStrategy strategy, int32 maxNumber) argument
773 GenericEraseTest2(ValueStrategy strategy, int32 maxNumber) argument
810 GenericMakeEmptyTest(ValueStrategy strategy, int32 maxNumber) argument
838 GenericIndexAccessTest(ValueStrategy strategy, int32 maxNumber) argument
868 GenericFindTest(ValueStrategy strategy, int32 maxNumber) argument
923 GenericIteratorTest(ValueStrategy strategy, int32 maxNumber) argument
[all...]
H A DVectorSetTest.cpp523 ValueStrategy strategy;
526 v.Insert(strategy.Generate());
555 GenericFill(TestClass &v, ValueStrategy strategy, int32 maxNumber)
559 v.Insert(strategy.Generate());
573 ValueStrategy strategy;
575 GenericFill(v, strategy, maxNumber);
615 ValueStrategy strategy;
617 GenericFill(v, strategy, maxNumber);
655 ValueStrategy strategy;
658 GenericFill(v, strategy, maxNumbe
[all...]
H A DOrderedMapTest.h148 // Non-template wrapper for the Ascending compare strategy.
156 // Non-template wrapper for the Descending compare strategy.
799 GenericFill(TestClass &v, EntryStrategy strategy, int32 maxNumber) argument
807 strategy.Generate(key, value);
/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Dzlib.h157 /* compression strategy; see deflateInit2() below for details */
409 int strategy));
430 The strategy parameter is used to tune the compression algorithm. Use the
437 between Z_DEFAULT and Z_HUFFMAN_ONLY. The strategy parameter only affects
492 compression state which can be quite large, so this strategy is slow and
514 int strategy));
516 Dynamically update the compression level and compression strategy. The
517 interpretation of level and strategy is as in deflateInit2. This can be
520 strategy. If the compression level is changed, the input available so far
666 ("wb9") or a strategy
[all...]
H A Ddeflate.c210 int strategy,
247 strategy < 0 || strategy > Z_HUFFMAN_ONLY) {
290 s->strategy = strategy;
371 int strategy)
383 if (level < 0 || level > 9 || strategy < 0 || strategy > Z_HUFFMAN_ONLY) {
399 s->strategy = strategy;
204 deflateInit2_( z_streamp strm, int level, int method, int windowBits, int memLevel, int strategy, const char *version, int stream_size) argument
368 deflateParams( z_streamp strm, int level, int strategy) argument
[all...]
H A Ddeflate.h173 int strategy; /* favor or force Huffman coding*/ member in struct:internal_state
/haiku-fatelf/src/libs/zlib/
H A Dgzwrite.c38 15 + 16, 8, state->strategy);
458 int ZEXPORT gzsetparams(file, level, strategy)
461 int strategy;
477 if (level == state->level && strategy == state->strategy)
492 deflateParams(strm, level, strategy);
495 state->strategy = strategy;
H A Dgzguts.h106 int strategy; /* compression strategy */ member in struct:__anon5225
H A Ddeflate.c210 int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
217 int strategy;
261 strategy < 0 || strategy > Z_FIXED) {
304 s->strategy = strategy;
412 int ZEXPORT deflateParams(strm, level, strategy)
415 int strategy;
429 if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXE
[all...]
H A Dgzlib.c105 state->strategy = Z_DEFAULT_STRATEGY;
128 state->strategy = Z_FILTERED;
131 state->strategy = Z_HUFFMAN_ONLY;
134 state->strategy = Z_RLE;
137 state->strategy = Z_FIXED;
H A Dzlib.h197 /* compression strategy; see deflateInit2() below for details */
523 int strategy));
555 The strategy parameter is used to tune the compression algorithm. Use the
565 strategy parameter only affects the compression ratio but not the
626 compression state which can be quite large, so this strategy is slow and can
648 int strategy));
650 Dynamically update the compression level and compression strategy. The
651 interpretation of level and strategy is as in deflateInit2. This can be
653 to switch to a different kind of input data requiring a different strategy.
1172 a strategy
[all...]
H A Ddeflate.h183 int strategy; /* favor or force Huffman coding*/ member in struct:internal_state
H A Dtrees.c990 } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {
/haiku-fatelf/headers/libs/zlib/
H A Dzlib.h197 /* compression strategy; see deflateInit2() below for details */
523 int strategy));
555 The strategy parameter is used to tune the compression algorithm. Use the
565 strategy parameter only affects the compression ratio but not the
626 compression state which can be quite large, so this strategy is slow and can
648 int strategy));
650 Dynamically update the compression level and compression strategy. The
651 interpretation of level and strategy is as in deflateInit2. This can be
653 to switch to a different kind of input data requiring a different strategy.
1172 a strategy
[all...]
/haiku-fatelf/headers/private/kernel/util/
H A DAVLTreeMap.h19 //! Automatic node strategy (works like STL containers do)
58 AVLTreeMap(const NodeStrategy& strategy
98 // strategy shortcuts
251 _AVL_TREE_MAP_CLASS_NAME::AVLTreeMap(const NodeStrategy& strategy) argument
253 fStrategy(strategy)
554 // #pragma mark - strategy parameters
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dprint-weave.c115 stp_weave_strategy_t strategy; member in struct:raw
129 * In theory, strategy 0 should be optimal; in practice, it can lead
131 * neighbouring rows in neighbouring passes, strategy 4 should be optimal,
151 w->strategy = strat;
168 switch (w->strategy) {
238 switch (w->strategy) {
592 stp_weave_strategy_t strategy, /* I - weave pattern variant to use */
597 initialize_raw_weave(&w->rw, separation, jets, oversample, strategy, v);
1858 stp_weave_strategy_t strategy =ac>7 ? atoi(av[7]) : 1; local
1869 "pageheight=%d strategy
584 initialize_weave_params(int separation, int jets, int oversample, int firstrow, int lastrow, int pageheight, stp_weave_strategy_t strategy, stp_vars_t *v) argument
[all...]
/haiku-fatelf/data/etc/bash_completion.d/
H A Dgit657 # 'git merge -s help' (and thus detection of the merge strategy
819 -s|--strategy)
824 --strategy=*)
825 __gitcomp "$__git_merge_strategies" "" "${cur##--strategy=}"
1654 --no-commit --no-stat --log --no-log --squash --strategy
1824 --onto --merge --strategy --interactive
2609 --merge --strategy= --verbose --dry-run
2630 --merge --verbose --strategy= --local
/haiku-fatelf/headers/libs/png/
H A Dpng.h1156 strategy */
1931 PNGARG((png_structp png_ptr, int strategy));
/haiku-fatelf/src/libs/pdflib/libs/png/
H A Dpng.h1055 int zlib_strategy; /* holds zlib compression strategy */
1722 PNGARG((png_structp png_ptr, int strategy));
/haiku-fatelf/src/bin/sharutils/doc/
H A Dtexinfo.tex500 % document, then we can reconsider our strategy.

Completed in 231 milliseconds

12