如何实现与J2EE应用程序的异步处理(How to implement asynchronous processing with J2EE application)

 我读这个的方式，你试图将这棵树转换成只有Id，Name和Children的节点树。 在这种情况下，我认为它的方式是清洁节点。 
 
 要清理节点： 
 
 
 
 使用原始节点的Name和Id创建节点。 
 
 
 将新节点的Children设置为原始节点的子节点的已清理版本。 （这是递归调用。） 
 
 
 在代码中，那将是： 
 
def clean_node(node):
    return {
        'Name': node['Name'],
        'Id': node['Id'],
        'Children': map(clean_node, node['Children']),
    }

>>> print map(clean_node, data)
[{'Name': 'x', 'Children': [], 'Id': 'y'}, {'Name': 'xx', 'Children': [{'Name': 'xyx', 'Children': [], 'Id': 'yxy'}], 'Id': 'yy'}]
 
 我发现像这样打破递归问题更容易 - 尝试使用全局变量会很快变得非常混乱。 

The way I read this, you're trying to convert this tree into a tree of nodes which only have Id, Name and Children. In that case, the way I'd think of it is as cleaning nodes.
 
To clean a node:
 
 
 
Create a node with the Name and Id of the original node.
 
 
Set the new node's Children to be the cleaned versions of the original node's children. (This is the recursive call.)
 
 
In code, that would be:
 
def clean_node(node):
    return {
        'Name': node['Name'],
        'Id': node['Id'],
        'Children': map(clean_node, node['Children']),
    }

>>> print map(clean_node, data)
[{'Name': 'x', 'Children': [], 'Id': 'y'}, {'Name': 'xx', 'Children': [{'Name': 'xyx', 'Children': [], 'Id': 'yxy'}], 'Id': 'yy'}]
 
I find it's easier to break recursive problems down like this - trying to use global variables turns simple things very confusing very quickly.