/// @file htslib/synced_bcf_reader.h
/// Stream through multiple VCF files.
/*
    Copyright (C) 2012-2017, 2019-2020 Genome Research Ltd.

    Author: Petr Danecek <pd3@sanger.ac.uk>

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.  */

/*
    The synced_bcf_reader allows to keep multiple VCFs open and stream them
    using the next_line iterator in a seamless matter without worrying about
    chromosomes and synchronizing the sites. This is used by vcfcheck to
    compare multiple VCFs simultaneously and is used also for merging,
    creating intersections, etc.

    The synced_bcf_reader also provides API for reading indexed BCF/VCF,
    hiding differences in BCF/VCF opening, indexing and reading.


    Example of usage:

        bcf_srs_t *sr = bcf_sr_init();
        bcf_sr_set_opt(sr, BCF_SR_PAIR_LOGIC, BCF_SR_PAIR_BOTH_REF);
        bcf_sr_set_opt(sr, BCF_SR_REQUIRE_IDX);
        for (i=0; i<nfiles; i++)
            bcf_sr_add_reader(sr,files[i]);
        while ( bcf_sr_next_line(sr) )
        {
            for (i=0; i<nfiles; i++)
            {
                bcf1_t *line = bcf_sr_get_line(sr,i);
                ...
            }
        }
        if ( sr->errnum ) error("Error: %s\n", bcf_sr_strerror(sr->errnum));
        bcf_sr_destroy(sr);
*/
module htslib.synced_bcf_reader;

import core.stdc.stddef;

import htslib.hts;
import htslib.vcf;
import htslib.kstring : kstring_t;
import htslib.tbx : tbx_t;

@system:
nothrow:
@nogc:

extern (C):

/*
    When reading multiple files in parallel, duplicate records within each
    file will be reordered and offered in intuitive order. For example,
    when reading two files, each with unsorted SNP and indel record, the
    reader should return the SNP records together and the indel records
    together. The logic of compatible records can vary depending on the
    application and can be set using the PAIR_* defined below.

    The COLLAPSE_* definitions will be deprecated in future versions, please
    use the PAIR_* definitions instead.
*/
enum COLLAPSE_NONE = 0; // require the exact same set of alleles in all files
enum COLLAPSE_SNPS = 1; // allow different alleles, as long as they all are SNPs
enum COLLAPSE_INDELS = 2; // the same as above, but with indels
enum COLLAPSE_ANY = 4; // any combination of alleles can be returned by bcf_sr_next_line()
enum COLLAPSE_SOME = 8; // at least some of the ALTs must match
enum COLLAPSE_BOTH = COLLAPSE_SNPS | COLLAPSE_INDELS;

enum BCF_SR_PAIR_SNPS = 1 << 0; // allow different alleles, as long as they all are SNPs
enum BCF_SR_PAIR_INDELS = 1 << 1; // the same as above, but with indels
enum BCF_SR_PAIR_ANY = 1 << 2; // any combination of alleles can be returned by bcf_sr_next_line()
enum BCF_SR_PAIR_SOME = 1 << 3; // at least some of multiallelic ALTs must match. Implied by all the others with the exception of EXACT
enum BCF_SR_PAIR_SNP_REF = 1 << 4; // allow REF-only records with SNPs
enum BCF_SR_PAIR_INDEL_REF = 1 << 5; // allow REF-only records with indels
enum BCF_SR_PAIR_EXACT = 1 << 6; // require the exact same set of alleles in all files
enum BCF_SR_PAIR_BOTH = BCF_SR_PAIR_SNPS | BCF_SR_PAIR_INDELS;
enum BCF_SR_PAIR_BOTH_REF = BCF_SR_PAIR_SNPS | BCF_SR_PAIR_INDELS | BCF_SR_PAIR_SNP_REF | BCF_SR_PAIR_INDEL_REF;

enum bcf_sr_opt_t
{
    BCF_SR_REQUIRE_IDX = 0,
    BCF_SR_PAIR_LOGIC = 1, // combination of the PAIR_* values above
    BCF_SR_ALLOW_NO_IDX = 2 // allow to proceed even if required index is not present (at the user's risk)
}

