Search results
Jump to navigation
Jump to search
Page title matches
- ...an automatic transformation, or when doing a workflow and the next element of the workflow refers to a <code>:Auto</code> object. ...niversal precedence" is known to be less than or equal than the precedence of this transformer. ...11 KB (1,808 words) - 20:59, 13 November 2018
- See also [[Automatic transformation of XML namespaces/Implementation/Precedences/Old answer|an alternative solution]]. ...der containing a given irreflexive relation is equal to transitive closure of this relation if such strict partial order exists. It exists iff the given ...2 KB (272 words) - 12:56, 5 May 2019
- DAG is an abbreviation of directed acyclic graph. ...>B</math>) if every element of <math>A</math> is higher than every element of <math>B</math>. ...8 KB (1,440 words) - 12:57, 5 May 2019
Page text matches
- See also [[Automatic transformation of XML namespaces/Implementation/Precedences/Old answer|an alternative solution]]. ...der containing a given irreflexive relation is equal to transitive closure of this relation if such strict partial order exists. It exists iff the given ...2 KB (272 words) - 12:56, 5 May 2019
- ...an automatic transformation, or when doing a workflow and the next element of the workflow refers to a <code>:Auto</code> object. ...niversal precedence" is known to be less than or equal than the precedence of this transformer. ...11 KB (1,808 words) - 20:59, 13 November 2018
- DAG is an abbreviation of directed acyclic graph. ...>B</math>) if every element of <math>A</math> is higher than every element of <math>B</math>. ...8 KB (1,440 words) - 12:57, 5 May 2019