HomeSort by: relevance | last modified time | path
    Searched refs:splits (Results 1 - 13 of 13) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/tui/
tui-layout.c 1232 std::vector<std::unique_ptr<tui_layout_split>> splits;
1233 splits.emplace_back (new tui_layout_split (is_vertical));
1247 splits.emplace_back (new tui_layout_split (is_vertical));
1257 if (splits.size () == 1)
1277 = std::move (splits.back ());
1278 splits.pop_back ();
1279 splits.back ()->add_split (std::move (last_split), weight);
1283 splits.back ()->add_window (name.c_str (), weight);
1287 if (splits.size () > 1)
1296 std::unique_ptr<tui_layout_split> new_layout = std::move (splits.back ())
1230 std::vector<std::unique_ptr<tui_layout_split>> splits; local
    [all...]
  /src/external/gpl3/gdb/dist/gdb/tui/
tui-layout.c 1224 std::vector<std::unique_ptr<tui_layout_split>> splits;
1225 splits.emplace_back (new tui_layout_split (is_vertical));
1239 splits.emplace_back (new tui_layout_split (is_vertical));
1249 if (splits.size () == 1)
1269 = std::move (splits.back ());
1270 splits.pop_back ();
1271 splits.back ()->add_split (std::move (last_split), weight);
1275 splits.back ()->add_window (name.c_str (), weight);
1279 if (splits.size () > 1)
1288 std::unique_ptr<tui_layout_split> new_layout = std::move (splits.back ())
1222 std::vector<std::unique_ptr<tui_layout_split>> splits; local
    [all...]
  /src/external/bsd/zstd/dist/lib/compress/
zstd_ldm.c 62 * splits. This effectively resets the hash state. This is used when skipping
89 * Registers in the splits array all the split points found in the first
91 * either all the data has been processed or LDM_BATCH_SIZE splits are
92 * present in the splits array.
94 * Precondition: The splits array must not be full.
98 size_t* splits, unsigned* numSplits)
111 splits[*numSplits] = n; \
295 size_t* const splits = ldmState->splitIndices; local
306 hashed = ZSTD_ldm_gear_feed(&hashState, ip, (size_t)(iend - ip), splits, &numSplits);
309 if (ip + splits[n] >= istart + minMatchLength)
369 size_t* const splits = ldmState->splitIndices; local
    [all...]
zstd_compress.c 4182 /* Helper function to perform the recursive search for block splits.
4192 * Furthermore, the number of splits is capped by ZSTD_MAX_NB_BLOCK_SPLITS.
4197 ZSTD_deriveBlockSplitsHelper(seqStoreSplits* splits, size_t startIdx, size_t endIdx,
4210 if (endIdx - startIdx < MIN_SEQUENCES_BLOCK_SPLITTING || splits->idx >= ZSTD_MAX_NB_BLOCK_SPLITS) {
4227 ZSTD_deriveBlockSplitsHelper(splits, startIdx, midIdx, zc, origSeqStore);
4228 splits->splitLocations[splits->idx] = (U32)midIdx;
4229 splits->idx++;
4230 ZSTD_deriveBlockSplitsHelper(splits, midIdx, endIdx, zc, origSeqStore);
4237 * @return: number of splits made (which equals the size of the partition table - 1)
4241 seqStoreSplits splits; local
    [all...]
  /src/usr.bin/make/unit-tests/
directive-for-empty.mk 33 # splits the iteration items into words, and such a word cannot be empty.
directive-for-escape.mk 79 # The .for loop splits ${VALUES} into 3 words, at the space characters, since
varmod-to-separator.mk 107 # Adding the modifier ':M*' at the end of the above chain splits the
directive-for.mk 37 # The .for loop splits the items at whitespace, taking quotes into account,
  /src/external/lgpl3/gmp/dist/mpn/x86_64/bt1/
mul_basecase.asm 48 C the same way for all n, then it splits into 4 different wind-down blocks and
sqr_basecase.asm 48 C the same way for all n, then it splits into 4 different wind-down blocks and
  /src/external/historical/nawk/dist/
FIXES.1e 500 change to FS is now noticed immediately for subsequent splits.
1019 enhanced split(), as in gawk, etc: split(s, a, "") splits s into
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
array.d 1899 Eagerly splits `range` into an array, using `sep` as the delimiter.
1913 isTerminator = a predicate that splits the range when it returns `true`.
1921 $(REF splitter, std,regex) for a version that splits using a regular
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
iteration.d 51 Lazily splits a range by comparing adjacent elements.)
53 Lazily splits a range by a separator.)
2798 Splits a forward range into subranges in places determined by a binary
5227 Lazily splits a range using an element or range as a separator.
5272 $(REF _splitter, std,regex) for a version that splits using a regular expression defined separator,
5273 $(REF _split, std,array) for a version that splits eagerly and
6313 Lazily splits the character-based range `s` into words, using whitespace as the

Completed in 67 milliseconds