-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
GFA export #42
GFA export #42
Conversation
dc47915
to
26a3c33
Compare
} | ||
} | ||
|
||
(graph, edges_by_node_pair) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't love having to return edges_by_node_pair here, but I couldn't think of a more elegant way to get a mapping from one representation of edge (pair of black IDs) to the regular edge object
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we can assign more information to edges than we have been, but we can do that later. the ()
part of the DiGraphMap is edge storage iirc. So we could put some custom structure there.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Oh, good to know. I'll keep that in mind
@@ -255,218 +239,11 @@ impl BlockGroup { | |||
} | |||
} | |||
|
|||
pub fn get_block_boundaries( |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Most of this is just refactoring, moving it into the Edge model, which I think is a better place for it.
@@ -0,0 +1,70 @@ | |||
use rusqlite::types::Value; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Felt like putting Collection into its own file while I was at it
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
.into_string() | ||
.unwrap(); | ||
|
||
export_gfa(&conn, collection_name, &gfa_path); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
just a fyi, you can use pathbuf and avoid the string conversions
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Oh yeah, that does simplify things a bit, done here and with gfa imports
} | ||
} | ||
|
||
(graph, edges_by_node_pair) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we can assign more information to edges than we have been, but we can do that later. the ()
part of the DiGraphMap is edge storage iirc. So we could put some custom structure there.
No description provided.