js顯示層、js隱藏層函數(shù) 附參數(shù)使用說明

js顯示層、js隱藏層函數(shù) 附參數(shù)使用說明

/*
========================
函數(shù)：顯示或隱藏層
showDiv(divId_array,showLocality_array)
參數(shù)說明：
divId_array 所有要操作的層ID，用逗號分隔
showLocality_array 所有要顯示的層在參數(shù)DivIdArray所對應的位置。為“0”或空時全部顯示，設為負數(shù)則全部隱藏。
例如：showDiv('div3,div1,div2','2,3')為顯示第二個(div1)和第三個層(div2)，第一個層(div3)將被隱藏。
========================
*/
function showDiv(divId_array,showLocality_array)
{
var div_array = new Array();
var locality_array = new Array();
var intLocality;//showLocality_array數(shù)組長度
var intDiv;//div_array 數(shù)組長度
var intTemp = 1;//臨時變量
var intTmp = 1;//臨時變量

//初始化
if (divId_array)
{
div_array = divId_array.split(",");
}else{
intDiv = 0;
}
if (showLocality_array)
{
locality_array = showLocality_array.split(",");
intLocality = locality_array.length;

for (var n = 0;n < intLocality;n++)
{
intTemp *= locality_array[n];

}
if (intTemp <= 0)
{
intLocality = intTemp;
}else{
intLocality = div_array.length;

while (intLocality > 0)
{
intLocality -= 1;
document.getElementById(""+ div_array[intLocality] +"").style.display = "none";
}
intLocality = 1;
}
}else{
intLocality = 0;
}

//顯示指定層
if (intDiv != 0 && intLocality >0)
{
intDiv = div_array.length;
intLocality = locality_array.length;

//排序locality_array 數(shù)組 liehuo.net
for (var n = 0;n < intLocality;n++)
{
intTemp = locality_array[n];

for (var m = n + 1;m < intLocality;m++)
{
if (locality_array[n] > locality_array[m])
{
locality_array[n] = locality_array[m];
locality_array[m] = intTemp;
intTemp = locality_array[n];
}
}
}

intLocality = locality_array.length;
intTemp = 0;

//
while (intTemp < intLocality)
{
if ((locality_array[intTemp] - 1) < div_array.length)
{
intTmp = locality_array[intTemp] - 1;
document.getElementById(""+ div_array[intTmp] +"").style.display = "block";
}

intTemp += 1;
}
}
else if(intLocality == 0)
{//顯示所有層
intLocality = div_array.length;

while (intLocality > 0)
{
intLocality -= 1;
document.getElementById(""+ div_array[intLocality] +"").style.display = "block";
}
}else{//隱藏所有層
intLocality = div_array.length;

while (intLocality > 0)
{
intLocality -= 1;
document.getElementById(""+ div_array[intLocality] +"").style.display = "none";
}
}
}

生活不易，碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學習有所幫助,可以手機掃描二維碼進行捐贈