-
Notifications
You must be signed in to change notification settings - Fork 7
/
mergePairs.cpp
100 lines (80 loc) · 2.79 KB
/
mergePairs.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
// mergePairs.cpp
/*===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* Author: Vyacheslav Brover
*
* File Description:
* Merge pairs with identical first element
*
*/
#undef NDEBUG
#include "common.hpp"
using namespace Common_sp;
#include "version.inc"
#include "common.inc"
namespace
{
struct ThisApplication : Application
{
ThisApplication ()
: Application ("Merge pairs with identical first element:\nA1\tB1\nA1\tB2\nA2\tB3\nA4\tB4\n->\nA1\tB1\tB2\nA2\tB3\tB4")
{
version = VERSION;
addPositional ("in", "Input file");
}
void body () const final
{
const string fName = getArg ("in");
LineInput f (fName, 1000); // PAR
string lhs, lhs_prev;
while (f. nextLine ())
{
trim (f. line);
if (f. line. empty ())
continue;
lhs = findSplit (f. line, '\t');
QC_ASSERT (! lhs. empty ());
const string& rhs = f. line;
QC_ASSERT (! rhs. empty ());
if (lhs != lhs_prev)
{
if (! lhs_prev. empty ())
cout << endl;
cout << lhs;
}
cout << '\t' << rhs;
lhs_prev = std::move (lhs);
}
if (! lhs_prev. empty ())
cout << endl;
}
};
} // namespace
int main (int argc,
const char* argv[])
{
ThisApplication app;
return app. run (argc, argv);
}