stdmap.h

Go to the documentation of this file.

//# stdmap.h: Interim solution for standard/nonstandard system map
//# Copyright (C) 2001,2002,2004
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//#        Internet email: aips2-request@nrao.edu.
//#        Postal address: AIPS++ Project Office
//#                        National Radio Astronomy Observatory
//#                        520 Edgemont Road
//#                        Charlottesville, VA 22903-2475 USA
//#
//# $Id: stdmap.h 20551 2009-03-25 00:11:33Z Malte.Marquarding $

#ifndef CASA_STDMAP_H
#define CASA_STDMAP_H

//# Define the C standard C++ include file. 
//# This is an interim solution to cater for the SGI non-existence of
//# them (e.g. <cstring>)
//# Make sure any special macros are set
#include <casa/aips.h>

#include <map>


using std::map;
using std::multimap;
using std::pair;
using std::allocator;
using std::less;

//# A special macro to create the auxilliary template definitions for
//# various compilers
//# Use if defined a map<T, U> as AIPS_MAP_AUX_TEMPLATES(T, U)

#if defined(AIPS_MAP_AUX_TEMPLATES)
#undef AIPS_MAP_AUX_TEMPLATES
#endif

#if !defined(AIPS_AUTO_STL)
# if defined(AIPS_GCC)
#  if defined(AIPS_GCC3) || defined(AIPS_GCC4)
#   define AIPS_MAP_AUX_TEMPLATES(T, U) \
template class \
  std::_Rb_tree<T, std::pair<T const, U >, \
  std::_Select1st<std::pair<T const, U> >, \
  std::less<T>, std::allocator<U > >; \
template class \
  std::_Rb_tree<T, std::pair<T const, U >, \
  std::_Select1st<std::pair<T const, U> >, \
  std::less<T>, std::allocator<pair<T const, U > > >;
#  else
#   define AIPS_MAP_AUX_TEMPLATES(T, U) \
template class \
  _Rb_tree<T, pair<T const, U >, \
  _Select1st<pair<T const, U> >, \
  less<T>, allocator<U > >;
#  endif
# else
#  if defined(AIPS_SUN_NATIVE)
#   define AIPS_MAP_AUX_TEMPLATES(T, U) \
template class \
  __rwstd::__rb_tree<T, pair<T const, U >, \
  __rwstd::__select1st<pair<T const, U>, T  >, \
  std::less<T>, allocator<pair<T const, U> > >; \
template void std::__distance<\
  map<T, U>::iterator, uInt> (map<T, U>::iterator, map<T, U>::iterator, uInt&, std::bidirectional_iterator_tag);\
template void std::__distance<\
  map<T, U>::const_iterator, uInt> (map<T, U>::const_iterator, map<T, U>::const_iterator, uInt&, std::bidirectional_iterator_tag);
#  else
#   define AIPS_MAP_AUX_TEMPLATES(T, U)
#  endif
# endif
# else
#  define AIPS_MAP_AUX_TEMPLATES(T, U)
#endif


#endif