Struct Path 

pub struct Path {
    pub id: HashId,
    pub block_group_id: HashId,
    pub name: String,
    pub created_on: i64,
}

Fields

id: HashId

block_group_id: HashId

name: String

created_on: i64

Implementations

impl Path

pub fn validate_edges( conn: &GraphConnection, edge_ids: &[HashId], block_group_id: &HashId, )

pub fn create( conn: &GraphConnection, name: &str, block_group_id: &HashId, edge_ids: &[HashId], ) -> Path

pub fn delete(conn: &GraphConnection, name: &str, block_group_id: &HashId)

pub fn get_by_id(conn: &GraphConnection, path_id: &HashId) -> Path

pub fn query_for_collection( conn: &GraphConnection, collection_name: &str, ) -> Vec<Path>

pub fn query_for_collection_and_sample( conn: &GraphConnection, collection_name: &str, sample_name: Option<String>, ) -> Vec<Path>

pub fn sequence(&self, conn: &GraphConnection) -> String

pub fn length(&self, conn: &GraphConnection) -> i64

pub fn edge_pairs_to_block( &self, block_id: i64, into: Edge, out_of: Edge, sequences_by_node_id: &HashMap<HashId, Sequence>, current_path_length: i64, ) -> PathBlock

pub fn blocks(&self, conn: &GraphConnection) -> Vec<PathBlock>

pub fn intervaltree( &self, conn: &GraphConnection, ) -> IntervalTree<i64, NodeIntervalBlock>

pub fn find_block_mappings( &self, conn: &GraphConnection, other_path: &Path, ) -> Vec<RangeMapping>

pub fn propagate_annotation( annotation: Annotation, mapping_tree: &IntervalTree<i64, RangeMapping>, sequence_length: i64, ) -> Option<Annotation>

pub fn get_mapping_tree( &self, conn: &GraphConnection, path: &Path, ) -> IntervalTree<i64, RangeMapping>

pub fn propagate_annotations( &self, conn: &GraphConnection, path: &Path, annotations: Vec<Annotation>, ) -> Vec<Annotation>

pub fn new_path_with( &self, conn: &GraphConnection, path_start: i64, path_end: i64, edge_to_new_node: &Edge, edge_from_new_node: &Edge, ) -> Path

pub fn new_path_with_deletion( &self, conn: &GraphConnection, deletion_start: i64, deletion_end: i64, ) -> Result<Path, QueryError>

pub fn node_block_partition( &self, conn: &GraphConnection, ranges: Vec<Range>, ) -> Vec<NodeIntervalBlock>

Trait Implementations

impl<'a> Capnp<'a> for Path

type Builder = Builder<'a>

type Reader = Reader<'a>

fn write_capnp(&self, builder: &mut Self::Builder)

fn read_capnp(reader: Self::Reader) -> Self

impl Clone for Path

fn clone(&self) -> Path

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Path

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Path

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for Path

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Path

fn eq(&self, other: &Path) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Query for Path

const TABLE_NAME: &'static str = "paths"

type Model = Path

fn process_row(row: &Row<'_>) -> Self::Model

const PRIMARY_KEY: &'static str = "id"

fn query( conn: &Connection, query: &str, params: impl Params, ) -> Vec<Self::Model>

fn get( conn: &Connection, query: &str, params: impl Params, ) -> Result<Self::Model>

fn get_by_id<'a, T>(conn: &Connection, id: &'a T) -> Option<Self::Model>

where T: Clone + 'a, Value: From<T>,

fn query_by_ids<'a, I: ?Sized, T>( conn: &Connection, ids: &'a I, ) -> Vec<Self::Model>

where &'a I: IntoIterator<Item = &'a T>, T: Clone + 'a, Value: From<T>,

fn delete_by_ids<'a, I: ?Sized, T>( conn: &Connection, ids: &'a I, ) -> Vec<Self::Model>

where &'a I: IntoIterator<Item = &'a T>, T: Clone + 'a, Value: From<T>,

fn table_name() -> &'static str

fn all(conn: &Connection) -> Vec<Self::Model>

fn all_with_limit(conn: &Connection, limit: usize) -> Vec<Self::Model>

impl Serialize for Path

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Path

impl StructuralPartialEq for Path