#include <me_factory.hpp>
|
static const int | unset = std::numeric_limits<int>::min() |
|
vdj_pipe::match::Element_proto::Element_proto |
( |
bpt::ptree const & |
pt, |
|
|
Input_manager const & |
in |
|
) |
| |
void vdj_pipe::match::Element_proto::parse_csv_file |
( |
bpt::ptree const & |
pt, |
|
|
Input_manager const & |
in |
|
) |
| |
void vdj_pipe::match::Element_proto::parse_position |
( |
bpt::ptree const & |
pt | ) |
|
Truncate vdj_pipe::match::Element_proto::truncation |
( |
| ) |
const |
|
inline |
bool vdj_pipe::match::Element_proto::allow_gaps_ |
Cut_proto vdj_pipe::match::Element_proto::cut_lo_ |
Cut_proto vdj_pipe::match::Element_proto::cut_up_ |
std::string vdj_pipe::match::Element_proto::identity_name_ |
bool vdj_pipe::match::Element_proto::ignore_dups_ |
ignore duplicate sequences for short matches
boost::optional<int> vdj_pipe::match::Element_proto::len_ |
boost::optional<unsigned> vdj_pipe::match::Element_proto::min_match_length_ |
boost::optional<int> vdj_pipe::match::Element_proto::min_score_ |
std::string vdj_pipe::match::Element_proto::name_ |
boost::optional<int> vdj_pipe::match::Element_proto::pos_ |
std::string vdj_pipe::match::Element_proto::re_name_ |
bool vdj_pipe::match::Element_proto::re_start_ |
bool vdj_pipe::match::Element_proto::require_best_ |
bool vdj_pipe::match::Element_proto::required_ |
std::string vdj_pipe::match::Element_proto::score_name_ |
bool vdj_pipe::match::Element_proto::start_defined_ |
bool vdj_pipe::match::Element_proto::track_mismatches_ |
interpret min_score_ as maximum number of mismatches
const int vdj_pipe::match::Element_proto::unset = std::numeric_limits<int>::min() |
|
static |
std::string vdj_pipe::match::Element_proto::value_name_ |
The documentation for this struct was generated from the following files: