TagStorage

Lazy tag storage.

Provides hash-like access and opportunity to iterate storage like an associative array.

mixin template TagStorage () {

bio.std.hts.bam.tagvalue.Value opIndex(string key);

void opIndexAssign(T value, string key);

void appendTag(string key, Value value);

void clearAllTags();

size_t tagCount();

int opApply(int delegate(const ref string k, const ref Value v) dg);

size_t tagCount();

}

Members

Functions

appendTag void appendTag(string key, Value value): Append new tag to the end, skipping check if it already exists. O(1)
clearAllTags void clearAllTags(): Remove all tags
opApply int opApply(int delegate(const ref string k, const ref Value v) dg): Provides opportunity to iterate over tags.
opIndex bio.std.hts.bam.tagvalue.Value opIndex(string key)
opIndexAssign void opIndexAssign(T value, string key): Hash-like access to tags. Time complexity is O(number of tags).
If tag with such key is not found, returned value 'is nothing'.
If key length is different from 2, exception is thrown.
Special case when value represents nothing is used for removing tag (assuming that no more than one with this key is presented in the record).
tagCount size_t tagCount(): Number of tags. O(number of tags)
tagCount size_t tagCount(): Returns the number of tags. Time complexity is O(number of tags)

Meta

Source

See Implementation

bio std hts bam read functions

mixin templates

TagStorage

structs

templates

isBamRead