Gentoo Archives: gentoo-commits

From: Justin Lecher <jlec@g.o>
To: gentoo-commits@l.g.o
Subject: [gentoo-commits] repo/gentoo:master commit in: sci-biology/allpathslg/files/, sci-biology/allpathslg/
Date: Wed, 23 Dec 2015 16:32:30
Message-Id: 1450888342.38789fe4d68d3806961afe972dd89d236a5995df.jlec@gentoo
1 commit: 38789fe4d68d3806961afe972dd89d236a5995df
2 Author: Ted Tanberry <ted.tanberry <AT> gmail <DOT> com>
3 AuthorDate: Wed Dec 23 09:03:29 2015 +0000
4 Commit: Justin Lecher <jlec <AT> gentoo <DOT> org>
5 CommitDate: Wed Dec 23 16:32:22 2015 +0000
6 URL: https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=38789fe4
7
8 sci-biology/allpathslg: Version bump and fix bug 568440.
9
10 Package-Manager: portage-2.2.26
11
12 sci-biology/allpathslg/Manifest | 1 +
13 sci-biology/allpathslg/allpathslg-52488.ebuild | 48 +
14 .../files/allpathslg-52488_fix-buildsystem.patch | 33 +
15 .../allpathslg-52488_remove-namespace-std.patch | 1750 ++++++++++++++++++++
16 4 files changed, 1832 insertions(+)
17
18 diff --git a/sci-biology/allpathslg/Manifest b/sci-biology/allpathslg/Manifest
19 index 8209935..8db6db4 100644
20 --- a/sci-biology/allpathslg/Manifest
21 +++ b/sci-biology/allpathslg/Manifest
22 @@ -1,3 +1,4 @@
23 DIST allpathslg-42337.tar.gz 2739498 SHA256 a2c8f64f6ba1705b2331ca07761d189183c6745f8717ffc67ee98e9e3ca3dba6 SHA512 7595fbe14a5029578b57d16f781cbb2a0f0ad6b1af2dd770e2274f8fe2e11d0013fdff12cc85c1be748e769ffb23b7d5fe30920feef38e0e8b947d05b8bda31c WHIRLPOOL 79bda55d49877641eb55630950472a06d8f25db467dbfecde8b4d04c3ce16c071d32dd312fa9a0f72723bf4caa8f9b1d0346acf438b9671b4bed2c0672c788b9
24 DIST allpathslg-47093.tar.gz 3057279 SHA256 493e21ae727250ea632b73b61545c32de2d8fb31e6a92605393ebb4af251f828 SHA512 499d23de52cad666fac663eb4a7d770b2129c4f9622f6c808ce30283429b6f67fb343f8712b07c7cb062c429117a0855da960ffc1d2ffb4e7ec2f544ba5a6314 WHIRLPOOL a3bc58dc140be3cddbd44c7035e628c4425bf86bc38592004df21d4dc91958ced9f08d667b43c15c214e53e3098805f368a856e66e5c2049b0e03d043b098ebc
25 DIST allpathslg-52415.tar.gz 3129266 SHA256 3c62024a0eacdc223bc727be4718da644fb302f785c7c7347a09ff422ce96362 SHA512 afe25b07d2e07dee3ced2283ffe858f24acfb35d53e9c11fcbcc47373594453d798c344d5604eb24d5c8d3685a185a3b8807bb3547d8066cbaab8d8cf927d1d6 WHIRLPOOL de15dfeddeca2f64fd8780839c45096c28cb47ec219d781f6754f9cf65ad6dfc39b8a48aaa2c36f777282fb08ac78ef8cd04c2e1d79f4f797710d3bb38792785
26 +DIST allpathslg-52488.tar.gz 3121949 SHA256 035b49cb21b871a6b111976757d7aee9c2513dd51af04678f33375e620998542 SHA512 c44ef1a3ed5b343bf096663309cc399e79d65e83175232743cf330fd0d426633bd0d388922fd0c73ac0927d85ea9005549c8e4f7711c79fea7107068510ef30d WHIRLPOOL c63a13450c55fce8f2c5399bdd5d8f32939e31d9d13a120835b1d826ae96e251fea81caa134d5d45ad857af0777c22e4ad1d894c81a74db6d83a7d9ad83b12b4
27
28 diff --git a/sci-biology/allpathslg/allpathslg-52488.ebuild b/sci-biology/allpathslg/allpathslg-52488.ebuild
29 new file mode 100644
30 index 0000000..0b0b806
31 --- /dev/null
32 +++ b/sci-biology/allpathslg/allpathslg-52488.ebuild
33 @@ -0,0 +1,48 @@
34 +# Copyright 1999-2015 Gentoo Foundation
35 +# Distributed under the terms of the GNU General Public License v2
36 +# $Id$
37 +
38 +EAPI=6
39 +
40 +inherit autotools eutils flag-o-matic
41 +
42 +DESCRIPTION="De novo assembly of whole-genome shotgun microreads"
43 +# see also http://www.broadinstitute.org/software/allpaths-lg/blog/?page_id=12
44 +HOMEPAGE="http://www.broadinstitute.org/science/programs/genome-biology/crd"
45 +SRC_URI="ftp://ftp.broadinstitute.org/pub/crd/ALLPATHS/Release-LG/latest_source_code/${P}.tar.gz"
46 +
47 +LICENSE="MIT"
48 +SLOT="0"
49 +KEYWORDS="~amd64"
50 +IUSE="openmp"
51 +
52 +DEPEND="
53 + dev-libs/boost
54 + !sci-biology/allpaths
55 + sci-biology/vaal"
56 +RDEPEND=""
57 +
58 +PATCHES=("${FILESDIR}/${P}_fix-buildsystem.patch" "${FILESDIR}/${P}_remove-namespace-std.patch")
59 +
60 +pkg_pretend() {
61 + # as of release 44849, GCC 4.7.0 (or higher) is required
62 + # seems pre gcc-4.7 users must stay with:
63 + # ftp://ftp.broadinstitute.org/pub/crd/ALLPATHS/Release-LG/latest_source_code/2013/2013-01/allpathslg-44837.tar.gz
64 + if [[ ${MERGE_TYPE} != binary ]]; then
65 + [[ $(tc-getCC) == *gcc* ]] && [[ $(gcc-version) < 4.7 ]] && \
66 + die "You need to use gcc >4.7"
67 + fi
68 +}
69 +
70 +src_prepare() {
71 + default_src_prepare
72 +
73 + eautoreconf
74 +}
75 +
76 +src_configure() {
77 + local myeconfargs=(
78 + $(use_enable openmp)
79 + )
80 + default_src_configure
81 +}
82
83 diff --git a/sci-biology/allpathslg/files/allpathslg-52488_fix-buildsystem.patch b/sci-biology/allpathslg/files/allpathslg-52488_fix-buildsystem.patch
84 new file mode 100644
85 index 0000000..7944eb5
86 --- /dev/null
87 +++ b/sci-biology/allpathslg/files/allpathslg-52488_fix-buildsystem.patch
88 @@ -0,0 +1,33 @@
89 +Fix build system to remove hardcoded debugging flags.
90 +
91 +--- allpathslg-52488/configure.ac
92 ++++ allpathslg-52488/configure.ac
93 +@@ -12,7 +12,7 @@
94 + AC_OPENMP
95 + AC_OPENMP_CHECK
96 +
97 +-CXXFLAGS="$CXXFLAGS -std=c++11 -Wextra -Wall -Wsign-promo -Woverloaded-virtual -Wendif-labels -Wno-unused -Wno-deprecated -Wno-long-long -Wno-parentheses -Wno-unused-parameter -fno-nonansi-builtins -mieee-fp -fno-strict-aliasing -iquote . -ggdb -DNDEBUG"
98 ++CXXFLAGS="$CXXFLAGS -std=c++11 -Wextra -Wall -Wsign-promo -Woverloaded-virtual -Wendif-labels -Wno-unused -Wno-deprecated -Wno-long-long -Wno-parentheses -Wno-unused-parameter -mieee-fp -fno-strict-aliasing -iquote . -DNDEBUG"
99 +
100 + OS_RELEASE="`uname -r`"
101 + AC_SUBST(CXXFLAGS)
102 +--- allpathslg-52488/m4/broad.m4
103 ++++ allpathslg-52488/m4/broad.m4
104 +@@ -35,12 +35,14 @@
105 + OLD_CFLAGS=$CFLAGS
106 + CFLAGS="$OPENMP_CFLAGS $CFLAGS"
107 + AC_MSG_CHECKING([validity of OpenMP configuation.])
108 +- AC_LINK_IFELSE([#ifndef _OPENMP
109 ++ AC_LINK_IFELSE([
110 ++ AC_LANG_SOURCE([[
111 ++ #ifndef _OPENMP
112 + choke me
113 + #endif
114 + #include <omp.h>
115 +- int main () { return omp_get_num_threads (); }],
116 +- [],
117 ++ int main () { return omp_get_num_threads (); }
118 ++ ]])],[],
119 + [AC_MSG_BROAD_FAIL([Your compiler must support OpenMP.])])
120 + CXXFLAGS=$OLD_CXXFLAGS
121 + CFLAGS=$OLD_CFLAGS
122
123 diff --git a/sci-biology/allpathslg/files/allpathslg-52488_remove-namespace-std.patch b/sci-biology/allpathslg/files/allpathslg-52488_remove-namespace-std.patch
124 new file mode 100644
125 index 0000000..a094c53
126 --- /dev/null
127 +++ b/sci-biology/allpathslg/files/allpathslg-52488_remove-namespace-std.patch
128 @@ -0,0 +1,1750 @@
129 +Remove 'using namespace std' causing massive havoc with newly
130 +introduced std::align in GCC-5. Fix bug
131 +https://bugs.gentoo.org/show_bug.cgi?id=568440
132 +
133 +--- allpathslg-52488/src/agp/AgpFile.cc
134 ++++ allpathslg-52488/src/agp/AgpFile.cc
135 +@@ -4,6 +4,8 @@
136 + #include "agp/AgpFile.h"
137 + #include "TokenizeString.h"
138 +
139 ++using std::cerr;
140 ++
141 + char agp_contig::TypeChar_() const
142 + {
143 + switch ( type_ )
144 +--- allpathslg-52488/src/agp/AgpFile.h
145 ++++ allpathslg-52488/src/agp/AgpFile.h
146 +@@ -9,6 +9,8 @@
147 +
148 + #include "agp/AgpMods.h"
149 +
150 ++using std::max;
151 ++
152 + class agp_entry
153 + {
154 + public:
155 +--- allpathslg-52488/src/agp/AgpMods.cc
156 ++++ allpathslg-52488/src/agp/AgpMods.cc
157 +@@ -7,6 +7,8 @@
158 +
159 + #include "system/System.h"
160 +
161 ++using std::istrstream;
162 ++
163 + bool
164 + agp_mods::SuperShouldBeRemoved( int super_id ) const
165 + {
166 +--- allpathslg-52488/src/agp/AgpMods.h
167 ++++ allpathslg-52488/src/agp/AgpMods.h
168 +@@ -7,6 +7,8 @@
169 + #include "String.h"
170 + #include "Vec.h"
171 +
172 ++using std::swap;
173 ++
174 + // The class contig_range provides begin and end positions on a
175 + // contig. If the end position is before the begin position, the
176 + // range is considered reversed. If a length is provided, the range
177 +--- allpathslg-52488/src/allpaths_cache/CacheReadsMerge.cc
178 ++++ allpathslg-52488/src/allpaths_cache/CacheReadsMerge.cc
179 +@@ -56,6 +56,8 @@
180 + #include "feudal/VirtualMasterVec.h"
181 + #include "random/Shuffle.h"
182 +
183 ++using std::map;
184 ++
185 + typedef VirtualMasterVec<BaseVec> VBaseVecVec;
186 + typedef VirtualMasterVec<QualVec> VQualVecVec;
187 +
188 +--- allpathslg-52488/src/AnAssemblyClass.h
189 ++++ allpathslg-52488/src/AnAssemblyClass.h
190 +@@ -19,6 +19,8 @@
191 + #include "ReadLocation.h"
192 + #include "ReadPairing.h"
193 +
194 ++using std::map;
195 ++
196 + class assembly;
197 +
198 + class super {
199 +--- allpathslg-52488/src/efasta/EfastaTools.cc
200 ++++ allpathslg-52488/src/efasta/EfastaTools.cc
201 +@@ -19,6 +19,8 @@
202 + #include "math/Array.h"
203 + #include <iostream>
204 +
205 ++using std::set;
206 ++
207 + #define Err(message) \
208 + { cout << message << endl << "\nInvalid.\n" << endl; \
209 + TracebackThisProcess( ); }
210 +--- allpathslg-52488/src/Equiv.cc
211 ++++ allpathslg-52488/src/Equiv.cc
212 +@@ -9,6 +9,8 @@
213 + #include "Equiv.h"
214 + #include "Vec.h"
215 +
216 ++using std::swap;
217 ++
218 + bool equivalence_relation::equiv(int a, int b) const
219 + { if ( a == b ) return true;
220 + int c = a;
221 +--- allpathslg-52488/src/FastaFilestream.cc
222 ++++ allpathslg-52488/src/FastaFilestream.cc
223 +@@ -13,6 +13,8 @@
224 +
225 + #include <strstream>
226 +
227 ++using std::string;
228 ++
229 + template <typename vecT, typename seqT, typename convT, typename verifT>
230 + FastaFilestream<vecT,seqT,convT,verifT>::FastaFilestream( const String& filename,
231 + FastaNameParser* name_parser )
232 +--- allpathslg-52488/src/FastaFilestreamPreview.cc
233 ++++ allpathslg-52488/src/FastaFilestreamPreview.cc
234 +@@ -11,6 +11,8 @@
235 +
236 + #include <algorithm>
237 +
238 ++using std::streamoff;
239 ++
240 + FastaFilestreamPreview::FastaFilestreamPreview(istream& filestream)
241 + : max_sequence_size_(0), start_offset_(0)
242 + {
243 +--- allpathslg-52488/src/FastaFilestreamPreview.h
244 ++++ allpathslg-52488/src/FastaFilestreamPreview.h
245 +@@ -12,6 +12,8 @@
246 +
247 + #include "Vec.h"
248 +
249 ++using std::streampos;
250 ++
251 + // FastaFilestreamPreview understands just enough about the fasta
252 + // format to be able to count the number of sequences in the specified
253 + // filestream and to know where each sequence starts in that filestream.
254 +--- allpathslg-52488/src/Fastavector.cc
255 ++++ allpathslg-52488/src/Fastavector.cc
256 +@@ -14,6 +14,8 @@
257 + #include <istream>
258 + #include <string>
259 +
260 ++using std::max;
261 ++
262 + // Split this into chunks, separated by gaps ('n'), and return each chunk as a
263 + // gapless fastavector.
264 + // TODO: generalize this into a templatized STL algorithm.
265 +--- allpathslg-52488/src/Fastavector.h
266 ++++ allpathslg-52488/src/Fastavector.h
267 +@@ -24,6 +24,9 @@
268 + #include <iostream>
269 + #include <unistd.h>
270 +
271 ++using std::string;
272 ++using std::istringstream;
273 ++
274 + typedef std::tuple<String, int, int> FastaRegion;
275 +
276 + class fastaindex {
277 +--- allpathslg-52488/src/FetchReads.cc
278 ++++ allpathslg-52488/src/FetchReads.cc
279 +@@ -36,6 +36,8 @@
280 + #include "Qualvector.h"
281 + #include "random/Random.h"
282 +
283 ++using std::istringstream;
284 ++
285 + // Heuristic constants:
286 +
287 + namespace
288 +--- allpathslg-52488/src/feudal/BaseVec.cc
289 ++++ allpathslg-52488/src/feudal/BaseVec.cc
290 +@@ -21,6 +21,7 @@
291 + using std::ostream;
292 + using std::cout;
293 + using std::endl;
294 ++using std::max_element;
295 +
296 + // Cap: in a given basevector, replace any sequence of N > n identical
297 + // bases by n of the same base.
298 +--- allpathslg-52488/src/graph/Digraph.cc
299 ++++ allpathslg-52488/src/graph/Digraph.cc
300 +@@ -17,6 +17,9 @@
301 + #include "graph/Digraph.h"
302 + #include "math/Functions.h"
303 +
304 ++using std::make_pair;
305 ++using std::priority_queue;
306 ++
307 + void digraph::TransferEdges( int v, int w, const Bool enter_only )
308 + { ForceAssert( v != w );
309 +
310 +--- allpathslg-52488/src/graph/Digraph.h
311 ++++ allpathslg-52488/src/graph/Digraph.h
312 +@@ -52,6 +52,8 @@
313 + #include "system/TraceVal.h"
314 + #include <cstddef>
315 +
316 ++using std::function;
317 ++
318 + typedef pair<int, int> VertexPair;
319 +
320 + typedef int vrtx_t;
321 +--- allpathslg-52488/src/graph/DigraphTemplate.h
322 ++++ allpathslg-52488/src/graph/DigraphTemplate.h
323 +@@ -34,6 +34,8 @@
324 + #include "graph/Digraph.h"
325 + #include <cstddef>
326 +
327 ++using std::make_pair;
328 ++
329 + template<class E> vec<int> digraphE<E>:: EdgesBoundedBy( const int e1, const int e2,
330 + const vec<int>& to_left, const vec<int>& to_right ) const
331 + { int v = to_right[e1], w = to_left[e2];
332 +--- allpathslg-52488/src/graph/GraphAlgorithms.h
333 ++++ allpathslg-52488/src/graph/GraphAlgorithms.h
334 +@@ -9,7 +9,7 @@
335 + #ifndef GRAPH__GRAPH_ALGORITHMS__H_
336 + #define GRAPH__GRAPH_ALGORITHMS__H_
337 +
338 +-
339 ++using std::map;
340 +
341 + // -------------- Union Find ---------------
342 + //
343 +--- allpathslg-52488/src/IndexedAlignmentPlusVector.h
344 ++++ allpathslg-52488/src/IndexedAlignmentPlusVector.h
345 +@@ -15,6 +15,8 @@
346 +
347 + #include "Alignment.h"
348 +
349 ++using std::streampos;
350 ++using std::streamoff;
351 +
352 + // This class encapsulates the header information for both vectors and indices.
353 +
354 +--- allpathslg-52488/src/kmers/kmer_parcels/KmerParcelsClasses.h
355 ++++ allpathslg-52488/src/kmers/kmer_parcels/KmerParcelsClasses.h
356 +@@ -6,6 +6,9 @@
357 + // Institute is not responsible for its use, misuse, or functionality. //
358 + ///////////////////////////////////////////////////////////////////////////////
359 +
360 ++using std::hex;
361 ++using std::dec;
362 ++
363 + // ---------------------------------
364 + // NaifTimer
365 + // ---------------------------------
366 +--- allpathslg-52488/src/kmers/naif_kmer/KernelErrorFinder.h
367 ++++ allpathslg-52488/src/kmers/naif_kmer/KernelErrorFinder.h
368 +@@ -13,8 +13,8 @@
369 + #include "kmers/naif_kmer/LockedBlocks.h"
370 + #include "kmers/naif_kmer/Kmers.h"
371 +
372 +-
373 +-
374 ++using std::make_pair;
375 ++using std::stringstream;
376 +
377 +
378 +
379 +--- allpathslg-52488/src/kmers/naif_kmer/Kmers.h
380 ++++ allpathslg-52488/src/kmers/naif_kmer/Kmers.h
381 +@@ -14,7 +14,7 @@
382 +
383 + #include "kmers/naif_kmer/KmerFunctions.h"
384 +
385 +-
386 ++using std::string;
387 +
388 + // ---- 256 random 64bit numbers to compute hash key
389 +
390 +--- allpathslg-52488/src/layout/ContigActualloc.h
391 ++++ allpathslg-52488/src/layout/ContigActualloc.h
392 +@@ -17,6 +17,8 @@
393 + #include "system/Crash.h"
394 + #include "Misc.h"
395 +
396 ++using std::set;
397 ++using std::map;
398 +
399 + //
400 + // Class contig_actualloc
401 +--- allpathslg-52488/src/lookup/ImperfectLookup.h
402 ++++ allpathslg-52488/src/lookup/ImperfectLookup.h
403 +@@ -51,6 +51,8 @@
404 + #include "lookup/LookupTools.h"
405 + #include "lookup/AlignCollector.h"
406 +
407 ++using std::auto_ptr;
408 ++
409 + class TaskTimer;
410 +
411 +
412 +--- allpathslg-52488/src/lookup/LookAlign.cc
413 ++++ allpathslg-52488/src/lookup/LookAlign.cc
414 +@@ -29,6 +29,8 @@
415 + #include "random/Random.h"
416 + #include "system/ParsedArgs.h"
417 +
418 ++using std::istrstream;
419 ++
420 + String QUERY("QUERY");
421 +
422 + void look_align::ResetFromAlign(const align & al, const basevector & b1,
423 +--- allpathslg-52488/src/lookup/LookupTable.h
424 ++++ allpathslg-52488/src/lookup/LookupTable.h
425 +@@ -18,6 +18,8 @@
426 +
427 + #include <set>
428 +
429 ++using std::set;
430 ++
431 + typedef pair<unsigned int, unsigned int> LocSeq;
432 +
433 + ///
434 +--- allpathslg-52488/src/lookup/QueryLookupTableCore.cc
435 ++++ allpathslg-52488/src/lookup/QueryLookupTableCore.cc
436 +@@ -465,6 +465,9 @@
437 + #include "system/ParsedArgs.h"
438 + #include "system/file/FileReader.h"
439 +
440 ++using std::istrstream;
441 ++using std::less_equal;
442 ++
443 + #define ABORT(MSG) \
444 + { out << MSG << " Abort." << endl << endl; \
445 + exit(1); }
446 +--- allpathslg-52488/src/lookup/ShortQueryLookup.cc
447 ++++ allpathslg-52488/src/lookup/ShortQueryLookup.cc
448 +@@ -32,6 +32,8 @@
449 + #include "lookup/AlignCollector.h"
450 + #include "lookup/ImperfectLookup.h"
451 +
452 ++using std::ios_base;
453 ++
454 + // Run an alignment processing chain: seqs -> look -> receiver -> aligns
455 + // That is, look turns seqs into hits, which receiver accepts
456 + // and turns into alignments which are passed to aligns. The
457 +--- allpathslg-52488/src/Map.h
458 ++++ allpathslg-52488/src/Map.h
459 +@@ -23,7 +23,7 @@
460 + #include <unordered_map>
461 + #include <ext/hash_map>
462 + using namespace __gnu_cxx;
463 +-
464 ++using std::map;
465 +
466 + template <class K, class V, class C=std::less<K>>
467 + using StdMap = std::map<K,V,C,typename DefaultAllocator<std::pair<K const,V>>::type>;
468 +--- allpathslg-52488/src/math/Array.h
469 ++++ allpathslg-52488/src/math/Array.h
470 +@@ -13,6 +13,8 @@
471 + #include "Vec.h"
472 + #include "Map.h"
473 +
474 ++using std::fill;
475 ++
476 + // ==============================================================================
477 + // A fixed-size simple c-style 2D array that allocates faster than vec< vec<T> >
478 + // The elements are uninitialized.
479 +--- allpathslg-52488/src/math/Functions.cc
480 ++++ allpathslg-52488/src/math/Functions.cc
481 +@@ -10,7 +10,7 @@
482 + #include "STLExtensions.h"
483 + #include "math/Functions.h"
484 +
485 +-
486 ++using std::make_pair;
487 +
488 +
489 + /* CombineNormalDistribution Filipe Ribeiro 2009-06-22
490 +--- allpathslg-52488/src/math/Functions.h
491 ++++ allpathslg-52488/src/math/Functions.h
492 +@@ -15,6 +15,10 @@
493 + #include <cmath>
494 + #include <numeric>
495 +
496 ++using std::min;
497 ++using std::cerr;
498 ++using std::swap;
499 ++
500 + // ===========================================================================
501 + //
502 + // Min functions
503 +--- allpathslg-52488/src/math/HoInterval.cc
504 ++++ allpathslg-52488/src/math/HoInterval.cc
505 +@@ -10,6 +10,8 @@
506 + #include "math/HoInterval.h"
507 + #include "STLExtensions.h"
508 +
509 ++using std::make_pair;
510 ++
511 + bool ho_interval::Merge(const ho_interval & o) {
512 + if (!Meets(*this,o)) return false;
513 + *this = Span(*this, o);
514 +--- allpathslg-52488/src/math/HoInterval.h
515 ++++ allpathslg-52488/src/math/HoInterval.h
516 +@@ -14,6 +14,8 @@
517 + #include "feudal/MasterVec.h"
518 + #include "feudal/SerfVec.h"
519 +
520 ++using std::max;
521 ++
522 + /// Class: ho_interval
523 + /// A half-open interval [a, b).
524 + class ho_interval {
525 +--- allpathslg-52488/src/math/IntFunction.h
526 ++++ allpathslg-52488/src/math/IntFunction.h
527 +@@ -21,6 +21,8 @@
528 +
529 + #include "MainTools.h"
530 +
531 ++using std::deque;
532 ++using std::fixed;
533 +
534 + #define __INT_FUNCTION_BINARY_VERSION__ 2
535 +
536 +--- allpathslg-52488/src/PackAlign.h
537 ++++ allpathslg-52488/src/PackAlign.h
538 +@@ -133,6 +133,8 @@
539 + #include "pairwise_aligners/Mutmer.h"
540 + #include "feudal/BinaryStream.h"
541 +
542 ++using std::make_pair;
543 ++
544 + const int Bits2 = 3, Bits3 = 7, Bits4 = 15, Bits10 = 1023, Bits12 = 4095,
545 + Bits16 = 65535;
546 +
547 +--- allpathslg-52488/src/PairsManager.h
548 ++++ allpathslg-52488/src/PairsManager.h
549 +@@ -61,6 +61,7 @@
550 + #include "feudal/BinaryStream.h"
551 + #include <cstddef>
552 +
553 ++using std::make_pair;
554 +
555 + class PairsManager; // forward declaration
556 +
557 +--- allpathslg-52488/src/pairwise_aligners/MakeAlignsMethod.cc
558 ++++ allpathslg-52488/src/pairwise_aligners/MakeAlignsMethod.cc
559 +@@ -19,6 +19,9 @@
560 + #include "pairwise_aligners/AlignFromMutmers.h"
561 + #include "pairwise_aligners/SmithWatBandedA.h"
562 +
563 ++using std::map;
564 ++using std::set;
565 ++
566 + // If there's a perfect match of length at least perf but we produced no proper
567 + // alignment, use banded Smith-Waterman to create one.
568 +
569 +--- allpathslg-52488/src/pairwise_aligners/MatchList.cc
570 ++++ allpathslg-52488/src/pairwise_aligners/MatchList.cc
571 +@@ -9,6 +9,8 @@
572 +
573 + #include "pairwise_aligners/MatchList.h"
574 +
575 ++using std::max;
576 ++
577 + bool MatchList::FindMatchInSorted( const int id1, const Match& newMatch ) const
578 + {
579 + const vec<Match>& sortedMatches = m_sortedMatches[id1];
580 +--- allpathslg-52488/src/paths/AlignHyperKmerPath.cc
581 ++++ allpathslg-52488/src/paths/AlignHyperKmerPath.cc
582 +@@ -23,6 +23,9 @@
583 + #include "paths/KmerBaseBroker.h"
584 + #include "paths/KmerPath.h"
585 +
586 ++using std::ostringstream;
587 ++using std::set;
588 ++
589 + // Function: AlignHyperKmerPath
590 + //
591 + // AlignHyperKmerPath takes a HyperKmerPath h, whose KmerPath edges are assumed
592 +--- allpathslg-52488/src/paths/CAltFasta.cc
593 ++++ allpathslg-52488/src/paths/CAltFasta.cc
594 +@@ -11,7 +11,7 @@
595 + #include "paths/FixSomeIndelsUtils.h"
596 + #include "efasta/EfastaTools.h"
597 +
598 +-
599 ++using std::set;
600 +
601 + /**
602 + * CAltFasta
603 +--- allpathslg-52488/src/paths/ChangeLibraryStats.cc
604 ++++ allpathslg-52488/src/paths/ChangeLibraryStats.cc
605 +@@ -47,8 +47,10 @@
606 +
607 + int libID = pairs.libraryID( libName );
608 + ForceAssertLt( libID, nLibraries); ForceAssertGe( libID, 0 );
609 +- cout << "old: " << PRINT4( libName, libID, pairs.getLibrarySep(libID), pairs.getLibrarySD(libID) );
610 +- cout << "new: " << PRINT4( libName, libID, sep, dev );
611 ++ cout << "old: ";
612 ++ PRINT4( libName, libID, pairs.getLibrarySep(libID), pairs.getLibrarySD(libID) );
613 ++ cout << "new: ";
614 ++ PRINT4( libName, libID, sep, dev );
615 + pairs.changeLibrarySepSd( libID, sep, dev );
616 + }
617 + in.close();
618 +--- allpathslg-52488/src/paths/CorrectLongReadsTools.h
619 ++++ allpathslg-52488/src/paths/CorrectLongReadsTools.h
620 +@@ -16,6 +16,8 @@
621 + #include "paths/LongReadTools.h"
622 + #include "paths/Uniseq.h"
623 +
624 ++using std::map;
625 ++
626 + class heuristics {
627 +
628 + public:
629 +--- allpathslg-52488/src/paths/ExtendUnipathSeqs.cc
630 ++++ allpathslg-52488/src/paths/ExtendUnipathSeqs.cc
631 +@@ -13,6 +13,9 @@
632 +
633 + #include <set>
634 +
635 ++using std::set;
636 ++using std::back_inserter;
637 ++
638 + void ExtendUnipathSeqs( const vecKmerPath& unipaths,
639 + const vecUnipathSeq& unipathSeqs,
640 + vecUnipathSeq& extendedUnipathSeqs,
641 +--- allpathslg-52488/src/paths/FindErrorsCore.cc
642 ++++ allpathslg-52488/src/paths/FindErrorsCore.cc
643 +@@ -20,6 +20,8 @@
644 + #include "kmers/naif_kmer/KernelPreCorrector.h"
645 + #include "system/WorklistN.h"
646 +
647 ++using std::map;
648 ++
649 + static inline
650 + String Tag(String S = "FEC") { return Date() + " (" + S + "): "; }
651 +
652 +--- allpathslg-52488/src/paths/FindErrorsCore.h
653 ++++ allpathslg-52488/src/paths/FindErrorsCore.h
654 +@@ -14,7 +14,7 @@
655 +
656 + #include "kmers/KmerSpectra.h"
657 +
658 +-
659 ++using std::set;
660 +
661 + class PC_Params
662 + {
663 +--- allpathslg-52488/src/paths/FindUnipathSeedsLG.cc
664 ++++ allpathslg-52488/src/paths/FindUnipathSeedsLG.cc
665 +@@ -16,6 +16,8 @@
666 + #include "paths/simulation/Placement.h"
667 + #include <thread>
668 +
669 ++using std::ostringstream;
670 ++
671 + // A whole bunch of variables that are shared by parallel threads.
672 +
673 + static const digraphE<fsepdev>* FG_ptr;
674 +--- allpathslg-52488/src/paths/FindUnipathSeedsLG.h
675 ++++ allpathslg-52488/src/paths/FindUnipathSeedsLG.h
676 +@@ -19,7 +19,7 @@
677 + #include "paths/simulation/Placement.h" // placement
678 + #include "paths/UnipathNhoodLG.h" // sepdev, fsepdev
679 +
680 +-
681 ++using std::string;
682 +
683 + enum SeedStatus
684 + { SEED_GOOD, SEED_ISOLATED, SEED_SHORT, SEED_HIGH_CN, SEED_ZERO_CN, SEED_RC_ON_REF, SEED_REDUNDANT, SEED_RC_OF_SEED };
685 +--- allpathslg-52488/src/paths/FixLocal.cc
686 ++++ allpathslg-52488/src/paths/FixLocal.cc
687 +@@ -88,6 +88,8 @@
688 + #include "paths/Unipath.h"
689 + #include "paths/FindErrorsCore.h"
690 +
691 ++using std::ostringstream;
692 ++
693 + void AddToPileup( const read_loc& rl, const basevector& b, const qualvector& q,
694 + const basevector& tig, vec<dumbcall>& calls )
695 + { align a;
696 +--- allpathslg-52488/src/paths/FragmentFillerDefs.h
697 ++++ allpathslg-52488/src/paths/FragmentFillerDefs.h
698 +@@ -28,6 +28,8 @@
699 + #include <set>
700 + #include <time.h>
701 +
702 ++using std::map;
703 ++
704 + namespace
705 + {
706 +
707 +--- allpathslg-52488/src/paths/GetHomes.cc
708 ++++ allpathslg-52488/src/paths/GetHomes.cc
709 +@@ -17,6 +17,8 @@
710 + #include "paths/Uniseq.h"
711 + #include "util/SearchFastb2Core.h"
712 +
713 ++using std::ostringstream;
714 ++
715 + class vepath {
716 +
717 + public:
718 +--- allpathslg-52488/src/paths/HyperFastavector.cc
719 ++++ allpathslg-52488/src/paths/HyperFastavector.cc
720 +@@ -14,6 +14,8 @@
721 + #include "feudal/BinaryStream.h"
722 + #include <thread>
723 +
724 ++using std::ostringstream;
725 ++
726 + // Order a pair of vec<int>s lexicographically using subset relation.
727 +
728 + struct order_vecint_binsubset_pair
729 +--- allpathslg-52488/src/paths/HyperKmerPathCleaner.cc
730 ++++ allpathslg-52488/src/paths/HyperKmerPathCleaner.cc
731 +@@ -11,6 +11,7 @@
732 + #include "paths/HyperKmerPathCleaner.h"
733 + #include <set>
734 +
735 ++using std::set;
736 +
737 + void HyperKmerPathCleaner::CleanUpGraph( HyperKmerPath& ans ) const {
738 +
739 +--- allpathslg-52488/src/paths/InsertWalker.h
740 ++++ allpathslg-52488/src/paths/InsertWalker.h
741 +@@ -34,7 +34,7 @@
742 + #include "paths/KmerPath.h"
743 + #include "TaskTimer.h" // TaskTimer
744 +
745 +-
746 ++using std::set;
747 +
748 +
749 +
750 +--- allpathslg-52488/src/paths/InternalMergeImpl.cc
751 ++++ allpathslg-52488/src/paths/InternalMergeImpl.cc
752 +@@ -17,7 +17,7 @@
753 + #include "paths/InternalMergeImpl.h"
754 + #include "graph/Digraph.h"
755 +
756 +-
757 ++using std::set;
758 +
759 +
760 + /*******************************************************************************
761 +--- allpathslg-52488/src/paths/KmerAlignSet.h
762 ++++ allpathslg-52488/src/paths/KmerAlignSet.h
763 +@@ -12,6 +12,8 @@
764 + #include "Basevector.h"
765 + #include "CoreTools.h"
766 +
767 ++using std::make_pair;
768 ++
769 + // KmerAlignSet. It represents a set of alignments of a read to unibases, although
770 + // in principle the 'read' could be any sequence and the 'unibases' could be any set
771 + // of sequences.
772 +--- allpathslg-52488/src/paths/KmerBaseBroker.h
773 ++++ allpathslg-52488/src/paths/KmerBaseBroker.h
774 +@@ -20,6 +20,8 @@
775 + #include <algorithm> // for set_union
776 + #include <map>
777 +
778 ++using std::map;
779 ++
780 + /**
781 + Class: KmerBaseBrokerTemplate
782 +
783 +--- allpathslg-52488/src/paths/KmerPathDatabase.cc
784 ++++ allpathslg-52488/src/paths/KmerPathDatabase.cc
785 +@@ -4,6 +4,8 @@
786 + #include "feudal/BinaryStream.h"
787 + #include <map>
788 +
789 ++using std::map;
790 ++
791 + // Methods of class KmerPathDatabaseTemplate.
792 +
793 + template <class TAG>
794 +--- allpathslg-52488/src/paths/KmerPath.h
795 ++++ allpathslg-52488/src/paths/KmerPath.h
796 +@@ -22,6 +22,8 @@
797 + #include "HashSimple.h"
798 + #include "graph/Digraph.h"
799 +
800 ++using std::make_pair;
801 ++
802 + class KmerPathLoc; // forward declaration
803 +
804 + /**
805 +--- allpathslg-52488/src/paths/KmerPathInterval.cc
806 ++++ allpathslg-52488/src/paths/KmerPathInterval.cc
807 +@@ -128,11 +128,11 @@
808 + }
809 +
810 + template void Contains( const vec<tagged_rpint>& segs, kmer_id_t index,
811 +- vec<longlong>& answer, bool append, int cap );
812 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
813 + template void Contains( const vec<big_tagged_rpint>& segs, kmer_id_t index,
814 +- vec<longlong>& answer, bool append, int cap );
815 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
816 + template void Contains( const vec<new_tagged_rpint>& segs, kmer_id_t index,
817 +- vec<longlong>& answer, bool append, int cap );
818 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
819 +
820 + // Overload Contains() with a second version that looks for all intervals overlapping
821 + // a given KmerPathInterval, instead of a single kmer.
822 +@@ -203,11 +203,11 @@
823 + }
824 +
825 + template void Contains( const vec<tagged_rpint>& segs, KmerPathInterval rpi,
826 +- vec<longlong>& answer, bool append, int cap );
827 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
828 + template void Contains( const vec<big_tagged_rpint>& segs, KmerPathInterval rpi,
829 +- vec<longlong>& answer, bool append, int cap );
830 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
831 + template void Contains( const vec<new_tagged_rpint>& segs, KmerPathInterval rpi,
832 +- vec<longlong>& answer, bool append, int cap );
833 ++ vec<longlong>& answer, bool append = false, int cap = -1 );
834 +
835 + // This will efficiently find a single instance of the requested kmer.
836 + // Intended for base lookup, where you don't need to find all of them.
837 +--- allpathslg-52488/src/paths/KmerPathInterval.h
838 ++++ allpathslg-52488/src/paths/KmerPathInterval.h
839 +@@ -8,6 +8,8 @@
840 + #include "CommonSemanticTypes.h"
841 + #include "feudal/BinaryStreamTraits.h"
842 +
843 ++using std::max;
844 ++
845 + // Portability note: endianness
846 + // The implementations here would need to be changed for big endian architectures.
847 +
848 +@@ -116,6 +118,15 @@
849 + To do: check that "gaps in kmer paths are not used for assembly from short reads"
850 + is true.
851 + */
852 ++
853 ++class KmerPathInterval;
854 ++
855 ++template<class TAG>
856 ++void Contains( const vec<TAG>& segs, kmer_id_t index, vec<longlong>& answer, bool append = false, int cap = -1 );
857 ++
858 ++template<class TAG>
859 ++void Contains( const vec<TAG>& segs, KmerPathInterval rpi, vec<longlong>& answer, bool append = false, int cap = -1 );
860 ++
861 + class KmerPathInterval {
862 + public:
863 + KmerPathInterval( ) { }
864 +@@ -364,11 +375,11 @@
865 +
866 + template<class TAG>
867 + friend void Contains( const vec<TAG>& segs, kmer_id_t index,
868 +- vec<longlong>& answer, bool append = false, int cap = -1 );
869 ++ vec<longlong>& answer, bool append, int cap );
870 +
871 + template<class TAG>
872 + friend void Contains( const vec<TAG>& segs, KmerPathInterval rpi,
873 +- vec<longlong>& answer, bool append = false, int cap = -1 );
874 ++ vec<longlong>& answer, bool append, int cap );
875 +
876 + template<class TAG>
877 + friend longlong Instance( const vec<TAG>& segs, kmer_id_t k );
878 +@@ -491,11 +502,11 @@
879 +
880 + template<class TAG>
881 + friend void Contains( const vec<TAG>& segs, kmer_id_t index,
882 +- vec<longlong>& answer, bool append = false, int cap = -1 );
883 ++ vec<longlong>& answer, bool append, int cap );
884 +
885 + template<class TAG>
886 + friend void Contains( const vec<TAG>& segs, KmerPathInterval rpi,
887 +- vec<longlong>& answer, bool append = false, int cap = -1 );
888 ++ vec<longlong>& answer, bool append, int cap );
889 +
890 + template<class TAG>
891 + friend longlong Instance( const vec<TAG>& segs, kmer_id_t k );
892 +@@ -622,11 +633,11 @@
893 +
894 + template<class TAG>
895 + friend void Contains( const vec<TAG>& segs, kmer_id_t index,
896 +- vec<longlong>& answer, bool append = false, int cap = -1 );
897 ++ vec<longlong>& answer, bool append, int cap );
898 +
899 + template<class TAG>
900 + friend void Contains( const vec<TAG>& segs, KmerPathInterval rpi,
901 +- vec<longlong>& answer, bool append = false, int cap = -1 );
902 ++ vec<longlong>& answer, bool append, int cap );
903 +
904 + template<class TAG>
905 + friend kmer_id_t Instance( const vec<TAG>& segs, kmer_id_t k );
906 +--- allpathslg-52488/src/paths/KPatch.cc
907 ++++ allpathslg-52488/src/paths/KPatch.cc
908 +@@ -32,6 +32,8 @@
909 + #include "paths/AssemblyEdit.h"
910 + #include "paths/GetNexts.h"
911 +
912 ++using std::ostringstream;
913 ++
914 + template<int K> void PatchMe( const vec<basevector>& jbases_sorted,
915 + const vec<int64_t>& jbases_sorted_id, const PairsManager& jpairs,
916 + const vec< triple<int64_t,int,int> >& jaligns, const vec<superb>& scaffolds,
917 +--- allpathslg-52488/src/paths/LinkingPairs.cc
918 ++++ allpathslg-52488/src/paths/LinkingPairs.cc
919 +@@ -9,6 +9,8 @@
920 + #include "paths/LinkingPairs.h"
921 + #include "math/Array.h"
922 +
923 ++using std::multiset;
924 ++
925 + void LinkingPairs::Init(int nlibs_, const vec<int>& lens )
926 + {
927 + nlibs = nlibs_;
928 +--- allpathslg-52488/src/paths/long/EvalByReads.cc
929 ++++ allpathslg-52488/src/paths/long/EvalByReads.cc
930 +@@ -19,6 +19,8 @@
931 + #include <queue>
932 + #include <omp.h>
933 +
934 ++using std::priority_queue;
935 ++
936 + namespace {
937 + struct CompareReadPlaceByQsum {
938 + bool operator() (const read_place& a, const read_place& b)
939 +--- allpathslg-52488/src/paths/long/EvalCorrected.cc
940 ++++ allpathslg-52488/src/paths/long/EvalCorrected.cc
941 +@@ -25,6 +25,8 @@
942 + #include "paths/long/MakeKmerStuff.h"
943 + #include "random/Random.h"
944 +
945 ++using std::set;
946 ++
947 + void EvalCorrected(
948 + const VecEFasta& corrected0, // corrected reads
949 + const vec<int>& cid, // ids of corrected reads
950 +--- allpathslg-52488/src/paths/long/fosmid/Fosmids.cc
951 ++++ allpathslg-52488/src/paths/long/fosmid/Fosmids.cc
952 +@@ -15,6 +15,9 @@
953 + #include "paths/long/fosmid/Fosmids.h"
954 + #include "math/HoInterval.h"
955 +
956 ++using std::istringstream;
957 ++using std::ostringstream;
958 ++
959 + vec<int> ChrSizes(void)
960 + {
961 + return {249250621,243199373,198022430,191154276,180915260,171115067,
962 +--- allpathslg-52488/src/paths/long/KmerAlign.cc
963 ++++ allpathslg-52488/src/paths/long/KmerAlign.cc
964 +@@ -12,6 +12,8 @@
965 + #include "Equiv.h"
966 + #include "VecUtilities.h"
967 +
968 ++using std::map;
969 ++
970 + void KmerAlign(
971 + const vec< pair<int,int> > & offset,
972 + vec< pair<int,int> > & aligns,
973 +--- allpathslg-52488/src/paths/long/OverlapReads.cc
974 ++++ allpathslg-52488/src/paths/long/OverlapReads.cc
975 +@@ -10,6 +10,10 @@
976 + #include "FeudalMimic.h"
977 + #include <queue>
978 +
979 ++using std::max;
980 ++using std::queue;
981 ++using std::make_pair;
982 ++
983 + // ================================ static methods =============================
984 +
985 + // If tail b1[len1-overlap:len1) is the same as head b2[0: overlap)
986 +--- allpathslg-52488/src/paths/long/RefTraceTools.cc
987 ++++ allpathslg-52488/src/paths/long/RefTraceTools.cc
988 +@@ -10,6 +10,8 @@
989 + #include "VecUtilities.h"
990 + #include "math/HoInterval.h"
991 +
992 ++using std::get;
993 ++
994 + void CreateHBPlus(const HyperBasevector& hb, const vec<int>& inv,
995 + HyperBasevector& hbp, vec<pair<int,Bool>>& hbp_to_hb)
996 + {
997 +--- allpathslg-52488/src/paths/long/ultra/ConsensusScoreModel.cc
998 ++++ allpathslg-52488/src/paths/long/ultra/ConsensusScoreModel.cc
999 +@@ -12,6 +12,8 @@
1000 + #include "VecUtilities.h"
1001 + #include <map>
1002 +
1003 ++using std::map;
1004 ++
1005 + ConsensusScoreModel::ConsensusScoreModel( double del_rate, double ins_rate, double sub_rate,
1006 + bool ignore_matching_score, bool score_fast )
1007 + {
1008 +--- allpathslg-52488/src/paths/long/VariantCallTools.cc
1009 ++++ allpathslg-52488/src/paths/long/VariantCallTools.cc
1010 +@@ -27,6 +27,8 @@
1011 + #include "paths/long/VariantReadSupport.h"
1012 + #include "kmers/KMer.h"
1013 +
1014 ++using std::stack;
1015 ++
1016 + namespace {
1017 +
1018 + bool IsBubbleEdge(int eid, const HyperBasevector& hb, const vec<int>& to_left,
1019 +--- allpathslg-52488/src/paths/long/VariantReadSupport.cc
1020 ++++ allpathslg-52488/src/paths/long/VariantReadSupport.cc
1021 +@@ -23,6 +23,11 @@
1022 + #include "paths/long/ReadOriginTracker.h"
1023 + #include "paths/long/EvalByReads.h"
1024 +
1025 ++using std::get;
1026 ++using std::make_tuple;
1027 ++using std::ignore;
1028 ++using std::tie;
1029 ++
1030 + namespace {
1031 + void CalcLengthProbSimple(vec<double>&vOut,const double dProbIns_len, const double dProbDel_len, const uint64_t org_length){
1032 + const double dProbIns=dProbIns_len;
1033 +--- allpathslg-52488/src/paths/long/VariantReadSupport.h
1034 ++++ allpathslg-52488/src/paths/long/VariantReadSupport.h
1035 +@@ -5,6 +5,8 @@
1036 + #include "Qualvector.h"
1037 + #include "paths/HyperBasevector.h"
1038 +
1039 ++using std::tuple;
1040 ++
1041 + // forward declaration
1042 + class read_place;
1043 + class ReadOriginTracker;
1044 +--- allpathslg-52488/src/paths/long/Variants.cc
1045 ++++ allpathslg-52488/src/paths/long/Variants.cc
1046 +@@ -22,6 +22,8 @@
1047 + #include "paths/long/VariantFilters.h"
1048 + #include "paths/long/VariantPostProcess.h"
1049 +
1050 ++using std::set;
1051 ++
1052 + int MarkVariants( HyperEfasta& he, const vec<VariantSignature>& v_signatures,
1053 + const long_logging& logc )
1054 + { double clock = WallClockTime( );
1055 +--- allpathslg-52488/src/paths/LongReadTools.h
1056 ++++ allpathslg-52488/src/paths/LongReadTools.h
1057 +@@ -17,6 +17,8 @@
1058 + #include "kmers/KmerRecord.h"
1059 + #include "paths/AssemblyEdit.h"
1060 +
1061 ++using std::ostringstream;
1062 ++
1063 + // A gap patcher is defined by left and right ints u1 and u2, and a BaseVec r,
1064 + // whose left end aligns to u1 starting at tpos1 and whose right end aligns to u2
1065 + // ending at tpos2, where the positions are in terms of the BaseVecs associated
1066 +--- allpathslg-52488/src/paths/MakeScaffoldsCloseBest.cc
1067 ++++ allpathslg-52488/src/paths/MakeScaffoldsCloseBest.cc
1068 +@@ -29,6 +29,8 @@
1069 + #include "paths/reporting/CLinkBundle.h"
1070 + #include <sstream>
1071 +
1072 ++using std::ostringstream;
1073 ++
1074 + // An slink is a link between scaffolds. The first scaffold is not represented
1075 + // in the object.
1076 +
1077 +--- allpathslg-52488/src/paths/Mixmer.cc
1078 ++++ allpathslg-52488/src/paths/Mixmer.cc
1079 +@@ -73,6 +73,9 @@
1080 + #include "util/ReadTracker.h"
1081 + #include "util/SearchFastb2Core.h"
1082 +
1083 ++using std::ostringstream;
1084 ++using std::istrstream;
1085 ++
1086 + // CorrectErrors.
1087 +
1088 + void CorrectErrors( vecbasevector& bases, vecqualvector& quals,
1089 +--- allpathslg-52488/src/paths/MuxGraph.cc
1090 ++++ allpathslg-52488/src/paths/MuxGraph.cc
1091 +@@ -6,6 +6,7 @@
1092 +
1093 + #include <set>
1094 +
1095 ++using std::set;
1096 +
1097 + // Functions to translate pathIds to nodeIds and back.
1098 +
1099 +--- allpathslg-52488/src/paths/MuxSearchAgent.h
1100 ++++ allpathslg-52488/src/paths/MuxSearchAgent.h
1101 +@@ -15,6 +15,10 @@
1102 + #include "paths/MuxSearchState.h"
1103 + #include "paths/MuxSearchPolicy.h"
1104 +
1105 ++using std::hex;
1106 ++using std::dec;
1107 ++using std::mem_fun;
1108 ++
1109 + /// The search agent directed by the SearchDirector of a
1110 + /// KmerPathMuxSearcher.
1111 + ///
1112 +--- allpathslg-52488/src/paths/MuxSearchPolicy.h
1113 ++++ allpathslg-52488/src/paths/MuxSearchPolicy.h
1114 +@@ -29,6 +29,7 @@
1115 + #include <hash_set>
1116 + #endif
1117 +
1118 ++using std::map;
1119 +
1120 + ////////////////////////////////////////////////////////////////////////////
1121 + ///
1122 +--- allpathslg-52488/src/paths/OffsetTracker.cc
1123 ++++ allpathslg-52488/src/paths/OffsetTracker.cc
1124 +@@ -10,6 +10,8 @@
1125 + #include "paths/OffsetTracker.h"
1126 + #include <queue>
1127 +
1128 ++using std::priority_queue;
1129 ++
1130 + MutableOffsetTracker::MutableOffsetTracker( const vecUnipathSeq& unipathSeqs,
1131 + const MuxGraph& inverseMuxGraph,
1132 + const int firstSuperSeq,
1133 +--- allpathslg-52488/src/paths/PairDistFitting.h
1134 ++++ allpathslg-52488/src/paths/PairDistFitting.h
1135 +@@ -38,7 +38,7 @@
1136 + //
1137 + template <class T>
1138 + void MostProbableGap( const T& distr, const int len1, const int len2, const vec< pair< int, int > >& links,
1139 +- int& gap, int& std, bool verbose=false )
1140 ++ int& gap, int& std, bool verbose )
1141 + {
1142 + ForceAssertGt( links.isize(), 0 );
1143 + // find the averge of x1 + x2 ( <x1+x2> = <L> - g in the ideal case )
1144 +--- allpathslg-52488/src/paths/PairDistModels.h
1145 ++++ allpathslg-52488/src/paths/PairDistModels.h
1146 +@@ -23,6 +23,8 @@
1147 + #include <map>
1148 + #include "math/IntDistribution.h"
1149 +
1150 ++using std::map;
1151 ++
1152 + // =====================================================
1153 + // Class ProbFuncInterface
1154 + //
1155 +--- allpathslg-52488/src/paths/PatcherCottageCore.cc
1156 ++++ allpathslg-52488/src/paths/PatcherCottageCore.cc
1157 +@@ -22,6 +22,8 @@
1158 + #include "system/AllOfOutput.h"
1159 + #include "system/SharedMem.h"
1160 +
1161 ++using std::ostringstream;
1162 ++
1163 + void PatcherCottageCore( basevector L, basevector R, const int sep,
1164 + const int dev, vecbasevector& reads, vecqualvector& quals,
1165 + vec< pair<int,int> >& pairs, String& report,
1166 +--- allpathslg-52488/src/paths/PolymorphismRemoveCore.h
1167 ++++ allpathslg-52488/src/paths/PolymorphismRemoveCore.h
1168 +@@ -19,7 +19,7 @@
1169 +
1170 + #include "kmers/naif_kmer/KmerFreqAffixesMap.h"
1171 +
1172 +-
1173 ++using std::map;
1174 +
1175 + typedef Kmer29 Kmer_t;
1176 + typedef KmerFreqAffixes<Kmer_t> KmerRec_t;
1177 +--- allpathslg-52488/src/paths/ReadsToPathsCoreX.cc
1178 ++++ allpathslg-52488/src/paths/ReadsToPathsCoreX.cc
1179 +@@ -20,6 +20,8 @@
1180 + #include "paths/MakeAlignsPathsParallelX.h"
1181 + #include "paths/ReadsToPathsCoreX.h"
1182 +
1183 ++using std::map;
1184 ++
1185 + static inline
1186 + String Tag(String S = "RTPCX") { return Date() + " (" + S + "): "; }
1187 +
1188 +--- allpathslg-52488/src/paths/RemodelGapTools.cc
1189 ++++ allpathslg-52488/src/paths/RemodelGapTools.cc
1190 +@@ -18,6 +18,9 @@
1191 + #include "paths/RemodelGapTools.h"
1192 + #include "random/NormalDistribution.h"
1193 +
1194 ++using std::istringstream;
1195 ++using std::ostringstream;
1196 ++
1197 + // GapComp
1198 + //
1199 + // d = possible gap
1200 +--- allpathslg-52488/src/paths/reporting/CLinkBundle.cc
1201 ++++ allpathslg-52488/src/paths/reporting/CLinkBundle.cc
1202 +@@ -8,6 +8,8 @@
1203 +
1204 + #include "paths/reporting/CLinkBundle.h"
1205 +
1206 ++using std::make_pair;
1207 ++
1208 + /**
1209 + * CLinkBundle
1210 + * Constructor
1211 +--- allpathslg-52488/src/paths/reporting/CSuperLinks.cc
1212 ++++ allpathslg-52488/src/paths/reporting/CSuperLinks.cc
1213 +@@ -15,6 +15,8 @@
1214 + #include "paths/reporting/COffset.h"
1215 + #include "paths/reporting/CSuperLinks.h"
1216 +
1217 ++using std::set;
1218 ++
1219 + /**
1220 + * class CSuperLinks
1221 + * Constructor
1222 +--- allpathslg-52488/src/paths/reporting/MapSeeds.cc
1223 ++++ allpathslg-52488/src/paths/reporting/MapSeeds.cc
1224 +@@ -24,7 +24,7 @@
1225 + #include "paths/simulation/Placement.h"
1226 + #include "feudal/BinaryStream.h"
1227 +
1228 +-
1229 ++using std::ostringstream;
1230 +
1231 + // MakeDepend: dependency QueryLookupTable
1232 +
1233 +--- allpathslg-52488/src/paths/SamplePairedReadDistributions.cc
1234 ++++ allpathslg-52488/src/paths/SamplePairedReadDistributions.cc
1235 +@@ -68,6 +68,8 @@
1236 + #include "math/IntDistribution.h"
1237 + #include "math/IntFrequencies.h"
1238 +
1239 ++using std::list;
1240 ++
1241 + static inline
1242 + String Tag(String S = "SPRD") { return Date() + " (" + S + "): "; }
1243 +
1244 +--- allpathslg-52488/src/paths/SamplePairedReadStats.cc
1245 ++++ allpathslg-52488/src/paths/SamplePairedReadStats.cc
1246 +@@ -46,6 +46,8 @@
1247 + #include "paths/HyperBasevector.h"
1248 + #include "paths/ReadsToPathsCoreX.h"
1249 +
1250 ++using std::list;
1251 ++
1252 + // auxiliary routines -------------------------------
1253 + void pair_alignment_data( const PairsManager& pairs, const vecbasevector& reads, const VecQualNibbleVec &quals,
1254 + FirstLookupFinderECJ& lfinder, FirstLookupFilterECJ& lfilter,
1255 +--- allpathslg-52488/src/paths/SimpleGapCloser.cc
1256 ++++ allpathslg-52488/src/paths/SimpleGapCloser.cc
1257 +@@ -44,6 +44,8 @@
1258 + #include "paths/Unipath.h"
1259 + #include "system/AllOfOutput.h"
1260 +
1261 ++using std::ostringstream;
1262 ++
1263 + class bridge {
1264 +
1265 + public:
1266 +--- allpathslg-52488/src/paths/SimpleWalk.cc
1267 ++++ allpathslg-52488/src/paths/SimpleWalk.cc
1268 +@@ -15,6 +15,9 @@
1269 + #include "paths/PairedPair.h"
1270 + #include "paths/SimpleWalk.h"
1271 +
1272 ++using std::make_pair;
1273 ++using std::priority_queue;
1274 ++
1275 + namespace
1276 + {
1277 +
1278 +--- allpathslg-52488/src/paths/simulation/VCF.cc
1279 ++++ allpathslg-52488/src/paths/simulation/VCF.cc
1280 +@@ -16,6 +16,8 @@
1281 + #include "system/Assert.h"
1282 + #include <utility>
1283 +
1284 ++using std::istringstream;
1285 ++
1286 + namespace {
1287 +
1288 + // split - tokenize a string based on a separator and return a vector of strings representing the
1289 +--- allpathslg-52488/src/paths/simulation/VCF.h
1290 ++++ allpathslg-52488/src/paths/simulation/VCF.h
1291 +@@ -21,7 +21,8 @@
1292 +
1293 + using std::string;
1294 + using std::vector;
1295 +-
1296 ++using std::ostringstream;
1297 ++using std::map;
1298 +
1299 + // VCFWriter use a streamlined data structure compared to VCF, which was hard coded to use VCFChromosome
1300 + class VCFWriter
1301 +--- allpathslg-52488/src/paths/SubmissionPrep.cc
1302 ++++ allpathslg-52488/src/paths/SubmissionPrep.cc
1303 +@@ -21,6 +21,8 @@
1304 + #include "paths/AssemblyCleanupTools.h"
1305 + #include "math/HoInterval.h"
1306 +
1307 ++using std::ostringstream;
1308 ++
1309 + /**
1310 + * SubmissionPrep
1311 + *
1312 +--- allpathslg-52488/src/paths/SubsumptionList.cc
1313 ++++ allpathslg-52488/src/paths/SubsumptionList.cc
1314 +@@ -2,6 +2,8 @@
1315 +
1316 + #include "paths/SubsumptionList.h"
1317 +
1318 ++using std::back_inserter;
1319 ++
1320 + // Functions to translate pathIds to indexes and back.
1321 +
1322 + OrientedKmerPathId PathIdFromIndex( int index )
1323 +--- allpathslg-52488/src/paths/SuperBaseVector.h
1324 ++++ allpathslg-52488/src/paths/SuperBaseVector.h
1325 +@@ -10,6 +10,8 @@
1326 + #include <numeric>
1327 + #include <functional>
1328 +
1329 ++using std::mem_fun_ref;
1330 ++
1331 + /// A simple class which holds a series of basevectors with
1332 + /// (possibly negative) gaps between them. This is what a
1333 + /// KmerPath logically maps to in sequence space. The function
1334 +--- allpathslg-52488/src/paths/UnibaseCopyNumber3.cc
1335 ++++ allpathslg-52488/src/paths/UnibaseCopyNumber3.cc
1336 +@@ -43,7 +43,7 @@
1337 + #include <omp.h>
1338 + // MakeDepend: library OMP
1339 +
1340 +-
1341 ++using std::istrstream;
1342 +
1343 + // Check if the gap size from u1 to u2 is the same as from u2* to u1*.
1344 + void CheckGaps(
1345 +--- allpathslg-52488/src/paths/UnipathEval.cc
1346 ++++ allpathslg-52488/src/paths/UnipathEval.cc
1347 +@@ -35,6 +35,9 @@
1348 + #include <omp.h>
1349 + // MakeDepend: library OMP
1350 +
1351 ++using std::ostringstream;
1352 ++using std::list;
1353 ++
1354 + typedef double gc_t;
1355 + typedef int unipath_size_t;
1356 + typedef BinsVec2 < unipath_size_t, gc_t, PredictionStats > bin2PredStat;
1357 +--- allpathslg-52488/src/paths/UnipathFixerTools.cc
1358 ++++ allpathslg-52488/src/paths/UnipathFixerTools.cc
1359 +@@ -33,6 +33,8 @@
1360 + #include "util/SearchFastb2Core.h"
1361 + #include <vector>
1362 +
1363 ++using std::ostringstream;
1364 ++
1365 + size_t const PCottageJoinData::HEADER;
1366 +
1367 + void AlignReadsToUnipaths( const String& run_dir, const String& jump_reads,
1368 +--- allpathslg-52488/src/paths/UnipathNhoodCommon.cc
1369 ++++ allpathslg-52488/src/paths/UnipathNhoodCommon.cc
1370 +@@ -12,6 +12,8 @@
1371 + #include "paths/simulation/Placement.h"
1372 + #include <sstream>
1373 +
1374 ++using std::ostringstream;
1375 ++
1376 + /**
1377 + Function: PrintNhood
1378 +
1379 +--- allpathslg-52488/src/paths/UnipathPatcher.cc
1380 ++++ allpathslg-52488/src/paths/UnipathPatcher.cc
1381 +@@ -47,6 +47,8 @@
1382 + #include "paths/UnipathFixerTools.h"
1383 + #include "system/SharedMem.h"
1384 +
1385 ++using std::istrstream;
1386 ++
1387 + void GapStatsAlt( vec<int> gap, vec<int> gapdev, int& gap_ave, int& gapdev_ave )
1388 + {
1389 + // If there are less than six gaps, we directly compute their mean.
1390 +--- allpathslg-52488/src/paths/Uniseq.cc
1391 ++++ allpathslg-52488/src/paths/Uniseq.cc
1392 +@@ -498,7 +498,7 @@
1393 + const gapster& gx = G( ).EdgeObjectByIndexFrom( x, 0 );
1394 + uniseq p = Vert(x);
1395 + int y = From(x)[0];
1396 +- if ( !To(y).size( ) == 2 ) continue;
1397 ++ if ( !(To(y).size( ) == 2) ) continue;
1398 + int e = -1;
1399 + for ( int j = 0; j < To(y).isize( ); j++ )
1400 + if ( To(y)[j] != x ) e = j;
1401 +@@ -518,7 +518,7 @@
1402 + const gapster& gx = G( ).EdgeObjectByIndexTo( x, 0 );
1403 + uniseq p = Vert(x);
1404 + int y = To(x)[0];
1405 +- if ( !From(y).size( ) == 2 ) continue;
1406 ++ if ( !(From(y).size( ) == 2) ) continue;
1407 + int e = -1;
1408 + for ( int j = 0; j < From(y).isize( ); j++ )
1409 + if ( From(y)[j] != x ) e = j;
1410 +--- allpathslg-52488/src/paths/Useq.cc
1411 ++++ allpathslg-52488/src/paths/Useq.cc
1412 +@@ -10,6 +10,8 @@
1413 + #include "CoreTools.h"
1414 + #include "paths/Useq.h"
1415 +
1416 ++using std::make_pair;
1417 ++
1418 + int useq::Kmers( ) const
1419 + { Assert( unibases_ != 0 );
1420 + int kmers = 0;
1421 +--- allpathslg-52488/src/PrintAlignment.h
1422 ++++ allpathslg-52488/src/PrintAlignment.h
1423 +@@ -14,6 +14,8 @@
1424 + #include "CoreTools.h"
1425 + #include "Qualvector.h"
1426 +
1427 ++using std::ostringstream;
1428 ++
1429 + void PrintBlanks( ostream& out, int n );
1430 +
1431 + template<class BASEVEC>
1432 +--- allpathslg-52488/src/Qualvector.cc
1433 ++++ allpathslg-52488/src/Qualvector.cc
1434 +@@ -10,6 +10,8 @@
1435 + #include "FastIfstream.h"
1436 + #include "Qualvector.h"
1437 +
1438 ++using std::istrstream;
1439 ++
1440 + /// \file
1441 + /// \ingroup grp_quals
1442 + /// \copydoc Qualvector.h
1443 +--- allpathslg-52488/src/ReadLocation.cc
1444 ++++ allpathslg-52488/src/ReadLocation.cc
1445 +@@ -16,6 +16,9 @@
1446 + #include "Vec.h"
1447 + #include "system/file/FileReader.h"
1448 +
1449 ++using std::streampos;
1450 ++using std::map;
1451 ++
1452 + void read_location::ForceInBounds( ostream * out_ptr )
1453 + { if ( (int) LengthOfRead( ) > LengthOfContig( ) )
1454 + { if ( out_ptr )
1455 +--- allpathslg-52488/src/ReadLocationUtil.cc
1456 ++++ allpathslg-52488/src/ReadLocationUtil.cc
1457 +@@ -9,7 +9,7 @@
1458 + #include "STLExtensions.h"
1459 + #include "VecAlignmentPlus.h"
1460 +
1461 +-
1462 ++using std::map;
1463 +
1464 + int AlignsCount( const vec<read_location> &locs,
1465 + int loc_id,
1466 +--- allpathslg-52488/src/reporting/ScaffoldLayout.cc
1467 ++++ allpathslg-52488/src/reporting/ScaffoldLayout.cc
1468 +@@ -21,6 +21,8 @@
1469 + #include <omp.h>
1470 + // MakeDepend: library OMP
1471 +
1472 ++using std::ostringstream;
1473 ++
1474 + int main(int argc, char **argv)
1475 + {
1476 + RunTime( );
1477 +--- allpathslg-52488/src/SeqInterval.cc
1478 ++++ allpathslg-52488/src/SeqInterval.cc
1479 +@@ -9,6 +9,7 @@
1480 + #include "SeqInterval.h"
1481 + #include "Vec.h"
1482 +
1483 ++using std::min;
1484 +
1485 + /*
1486 + * seq_interval
1487 +--- allpathslg-52488/src/SeqInterval.h
1488 ++++ allpathslg-52488/src/SeqInterval.h
1489 +@@ -14,7 +14,10 @@
1490 + #include <algorithm>
1491 + #include <iostream>
1492 +
1493 +-using namespace std;
1494 ++using std::binary_function;
1495 ++using std::ostream;
1496 ++using std::istream;
1497 ++using std::max;
1498 +
1499 + /*
1500 + * class seq_interval
1501 +--- allpathslg-52488/src/Set.h
1502 ++++ allpathslg-52488/src/Set.h
1503 +@@ -16,6 +16,8 @@
1504 + #include <iostream>
1505 + #include <set>
1506 +
1507 ++using std::set;
1508 ++
1509 + template <class T, class C=std::less<T>>
1510 + using StdSet = std::set<T,C,typename DefaultAllocator<T>::type>;
1511 +
1512 +--- allpathslg-52488/src/ShortVector.h
1513 ++++ allpathslg-52488/src/ShortVector.h
1514 +@@ -14,6 +14,8 @@
1515 + #include "system/Types.h"
1516 + #include "feudal/BinaryStream.h"
1517 +
1518 ++using std::uninitialized_fill_n;
1519 ++
1520 + // ================================================================================
1521 + //
1522 + // A shortvector holds a list of up to 255 things of any type T.
1523 +--- allpathslg-52488/src/STLExtensions.h
1524 ++++ allpathslg-52488/src/STLExtensions.h
1525 +@@ -9,8 +9,6 @@
1526 + #ifndef STLEXTENSIONS_H
1527 + #define STLEXTENSIONS_H
1528 +
1529 +-using namespace std;
1530 +-
1531 + #include <functional>
1532 + #include <vector>
1533 + #include <bitset>
1534 +@@ -21,6 +19,14 @@
1535 + #include "feudal/BinaryStream.h"
1536 + #include "system/StaticAssert.h"
1537 +
1538 ++using std::binary_function;
1539 ++using std::unary_function;
1540 ++using std::pair;
1541 ++using std::bitset;
1542 ++using std::initializer_list;
1543 ++using std::vector;
1544 ++using std::ostream;
1545 ++
1546 + /// minimum<T> is a function object.
1547 + ///
1548 + /// If f is an object of class minimum<T> and x and y are objects of
1549 +--- allpathslg-52488/src/system/MiscUtil.cc
1550 ++++ allpathslg-52488/src/system/MiscUtil.cc
1551 +@@ -21,6 +21,8 @@
1552 + #include "system/HTMLUtils.h"
1553 + #include "system/Utils.h"
1554 +
1555 ++using std::list;
1556 ++
1557 + static Bool makeOnlyIfNeeded = True;
1558 +
1559 + void SetMakeOnlyIfNeeded( Bool newMakeOnlyIfNeeded ) {
1560 +--- allpathslg-52488/src/system/MiscUtil.h
1561 ++++ allpathslg-52488/src/system/MiscUtil.h
1562 +@@ -27,6 +27,9 @@
1563 + #include "CommonSemanticTypes.h"
1564 + #include "graph/Digraph.h"
1565 +
1566 ++using std::map;
1567 ++using std::set;
1568 ++
1569 + // Semantic type: shellcmd_t
1570 + // The name of a shell command.
1571 + SemanticType( String, shellcmd_t );
1572 +--- allpathslg-52488/src/system/ParsedArgs.cc
1573 ++++ allpathslg-52488/src/system/ParsedArgs.cc
1574 +@@ -26,6 +26,9 @@
1575 + #include "system/HostName.h"
1576 + #include "system/UseGDB.h"
1577 +
1578 ++using std::istrstream;
1579 ++using std::mem_fun_ref;
1580 ++
1581 + #ifndef FatalErr
1582 + #define FatalErr(message) { cout << message << endl << endl; exit(-1); }
1583 + #endif
1584 +--- allpathslg-52488/src/system/ParsedArgs.h
1585 ++++ allpathslg-52488/src/system/ParsedArgs.h
1586 +@@ -97,6 +97,8 @@
1587 + #include "TokenizeString.h"
1588 + #include "ParseSet.h"
1589 +
1590 ++using std::stringstream;
1591 ++
1592 + class parsed_arg_help {
1593 +
1594 + public:
1595 +--- allpathslg-52488/src/system/ProcBuf.cc
1596 ++++ allpathslg-52488/src/system/ProcBuf.cc
1597 +@@ -15,6 +15,8 @@
1598 + #include <sys/wait.h>
1599 + #include <unistd.h>
1600 +
1601 ++using std::ios_base;
1602 ++
1603 + namespace
1604 + {
1605 + size_t const BUFFER_SIZE = 8192;
1606 +--- allpathslg-52488/src/system/RunTime.cc
1607 ++++ allpathslg-52488/src/system/RunTime.cc
1608 +@@ -41,6 +41,10 @@
1609 + #include <unwind.h>
1610 + #endif
1611 +
1612 ++using std::strstream;
1613 ++using std::hex;
1614 ++using std::setw;
1615 ++
1616 + /// ===========================================================================
1617 + ///
1618 + /// ReturnAddress(i), where 0 <= i <= 100: get the return address. The
1619 +--- allpathslg-52488/src/system/RunTime.h
1620 ++++ allpathslg-52488/src/system/RunTime.h
1621 +@@ -14,6 +14,8 @@
1622 + #include "system/Exit.h"
1623 + #include "system/Types.h"
1624 +
1625 ++using std::ostream;
1626 ++
1627 + typedef void ArachneSignalHandler(int, siginfo_t*, void*);
1628 +
1629 + void arachne_signal_handler( int signal_number, siginfo_t* info, void* context,
1630 +--- allpathslg-52488/src/system/System.cc
1631 ++++ allpathslg-52488/src/system/System.cc
1632 +@@ -36,6 +36,10 @@
1633 +
1634 + #include <dirent.h>
1635 +
1636 ++using std::istringstream;
1637 ++using std::istream_iterator;
1638 ++using std::ostringstream;
1639 ++
1640 + int SystemInternal( String command, const char *shell,
1641 + int* pStatus, int* pErrNo )
1642 + {
1643 +@@ -1088,7 +1092,7 @@
1644 +
1645 + bool isReadable( String const& filename )
1646 + { ifstream ifs(filename.c_str());
1647 +- return ifs; }
1648 ++ return static_cast<bool>(ifs); }
1649 +
1650 + int Glob( const String& x, vector<String>& xs )
1651 + { glob_t globbuf;
1652 +--- allpathslg-52488/src/system/System.h
1653 ++++ allpathslg-52488/src/system/System.h
1654 +@@ -21,6 +21,18 @@
1655 + #include "system/Exit.h"
1656 + #include "system/file/TempFile.h"
1657 +
1658 ++using std::vector;
1659 ++using std::ostream;
1660 ++using std::ofstream;
1661 ++using std::ifstream;
1662 ++using std::istream;
1663 ++using std::ios;
1664 ++using std::cout;
1665 ++using std::flush;
1666 ++using std::endl;
1667 ++using std::setprecision;
1668 ++using std::fixed;
1669 ++
1670 + #ifndef InputErr
1671 + #define InputErr(message) \
1672 + cout << "\nFatal error at " << Date() << ": " << message \
1673 +--- allpathslg-52488/src/system/TraceVal.h
1674 ++++ allpathslg-52488/src/system/TraceVal.h
1675 +@@ -25,6 +25,9 @@
1676 + #include "system/Assert.h"
1677 + #include "system/Exit.h"
1678 +
1679 ++using std::cout;
1680 ++using std::endl;
1681 ++
1682 + // Macros: Tracing macros
1683 + // TRACEVAL_ON - undefine if you're not doing tracing
1684 + // TRACEVAL_STOP_TRACING_COPIES -- call before an operation that shuffles
1685 +--- allpathslg-52488/src/system/Types.h
1686 ++++ allpathslg-52488/src/system/Types.h
1687 +@@ -14,7 +14,7 @@
1688 + #include <cstdlib>
1689 + #include <netinet/in.h>
1690 +
1691 +-using namespace std;
1692 ++
1693 +
1694 + // This assumes that all suns run Solaris...
1695 + #if __sun == 1
1696 +--- allpathslg-52488/src/system/WorklistUtils.cc
1697 ++++ allpathslg-52488/src/system/WorklistUtils.cc
1698 +@@ -32,6 +32,10 @@
1699 + #include <sys/resource.h>
1700 + #include <unistd.h>
1701 +
1702 ++using std::istringstream;
1703 ++using std::istream_iterator;
1704 ++using std::min;
1705 ++
1706 + namespace
1707 + {
1708 + pthread_t gMainThread;
1709 +--- allpathslg-52488/src/util/FastaParser.cc
1710 ++++ allpathslg-52488/src/util/FastaParser.cc
1711 +@@ -22,6 +22,7 @@
1712 +
1713 + using std::string;
1714 + using std::vector;
1715 ++using std::istringstream;
1716 +
1717 + char* FastaParser::readLine()
1718 + {
1719 +--- allpathslg-52488/src/util/FastaParser.h
1720 ++++ allpathslg-52488/src/util/FastaParser.h
1721 +@@ -24,6 +24,8 @@
1722 + #include <fstream>
1723 + #include <vector>
1724 +
1725 ++using std::max;
1726 ++
1727 + /// Base class for the parsers for sequence, quality, and bits which follow.
1728 + class FastaParser
1729 + {
1730 +--- allpathslg-52488/src/util/FastbStats.cc
1731 ++++ allpathslg-52488/src/util/FastbStats.cc
1732 +@@ -18,6 +18,8 @@
1733 +
1734 + #include "random/Random.h"
1735 +
1736 ++using std::map;
1737 ++
1738 + typedef VirtualMasterVec<BaseVec> VBaseVecVec;
1739 +
1740 +
1741 +--- allpathslg-52488/src/util/Happening.cc
1742 ++++ allpathslg-52488/src/util/Happening.cc
1743 +@@ -25,6 +25,8 @@
1744 + #include "FastIfstream.h"
1745 + #include "MainTools.h"
1746 +
1747 ++using std::istringstream;
1748 ++
1749 + vec<String> tracebacks;
1750 + Bool TALLYG;
1751 +
1752 +--- allpathslg-52488/src/util/MemMonitor.cc
1753 ++++ allpathslg-52488/src/util/MemMonitor.cc
1754 +@@ -21,7 +21,7 @@
1755 + #include <signal.h>
1756 + #include <time.h>
1757 +
1758 +-using namespace std;
1759 ++using std::string;
1760 +
1761 + // convertion factors between jiffies and seconds (check your system!!!)
1762 + const double sec_jif = 100.0;
1763 +--- allpathslg-52488/src/util/Quala2Qualb.cc
1764 ++++ allpathslg-52488/src/util/Quala2Qualb.cc
1765 +@@ -11,6 +11,8 @@
1766 + #include "FastIfstream.h"
1767 + #include "Qualvector.h"
1768 +
1769 ++using std::istrstream;
1770 ++
1771 + int main(int argc, char *argv[])
1772 + {
1773 + RunTime();
1774 +--- allpathslg-52488/src/util/QualbStats.cc
1775 ++++ allpathslg-52488/src/util/QualbStats.cc
1776 +@@ -20,6 +20,7 @@
1777 + #include "Qualvector.h"
1778 + #include "Basevector.h"
1779 +
1780 ++using std::scientific;
1781 +
1782 + #define NQ 256
1783 +
1784 +--- allpathslg-52488/src/util/ReadTrack.cc
1785 ++++ allpathslg-52488/src/util/ReadTrack.cc
1786 +@@ -33,6 +33,9 @@
1787 + #include "util/ReadTracker.h"
1788 + #include "util/RunCommand.h"
1789 +
1790 ++using std::map;
1791 ++using std::set;
1792 ++
1793 + // Return filename portion of path (after last slash)
1794 + String basename(const String path)
1795 + {
1796 +--- allpathslg-52488/src/util/ReadTracker.cc
1797 ++++ allpathslg-52488/src/util/ReadTracker.cc
1798 +@@ -11,6 +11,9 @@
1799 + #include "VecUtilities.h"
1800 + #include "util/ReadTracker.h"
1801 +
1802 ++using std::string;
1803 ++using std::istringstream;
1804 ++
1805 + unsigned int
1806 + ReadTracker::AddSource(String s)
1807 + {
1808 +--- allpathslg-52488/src/util/RunCommand.cc
1809 ++++ allpathslg-52488/src/util/RunCommand.cc
1810 +@@ -14,6 +14,8 @@
1811 + #include <unistd.h>
1812 + #include <sstream>
1813 +
1814 ++using std::ostringstream;
1815 ++
1816 + /**
1817 + * RunCommand
1818 + */
1819 +--- allpathslg-52488/src/util/TextTable.cc
1820 ++++ allpathslg-52488/src/util/TextTable.cc
1821 +@@ -13,6 +13,8 @@
1822 + #include <sstream>
1823 + #include <iterator>
1824 +
1825 ++using std::max;
1826 ++
1827 + vec<vec<String> > TextTable::GetTable( ) const {
1828 + vec<vec<String> > table;
1829 + for ( size_t i = 0; i < lines.size(); ++i ) {
1830 +--- allpathslg-52488/src/util/TextTable.h
1831 ++++ allpathslg-52488/src/util/TextTable.h
1832 +@@ -33,6 +33,8 @@
1833 + #include "Vec.h"
1834 + #include "feudal/TrackingAllocator.h"
1835 +
1836 ++using std::string;
1837 ++
1838 + class TextTable {
1839 + public:
1840 + // == Special types to draw line and manipulate tables ==
1841 +--- allpathslg-52488/src/Vec.h
1842 ++++ allpathslg-52488/src/Vec.h
1843 +@@ -50,6 +50,11 @@
1844 + #include "Compare.h"
1845 + #include "system/file/FileReader.h"
1846 +
1847 ++using std::numeric_limits;
1848 ++using std::ostream_iterator;
1849 ++using std::setfill;
1850 ++using std::setw;
1851 ++
1852 + /////////////////////////////////////////////////////////////////////////////
1853 + //
1854 + // vec Class Declaration and Template Definitions
1855 +--- allpathslg-52488/src/VecOverlap.cc
1856 ++++ allpathslg-52488/src/VecOverlap.cc
1857 +@@ -12,6 +12,9 @@
1858 + #include "STLExtensions.h"
1859 + #include <numeric>
1860 +
1861 ++using std::max;
1862 ++using std::make_pair;
1863 ++
1864 + // Represents the suffix of the index'th word starting at the pos'th
1865 + // character.
1866 + template <class T>
1867 +--- allpathslg-52488/src/VecUtilities.h
1868 ++++ allpathslg-52488/src/VecUtilities.h
1869 +@@ -37,6 +37,9 @@
1870 + #include "Vec.h"
1871 + #include <cstddef>
1872 +
1873 ++using std::less;
1874 ++using std::equal_to;
1875 ++using std::greater;
1876 +
1877 + /////////////////////////////////////////////////////////////////////////////
1878 + //