struct bcf_sr_region_t;

struct bcf_sr_regions_t
{
    // for reading from tabix-indexed file (big data)
    tbx_t* tbx; // tabix index
    hts_itr_t* itr; // tabix iterator
    kstring_t line; // holder of the current line, set only when reading from tabix-indexed files
    htsFile* file;
    char* fname;
    int is_bin; // is open in binary mode (tabix access)
    char** als; // parsed alleles if targets_als set and _regions_match_alleles called
    kstring_t als_str; // block of parsed alleles
    int nals;
    int mals; // number of set alleles and the size of allocated array
    int als_type; // alleles type, currently VCF_SNP or VCF_INDEL

    // user handler to deal with skipped regions without a counterpart in VCFs
    void function(bcf_sr_regions_t*, void*) missed_reg_handler;
    void* missed_reg_data;

    // for in-memory regions (small data)
    bcf_sr_region_t* regs; // the regions

    // shared by both tabix-index and in-memory regions
    void* seq_hash; // keys: sequence names, values: index to seqs
    char** seq_names; // sequence names
    int nseqs; // number of sequences (chromosomes) in the file
    int iseq; // current position: chr name, index to snames
    hts_pos_t start;
    hts_pos_t end; // current position: start, end of the region (0-based)
    int prev_seq;
    hts_pos_t prev_start;
    hts_pos_t prev_end;
}

struct bcf_sr_t
{
    htsFile* file;
    tbx_t* tbx_idx;
    hts_idx_t* bcf_idx;
    bcf_hdr_t* header;
    hts_itr_t* itr;
    char* fname;
    bcf1_t** buffer; // cached VCF records. First is the current record synced across the reader
    int nbuffer;
    int mbuffer; // number of cached records (including the current record); number of allocated records
    int nfilter_ids;
    int* filter_ids; // -1 for ".", otherwise filter id as returned by bcf_hdr_id2int
    int* samples;
    int n_smpl; // list of columns in the order consistent with bcf_srs_t.samples
}

enum bcf_sr_error
{
    open_failed = 0,
    not_bgzf = 1,
    idx_load_failed = 2,
    file_type_error = 3,
    api_usage_error = 4,
    header_error = 5,
    no_eof = 6,
    no_memory = 7,
    vcf_parse_error = 8,
    bcf_read_error = 9,
    noidx_error = 10
}

struct bcf_srs_t
{
    // Parameters controlling the logic
    int collapse; // Do not access directly, use bcf_sr_set_pairing_logic() instead
    char* apply_filters; // If set, sites where none of the FILTER strings is listed
    // will be skipped. Active only at the time of
    // initialization, that is during the add_reader()
    // calls. Therefore, each reader can be initialized with different
    // filters.
    int require_index; // Some tools do not need random access
    int max_unpack; // When reading VCFs and knowing some fields will not be needed, boost performance of vcf_parse1
    int* has_line; // Corresponds to return value of bcf_sr_next_line but is not limited by sizeof(int). Use bcf_sr_has_line macro to query.
    bcf_sr_error errnum;

    // Auxiliary data
    bcf_sr_t* readers;
    int nreaders;
    int streaming; // reading mode: index-jumping or streaming
    int explicit_regs; // was the list of regions se by bcf_sr_set_regions or guessed from tabix index?
    char** samples; // List of samples
    bcf_sr_regions_t* regions;
    bcf_sr_regions_t* targets; // see bcf_sr_set_[targets|regions] for description
    int targets_als; // subset to targets not only by position but also by alleles?
    int targets_exclude;
    kstring_t tmps;
    int n_smpl;

    int n_threads; // Simple multi-threaded decoding / encoding.
    htsThreadPool* p; // Our pool, but it can be used by others if needed.
    void* aux; // Opaque auxiliary data
}

/** Allocate and initialize a bcf_srs_t struct.
 *
 *  The bcf_srs_t struct returned by a successful call should be freed
 *  via bcf_sr_destroy() when it is no longer needed.
 */
