aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/containers/comptrie/minimize.cpp
diff options
context:
space:
mode:
authorsereglond <sereglond@yandex-team.ru>2022-02-10 16:47:46 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:47:46 +0300
commiteb3d925534734c808602b31b38b953677f0a279f (patch)
tree4222ef8dc375ee9f30b68a004ee42a0845e005b6 /library/cpp/containers/comptrie/minimize.cpp
parent4c8065245df3ea26b7757bcb1f8218df287f9148 (diff)
downloadydb-eb3d925534734c808602b31b38b953677f0a279f.tar.gz
Restoring authorship annotation for <sereglond@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'library/cpp/containers/comptrie/minimize.cpp')
-rw-r--r--library/cpp/containers/comptrie/minimize.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/library/cpp/containers/comptrie/minimize.cpp b/library/cpp/containers/comptrie/minimize.cpp
index 80d0b25217..39299d69dd 100644
--- a/library/cpp/containers/comptrie/minimize.cpp
+++ b/library/cpp/containers/comptrie/minimize.cpp
@@ -6,8 +6,8 @@
#include <util/generic/hash.h>
#include <util/generic/algorithm.h>
-
-namespace NCompactTrie {
+
+namespace NCompactTrie {
// Minimize the trie. The result is equivalent to the original
// trie, except that it takes less space (and has marginally lower
// performance, because of eventual epsilon links).
@@ -169,7 +169,7 @@ namespace NCompactTrie {
bool IsFinal() const {
return Node.IsFinal();
}
-
+
// NextNode returns child nodes, starting from the last node: Right, then Left, then Forward
size_t NextNode(const TOffsetMap& mergedNodes) {
while (Selector < 3) {