zoukankan
html css js c++ java
Div显示/隐藏
<
style
type
="text/css"
>
.myInput
{
}
{
border
:
1px solid cadetblue
;
font-size
:
9pt
;
font-family
:
Tahoma,Courier New
;
padding-left
:
2px
;
padding-right
:
2px
;
}
.center
{
}
{
left
:
50%
;
top
:
50%
;
z-index
:
1
;
}
</
style
>
=================================
<
script
language
="javascript"
type
="text/javascript"
>
<!--
//
显示隐藏/隐藏附件列表
function
showDiv()
{
var
objDiv
=
document.getElementById(
"
divAnnexList
"
);
var
objLnk
=
document.getElementById(
"
lnk
"
);
if
(objDiv
==
"
undefined
"
)
return
;
if
(objDiv.style.display
==
"
none
"
)
{
showMenu(objLnk,objDiv);
//
objLnk.innerHTML = "隐藏附件列表";
}
else
{
hideMenu(objDiv);
//
objLnk.innerHTML = "显示附件列表";
}
}
//
显示附件列表
var
outDiv;
var
outObj;
var
displayTip
=
"
隐藏附件列表
"
;
var
hiddenTip
=
"
显示附件列表
"
;
function
showMenu(spnobj, hdnDiv)
{
outDiv
=
hdnDiv;
outObj
=
spnobj;
outObj.innerHTML
=
displayTip;
var
selstyle
=
(hdnDiv).style;
var
ttop
=
spnobj.offsetTop;
var
tleft
=
spnobj.offsetLeft;
var
thei
=
spnobj.clientHeight;
while
(spnobj
=
spnobj.offsetParent)
{
ttop
+=
spnobj.offsetTop;
tleft
+=
spnobj.offsetLeft;
}
if
((ttop
+
thei
+
4
+
selstyle.offsetHeight)
>
(document.body.scrollTop
+
document.body.offsetHeight)
&&
(selstyle.offsetHeight)
<
(ttop
-
1
))
{
selstyle.top
=
ttop
-
1
-
selstyle.offsetHeight;
//
超出边界时
}
else
{
selstyle.top
=
ttop
+
thei
+
16
;
}
selstyle.left
=
tleft;
selstyle.zIndex
=
1000
;
selstyle.display
=
'';
}
//
隐藏附件列表
function
hideMenu(sellayer)
{
outObj.innerHTML
=
hiddenTip;
if
(sellayer
!=
null
)
sellayer.style.zIndex
=-
1
;
sellayer.style.display
=
'none';
}
document.onclick
=
show;
function
show(e)
{
if
(
!
document.all)
{
var
srcEl
=
e.srcElement
?
e.srcElement : e.target;
if
(srcEl
!=
outDiv
&&
srcEl
!=
outObj)
{
if
(outDiv
&&
outDiv
!=
'undefined')
{
hideMenu(outDiv);
}
}
}
else
{
with
(window.event)
{
if
(event.srcElement
!=
outDiv
&&
event.srcElement
!=
outObj)
{
if
(outDiv
&&
outDiv
!=
'undefined')
{
hideMenu(outDiv);
}
}
}
}
}
//
-->
</
script
>
=============================================
<
table
width
="100%"
height
="35"
border
="0"
>
<
tr
>
<
td
height
="28"
><
input
type
="file"
name
="accessories2"
class
="myInput"
size
="55"
>
<
input
type
="button"
value
="上传"
class
="btn3_mouseout"
onmouseover
="this.className='btn3_mouseover'"
onmouseout
="this.className='btn3_mouseout'"
onmousedown
="this.className='btn3_mousedown'"
onmouseup
="this.className='btn3_mouseup'"
onclick
="javascript:location.replace('add_apply.jsp?actionName=InsertAccessoriesAllFile&applyid=<%= this.value("
apply_id") %
>
');">
<
a
id
="lnk"
href
="#lnk"
onclick
="javascript:showDiv();"
>
显示附件列表
</
a
>
</
td
>
</
tr
>
</
table
>
<!--
// 附件列表div
-->
<
div
class
="center"
id
="divAnnexList"
style
="100%; display:none; Z-INDEX: -1; POSITION: static;"
>
<
table
>
<
caption
align
="left"
>
附件列表:
<
hr
><
caption
>
<
exp:dataview
id
="listAccessories"
>
<%
CommonVO vo
=
( CommonVO )request.getAttribute(
"
listAccessories.vo
"
);
%>
<
tr
>
<
td
><
a
href
="#"
onclick
="javascript:location.replace('framework/common/download.jsp?subject=$bigtext_subject$');"
>
$subject$
</
a
></
td
>
<
td
>
<
a
href
="#"
onclick
="javascript:location.replace('add_apply.jsp?actionName=doDelAccessories&AccessoriesId=$bigtext_subject$');"
>
删除
</
a
></
td
>
</
tr
>
</
exp:dataview
>
</
table
>
</
div
>
<!--
附件列表div //
-->
查看全文
相关阅读:
PHP学习(6)——代码重用与函数编写的一些注意事项
PHP学习(5)——字符串操作与POSIX正则
PHP学习(4)——数组的使用
Three.js基础探寻十——动画
PHP学习(3)——数据的存储与检索
Three.js基础探寻九——网格
PHP学习(2)——操作符与迭代整理
个人寒假作业项目《印象笔记》第一天
《需求工程》阅读笔记2
《需求工程》阅读笔记
原文地址:https://www.cnblogs.com/ding0910/p/624080.html
最新文章
PBOC协议中对于所有电子存折/电子钱包应用的预处理
c语言的输入输出函数
Java 异常处理
c语言中的指针问题
Java中的原始类型(Primitive Types)与引用类型(Reference Values)
Java中的virtual method
程序中的@Override是什么意思
Leetcode#17 Letter Combinations of a Phone Number
Leetcode#122 Best Time to Buy and Sell Stock II
Leetcode#121 Best Time to Buy and Sell Stock
热门文章
Leetcode#120 Triangle
Leetcode#5 Longest Palindromic Substring
Leetcode#116 Populating Next Right Pointers in Each Node
Leetcode#166 Fraction to Recurring Decimal
Leetcode#114 Flatten Binary Tree to Linked List
Leetcode#113 Path Sum II
Leetcode#153 Find Minimum in Rotated Sorted Array
PHP学习(9)——错误和异常处理
PHP学习(8)——面向对象(下)
PHP学习(7)——面向对象(上)
Copyright © 2011-2022 走看看