This is an archived snapshot of W3C's public bugzilla bug tracker, decommissioned in April 2019. Please see the home page for more details.

Bug 25779 - Computation of largest set of unordered constraint
Summary: Computation of largest set of unordered constraint
Status: RESOLVED WONTFIX
Alias: None
Product: WebRTC Working Group
Classification: Unclassified
Component: Media Capture and Streams (show other bugs)
Version: unspecified
Hardware: PC All
: P2 normal
Target Milestone: ---
Assignee: public-media-capture@w3.org
QA Contact:
URL:
Whiteboard:
Keywords:
Depends on:
Blocks:
 
Reported: 2014-05-18 13:58 UTC by Cullen Jennings
Modified: 2014-08-13 17:53 UTC (History)
2 users (show)

See Also:

Attachments

Description Cullen Jennings 2014-05-18 13:58:07 UTC 
In new constraint algo, do you really want the UA to have to figure out largest set of unordered constraints and use that. That is much harder than just trying to apply them in some random order and use whichever ones worked.
Comment 1 Harald Alvestrand 2014-08-13 14:55:32 UTC 
I believe this is moot after discussion of "ideal".

Closing as WONTFIX.
Comment 2 Cullen Jennings 2014-08-13 17:53:45 UTC 
Hmm - this was about the basic algo with no use of ideal so not sure how the ideal conversation solved this