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

Re: Defining ConstraintSet and the constrainable algorithm in terms of it

From: Martin Thomson <martin.thomson@gmail.com>
Date: Fri, 7 Feb 2014 09:30:05 -0800
Message-ID: <CABkgnnWPG33bEQjZr+ZTNYSMnGBbY5jEy69Xnb=DL9nHL9drqQ@mail.gmail.com>
To: Harald Alvestrand <harald@alvestrand.no>
Cc: "public-media-capture@w3.org" <public-media-capture@w3.org>
On 6 February 2014 20:28, Harald Alvestrand <harald@alvestrand.no> wrote:
> You're right. The "intersection" has to be in terms of what's possible given
> the already-satisfied constraints, not just what that particular constraint
> has been constrained to.

You mean that for constraints from a set of sources S, the constraint
is the intersection of the set formed from the present constraints and
the constraints already set by {S - S[current]}.
Received on Friday, 7 February 2014 17:30:32 UTC

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