diff options
author | Maxim Pimenov <m@maps.me> | 2018-09-14 21:08:09 +0300 |
---|---|---|
committer | Vlad Mihaylenko <vxmihaylenko@gmail.com> | 2018-09-18 14:46:56 +0300 |
commit | 412387c84eefba2ec4c267ee2748bf78f03ce327 (patch) | |
tree | 8d79b6b480fb91a5458a21aec10ac689de54db9f /openlr/openlr_decoder.cpp | |
parent | bef147b46fb8fd5160fc8e3b13f3548906ae5ef7 (diff) |
[base] Replaced the namespace my with base.
Diffstat (limited to 'openlr/openlr_decoder.cpp')
-rw-r--r-- | openlr/openlr_decoder.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/openlr/openlr_decoder.cpp b/openlr/openlr_decoder.cpp index 455b0ba829..c294ce94cb 100644 --- a/openlr/openlr_decoder.cpp +++ b/openlr/openlr_decoder.cpp @@ -345,10 +345,10 @@ size_t constexpr GetOptimalBatchSize() { // This code computes the most optimal (in the sense of cache lines // occupancy) batch size. - size_t constexpr a = my::LCM(sizeof(LinearSegment), kCacheLineSize) / sizeof(LinearSegment); + size_t constexpr a = base::LCM(sizeof(LinearSegment), kCacheLineSize) / sizeof(LinearSegment); size_t constexpr b = - my::LCM(sizeof(IRoadGraph::TEdgeVector), kCacheLineSize) / sizeof(IRoadGraph::TEdgeVector); - return my::LCM(a, b); + base::LCM(sizeof(IRoadGraph::TEdgeVector), kCacheLineSize) / sizeof(IRoadGraph::TEdgeVector); + return base::LCM(a, b); } } // namespace @@ -408,7 +408,7 @@ void OpenLRDecoder::Decode(vector<LinearSegment> const & segments, size_t const numSegments = segments.size(); Decoder decoder(dataSource, make_unique<CarModelFactory>(m_countryParentNameGetter)); - my::Timer timer; + base::Timer timer; for (size_t i = threadNum * kBatchSize; i < numSegments; i += numThreads * kBatchSize) { for (size_t j = i; j < numSegments && j < i + kBatchSize; ++j) |