G\u00fcnl\u00fck ya\u015fant\u0131m\u0131zda dijitalle\u015fme her ge\u00e7en g\u00fcn artarken, baz\u0131 k\u00f6kl\u00fc sistemler hala varl\u0131\u011f\u0131n\u0131 s\u00fcrd\u00fcrmektedir. Roma rakamlar\u0131 da bu sistemlerden biridir. Peki, modern d\u00fcnyada Roma rakamlar\u0131 neden hala \u00f6nemli ve biz neden onlara ihtiya\u00e7 duyar\u0131z? Saat kadranlar\u0131ndan tarihi eserlerin katalog numaralar\u0131na, film jeneriklerinden resmi belgelerin sayfa i\u015faretlemelerine kadar bir\u00e7ok alanda Roma rakamlar\u0131 kar\u015f\u0131m\u0131za \u00e7\u0131kar. Ancak bu \u00f6zel say\u0131 sistemi, \u00f6zellikle b\u00fcy\u00fck de\u011ferlerde, insanlar\u0131n okumas\u0131 ve tam say\u0131lara d\u00f6n\u00fc\u015ft\u00fcrmesi konusunda karma\u015f\u0131k olabilir. \u0130\u015fte bu noktada Python gibi g\u00fc\u00e7l\u00fc bir programlama dilinin devreye girmesi, bu d\u00f6n\u00fc\u015f\u00fcm s\u00fcrecini hem h\u0131zl\u0131 hem de hatas\u0131z hale getirebilir.<\/p>\n
Bu makalede, Roma rakamlar\u0131 ile tam say\u0131lar aras\u0131nda \u00e7ift y\u00f6nl\u00fc d\u00f6n\u00fc\u015f\u00fcm yapabilen bir Python uygulamas\u0131n\u0131 ad\u0131m ad\u0131m geli\u015ftirece\u011fiz. Konuya tamamen yabanc\u0131 olsan\u0131z bile, temel kavramlardan ba\u015flayarak ileri d\u00fczey hata y\u00f6netimi ve performans optimizasyonu tekniklerine kadar her \u015feyi kademeli olarak \u00f6\u011freneceksiniz. Kapsaml\u0131 bir rehber niteli\u011findeki bu makale, sadece teorik bilgiyi de\u011fil, ayn\u0131 zamanda ger\u00e7ek d\u00fcnya senaryolar\u0131nda bu d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcy\u00fc nas\u0131l kullanabilece\u011finize dair pratik vaka analizlerini de i\u00e7erecektir. Python’\u0131n s\u00f6zl\u00fck (mapping) yap\u0131lar\u0131n\u0131 ve d\u00f6ng\u00fclerini etkili bir \u015fekilde kullanarak, bu kadim say\u0131 sistemini modern programlama d\u00fcnyas\u0131na nas\u0131l ta\u015f\u0131yaca\u011f\u0131m\u0131z\u0131 ke\u015ffedece\u011fiz. Haz\u0131rsan\u0131z, antik Roma’dan dijital d\u00fcnyaya bir yolculu\u011fa \u00e7\u0131kal\u0131m!<\/p>\n
Bu pratik d\u00f6n\u00fc\u015f\u00fcm arac\u0131, hem geli\u015ftiriciler hem de bu t\u00fcr verilerle u\u011fra\u015fan herkes i\u00e7in de\u011ferli bir kaynak olacakt\u0131r. \u00d6zellikle, Roma rakamlar\u0131n\u0131n karma\u015f\u0131k yap\u0131s\u0131, manuel d\u00f6n\u00fc\u015f\u00fcmlerde hatalara yol a\u00e7abilir. Python ile bu s\u00fcreci otomatikle\u015ftirerek, zamandan tasarruf edebilir ve do\u011frulu\u011fu art\u0131rabiliriz.<\/p>\n
Roma rakamlar\u0131, Antik Roma d\u00f6neminde kullan\u0131lan ve g\u00fcn\u00fcm\u00fczde hala baz\u0131 \u00f6zel ba\u011flamlarda kar\u015f\u0131m\u0131za \u00e7\u0131kan bir say\u0131 sistemidir. Arap rakamlar\u0131n\u0131n (0-9) aksine, Roma rakamlar\u0131 yedi temel sembol \u00fczerine kuruludur ve her sembol belirli bir de\u011feri temsil eder. Bu semboller ve kar\u015f\u0131l\u0131klar\u0131 \u015funlard\u0131r:<\/p>\n
Bu temel semboller, belirli kurallara g\u00f6re bir araya getirilerek daha b\u00fcy\u00fck say\u0131lar olu\u015fturulur. Roma rakamlar\u0131n\u0131n i\u015fleyi\u015fini anlamak i\u00e7in bilmemiz gereken ana kurallar \u015funlard\u0131r:<\/p>\n
V, L ve D sembolleri asla \u00e7\u0131karma i\u015fleminde kullan\u0131lmaz; yani bu semboller hi\u00e7bir zaman bir b\u00fcy\u00fck sembol\u00fcn soluna yaz\u0131lamaz.<\/li>\n
Bu kurallar\u0131 anlamak, Roma rakam\u0131ndan tam say\u0131ya ve tam say\u0131dan Roma rakam\u0131na d\u00f6n\u00fc\u015f\u00fcm algoritmalar\u0131m\u0131z\u0131 do\u011fru bir \u015fekilde olu\u015fturabilmek i\u00e7in kritik \u00f6neme sahiptir. \u00d6zellikle \u00e7\u0131karma kural\u0131, d\u00f6n\u00fc\u015f\u00fcm algoritmam\u0131zda \u00f6zel bir if-else yap\u0131s\u0131 gerektirecektir. Python’da bu sembol-de\u011fer e\u015fle\u015fmelerini bir s\u00f6zl\u00fck (dictionary) kullanarak kolayca temsil edebiliriz. \u00d6rne\u011fin, Roma rakamlar\u0131n\u0131 Python’da tam say\u0131lara \u00e7evirmek, belirli bir mant\u0131k ve bir mapping (e\u015fleme) yap\u0131s\u0131 gerektirir. Bu b\u00f6l\u00fcmde, bir Roma rakam\u0131 stringini al\u0131p kar\u015f\u0131l\u0131k gelen tam say\u0131 de\u011ferini d\u00f6nd\u00fcren bir fonksiyonu ad\u0131m ad\u0131m nas\u0131l olu\u015fturaca\u011f\u0131m\u0131z\u0131 inceleyece\u011fiz. Amac\u0131m\u0131z, kullan\u0131c\u0131dan al\u0131nan “MCMXCIV” gibi bir Roma rakam\u0131n\u0131 1994’e d\u00f6n\u00fc\u015ft\u00fcrmektir.<\/p>\n \u00d6ncelikle, her Roma rakam\u0131 sembol\u00fcn\u00fcn say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131n\u0131 i\u00e7eren bir s\u00f6zl\u00fck yap\u0131s\u0131na ihtiyac\u0131m\u0131z var. Bu s\u00f6zl\u00fck, d\u00f6n\u00fc\u015f\u00fcm s\u00fcrecinde sembollerin de\u011ferlerini h\u0131zl\u0131ca bulmam\u0131z\u0131 sa\u011flayacak.<\/p>\n <\/code><\/p>\n D\u00f6n\u00fc\u015f\u00fcm algoritmas\u0131n\u0131n temel mant\u0131\u011f\u0131, Roma rakam\u0131 stringini soldan sa\u011fa do\u011fru taramak ve her sembol\u00fcn de\u011ferini toplayarak ilerlemektir. Ancak burada \u00e7\u0131karma kural\u0131na dikkat etmemiz gerekiyor: e\u011fer mevcut sembol\u00fcn de\u011feri, bir sonraki sembol\u00fcn de\u011ferinden k\u00fc\u00e7\u00fckse, bu iki sembol bir \u00e7\u0131karma i\u015flemi olu\u015fturur (\u00f6rne\u011fin, \"IV\" durumunda I'n\u0131n de\u011feri V'den k\u00fc\u00e7\u00fckt\u00fcr, dolay\u0131s\u0131yla 5-1=4 olur). Bu durumda, mevcut sembol\u00fcn de\u011ferini toplamdan \u00e7\u0131karmal\u0131y\u0131z; aksi takdirde eklemeliyiz.<\/p>\n \u0130\u015fte Roma rakam\u0131ndan tam say\u0131ya d\u00f6n\u00fc\u015f\u00fcm yapan Python fonksiyonu:<\/p>\n <\/code><\/p>\n Yukar\u0131daki kodu inceledi\u011fimizde, Bir m\u00fczede tarihi eserlerin kataloglanmas\u0131 s\u00fcrecini d\u00fc\u015f\u00fcnelim. \u00d6zellikle antik d\u00f6nemden kalma eserlerin \u00fczerinde y\u0131l bilgileri veya b\u00f6l\u00fcm numaralar\u0131 genellikle Roma rakamlar\u0131yla yaz\u0131l\u0131d\u0131r. Manuel olarak bu de\u011ferleri tam say\u0131lara \u00e7evirmek hem zaman al\u0131c\u0131 hem de hataya a\u00e7\u0131k bir i\u015ftir. \u00d6rne\u011fin, m\u00fczenin yeni dijital envanter sistemine binlerce eserin giri\u015fini yaparken, \"MCCLXXV\" (1275) veya \"CDLIX\" (459) gibi Roma rakamlar\u0131n\u0131 h\u0131zl\u0131ca tam say\u0131ya d\u00f6n\u00fc\u015ft\u00fcrmek, veri giri\u015fini b\u00fcy\u00fck \u00f6l\u00e7\u00fcde h\u0131zland\u0131r\u0131r ve hatalar\u0131 azalt\u0131r. Yukar\u0131daki \u015eimdi de tersine bir d\u00f6n\u00fc\u015f\u00fcm i\u015flemine odaklanal\u0131m: bir tam say\u0131y\u0131 al\u0131p, onun Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131n\u0131 \u00fcreten bir fonksiyon yazmak. Bu, \u00f6nceki d\u00f6n\u00fc\u015f\u00fcmden biraz farkl\u0131 bir mant\u0131k gerektirecek \u00e7\u00fcnk\u00fc burada belirli bir s\u0131raya g\u00f6re e\u015fle\u015fmeleri kontrol etmemiz ve say\u0131y\u0131 kademeli olarak azaltmam\u0131z gerekiyor. Amac\u0131m\u0131z, 1994 gibi bir tam say\u0131y\u0131 \"MCMXCIV\" gibi bir Roma rakam\u0131na \u00e7evirmektir.<\/p>\n Tam say\u0131dan Roma rakam\u0131na d\u00f6n\u00fc\u015f\u00fcmde, en b\u00fcy\u00fck Roma rakam\u0131 de\u011ferinden ba\u015flayarak say\u0131dan \u00e7\u0131karmalar yapmam\u0131z gerekir. Bu nedenle, Roma rakam\u0131 sembollerini ve de\u011ferlerini azalan s\u0131raya g\u00f6re i\u00e7eren bir liste (veya tuple) kullanmak en etkili y\u00f6ntemdir. Bu liste, hem ekleme hem de \u00e7\u0131karma kurallar\u0131n\u0131 kapsayan de\u011ferleri i\u00e7ermelidir (\u00f6rn: 900 i\u00e7in CM, 400 i\u00e7in CD gibi).<\/p>\n <\/code><\/p>\n Algoritma \u015fu \u015fekilde i\u015fler: \u0130\u015fte tam say\u0131dan Roma rakam\u0131na d\u00f6n\u00fc\u015f\u00fcm yapan Python fonksiyonu:<\/p>\n <\/code><\/p>\n Yukar\u0131daki Film end\u00fcstrisinde, yap\u0131m y\u0131llar\u0131n\u0131 veya telif hakk\u0131 tarihlerini jeneriklerde Roma rakamlar\u0131yla belirtmek yayg\u0131n bir gelenektir. Bir film st\u00fcdyosunun her y\u0131l \u00e7\u0131kan d\u00fczinelerce filmi i\u00e7in bu tarihleri manuel olarak Roma rakamlar\u0131na \u00e7evirmesi, \u00f6zellikle y\u0131l\u0131n sonlar\u0131na do\u011fru \"MMXXIII\" (2023) gibi uzun ve karma\u015f\u0131k ifadeler i\u00e7in hata potansiyeli ta\u015f\u0131r. Her yaz\u0131l\u0131m uygulamas\u0131nda oldu\u011fu gibi, Roma rakam\u0131 d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcm\u00fcz\u00fcn de sa\u011flam ve g\u00fcvenilir olmas\u0131 i\u00e7in hata y\u00f6netimi ve kenar durumlar\u0131n ele al\u0131nmas\u0131 b\u00fcy\u00fck \u00f6nem ta\u015f\u0131r. Kullan\u0131c\u0131lar\u0131n ge\u00e7ersiz giri\u015fler yapabilece\u011fi, beklentilerin d\u0131\u015f\u0131nda de\u011ferler girebilece\u011fi veya sistemin s\u0131n\u0131rlar\u0131n\u0131 zorlayabilece\u011fi durumlar her zaman mevcuttur. Bu b\u00f6l\u00fcmde, d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcm\u00fcz\u00fc daha dayan\u0131kl\u0131 hale getirmek i\u00e7in kullanabilece\u011fimiz y\u00f6ntemleri inceleyece\u011fiz.<\/p>\n Bu do\u011frulama i\u015flemini ayr\u0131 bir yard\u0131mc\u0131 fonksiyonda toplayabiliriz. \u0130\u015fte \u00f6rnek bir geli\u015ftirme:<\/p>\n <\/code><\/p>\n Yukar\u0131daki <\/code><\/p>\n Bu geli\u015ftirmelerle, d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcm\u00fcz art\u0131k sadece do\u011fru d\u00f6n\u00fc\u015f\u00fcmleri yapmakla kalmayacak, ayn\u0131 zamanda yanl\u0131\u015f giri\u015fleri de ak\u0131ll\u0131ca tespit edip kullan\u0131c\u0131ya yol g\u00f6sterecek. Bu, her t\u00fcrl\u00fc yaz\u0131l\u0131m\u0131n kullan\u0131c\u0131 deneyimi ve g\u00fcvenilirli\u011fi a\u00e7\u0131s\u0131ndan kritik bir ad\u0131md\u0131r. Ek olarak, Basit d\u00f6n\u00fc\u015f\u00fcm ihtiya\u00e7lar\u0131 i\u00e7in yukar\u0131daki fonksiyonlar olduk\u00e7a yeterli olsa da, b\u00fcy\u00fck veri setleriyle \u00e7al\u0131\u015f\u0131rken veya y\u00fcksek performans gerektiren uygulamalarda baz\u0131 optimizasyon teknikleri uygulamak faydal\u0131 olabilir. Ayr\u0131ca, genel yaz\u0131l\u0131m geli\u015ftirme yakla\u015f\u0131mlar\u0131n\u0131 ve mobil uyumluluk gibi modern web kavramlar\u0131n\u0131 da bu ba\u011flamda ele alabiliriz.<\/p>\n E\u011fer ayn\u0131 Roma rakam\u0131 veya tam say\u0131 de\u011feri tekrar tekrar d\u00f6n\u00fc\u015ft\u00fcr\u00fclecekse, her seferinde t\u00fcm algoritmay\u0131 ba\u015ftan \u00e7al\u0131\u015ft\u0131rmak yerine sonu\u00e7lar\u0131 \u00f6nbelle\u011fe almak (caching) performans\u0131 \u00f6nemli \u00f6l\u00e7\u00fcde art\u0131rabilir. Bir lookup tablosu (s\u00f6zl\u00fck) kullanarak daha \u00f6nce hesaplanm\u0131\u015f d\u00f6n\u00fc\u015f\u00fcmlerin sonu\u00e7lar\u0131n\u0131 saklayabiliriz. Bu, \u00f6zellikle \u00e7ok say\u0131da benzersiz olmayan d\u00f6n\u00fc\u015f\u00fcm\u00fcn yap\u0131ld\u0131\u011f\u0131 senaryolarda avantaj sa\u011flar.<\/p>\n <\/code><\/p>\n Bu basit \u00f6nbellekleme mekanizmas\u0131, \u00f6zellikle b\u00fcy\u00fck veri setleriyle \u00e7al\u0131\u015fan uygulamalarda, d\u00f6n\u00fc\u015f\u00fcm s\u00fcrelerini k\u0131saltarak genel performans\u0131 iyile\u015ftirebilir. Python'\u0131n Standart Roma rakamlar\u0131 3999 ile s\u0131n\u0131rl\u0131d\u0131r. Ancak baz\u0131 \u00f6zel uygulamalarda daha b\u00fcy\u00fck say\u0131lar\u0131 g\u00f6stermek gerekebilir. Bu durumda Roma rakamlar\u0131na \u00f6zel i\u015faretler (\u00fcst \u00e7izgi gibi) eklenerek geni\u015fletmeler yap\u0131labilir. \u00d6rne\u011fin, bir say\u0131n\u0131n \u00fczerine \u00e7izgi \u00e7ekilmesi, de\u011ferini 1000 ile \u00e7arpar. (V\u0304 = 5000, X\u0304 = 10000). Bu t\u00fcr bir geni\u015fletme, d\u00f6n\u00fc\u015f\u00fcm mant\u0131\u011f\u0131n\u0131z\u0131 daha karma\u015f\u0131k hale getirse de, belirli senaryolarda faydal\u0131 olabilir. Ancak bu, standart bir uygulama olmad\u0131\u011f\u0131 i\u00e7in, ihtiyaca g\u00f6re \u00f6zel olarak tasarlanmal\u0131d\u0131r.<\/p>\n Bu makalede Python kodlar\u0131na odaklanm\u0131\u015f olsak da, bu t\u00fcr bir d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcy\u00fc bir web uygulamas\u0131 olarak sunmak istedi\u011finizde mobil uyumluluk ve responsive tasar\u0131m vazge\u00e7ilmezdir. Kullan\u0131c\u0131lar d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcn\u00fcze farkl\u0131 boyutlardaki cihazlardan (telefon, tablet, masa\u00fcst\u00fc) eri\u015febilirler. HTML ve CSS kullanarak bunu nas\u0131l sa\u011flayabilece\u011finize dair genel bir bak\u0131\u015f:<\/p>\n <\/code><\/p>\n Bu \u00f6rnek, \u015eimdiye kadar geli\u015ftirdi\u011fimiz iki y\u00f6nl\u00fc Roma rakam\u0131 d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcs\u00fcn\u00fcn ger\u00e7ek d\u00fcnyada nas\u0131l bir fayda sa\u011flayabilece\u011fine dair somut bir \u00f6rnek \u00fczerinden gidelim: Bir \u00fcniversite k\u00fct\u00fcphanesinin dijital otomasyon sistemi.<\/p>\n Bu \u00fcniversite k\u00fct\u00fcphanesinde, hem y\u00fczy\u0131ll\u0131k eski kitaplar hem de modern yay\u0131nlar bulunmaktad\u0131r. Eski kitaplar\u0131n cilt ve b\u00f6l\u00fcm numaralar\u0131 genellikle Roma rakamlar\u0131yla etiketlenmi\u015ftir (\u00f6rn: \"Cilt III\", \"B\u00f6l\u00fcm LVII\"). Yeni dijital sistemde bu bilgilerin tam say\u0131 olarak saklanmas\u0131 ve i\u015flenmesi gerekmektedir. Ayr\u0131ca, yeni bas\u0131lan veya ciltlenen baz\u0131 \u00f6zel koleksiyonlara yine Roma rakamlar\u0131yla etiketleme yap\u0131lmas\u0131 talep edilmektedir.<\/p>\n K\u00fct\u00fcphane otomasyon sistemi, kullan\u0131c\u0131 aray\u00fcz\u00fc ve veritaban\u0131 ile etkile\u015fim kuran bir Python backend'ine sahiptir. Geli\u015ftirdi\u011fimiz K\u00fct\u00fcphaneciler, eski bir kitab\u0131n envanter kayd\u0131n\u0131 yaparken \"Cilt III\" veya \"B\u00f6l\u00fcm LVII\" gibi Roma rakamlar\u0131n\u0131 sisteme girerler. Sistem, bu girdileri otomatik olarak tam say\u0131lara d\u00f6n\u00fc\u015ft\u00fcrerek veritaban\u0131na kaydeder. \u00d6rne\u011fin:<\/p>\n <\/code><\/p>\n Bu sayede, k\u00fct\u00fcphaneciler Roma rakamlar\u0131n\u0131 oldu\u011fu gibi girerken, sistem arka planda verileri say\u0131sal olarak i\u015fleyebilir ve depolayabilir. Hatal\u0131 giri\u015fler durumunda, Yeni bir \u00f6zel koleksiyonun olu\u015fturuldu\u011funu ve k\u00fct\u00fcphane y\u00f6neticisinin her yeni cilt i\u00e7in Roma rakam\u0131yla etiket bas\u0131lmas\u0131n\u0131 istedi\u011fini varsayal\u0131m. K\u00fct\u00fcphane otomasyon sistemi, birim numaras\u0131 gibi tam say\u0131lar\u0131 otomatik olarak Roma rakamlar\u0131na \u00e7evirerek bas\u0131l\u0131 etiketler i\u00e7in uygun format\u0131 sa\u011flayabilir.<\/p>\n <\/code><\/p>\n Bu entegrasyon sayesinde, k\u00fct\u00fcphane personeli karma\u015f\u0131k d\u00f6n\u00fc\u015f\u00fcm kurallar\u0131yla u\u011fra\u015fmak zorunda kalmaz. Sistem, t\u00fcm Roma rakam\u0131 d\u00f6n\u00fc\u015f\u00fcm s\u00fcre\u00e7lerini g\u00fcvenilir ve verimli bir \u015fekilde y\u00f6netir. Bu vaka analizi, geli\u015ftirdi\u011fimiz Python d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcs\u00fcn\u00fcn sadece akademik bir egzersizden ibaret olmad\u0131\u011f\u0131n\u0131, ayn\u0131 zamanda somut i\u015f s\u00fcre\u00e7lerinde pratik ve de\u011ferli bir ara\u00e7 olabilece\u011fini g\u00f6stermektedir.<\/p>\n Bu makale boyunca, Python kullanarak Roma rakamlar\u0131 ile tam say\u0131lar aras\u0131nda \u00e7ift y\u00f6nl\u00fc, g\u00fcvenilir ve esnek bir d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fc olu\u015fturmay\u0131 ad\u0131m ad\u0131m \u00f6\u011frendik. Temel Roma rakam\u0131 kurallar\u0131ndan ba\u015flayarak, mapping yap\u0131lar\u0131, d\u00f6ng\u00fcler ve ko\u015fullu ifadelerle algoritmalar\u0131m\u0131z\u0131 \u015fekillendirdik. Daha sonra, kullan\u0131c\u0131dan gelebilecek hatal\u0131 girdilere kar\u015f\u0131 dayan\u0131kl\u0131 olmak i\u00e7in geli\u015fmi\u015f hata y\u00f6netimi tekniklerini ve kenar durumlar\u0131 ele ald\u0131k. Son olarak, performans optimizasyonu i\u00e7in \u00f6nbellekleme mekanizmalar\u0131n\u0131 inceledik ve bir k\u00fct\u00fcphane otomasyon sistemi \u00fczerinden ger\u00e7ek d\u00fcnya senaryolar\u0131nda bu d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcn\u00fcn nas\u0131l kullan\u0131labilece\u011fini ke\u015ffettik.<\/p>\n Art\u0131k elinizde, hem Roma rakamlar\u0131n\u0131 tam say\u0131lara hem de tam say\u0131lar\u0131 Roma rakamlar\u0131na d\u00f6n\u00fc\u015ft\u00fcrebilen g\u00fc\u00e7l\u00fc bir Python arac\u0131 var. Bu d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fc ile \u015funlar\u0131 yapabilirsiniz:<\/p>\n Bu beceriler, sadece Roma rakamlar\u0131 \u00f6zelinde de\u011fil, ayn\u0131 zamanda genel programlama ve problem \u00e7\u00f6zme yetenekleriniz a\u00e7\u0131s\u0131ndan da size yeni kap\u0131lar a\u00e7acakt\u0131r. Herhangi bir programlama projesinde, verilen bir problemi par\u00e7alara ay\u0131rma, algoritmalar tasarlama, hata y\u00f6netimi uygulama ve performans\u0131 art\u0131rma gibi ad\u0131mlar kritik \u00f6neme sahiptir. Roma rakam\u0131 d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcs\u00fc \u00f6rne\u011fi, bu prensipleri somut bir \u015fekilde uygulama f\u0131rsat\u0131 sundu. Unutmay\u0131n, \u00f6\u011frendi\u011finiz her yeni kavram, programlama yolculu\u011funuzda sizi bir ad\u0131m daha ileriye ta\u015f\u0131yacakt\u0131r. \u015eimdiden ba\u015far\u0131lar!<\/p>\n <\/body><\/p>\n","protected":false},"excerpt":{"rendered":"G\u00fcnl\u00fck ya\u015fant\u0131m\u0131zda dijitalle\u015fme her ge\u00e7en g\u00fcn artarken, baz\u0131 k\u00f6kl\u00fc sistemler hala varl\u0131\u011f\u0131n\u0131 s\u00fcrd\u00fcrmektedir. Roma rakamlar\u0131 da bu sistemlerden…","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1403],"tags":[],"class_list":{"0":"post-34830","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-python","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n{\"I\": 1, \"V\": 5, \"X\": 10, ...}<\/code> \u015feklinde bir yap\u0131, d\u00f6n\u00fc\u015f\u00fcm i\u015flemlerimizin temelini olu\u015fturacakt\u0131r. Bu temel bilgiyi kavrad\u0131ktan sonra, art\u0131k Python ile d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcm\u00fcz\u00fc in\u015fa etmeye ba\u015flayabiliriz.<\/p>\nPython’da Roma Rakam\u0131ndan Tam Say\u0131ya D\u00f6n\u00fc\u015f\u00fcm: Ad\u0131m Ad\u0131m Rehber<\/h2>\n
D\u00f6n\u00fc\u015f\u00fcm \u0130\u00e7in Gerekli Mapping Yap\u0131s\u0131 ve Algoritma Mant\u0131\u011f\u0131<\/h3>\n
\nroman_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n}\n <\/pre>\n\ndef roman_to_int(s: str) -> int:\n roman_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n }\n \n total = 0\n i = 0\n \n while i < len(s):\n current_value = roman_map[s[i]]\n \n # Bir sonraki sembol varsa ve mevcut sembolden b\u00fcy\u00fckse \u00e7\u0131karma kural\u0131 uygulan\u0131r\n if i + 1 < len(s) and roman_map[s[i+1]] > current_value:\n total += roman_map[s[i+1]] - current_value\n i += 2 # \u0130ki sembol\u00fc birden i\u015fledi\u011fimiz i\u00e7in indeksi 2 art\u0131r\n else:\n total += current_value\n i += 1 # Tek sembol i\u015fledi\u011fimiz i\u00e7in indeksi 1 art\u0131r\n \n return total\n\n# Testler\nprint(f\"III Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131: {roman_to_int('III')}\") # \u00c7\u0131kt\u0131: 3\nprint(f\"LVIII Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131: {roman_to_int('LVIII')}\") # \u00c7\u0131kt\u0131: 58\nprint(f\"MCMXCIV Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131: {roman_to_int('MCMXCIV')}\") # \u00c7\u0131kt\u0131: 1994\nprint(f\"IV Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131: {roman_to_int('IV')}\") # \u00c7\u0131kt\u0131: 4\nprint(f\"IX Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131: {roman_to_int('IX')}\") # \u00c7\u0131kt\u0131: 9\n <\/pre>\nroman_to_int<\/code> fonksiyonu bir while<\/code> d\u00f6ng\u00fcs\u00fc kullanarak Roma rakam\u0131 stringini karakter karakter tarar. Her ad\u0131mda current_value<\/code> ad\u0131nda mevcut sembol\u00fcn say\u0131sal de\u011ferini al\u0131r. Daha sonra, bir sonraki sembol\u00fcn varl\u0131\u011f\u0131n\u0131 ve de\u011ferini kontrol eder. E\u011fer bir sonraki sembol mevcutsa (i + 1 < len(s)<\/code>) ve de\u011feri mevcut sembolden b\u00fcy\u00fckse, bu bir \u00e7\u0131karma durumunu i\u015faret eder (\u00f6rne\u011fin 'I' ve 'V' yan yana geldi\u011finde 'IV' gibi). Bu durumda, total<\/code> de\u011ferine sonraki_de\u011fer - mevcut_de\u011fer<\/code> eklenir ve d\u00f6ng\u00fc indeksi iki ad\u0131m ilerletilir \u00e7\u00fcnk\u00fc iki sembol birden i\u015flenmi\u015ftir. Aksi takdirde, yani bir \u00e7\u0131karma durumu yoksa, sadece mevcut sembol\u00fcn de\u011feri total<\/code>a eklenir ve d\u00f6ng\u00fc indeksi bir ad\u0131m ilerletilir. Bu sayede t\u00fcm string do\u011fru bir \u015fekilde i\u015flenir.<\/p>\nVaka Analizi: Tarihi Eserlerin Kataloglanmas\u0131<\/h3>\n
roman_to_int<\/code> fonksiyonu, bu t\u00fcr bir sistemde anahtar bir bile\u015fen olarak g\u00f6rev yaparak, envanter uzmanlar\u0131n\u0131n i\u015f y\u00fck\u00fcn\u00fc hafifletir ve veri tutarl\u0131l\u0131\u011f\u0131n\u0131 sa\u011flar.<\/p>\nPython'da Tam Say\u0131dan Roma Rakam\u0131na D\u00f6n\u00fc\u015f\u00fcm: \u0130ki Y\u00f6nl\u00fc \u0130\u015flem Nas\u0131l Yap\u0131l\u0131r?<\/h2>\n
D\u00f6n\u00fc\u015f\u00fcm \u0130\u00e7in Azalan De\u011fer S\u0131ralamas\u0131 ve Algoritma<\/h3>\n
\n# Azalan de\u011fer s\u0131ras\u0131na g\u00f6re mapping\n# Hem temel de\u011ferleri hem de \u00e7\u0131karma kural\u0131 \u00e7iftlerini i\u00e7erir\nint_roman_map = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n]\n <\/pre>\nint_roman_map<\/code> listesindeki her bir \u00e7ifti s\u0131ras\u0131yla kontrol ederiz. E\u011fer d\u00f6n\u00fc\u015ft\u00fcr\u00fclecek say\u0131 (\u00f6rne\u011fin num<\/code>) listedeki mevcut de\u011ferden (\u00f6rne\u011fin 1000) b\u00fcy\u00fck veya e\u015fitse, o de\u011ferin Roma rakam\u0131 sembol\u00fcn\u00fc sonu\u00e7 stringimize ekleriz ve num<\/code> de\u011ferini o de\u011fer kadar azalt\u0131r\u0131z. Bu i\u015flemi num<\/code> s\u0131f\u0131r olana kadar veya listedeki t\u00fcm \u00e7iftler kontrol edilene kadar devam ettiririz. Bu yakla\u015f\u0131m, say\u0131lar\u0131n do\u011fru Roma rakam\u0131 kar\u015f\u0131l\u0131klar\u0131n\u0131, hem ekleme hem de \u00e7\u0131karma kurallar\u0131n\u0131 otomatik olarak uygulayarak bulmam\u0131z\u0131 sa\u011flar.<\/p>\n\ndef int_to_roman(num: int) -> str:\n if not (1 <= num <= 3999): # Roma rakamlar\u0131 genellikle 1'den 3999'a kadar olan say\u0131lar\u0131 temsil eder\n raise ValueError(\"Roma rakamlar\u0131 sadece 1 ile 3999 aras\u0131ndaki say\u0131lar i\u00e7in ge\u00e7erlidir.\")\n\n int_roman_map = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n ]\n \n roman_numeral = []\n \n for value, symbol in int_roman_map:\n while num >= value:\n roman_numeral.append(symbol)\n num -= value\n \n return \"\".join(roman_numeral)\n\n# Testler\nprint(f\"3 say\u0131s\u0131n\u0131n Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131: {int_to_roman(3)}\") # \u00c7\u0131kt\u0131: III\nprint(f\"58 say\u0131s\u0131n\u0131n Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131: {int_to_roman(58)}\") # \u00c7\u0131kt\u0131: LVIII\nprint(f\"1994 say\u0131s\u0131n\u0131n Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131: {int_to_roman(1994)}\") # \u00c7\u0131kt\u0131: MCMXCIV\nprint(f\"4 say\u0131s\u0131n\u0131n Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131: {int_to_roman(4)}\") # \u00c7\u0131kt\u0131: IV\nprint(f\"9 say\u0131s\u0131n\u0131n Roma rakam\u0131 kar\u015f\u0131l\u0131\u011f\u0131: {int_to_roman(9)}\") # \u00c7\u0131kt\u0131: IX\n <\/pre>\nint_to_roman<\/code> fonksiyonu, \u00f6ncelikle girdi num<\/code> de\u011ferinin ge\u00e7erli bir aral\u0131kta (1-3999) olup olmad\u0131\u011f\u0131n\u0131 kontrol eder. Daha sonra, \u00f6nceden tan\u0131mlanm\u0131\u015f int_roman_map<\/code> \u00fczerinde d\u00f6ng\u00fcye girer. Her bir (value, symbol)<\/code> \u00e7ifti i\u00e7in, num<\/code> de\u011feri value<\/code>dan b\u00fcy\u00fck veya e\u015fit oldu\u011fu s\u00fcrece, ilgili symbol<\/code>u roman_numeral<\/code> listesine ekler ve num<\/code> de\u011ferini value<\/code> kadar azalt\u0131r. Bu while<\/code> d\u00f6ng\u00fcs\u00fc, her value<\/code> i\u00e7in m\u00fcmk\u00fcn olan en fazla sembol\u00fc eklemeyi sa\u011flar. \u00d6rne\u011fin, 2000 i\u00e7in iki kez 'M' eklenir. for<\/code> d\u00f6ng\u00fcs\u00fc tamamland\u0131\u011f\u0131nda, roman_numeral<\/code> listesindeki t\u00fcm semboller birle\u015ftirilerek nihai Roma rakam\u0131 stringi olu\u015fturulur ve d\u00f6nd\u00fcr\u00fcl\u00fcr. Bu y\u00f6ntem, hem verimli hem de Roma rakamlar\u0131n\u0131n kurallar\u0131na uygun bir d\u00f6n\u00fc\u015f\u00fcm sa\u011flar.<\/p>\nVaka Analizi: Film Jeneriklerinin Otomasyonu<\/h3>\n
int_to_roman<\/code> fonksiyonumuz, bu s\u00fcreci otomatikle\u015ftirerek, film jeneriklerinin do\u011fru ve tutarl\u0131 bir \u015fekilde haz\u0131rlanmas\u0131n\u0131 sa\u011flar. Y\u00f6netmen sadece y\u0131l\u0131n tam say\u0131 de\u011ferini girer ve sistem otomatik olarak do\u011fru Roma rakam\u0131n\u0131 \u00e7\u0131kt\u0131 verir. Bu sayede post-prod\u00fcksiyon s\u00fcre\u00e7lerinde zaman kazan\u0131l\u0131r ve g\u00f6rsel tutarl\u0131l\u0131k korunur.<\/p>\nHata Y\u00f6netimi ve Kenar Durumlar: Daha Sa\u011flam Bir D\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fc \u0130\u00e7in \u0130pu\u00e7lar\u0131<\/h2>\n
Ge\u00e7ersiz Roma Rakamlar\u0131 ve Giri\u015f Do\u011frulama<\/h3>\n
roman_to_int<\/code> fonksiyonumuz i\u00e7in en yayg\u0131n kenar durum, ge\u00e7ersiz bir Roma rakam\u0131 stringi girilmesidir. \u00d6rne\u011fin, \"IIII\" (do\u011frusu \"IV\" olmal\u0131), \"IC\" (do\u011frusu \"XCIX\" veya \"IM\" m\u00fcmk\u00fcn de\u011fil), \"VV\" gibi tekrarlar veya roman_map<\/code> i\u00e7inde bulunmayan karakterler hatalara yol a\u00e7abilir. Bu t\u00fcr durumlar\u0131 ele almak i\u00e7in, girdi stringini ba\u015ftan do\u011frulamak \u00f6nemlidir.<\/p>\n\n
\nimport re # D\u00fczenli ifadeler i\u00e7in\n\ndef is_valid_roman(s: str) -> bool:\n # 1. Ge\u00e7ersiz karakter kontrol\u00fc\n if not re.fullmatch(r\"^[IVXLCDM]*$\", s):\n return False\n\n # 2. Tekrarlama ve \u00e7\u0131karma kural\u0131 ihlalleri i\u00e7in regex tabanl\u0131 kontrol\n # Bu regex, genel olarak kabul edilen Roma rakam\u0131 formatlar\u0131n\u0131 kontrol eder.\n # \u00d6rne\u011fin, \"IIII\" veya \"VV\" gibi ge\u00e7ersiz tekrarlar, \"IL\" gibi ge\u00e7ersiz \u00e7\u0131karmalar bu patern'e uymaz.\n pattern = r\"^M{0,3}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})$\"\n if not re.fullmatch(pattern, s):\n return False\n\n # Ek mant\u0131ksal kontrol: E\u011fer d\u00f6n\u00fc\u015f\u00fcm yap\u0131l\u0131p tekrar eski haline getirildi\u011finde ayn\u0131 m\u0131?\n # Bu, baz\u0131 karma\u015f\u0131k ge\u00e7ersiz durumlar\u0131 yakalaman\u0131n g\u00fc\u00e7l\u00fc bir yoludur, ancak performans maliyeti vard\u0131r.\n # Bu ad\u0131m\u0131 sadece \u00e7ok kat\u0131 do\u011frulama gerektiren durumlar i\u00e7in d\u00fc\u015f\u00fcnebiliriz.\n # if roman_to_int(s) != int_to_roman(roman_to_int(s)):\n # return False\n\n return True\n\n# Roman to int fonksiyonunu g\u00fcncelleme\ndef roman_to_int_improved(s: str) -> int:\n if not is_valid_roman(s):\n raise ValueError(f\"Ge\u00e7ersiz Roma rakam\u0131 format\u0131: {s}\")\n\n roman_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n }\n \n total = 0\n i = 0\n \n while i < len(s):\n current_value = roman_map[s[i]]\n \n if i + 1 < len(s) and roman_map[s[i+1]] > current_value:\n total += roman_map[s[i+1]] - current_value\n i += 2\n else:\n total += current_value\n i += 1\n \n return total\n\n# Testler\ntry:\n print(f\"Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131 (ge\u00e7erli): {roman_to_int_improved('MCMXCIV')}\")\n print(f\"Roma rakam\u0131n\u0131n say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131 (ge\u00e7ersiz): {roman_to_int_improved('IIII')}\")\nexcept ValueError as e:\n print(e) # \u00c7\u0131kt\u0131: Ge\u00e7ersiz Roma rakam\u0131 format\u0131: IIII\n <\/pre>\nis_valid_roman<\/code> fonksiyonu, re<\/code> (regular expressions) mod\u00fcl\u00fcn\u00fc kullanarak Roma rakam\u0131n\u0131n format\u0131n\u0131 kontrol eder. \u0130lk regex, sadece izin verilen karakterlerin (I, V, X, L, C, D, M<\/code>) kullan\u0131ld\u0131\u011f\u0131n\u0131 do\u011frular. \u0130kinci ve daha karma\u015f\u0131k regex ise, tekrarlama ve \u00e7\u0131karma kurallar\u0131n\u0131 hesaba katarak genel bir Roma rakam\u0131 ge\u00e7erlili\u011fi kontrol\u00fc yapar. Bu sayede, \"IIII\" veya \"VV\" gibi yayg\u0131n hatalar yakalanabilir. roman_to_int_improved<\/code> fonksiyonumuz art\u0131k bir ValueError<\/code> y\u00fckselterek kullan\u0131c\u0131ya ge\u00e7ersiz bir giri\u015f yapt\u0131\u011f\u0131n\u0131 bildirebilir.<\/p>\nS\u0131f\u0131r, Negatif Say\u0131lar ve \u00c7ok B\u00fcy\u00fck Say\u0131lar<\/h3>\n
int_to_roman<\/code> fonksiyonu i\u00e7in de benzer hatalar\u0131 y\u00f6netmeliyiz. Roma rakamlar\u0131 genellikle pozitif tam say\u0131lar i\u00e7in kullan\u0131l\u0131r ve s\u0131f\u0131r veya negatif say\u0131lar i\u00e7in do\u011frudan bir kar\u015f\u0131l\u0131\u011f\u0131 yoktur. Ayr\u0131ca, mevcut Roma rakam\u0131 sisteminde 3999'dan (MMMCMXCIX) b\u00fcy\u00fck say\u0131lar i\u00e7in standart bir g\u00f6sterim bulunmaz. Bu durumlar i\u00e7in de bir do\u011frulama eklemek \u00f6nemlidir:<\/p>\n\ndef int_to_roman_improved(num: int) -> str:\n if not isinstance(num, int):\n raise TypeError(\"Girdi bir tam say\u0131 olmal\u0131d\u0131r.\")\n if not (1 <= num <= 3999):\n raise ValueError(f\"Roma rakamlar\u0131 sadece 1 ile 3999 aras\u0131ndaki say\u0131lar i\u00e7in ge\u00e7erlidir. Girilen: {num}\")\n\n int_roman_map = [\n (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'),\n (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),\n (10, 'X'), (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')\n ]\n \n roman_numeral = []\n \n for value, symbol in int_roman_map:\n while num >= value:\n roman_numeral.append(symbol)\n num -= value\n \n return \"\".join(roman_numeral)\n\n# Testler\ntry:\n print(f\"Say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131n Roma rakam\u0131 (ge\u00e7erli): {int_to_roman_improved(2023)}\")\n print(f\"Say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131n Roma rakam\u0131 (s\u0131f\u0131r): {int_to_roman_improved(0)}\")\nexcept (ValueError, TypeError) as e:\n print(e) # \u00c7\u0131kt\u0131: Roma rakamlar\u0131 sadece 1 ile 3999 aras\u0131ndaki say\u0131lar i\u00e7in ge\u00e7erlidir. Girilen: 0\n\ntry:\n print(f\"Say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131n Roma rakam\u0131 (b\u00fcy\u00fck): {int_to_roman_improved(4000)}\")\nexcept (ValueError, TypeError) as e:\n print(e) # \u00c7\u0131kt\u0131: Roma rakamlar\u0131 sadece 1 ile 3999 aras\u0131ndaki say\u0131lar i\u00e7in ge\u00e7erlidir. Girilen: 4000\n\ntry:\n print(f\"Say\u0131sal kar\u015f\u0131l\u0131\u011f\u0131n Roma rakam\u0131 (ge\u00e7ersiz tip): {int_to_roman_improved('123')}\")\nexcept (ValueError, TypeError) as e:\n print(e) # \u00c7\u0131kt\u0131: Girdi bir tam say\u0131 olmal\u0131d\u0131r.\n <\/pre>\ntry-except<\/code> bloklar\u0131 kullanarak bu hatalar\u0131 uygulaman\u0131z\u0131n farkl\u0131 yerlerinde zarif bir \u015fekilde yakalayabilir ve kullan\u0131c\u0131ya \u00f6zel mesajlar g\u00f6sterebilirsiniz.<\/p>\nPerformans Optimizasyonu ve Geli\u015fmi\u015f Teknikler: D\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcn\u00fcz\u00fc Daha H\u0131zl\u0131 ve Ak\u0131ll\u0131 Yap\u0131n<\/h2>\n
Lookup Tablolar\u0131 (Caching) ile Performans\u0131 Art\u0131rma<\/h3>\n
\nroman_to_int_cache = {}\nint_to_roman_cache = {}\n\ndef roman_to_int_cached(s: str) -> int:\n if s in roman_to_int_cache:\n return roman_to_int_cache[s]\n \n # Normal d\u00f6n\u00fc\u015f\u00fcm mant\u0131\u011f\u0131 (yukar\u0131daki roman_to_int_improved fonksiyonu burada \u00e7a\u011fr\u0131l\u0131r)\n result = roman_to_int_improved(s) # Varsayal\u0131m ki bu fonksiyon hata y\u00f6netimi de yap\u0131yor\n roman_to_int_cache[s] = result\n return result\n\ndef int_to_roman_cached(num: int) -> str:\n if num in int_to_roman_cache:\n return int_to_roman_cache[num]\n \n # Normal d\u00f6n\u00fc\u015f\u00fcm mant\u0131\u011f\u0131 (yukar\u0131daki int_to_roman_improved fonksiyonu burada \u00e7a\u011fr\u0131l\u0131r)\n result = int_to_roman_improved(num) # Varsayal\u0131m ki bu fonksiyon hata y\u00f6netimi de yap\u0131yor\n int_to_roman_cache[num] = result\n return result\n\n# Testler\nprint(f\"MCMXCIV (cached): {roman_to_int_cached('MCMXCIV')}\")\nprint(f\"MCMXCIV (cached, tekrar): {roman_to_int_cached('MCMXCIV')}\") # \u0130kinci \u00e7a\u011fr\u0131da \u00f6nbellekten d\u00f6ner\nprint(f\"1994 (cached): {int_to_roman_cached(1994)}\")\n <\/pre>\nfunctools.lru_cache<\/code> dekoret\u00f6r\u00fc de benzer bir i\u015flevi daha zarif bir \u015fekilde sunar.<\/p>\nDaha B\u00fcy\u00fck Say\u0131lar \u0130\u00e7in Geni\u015fletme Yakla\u015f\u0131mlar\u0131<\/h3>\n
Mobil Uyumlu HTML ve Responsive Tasar\u0131m Fikirleri<\/h3>\n
\n
<\/code> eklemek, taray\u0131c\u0131ya sayfan\u0131n cihaz geni\u015fli\u011fine g\u00f6re \u00f6l\u00e7eklenmesi gerekti\u011fini s\u00f6yler.<\/li>\n\n\/* Mobil cihazlar i\u00e7in *\/\n@media (max-width: 768px) {\n body {\n font-size: 14px;\n }\n .converter-container {\n width: 95%;\n padding: 10px;\n }\n}\n\n\/* Masa\u00fcst\u00fc i\u00e7in *\/\n@media (min-width: 769px) {\n .converter-container {\n width: 600px;\n margin: 20px auto;\n }\n}\n <\/pre>\nconverter-container<\/code> adl\u0131 bir d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fc aray\u00fcz\u00fc i\u00e7in farkl\u0131 ekran boyutlar\u0131nda farkl\u0131 geni\u015flik ve kenar bo\u015fluklar\u0131 ayarlayarak mobil uyumlu bir g\u00f6r\u00fcn\u00fcm sa\u011flar. Bu sadece bir Python d\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcs\u00fcn\u00fcn web aray\u00fcz\u00fcne ta\u015f\u0131nmas\u0131 durumunda g\u00f6z \u00f6n\u00fcnde bulundurulmas\u0131 gereken genel bir tasar\u0131m ilkesidir.<\/p>\n<\/li>\n<\/ul>\nGer\u00e7ek D\u00fcnya Senaryosu: Bir K\u00fct\u00fcphane Otomasyon Sistemi<\/h2>\n
Senaryo Detay\u0131<\/h3>\n
\u00c7\u00f6z\u00fcm\u00fcn Entegrasyonu<\/h3>\n
roman_to_int_improved<\/code> ve int_to_roman_improved<\/code> fonksiyonlar\u0131n\u0131 bu backend'e entegre edebiliriz.<\/p>\nRoma Rakam\u0131ndan Tam Say\u0131ya D\u00f6n\u00fc\u015f\u00fcm (Eski Kitaplar \u0130\u00e7in)<\/h4>\n
\n# Python backend'i i\u00e7inde bir fonksiyon\ndef process_old_book_entry(title, author, roman_volume_num, roman_chapter_num):\n try:\n volume_int = roman_to_int_improved(roman_volume_num)\n chapter_int = roman_to_int_improved(roman_chapter_num)\n \n # Veritaban\u0131na kaydetme i\u015flemi (\u00f6rnek)\n print(f\"Kitap kaydedildi: '{title}' - Yazar: {author}, Cilt: {volume_int}, B\u00f6l\u00fcm: {chapter_int}\")\n # db.save_book(title, author, volume_int, chapter_int)\n return True\n except ValueError as e:\n print(f\"Hata: Ge\u00e7ersiz Roma rakam\u0131 giri\u015fi - {e}\")\n return False\n\n# Kullan\u0131m \u00f6rne\u011fi\nprocess_old_book_entry(\"Antik Felsefe\", \"Aristo\", \"III\", \"LVIII\")\nprocess_old_book_entry(\"Yeni Bulu\u015flar\", \"Bilim Adam\u0131\", \"IIII\", \"V\") # Hatal\u0131 giri\u015f\n <\/pre>\nValueError<\/code> yakalanarak kullan\u0131c\u0131ya anla\u015f\u0131l\u0131r bir mesaj sunulur.<\/p>\nTam Say\u0131dan Roma Rakam\u0131na D\u00f6n\u00fc\u015f\u00fcm (Yeni Etiketleme \u0130\u00e7in)<\/h4>\n
\n# Python backend'i i\u00e7inde bir fonksiyon\ndef generate_new_collection_label(collection_name, item_number):\n try:\n roman_item_num = int_to_roman_improved(item_number)\n label_text = f\"Koleksiyon: {collection_name}, \u00dcnite: {roman_item_num}\"\n \n # Etiket yazd\u0131rma i\u015flemi (\u00f6rnek)\n print(f\"Olu\u015fturulan etiket: {label_text}\")\n # printer.print_label(label_text)\n return label_text\n except (ValueError, TypeError) as e:\n print(f\"Hata: Etiket olu\u015fturulamad\u0131 - {e}\")\n return None\n\n# Kullan\u0131m \u00f6rne\u011fi\ngenerate_new_collection_label(\"Nadir El Yazmalar\u0131\", 123)\ngenerate_new_collection_label(\"Nadir El Yazmalar\u0131\", 4000) # Hatal\u0131 giri\u015f\n <\/pre>\nSonu\u00e7: Roma Rakamlar\u0131 D\u00f6n\u00fc\u015ft\u00fcr\u00fcc\u00fcn\u00fczle Neler Yapabilirsiniz?<\/h2>\n
\n
S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\n
\n
functools.lru_cache<\/code> veya kendi s\u00f6zl\u00fck tabanl\u0131 \u00f6nbelle\u011finiz) kullanmay\u0131 d\u00fc\u015f\u00fcnebilirsiniz. Ayr\u0131ca, giri\u015f verilerinin boyutunu k\u00fc\u00e7\u00fcltmek, d\u00f6ng\u00fcleri ve ko\u015fullu kontrolleri optimize etmek de yard\u0131mc\u0131 olabilir. A\u015f\u0131r\u0131 durumlarda, C\/C++ gibi daha d\u00fc\u015f\u00fck seviyeli dillerde yaz\u0131lm\u0131\u015f performans kritik par\u00e7alar\u0131 Python'a entegre etmek (C uzant\u0131lar\u0131) bir se\u00e7enek olabilir.<\/dd>\n