def const_number_of_feasible_pop(iterable, key=(lambda x: x), allowequality=True):
 items = list(iterable)
 fits = list(map(key, items))
 v = list([fits[i][1] for i in range(len(fits))])
 n = v.count(True)
 return n

def const_number_of_feasible_pop ( iterable , key = ( lambda x : x ) , allowequality = True ) : items = list ( iterable ) fits = list ( map ( key , items ) ) v = list ( [ fits [ i ] [ 1 ] for i in range ( len ( fits ) ) ] ) n = v . count ( True ) return n
return a subset of items from iterable which are not dominated by any other item in iterable .