aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/containers/comptrie/comptrie_impl.cpp
diff options
context:
space:
mode:
authorAnton Samokhvalov <pg83@yandex.ru>2022-02-10 16:45:17 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:45:17 +0300
commitd3a398281c6fd1d3672036cb2d63f842d2cb28c5 (patch)
treedd4bd3ca0f36b817e96812825ffaf10d645803f2 /library/cpp/containers/comptrie/comptrie_impl.cpp
parent72cb13b4aff9bc9cf22e49251bc8fd143f82538f (diff)
downloadydb-d3a398281c6fd1d3672036cb2d63f842d2cb28c5.tar.gz
Restoring authorship annotation for Anton Samokhvalov <pg83@yandex.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp/containers/comptrie/comptrie_impl.cpp')
-rw-r--r--library/cpp/containers/comptrie/comptrie_impl.cpp52
1 files changed, 26 insertions, 26 deletions
diff --git a/library/cpp/containers/comptrie/comptrie_impl.cpp b/library/cpp/containers/comptrie/comptrie_impl.cpp
index a293b45d1c..a116ab6d1e 100644
--- a/library/cpp/containers/comptrie/comptrie_impl.cpp
+++ b/library/cpp/containers/comptrie/comptrie_impl.cpp
@@ -6,34 +6,34 @@
// Unpack the leaf value. The algorithm can store up to 8 full bytes in leafs.
namespace NCompactTrie {
- size_t MeasureOffset(size_t offset) {
- int n = 0;
-
- while (offset) {
- offset >>= 8;
- ++n;
- }
-
- return n;
+ size_t MeasureOffset(size_t offset) {
+ int n = 0;
+
+ while (offset) {
+ offset >>= 8;
+ ++n;
+ }
+
+ return n;
}
-
- size_t PackOffset(char* buffer, size_t offset) {
- size_t len = MeasureOffset(offset);
- size_t i = len;
-
- while (i--) {
- buffer[i] = (char)(offset & 0xFF);
- offset >>= 8;
- }
-
- return len;
+
+ size_t PackOffset(char* buffer, size_t offset) {
+ size_t len = MeasureOffset(offset);
+ size_t i = len;
+
+ while (i--) {
+ buffer[i] = (char)(offset & 0xFF);
+ offset >>= 8;
+ }
+
+ return len;
}
-
- void ShowProgress(size_t n) {
- if (n % 1000000 == 0)
+
+ void ShowProgress(size_t n) {
+ if (n % 1000000 == 0)
Cerr << n << ", RSS=" << (TRusage::Get().MaxRss >> 20) << "mb" << Endl;
- else if (n % 20000 == 0)
- Cerr << ".";
- }
+ else if (n % 20000 == 0)
+ Cerr << ".";
+ }
}