d = new Date();
year = d.getFullYear();

function menuDisplay(state) {
	var immiStart = document.getElementById("nav-immistart");
	var immiFull = document.getElementById("nav-imminav");
	var piStart = document.getElementById("nav-persinjstart");
	var piFull = document.getElementById("nav-persinjnav");
	var piTab = document.getElementById("nav-persinjtab");
	if (state == "start") {
		piTab.style.display = "block";
		immiFull.style.display = "none";
		piFull.style.display = "none";
		immiStart.style.display = "block";
		piStart.style.display = "block";
	}
	if (state == "immi") {
		if (immiFull.style.display == "block") {
			piTab.style.display = "none";
			menuDisplay('start');
		} else {
		piTab.style.display = "none";
		piFull.style.display = "none";
		immiStart.style.display = "none";
		piStart.style.display = "block";
		immiFull.style.display = "block";
		piTab.style.display = "block";
		}
	}
	if (state == "persinj") {
		if (piFull.style.display == "block") {
			menuDisplay('start');
		} else {
		immiFull.style.display = "none";
		piStart.style.display = "none";
		immiStart.style.display = "block";
		piFull.style.display = "block";
		}
	}
}
window.onload = function() {
	if (menuVar == "") {
		menuDisplay('start');
	} else if (menuVar == "immigration") {
		menuDisplay('immi');
	} else if (menuVar == "personalinjury") {
		menuDisplay('persinj');
	} else {
		menuDisplay('start');
	}
	clearCurrentLink();
}

/*
CLCP v2.1 Clear Links to Current Page
Jonathan Snook
This code is offered unto the public domain
http://www.snook.ca/jonathan/
*/

//MOVED INTO FUNCTION ABOVE
//window.onload = clearCurrentLink;

function clearCurrentLink(){
    var a = document.getElementsByTagName("A");
    for(var i=0;i<a.length;i++)
        if(a[i].href == window.location.href.split("#")[0])
            a[i].className = "on"; //removeNode(a[i]);
}

function removeNode(n){
    if(n.hasChildNodes())
        for(var i=0;i<n.childNodes.length;i++)
            n.parentNode.insertBefore(n.childNodes[i].cloneNode(true),n);
    n.parentNode.removeChild(n);
}
