SDSL 3.0.3
Succinct Data Structure Library
Loading...
Searching...
No Matches
qsufsort.hpp File Reference

qsufsort.hpp contains the interface for the suffix array construction algorithm of Larsson. More...

#include <algorithm>
#include <assert.h>
#include <iostream>
#include <memory>
#include <stdexcept>
#include <stdint.h>
#include <typeinfo>
#include <sdsl/bits.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/io.hpp>
#include <sdsl/util.hpp>

Go to the source code of this file.

Classes

class  sdsl::qsufsort::sorter< int_vector_type >
 

Namespaces

namespace  sdsl
 Namespace for the succinct data structure library.
 
namespace  sdsl::qsufsort
 

Macros

#define DBG_OUT
 

Functions

template<class int_vector_type>
void sdsl::qsufsort::construct_sa (int_vector_type &sa, char const *file, uint8_t num_bytes)
 Construct a suffix array for the sequence stored in a file.
 
template<class int_vector_type, class t_vec>
void sdsl::qsufsort::construct_sa (int_vector_type &sa, t_vec &text)
 

Detailed Description

qsufsort.hpp contains the interface for the suffix array construction algorithm of Larsson.

Larssons code was downloaded from http://www.larsson.dogma.net/qsufsort.c and adapted to the use of sdsl bitvectors.

Author
Simon Gog

Definition in file qsufsort.hpp.

Macro Definition Documentation

◆ DBG_OUT

#define DBG_OUT
Value:
if (0) \
std::cout

Definition at line 26 of file qsufsort.hpp.