bam2ab1 0.5.1

use std::{cmp, collections::HashMap};

use gskits::gsbam::bam_record_ext::BamRecordExt;
use ndarray::{Array2, ArrayViewMut1, Axis, concatenate, s};
use rust_htslib::bam::{Record, ext::BamRecordExtensions};

use crate::pileup_counter::BASE2IDX;

#[tracing::instrument(skip(records))]
pub fn plp_from_records(
    records: &Vec<Record>,
    target_start: usize,
    target_end: usize,
) -> super::PlpInfo {
    let major_pos_ins =
        compute_max_ins_of_each_ref_position(&records, Some(target_start), Some(target_end));

    let mut major_pos_ins_vec = major_pos_ins
        .iter()
        .map(|(&k, &v)| (k as usize, v as usize))
        .collect::<Vec<_>>();
    major_pos_ins_vec.sort_by_key(|v| v.0);

    // let mut sampled_values_for_print = major_pos_ins
    //     .iter()
    //     .filter(|(k, v)| **k > 450 && **k < 470)
    //     .map(|(k, v)| (*k, *v))
    //     .collect::<Vec<(i64, i32)>>();
    // sampled_values_for_print.sort_by_key(|v| v.0);
    // println!("major_pos_ins_vec:{sampled_values_for_print:?}");
    // (0..(ins_size+1)).into_iter().collect::<Vec<_>>())

    // tracing::info!(
    //     "major_pos_range: [{}, {})",
    //     major_pos_ins_vec[0].0,
    //     major_pos_ins_vec.last().unwrap().0 + 1
    // );
    // println!(
    //     "{:?}",
    //     major_pos_ins_vec
    //         .iter()
    //         .map(|(a, _)| *a)
    //         .collect::<Vec<_>>()
    // );

    let major = major_pos_ins_vec
        .iter()
        .flat_map(|&(major_pos, ins_size)| vec![major_pos; ins_size + 1].into_iter())
        .collect::<Vec<_>>();
    let minor = major_pos_ins_vec
        .iter()
        .flat_map(|&(_, ins_size)| (0..(ins_size + 1)).into_iter())
        .collect::<Vec<_>>();

    let mut cursor = 0;
    let major_start_point = major_pos_ins_vec
        .iter()
        .map(|&(_, max_ins)| {
            let cur_point = cursor;
            cursor += max_ins + 1;
            cur_point
        })
        .collect::<Vec<_>>();
    let major_pos2major_starting_point = major_pos_ins_vec
        .iter()
        .map(|&(ma, _)| ma)
        .zip(major_start_point.into_iter())
        .collect::<HashMap<_, _>>();

    // TODO: error handling
    let first_major = major[0].clone();
    let last_major = major.last().unwrap_or(&0).clone();

    let mut msa_matrix = Array2::<u8>::from_elem((records.len(), major.len()), '-' as u8);
    records.iter().enumerate().for_each(|(idx, record)| {
        build_one_record_of_msa(
            record,
            target_start,
            target_end,
            &major_pos2major_starting_point,
            msa_matrix.slice_mut(s![idx, ..]),
        );
    });

    // let start_450 = major_pos2major_starting_point[&450];
    // println!("msa: \n{:?}", msa_matrix.slice(s![.., start_450..start_450+20]));

    let mut plp_count = count(&msa_matrix);

    // println!("plp_count:\n {:?}", plp_count.slice(s![.., start_450..start_450+20]));

    // println!("{:?}", msa_matrix.mapv(char::from).slice(s![.., 5..15]));
    // println!("{:?}", plp_count.slice(s![.., 5..15]));

    let major_depth = compute_major_depth(target_end, &records);

    plp_count
        .axis_iter_mut(Axis(1))
        .enumerate()
        .for_each(|(locus, mut plp_c)| {
            let cur_major = major[locus];

            let cur_depth = match major_depth.get(&cur_major) {
                Some(cur_depth) => *cur_depth as f32,
                None => {
                    tracing::error!("cur_major {cur_major} not found in major_depth");
                    panic!("");
                }
            };

            plp_c.mapv_inplace(|v| v / cur_depth);
        });

    let mut major = major;
    let mut minor = minor;
    if first_major > target_start {
        let pad = Array2::<f32>::from_elem((4, first_major - target_start), 0.0);
        plp_count = concatenate![Axis(1), pad, plp_count];
        let mut header = (target_start..first_major)
            .into_iter()
            .collect::<Vec<usize>>();
        header.extend_from_slice(&major);
        major = header;

        let mut header = vec![0; first_major - target_start];
        header.extend_from_slice(&minor);
        minor = header;
    }
    if (last_major + 1) < target_end {
        let pad_len = target_end - last_major - 1;
        let pad = Array2::<f32>::from_elem((4, pad_len), 0.0);
        plp_count = concatenate![Axis(1), plp_count, pad];
        let tail = (last_major + 1..target_end)
            .into_iter()
            .collect::<Vec<usize>>();
        major.extend_from_slice(&tail);

        let tail = vec![0; pad_len];
        minor.extend_from_slice(&tail);
    }

    // println!(
    //     "plp_ratio:\n {:?}",
    //     plp_count.slice(s![.., start_450..start_450 + 40])
    // );

    // println!("{:?}", plp_count);

    let major = major
        .into_iter()
        .map(|v| v - target_start)
        .collect::<Vec<usize>>();

    super::PlpInfo {
        normed_count: plp_count,
        major: major,
        minor: minor,
    }
}

