🐍
← Back to Blog

Python Cashar 14 — Hawlaha (Functions)

Hawl (function) waa qayb koodh ah oo magac leh oo aad isticmaali karto marar badan. Waxay kuu ogolaataa inaadan koodh isku mid ah dib u qorin, oo ay ka dhigtaa barnaamijka mid nidaamsan.

Qeexidda hawl

def salaan(magac):
    return f'Salaan, {magac}!'

print(salaan('Axmed'))
print(salaan('Maryan'))
Salaan, Axmed!
Salaan, Maryan!

def wuxuu qeexaa hawsha, magac waa parameter, return wuxuu soo celiyaa natiijo. Hawl aan return lahayn waxay soo celisaa None.

Qiimayaal aasaas ah (default)

def qiimo_lacag(qiime, cashuur=0.05):
    return qiime * (1 + cashuur)

print(qiimo_lacag(100))
print(qiimo_lacag(100, 0.10))
print(qiimo_lacag(100, cashuur=0.15))    # magac-ku-yeedhid
105.0
110.00000000000001
114.99999999999999

Soo celin qiimayaal badan

def xog_liis(n):
    return min(n), max(n), sum(n) / len(n)

ugu_yar, ugu_weyn, celcelis = xog_liis([4, 9, 2, 7])
print(ugu_yar, ugu_weyn, celcelis)
2 9 5.5

Docstring

Sadarka ugu horreeya ee qoraalka hawlta gudaheeda waa docstring. Waxay sharraxaysaa hawsha, waxaana ka akhriyi kartaa help().

def laba_jibbaar(x):
    """Soo celi x jibbaarkiisa labaad."""
    return x ** 2

print(laba_jibbaar.__doc__)
print(laba_jibbaar(9))
Soo celi x jibbaarkiisa labaad.
81

Scope: meesha doorsoomuhu ka shaqeeyo

Doorsoome lagu abuuray gudaha hawl waa mid gudaha ah (local), dibadda looguma isticmaali karo.

x = 'dibadda'
def tijaabo():
    x = 'gudaha'
    print(x)
tijaabo()
print(x)
gudaha
dibadda

Digniin: beddelka liiska

Haddii aad liis u gudbiso hawl, hawshu waxay heleysaa isla liiskii. Haddii ay beddesho, wuxuu beddelmayaa kii asalka ahaa. Haddii aadan rabin, samee nuqul.

def laab(l):
    for i in range(len(l)):
        l[i] *= 2

n = [1, 2, 3]
laab(n)
print(n)        # waa is beddelay

def laab_cusub(l):
    return [v * 2 for v in l]
m = [1, 2, 3]
print(laab_cusub(m), m)
[2, 4, 6]
[2, 4, 6] [1, 2, 3]

Layli

  • Qor hawl celcelis(liis) soo celisa celceliska liiska.
  • Qor hawl is_prime(n) oo tusa haddii n tahay tiro aasaas ah.
def celcelis(l):
    return sum(l) / len(l)

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

print(celcelis([10, 20, 30]))
print([n for n in range(1, 30) if is_prime(n)])
20.0
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
Soo koobid: def, return, qiimayaal aasaas ah, docstring. Hawlaha ha beddelin xogta la siiyay haddii aan loo baahnayn.
Koorsada Python (20 cashar):
← Python Cashar 13 — Khaladaadka (Exceptions)
Python Cashar 15 — Module-yada, pip iyo deegaanka virtual →

Maqaallo Kale