Allow more methods to qualify start nodes of transformation ancestors and descendants

XMLWordPrintable

    • Type: New Feature
    • Resolution: Fixed
    • Priority: Major
    • V4.0_CSD04
    • Affects Version/s: V4.0_CS02
    • Component/s: Data Aggregation
    • None
    • Environment:

      Applied

    • Hide

      Proposal is to replace the filter expression parameter by a parameter accepting a transformation sequence returning a result that preserves the structure of the input set. This approach covers filter expressions and search via the filter and search transformations and leaves room for further applications.

      (detailed text proposal to follow)

      Show
      Proposal is to replace the filter expression parameter by a parameter accepting a transformation sequence returning a result that preserves the structure of the input set. This approach covers filter expressions and search via the filter and search transformations and leaves room for further applications. (detailed text proposal to follow)
    • Hide

      https://github.com/oasis-tcs/odata-abnf/pull/80

      https://www.oasis-open.org/apps/org/workgroup/odata/download.php/69985/ODATA-1533.docx

      Show
      https://github.com/oasis-tcs/odata-abnf/pull/80 https://www.oasis-open.org/apps/org/workgroup/odata/download.php/69985/ODATA-1533.docx

      At present, ancestors and descendants accept a filter expression as parameter to qualify instances of the input set as start nodes for the transformation.

      We found that there are interesting use cases with further methods to identify such start nodes, including a free-text search. Supporting only filter expressions seems too limited and should be generalized.

            Assignee:
            Unassigned
            Reporter:
            gerald.krause1
            Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

              Created:
              Updated:
              Resolved: