Skip to content
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.

Sign up for GitHub

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

Jump to bottom

lib/iostream: Remove redundant template parameters #4586

Merged
merged 1 commit into from
Oct 26, 2024
Merged

lib/iostream: Remove redundant template parameters #4586

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions include/grass/iostream/replacementHeap.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -101,10 +101,10 @@ class ReplacementHeap {

public:
// allocate array mergeHeap and the runs in runList
ReplacementHeap<T, Compare>(size_t arity, queue<char *> *runList);
ReplacementHeap(size_t arity, queue<char *> *runList);

// delete array mergeHeap
~ReplacementHeap<T, Compare>();
~ReplacementHeap();

// is heap empty?
int empty() const { return (size == 0); }
Expand Down Expand Up @@ -159,7 +159,7 @@ ReplacementHeap<T, Compare>::ReplacementHeap(size_t g_arity,

/*****************************************************************/
template <class T, class Compare>
ReplacementHeap<T, Compare>::~ReplacementHeap<T, Compare>()
ReplacementHeap<T, Compare>::~ReplacementHeap()
{

if (!empty()) {
Expand Down
6 changes: 3 additions & 3 deletions include/grass/iostream/replacementHeapBlock.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -102,10 +102,10 @@ class ReplacementHeapBlock {

public:
// allocate array mergeHeap, where the streams are stored in runList
ReplacementHeapBlock<T, Compare>(queue<MEM_STREAM<T> *> *runList);
ReplacementHeapBlock(queue<MEM_STREAM<T> *> *runList);

// delete array mergeHeap
~ReplacementHeapBlock<T, Compare>();
~ReplacementHeapBlock();

// is heap empty?
int empty() const { return (size == 0); }
Expand Down Expand Up @@ -161,7 +161,7 @@ ReplacementHeapBlock<T, Compare>::ReplacementHeapBlock(

/*****************************************************************/
template <class T, class Compare>
ReplacementHeapBlock<T, Compare>::~ReplacementHeapBlock<T, Compare>()
ReplacementHeapBlock<T, Compare>::~ReplacementHeapBlock()
{

if (!empty()) {
Expand Down
Loading