(礼拜三log)递归树算法2

/**
* 组织机构（树）
*/
public JSONArray tree(String id, Integer topLevel, Integer open, String url)
{
JSONArray tree = new JSONArray();
JSONArray orgs = find();

String top_id = "0";
if (topLevel != null && topLevel.equals(1))
{
JSONObject top = new JSONObject();
top.put("id", top_id);
top.put("name", "顶级机构");
top.put("iconSkin", "tollstation");
if (!StringUtil.isEmpty(url))
{
top.put("id", top_id + "_organizationId");
top.put("url", url + "&organizationId=" + top_id);
top.put("target", "_self");
}
JSONArray top_children = new JSONArray();
recursion_tree(top_children, orgs, id, top_id, open, url);
if (top_children.size() > 0)
{
if (open != null && open.equals(1))
top.put("open", true);
top.put("children", top_children);
}
tree.add(top);
} else
recursion_tree(tree, orgs, id, top_id, open, url);

return tree;
}

/**
* 组织机构递归（树）
*/
private void recursion_tree(JSONArray tree, JSONArray orgs, String id, Object parentId, Integer open, String url)
{
for (Object org_obj : orgs)
{
JSONObject org = (JSONObject) org_obj;
if (org.get("parentOrganizationId").equals(parentId) && (StringUtil.isEmpty(id) || !id.equals(org.get("organizationId"))))
{
JSONObject org_row = new JSONObject();
org_row.put("id", org.get("organizationId"));
org_row.put("name", org.get("organizationName"));
org_row.put("iconSkin", "tollstation");
if (!StringUtil.isEmpty(url))
{
org_row.put("id", org.get("organizationId") + "_organizationId");
org_row.put("url", url + "&organizationId=" + org.get("organizationId"));
org_row.put("target", "_self");
}

JSONArray org_children = new JSONArray();
recursion_tree(org_children, orgs, id, org.get("organizationId"), open, url);
if (org_children.size() > 0)
{
if (open != null && open.equals(1))
org_row.put("open", true);
org_row.put("children", org_children);
}
tree.add(org_row);
}
}
}

/**
* 组织机构（表树）
*/
public JSONArray findTable(Integer topLevel, JSONObject entity)
{
JSONArray list = new JSONArray();
JSONArray orgs = find(entity);
recursion_table(list, orgs, "0");
return list;
}

/**
* 组织机构递归（表树）
*/
public void recursion_table(JSONArray list, JSONArray orgs, Object parentId)
{
for (Object org_obj : orgs)
{
JSONObject org = (JSONObject) org_obj;
if (org.get("parentOrganizationId").equals(parentId))
{
list.add(org);
recursion_table(list, orgs, org.get("organizationId"));
}
}
}