/usr/include/seqan/index.h is in seqan-dev 1.4.1+dfsg-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 | // ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2013, 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.
//
// ==========================================================================
#ifndef SEQAN_HEADER_INDEX_H
#define SEQAN_HEADER_INDEX_H
//____________________________________________________________________________
// prerequisites
#include <seqan/sequence.h>
#include <seqan/pipe.h>
#include <seqan/modifier.h>
#include <seqan/parallel.h>
#include <seqan/find.h>
#include <seqan/misc/misc_set.h>
#include <seqan/misc/misc_memset.h>
#include <climits>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
#include <utility>
#include <cmath> // isnan, isinf
#include <string.h> // memset
//////////////////////////////////////////////////////////////////////////////
// INDEX CONSTRUCTION
//////////////////////////////////////////////////////////////////////////////
#include <seqan/index/index_forwards.h>
#ifdef SEQAN_PARALLEL
#include <seqan/parallel.h>
#endif // #ifdef SEQAN_PARALLEL
#include <seqan/index/index_base.h>
//____________________________________________________________________________
// q-gram index creator
#include <seqan/index/shape_base.h>
#include <seqan/index/shape_gapped.h>
#include <seqan/index/shape_onegapped.h>
#include <seqan/index/shape_predefined.h>
#include <seqan/index/shape_threshold.h>
#include <seqan/index/index_qgram.h>
#include <seqan/index/index_qgram_openaddressing.h>
//#include <seqan/index/index_qgram_nested.h>
//____________________________________________________________________________
// suffix array creators
#include <seqan/index/radix.h>
#include <seqan/index/index_sa_btree.h>
#include <seqan/index/index_sa_lss.h>
#include <seqan/index/index_sa_mm.h>
#include <seqan/index/index_sa_qsort.h>
#include <seqan/index/index_sa_bwtwalk.h>
#include <seqan/index/pump_extender3.h>
#include <seqan/index/pipe_merger3.h>
#include <seqan/index/index_skew3.h>
#include <seqan/index/pump_extender7.h>
#include <seqan/index/pipe_merger7.h>
#include <seqan/index/index_skew7.h>
#include <seqan/index/pump_separator7.h>
#include <seqan/index/index_skew7_multi.h>
//____________________________________________________________________________
// enhanced table creators
#include <seqan/index/pump_lcp_core.h>
#include <seqan/index/index_lcp.h>
#include <seqan/index/index_lcp_tree.h>
#include <seqan/index/index_childtab.h>
#include <seqan/index/index_bwt.h>
//////////////////////////////////////////////////////////////////////////////
// INDEX USAGE
//////////////////////////////////////////////////////////////////////////////
#include <seqan/index/index_shims.h>
//____________________________________________________________________________
// (virtual) string trees
#include <seqan/index/index_esa_base.h>
#include <seqan/index/index_esa_stree.h>
#include <seqan/index/index_wotd.h>
#include <seqan/index/index_dfi.h>
//____________________________________________________________________________
// suffix tree algorithms
#include <seqan/index/index_esa_algs.h>
#include <seqan/index/index_esa_algs_multi.h>
#include <seqan/index/index_esa_drawing.h>
#include <seqan/index/repeat_base.h>
//____________________________________________________________________________
// Pizza & Chili interface (compressed indices)
#include <seqan/index/index_pizzachili.h>
#include <seqan/index/index_pizzachili_find.h>
//____________________________________________________________________________
// Shawarma interface (suffix array creators)
#include <seqan/index/index_shawarma.h>
//////////////////////////////////////////////////////////////////////////////
// FINDER INTERFACE
//////////////////////////////////////////////////////////////////////////////
//____________________________________________________________________________
// index based finders
#include <seqan/index/find_index_esa.h>
#include <seqan/index/find_index_approx.h>
#include <seqan/index/find_index_qgram.h>
#include <seqan/index/find_index.h>
#include <seqan/index/find_quasar.h>
#include <seqan/index/find_swift.h>
//////////////////////////////////////////////////////////////////////////////
// FM INDEX
//////////////////////////////////////////////////////////////////////////////
#include <seqan/index/index_fm_rank_support_bit_string.h>
#include <seqan/index/index_fm_rank_support_bit_string_iterator.h>
#include <seqan/index/index_fm_sparse_string.h>
#include <seqan/index/index_fm_compressed_sa.h>
#include <seqan/index/index_fm_compressed_sa_iterator.h>
#include <seqan/index/index_fm_prefix_sum_table.h>
#include <seqan/index/index_fm_right_array_binary_tree.h>
#include <seqan/index/index_fm_right_array_binary_tree_iterator.h>
// #include <seqan/index/index_fm_wavelet_tree.h>
#include <seqan/index/index_fm_rank_dictionary_wt.h>
#include <seqan/index/index_fm_rank_dictionary_bms.h>
#include <seqan/index/index_fm_sentinel_rank_dictionary.h>
#include <seqan/index/index_fm_lf_table.h>
#include <seqan/index/index_fm.h>
#include <seqan/index/index_fm_stree.h>
#endif //#ifndef SEQAN_HEADER_...
|