Learning a little TypeScript - Implementing a generic Queue collection

Not being much of a JavaScript guy, other than dabbling when I needed a little client side script, I thought I should probably join the rest of the world and move away from the comfort of C/C++ and C#. Taking baby steps I tried my hand at TypeScript first. I thought others might find my first attempt useful.

Wanting to try out classes and generics, I decided to implement a toy collection class. The snippet  is loosely based on the .NET generic Queue collection interface and implements a similar collection in TypeScript.

Without further ado, here is my very first TypeScript snippet.

	/**
	* Generic typed Queue representing a fisrt in, first out collection
	*/
	class Queue<T>
	{
	private _queue : T[];
	private _head : number;
	private _tail : number;
	private _count : number;
	/**
	* Creates an empty queue
	*/
	public constructor()
	{
	this.clear();
	}
	/**
	* Adds an item to the back of the queue
	*/
	public enqueue(item : T)
	{
	if ((this._count + 1) == this._queue.length)
	{
	this._queue.length *= 2;
	}
	this._queue[this._tail] = item;
	this._tail = (this._tail + 1) % this._queue.length;
	++this._count;
	}
	/**
	* Removes and returns the item at the front of the queue.
	* If the queue is empty 'undefined' is returned.
	*/
	public dequeue() : T
	{
	if (this._count == 0) return undefined;
	let result : T = this._queue[this._head];
	this._head = (this._head + 1) % this._queue.length;
	--this._count;
	return result;
	}
	/**
	* Returns the item at the front of the queue without removing it.
	* If the queue is empty 'undefined' is returned.
	*/
	public peek() : T
	{
	if (this._count == 0) return undefined;
	return this._queue[this._head];
	}
	/**
	* Removes all the items from the queue.
	*/
	public clear()
	{
	this._queue = [];
	this._head = 0;
	this._tail = 0;
	this._count = 0;
	this._queue.length = 4;
	}
	/**
	* Iterate through each item in the queue and call the callback for each item.
	*/
	public forEach(callback : (item : T) => any)
	{
	for(let i : number = this._head;
	i < this._tail;
	i = (i + 1) % this._queue.length)
	{
	callback(this._queue[i]);
	}
	}
	/**
	* Returns the number of items in the queue.
	*/
	public get count() : number
	{
	return this._count;
	}
	}

view raw queue.ts hosted with ❤ by GitHub

And here is a quick and dirty sample showing how the queue could be used

	var q = new Queue<string>();
	q.enqueue("Chris");
	q.enqueue("Natasha");
	q.enqueue("Tamrin");
	q.enqueue("Kaylen");
	q.enqueue("Kristen");
	while (q.count > 0)
	{
	let text = document.createElement('div');
	text.textContent = q.dequeue();
	document.body.appendChild(text);
	}

view raw queue.demo.ts hosted with ❤ by GitHub