{"id":7230,"date":"2022-08-16T06:00:50","date_gmt":"2022-08-16T04:00:50","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7230"},"modified":"2022-12-14T16:53:04","modified_gmt":"2022-12-14T14:53:04","slug":"el-primero-al-final","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/el-primero-al-final\/","title":{"rendered":"El primero al final"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   rota1 :: [a] -> [a]\n<\/pre>\n<p>tal que <code>(rota1 xs)<\/code> es la lista obtenida poniendo el primer elemento de <code>xs<\/code> al final de la lista. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   rota1 [3,2,5,7]  ==  [2,5,7,3]\n<\/pre>\n<p><b>Soluciones<\/b><\/p>\n<p>A continuaci\u00f3n se muestran las <a href=\"#haskell\">soluciones en Haskell<\/a> y las <a href=\"#python\">soluciones en Python<\/a>.<\/p>\n<p><a name=\"haskell\"><\/a><br \/>\n<b>Soluciones en Haskell<\/b><\/p>\n<pre lang=\"haskell\">\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\nrota1a :: [a] -> [a]\nrota1a [] = []\nrota1a xs = tail xs ++ [head xs]\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\nrota1b :: [a] -> [a]\nrota1b []     = []\nrota1b (x:xs) = xs ++ [x]\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_rota1 :: [Int] -> Bool\nprop_rota1 xs =\n  rota1a xs == rota1b xs\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_rota1\n--    +++ OK, passed 100 tests.\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium\/blob\/main\/src\/El_primero_al_final.hs\">GitHub<\/a>.<\/p>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\nfrom typing import TypeVar\nfrom hypothesis import given, strategies as st\n\nA = TypeVar('A')\n\n# 1\u00aa soluci\u00f3n\ndef rota1a(xs: list[A]) -> list[A]:\n    if xs == []:\n        return []\n    return xs[1:] + [xs[0]]\n\n# 2\u00aa soluci\u00f3n\ndef rota1b(xs: list[A]) -> list[A]:\n    if xs == []:\n        return []\n    ys = xs[1:]\n    ys.append(xs[0])\n    return ys\n\n# 3\u00aa soluci\u00f3n\ndef rota1c(xs: list[A]) -> list[A]:\n    if xs == []:\n        return []\n    y, *ys = xs\n    return ys + [y]\n\n# La equivalencia de las definiciones es\n@given(st.lists(st.integers()))\ndef test_rota1(xs: list[int]) -> None:\n    assert rota1a(xs) == rota1b(xs) == rota1c(xs)\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q el_primero_al_final.py\n#    1 passed in 0.20s\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium-Python\/blob\/main\/src\/el_primero_al_final.py\">GitHub<\/a>.<\/p>\n<p><b>Comentarios<\/b><\/p>\n<ul>\n<li>El primer elemento de la lista <code>xs<\/code> se calcula\n<ul>\n<li>en Haskell, con <code>head xs<\/code><\/li>\n<li>en Python, con <code>xs[0]<\/code><\/li>\n<\/ul>\n<\/li>\n<li>El resto de la lista <code>xs<\/code> se calcula\n<ul>\n<li>en Haskell, con <code>tail xs<\/code><\/li>\n<li>en Python, con <code>xs[1:]<\/code><\/li>\n<\/ul>\n<\/li>\n<li>La concatenaci\u00f3n de las listas <code>xs<\/code>e <code>ys<\/code>se calcula\n<ul>\n<li>en Haskell, con <code>xs ++ ys<\/code><\/li>\n<li>en Python, con <code>xs + ys<\/code><\/li>\n<\/ul>\n<\/li>\n<li>En Python. <code>xs.append(x)<\/code> modifica la lista <code>xs<\/code> a\u00f1adi\u00e9ndole <code>x<\/code> al final. Por ejemplo,<\/li>\n<\/ul>\n<pre lang=\"text\">\n>>> xs = [3, 2, 5]\n>>> xs.append(1)\n>>> xs\n[3, 2, 5, 1]\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n rota1 :: [a] -> [a] tal que (rota1 xs) es la lista obtenida poniendo el primer elemento de xs al final de la lista. Por ejemplo, rota1 [3,2,5,7] == [2,5,7,3] Soluciones A continuaci\u00f3n se muestran las soluciones en Haskell y las soluciones en Python. Soluciones en Haskell import Test.QuickCheck &#8212; 1\u00aa soluci\u00f3n&#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":[581],"tags":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7230"}],"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=7230"}],"version-history":[{"count":6,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7230\/revisions"}],"predecessor-version":[{"id":7713,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7230\/revisions\/7713"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7230"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7230"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7230"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}