{"id":7891,"date":"2023-02-10T06:00:33","date_gmt":"2023-02-10T04:00:33","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7891"},"modified":"2023-01-24T11:30:09","modified_gmt":"2023-01-24T09:30:09","slug":"10-feb-23","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/10-feb-23\/","title":{"rendered":"TAD de las colas: Longitud de una cola"},"content":{"rendered":"

Utilizando el tipo abstracto de datos de las colas<\/a>, definir la funci\u00f3n<\/p>\n

\n   longitudCola :: Cola a -> Int\n<\/pre>\n
tal que longitudCola c<\/code> es el n\u00famero de elementos de la cola c<\/code>. Por ejemplo,<\/p>\n
\n   longitudCola (inserta 4 (inserta 2 (inserta 5 vacia))) == 3\n<\/pre>\n
Soluciones<\/b><\/p>\n
A continuaci\u00f3n se muestran las soluciones en Haskell<\/a> y las soluciones en Python<\/a>.<\/p>\n
<\/a>
\nSoluciones en Haskell<\/b><\/p>\n
\nimport TAD.Cola (Cola, vacia, inserta, resto, esVacia)\nimport Transformaciones_colas_listas (colaAlista)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\nlongitudCola1 :: Cola a -> Int\nlongitudCola1 c\n  | esVacia c = 0\n  | otherwise = 1 + longitudCola1 rc\n  where rc = resto c\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\nlongitudCola2 :: Cola a -> Int\nlongitudCola2 = length . colaAlista\n\n-- La funci\u00f3n colaAlista est\u00e1 definida en el ejercicio\n-- \"Transformaciones entre colas y listas\" que se encuentra en\n-- https:\/\/bit.ly\/3Xv0oIt\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_longitudCola :: Cola Int -> Bool\nprop_longitudCola c =\n  longitudCola1 c == longitudCola2 c\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheck prop_longitudCola\n--    +++ OK, passed 100 tests.\n<\/pre>\n
<\/a>
\nSoluciones en Python<\/b><\/p>\n
\nfrom copy import deepcopy\nfrom typing import TypeVar\n\nfrom hypothesis import given\n\nfrom src.TAD.cola import (Cola, colaAleatoria, esVacia, inserta, resto,\n                          vacia)\nfrom src.transformaciones_colas_listas import colaAlista\n\nA = TypeVar('A')\n\n# 1\u00aa soluci\u00f3n\n# ===========\n\ndef longitudCola1(c: Cola[A]) -> int:\n    if esVacia(c):\n        return 0\n    return 1 + longitudCola1(resto(c))\n\n# 2\u00aa soluci\u00f3n\n# ===========\n\ndef longitudCola2(c: Cola[A]) -> int:\n    return len(colaAlista(c))\n\n# 3\u00aa soluci\u00f3n\n# ===========\n\ndef longitudCola3Aux(c: Cola[A]) -> int:\n    if c.esVacia():\n        return 0\n    c.resto()\n    return 1 + longitudCola3Aux(c)\n\ndef longitudCola3(c: Cola[A]) -> int:\n    _c = deepcopy(c)\n    return longitudCola3Aux(_c)\n\n# 4\u00aa soluci\u00f3n\n# ===========\n\ndef longitudCola4Aux(c: Cola[A]) -> int:\n    r = 0\n    while not esVacia(c):\n        r = r + 1\n        c = resto(c)\n    return r\n\ndef longitudCola4(c: Cola[A]) -> int:\n    _c = deepcopy(c)\n    return longitudCola4Aux(_c)\n\n# 5\u00aa soluci\u00f3n\n# ===========\n\ndef longitudCola5Aux(c: Cola[A]) -> int:\n    r = 0\n    while not c.esVacia():\n        r = r + 1\n        c.resto()\n    return r\n\ndef longitudCola5(c: Cola[A]) -> int:\n    _c = deepcopy(c)\n    return longitudCola5Aux(_c)\n\n# Comprobaci\u00f3n de equivalencia\n# ============================\n\n# La propiedad es\n@given(c=colaAleatoria())\ndef test_longitudCola_(c: Cola[int]) -> None:\n    r = longitudCola1(c)\n    assert longitudCola2(c) == r\n    assert longitudCola3(c) == r\n    assert longitudCola4(c) == r\n    assert longitudCola5(c) == r\n\n# La comprobaci\u00f3n es\n#    src> poetry run pytest -q longitudCola.py\n#    1 passed in 0.28s\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
Utilizando el tipo abstracto de datos de las colas, definir la funci\u00f3n longitudCola :: Cola a -> Int tal que longitudCola c es el n\u00famero de elementos de la cola c. Por ejemplo, longitudCola (inserta 4 (inserta 2 (inserta 5 vacia))) == 3 Soluciones A continuaci\u00f3n se muestran las soluciones en Haskell y las soluciones…<\/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":[515,585],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7891"}],"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=7891"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7891\/revisions"}],"predecessor-version":[{"id":7892,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7891\/revisions\/7892"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7891"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7891"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7891"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}