java

黑色的熊猫 2011-11-04 03:36:28
str+=' <input type="checkbox" name="chkbox" value="'+node.id+'" id="c'+ this.obj + nodeId + '" onclick="javascript:'+this.obj+'.selectNodes('+nodeId+')"> ';
...全文
55 5 打赏 收藏 转发到动态 举报
写回复
用AI写文章
5 条回复
切换为时间正序
请发表友善的回复…
发表回复
黑色的熊猫 2012-03-12
  • 打赏
  • 举报
回复
private static String convertStringToStream(InputStream in) throws Exception{
BufferedReader reader = new BufferedReader(new InputStreamReader(in));
StringBuilder builder = new StringBuilder();
String line = null;
while((line = reader.readLine())!= null){
builder.append(line + "\n");
}
in.close();
return builder.toString();
}
@Test
public void testReadContentbyStream() throws Exception
{
String contentId = "12";
String partNo = "12";
InputStream inputStream = contentStorageService.readContentbyStream(contentId, partNo);
System.out.println(convertStringToStream(inputStream));
}
黑色的熊猫 2012-02-24
  • 打赏
  • 举报
回复
http://simple1024.iteye.com/blog/979574
xiaoqinD 2011-11-04
  • 打赏
  • 举报
回复
List<String> list = new ArrayList<String>();
if(null != str && !"".equals(str))
{
String [] strs = str.split(",");
for (int i = 0; i < strs.length; i++)
{
list.add(strs[i]);
}
int sum = list.size();
for (int i = 0; i < strs.length; i++)
{
for (int j = 0; j < sum; j++)
{
if (!strs[i].contains("/"))
{
if (list.get(j).indexOf(strs[i]) == 0
&& !list.get(j).equals(strs[i]))
{
list.remove(j);
j--;
sum--;
}
continue;
}
if ((strs[i].split("/").length == 2))
{
if (list.get(j).indexOf(strs[i]) == 0
&& !list.get(j).equals(strs[i]))
{
list.remove(j);
j--;
sum--;
}
}
}

}
}
xiaoqinD 2011-11-04
  • 打赏
  • 举报
回复
dTree.prototype.selectNodes = function(nodeId) {

var cs = document.getElementById("c"+this.obj+nodeId).checked;

var n,node = this.aNodes[nodeId];

var len =this.aNodes.length;

for (n=0; n<len; n++) {

if (this.aNodes[n].pid == node.id) {

document.getElementById("c"+this.obj+n).checked=cs;

this.selectNodes(n);

}
}


var $$ = function(id){
return document.getElementById(id);
}

var findparent = function(pid,nodes){
for(var i=0;i<nodes.length;i++)
{
if(nodes[i].id == pid)
{
return {obj:nodes[i],index:i};
}
}
return null;
}

var findchilds = function(pid,nodes) {
var childs = [];
for(var i=0;i<nodes.length;i++)
{
var obj = {};
if(nodes[i].pid == pid){
childs[childs.length] = {obj:nodes[i],index:i};
}
}
return childs;
}
xiaoqinD 2011-11-04
  • 打赏
  • 举报
回复
var findallparent = function(pid,nodes){
var parents = [];
for(var i=0;i<nodes.length;i++){
if(nodes[i].id == pid){
parents[parents.length] = {obj:nodes[i],index:i};
parents = parents.concat(findallparent(findparent(pid,nodes).obj.pid,nodes));
break ;
}
}
return parents;
}

if(cs==false){

var pid=node.pid;
var bSearch;
var parents = findallparent(pid,this.aNodes);

var m = parents.length;
var i = 0;
for(i=0;i<m;i++)
{
var cbx = $$("ctree"+parents[i].index);
cbx.checked = false;
}

}

var selectparent = function(pid,nodes){

var parentNode = findparent(pid,nodes);
var childs = findchilds(pid,nodes);
var m = childs.length;
var i = 0;
for(i=0;i<m;i++)
{
var cbx = $$("ctree"+childs[i].index);
if(!(cbx && cbx.checked))
{
break;
}
}
if(i == m && parentNode)
{
$$("ctree" + parentNode.index).checked = true;
selectparent(findparent(pid,nodes).obj.pid,nodes);
}
}

if(cs==true){
var pid=node.pid;
var bSearch;

selectparent(pid,this.aNodes);

23,407

社区成员

发帖
与我相关
我的任务
社区描述
Java 非技术区
社区管理员
  • 非技术区社区
加入社区
  • 近7日
  • 近30日
  • 至今
社区公告
暂无公告

试试用AI创作助手写篇文章吧