This is functionally equivalent to before after logic reduction but this way it is a bit more explicit.
inputs: _
output: _
for io in #ios {
for k, v in io.inputs {
inputs: "\(k)": {
match: or([ for io2 in #ios {io2.inputs[k].match}])
if v.not != _|_ {
not: v.not
}
for i in [
for io in #ios
for k, _ in io.inputs {k},
] {
inputs: "\(i)": {
match: or([
for io in #ios
let input = io.inputs[i]
if input != _|_ {input.match},
])
if v.optional != _|_ {
optional: v.optional
}
}
for io in #ios
let input = io.inputs[i]
if input != _|_
for k, v in input
if k != "match" {"\(k)": v}
}
}
for io in #ios {
output: {
io
inputs: final_inputs
Somehow, the previous constraints set failed building ouroboros-consensus. Pinning unix-bytestring seems to solve the problem.
Somehow, the previous constraints set failed building ouroboros-consensus. Pinning unix-bytestring seems to solve the problem.
Somehow, the previous constraints set failed building ouroboros-consensus. Pinning unix-bytestring seems to solve the problem.
Signed-off-by: Chris Gianelloni <[email protected]>
- Update readme to address issues and questions presented by CPS-0001 - Update CDDL to support a more flexible scoping structure for future expansion
