W3C home > Mailing lists > Public > xmlschema-dev@w3.org > April 2011

Re: Algorithm for merging the pattern facets in a base simpleType with a subtype?

From: C. M. Sperberg-McQueen <cmsmcq@blackmesatech.com>
Date: Fri, 22 Apr 2011 09:04:26 -0600
Cc: "C. M. Sperberg-McQueen" <cmsmcq@blackmesatech.com>, "xmlschema-dev@w3.org" <xmlschema-dev@w3.org>
Message-Id: <6AA60FDB-8355-4CC8-8069-00E5A46C367A@blackmesatech.com>
To: "Costello, Roger L." <costello@mitre.org>

On Apr 20, 2011, at 3:49 AM, Costello, Roger L. wrote:

> ...
> 
> Let me denote this simpleType dependency chain like this:
> 
>     list = [A, B, C, D]
> 
> Problem: what are the pattern facet constraints on simpleType A?
> 
> 
> Algorithm:
> 
> Pattern-Facet-Constraints (list) {
> 
>     ("or" the patterns in list[1]) "and" (Pattern-Facet-Constraints (list[position() gt 1])
> 
> }
> 
> In words: The patterns that apply to the first simpleType in "list" is the Boolean "or" of the patterns in the first simpleType, then Boolean "and" them with the patterns that apply to the simpleTypes in the remainder of the list.

What does this algorithm sketch do if there are three patterns
on each declaration (call them A1, A2, A3, B1, B2, B3, ..., D3)?
Are B1 through D3 all ORed together?

-- 
****************************************************************
* C. M. Sperberg-McQueen, Black Mesa Technologies LLC
* http://www.blackmesatech.com 
* http://cmsmcq.com/mib                 
* http://balisage.net
****************************************************************
Received on Friday, 22 April 2011 15:04:50 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Friday, 22 April 2011 15:04:51 GMT