#region License
// Copyright (C) 2020 Reetus
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see .
#endregion
using System;
using System.Collections.Generic;
namespace ClassicAssist.Data.Targeting
{
public class TargetQueue
{
private readonly object _lock = new object();
private Queue _queue = new Queue();
public int Count
{
get
{
lock ( _lock )
{
return _queue.Count;
}
}
}
public void Enqueue( T obj )
{
lock ( _lock )
{
// If queue is full, pop n-1 entries off the queue and make a new queue
if ( _queue.Count >= Options.CurrentOptions.MaxTargetQueueLength )
{
List list = new List();
for ( int i = 0; i < Options.CurrentOptions.MaxTargetQueueLength - 1; i++ )
{
list.Add( _queue.Dequeue() );
}
_queue = new Queue( list );
}
_queue.Enqueue( obj );
}
}
public T Peek()
{
lock ( _lock )
{
try
{
return _queue.Peek();
}
catch ( InvalidOperationException )
{
return default;
}
}
}
public object Dequeue()
{
lock ( _lock )
{
return _queue.Dequeue();
}
}
public void Clear()
{
lock ( _lock )
{
_queue.Clear();
}
}
}
}