aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/codecs/solar_codec.cpp
diff options
context:
space:
mode:
authordanlark <danlark@yandex-team.ru>2022-02-10 16:46:10 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:46:10 +0300
commitbaa58daefa91fde4b4769facdbd2903763b9c6a8 (patch)
tree1a2c5ffcf89eb53ecd79dbc9bc0a195c27404d0c /library/cpp/codecs/solar_codec.cpp
parent3426a9bc7f169ae9da54cef557ad2a33f6e8eee0 (diff)
downloadydb-baa58daefa91fde4b4769facdbd2903763b9c6a8.tar.gz
Restoring authorship annotation for <danlark@yandex-team.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp/codecs/solar_codec.cpp')
-rw-r--r--library/cpp/codecs/solar_codec.cpp8
1 files changed, 4 insertions, 4 deletions
diff --git a/library/cpp/codecs/solar_codec.cpp b/library/cpp/codecs/solar_codec.cpp
index d524eacd45..d0692fe2a4 100644
--- a/library/cpp/codecs/solar_codec.cpp
+++ b/library/cpp/codecs/solar_codec.cpp
@@ -10,7 +10,7 @@
namespace NCodecs {
static inline ui32 Append(TBuffer& pool, TStringBuf data) {
- pool.Append(data.data(), data.size());
+ pool.Append(data.data(), data.size());
return pool.Size();
}
@@ -74,7 +74,7 @@ namespace NCodecs {
for (ui32 i = 1, sz = Decoder.size(); i < sz; ++i) {
TStringBuf s = DoDecode(i);
tmp2.push_back(std::make_pair(s, i - 1));
- Y_ENSURE(s.size() == (Decoder[i] - Decoder[i - 1]), "learning invariant failed");
+ Y_ENSURE(s.size() == (Decoder[i] - Decoder[i - 1]), "learning invariant failed");
}
Sort(tmp2.begin(), tmp2.end());
@@ -82,7 +82,7 @@ namespace NCodecs {
{
TEncoder::TBuilder builder(CTBF_PREFIX_GROUPED);
for (const auto& it : tmp2) {
- builder.Add(it.first.data(), it.first.size(), it.second);
+ builder.Add(it.first.data(), it.first.size(), it.second);
}
builder.Save(bout);
@@ -112,7 +112,7 @@ namespace NCodecs {
for (TEncoder::TConstIterator it = Encoder.Begin(); it != Encoder.End(); ++it) {
const TString& s = it.GetKey();
tmp.push_back(std::make_pair(it.GetValue(), !s ? TString("\0", 1) : s));
- poolsz += Max<ui32>(s.size(), 1);
+ poolsz += Max<ui32>(s.size(), 1);
}
Sort(tmp.begin(), tmp.end());