## Uses of Class
com.ihr.xbrl.om.xdt.XDTValidCombinationSet

- Packages that use XDTValidCombinationSet
  Package | Description
  --- | ---
  com.ihr.xbrl.om.xdt | Provides the classes necessary to implement a plug in XBRL processor for validation of dimensional instance documents according to the XBRL Dimensions specification 1.0 This package contains two hierarchies of classes.

- - ### Uses of XDTValidCombinationSet in com.ihr.xbrl.om.xdt

    Subclasses of XDTValidCombinationSet in com.ihr.xbrl.om.xdt
    Modifier and Type | Class and Description
    --- | ---
    `class` | `XDTValidCombinationScenario` Concrete class for the Scenario container.
    `class` | `XDTValidCombinationSegment` Concrete class for the segment container.

    Fields in com.ihr.xbrl.om.xdt declared as XDTValidCombinationSet
    Modifier and Type | Field and Description
    --- | ---
    `static XDTValidCombinationSet` | XDTValidCombinationSet.`CLOSED` This is a static representation of an EMPTY CLOSED hypercube.
    `static XDTValidCombinationSet` | XDTValidCombinationSet.`OPEN` This is a static representation of an EMPTY OPEN hypercube.

    Methods in com.ihr.xbrl.om.xdt that return types with arguments of type XDTValidCombinationSet
    Modifier and Type | Method and Description
    --- | ---
    `java.util.Collection<XDTValidCombinationSet>` | XDTDimensionalPrimaryItem.`getScenarioCombinations()` Gets the scenario combinations.
    `java.util.Collection<XDTValidCombinationSet>` | XDTDimensionalPrimaryItem.`getSegmentCombinations()` Gets the segment combinations.
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`intersection(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "intersection" operator means that only common members between set1 and set2 are valid
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`union(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "union" operator means that all members from set1 are valid and all members of set2 are valid but no duplicates can exist.

    Methods in com.ihr.xbrl.om.xdt with parameters of type XDTValidCombinationSet
    Modifier and Type | Method and Description
    --- | ---
    `boolean` | XDTValidCombinationSet.`all(XDTValidCombinationSet other)` Operates the sign of two combinations using the "all" operator.
    `boolean` | XDTValidCombinationSet.`includedIn(XDTValidCombinationSet o)` Returns true if this combination is under the scope of the "o" combination That is "this" is most restrictive than "o".

    Method parameters in com.ihr.xbrl.om.xdt with type arguments of type XDTValidCombinationSet
    Modifier and Type | Method and Description
    --- | ---
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`intersection(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "intersection" operator means that only common members between set1 and set2 are valid
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`intersection(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "intersection" operator means that only common members between set1 and set2 are valid
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`union(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "union" operator means that all members from set1 are valid and all members of set2 are valid but no duplicates can exist.
    `static java.util.HashSet<XDTValidCombinationSet>` | XDTInfosetConsumer.`union(java.util.Collection<XDTValidCombinationSet> set1, java.util.Collection<XDTValidCombinationSet> set2)` Combine two sets of combinations "union" operator means that all members from set1 are valid and all members of set2 are valid but no duplicates can exist.