Lines Matching full:sets
1 //===- StratifiedSets.h - Abstract stratified sets implementation. --------===//
28 // \brief An index into Stratified Sets.
31 // ~1M sets exist.
77 // \brief These are stratified sets, as described in "Fast algorithms for
79 // R, Yuan H, and Su Z. -- in short, this is meant to represent different sets
80 // of Value*s. If two Value*s are in the same set, or if both sets have
83 // Sets may be related by position, meaning that one set may be considered as
90 // Sets may also have attributes (as noted above). These attributes are
94 // call). All attributes that exist in a set A must exist in all sets marked as
136 // > Set chains (A method for linking sets together)
163 // These relations produce the following sets:
188 // the set below %a with the set below %b, etc. Ultimately, the sets for this
204 // we merge all concerned sets into one. So, the above code would generate a
208 // More of an implementation detail than anything -- when merging sets, we need
209 // to update the numbers of all of the elements mapped to those sets. Rather
404 // \brief Restructures the stratified sets as necessary to make "ToAdd" in a
417 // \brief Restructures the stratified sets as necessary to make "ToAdd" in a
471 // belongs to. It ignores attributes in any sets above the one that Main
481 // set that Main belongs to. It ignores attributes in any sets above the one
493 sets if
505 // Failed to add where we wanted to. Merge the sets.
537 // \brief Merges two sets into one another. Assumes that these sets are not
546 // given sets, and all sets between them, into one.
558 // \brief Merges two sets assuming that the set at `Idx1` is unreachable from
606 // If so, it will merge lowerIndex with upperIndex (and all of the sets
