// Copyright (c) 2012-2024 Wojciech Figat. All rights reserved.

#pragma once

#include "ConcurrentQueue.h"
#include "Task.h"

/// <summary>
/// Lock-free implementation of thread-safe tasks queue.
/// </summary>
template<typename T = Task>
class ConcurrentTaskQueue : public ConcurrentQueue<T*>
{
public:

    /// <summary>
    /// Adds item to the collection (thread-safe).
    /// </summary>
    /// <param name="item">Item to add.</param>
    FORCE_INLINE void Add(T* item)
    {
        ConcurrentQueue<T*>::enqueue(item);
    }

    /// <summary>
    /// Cancels all the tasks from the queue and removes them.
    /// </summary>
    void CancelAll()
    {
        T* tasks[16];
        std::size_t count;
        while ((count = ConcurrentQueue<T*>::try_dequeue_bulk(tasks, ARRAY_COUNT(tasks))) != 0)
        {
            for (std::size_t i = 0; i != count; i++)
            {
                tasks[i]->Cancel();
            }
        }
    }
};
