问题描述
我是 Open Policy Agent (OPA) 和 Rego 语言的新手。我需要将我从输入获得的对象列表转换为一个对象(在 O(n) 时间的最佳情况下)。问题是使用的密钥可能在列表中重复。输入示例:
[
{
"id": "a","body": {...}
},{
"id": "b",{
"id": "a","body": {...}
}
]
预期输出:
{
"a": [
{
"id": "a","body": {...}
},{
"id": "a","body": {...}
}
],"b": [
{
"id": "b","body": {...}
}
]
}
这样做的最佳选择是什么?我尝试创建一个函数,但从未评估输出:
package test
inpt := [
{"id": "a","body":{"a":1}},{"id": "b",{"id": "a","body":{"a":2}},]
x := f(inpt)
f(input_list) = output_obj {
output_obj := {}
inner := input_list[_]
inner_list = object.get(output_obj,inner.id,[])
merged := array.concat(inner_list,[inner])
output_obj[inner.id] = merged
}
我发现的唯一选项是内循环 (O(n^2)):
output_obj := {i.id : [j | j:= inpt[_]; j.id == i.id] | i := inpt[_]}
解决方法
Comprehension indexing 应该确保 O(n) 运行时复杂度,因为规则满足条件(您的条件):
package test
output_obj := {id: list |
some i
id := input[i].id
list := [obj |
some j
input[j].id == id
obj := input[j]
]
}