Click here to Skip to main content
15,881,172 members
Articles / Programming Languages / C#

Back to Basics - Generic Data Structures and Algorithms In .NET 2.0

Rate me:
Please Sign up or sign in to vote.
4.96/5 (93 votes)
23 Apr 2007Ms-PL15 min read 278.1K   2.6K   300  
Implementations of generic data structures and algorithms in .NET 2.0.
using System;
using System.Collections.Generic;
using System.Text;

namespace DataStructuresDotNet.DataStructures
{
	public interface IQueue<T>
	{
		/// <summary>
		/// Enqueues the item at the back of the queue.
		/// </summary>
		/// <param name="item">The item.</param>
		void Enqueue(T item);

		/// <summary>
		/// Dequeues the item at the front of the queue.
		/// </summary>
		/// <returns></returns>
		T Dequeue();

		/// <summary>
		/// Peeks at the item in the front of the queue, without removing it.
		/// </summary>
		/// <returns></returns>
		T Peek();
	}
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Microsoft Public License (Ms-PL)


Written By
Web Developer
South Africa South Africa
The author is a software consultant in South Africa, specializing in bespoke software solutions.

Comments and Discussions