pub fn plp_from_records_left_align(records: &Vec<Record>, target_len: usize) -> super::PlpInfo {
    let mut left_align_matrix = Array2::<u8>::from_elem((records.len(), target_len), '-' as u8);
    records.iter().enumerate().for_each(|(idx, record)| {
        let ext = BamRecordExt::new(record);
        let seq = ext.get_seq();
        let seq_bytes = seq.as_bytes();
        let t_start = ext.reference_start();
        let mut qstart = ext.query_alignment_start();
        let qend = ext.query_alignment_end();
        let t_end = (t_start + qend - qstart).min(target_len);
        left_align_matrix
            .slice_mut(s![idx, ..])
            .iter_mut()
            .enumerate()
            .for_each(|(tt, value)| {
                if tt >= t_start && qstart < qend && tt < t_end {
                    *value = seq_bytes[qstart];
                    qstart += 1;
                }
            });
    });

    let major = (0..target_len).into_iter().collect::<Vec<usize>>();
    let minor = vec![0_usize; target_len];

    let mut plp_count = count(&left_align_matrix);
    // println!("{:?}", plp_count);

    let major_depth = compute_major_depth(target_len, &records);

    plp_count
        .axis_iter_mut(Axis(1))
        .enumerate()
        .for_each(|(locus, mut plp_c)| {
            let cur_major = major[locus];
            let cur_depth = *major_depth.get(&cur_major).unwrap() as f32;
            plp_c.mapv_inplace(|v| v / cur_depth);
        });

    super::PlpInfo {
        normed_count: plp_count,
        major: major,
        minor: minor,
    }
}

fn build_one_record_of_msa(
    record: &Record,
    ref_start: usize,
    ref_end: usize,
    major_pos2major_starting_point: &HashMap<usize, usize>,
    mut result: ArrayViewMut1<u8>,
) {
    let record_ext = BamRecordExt::new(record);
    let ref_start = ref_start as i64;
    let ref_end = ref_end as i64;

    let q_start = record_ext.query_alignment_start() as i64;
    let q_end = record_ext.query_alignment_end() as i64;
    let query = record_ext.get_seq();
    let query = query.as_bytes();
    let mut q_pos_cursor = None;
    let mut r_pos_cursor = None;
    let mut delta = 0;
    for [qpos, rpos] in record.aligned_pairs_full() {
        if qpos.is_some() {
            q_pos_cursor = qpos;
        }
        if rpos.is_some() {
            r_pos_cursor = rpos;
        }

        if q_pos_cursor.is_none() || r_pos_cursor.is_none() {
            continue;
        }

        if q_pos_cursor.unwrap() < q_start || r_pos_cursor.unwrap() < ref_start {
            continue;
        }

        if q_pos_cursor.unwrap() >= q_end || r_pos_cursor.unwrap() >= ref_end {
            break;
        }

        if rpos.is_some() {
            delta = 0;
        } else {
            delta += 1;
        }
        let r_cursor = r_pos_cursor.map(|v| v as usize).unwrap();
        let r_cursor = &r_cursor;
        if !major_pos2major_starting_point.contains_key(r_cursor) {
            eprintln!("r_corsor not found: {}", r_cursor);
            continue;
        }

        let base_pos = *major_pos2major_starting_point.get(r_cursor).unwrap();

        if let Some(qpos) = qpos.map(|v| v as usize) {
            result[base_pos + delta] = query[qpos];
        }
    }
}

pub fn compute_major_depth(target_len: usize, records: &Vec<Record>) -> HashMap<usize, usize> {
    let all_records_start_end = records
        .iter()
        .map(|record| {
            let ext = BamRecordExt::new(record);
            (ext.reference_start(), ext.reference_end())
        })
        .collect::<Vec<(usize, usize)>>();

    (0..target_len)
        .into_iter()
        .map(|major_pos| {
            let depth = all_records_start_end
                .iter()
                .filter(|(start, end)| *start <= major_pos && major_pos < *end)
                .count();
            (major_pos, depth)
        })
        .collect::<HashMap<usize, usize>>()
}

pub fn count(msa_matrix: &Array2<u8>) -> Array2<f32> {
    let mut result_matrix = Array2::<f32>::from_elem((4, msa_matrix.shape()[1]), 0.0);
    msa_matrix.axis_iter(Axis(0)).for_each(|row| {
        row.iter().enumerate().for_each(|(locus, &base)| {
            let mut base_idx = BASE2IDX[base as usize] as usize;
            if base_idx > 0 {
                base_idx -= 1;
                result_matrix[[base_idx, locus]] += 1.0;
            }
        });
    });

    result_matrix
}

/// todo: use the cigar_str to speed up this function
/// query_locus_blacklist: just like remove the base in query_locus_blacklist from the query
///     so: when match, treat it as deletion
///         when insertion: treat it as noting
pub fn compute_max_ins_of_each_ref_position(
    records: &Vec<Record>,
    rstart: Option<usize>,
    rend: Option<usize>,
) -> HashMap<i64, i32> {
    let mut pos2ins = HashMap::new();

    let rstart = rstart.map(|v| v as i64);
    let rend = rend.map(|v| v as i64);
    for record in records {
        let record_ext = BamRecordExt::new(record);
        let mut start = rstart.unwrap_or(record_ext.reference_start() as i64);
        let mut end = rend.unwrap_or(record_ext.reference_end() as i64);
        start = cmp::max(start, record_ext.reference_start() as i64);
        end = cmp::min(end, record_ext.reference_end() as i64);

        // println!("end={end}");

        let mut rpos_cursor = None;
        // let mut qpos_cursor = None;
        let mut cur_ins = 0;
        let query_end = record_ext.query_alignment_end();

        // println!(
        //     "max_ins, qname:{}, rstart:{}, rend:{}",
        //     record_ext.get_qname(),
        //     start,
        //     end
        // );
        let mut aligned_pair_full = record.aligned_pairs_full().collect::<Vec<_>>();
        if aligned_pair_full.len() == 0 {
            continue;
        }

        // this make the following for loop correct.
        // if the query match to the last base of the ref seqence. the following for loop won't give the right result
        // but add this , it will get the right result.
        if let Some(last_ref_pos) = aligned_pair_full.last().unwrap()[0] {
            aligned_pair_full.push([Some(last_ref_pos + 1), None]);
        }

        for [qpos, rpos] in aligned_pair_full.into_iter() {
            if rpos.is_some() {
                rpos_cursor = rpos;
            }
            // if qpos.is_some() {
            //     qpos_cursor = qpos;
            // }
            if rpos_cursor.is_none() {
                continue;
            }

            if rpos_cursor.unwrap() < start {
                continue;
            }

            // print!("{},", rpos_cursor.unwrap());
            if rpos_cursor.unwrap() >= end {
                // set the last rpos max ins and then break
                let rpos_ = rpos_cursor.unwrap();
                // 避免 query 第一次 比对的位置就已经超过 了 期望 的 rend
                if (rpos_ - 1) < end {
                    pos2ins.entry(rpos_ - 1).or_insert(0);
                    *pos2ins.get_mut(&(rpos_ - 1)).unwrap() =
                        cmp::max(*pos2ins.get(&(rpos_ - 1)).unwrap(), cur_ins);
                }

                break;
            }

            if let Some(qpos_) = qpos {
                if qpos_ as usize >= query_end {
                    // println!("query hit end: {}", qpos_);
                    // set the last rpos max ins and then break
                    let rpos_ = rpos_cursor.unwrap();

                    pos2ins.entry(rpos_).or_insert(0);
                    *pos2ins.get_mut(&rpos_).unwrap() =
                        cmp::max(*pos2ins.get(&rpos_).unwrap(), cur_ins);
                    break;
                }
            }

            if let Some(rpos_) = rpos {
                if rpos_ > start {
                    pos2ins.entry(rpos_ - 1).or_insert(0);
                    *pos2ins.get_mut(&(rpos_ - 1)).unwrap() =
                        cmp::max(*pos2ins.get(&(rpos_ - 1)).unwrap(), cur_ins);
                }
                cur_ins = 0;
            } else {
                cur_ins += 1;
            }
        }
        // println!("");
    }

    pos2ins
}

