#include <indexed_vg.hpp>

Public Member Functions
	CacheEntry (cursor_t &to_read)
	Make a cache entry for a group by reading a cursor at that group's start. More...

	CacheEntry (CacheEntry &&other)=default

CacheEntry &	operator= (CacheEntry &&other)=default

Graph	query (const id_t &id) const
	Pull out the subgraph for the given node. More...

Public Attributes
Graph	merged_group
	All the graphs get merged into this one. More...

unordered_map< id_t, size_t >	id_to_node_index
	This maps from node ID to index in the merged graph. More...

unordered_map< id_t, vector< size_t > >	id_to_edge_indices
	This maps from node ID to indexes of touched edges in the merged graph. More...

int64_t	next_group

Detailed Description

Represents an entry in the cache for a parsed group of graphs. Has its own indexes and the virtual offset of the next group.

Constructor & Destructor Documentation

vg::IndexedVG::CacheEntry::CacheEntry ( cursor_t & to_read )

Make a cache entry for a group by reading a cursor at that group's start.

vg::IndexedVG::CacheEntry::CacheEntry ( CacheEntry && other )

default

CacheEntry& vg::IndexedVG::CacheEntry::operator= ( CacheEntry && other )

default

Graph vg::IndexedVG::CacheEntry::query ( const id_t & id ) const

Pull out the subgraph for the given node.

unordered_map<id_t, vector<size_t> > vg::IndexedVG::CacheEntry::id_to_edge_indices

This maps from node ID to indexes of touched edges in the merged graph.

unordered_map<id_t, size_t> vg::IndexedVG::CacheEntry::id_to_node_index

This maps from node ID to index in the merged graph.

Graph vg::IndexedVG::CacheEntry::merged_group

All the graphs get merged into this one.

int64_t vg::IndexedVG::CacheEntry::next_group

This is the virtual offset of the next group in the file. If this was the last group in the file, this is numeric_limits<int64_t>::max().

The documentation for this struct was generated from the following files: