rfs Namespace Reference

Classes
class	queue_bag

Enumerations
enum	RemoveResult { RemoveResult::KeepContinue, RemoveResult::KeepBreak, RemoveResult::RemoveContinue, RemoveResult::RemoveBreak }

Functions
void	testQueueBag ()
template<typename T , typename Consumer >
void	forEach (queue_bag< T > &queue, Consumer consumer)
template<typename T , typename Predicate >
size_t	removeMatching (queue_bag< T > &queue, Predicate predicate)

Enumeration Type Documentation

RemoveResult

enum rfs::RemoveResult

strong

Enumerator
KeepContinue
KeepBreak
RemoveContinue
RemoveBreak

Definition at line 229 of file queue_bag.h.

                            {
        KeepContinue,
        KeepBreak,
        RemoveContinue,
        RemoveBreak
    };

Function Documentation

forEach()

template<typename T , typename Consumer >

void rfs::forEach	(	queue_bag< T > &	queue,
		Consumer	consumer
	)

Iterate through queue_bag until all elements are consumed or until consumer returns false.

Definition at line 221 of file queue_bag.h.

                                                         {
        for (size_t i = 0; i < queue.getSize(); ++i) {
            if (!consumer(queue[i])) {
                return;
            }
        }
    }

removeMatching()

template<typename T , typename Predicate >

size_t rfs::removeMatching	(	queue_bag< T > &	queue,
		Predicate	predicate
	)

Does bulk removal of elements from queue_bag. Removes only those elements, which match the predicate.

Template Parameters

Predicate

lambda that takes T& and returns RemoveResult

Returns

amount of removed items

Definition at line 242 of file queue_bag.h.

                                                                    {
        size_t removed = 0;
        size_t i = 0;
        while (i < queue.getSize()) {
            RemoveResult res = predicate(queue[i]);
            if (res == RemoveResult::RemoveContinue || res == RemoveResult::RemoveBreak) {
                queue.removeIndex(i);
            } else {
                i++;
            }

            if (res == RemoveResult::KeepBreak || res == RemoveResult::RemoveBreak) {
                break;
            }
        }
        return removed;
    }

testQueueBag()

void rfs::testQueueBag

(

)