#[cfg(test)]
mod test {
    use gskits::fastx_reader::{fasta_reader::FastaFileReader, read_fastx};
    use ndarray::s;
    use rust_htslib::bam::{Read, Record};

    use crate::pileup_counter::{extract_seq_info_from_header, plp_from_records::plp_from_records};

    #[test]
    fn test_plp_from_records() {
        let fpath = "./test-data/Group_0_Adaptor-barcode295-2.sort.bam";
        let mut reader = rust_htslib::bam::Reader::from_path(fpath).unwrap();
        reader.set_threads(40).unwrap();

        let mut record = Record::new();
        let mut records = vec![];
        loop {
            if let Some(Ok(_)) = reader.read(&mut record) {
                records.push(record);
                record = Record::new();
            } else {
                break;
            }
        }

        records = records
            .into_iter()
            .filter(|record| {
                !record.is_unmapped() && !record.is_secondary() && !record.is_supplementary()
            })
            .take(10)
            .collect();
        let seq_infos = extract_seq_info_from_header(reader.header()).unwrap();
        for seq_info in seq_infos {
            let seq_len = seq_info.length;
            plp_from_records(&records, 0, seq_len);
        }
    }

    #[test]
    fn test_plp_from_records_2() {
        let fpath = "./test-data/Group_0_Adaptor-barcode201-1.sort.bam";
        let mut reader = rust_htslib::bam::Reader::from_path(fpath).unwrap();
        reader.set_threads(40).unwrap();

        let mut record = Record::new();
        let mut records = vec![];
        loop {
            if let Some(Ok(_)) = reader.read(&mut record) {
                records.push(record);
                record = Record::new();
            } else {
                break;
            }
        }

        records = records
            .into_iter()
            .filter(|record| {
                !record.is_unmapped() && !record.is_secondary() && !record.is_supplementary()
            })
            .collect();
        let seq_infos = extract_seq_info_from_header(reader.header()).unwrap();

        for seq_info in seq_infos {
            let seq_len = seq_info.length;
            // let seq_len = 14;
            let mut plp_info = plp_from_records(&records, 0, seq_len);

            println!("{:?}", &plp_info.major[10..20]);
            println!("{:?}", plp_info.normed_count.slice(s![.., 10..20]).t());

            let fasta_reader = FastaFileReader::new(
                "test-data/Group_0_Adaptor-barcode201-1.consensus.fasta".to_string(),
            );
            let fasta_records = read_fastx(fasta_reader);

            let reference_sequence = &fasta_records[0].seq;
            plp_info.modify_ratio(reference_sequence.as_bytes(), 0.05, 0.1, 0.45);

            println!("-----------------------AFTER----------------");
            println!("{:?}", &plp_info.major[10..20]);
            println!("{:?}", plp_info.normed_count.slice(s![.., 10..20]).t());
        }
    }

    #[test]
    fn test_plp_from_records_3() {
        let fpath = "./test-data/channel_340564.bam";
        let mut reader = rust_htslib::bam::Reader::from_path(fpath).unwrap();
        reader.set_threads(40).unwrap();

        let mut record = Record::new();
        let mut records = vec![];
        loop {
            if let Some(Ok(_)) = reader.read(&mut record) {
                records.push(record);
                record = Record::new();
            } else {
                break;
            }
        }

        records = records
            .into_iter()
            .filter(|record| {
                !record.is_unmapped() && !record.is_secondary() && !record.is_supplementary()
            })
            .collect();
        let seq_infos = extract_seq_info_from_header(reader.header()).unwrap();
        for seq_info in seq_infos {
            let seq_len = seq_info.length;
            // let seq_len = 14;
            let mut plp_info = plp_from_records(&records, 0, seq_len);

            println!("{:?}", &plp_info.major[30..40]);
            println!("{:?}", plp_info.normed_count.slice(s![.., 30..40]).t());

            let fasta_reader = FastaFileReader::new("test-data/340564.fasta".to_string());
            let fasta_records = read_fastx(fasta_reader);

            let reference_sequence = &fasta_records[0].seq;
            plp_info.modify_ratio(reference_sequence.as_bytes(), 0.05, 0.1, 0.45);

            println!("-----------------------AFTER----------------");
            println!("{:?}", &plp_info.major[30..40]);
            println!("{:?}", plp_info.normed_count.slice(s![.., 30..40]).t());
        }
    }
}