summaryrefslogtreecommitdiffstats
path: root/library/cpp/containers/comptrie/minimize.cpp
diff options
context:
space:
mode:
authoronpopov <[email protected]>2022-02-10 16:50:38 +0300
committerDaniil Cherednik <[email protected]>2022-02-10 16:50:38 +0300
commit84a29dd4980d5b39615e453f289bd1a81213296d (patch)
tree5e320f10d6b5863e0d5ab1a8caa9eefbdaa5195f /library/cpp/containers/comptrie/minimize.cpp
parent1717072c6635948128dad7b015a0ec05acbe913b (diff)
Restoring authorship annotation for <[email protected]>. Commit 1 of 2.
Diffstat (limited to 'library/cpp/containers/comptrie/minimize.cpp')
-rw-r--r--library/cpp/containers/comptrie/minimize.cpp24
1 files changed, 12 insertions, 12 deletions
diff --git a/library/cpp/containers/comptrie/minimize.cpp b/library/cpp/containers/comptrie/minimize.cpp
index 80d0b25217d..85260619bc8 100644
--- a/library/cpp/containers/comptrie/minimize.cpp
+++ b/library/cpp/containers/comptrie/minimize.cpp
@@ -1,11 +1,11 @@
-#include "minimize.h"
-#include "node.h"
-#include "writeable_node.h"
-#include "write_trie_backwards.h"
-#include "comptrie_impl.h"
+#include "minimize.h"
+#include "node.h"
+#include "writeable_node.h"
+#include "write_trie_backwards.h"
+#include "comptrie_impl.h"
#include <util/generic/hash.h>
-#include <util/generic/algorithm.h>
+#include <util/generic/algorithm.h>
namespace NCompactTrie {
// Minimize the trie. The result is equivalent to the original
@@ -27,7 +27,7 @@ namespace NCompactTrie {
using TSizePair = std::pair<size_t, size_t>;
using TSizePairVector = TVector<TSizePair>;
using TSizePairVectorVector = TVector<TSizePairVector>;
-
+
class TOffsetMap {
protected:
TSizePairVectorVector Data;
@@ -180,7 +180,7 @@ namespace NCompactTrie {
if (Node.GetRightOffset())
nextOffset = Node.GetRightOffset();
break;
-
+
case 2:
if (Node.GetLeftOffset())
nextOffset = Node.GetLeftOffset();
@@ -280,7 +280,7 @@ namespace NCompactTrie {
static void AddPiece(TPieceIndex& index, size_t offset, size_t len) {
index[len].push_back(offset);
}
-
+
static TOffsetMap FindEquivalentSubtries(const TOpaqueTrie& trie, bool verbose, size_t minMergeSize) {
// Tree nodes, arranged by span length.
// When all nodes of a given size are considered, they pop off the queue.
@@ -354,6 +354,6 @@ namespace NCompactTrie {
return WriteTrieBackwards(os, enumerator, verbose);
else
return WriteTrieBackwardsNoAlloc(os, enumerator, trie, mode);
- }
-
-}
+ }
+
+}