Home
last modified time | relevance | path

Searched refs:costs (Results 1 – 6 of 6) sorted by relevance

/rocksdb-6.9/docs/_posts/
D2017-09-28-rocksdb-5-8-released.markdown14 …s to update the iterator state so that they can avoid some initialization costs of recreating iter…
D2015-07-15-rocksdb-2015-h2-roadmap.markdown21 1. Reduce CPU costs of RocksDB as a MySQL storage engine
D2014-06-23-plaintable-a-new-file-format.markdown24 …f multiple sockets with NUMA, we can only allow 4-5 CPU cache misses (including costs of data TLB).
D2014-05-14-lock.markdown10 … introduce the recent improvements we did to RocksDB to improve the issue of lock contention costs.
/rocksdb-6.9/third-party/gtest-1.8.1/fused-src/gtest/
Dgtest-all.cc2530 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
2536 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
2537 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
2542 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
2550 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
2555 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
2556 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
2557 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
2559 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
2562 costs[l_i + 1][r_i + 1] = remove + 1; in CalculateOptimalEdits()
[all …]
/rocksdb-6.9/
DHISTORY.md586 …s to update the iterator state so that they can avoid some initialization costs of recreating iter…
739 …local storage, which improves CPU performance by reducing cache coherency costs. Callers of Create…