Skip to content
This repository has been archived by the owner on Jul 17, 2023. It is now read-only.

Commit

Permalink
add minor cppcheck edits
Browse files Browse the repository at this point in the history
  • Loading branch information
ctsa committed Aug 7, 2015
1 parent 875c129 commit baa2ec0
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@
/// dividing iteration into a set of bins with similar total edge
/// observation counts
///
struct EdgeRetrieverBin : public EdgeRetriever
struct EdgeRetrieverBin final : public EdgeRetriever
{
/// \param[in] graphNodeMaxEdgeCount filtration parameter for skipping edges
/// from highly connected nodes (set to zero to disable)
Expand All @@ -46,7 +46,7 @@ struct EdgeRetrieverBin : public EdgeRetriever
const unsigned binIndex);

bool
next() final override;
next() override;

private:
void
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@
/// dividing iteration into a set of bins with similar total edge
/// observation counts
///
struct EdgeRetrieverLocus : public EdgeRetriever
struct EdgeRetrieverLocus final : public EdgeRetriever
{
/// \param locusIndex iterate over all edges of a specific locus
EdgeRetrieverLocus(
Expand All @@ -43,7 +43,7 @@ struct EdgeRetrieverLocus : public EdgeRetriever
const LocusEdgeOptions& opt);

bool
next() final override;
next() override;

private:
void
Expand Down

0 comments on commit baa2ec0

Please sign in to comment.