// ==========================================================================
//                 SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2010, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of Knut Reinert or the FU Berlin nor the names of
//       its contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
// Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>
// ==========================================================================
// This is the facade header for the synopsis module.
// ==========================================================================

#ifndef SEQAN_SYNOPSIS_H_
#define SEQAN_SYNOPSIS_H_

// ==========================================================================
// Prerequisites
// ==========================================================================

#include <seqan/basic.h>
#include <seqan/sequence.h>

// Make the unordered map template available in the std::tr1 namespace.
#if TR1_UNORDERED_MAP_FOUND
  #if TR1_UNORDERED_MAP_USE_TR1_UNORDERED_MAP
    #include <tr1/unordered_map>
  #elif TR1_UNORDERED_MAP_USE_UNORDERED_MAP && !TR1_UNORDERED_MAP_USE_TR1_UNORDERED_MAP
    #include <unordered_map>
  #elif Boost_FOUND
    #include <boost/unordered_map.hpp>
    namespace std { namespace tr1 {
      using boost::UNORDERED_MAP;
    } }
  #else  // #if TR1_UNORDERED_MAP_USE_TR1_UNORDERED_MAP
    #error unordered_map implementation required for using module synopsis!
  #endif  // #if TR1_UNORDERED_MAP_USE_TR1_UNORDERED_MAP
#endif  // #if TR1_UNORDERED_MAP_FOUND

// ==========================================================================
// Support Code
// ==========================================================================

// Data structure that allows fast access to the buckets with smallest label.
#include <seqan/synopsis/counter_buckets.h>

// ==========================================================================
// Hot List Data Structures
// ==========================================================================

#include <seqan/synopsis/hot_list_base.h>
#include <seqan/synopsis/hot_list_frequent.h>
#include <seqan/synopsis/hot_list_lossy_counting.h>
#include <seqan/synopsis/hot_list_space_saving.h>

// ==========================================================================
// Histogram Data Structures
// ==========================================================================

#include <seqan/synopsis/histogram_set.h>

#endif  // SEQAN_SCORE_H_