bcf_srs_t* bcf_sr_init();

/** Destroy a bcf_srs_t struct */
void bcf_sr_destroy(bcf_srs_t* readers);

char* bcf_sr_strerror(int errnum);

int bcf_sr_set_opt(bcf_srs_t* readers, bcf_sr_opt_t opt, ...);

/**
 * bcf_sr_set_threads() - allocates a thread-pool for use by the synced reader.
 * @n_threads: size of thread pool
 *
 * Returns 0 if the call succeeded, or <0 on error.
 */
int bcf_sr_set_threads(bcf_srs_t* files, int n_threads);

/** Deallocates thread memory, if owned by us. */
void bcf_sr_destroy_threads(bcf_srs_t* files);

/**
 *  bcf_sr_add_reader() - open new reader
 *  @readers: holder of the open readers
 *  @fname:   the VCF file
 *
 *  Returns 1 if the call succeeded, or 0 on error.
 *
 *  See also the bcf_srs_t data structure for parameters controlling
 *  the reader's logic.
 */
int bcf_sr_add_reader(bcf_srs_t* readers, const(char)* fname);

void bcf_sr_remove_reader(bcf_srs_t* files, int i);

/**
 * bcf_sr_next_line() - the iterator
 * @readers:    holder of the open readers
 *
 * Returns the number of readers which have the current line
 * (bcf_sr_t.buffer[0]) set at this position. Use the bcf_sr_has_line macro to
 * determine which of the readers are set.
 */
int bcf_sr_next_line(bcf_srs_t* readers);

extern (D) auto bcf_sr_has_line(T0, T1)(auto ref T0 readers, auto ref T1 i)
{
    return readers.has_line[i];
}

extern (D) auto bcf_sr_get_line(T0, T1)(auto ref T0 _readers, auto ref T1 i)
{
    return _readers.has_line[i] ? (_readers.readers[i].buffer[0]) : cast(bcf1_t*) NULL;
}

extern (D) int bcf_sr_region_done(T0, T1)(auto ref T0 _readers, auto ref T1 i)
{
    return !_readers.has_line[i] && !_readers.readers[i].nbuffer ? 1 : 0;
}

extern (D) auto bcf_sr_get_header(T0, T1)(auto ref T0 _readers, auto ref T1 i)
{
    return _readers.readers[i].header;
}

extern (D) auto bcf_sr_get_reader(T0, T1)(auto ref T0 _readers, auto ref T1 i)
{
    return &(_readers.readers[i]);
}

/**
 *  bcf_sr_seek() - set all readers to selected position
 *  @seq:  sequence name; NULL to seek to start
 *  @pos:  0-based coordinate
 */
int bcf_sr_seek(bcf_srs_t* readers, const(char)* seq, hts_pos_t pos);

/**
 * bcf_sr_set_samples() - sets active samples
 * @readers: holder of the open readers
 * @samples: this can be one of: file name with one sample per line;
 *           or column-separated list of samples; or '-' for a list of
 *           samples shared by all files. If first character is the
 *           exclamation mark, all but the listed samples are included.
 * @is_file: 0: list of samples; 1: file with sample names
 *
 * Returns 1 if the call succeeded, or 0 on error.
 */
int bcf_sr_set_samples(bcf_srs_t* readers, const(char)* samples, int is_file);

