- From: Jim Barnett <1jhbarnett@gmail.com>
- Date: Thu, 14 Aug 2014 08:00:27 -0400
- To: public-media-capture@w3.org
As I recall, computing the largest set of unordered (= optional) constraints was required when the algorithm was supposed to satisfy as many optional constraints as possible. The distance metric for 'ideal' has replaced that calculation. It doesn't matter how many 'ideals' it satisfies, it's how close it gets to them. - Jim On 8/14/2014 4:22 AM, Harald Alvestrand wrote: > 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 12:00:58 UTC