";
}
else
{
regions = "keine Unterregion";
}
//alert(regions);
//getRefs(iWhich);
document.getElementById("ref_refs").innerHTML = "";
document.getElementById("ref_regions").innerHTML = regions;
}
}
request.send(null);
getBreadcrumbs(iWhich);
}
}
function getBreadcrumbs(iWhich)
{
if (bLoaded)
{
var urlstr="/refs.php?type=breadcrumbs&iWhich="+iWhich+"&lng="+iLang;
var request = creat_Object();
request.open('POST', urlstr , true);
request.onreadystatechange = function ()
{
if (request.readyState == 1)
{
document.getElementById("ref_region_crumbs").innerHTML = "Loading...";
}
else if (request.readyState == 4)
{
var xmlDoc = request.responseXML;
bcs = xmlDoc.documentElement.getElementsByTagName("bc");
document.getElementById("ref_region_crumbs").innerHTML = bcs[0].getAttribute("thebc");
}
}
request.send(null);
}
}
function creat_Object()
{
var xmlhttp;
if (!xmlhttp && typeof XMLHttpRequest != 'undefined')
{
try
{
xmlhttp = new XMLHttpRequest();
}
catch (e)
{
alert("Your browser is not supporting XMLHTTPRequest");
xmlhttp = false;
}
}
else
{
xmlhttp = new ActiveXObject("Microsoft.XMLHTTP");
}
return xmlhttp;
}
function randomEntries(array, number, noCycle, firstIndex)
{
if(typeof number == 'object') // int[] is a range - get random number
number = number[0] + Math.floor(Math.random()* (number[1]-number[0]+1));
var len = array.length;
if(len == 0 || number < 1)
return [];
if(len == 1)
noCycle = true;
var entries = []; // the random entries
var count = 0;
var rand;
var lastIndex = -1;
var mems = []; // boolean array controls cycle
if(typeof firstIndex == 'number' && firstIndex > -1 && firstIndex < len)
{
number++; // add 1 to include the first 'fixed' value
entries[count++] = array[firstIndex]; // store entry
lastIndex = firstIndex;
mems[firstIndex] = true;
}
if(noCycle) // get random indices - disregard duplicates
{
for(var i = count; i < number; i++)
{
rand = Math.floor(Math.random()*len);
entries[i] = array[rand];
}
return entries; // 'pure randoms' ready
}
// Two seperate loops to generate the random indices
if(len == 2)
{
var forcedFinalIndex = -1;
while(true) // len == 2 gives alternating singles and duos
{
// Create random index and store new entry
rand = Math.floor(Math.random()*len);
entries[count++] = array[rand];
if(count == number) // loop delimiter
break;
if(lastIndex == rand) // two in a row?
{
rand = 1 - rand; // toggle index
// If we start with a row, force a more cyclic index at the end
if(count == 2)
forcedFinalIndex = rand;
entries[count++] = array[rand];
if(count == number) // loop delimiter
break;
}
lastIndex = rand;
// If asked for at start, force final entry of binary array to differ
if(count == number-1 && forcedFinalIndex != -1)
{
entries[count++] = array[forcedFinalIndex];
break;
}
}
}
else // len > 2 follows 'random cycle' algorithm
{
var isFull = (number % len == 0); // when all comes full circle
while(count < number) // loop delimiter
{
rand = Math.floor(Math.random()*len);
if(count == 0)
firstIndex = rand; // keep the first random index
else
// If there are 2 more to go, and firstIndex has not yet come, but must come..
if(isFull && count == number-2 && !mems[firstIndex])
rand = firstIndex; // ..then force it!
else
{
var toggle = ((rand + count) % 3 == 0); // pseudo random toggle
while(mems[rand] || rand == lastIndex || // check against duplicates
(!isFull && count == number-1 && rand == firstIndex))
if(toggle)
{
if(--rand < 0)
rand = len-1; // shift rand back
}
else
if(++rand > len-1) // shuffle card forward
rand = 0;
}
// Store random entry
entries[count++] = array[rand];
mems[rand] = true; // keep cycle memory
lastIndex = rand;
if(count % len == len-1 && count != number)
{
// Take the last rand of a cycle to be the last 'still false' entry of mems
for(var i = 0; i < len; i++)
if(mems[i])
mems[i] = false; // clear cycle memory
else
{
entries[count++] = array[i];
lastIndex = i;
}
}
}
}
return entries; // 'cyclic randoms' ready
}