{"id":7069,"date":"2022-06-06T06:00:16","date_gmt":"2022-06-06T04:00:16","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7069"},"modified":"2022-06-02T08:27:58","modified_gmt":"2022-06-02T06:27:58","slug":"diccionario-de-frecuencias","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/diccionario-de-frecuencias\/","title":{"rendered":"Diccionario de frecuencias"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   frecuencias :: Ord a => [a] -> Map a Int\n<\/pre>\n<p>tal que <code>(frecuencias xs)<\/code> es el diccionario formado por los elementos de <code>xs<\/code> junto con el n\u00famero de veces que aparecen en <code>xs<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> frecuencias \"sosos\"\n   fromList [('o',2),('s',3)]\n   \u03bb> frecuencias (show (10^100))\n   fromList [('0',100),('1',1)]\n   \u03bb> frecuencias (take (10^6) (cycle \"abc\"))\n   fromList [('a',333334),('b',333333),('c',333333)]\n   \u03bb> size (frecuencias (take (10^6) (cycle [1..10^6])))\n   1000000\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (foldl')\nimport Data.Map (Map, empty, insertWith, fromList, fromListWith, size)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\nfrecuencias1 :: Ord a => [a] -> Map a Int\nfrecuencias1 []     = empty\nfrecuencias1 (x:xs) = insertWith (+) x 1 (frecuencias1 xs)\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\nfrecuencias2 :: Ord a => [a] -> Map a Int\nfrecuencias2 = foldl' (\\d x-> insertWith (+) x 1 d) empty\n\n-- 3\u00aa soluci\u00f3n\n-- ===========\n\nfrecuencias3 :: Ord a => [a] -> Map a Int\nfrecuencias3 xs = fromListWith (+) (zip xs (repeat 1))\n\n-- Equivalencia de las definiciones\n-- ================================\n\n-- La propiedad es\nprop_frecuencias :: [Int] -> Bool\nprop_frecuencias xs =\n  all (== frecuencias1 xs)\n      [ frecuencias2 xs\n      , frecuencias3 xs]\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_frecuencias\n--    +++ OK, passed 100 tests.\n\n-- Comparaci\u00f3n de eficiencia\n-- =========================\n\n-- La comparaci\u00f3n es\n--    \u03bb> frecuencias1 (take (10^6) (cycle \"abc\"))\n--    fromList [('a',333334),('b',333333),('c',333333)]\n--    (0.89 secs, 453,842,448 bytes)\n--    \u03bb> frecuencias2 (take (10^6) (cycle \"abc\"))\n--    fromList [('a',333334),('b',333333),('c',333333)]\n--    (0.54 secs, 274,181,128 bytes)\n--    \u03bb> frecuencias3 (take (10^6) (cycle \"abc\"))\n--    fromList [('a',333334),('b',333333),('c',333333)]\n--    (0.29 secs, 313,787,976 bytes)\n     \n--    \u03bb> size (frecuencias1 (take (10^6) (cycle [1..10^6])))\n--    1000000\n--    (3.76 secs, 2,651,926,024 bytes)\n--    \u03bb> size (frecuencias2 (take (10^6) (cycle [1..10^6])))\n--    1000000\n--    (1.03 secs, 1,640,678,448 bytes)\n--    \u03bb> size (frecuencias3 (take (10^6) (cycle [1..10^6])))\n--    1000000\n--    (0.88 secs, 1,672,678,536 bytes)\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium\/blob\/main\/src\/Diccionario_de_frecuencias.hs\">GitHub<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n frecuencias :: Ord a => [a] -> Map a Int tal que (frecuencias xs) es el diccionario formado por los elementos de xs junto con el n\u00famero de veces que aparecen en xs. Por ejemplo, \u03bb> frecuencias \u00absosos\u00bb fromList [(&#8216;o&#8217;,2),(&#8216;s&#8217;,3)] \u03bb> frecuencias (show (10^100)) fromList [(&#8216;0&#8217;,100),(&#8216;1&#8217;,1)] \u03bb> frecuencias (take (10^6) (cycle \u00ababc\u00bb))&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[2],"tags":[573],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7069"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=7069"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7069\/revisions"}],"predecessor-version":[{"id":7070,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7069\/revisions\/7070"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7069"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7069"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7069"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}