Sha256: c0b3b78d4ae249eb3b3b6cf03c0b5e504e72cb2f817b8f9578d3a46446b2f907
Contents?: true
Size: 1.06 KB
Versions: 8
Compression:
Stored size: 1.06 KB
Contents
#ifndef _READ_TO_NODE_H_ #define _READ_TO_NODE_H_ typedef struct { IDnum read_id; IDnum node_id; } ReadIdNodeId; //this is a doubly used structure, once for creation of the data structure, and also in the result of the indexation. This is a little bad, but eh. typedef struct { IDnum num_contents; IDnum num_reads; IDnum* index; ReadIdNodeId* contents; } ReadIdToNodeIdLookupTable; //TODO: add 'writing is complete' flag like other velvet functions typedef struct { IDnum num_contents; IDnum num_reads; } ReadIdToNodeIdLookupTableFileHeader; typedef struct { IDnum num_nodes; ReadIdNodeId* read_ids_node_ids; } ReadIdToNodeIdIndexation; ReadIdToNodeIdLookupTable* createReadToNode(Graph* graph); void destroyReadIdToNodeIdLookupTable(ReadIdToNodeIdLookupTable* lookupTable); ReadIdToNodeIdIndexation getReadIdToNodeIdIndexation(ReadIdToNodeIdLookupTable* lookupTable, IDnum readID); void writeReadIdToNodeIdLookupTable(char* fileName, ReadIdToNodeIdLookupTable* lookupTable); ReadIdToNodeIdLookupTable* readReadIdToNodeIdLookupTable(char* fileName); #endif
Version data entries
8 entries across 8 versions & 1 rubygems