aboutsummaryrefslogtreecommitdiffstats
path: root/tools/archiver
diff options
context:
space:
mode:
authorgetsiu <getsiu@yandex-team.ru>2022-02-10 16:47:17 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:47:17 +0300
commitb7af6816e7f07e6271ae48e4ec76dabf1cfdbd11 (patch)
tree3f5d760d66bfcebfd0cb54e4fb79dbcbb5e7205f /tools/archiver
parentc753751b693cf7c481c0292912e2b7536fa6d36a (diff)
downloadydb-b7af6816e7f07e6271ae48e4ec76dabf1cfdbd11.tar.gz
Restoring authorship annotation for <getsiu@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'tools/archiver')
-rw-r--r--tools/archiver/main.cpp22
1 files changed, 11 insertions, 11 deletions
diff --git a/tools/archiver/main.cpp b/tools/archiver/main.cpp
index 6cda54c1ea..ab47c0b83a 100644
--- a/tools/archiver/main.cpp
+++ b/tools/archiver/main.cpp
@@ -590,10 +590,10 @@ int main(int argc, char** argv) {
.StoreResult(&cppBase);
TString forceKeys;
- opts.AddLongOption('k', "keys", "Set explicit list of keys for elements")
- .RequiredArgument("<keys>")
- .StoreResult(&forceKeys);
-
+ opts.AddLongOption('k', "keys", "Set explicit list of keys for elements")
+ .RequiredArgument("<keys>")
+ .StoreResult(&forceKeys);
+
opts.SetFreeArgDefaultTitle("<file>");
opts.SetFreeArgsMin(1);
NLastGetopt::TOptsParseResult optsRes(&opts, argc, argv);
@@ -603,18 +603,18 @@ int main(int argc, char** argv) {
TVector<TRec> recs;
const auto& files = optsRes.GetFreeArgs();
-
+
TVector<TStringBuf> keys;
if (forceKeys.size())
StringSplitter(forceKeys).Split(':').SkipEmpty().Collect(&keys);
-
+
if (keys.size() && keys.size() != files.size()) {
Cerr << "Invalid number of keys=" << keys.size() << " (!= number of files=" << files.size() << ")" << Endl;
- return 1;
- }
-
+ return 1;
+ }
+
for (size_t i = 0; i < files.size(); ++i) {
- const auto& path = files[i];
+ const auto& path = files[i];
size_t off = 0;
#ifdef _win_
if (path[0] > 0 && isalpha(path[0]) && path[1] == ':')
@@ -626,7 +626,7 @@ int main(int argc, char** argv) {
if (pos != TString::npos)
cur.Prefix = path.substr(pos + 1);
if (keys.size())
- cur.Key = keys[i];
+ cur.Key = keys[i];
cur.Recursive = recursive;
cur.Fix();
recs.push_back(cur);