bin/agda2/src/full/Agda/Utils/Size.hs: size = fromIntegral . Set.size bin/agda/src/full/Agda/Utils/Graph.hs: where n = Set.size $ nodes g bin/agda/src/full/Agda/Utils/Size.hs: size = fromIntegral . Set.size bin/binary/src/Data/Binary.hs: put s = put (Set.size s) >> mapM_ put (Set.toAscList s) bin/binary/src/Data/Binary.hs: put s = put (IntSet.size s) >> mapM_ put (IntSet.toAscList s) bin/darcswatch/src/HTML.hs: +++ " "+++ show (S.size (unmatched d)) +++ " patches" ] bin/darcswatch/src/HTML.hs: show (S.size (r2p d !!!! r)) +++ bin/edison/edison-core/src/Data/Edison/Coll/StandardSet.hs:size = DS.size bin/folkung/folkung/Clausify.hs: siz (And ps) = S.size ps bin/folkung/folkung/Clausify.hs: Or ps | S.size ps > 0 && n > 0 -> bin/folkung/folkung/Clausify.hs: And as | S.size as == 0 -> bin/folkung/folkung/Equinox/FolSat.hs: putLn 2 ("(" ++ show (S.size conss) ++ " elements in domain)") bin/folkung/folkung/Equinox/FolSat.hs: | acyclic && (not undef || S.size still == 0) = bin/folkung/folkung/Equinox/FolSat.hs: && ( S.size still == 0 bin/folkung/folkung/Equinox/FolSat-new.hs: , S.size (unrVars c) > 0 bin/folkung/folkung/Equinox/FolSat-new.hs: ++ show (S.size cons) bin/folkung/folkung/Equinox/TermSat.hs: return (any ((>= 2) . S.size . snd) combinedArgs',(f,M.fromList args'')) bin/folkung/folkung/Paradox/Flatten.hs: , S.size (free lit) <= 2 bin/folkung/folkung/Paradox/Flatten.hs: S.size (rep posInfo `S.intersection` rep negInfo) > 0 bin/folkung/folkung/Paradox/Flatten.hs: | S.size cl >= 1 + S.size bs bin/folkung/folkung/Paradox/Flatten.hs: || S.size cl >= S.size cl' = largestClique cl gr' bin/folkung/folkung/Paradox/Flatten.hs: -- && S.size (free xs) <= 1 bin/folkung/folkung/Paradox/Flatten.hs: , S.size sgns == 1 bin/folkung/folkung/Paradox/Flatten.hs: n = S.size (free ls) bin/folkung/folkung/Paradox/Flatten.hs: , S.size ws < n-1 bin/folkung/folkung/Paradox/Flatten.hs: (S.size s1,tpsize v2,inter s2) `compare` (S.size s2,tpsize v1,inter s1) bin/folkung/folkung/Paradox/Flatten.hs: sum [ S.size (s `S.intersection` vs) | (v,vs) <- cons, v `S.member` s ] bin/folkung/folkung/Paradox/Flatten.hs: , S.size ws' < S.size freeRight-1 bin/folkung/folkung/Paradox/Flatten.hs: | S.size (free ls) >= 3 bin/folkung/folkung/Paradox/Flatten.hs: | S.size ((ws `S.intersection` vs) `S.difference` ok) == 0 = bin/folkung/folkung/Paradox/Instantiate.hs: isGround c = S.size (free c) == 0 bin/folkung/folkung/Paradox/Solve.hs: sequence_ [ putStrLn ("[" ++ show (S.size (free c)) ++ "] " ++ showClause c) | c <- fcs ] bin/folkung/folkung/Paradox/Solve.hs: degree x = S.size . free $ x bin/gf/src/compiler/GF/Compile/GeneratePMCFG.hs: | product (map Set.size ys) == count bin/gf/src/compiler/GF/Speech/CFGToFA.hs: indeg (c,_) = maybe 0 Set.size $ Map.lookup c ub bin/gf/src/compiler/GF/Speech/CFGToFA.hs: where (fa', ns) = newStates (replicate (Set.size cs) ()) fa bin/gf/src/compiler/GF/Speech/SRG.hs: ++ ", External categories: " ++ show (Set.size (cfgExternalCats g)) bin/gf/src/Data/Binary.hs: put s = put (Set.size s) >> mapM_ put (Set.toAscList s) bin/gf/src/Data/Binary.hs: put s = put (IntSet.size s) >> mapM_ put (IntSet.toAscList s) bin/gf/src/GF/Compile/GeneratePMCFG.hs: | product (map Set.size ys) == count = bin/gf/src/GF/Compile/GeneratePMCFGOld.hs: | product (map Set.size ys) == count = bin/gf/src/GF/Data/MultiMap.hs:size = sum . Prelude.map Set.size . Map.elems bin/gf/src/GF/Speech/CFGToFA.hs: indeg (c,_) = maybe 0 Set.size $ Map.lookup c ub bin/gf/src/GF/Speech/CFGToFA.hs: where (fa', ns) = newStates (replicate (Set.size cs) ()) fa bin/gf/src/GF/Speech/SRG.hs: ++ ", External categories: " ++ show (Set.size (cfgExternalCats g)) bin/gf/src/runtime/haskell/Data/Binary.hs: put s = put (Set.size s) >> mapM_ put (Set.toAscList s) bin/gf/src/runtime/haskell/Data/Binary.hs: put s = put (IntSet.size s) >> mapM_ put (IntSet.toAscList s) bin/halfs/Halfs/FSRoot.hs: $ Set.size $ fsRootAllInodeNums fsroot bin/halfs/Halfs.hs: putStr $ "There are a total of: " ++ (show $ Set.size allInodeNums) ++ " inodes" bin/halfs/Halfs.hs: when (Set.size freeSet /= length freeList) ( bin/halfs/Halfs.hs:-- (error $ "requested FS size greater than physical disk. blocks: " ++ (show fileLen) ++ " size: " ++ (show realBlocks)) bin/halfs/Halfs/TheBlockMap.hs: = assert (queueLength free == Set.size freeSet) $ bin/happstack-facebook/examples/Pushups.hs: ,

<% show $ Set.size (wannabes challenge) %> requests to join.

bin/happstack/happstack-ixset/src/Happstack/Data/IxSet.hs:size = Set.size . toSet bin/happstack/happstack-ixset/src/Happstack/Data/IxSet.hs: no_values = sum [sum [Set.size s | s <- Map.elems m] | Ix m _ <- indexes] bin/happstack-stable/happstack-ixset/src/Happstack/Data/IxSet.hs:size = Set.size . toSet bin/happstack-stable/happstack-ixset/src/Happstack/Data/IxSet.hs: no_values = sum [sum [Set.size s | s <- Map.elems m] | Ix m <- indices] bin/hcorpus/hcorpus.hs: let rank = 1 `fidiv` Set.size wrds, bin/hoogle/src/Hoogle/DataBase/TypeSearch/Binding.hs: g (l, vs) = Just $ [restrict|isJust l] ++ replicate (max 0 $ Set.size vs - 1) var bin/htab/src/Formula.hs:countNominals f = Set.size $ extractNominals f bin/hylolib/src/HyLo/Model/Herbrand.hs: coarbitrary (H es ps rs s) = coarbitrary (Set.size es) . bin/hylolib/src/HyLo/Model/Herbrand.hs: coarbitrary (Set.size ps) . bin/hylolib/src/HyLo/Model/Herbrand.hs: coarbitrary (Set.size rs) . bin/hylolib/src/HyLo/Model.hs: Set.size (worlds m) > 1 ==> forAll (worldOf m) $ \w -> bin/hylores-2.5/src/HyLoRes/Clause/BasicClause.hs: size = Set.size . toFormulaSet bin/hylores-2.5/src/HyLoRes/Subsumption/ClausesByFormulaIndex.hs: let sortedCandidates = sortBy (compareUsing Set.size) subsCandidates bin/hylores-diego/src/HyLoRes/Clause/BasicClause.hs: size = Set.size . toFormulaSet bin/hylores-diego/src/HyLoRes/Subsumption/ClausesByFormulaIndex.hs: let sortedCandidates = sortBy (compareUsing Set.size) subsCandidates bin/ipclib/Language/Pepa/Compile/States.hs: Just limit -> ((stateSpaceSize seen) + (Set.size stack)) > limit bin/ipclib/Language/Pepa/Compile/Uniformise.hs: | (Set.size sources) == 1 = singleSourcePiZero bin/ipclib/Language/Pepa/Probes/StateMachines/NfaCombinators.hs: m1 = Set.size states1 bin/ipclib/Language/Pepa/Probes/StateMachines/NfaCombinators.hs: m2 = Set.size states2 bin/ipclib/Language/Pepa/Probes/StateMachines/NfaCombinators.hs: k = (Set.size states1) - 1 bin/ipclib/Language/Pepa/Probes/StateMachines/NfaCombinators.hs: m = Set.size states bin/ipclib/Language/Pepa/Probes/StateMachines/NfaCombinators.hs: k = Set.size states1 - 1 bin/jhc/src/Fixer/Fixer.hs: mputStr $ "Finding fixpoint for " ++ mstring ++ ": " ++ "[" ++ show (Set.size to) ++ "]" bin/jhc/src/Grin/SSimplify.hs: v n | n `IS.member` s = v (1 + n + IS.size s) bin/jhc/src/Ho/Build.hs: maxModules <- Set.size `fmap` countNodes cn bin/jhc/src/Ho/Build.hs: maxModules <- Set.size `fmap` countNodes cn bin/jhc/src/Support/MapBinaryInstance.hs: put (fromIntegral $ Set.size x :: Word32) bin/jhc/src/Util/HasSize.hs:import qualified Data.Set(Set,size,null) bin/jhc/src/Util/HasSize.hs:import qualified Data.IntSet(IntSet,size,null) bin/jhc/src/Util/HasSize.hs: size = Data.Set.size bin/jhc/src/Util/HasSize.hs: size = Data.IntSet.size bin/jhc/src/Util/NameMonad.hs:freeNames s = filter (not . (`Set.member` s)) (genNames (Set.size s)) bin/jhc/src/Util/NameMonad.hs: fromNameMT $ newNameFrom (genNames (Set.size used + Set.size bound)) bin/joint-collections/src/Data/Collections.hs: csize = Set.size bin/lhc/src/Grin/HPT/Interface.hs:-- | Set.size h1 `seq` Set.size h2 `seq` False = undefined bin/lhc/src/Grin/Optimize/CallPattern.hs: nPatterns = Set.size callPatterns bin/luna/tools/luna.hs:liveCount = (S.size `fmap`) . liveSet bin/luna/tools/luna.hs:deadCount = (S.size `fmap`) . deadSet bin/metaquote/src/Language/Haskell/Meta/Set.hs: size = S.size bin/mira/src/Language/Mira/BuildNfa.hs: m1 = Set.size states1 bin/mira/src/Language/Mira/BuildNfa.hs: m2 = Set.size states2 bin/mira/src/Language/Mira/BuildNfa.hs: k = Set.size states1 - 1 bin/mira/src/Language/Mira/BuildNfa.hs: m = Set.size myStates bin/proteinvis/Graphics/Visualization/Tree/Geometry.hs: where theta = ((fromIntegral index - (fromIntegral (S.size . fst . S.split (Name name) $ missingLeaves))) * 2 * 3.14157) / (num_leaves - fromIntegral (S.size missingLeaves)) bin/proteinvis/Main.hs: GLUT.renderString GLUT.Roman ("Number of supernodes: " ++ (show . S.size $ superNodes st')) bin/proteinvis/Main.hs: GLUT.renderString GLUT.Roman ("Number of leaves in supernodes: " ++ (show . sum . map (S.size . Index.collectLeaves S.empty) . lower . S.toList . S.map (\(GL.Name k) -> Index.find (fromIntegral k) (index st')) . superNodes $ st') ++ "/" ++ (show . S.size . Index.collectLeaves S.empty . index $ st'))) bin/proteinvis/ProgramState.hs: c = S.size go bin/proteinvis/Protein.hs: , term_count = S.size terms bin/proteinvis/Protein.hs: , term_count = S.size terms bin/protocol-buffers/hprotoc/Text/ProtocolBuffers/ProtoCompile/Resolve.hs: when (Set.size numbers /= Seq.length (D.DescriptorProto.field dp)) $ bin/protocol-buffers/hprotoc/Text/ProtocolBuffers/ProtoCompile/Resolve.hs: when (Set.size (Set.fromList values) /= Seq.length vs) $ bin/pullrepo/attic/SAT.hs: varNum = Set.size vars bin/pullrepo/attic/SAT.hs: labIds = Map.fromList $ zip (Set.toList labels) [varNum + 1 .. varNum + Set.size labels] bin/rhaskell/rhaskell/RHaskellPrimitives.hs: let n = (Set.size set) + 1 bin/rhaskell/rhaskell/RHaskellPrimitives.hs: (\s -> let n = (Set.size s) + 1 bin/rhaskell/rhaskell/RHaskellPrimitives.hs: let n = (Set.size s) - 1 bin/rhaskell/rhaskell/RHaskellPrimitives.hs: let n = Set.size s bin/rhaskell/rhaskell/RHaskellPrimitives.hs: (\s -> do let n = Set.size s bin/syb-with-class/Data/Generics/SYB/WithClass/Instances.hs: toConstr _ m | S.size m == 0 = emptySetConstr bin/tanius/examples/Chat3/src/Chat3.hs: let numUsersStr = show (Set.size currentUsers) bin/watch-darcs/src/HTML.hs: show (S.size (r2p d !!!! r)) +++ bin/xmobar/Plugins/Mail.hs: changeLoop (mapM (fmap S.size . readTVar) vs) $ \ns -> do bin/yhc/src/compiler98/ByteCode/Graph.hs: if Set.size jumps /= 1 then