{"id":7281,"date":"2022-08-31T06:00:10","date_gmt":"2022-08-31T04:00:10","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7281"},"modified":"2022-12-14T16:40:59","modified_gmt":"2022-12-14T14:40:59","slug":"division-segura","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/division-segura\/","title":{"rendered":"Divisi\u00f3n segura"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   divisionSegura :: Double -> Double -> Double\n<\/pre>\n<p>tal que <code>(divisionSegura x y)<\/code> es <code>x\/y<\/code> si y no es cero y <code>9999<\/code> en caso contrario. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   divisionSegura 7 2  ==  3.5\n   divisionSegura 7 0  ==  9999.0\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 definici\u00f3n\ndivisionSegura1 :: Double -> Double -> Double\ndivisionSegura1 x y =\n  if y == 0 then 9999 else x\/y\n\n-- 2\u00aa definici\u00f3n\ndivisionSegura2 :: Double -> Double -> Double\ndivisionSegura2 _ 0 = 9999\ndivisionSegura2 x y = x\/y\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_divisionSegura :: Double -> Double -> Bool\nprop_divisionSegura x y =\n  divisionSegura1 x y == divisionSegura2 x y\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_divisionSegura\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\/Division_segura.hs\">GitHub<\/a>.<\/p>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\nfrom hypothesis import given, strategies as st\n\n# 1\u00aa definici\u00f3n\ndef divisionSegura1(x: float, y: float) -> float:\n    if y == 0:\n        return 9999.0\n    return x\/y\n\n# 2\u00aa definici\u00f3n\ndef divisionSegura2(x: float, y: float) -> float:\n    match y:\n        case 0:\n            return 9999.0\n        case _:\n            return x\/y\n\n# La propiedad de equivalencia es\n@given(st.floats(allow_nan=False, allow_infinity=False),\n       st.floats(allow_nan=False, allow_infinity=False))\ndef test_equiv_divisionSegura(x, y):\n    assert divisionSegura1(x, y) == divisionSegura2(x, y)\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q division_segura.py\n#    1 passed in 0.37s\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium-Python\/blob\/main\/src\/division_segura.py\">GitHub<\/a>.<\/p>\n<p><b>Comentarios<\/b><\/p>\n<ul>\n<li>El condicional se escribe en Haskell como<\/li>\n<\/ul>\n<pre lang=\"haskell\">\nif <condici\u00f3n> then <valor1> else <valor2>\n<\/pre>\n<p>y en Python como<\/p>\n<pre lang=\"python\">\nif <condici\u00f3n>:\n    return <valor1>\nreturn <valor2>\n<\/pre>\n<ul>\n<li>Una alternativa al uso de los condicionales son los patrones que en Haskell se escribe en los argumentos de las ecuaciones y en Python con <code>match cases<\/code>.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n divisionSegura :: Double -> Double -> Double tal que (divisionSegura x y) es x\/y si y no es cero y 9999 en caso contrario. Por ejemplo, divisionSegura 7 2 == 3.5 divisionSegura 7 0 == 9999.0 Soluciones A continuaci\u00f3n se muestran las soluciones en Haskell y las soluciones en Python. Soluciones en&#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\/7281"}],"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=7281"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7281\/revisions"}],"predecessor-version":[{"id":7702,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7281\/revisions\/7702"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7281"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7281"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7281"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}