W3C home > Mailing lists > Public > public-media-capture@w3.org > August 2014

Re: [Bug 25779] Computation of largest set of unordered constraint

From: Harald Alvestrand <harald@alvestrand.no>
Date: Thu, 14 Aug 2014 10:22:23 +0200
Message-ID: <53EC71BF.8030804@alvestrand.no>
To: public-media-capture@w3.org
On 08/13/2014 09:01 PM, Jan-Ivar Bruaroey wrote:
> On 8/13/14 1:53 PM, bugzilla@jessica.w3.org wrote:
>> https://www.w3.org/Bugs/Public/show_bug.cgi?id=25779
>>
>> --- Comment #2 from Cullen Jennings <fluffy@cisco.com> ---
>> Hmm - this was about the basic algo with no use of ideal so not sure 
>> how the
>> ideal conversation solved this
>
> The unordered non-required constraint disappeared with the required 
> string.
>
> Now things at the top-level are either ideal or required, and order 
> doesn't matter for things that are required.
>

.... and doesn't matter for things that are ideal either ....


> .: Jan-Ivar :.
>
>
Received on Thursday, 14 August 2014 08:22:55 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:26:29 UTC