sdsl/include/sdsl/test_index_performance.hpp File Reference

test_index_performance.hpp contains a set of functions which test the speed of operations of compressed suffix arrays and compressed suffix trees More...

#include "int_vector.hpp"
#include "testutils.hpp"
#include "util.hpp"
#include "algorithms.hpp"
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <iostream>

Go to the source code of this file.

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.
Functions
int_vector< 64 >	sdsl::get_rnd_positions (uint8_t log_s, uint64_t &mask, uint64_t m=0, uint64_t x=17)
	Create 1^{log_s} random intergers mod m with seed x.
template<class Vector >
void	sdsl::test_int_vector_random_access (const Vector &v, bit_vector::size_type times=100000000)
template<class Vector >
void	sdsl::test_int_vector_random_write (Vector &v, bit_vector::size_type times=100000000)
template<class Vector >
void	sdsl::test_int_vector_sequential_write (Vector &v, bit_vector::size_type times=100000000)
template<class Rank >
void	sdsl::test_rank_random_access (const Rank &rank, bit_vector::size_type times=20000000)
	Test random queries on rank data structure.
template<class Rank >
void	sdsl::test_rank_construction (bit_vector::size_type size=838860800)
	Test creation time for a rank data structure.
template<class Select >
void	sdsl::test_select_random_access (const Select &select, bit_vector::size_type times=20000000)
	Test random queries on select data structure.
template<class Select >
void	sdsl::test_select_random_access (const Select &select, bit_vector::size_type args, bit_vector::size_type times)
	Test random queries on select data structure.
template<class Select >
void	sdsl::test_select_construction (bit_vector::size_type size=838860800)
	Test creation time for a rank data structure.
template<class Csa >
void	sdsl::test_csa_access (const Csa &csa, typename Csa::size_type times=1000000)
template<class Csa >
void	sdsl::test_icsa_access (const Csa &csa, typename Csa::size_type times=1000000)
template<class Csa >
void	sdsl::test_psi_access (const Csa &csa, typename Csa::size_type times=1000000)
template<class Csa >
void	sdsl::test_lf_access (const Csa &csa, typename Csa::size_type times=1000000)
	Test random access on LF function.
template<class Csa >
void	sdsl::test_bwt_access (const Csa &csa, typename Csa::size_type times=1000000)
	Test random access on bwt.
template<class Csa >
void	sdsl::test_pattern_matching (const Csa &csa, const char *file_name, const typename Csa::size_type pattern_len=20, typename Csa::size_type times=1000000)
	Test speed for pattern matching.
template<class Csa >
void	sdsl::test_rank_bwt_access (const Csa &csa, typename Csa::size_type times=1000000)
template<class Csa >
void	sdsl::test_select_bwt_access (const Csa &csa, typename Csa::size_type times=500000)
template<class Cst >
void	sdsl::test_cst_dfs_iterator (Cst &cst, typename Cst::size_type times=100000)
	Test performance of the depth first iterator of a CST.
template<class Cst >
void	sdsl::test_cst_dfs_iterator_and_depth (Cst &cst, typename Cst::size_type times=1000000, bool output=false)
	Test performance of the depth first iterator and the LCP array of a CST.
template<class Cst >
void	sdsl::test_cst_dfs_iterator_and_id (Cst &cst, typename Cst::size_type times=1000000, bool output=false)
	Test performance of the depth first iterator and the id method of the CST.
template<class Lcp >
void	sdsl::test_lcp_random_access (Lcp &lcp, typename Lcp::size_type times=10000000)
	Make random accesse to an LCP array.
template<class Lcp >
void	sdsl::test_lcp_sequential_access (Lcp &lcp, typename Lcp::size_type times=10000000)
	Make sequential accesses to an LCP array.
template<class Lcp >
void	sdsl::test_lcp_random_sequential_access (Lcp &lcp, typename Lcp::size_type times=1000000, typename Lcp::size_type seq_len=64)
	Make random sequential accesse to an LCP array.
template<class Cst >
void	sdsl::test_cst_parent_operation (const Cst &cst, typename Cst::size_type times=100000, uint64_t x=17)
	Test the speed of the parent operation.
template<class Cst >
void	sdsl::generate_nodes_from_random_leaves (const Cst &cst, typename Cst::size_type times, std::vector< typename Cst::node_type > &nodes, uint64_t x=17)
	Generate nodes of a cst by applying the child operation to each of random leaves until we get to the root.
template<class Cst >
void	sdsl::test_cst_child_operation (const Cst &cst, typename Cst::size_type times=5000, uint64_t x=17)
	Test the speed of the child operation.
template<class Cst >
void	sdsl::test_cst_1th_child_operation (const Cst &cst, typename Cst::size_type times=1000000, uint64_t x=17)
	Test the speed of the 1th_child operation.
template<class Cst >
void	sdsl::test_cst_sibling_operation (const Cst &cst, typename Cst::size_type times=100000, uint64_t x=17)
	Test the speed of the sibling operation.
template<class Cst >
void	sdsl::test_cst_id_operation (const Cst &cst, typename Cst::size_type times=100000, uint64_t x=17)
	Test id operation.
template<class Cst >
void	sdsl::test_cst_depth_operation (const Cst &cst, typename Cst::size_type times=100000, uint64_t x=17)
	Test depth operations for leaves and inner nodes.
template<class Cst >
void	sdsl::test_cst_depth_operation_for_inner_nodes (const Cst &cst, typename Cst::size_type times=100000, uint64_t x=17)
	Test depth operations for inner nodes.
template<class Cst >
void	sdsl::test_cst_lca_operation (const Cst &cst, typename Cst::size_type times=1000000, uint64_t x=17)
	Test lca operation.
template<class Cst >
void	sdsl::test_cst_sl_operation (const Cst &cst, typename Cst::size_type times=500, uint64_t x=17)
	Test suffix link operation.
template<class Cst >
void	sdsl::test_cst_matching_statistics (const Cst &cst, unsigned char *S2, typename Cst::size_type n2)
	Test matching statistics.
template<class Bps >
void	sdsl::test_bps_find_close_and_enclose (const Bps &bps, const bit_vector &b, uint64_t times=10000000, uint64_t x=17)
template<class Bps >
void	sdsl::test_bps_find_open (const Bps &bps, const bit_vector &b, uint64_t times=10000000, uint64_t x=17)
template<class Bps >
void	sdsl::test_bps_double_enclose (const Bps &bps, const bit_vector &b, uint64_t times=10000000, uint64_t x=17)

---

Detailed Description

test_index_performance.hpp contains a set of functions which test the speed of operations of compressed suffix arrays and compressed suffix trees

Author:

Simon Gog