Loading md/annex-d.md +77 −46 Original line number Diff line number Diff line Loading @@ -51,21 +51,40 @@ above are satisfied: 1. Add to C a new member <"AliasT", T> or new members <"AliasT1", T1> ... <"AliasTn", Tn>. 2. Add to O two new members: - a. <"id", I>. - b. <"type", "AliasT"> or <"type", "AliasT1", ...,"AliasTn"> .">. <!-- prettier-ignore-start --> a. <"id", I>. b. <"type", "AliasT"> or <"type", "AliasT1", ...,"AliasTn"> .">. <!-- prettier-ignore-end --> 3. For each _Property_ Psi (Pi, "AliasP", Vi, Di) associated to N: - a. Run Algorithm ALG1.1 taking the following inputs: <!-- prettier-ignore-start --> a. Run Algorithm ALG1.1 taking the following inputs: - Ps → Psi. - O → O. - C → C. <!-- prettier-ignore-end --> 4. For each _Relationship_ Rs (Ri, AliasRi, Robji) associated to N: - a. Run Algorithm ALG1.2 taking the following inputs: <!-- prettier-ignore-start --> a. Run Algorithm ALG1.2 taking the following inputs: - Rs → Rsi. - O → O. - C → C. <!-- prettier-ignore-end --> 5. Return (O, C) and end of the algorithm. ## D.3 Algorithm for transforming an NGSI-LD Property into JSON-LD (ALG1.1) Loading @@ -82,28 +101,34 @@ _Relationships_. Let O be the output JSON-LD object and C the associated JSON-LD context: 1. Execute the following steps: - a. If no member with "AliasP" is present in O, add a new member to O with <!-- prettier-ignore-start --> a. If no member with "AliasP" is present in O, add a new member to O with key "AliasP" and value an object structure, let it be named **Op** - <"type", "Property">. <"type", "Property">. - If D is not a native JSON data type add a new member to Op with name "value" and which value has to be an object structure as follows: 1. <"@type", D>. 2. <"@value", V>. - Else If D is a native JSON data type add a new member to Op as follows: 1. <"value", V>. - b. Add a new member to C as follows: b. Add a new member to C as follows: - <"AliasP", P>. - c. For each _Property_ associated to Ps (Pss) c. For each _Property_ associated to Ps (Pss) recursively run the present algorithm (ALG1.1) taking the following inputs: - Ps → Pss. - O → Op. - C → C. - d. For each _Relationship_ associated to Ps (Rss) run d. For each _Relationship_ associated to Ps (Rss) run algorithm ALG1.2 taking the following inputs: - Rs → Rss. - O → Op. - C → C. <!-- prettier-ignore-end --> 2. Return (O,C) and end of the algorithm. ## D.4 Algorithm for transforming an NGSI-LD Relationship into JSON-LD (ALG1.2) Loading @@ -120,18 +145,24 @@ _Relationships_. Let O be the output JSON-LD object and C the current JSON-LD context: 1. Execute the following statements: - a. If no member with "AliasR" is present in O, add a new member to O with <!-- prettier-ignore-start --> a. If no member with "AliasR" is present in O, add a new member to O with key "AliasR" and value an object structure, let it be named **Or** - <"object", Robj>. - <"type", "Relationship">. - b. For each _Property_ associated to Rs (Pss) run the b. For each _Property_ associated to Rs (Pss) run the algorithm ALG1.1 taking the following inputs: - Ps → Pss. - O → Or. - C → C. - c. For each _Relationship_ associated to Rs (Rss) c. For each _Relationship_ associated to Rs (Rss) recursively run the present algorithm ALG1.2 taking the following inputs: - Rs → Rss. - O → Or. - C → C. <!-- prettier-ignore-end --> 2. Return (O,C) and end of the algorithm. Loading
md/annex-d.md +77 −46 Original line number Diff line number Diff line Loading @@ -51,21 +51,40 @@ above are satisfied: 1. Add to C a new member <"AliasT", T> or new members <"AliasT1", T1> ... <"AliasTn", Tn>. 2. Add to O two new members: - a. <"id", I>. - b. <"type", "AliasT"> or <"type", "AliasT1", ...,"AliasTn"> .">. <!-- prettier-ignore-start --> a. <"id", I>. b. <"type", "AliasT"> or <"type", "AliasT1", ...,"AliasTn"> .">. <!-- prettier-ignore-end --> 3. For each _Property_ Psi (Pi, "AliasP", Vi, Di) associated to N: - a. Run Algorithm ALG1.1 taking the following inputs: <!-- prettier-ignore-start --> a. Run Algorithm ALG1.1 taking the following inputs: - Ps → Psi. - O → O. - C → C. <!-- prettier-ignore-end --> 4. For each _Relationship_ Rs (Ri, AliasRi, Robji) associated to N: - a. Run Algorithm ALG1.2 taking the following inputs: <!-- prettier-ignore-start --> a. Run Algorithm ALG1.2 taking the following inputs: - Rs → Rsi. - O → O. - C → C. <!-- prettier-ignore-end --> 5. Return (O, C) and end of the algorithm. ## D.3 Algorithm for transforming an NGSI-LD Property into JSON-LD (ALG1.1) Loading @@ -82,28 +101,34 @@ _Relationships_. Let O be the output JSON-LD object and C the associated JSON-LD context: 1. Execute the following steps: - a. If no member with "AliasP" is present in O, add a new member to O with <!-- prettier-ignore-start --> a. If no member with "AliasP" is present in O, add a new member to O with key "AliasP" and value an object structure, let it be named **Op** - <"type", "Property">. <"type", "Property">. - If D is not a native JSON data type add a new member to Op with name "value" and which value has to be an object structure as follows: 1. <"@type", D>. 2. <"@value", V>. - Else If D is a native JSON data type add a new member to Op as follows: 1. <"value", V>. - b. Add a new member to C as follows: b. Add a new member to C as follows: - <"AliasP", P>. - c. For each _Property_ associated to Ps (Pss) c. For each _Property_ associated to Ps (Pss) recursively run the present algorithm (ALG1.1) taking the following inputs: - Ps → Pss. - O → Op. - C → C. - d. For each _Relationship_ associated to Ps (Rss) run d. For each _Relationship_ associated to Ps (Rss) run algorithm ALG1.2 taking the following inputs: - Rs → Rss. - O → Op. - C → C. <!-- prettier-ignore-end --> 2. Return (O,C) and end of the algorithm. ## D.4 Algorithm for transforming an NGSI-LD Relationship into JSON-LD (ALG1.2) Loading @@ -120,18 +145,24 @@ _Relationships_. Let O be the output JSON-LD object and C the current JSON-LD context: 1. Execute the following statements: - a. If no member with "AliasR" is present in O, add a new member to O with <!-- prettier-ignore-start --> a. If no member with "AliasR" is present in O, add a new member to O with key "AliasR" and value an object structure, let it be named **Or** - <"object", Robj>. - <"type", "Relationship">. - b. For each _Property_ associated to Rs (Pss) run the b. For each _Property_ associated to Rs (Pss) run the algorithm ALG1.1 taking the following inputs: - Ps → Pss. - O → Or. - C → C. - c. For each _Relationship_ associated to Rs (Rss) c. For each _Relationship_ associated to Rs (Rss) recursively run the present algorithm ALG1.2 taking the following inputs: - Rs → Rss. - O → Or. - C → C. <!-- prettier-ignore-end --> 2. Return (O,C) and end of the algorithm.