Container.hpp

Go to the documentation of this file.

//
// $Id: Container.hpp 2051 2010-06-15 18:39:13Z chambm $
//
//
// 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.
//

#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;