úÎm •     NoneQVËgFind a# will extract any elements of type b from a˜'s structure in accordance with the MonadPlus instance, e.g. Maybe Foo will return the first Foo found while [Foo] will return the list of Foos found.None× 7Create a singleton set containing a singleton set of a.(Turn a list of lists into a set of sets.Ldistrib {a, b, c} {d, e, f} -> {a+d, a+e, a+f, b+d, b+e, b+f, c+d, c+e, c+f}W !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVW  X      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]&set-extra-1.4.1-LOMdoUwwOa92lVK2zxFOPyData.Set.ExtraGData.Set.ExtragFindmapMmapM_filterM catMaybesmapMaybeflatten concatMap concatMapManyallorandsstoSSfromSSssMapMdistribcartesianProductgroupBypowerset partitionMunzipgFind'containers-0.5.10.2Data.Set.Internalvalid showTreeWithshowTree splitRootmaxViewminView deleteFindMax deleteFindMin spanAntitonedropWhileAntitonetakeWhileAntitonesplitAtdroptakedeleteAtelemAt lookupIndex findIndex splitMembersplitfromDistinctDescListfromDistinctAscList fromDescList fromAscListfromList toDescList toAscListtoListelemsfoldl'foldlfoldr'foldrfold mapMonotonicmap partitionfilter intersection differenceunionunions deleteMax deleteMinfindMax lookupMaxfindMin lookupMin isSubsetOfisProperSubsetOfdeleteinsert singletonemptylookupGElookupLElookupGTlookupLT notMembermembersizenull\\Set