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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
//
// $Id$
//
//
// Original author: Matt Chambers <matt.chambers .@. vanderbilt.edu>
//
// Copyright 2008 Spielberg Family Center for Applied Proteomics
// Cedars Sinai Medical Center, Los Angeles, California 90048
// Copyright 2008 Vanderbilt University - Nashville, TN 37232
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
#ifndef _CONTAINER_HPP_
#define _CONTAINER_HPP_
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <algorithm>
#include <numeric>
#include <utility>
#include <boost/foreach.hpp>
using std::vector;
using std::list;
using std::map;
using std::multimap;
using std::set;
using std::multiset;
using std::deque;
using std::stack;
using std::pair;
using std::make_pair;
using std::find;
using std::find_end;
using std::find_first_of;
using std::find_if;
using std::remove;
using std::remove_copy;
using std::remove_copy_if;
using std::remove_if;
using std::replace;
using std::replace_copy;
using std::replace_copy_if;
using std::replace_if;
using std::for_each;
using std::transform;
using std::accumulate;
using std::sort;
using std::stable_sort;
using std::binary_search;
using std::adjacent_find;
using std::equal_range;
using std::lower_bound;
using std::upper_bound;
#ifndef PWIZ_CONFIG_NO_CONTAINER_OUTPUT_OPERATORS
// output operators for standard containers
namespace std
{
template<typename T1, typename T2>
ostream& operator<< (ostream& o, const pair<T1, T2>& p)
{
return (o << "( " << p.first << ", " << p.second << " )");
}
template<typename T>
ostream& operator<< (ostream& o, const vector<T>& v)
{
o << "(";
for(const auto& i : v)
o << " " << i;
o << " )";
return o;
}
template<typename T, typename P>
ostream& operator<< (ostream& o, const set< T, P >& s)
{
o << "(";
for (const auto& i : s)
o << " " << i;
o << " )";
return o;
}
inline ostream& operator<< (ostream& o, const map< string, string >& m)
{
o << "(";
for (const auto& p : m)
o << " \"" << p.first << "\"->\"" << p.second << "\"";
o << " )";
return o;
}
template<typename KeyT>
ostream& operator<< (ostream& o, const map< KeyT, string >& m)
{
o << "(";
for (const auto& p : m)
o << " " << p.first << "->\"" << p.second << "\"";
o << " )";
return o;
}
template<typename ValueT>
ostream& operator<< (ostream& o, const map< string, ValueT >& m)
{
o << "(";
for (const auto& p : m)
o << " \"" << p.first << "\"->" << p.second << "";
o << " )";
return o;
}
template<typename KeyT, typename ValueT>
ostream& operator<< (ostream& o, const map< KeyT, ValueT >& m)
{
o << "(";
for (const auto& p : m)
o << " " << p.first << "->" << p.second << "";
o << " )";
return o;
}
}
#endif // PWIZ_CONFIG_NO_CONTAINER_OUTPUT_OPERATORS
#endif // _CONTAINER_HPP_
|
