function tracklist(cdid){
var i
  for (i=0; i<6; i++)
   {cdid=cdid.replace("_","")} 
window.location="http://www.flyinghands.com/t" + cdid + ".htm"
}

function SetScreen2Bask(btn) {
btn.form.Screen.value='BASK' 
}
/* used on login screen */
function email_checkbox(e){
  if(e.checked) {
    document.logn.Action1.value='EMPW'
    document.logn.pw.value=''
    document.logn.btnLogin.innerHTML='&nbsp; Send Email &nbsp;&nbsp;';
  } else {
    document.logn.Action1.value='LOGN'
    document.logn.btnLogin.innerHTML='&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Sign In &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;';
  }
}

/* Used to present favorite tracks in order */
function TracksOut1() {
	var i=0;
	var track="";
	var links="";
	for (i=0; i<tracks.length; i++) {
		track=tracks[i];
		links = links + "<a class='oxplayer' title='" + track[0] + " " + track[1] + "' name='" + track[2] + "' href='javascript:void(" + track[2] + ");'>" + track[0] + "</a><br>";
	}
	/*document.getElementById("Links-StockMusic").innerHTML=links; */
	links="";
}

/* Used to present random favorite tracks */
function TracksOut() {
	var list=rndseqence(10,tracks.length);
	var i=0; var j=0;
	var track="";
	var links="";
	for (i=0; i<list.length; i++) {
		j=list[i]-1;
		track=tracks[j];
		links = links + "<a class='oxplayer' title='" + track[0] + " " + track[1] + "' name='" + track[2] + "' href='javascript:void(" + track[2] + ");'>" + track[0] + "</a><br>";
	}
	/*document.getElementById("Links-StockMusic").innerHTML=links; */
	links="";
}

function rndseqence(size,limit) {
// Non repeating sequence of randomly generated numbers by Ray Yates http://www.yatesoft.com

  if (size > limit) {
    alert("The size of the list can not exceed the upper number limit");
    return null;
  } else {
    var numlist=new Array(size);
    var i=0; var j=0; var n=0;
    while (i<numlist.length) {
      n=Math.random();
      n=Math.round(n*limit);
      while (n==0) {
        n=Math.random();
        n=Math.round(n*limit);
      }
      pass=true;
      if (i>0) {
        for (j=0;j<i;j++) {
          if (numlist[j]==n) {
            pass=false;
          }
        }
      }
      if (pass) {
        numlist[i]=n;
        i++;
      }
    }
    return numlist;
  }
}