将复杂的树结构转换为 JSON Python

Question

我需要转换具有以下 class 结构的树：

Class Tree:     
    def __init__(self, data):         
        self.data = data         
        self.and_objects = []         
        self.or_objects = []

数据所在位置：

Class Data:     
    def __init__(self, var, operator, value):
        self.var = var
        self.operator = operator
        self.value = value
    def to_json(self):
        return {"var": self.var, "operator": self.operator, "value": self.value}

数据结构的简化示例：

Root
  andChildren
    x = 0
      andChildren
         a = 1
         b = 2 
    y = 10
      andChildren
         a = 3   
      orChildren
         y = 3
            andChildren
               a = 2
         
  orChildren
    Empty

计算结果为：

((x == 0 and (a == 1 and b == 2)) and ((y == 10 and (a == 3)) or (y == 3 and a == 2))

我需要将树数据结构转换为：

{
   "Search":{
      "Root":{
         "compare_operator":"and",
         "values":[
            {
               "compare_operator":"and",
               "values":[
                  {
                     "var":"x",
                     "operator":"=",
                     "value":"0"
                  },
                  {
                     "compare_operator":"and",
                     "values":[
                        {
                           "var":"a",
                           "operator":"=",
                           "value":"1"
                        },
                        {
                           "var":"b",
                           "operator":"=",
                           "value":"2"
                        }
                     ]
                  }
               ]
            },
            {
               "compare_operator":"or",
               "values":[
                  {
                     "compare_operator":"and",
                     "values":[
                        {
                           "var":"y",
                           "operator":"=",
                           "value":"10"
                        },
                        {
                           "var":"a",
                           "operator":"=",
                           "value":"3"
                        }
                     ]
                  },
                  {
                     "compare_operator":"and",
                     "values":[
                        {
                           "var":"y",
                           "operator":"=",
                           "value":"3"
                        },
                        {
                           "var":"a",
                           "operator":"=",
                           "value":"2"
                        }
                     ]
                  }
               ]
            }
         ]
      }
   }
}

有人 tips/methods 知道如何将这个树数据结构转换成这个 json 结构吗？

我已经尝试了几个递归算法，但我无法让它们产生所需的 JSON 输出。

重新创建此结构的脚本：


Class Tree:     
    def __init__(self, data="root"):         
        self.data = data         
        self.and_objects = []         
        self.or_objects = []
        
Class Data:     
    def __init__(self, var, operator, value):
        self.var = var
        self.operator = operator
        self.value = value
    def to_json(self):
        return {"var": self.var, "operator": self.operator, "value": self.value}
        
def create_search(var, operator, value, parent, comparision="and")
    data = Data(var, operator, value)
    child = Tree(data)
    if comparision == "and":
        parent.and_objects.append(child)
    else:
        parent.or_objects.append(child)
    return child
    
if __name__ == "__main__":
    root_tree = Tree()
    x_temp = create_search("x", "=", "0", root_tree)
    create_search("a", "=", "1", x_temp)
    create_search("b", "=", "2", x_temp)
    
    y_temp = create_search("y", "=", "10", root_tree)
    create_search("a", "=", "3", root_tree, y_temp)
    nested_y_temp = create_search("y", "=", "3", root_tree, y_temp, "or")
    create_search("a", "=", "2", root_tree, nested_y_temp)
    
    # tree data is on root_tree

Answer 1

我会选择不同的初始结构。在您的结构中，AND 或 OR 运算符需要有一个 Data 实例作为父级。并且 Data 实例与 both 以及依赖于它的 AND 和 OR 列表相结合。

我建议允许 top-level AND 或 OR 运算符将其所有操作数作为子运算符。您还可以为 AND 和 OR 运算符以及 EQUALITY 运算符创建单独的类。

这是它的样子：

class Logical():
    def __init__(self, operator, operands):
        self.operands = operands
        self.operator = operator

    def __str__(self):
        return f" {self.operator} ".join(map(str, self))

    def asdict(self):
        return { 
            "compare_operator": self.operator, 
            "values": [operand.asdict() for operand in self.operands]
        }

class And(Logical):
    def __init__(self, *operands):
        super().__init__("and", operands)

class Or(Logical):
    def __init__(self, *operands):
        super().__init__("or", operands)


class Condition:
    def __init__(self, var, operator, value):
        self.var = var
        self.operator = operator
        self.value = value
        
    def asdict(self):
        return {
            "var": self.var, 
            "operator": self.operator, 
            "value": self.value
        }

class Equal(Condition):
    def __init__(self, var, value):
        super().__init__(var, "=", value)

结构创建示例：

expression = And(
    And(
        Equal("x", 0), 
        And(
            Equal("a", 1), 
            Equal("b", 2), 
        ),
    ),
    Or(
        And(
            Equal("y", 10), 
            Equal("a", 3)
        ),
        And(
            Equal("y", 3),
            Equal("a", 2)
        )
    )
)

将其变为 JSON:

import json

result = {
    "Search": {
        "Root": expression.asdict()
    }
}

print(json.dumps(result, indent=4))

这会打印：

{
    "Search": {
        "Root": {
            "compare_operator": "and",
            "values": [
                {
                    "compare_operator": "and",
                    "values": [
                        {
                            "var": "x",
                            "operator": "=",
                            "value": 0
                        },
                        {
                            "compare_operator": "and",
                            "values": [
                                {
                                    "var": "a",
                                    "operator": "=",
                                    "value": 1
                                },
                                {
                                    "var": "b",
                                    "operator": "=",
                                    "value": 2
                                }
                            ]
                        }
                    ]
                },
                {
                    "compare_operator": "or",
                    "values": [
                        {
                            "compare_operator": "and",
                            "values": [
                                {
                                    "var": "y",
                                    "operator": "=",
                                    "value": 10
                                },
                                {
                                    "var": "a",
                                    "operator": "=",
                                    "value": 3
                                }
                            ]
                        },
                        {
                            "compare_operator": "and",
                            "values": [
                                {
                                    "var": "y",
                                    "operator": "=",
                                    "value": 3
                                },
                                {
                                    "var": "a",
                                    "operator": "=",
                                    "value": 2
                                }
                            ]
                        }
                    ]
                }
            ]
        }
    }
}

将复杂的树结构转换为 JSON Python

Converting Complex Tree Structure to JSON Python

python

json

recursion

tree