/**
 *  bcf_sr_set_targets(), bcf_sr_set_regions() - init targets/regions
 *  @readers:   holder of the open readers
 *  @targets:   list of regions, one-based and inclusive.
 *  @is_fname:  0: targets is a comma-separated list of regions (chr,chr:from-to)
 *              1: targets is a tabix indexed file with a list of regions
 *              (<chr,pos> or <chr,from,to>)
 *
 *  Returns 0 if the call succeeded, or -1 on error.
 *
 *  Both functions behave the same way, unlisted positions will be skipped by
 *  bcf_sr_next_line(). However, there is an important difference: regions use
 *  index to jump to desired positions while targets streams the whole files
 *  and merely skip unlisted positions.
 *
 *  Moreover, bcf_sr_set_targets() accepts an optional parameter $alleles which
 *  is interpreted as a 1-based column index in the tab-delimited file where
 *  alleles are listed. This in principle enables to perform the COLLAPSE_*
 *  logic also with tab-delimited files. However, the current implementation
 *  considers the alleles merely as a suggestion for prioritizing one of possibly
 *  duplicate VCF lines. It is up to the caller to examine targets->als if
 *  perfect match is sought after. Note that the duplicate positions in targets
 *  file are currently not supported.
 *  Targets (but not regions) can be prefixed with "^" to request logical complement,
 *  for example "^X,Y,MT" indicates that sequences X, Y and MT should be skipped.
 *
 *  API note: bcf_sr_set_regions/bcf_sr_set_targets MUST be called before the
 *  first call to bcf_sr_add_reader().
 */
int bcf_sr_set_targets(
    bcf_srs_t* readers,
    const(char)* targets,
    int is_file,
    int alleles);

int bcf_sr_set_regions(bcf_srs_t* readers, const(char)* regions, int is_file);

/*
 *  bcf_sr_regions_init()
 *  @regions:   regions can be either a comma-separated list of regions
 *              (chr|chr:pos|chr:from-to|chr:from-) or VCF, BED, or
 *              tab-delimited file (the default). Uncompressed files
 *              are stored in memory while bgzip-compressed and tabix-indexed
 *              region files are streamed.
 *  @is_file:   0: regions is a comma-separated list of regions
 *                  (chr|chr:pos|chr:from-to|chr:from-)
 *              1: VCF, BED or tab-delimited file
 *  @chr, from, to:
 *              Column indexes of chromosome, start position and end position
 *              in the tab-delimited file. The positions are 1-based and
 *              inclusive.
 *              These parameters are ignored when reading from VCF, BED or
 *              tabix-indexed files. When end position column is not present,
 *              supply 'from' in place of 'to'. When 'to' is negative, first
 *              abs(to) will be attempted and if that fails, 'from' will be used
 *              instead.
 *
 *  The bcf_sr_regions_t struct returned by a successful call should be freed
 *  via bcf_sr_regions_destroy() when it is no longer needed.
 */
bcf_sr_regions_t* bcf_sr_regions_init(
    const(char)* regions,
    int is_file,
    int chr,
    int from,
    int to);

void bcf_sr_regions_destroy(bcf_sr_regions_t* regions);

/*
 *  bcf_sr_regions_seek() - seek to the chromosome block
 *
 *  Returns 0 on success or -1 on failure. Sets reg->seq appropriately and
 *  reg->start,reg->end to -1.
 */
int bcf_sr_regions_seek(bcf_sr_regions_t* regions, const(char)* chr);

/*
 *  bcf_sr_regions_next() - retrieves next region. Returns 0 on success and -1
 *  when all regions have been read. The fields reg->seq, reg->start and
 *  reg->end are filled with the genomic coordinates on success or with
 *  NULL,-1,-1 when no region is available. The coordinates are 0-based,
 *  inclusive.
 */
int bcf_sr_regions_next(bcf_sr_regions_t* reg);

/*
 *  bcf_sr_regions_overlap() - checks if the interval <start,end> overlaps any of
 *  the regions, the coordinates are 0-based, inclusive. The coordinate queries
 *  must come in ascending order.
 *
 *  Returns 0 if the position is in regions; -1 if the position is not in the
 *  regions and more regions exist; -2 if not in the regions and there are no more
 *  regions left.
 */
int bcf_sr_regions_overlap(
    bcf_sr_regions_t* reg,
    const(char)* seq,
    hts_pos_t start,
    hts_pos_t end);

/*
 *  bcf_sr_regions_flush() - calls repeatedly regs->missed_reg_handler() until
 *  all remaining records are processed.
 *  Returns 0 on success, <0 on error.
 */
int bcf_sr_regions_flush(bcf_sr_regions_t* regs);