Singly linked list queue class
You can abstract out the thing that changes, the comparison expression, into a predicate for a template function.

class PriorityMatch
{
    int priority_;
public:
    explicit PriorityMatch(int priority)
        : priority_(priority) {}

    bool operator()(const Job&amp; job)
    {
        return job-&gt;priority == priority_;
    }
};

class DescriptionMatch
{
    std::string substring_;
public:
    explicit DescriptionMatch(const std::string&amp; substring)
        : substring_(substring) {}

    bool operator()(const Job&amp; job)
    {
        return job-&gt;description.find(substring_) != std::string::npos;
    }
};

template&lt;class Predicate&gt;
int Queue::remove(Predicate predicate)
{
    // Loop through the queue list
    if (predicate(current_job)) {
        // Remove job.
    }
    // Return the amount of removed jobs.     
}

int Queue::remove(const string&amp; substring)
{
    return remove(DescriptionMatch(substring));
}

int Queue::remove(int priority)
{
    return remove(PriorityMatch(substring));
}


Or in C++11:

template&lt;class Predicate&gt;
int Queue::remove(Predicate predicate)
{
    // Loop through the queue list
    if (predicate(current_job)) {
        // Remove job.
    }
    // Return the amount of removed jobs.     
}

int Queue::remove(const string&amp; substring)
{
    return remove([](const Job&amp; job){
        return job-&gt;description.find(substring) != std::string::npos;
    });
}

int Queue::remove(int priority)
{
    return remove([](const Job&amp; job){
        return job-&gt;priority == priority;
    });
}