Make resolve-allof partial recursive (#1787)
Makes it easier to use, like resolve-refs. It just needs to be called once. Fixes an issue with m.call.* events not displaying the common fields Signed-off-by: Kévin Commaille <zecakeh@tedomum.fr> Co-authored-by: Richard van der Hoff <1389908+richvdh@users.noreply.github.com>
This commit is contained in:
parent
073ce659df
commit
e82829d4a2
8 changed files with 56 additions and 94 deletions
|
@ -20,10 +20,6 @@
|
|||
* The returned entries are based on the JSON schema definitions found by
|
||||
* recursing through the input `schema`, with the following differences:
|
||||
*
|
||||
* * `allOf` references are expanded. (Although this partial requires that
|
||||
* `resolve-allof` is called on the top-level `schema` beforehand,
|
||||
* `resolve-allof` doesn't recurse down to subschemas).
|
||||
*
|
||||
* * If `anchor_base` is set, each object with a `title` and `properties`
|
||||
* is given an `anchor`, which is a string suitable for using as an html
|
||||
* anchor for that object schema.
|
||||
|
@ -210,12 +206,7 @@
|
|||
{{ errorf "Invalid call to partials/get-additional-objects: %s is not a map" $name .this_object }}
|
||||
{{ end }}
|
||||
|
||||
/* Although we expect resolve-allof to be called on the input, resolve-allof does not recurse into
|
||||
* nested schemas, so we have to call it again.
|
||||
*/
|
||||
{{ $this_object := partial "json-schema/resolve-allof" .this_object }}
|
||||
|
||||
{{ $res := partial "resolve-additional-types-inner" (dict "schema" $this_object "anchor_base" .anchor_base "name" $name) }}
|
||||
{{ $res := partial "resolve-additional-types-inner" (dict "schema" .this_object "anchor_base" .anchor_base "name" $name) }}
|
||||
{{ range $res.objects }}
|
||||
{{ $all_objects = $all_objects | append (partial "clean-object" .) }}
|
||||
{{ end }}
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
{{/*
|
||||
|
||||
Resolves the `allOf` keyword (https://spec.openapis.org/oas/v3.1.0#composition-and-inheritance-polymorphism),
|
||||
given a JSON schema object.
|
||||
Resolves the `allOf` keyword (https://spec.openapis.org/oas/v3.1.0#composition-and-inheritance-polymorphism)
|
||||
recursively, given a JSON schema object.
|
||||
|
||||
`allOf` is used to support a kind of inheritance for JSON schema objects.
|
||||
|
||||
|
@ -11,92 +11,71 @@
|
|||
|
||||
Of course the parent can itself inherit from *its* parent, so we recurse to
|
||||
handle that.
|
||||
|
||||
Note that `allOf` is only resolved at the top level of the schema object. For
|
||||
example, if you call this on an API definition which defines a `parameter`
|
||||
which has an allOf schema, it will not be resolved. To handle this, the
|
||||
openapi templates call resolve-allof for every schema object that they
|
||||
process.
|
||||
*/}}
|
||||
|
||||
{{ $ret := . }}
|
||||
{{ $original := . }}
|
||||
|
||||
{{/*
|
||||
We special-case 'required', and accumulate the values from all the 'allOf'
|
||||
entries (rather than simply overriding them). Start the accumulation here.
|
||||
*/}}
|
||||
{{ if reflect.IsSlice $original }}
|
||||
{{/*
|
||||
If it's a slice, just recurse.
|
||||
*/}}
|
||||
{{ $ret = slice }}
|
||||
|
||||
{{ $required := .required }}
|
||||
{{ if not $required }}
|
||||
{{ $required := slice }}
|
||||
{{ end }}
|
||||
|
||||
{{ with $ret.allOf }}
|
||||
{{ range $original }}
|
||||
{{ $resolved := partial "json-schema/resolve-allof" . }}
|
||||
{{ $ret = $ret | append $resolved }}
|
||||
{{ end }}
|
||||
{{ else if reflect.IsMap $original }}
|
||||
{{ $ret = dict }}
|
||||
|
||||
{{/*
|
||||
construct a new dict, with each of the allOf entries merged into it in
|
||||
turn.
|
||||
We special-case 'required', and accumulate the values from all the 'allOf'
|
||||
entries (rather than simply overriding them). Start the accumulation here.
|
||||
*/}}
|
||||
{{ $all_of_values := dict }}
|
||||
{{ range . }}
|
||||
{{ with .required }}
|
||||
{{ $required = union $required . }}
|
||||
{{ end }}
|
||||
{{ $required := slice }}
|
||||
{{ with $original.required }}
|
||||
{{ $required = . }}
|
||||
{{ end }}
|
||||
|
||||
{{ with $original.allOf }}
|
||||
{{/*
|
||||
With merge, values from the second argument override those from the first argument.
|
||||
So this order will accumulate values from allOf items, allowing later ones to override earlier
|
||||
|
||||
Note also that `merge` does a *deep* merge - nested maps are also
|
||||
merged. (Slices are replaced though.)
|
||||
Merge each of the allOf entries.
|
||||
*/}}
|
||||
{{ $all_of_values = merge $all_of_values . }}
|
||||
{{ range . }}
|
||||
{{/*
|
||||
First, resolve allOf in child.
|
||||
*/}}
|
||||
{{ $resolved := partial "json-schema/resolve-allof" . }}
|
||||
|
||||
{{ with $resolved.required }}
|
||||
{{ $required = union $required . }}
|
||||
{{ end }}
|
||||
|
||||
{{/*
|
||||
With merge, values from the second argument override those from the first argument.
|
||||
So this order will accumulate values from allOf items, allowing later ones to override earlier
|
||||
|
||||
Note also that `merge` does a *deep* merge - nested maps are also
|
||||
merged. (Slices are replaced though.)
|
||||
*/}}
|
||||
{{ $ret = merge $ret $resolved }}
|
||||
{{ end }}
|
||||
{{ end }}
|
||||
|
||||
{{/*
|
||||
Finally, merge in the original, allowing the original to override allOf.
|
||||
*/}}
|
||||
{{ $ret = merge $all_of_values $ret }}
|
||||
|
||||
{{/*
|
||||
Except that if allOf *itself* contains allOf (ie, the parent also
|
||||
inherits from a grandparent), then we replace allOf in the original
|
||||
with that in the parent. Below, we see that this has happened, and
|
||||
recurse.
|
||||
|
||||
TODO: surely it would be better to simply do the recursion as we iterate
|
||||
though the allOf list above - not least because we might have multiple
|
||||
parents with different grandparents, and by doing this we only get one
|
||||
set of grandparents.
|
||||
*/}}
|
||||
{{ with $all_of_values.allOf }}
|
||||
{{ $ret = merge $ret (dict "allOf" . ) }}
|
||||
{{ range $key, $value := $original }}
|
||||
{{ if and (ne $key "allOf") (ne $key "required") }}
|
||||
{{ $resolved := partial "json-schema/resolve-allof" $value }}
|
||||
{{ $ret = merge $ret (dict $key $resolved) }}
|
||||
{{ end }}
|
||||
{{ end }}
|
||||
|
||||
{{/*
|
||||
special-case 'required': replace it with the union of all the
|
||||
'required' arrays from the original and allOf values.
|
||||
|
||||
XXX: but first we merge in the original 'required', again? why
|
||||
do we do that? it should already have been done at the start.
|
||||
*/}}
|
||||
{{ with $ret.required }}
|
||||
{{ $required = union $required $ret.required }}
|
||||
{{ with $required }}
|
||||
{{ $ret = merge $ret (dict "required" .) }}
|
||||
{{ end }}
|
||||
|
||||
{{ $ret = merge $ret (dict "required" $required) }}
|
||||
{{ end }}
|
||||
|
||||
{{/*
|
||||
If we replaced the 'allOf' dict with one from a grandparent, we now
|
||||
need to recurse.
|
||||
*/}}
|
||||
{{ if ne $ret.allOf $original.allOf }}
|
||||
|
||||
{{ $resolved := partial "json-schema/resolve-allof" $ret }}
|
||||
{{ $ret = merge $ret $resolved }}
|
||||
|
||||
{{ end }}
|
||||
|
||||
{{ return $ret }}
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
|
||||
*/}}
|
||||
|
||||
{{ $this_object := partial "json-schema/resolve-allof" . }}
|
||||
{{ $this_object := . }}
|
||||
|
||||
{{ $example := $this_object.example }}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue