tsg 0.1.0

A tool to analyze and manipulate transcript segment graph (TSG)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

use std::fmt;
use std::{io, str::FromStr};

use ahash::HashMap;
use bstr::BString;

use super::Attribute;

/// Orientation of an element in an ordered group
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Orientation {
    Forward,
    Reverse,
}

/// Reference to a graph element with optional orientation
#[derive(Debug, Clone)]
pub struct OrientedElement {
    pub id: BString,
    pub orientation: Option<Orientation>,
}

impl FromStr for OrientedElement {
    type Err = io::Error;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        if let Some(stripped) = s.strip_suffix('+') {
            Ok(OrientedElement {
                id: stripped.into(),
                orientation: Some(Orientation::Forward),
            })
        } else if let Some(stripped) = s.strip_suffix('-') {
            Ok(OrientedElement {
                id: stripped.into(),
                orientation: Some(Orientation::Reverse),
            })
        } else {
            Ok(OrientedElement {
                id: s.into(),
                orientation: None,
            })
        }
    }
}

impl fmt::Display for OrientedElement {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self.orientation {
            Some(Orientation::Forward) => write!(f, "{}+", self.id),
            Some(Orientation::Reverse) => write!(f, "{}-", self.id),
            None => write!(f, "{}", self.id),
        }
    }
}

/// Group in the transcript segment graph (ordered, unordered, or chain)
#[derive(Debug, Clone)]
pub enum Group {
    Unordered {
        id: BString,
        elements: Vec<BString>,
        attributes: HashMap<BString, Attribute>,
    },
    Ordered {
        id: BString,
        elements: Vec<OrientedElement>,
        attributes: HashMap<BString, Attribute>,
    },
    Chain {
        id: BString,
        elements: Vec<BString>, // Alternating node and edge IDs, starting and ending with nodes
        attributes: HashMap<BString, Attribute>,
    },
}