(self)
return sum(comb(n_attrs, k, exact=True)
                   for k in range(min_attrs, max_attrs + 1))
Return the number of combinations, starting with a single attribute
        if Mosaic is colored by class distributions, and two if by Pearson
Return the number of combinations, starting with a single attribute
        if Mosaic is colored by class distributions, and two if by Pearson
Return the number of combinations starting with a single attribute if Mosaic is colored by class distributions and two if by Pearson
def state_count(self):
        """
        Return the number of combinations, starting with a single attribute
        if Mosaic is colored by class distributions, and two if by Pearson
        """
        n_attrs = len(self.master.discrete_data.domain.attributes)
        min_attrs, max_attrs = self.attr_range()
        if min_attrs > max_attrs:
            return 0
        return sum(comb(n_attrs, k, exact=True)
                   for k in range(min_attrs, max_attrs + 1))
def state_count ( self ) : n_attrs = len ( self . master . discrete_data . domain . attributes ) min_attrs , max_attrs = self . attr_range ( ) if min_attrs > max_attrs : return 0 return sum ( comb ( n_attrs , k , exact = True ) for k in range ( min_attrs , max_attrs + 1 ) )