[MiniRelease] Queue system

[pro4never]

Ok so I discovered and slightly fell in love with the concept of queue's semi recently but was consistently annoyed by certain lack of functions they had.

Namely the ability to remove things prematurely that I did not want in the queue.

So tonight I was bored and wrote up a VERY simple queue system. It's NOT perfect but it seems to work in my initial tests.


It's storing objects so you can use it to store ANY VALUE YOU LIKE! Just be sure you are checking the type you are holding before you try to process it..




EXAMPLES OF HOW TO USE!


Simply add the reference to your project and then add it to your 'using' statements wherever you plan to setup the queue.

Personally I have it in my map structure to hold ground items (that way I can remove them from the server based on timeout in order they are dropped OR remove them when looted regardless of where they are in the queue)

using Queuing;

Now to setup you simply do something like...

Queueing.Queue Items = new Queueing.Queue();

Congratz! your queue is now setup! You will notice there are a few options to use...


Count: returns number of objects in the queue currently
Peek(): returns but does NOT remove the first object in the queue (next to be processed). Use for checks
Dequeue(): returns and removes the first object in queue (next to be processed)
Queue(object): adds the specified object to the END of the queue (LAST to be processed)
Remove(object): Removes the specified object from the queue regardless of its position.


Now! be sure to interpret the data that you are receiving back from the queue. You can do this with simple if checks.

Eg:

if(!(ItemsQueue.Peek is GroundItem)
return;

Be sure to convert your returned data into this type also!

eg:

GroundItem I = (GroundItem) ItemsQueue.Dequeue();


It's not obfuscated so feel free to decompose and offer criticism. It's simply a dictionary which adds/returns based on current object count. Nothing fancy at all.

I'm just starting to write some dll's (had never done it before) so maybe next time I'll do something more useful.


<edit>

Updated file: I was dumb and did a couple things wrong for the Remove(object) method. It works now. Please provide input and anything else you'd like to see done with it or other methods you'd like added.

Anyone have suggestions for dynamic handling of types? objects were the best way I could envision holding data but I wasn't sure if there is something better in C# to use to define what should be held or w/e.

[teroareboss1]

is and

         System.Collections.Queue Items = new System.Collections.Queue();

[Basser]

This should not be in the Conquer Online section but somewhere around the programming section.

[Korvacs]

Moved.

[pro4never]

Originally Posted by teroareboss1

is and

         System.Collections.Queue Items = new System.Collections.Queue();

That's the queue system already in C# actually.

@ Basser/Korv.

Thanks for cleaning up the duplicate threads. Was hella tired when I posted. My bad.

[IAmHawtness]

Although I've never felt the need for it, I guess combining the features of a list with the features of a queue is a pretty good idea. I wonder why Microsoft didn't think of it though. They could call it something like.. queued list?

[Trigorio]

Originally Posted by IAmHawtness

Although I've never felt the need for it, I guess combining the features of a list with the features of a queue is a pretty good idea. I wonder why Microsoft didn't think of it though. They could call it something like.. queued list?

I acctually use queues for a few things :P

[IAmHawtness]

Originally Posted by Trigorio

I acctually use queues for a few things :P

So do I, but I've never really felt the need to remove a specific object inside a queue

[Trigorio]

Originally Posted by IAmHawtness

So do I, but I've never really felt the need to remove a specific object inside a queue

Don't think I have either. Can't remember.

[Korvacs]

This would be useful for say.... items stored on a floor queued for default removal (1 minute) and then removing it early if someone picks it up, i also created something like this for that specific purpose.

[pro4never]

Originally Posted by Korvacs

This would be useful for say.... items stored on a floor queued for default removal (1 minute) and then removing it early if someone picks it up, i also created something like this for that specific purpose.

Yupp, that's exactly what I created this for.

[_tao4229_]

Hows this any different than the System.Collections(.Generic) Queue?

[Korvacs]

The standard Queue doesnt allow you to remove items from any point in the Queue, just from the front. This allows you to remove items at any point in the Queue.

[_tao4229_]

            Queue q = new Queue();
            q.Enqueue("Item 1"); // add our items
            q.Enqueue("Item 2");
            q.Enqueue("Item 3");
            Console.WriteLine(q.Peek()); // Item 1
            Console.WriteLine(q.Dequeue()); // Item 1

            q.Remove("Item 2"); // Removes Item 2 (currently the first item in the Queue)

            Console.WriteLine(q.Peek()); // key not present in dictionary exception
            Console.WriteLine(q.Dequeue()); // ^

Also:

public class Queue<T> {
  public void Enqueue(T obj);
  public T Dequeue();
}
/// Queue<string> q = new Queue<string>();
/// q.Enqueue("Hi");
/// string greeting = q.Dequeue();

And another edit:

I decided to have my hand at it and came up with this:

    public class Queue<T>
    {
        private LinkedListNode<T> First = null;
        private LinkedListNode<T> Last = null;
        private int m_Count;

        public int Count { get { return m_Count; } }

        public void Enqueue(T obj)
        {
            lock (this)
            {
                if (First == null)
                {
                    First = new LinkedListNode<T>(obj);
                    Last = First;
                }
                else
                {
                    LinkedListNode<T> node = new LinkedListNode<T>(obj);
                    Last.Next = node;
                    Last = node;
                }
                m_Count++;
            }
        }
        public T Dequeue()
        {
            lock (this)
            {
                if (First == null)
                {
                    throw new Exception("No elements left in the Queue");
                }
                else
                {
                    LinkedListNode<T> node = First.Next;
                    T retn = First.Value;

                    First = node;
                    m_Count--;
                    return retn;
                }
            }
        }
        public T Peek()
        {
            lock (this)
            {
                if (First == null)
                {
                    throw new Exception("No elements left in the Queue");
                }
                else
                {
                    return First.Value;
                }
            }
        }

        public bool Remove(T value)
        {
            lock (this)
            {
                if (First.Value.Equals(value))
                {
                    First = First.Next;
                    m_Count--;
                    return true;
                }

                LinkedListNode<T> node = First;
                while (node != null && node.Next != null)
                {
                    if (node.Next.Value.Equals(value))
                    {
                        node.Next = node.Next.Next;
                        m_Count--;
                        return true;
                    }
                    node = node.Next;
                }
                return false;
            }
        }
    }
    public class LinkedListNode<T>
    {
        public T Value;
        public LinkedListNode<T> Next;
        public LinkedListNode(T value)
        {
            Value = value;
        }
    }

[InfamousNoone]

**** Saint, you beat me to it. By a couple days it looks like too.