# Python Documentation Turkish Translation
# Copyright (C) 2001-2024, Python Software Foundation
# This file is distributed under the same license as the Python package.
#
msgid ""
msgstr ""
"Project-Id-Version: Python 3.12\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2024-11-01 00:21+0000\n"
"PO-Revision-Date: 2022-12-28 21:39+0300\n"
"Last-Translator: \n"
"Language-Team: TURKISH \n"
"Language: tr\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
"X-Generator: Poedit 3.2.2\n"
#: tutorial/datastructures.rst:5
msgid "Data Structures"
msgstr "Veri Yaplar"
#: tutorial/datastructures.rst:7
msgid ""
"This chapter describes some things you've learned about already in more "
"detail, and adds some new things as well."
msgstr ""
"Bu blm, daha nce rendiiniz baz eyleri daha ayrntl olarak "
"aklamakta ve baz yeni eyler de eklemektedir."
#: tutorial/datastructures.rst:13
msgid "More on Lists"
msgstr "Listeler zerine"
#: tutorial/datastructures.rst:15
msgid ""
"The list data type has some more methods. Here are all of the methods of "
"list objects:"
msgstr ""
"Liste veri trnn baz yntemleri daha vardr. Liste nesnelerinin tm "
"metotlar unlardr:"
#: tutorial/datastructures.rst:22
#, fuzzy
msgid "Add an item to the end of the list. Similar to ``a[len(a):] = [x]``."
msgstr "Listenin sonuna bir e ekleyin. ``a[len(a):] = [x]`` ile e deerdir."
#: tutorial/datastructures.rst:28
#, fuzzy
msgid ""
"Extend the list by appending all the items from the iterable. Similar to "
"``a[len(a):] = iterable``."
msgstr ""
"Listeyi iterable'daki tm eleri ekleyerek geniletin. ``a[len(a):] = "
"iterable`` ile e deerdir."
#: tutorial/datastructures.rst:35
msgid ""
"Insert an item at a given position. The first argument is the index of the "
"element before which to insert, so ``a.insert(0, x)`` inserts at the front "
"of the list, and ``a.insert(len(a), x)`` is equivalent to ``a.append(x)``."
msgstr ""
"Verilen pozisyona bir e ekleyin. lk argman, daha nce ekleyeceiniz "
"enin indeksidir, bu nedenle ``a.insert(0, x)`` listenin nne ekler ve ``a."
"insert(len(a), x)`` komutu ``a.append(x)`` komutu ile e deerdir."
#: tutorial/datastructures.rst:43
msgid ""
"Remove the first item from the list whose value is equal to *x*. It raises "
"a :exc:`ValueError` if there is no such item."
msgstr ""
"Deeri *x*'e eit olan ilk eyi listeden kaldrr. Byle bir e yoksa :"
"exc:`ValueError` hatas ortaya kar."
#: tutorial/datastructures.rst:50
#, fuzzy
msgid ""
"Remove the item at the given position in the list, and return it. If no "
"index is specified, ``a.pop()`` removes and returns the last item in the "
"list. It raises an :exc:`IndexError` if the list is empty or the index is "
"outside the list range."
msgstr ""
"Listede verilen konumdaki eyi kaldrr ve geri dndrr. Herhangi bir "
"indis belirtilmezse, ``a.pop()`` listedeki son eyi kaldrr ve dndrr. "
"(Yntem imzasndaki *i* parametresinin etrafndaki keli parantezler, "
"parametrenin istee bal olduunu belirtir, o konumda keli parantez "
"yazmanz gerektiini deil. Bu gsterimi Python Ktphane Referansnda "
"ska greceksiniz)"
#: tutorial/datastructures.rst:59
#, fuzzy
msgid "Remove all items from the list. Similar to ``del a[:]``."
msgstr "Listeden tm eleri kaldrr. ``del a[:]`` ile e deerdir."
#: tutorial/datastructures.rst:65
msgid ""
"Return zero-based index in the list of the first item whose value is equal "
"to *x*. Raises a :exc:`ValueError` if there is no such item."
msgstr ""
"Deeri *x*'e eit olan ilk enin listedeki sfr tabanl indeksini "
"dndrr. Byle bir e yoksa :exc:`ValueError` hatas ortaya kar."
#: tutorial/datastructures.rst:68
msgid ""
"The optional arguments *start* and *end* are interpreted as in the slice "
"notation and are used to limit the search to a particular subsequence of the "
"list. The returned index is computed relative to the beginning of the full "
"sequence rather than the *start* argument."
msgstr ""
"stee bal *start* ve *end* argmanlar dilim gsteriminde olduu gibi "
"yorumlanr ve aramay listenin belirli bir alt dizisiyle snrlamak iin "
"kullanlr. Dndrlen dizin, *start* bamsz deikeni yerine tam dizinin "
"balangcna gre hesaplanr."
#: tutorial/datastructures.rst:77
msgid "Return the number of times *x* appears in the list."
msgstr "Listede *x* esinin ka kez grndn dndrr."
#: tutorial/datastructures.rst:83
msgid ""
"Sort the items of the list in place (the arguments can be used for sort "
"customization, see :func:`sorted` for their explanation)."
msgstr ""
"Listenin elerini yerinde sralayn (argmanlar sralama zelletirmesi "
"iin kullanlabilir, aklamalar iin bkz: :func:`sorted`)."
#: tutorial/datastructures.rst:90
msgid "Reverse the elements of the list in place."
msgstr "Listenin elerini yerinde ters evirir."
#: tutorial/datastructures.rst:96
#, fuzzy
msgid "Return a shallow copy of the list. Similar to ``a[:]``."
msgstr "Listenin yzeysel bir kopyasn dndrr. ``a[:]`` ile e deerdir."
#: tutorial/datastructures.rst:99
msgid "An example that uses most of the list methods::"
msgstr "Liste yntemlerinin ounu kullanan bir rnek::"
#: tutorial/datastructures.rst:101
msgid ""
">>> fruits = ['orange', 'apple', 'pear', 'banana', 'kiwi', 'apple', "
"'banana']\n"
">>> fruits.count('apple')\n"
"2\n"
">>> fruits.count('tangerine')\n"
"0\n"
">>> fruits.index('banana')\n"
"3\n"
">>> fruits.index('banana', 4) # Find next banana starting at position 4\n"
"6\n"
">>> fruits.reverse()\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange']\n"
">>> fruits.append('grape')\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange', 'grape']\n"
">>> fruits.sort()\n"
">>> fruits\n"
"['apple', 'apple', 'banana', 'banana', 'grape', 'kiwi', 'orange', 'pear']\n"
">>> fruits.pop()\n"
"'pear'"
msgstr ""
#: tutorial/datastructures.rst:122
msgid ""
"You might have noticed that methods like ``insert``, ``remove`` or ``sort`` "
"that only modify the list have no return value printed -- they return the "
"default ``None``. [#]_ This is a design principle for all mutable data "
"structures in Python."
msgstr ""
"Listeyi yalnzca deitiren ``insert``, ``remove`` veya ``sort`` gibi "
"yntemlerin hibir dn deeri yazdrmadn fark etmi olabilirsiniz -- "
"onlar varsaylan ``None`` deerini dndrrler. [#]_ Bu, Python'daki tm "
"deitirilebilir veri yaplar iin bir tasarm ilkesidir."
#: tutorial/datastructures.rst:127
#, fuzzy
msgid ""
"Another thing you might notice is that not all data can be sorted or "
"compared. For instance, ``[None, 'hello', 10]`` doesn't sort because "
"integers can't be compared to strings and ``None`` can't be compared to "
"other types. Also, there are some types that don't have a defined ordering "
"relation. For example, ``3+4j < 5+7j`` isn't a valid comparison."
msgstr ""
"Fark edebileceiniz bir baka ey de tm verilerin sralanamayaca veya "
"karlatrlamayacadr. rnein, ``[None, 'hello', 10]`` sralanamaz "
"nk tamsaylar dizelerle karlatrlamaz ve *None* dier trlerle "
"karlatrlamaz. Ayrca, tanmlanm bir sralama ilikisine sahip "
"olmayan baz trler de vardr. rnein, ``3+4j < 5+7j`` geerli bir "
"karlatrma deildir."
#: tutorial/datastructures.rst:138
msgid "Using Lists as Stacks"
msgstr "Listeleri Yn Olarak Kullanma"
#: tutorial/datastructures.rst:143
#, fuzzy
msgid ""
"The list methods make it very easy to use a list as a stack, where the last "
"element added is the first element retrieved (\"last-in, first-out\"). To "
"add an item to the top of the stack, use :meth:`~list.append`. To retrieve "
"an item from the top of the stack, use :meth:`~list.pop` without an explicit "
"index. For example::"
msgstr ""
"Liste yntemleri, bir listeyi, eklenen son enin alnan ilk e olduu bir "
"yn olarak kullanmay ok kolaylatrr (\"son giren ilk kar\"). "
"Ynn en stne bir e eklemek iin :meth:`append` kullann. Ynn en "
"stnden bir e almak iin, ak bir indeks olmadan :meth:`pop` kullann. "
"rnein::"
#: tutorial/datastructures.rst:148
msgid ""
">>> stack = [3, 4, 5]\n"
">>> stack.append(6)\n"
">>> stack.append(7)\n"
">>> stack\n"
"[3, 4, 5, 6, 7]\n"
">>> stack.pop()\n"
"7\n"
">>> stack\n"
"[3, 4, 5, 6]\n"
">>> stack.pop()\n"
"6\n"
">>> stack.pop()\n"
"5\n"
">>> stack\n"
"[3, 4]"
msgstr ""
#: tutorial/datastructures.rst:168
msgid "Using Lists as Queues"
msgstr "Listeleri Kuyruk Olarak Kullanma"
#: tutorial/datastructures.rst:172
msgid ""
"It is also possible to use a list as a queue, where the first element added "
"is the first element retrieved (\"first-in, first-out\"); however, lists are "
"not efficient for this purpose. While appends and pops from the end of list "
"are fast, doing inserts or pops from the beginning of a list is slow "
"(because all of the other elements have to be shifted by one)."
msgstr ""
"Bir listeyi, eklenen ilk elemann alnan ilk eleman olduu bir kuyruk olarak "
"kullanmak da mmkndr (\"ilk giren ilk kar\"); ancak listeler bu ama "
"iin verimli deildir. Listenin sonundan ekleme ve karma ilemleri "
"hzlyken, listenin bandan ekleme veya karma yapmak yavatr (nk "
"dier tm elerin bir adm kaydrlmas gerekir)."
#: tutorial/datastructures.rst:178
msgid ""
"To implement a queue, use :class:`collections.deque` which was designed to "
"have fast appends and pops from both ends. For example::"
msgstr ""
"Bir kuyruk uygulamak iin, her iki utan da hzl ekleme ve karma yapmak "
"zere tasarlanm :class:`collections.deque` kullann. rnein::"
#: tutorial/datastructures.rst:181
msgid ""
">>> from collections import deque\n"
">>> queue = deque([\"Eric\", \"John\", \"Michael\"])\n"
">>> queue.append(\"Terry\") # Terry arrives\n"
">>> queue.append(\"Graham\") # Graham arrives\n"
">>> queue.popleft() # The first to arrive now leaves\n"
"'Eric'\n"
">>> queue.popleft() # The second to arrive now leaves\n"
"'John'\n"
">>> queue # Remaining queue in order of arrival\n"
"deque(['Michael', 'Terry', 'Graham'])"
msgstr ""
#: tutorial/datastructures.rst:196
msgid "List Comprehensions"
msgstr "Liste Kavramalar"
#: tutorial/datastructures.rst:198
msgid ""
"List comprehensions provide a concise way to create lists. Common "
"applications are to make new lists where each element is the result of some "
"operations applied to each member of another sequence or iterable, or to "
"create a subsequence of those elements that satisfy a certain condition."
msgstr ""
"Liste kavramalar, listeler oluturmak iin ksa bir yol salar. Yaygn "
"uygulamalar, her bir enin baka bir dizinin veya yinelenebilir enin her "
"bir yesine uygulanan baz ilemlerin sonucu olduu yeni listeler oluturmak "
"veya belirli bir koulu karlayan elerin bir alt dizisini oluturmaktr."
#: tutorial/datastructures.rst:203
msgid "For example, assume we want to create a list of squares, like::"
msgstr ""
"rnein, aadaki gibi bir kareler listesi oluturmak istediimizi "
"varsayalm:"
#: tutorial/datastructures.rst:205
msgid ""
">>> squares = []\n"
">>> for x in range(10):\n"
"... squares.append(x**2)\n"
"...\n"
">>> squares\n"
"[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]"
msgstr ""
#: tutorial/datastructures.rst:212
msgid ""
"Note that this creates (or overwrites) a variable named ``x`` that still "
"exists after the loop completes. We can calculate the list of squares "
"without any side effects using::"
msgstr ""
"Bunun, ``x`` adnda bir deiken yarattna (veya zerine yazdna) ve bu "
"deikenin dng tamamlandktan sonra da var olduuna dikkat edin. Kareler "
"listesini, unu kullanarak herhangi bir yan etki olmadan hesaplayabiliriz:"
#: tutorial/datastructures.rst:216
msgid "squares = list(map(lambda x: x**2, range(10)))"
msgstr ""
#: tutorial/datastructures.rst:218
msgid "or, equivalently::"
msgstr "veya ayn ekilde::"
#: tutorial/datastructures.rst:220
msgid "squares = [x**2 for x in range(10)]"
msgstr ""
#: tutorial/datastructures.rst:222
msgid "which is more concise and readable."
msgstr "ki bu daha ksa ve okunakldr."
#: tutorial/datastructures.rst:224
msgid ""
"A list comprehension consists of brackets containing an expression followed "
"by a :keyword:`!for` clause, then zero or more :keyword:`!for` or :keyword:`!"
"if` clauses. The result will be a new list resulting from evaluating the "
"expression in the context of the :keyword:`!for` and :keyword:`!if` clauses "
"which follow it. For example, this listcomp combines the elements of two "
"lists if they are not equal::"
msgstr ""
"Bir liste kavray, bir ifade ieren parantezlerden ve ardndan bir :"
"keyword:`!for` cmlesinden, ardndan sfr veya daha fazla :keyword:`!for` "
"veya :keyword:`!if` cmlesinden oluur. Sonu, ifadenin kendisini takip "
"eden :keyword:`!for` ve :keyword:`!if` cmleleri balamnda "
"deerlendirilmesiyle elde edilen yeni bir liste olacaktr. rnein, "
"listcomp, eit deillerse iki listenin elerini birletirir::"
#: tutorial/datastructures.rst:231
msgid ""
">>> [(x, y) for x in [1,2,3] for y in [3,1,4] if x != y]\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
msgstr ""
#: tutorial/datastructures.rst:234
msgid "and it's equivalent to::"
msgstr "ve una e deerdir::"
#: tutorial/datastructures.rst:236
msgid ""
">>> combs = []\n"
">>> for x in [1,2,3]:\n"
"... for y in [3,1,4]:\n"
"... if x != y:\n"
"... combs.append((x, y))\n"
"...\n"
">>> combs\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
msgstr ""
#: tutorial/datastructures.rst:245
msgid ""
"Note how the order of the :keyword:`for` and :keyword:`if` statements is the "
"same in both these snippets."
msgstr ""
"Her iki kod paracnda da :keyword:`for` ve :keyword:`if` ifadelerinin "
"sralamasnn ayn olduuna dikkat edin."
#: tutorial/datastructures.rst:248
msgid ""
"If the expression is a tuple (e.g. the ``(x, y)`` in the previous example), "
"it must be parenthesized. ::"
msgstr ""
"Eer ifade bir veri grubu ise (rnein nceki rnekteki ``(x, y)``), "
"parantez iine alnmaldr. ::"
#: tutorial/datastructures.rst:251
msgid ""
">>> vec = [-4, -2, 0, 2, 4]\n"
">>> # create a new list with the values doubled\n"
">>> [x*2 for x in vec]\n"
"[-8, -4, 0, 4, 8]\n"
">>> # filter the list to exclude negative numbers\n"
">>> [x for x in vec if x >= 0]\n"
"[0, 2, 4]\n"
">>> # apply a function to all the elements\n"
">>> [abs(x) for x in vec]\n"
"[4, 2, 0, 2, 4]\n"
">>> # call a method on each element\n"
">>> freshfruit = [' banana', ' loganberry ', 'passion fruit ']\n"
">>> [weapon.strip() for weapon in freshfruit]\n"
"['banana', 'loganberry', 'passion fruit']\n"
">>> # create a list of 2-tuples like (number, square)\n"
">>> [(x, x**2) for x in range(6)]\n"
"[(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25)]\n"
">>> # the tuple must be parenthesized, otherwise an error is raised\n"
">>> [x, x**2 for x in range(6)]\n"
" File \"\", line 1\n"
" [x, x**2 for x in range(6)]\n"
" ^^^^^^^\n"
"SyntaxError: did you forget parentheses around the comprehension target?\n"
">>> # flatten a list using a listcomp with two 'for'\n"
">>> vec = [[1,2,3], [4,5,6], [7,8,9]]\n"
">>> [num for elem in vec for num in elem]\n"
"[1, 2, 3, 4, 5, 6, 7, 8, 9]"
msgstr ""
#: tutorial/datastructures.rst:279
msgid ""
"List comprehensions can contain complex expressions and nested functions::"
msgstr ""
"Liste kavramalar karmak ifadeler ve i ie gemi fonksiyonlar "
"ierebilir::"
#: tutorial/datastructures.rst:281
msgid ""
">>> from math import pi\n"
">>> [str(round(pi, i)) for i in range(1, 6)]\n"
"['3.1', '3.14', '3.142', '3.1416', '3.14159']"
msgstr ""
#: tutorial/datastructures.rst:286
msgid "Nested List Comprehensions"
msgstr " e Liste Kavramalar"
#: tutorial/datastructures.rst:288
msgid ""
"The initial expression in a list comprehension can be any arbitrary "
"expression, including another list comprehension."
msgstr ""
"Bir liste kavrayndaki ilk ifade, baka bir liste kavray da dahil olmak "
"zere rastgele herhangi bir ifade olabilir."
#: tutorial/datastructures.rst:291
msgid ""
"Consider the following example of a 3x4 matrix implemented as a list of 3 "
"lists of length 4::"
msgstr ""
"Uzunluu 4 olan 3 listeden oluan bir liste olarak uygulanan 3x4'lk bir "
"matrisin aadaki rneini dnn::"
#: tutorial/datastructures.rst:294
msgid ""
">>> matrix = [\n"
"... [1, 2, 3, 4],\n"
"... [5, 6, 7, 8],\n"
"... [9, 10, 11, 12],\n"
"... ]"
msgstr ""
#: tutorial/datastructures.rst:300
msgid "The following list comprehension will transpose rows and columns::"
msgstr "Aadaki liste kavramas satr ve stunlarn yerlerini deitirir::"
#: tutorial/datastructures.rst:302
msgid ""
">>> [[row[i] for row in matrix] for i in range(4)]\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
#: tutorial/datastructures.rst:305
msgid ""
"As we saw in the previous section, the inner list comprehension is evaluated "
"in the context of the :keyword:`for` that follows it, so this example is "
"equivalent to::"
msgstr ""
"nceki blmde grdmz gibi, i liste kavray, onu takip eden :keyword:"
"`for` balamnda deerlendirilir, bu nedenle bu rnek una e deerdir::"
#: tutorial/datastructures.rst:309
msgid ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... transposed.append([row[i] for row in matrix])\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
#: tutorial/datastructures.rst:316
msgid "which, in turn, is the same as::"
msgstr "ki bu da ununla ayndr::"
#: tutorial/datastructures.rst:318
msgid ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... # the following 3 lines implement the nested listcomp\n"
"... transposed_row = []\n"
"... for row in matrix:\n"
"... transposed_row.append(row[i])\n"
"... transposed.append(transposed_row)\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
#: tutorial/datastructures.rst:329
msgid ""
"In the real world, you should prefer built-in functions to complex flow "
"statements. The :func:`zip` function would do a great job for this use case::"
msgstr ""
"Gerek dnyada, karmak akl ifadeler yerine yerleik ilevleri tercih "
"etmelisiniz. Bu kullanm durumu iin :func:`zip` fonksiyonu harika bir i "
"karacaktr::"
#: tutorial/datastructures.rst:332
msgid ""
">>> list(zip(*matrix))\n"
"[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]"
msgstr ""
#: tutorial/datastructures.rst:335
msgid ""
"See :ref:`tut-unpacking-arguments` for details on the asterisk in this line."
msgstr ""
"Bu satrdaki yldz iaretiyle ilgili ayrntlar iin :ref:`tut-unpacking-"
"arguments` blmne bakn."
#: tutorial/datastructures.rst:340
msgid "The :keyword:`!del` statement"
msgstr ":keyword:`!del` ifadesi"
#: tutorial/datastructures.rst:342
#, fuzzy
msgid ""
"There is a way to remove an item from a list given its index instead of its "
"value: the :keyword:`del` statement. This differs from the :meth:`~list."
"pop` method which returns a value. The :keyword:`!del` statement can also "
"be used to remove slices from a list or clear the entire list (which we did "
"earlier by assignment of an empty list to the slice). For example::"
msgstr ""
"Deer yerine indeksi verilen bir eyi listeden kaldrmann bir yolu "
"vardr: :keyword:`del` ifadesi. Bu, bir deer dndren :meth:`pop` "
"ynteminden farkldr. :keyword:`!del` ifadesi ayrca bir listeden dilimleri "
"kaldrmak veya tm listeyi temizlemek iin de kullanlabilir (bunu daha nce "
"dilime bo bir liste atayarak yapmtk). rnein::"
#: tutorial/datastructures.rst:348
msgid ""
">>> a = [-1, 1, 66.25, 333, 333, 1234.5]\n"
">>> del a[0]\n"
">>> a\n"
"[1, 66.25, 333, 333, 1234.5]\n"
">>> del a[2:4]\n"
">>> a\n"
"[1, 66.25, 1234.5]\n"
">>> del a[:]\n"
">>> a\n"
"[]"
msgstr ""
#: tutorial/datastructures.rst:359
msgid ":keyword:`del` can also be used to delete entire variables::"
msgstr ":keyword:`del` deikenlerin tamamn silmek iin de kullanlabilir::"
#: tutorial/datastructures.rst:361
msgid ">>> del a"
msgstr ""
#: tutorial/datastructures.rst:363
msgid ""
"Referencing the name ``a`` hereafter is an error (at least until another "
"value is assigned to it). We'll find other uses for :keyword:`del` later."
msgstr ""
"Bundan sonra ``a`` ismine referans vermek bir hatadr (en azndan ona baka "
"bir deer atanana kadar). Daha sonra :keyword:`del` iin baka kullanmlar "
"bulacaz."
#: tutorial/datastructures.rst:370
msgid "Tuples and Sequences"
msgstr "Veri Gruplar ve Diziler"
#: tutorial/datastructures.rst:372
msgid ""
"We saw that lists and strings have many common properties, such as indexing "
"and slicing operations. They are two examples of *sequence* data types "
"(see :ref:`typesseq`). Since Python is an evolving language, other sequence "
"data types may be added. There is also another standard sequence data type: "
"the *tuple*."
msgstr ""
"Listelerin ve dizelerin indeksleme ve dilimleme ilemleri gibi birok ortak "
"zellie sahip olduunu grdk. Bunlar *dizi* veri tiplerinin iki rneidir "
"(bkz. :ref:`typesseq`). Python gelien bir dil olduu iin baka dizi veri "
"tipleri de eklenebilir. Ayrca baka bir standart dizi veri tipi daha "
"vardr: *tuple*."
#: tutorial/datastructures.rst:378
msgid ""
"A tuple consists of a number of values separated by commas, for instance::"
msgstr "Bir veri grubu, virglle ayrlm bir dizi deerden oluur, rnein::"
#: tutorial/datastructures.rst:380
msgid ""
">>> t = 12345, 54321, 'hello!'\n"
">>> t[0]\n"
"12345\n"
">>> t\n"
"(12345, 54321, 'hello!')\n"
">>> # Tuples may be nested:\n"
">>> u = t, (1, 2, 3, 4, 5)\n"
">>> u\n"
"((12345, 54321, 'hello!'), (1, 2, 3, 4, 5))\n"
">>> # Tuples are immutable:\n"
">>> t[0] = 88888\n"
"Traceback (most recent call last):\n"
" File \"\", line 1, in \n"
"TypeError: 'tuple' object does not support item assignment\n"
">>> # but they can contain mutable objects:\n"
">>> v = ([1, 2, 3], [3, 2, 1])\n"
">>> v\n"
"([1, 2, 3], [3, 2, 1])"
msgstr ""
#: tutorial/datastructures.rst:400
msgid ""
"As you see, on output tuples are always enclosed in parentheses, so that "
"nested tuples are interpreted correctly; they may be input with or without "
"surrounding parentheses, although often parentheses are necessary anyway (if "
"the tuple is part of a larger expression). It is not possible to assign to "
"the individual items of a tuple, however it is possible to create tuples "
"which contain mutable objects, such as lists."
msgstr ""
"Grdnz gibi, ktda veri gruplar her zaman parantez iine alnr, "
"bylece i ie gemi veri gruplar doru ekilde yorumlanr; parantezli "
"veya parantezsiz olarak girilebilirler, ancak genellikle parantezler "
"gereklidir (eer grup daha byk bir ifadenin parasysa). Bir veri "
"grubunun elerine tek tek atama yapmak mmkn deildir, ancak listeler gibi "
"deitirilebilir nesneler ieren veri gruplar oluturmak mmkndr."
#: tutorial/datastructures.rst:407
msgid ""
"Though tuples may seem similar to lists, they are often used in different "
"situations and for different purposes. Tuples are :term:`immutable`, and "
"usually contain a heterogeneous sequence of elements that are accessed via "
"unpacking (see later in this section) or indexing (or even by attribute in "
"the case of :func:`namedtuples `). Lists are :term:"
"`mutable`, and their elements are usually homogeneous and are accessed by "
"iterating over the list."
msgstr ""
"Veri gruplar listelere benzer grnse de, genellikle farkl durumlarda ve "
"farkl amalar iin kullanlrlar. Veri gruplar :term:`immutable` 'dr ve "
"genellikle paket ama (bu blmn ilerleyen ksmlarna baknz) veya "
"indeksleme (hatta :func:`namedtuples ` durumunda "
"znitelik ile) yoluyla eriilen heterojen bir dizi eleman ierir. Listeler :"
"term:`mutable` 'dr ve elemanlar genellikle homojendir ve listenin zerinde "
"yinelenerek eriilir."
#: tutorial/datastructures.rst:415
msgid ""
"A special problem is the construction of tuples containing 0 or 1 items: the "
"syntax has some extra quirks to accommodate these. Empty tuples are "
"constructed by an empty pair of parentheses; a tuple with one item is "
"constructed by following a value with a comma (it is not sufficient to "
"enclose a single value in parentheses). Ugly, but effective. For example::"
msgstr ""
"zel bir sorun, 0 veya 1 e ieren veri gruplarnn oluturulmasdr: sz "
"diziminin bunlar ile baa kan baz ekstra tuhaflklar vardr. Bo veri "
"gruplar bo bir parantez ifti ile oluturulur; bir eli bir veri grubu, "
"bir deeri virglle takip ederek oluturulur (tek bir deeri parantez iine "
"almak yeterli deildir). irkin olsa da etkilidir. rnein::"
#: tutorial/datastructures.rst:421
msgid ""
">>> empty = ()\n"
">>> singleton = 'hello', # >> len(empty)\n"
"0\n"
">>> len(singleton)\n"
"1\n"
">>> singleton\n"
"('hello',)"
msgstr ""
#: tutorial/datastructures.rst:430
msgid ""
"The statement ``t = 12345, 54321, 'hello!'`` is an example of *tuple "
"packing*: the values ``12345``, ``54321`` and ``'hello!'`` are packed "
"together in a tuple. The reverse operation is also possible::"
msgstr ""
"``t = 12345, 54321, hello!`` ifadesi bir *veri grubu paketleme* rneidir: "
"``12345``, ``54321`` ve ``'hello!'`` deerleri bir veri grubu iinde bir "
"araya getirilmitir. Bu ilemin tersi de mmkndr::"
#: tutorial/datastructures.rst:434
msgid ">>> x, y, z = t"
msgstr ""
#: tutorial/datastructures.rst:436
msgid ""
"This is called, appropriately enough, *sequence unpacking* and works for any "
"sequence on the right-hand side. Sequence unpacking requires that there are "
"as many variables on the left side of the equals sign as there are elements "
"in the sequence. Note that multiple assignment is really just a combination "
"of tuple packing and sequence unpacking."
msgstr ""
"Buna uygun bir ekilde *dizi ama (sequence unpacking)* denir ve sa "
"taraftaki herhangi bir dizi iin alr. Dizi ama, eittir iaretinin sol "
"tarafnda dizideki eleman says kadar deiken olmasn gerektirir. oklu "
"atamann aslnda tuple paketleme ve dizi amann bir kombinasyonu olduunu "
"unutmayn."
#: tutorial/datastructures.rst:446
msgid "Sets"
msgstr "Kmeler"
#: tutorial/datastructures.rst:448
msgid ""
"Python also includes a data type for *sets*. A set is an unordered "
"collection with no duplicate elements. Basic uses include membership "
"testing and eliminating duplicate entries. Set objects also support "
"mathematical operations like union, intersection, difference, and symmetric "
"difference."
msgstr ""
"Python ayrca *kmeler* iin bir veri tr ierir. Bir kme, yinelenen "
"eleri olmayan srasz bir koleksiyondur. Temel kullanmlar ierisinde "
"yelik testi ve yinelenen girdilerin elenmesi yer alr. Kme nesneleri "
"ayrca birleim, kesiim, fark ve simetrik fark gibi matematiksel ilemleri "
"de destekler."
#: tutorial/datastructures.rst:453
msgid ""
"Curly braces or the :func:`set` function can be used to create sets. Note: "
"to create an empty set you have to use ``set()``, not ``{}``; the latter "
"creates an empty dictionary, a data structure that we discuss in the next "
"section."
msgstr ""
"Kme oluturmak iin kme parantezleri veya :func:`set` fonksiyonu "
"kullanlabilir. Not: bo bir kme oluturmak iin ``{}`` deil ``set()`` "
"kullanmanz gerekir, nk birincisi bo bir szlk oluturur, ki bu da bir "
"sonraki blmde tartacamz bir veri yapsdr."
#: tutorial/datastructures.rst:457
msgid "Here is a brief demonstration::"
msgstr "te ksa bir gsterim::"
#: tutorial/datastructures.rst:459
msgid ""
">>> basket = {'apple', 'orange', 'apple', 'pear', 'orange', 'banana'}\n"
">>> print(basket) # show that duplicates have been "
"removed\n"
"{'orange', 'banana', 'pear', 'apple'}\n"
">>> 'orange' in basket # fast membership testing\n"
"True\n"
">>> 'crabgrass' in basket\n"
"False\n"
"\n"
">>> # Demonstrate set operations on unique letters from two words\n"
">>>\n"
">>> a = set('abracadabra')\n"
">>> b = set('alacazam')\n"
">>> a # unique letters in a\n"
"{'a', 'r', 'b', 'c', 'd'}\n"
">>> a - b # letters in a but not in b\n"
"{'r', 'd', 'b'}\n"
">>> a | b # letters in a or b or both\n"
"{'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}\n"
">>> a & b # letters in both a and b\n"
"{'a', 'c'}\n"
">>> a ^ b # letters in a or b but not both\n"
"{'r', 'd', 'b', 'm', 'z', 'l'}"
msgstr ""
#: tutorial/datastructures.rst:482
msgid ""
"Similarly to :ref:`list comprehensions `, set comprehensions "
"are also supported::"
msgstr ""
":ref:`liste kavramalar ` gibi kme kavramalar da "
"desteklenmektedir::"
#: tutorial/datastructures.rst:485
msgid ""
">>> a = {x for x in 'abracadabra' if x not in 'abc'}\n"
">>> a\n"
"{'r', 'd'}"
msgstr ""
#: tutorial/datastructures.rst:493
msgid "Dictionaries"
msgstr "Szlkler"
#: tutorial/datastructures.rst:495
#, fuzzy
msgid ""
"Another useful data type built into Python is the *dictionary* (see :ref:"
"`typesmapping`). Dictionaries are sometimes found in other languages as "
"\"associative memories\" or \"associative arrays\". Unlike sequences, which "
"are indexed by a range of numbers, dictionaries are indexed by *keys*, which "
"can be any immutable type; strings and numbers can always be keys. Tuples "
"can be used as keys if they contain only strings, numbers, or tuples; if a "
"tuple contains any mutable object either directly or indirectly, it cannot "
"be used as a key. You can't use lists as keys, since lists can be modified "
"in place using index assignments, slice assignments, or methods like :meth:"
"`~list.append` and :meth:`~list.extend`."
msgstr ""
"Python'da yerleik olarak bulunan bir baka kullanl veri tr de "
"*szlktr* (bkz :ref:`typesmapping`). Szlkler bazen dier dillerde "
"\"ilikisel bellekler\" veya \"ilikisel diziler\" olarak bulunur. Bir say "
"aral ile indekslenen dizilerin aksine, szlkler herhangi bir deimez "
"tip olabilen *anahtarlar* ile indekslenir, ki dizgiler ve saylar her zaman "
"birer anahtar olabilir. Veri gruplar yalnzca dizgi, say ya da veri grubu "
"ieriyorsa anahtar olarak kullanlabilir. Ancak bir veri grubu dorudan ya "
"da dolayl olarak deiebilir herhangi bir nesne ieriyorsa anahtar olarak "
"kullanlamaz. Listeler; dizin atamalar, dilim atamalar veya :meth:`append` "
"ve :meth:`extend` gibi yntemler kullanlarak yerinde deitirilebildiinden "
"listeleri anahtar olarak kullanamazsnz."
#: tutorial/datastructures.rst:506
msgid ""
"It is best to think of a dictionary as a set of *key: value* pairs, with the "
"requirement that the keys are unique (within one dictionary). A pair of "
"braces creates an empty dictionary: ``{}``. Placing a comma-separated list "
"of key:value pairs within the braces adds initial key:value pairs to the "
"dictionary; this is also the way dictionaries are written on output."
msgstr ""
"Bir szl *anahtar: deer* iftleri olarak dnmek en iyisidir. Bir "
"szlk ierisindeki her anahtarn benzersiz olmas gerektiini ise "
"unutmayn. Bir ift parantez bo bir szlk oluturur: ``{}``. Anahtar:deer "
"iftlerinin virglle ayrlm bir listesini parantezler iine yerletirmek "
"szle ilk anahtar:deer iftlerini ekler; szlkler ktda da ayn bu "
"ekilde grnrler."
#: tutorial/datastructures.rst:512
msgid ""
"The main operations on a dictionary are storing a value with some key and "
"extracting the value given the key. It is also possible to delete a key:"
"value pair with ``del``. If you store using a key that is already in use, "
"the old value associated with that key is forgotten. It is an error to "
"extract a value using a non-existent key."
msgstr ""
"Bir szlk zerindeki ana ilemler, bir deeri bir anahtarla depolamak ve "
"anahtar verilen deeri geri karmaktr. Ayrca ``del`` ile bir anahtar:"
"deer iftini silmek de mmkndr. Zaten bir deeri kullanmda olan bir "
"anahtar kullanarak saklarsanz, bu anahtarla ilikili eski deer unutulur. "
"Var olmayan bir anahtar kullanarak deer karmak bir hatadr."
#: tutorial/datastructures.rst:518
msgid ""
"Performing ``list(d)`` on a dictionary returns a list of all the keys used "
"in the dictionary, in insertion order (if you want it sorted, just use "
"``sorted(d)`` instead). To check whether a single key is in the dictionary, "
"use the :keyword:`in` keyword."
msgstr ""
"Bir szlk zerinde ``list(d)`` ilemini gerekletirmek, szlkte "
"kullanlan tm anahtarlarn bir listesini eklenme srasna gre dndrr "
"(baka bir dzenle sralanmasn istiyorsanz, bunun yerine ``sorted(d)`` "
"kullann). Tek bir anahtarn szlkte olup olmadn kontrol etmek iin :"
"keyword:`in` anahtar szcn kullann."
#: tutorial/datastructures.rst:523
msgid "Here is a small example using a dictionary::"
msgstr "te szlk kullanlan bir rnek::"
#: tutorial/datastructures.rst:525
msgid ""
">>> tel = {'jack': 4098, 'sape': 4139}\n"
">>> tel['guido'] = 4127\n"
">>> tel\n"
"{'jack': 4098, 'sape': 4139, 'guido': 4127}\n"
">>> tel['jack']\n"
"4098\n"
">>> del tel['sape']\n"
">>> tel['irv'] = 4127\n"
">>> tel\n"
"{'jack': 4098, 'guido': 4127, 'irv': 4127}\n"
">>> list(tel)\n"
"['jack', 'guido', 'irv']\n"
">>> sorted(tel)\n"
"['guido', 'irv', 'jack']\n"
">>> 'guido' in tel\n"
"True\n"
">>> 'jack' not in tel\n"
"False"
msgstr ""
#: tutorial/datastructures.rst:544
msgid ""
"The :func:`dict` constructor builds dictionaries directly from sequences of "
"key-value pairs::"
msgstr ""
":func:`dict` yapcs, dorudan anahtar-deer dizilerinden szlkler "
"oluturur::"
#: tutorial/datastructures.rst:547
msgid ""
">>> dict([('sape', 4139), ('guido', 4127), ('jack', 4098)])\n"
"{'sape': 4139, 'guido': 4127, 'jack': 4098}"
msgstr ""
#: tutorial/datastructures.rst:550
msgid ""
"In addition, dict comprehensions can be used to create dictionaries from "
"arbitrary key and value expressions::"
msgstr ""
"Buna ek olarak, szlk kavramalar rastgele anahtar ve deer ifadelerinden "
"szlkler oluturmak iin de kullanlabilir::"
#: tutorial/datastructures.rst:553
msgid ""
">>> {x: x**2 for x in (2, 4, 6)}\n"
"{2: 4, 4: 16, 6: 36}"
msgstr ""
#: tutorial/datastructures.rst:556
msgid ""
"When the keys are simple strings, it is sometimes easier to specify pairs "
"using keyword arguments::"
msgstr ""
"Anahtarlar basit dizgiler olduunda, anahtar szck argmanlarn kullanarak "
"iftleri belirtmek bazen daha kolaydr::"
#: tutorial/datastructures.rst:559
msgid ""
">>> dict(sape=4139, guido=4127, jack=4098)\n"
"{'sape': 4139, 'guido': 4127, 'jack': 4098}"
msgstr ""
#: tutorial/datastructures.rst:566
msgid "Looping Techniques"
msgstr "Dng Teknikleri"
#: tutorial/datastructures.rst:568
#, fuzzy
msgid ""
"When looping through dictionaries, the key and corresponding value can be "
"retrieved at the same time using the :meth:`~dict.items` method. ::"
msgstr ""
"Szlkler arasnda dng yaparken, :meth:`items` yntemi kullanlarak "
"anahtar ve karlk gelen deer ayn anda alnabilir. ::"
#: tutorial/datastructures.rst:571
msgid ""
">>> knights = {'gallahad': 'the pure', 'robin': 'the brave'}\n"
">>> for k, v in knights.items():\n"
"... print(k, v)\n"
"...\n"
"gallahad the pure\n"
"robin the brave"
msgstr ""
#: tutorial/datastructures.rst:578
msgid ""
"When looping through a sequence, the position index and corresponding value "
"can be retrieved at the same time using the :func:`enumerate` function. ::"
msgstr ""
"Bir dizi boyunca dng yaparken, :func:`enumerate` fonksiyonu kullanlarak "
"konum indeksi ve karlk gelen deer ayn anda alnabilir. ::"
#: tutorial/datastructures.rst:581
msgid ""
">>> for i, v in enumerate(['tic', 'tac', 'toe']):\n"
"... print(i, v)\n"
"...\n"
"0 tic\n"
"1 tac\n"
"2 toe"
msgstr ""
#: tutorial/datastructures.rst:588
msgid ""
"To loop over two or more sequences at the same time, the entries can be "
"paired with the :func:`zip` function. ::"
msgstr ""
"Ayn anda iki veya daha fazla dizi zerinde dng yapmak iin, girdiler :"
"func:`zip` fonksiyonu ile eletirilebilir. ::"
#: tutorial/datastructures.rst:591
msgid ""
">>> questions = ['name', 'quest', 'favorite color']\n"
">>> answers = ['lancelot', 'the holy grail', 'blue']\n"
">>> for q, a in zip(questions, answers):\n"
"... print('What is your {0}? It is {1}.'.format(q, a))\n"
"...\n"
"What is your name? It is lancelot.\n"
"What is your quest? It is the holy grail.\n"
"What is your favorite color? It is blue."
msgstr ""
#: tutorial/datastructures.rst:600
msgid ""
"To loop over a sequence in reverse, first specify the sequence in a forward "
"direction and then call the :func:`reversed` function. ::"
msgstr ""
"Bir dizi zerinde ters ynde dng yapmak iin, nce diziyi ileri ynde "
"belirtin ve ardndan :func:`reversed` fonksiyonunu arn. ::"
#: tutorial/datastructures.rst:603
msgid ""
">>> for i in reversed(range(1, 10, 2)):\n"
"... print(i)\n"
"...\n"
"9\n"
"7\n"
"5\n"
"3\n"
"1"
msgstr ""
#: tutorial/datastructures.rst:612
msgid ""
"To loop over a sequence in sorted order, use the :func:`sorted` function "
"which returns a new sorted list while leaving the source unaltered. ::"
msgstr ""
"Bir dizi zerinde sral olarak dng yapmak iin, listenin kaynan "
"deitirmeksizin yeni bir sral liste dndren :func:`sorted` fonksiyonunu "
"kullann. ::"
#: tutorial/datastructures.rst:615
msgid ""
">>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']\n"
">>> for i in sorted(basket):\n"
"... print(i)\n"
"...\n"
"apple\n"
"apple\n"
"banana\n"
"orange\n"
"orange\n"
"pear"
msgstr ""
#: tutorial/datastructures.rst:626
msgid ""
"Using :func:`set` on a sequence eliminates duplicate elements. The use of :"
"func:`sorted` in combination with :func:`set` over a sequence is an "
"idiomatic way to loop over unique elements of the sequence in sorted "
"order. ::"
msgstr ""
"Bir dizi zerinde :func:`set` kullanmak yinelenen eleri ortadan kaldrr. "
"Bir dizi zerinde :func:`set` ile birlikte :func:`sorted` kullanm, dizinin "
"benzersiz eleri zerinde sral olarak dng oluturmann deyimsel bir "
"yoludur. ::"
#: tutorial/datastructures.rst:630
msgid ""
">>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']\n"
">>> for f in sorted(set(basket)):\n"
"... print(f)\n"
"...\n"
"apple\n"
"banana\n"
"orange\n"
"pear"
msgstr ""
#: tutorial/datastructures.rst:639
msgid ""
"It is sometimes tempting to change a list while you are looping over it; "
"however, it is often simpler and safer to create a new list instead. ::"
msgstr ""
"Bazen bir liste zerinde dng yaparken deitirmek cazip gelebilir; ancak "
"bunun yerine yeni bir liste oluturmak genellikle daha basit ve daha "
"gvenlidir. ::"
#: tutorial/datastructures.rst:642
msgid ""
">>> import math\n"
">>> raw_data = [56.2, float('NaN'), 51.7, 55.3, 52.5, float('NaN'), 47.8]\n"
">>> filtered_data = []\n"
">>> for value in raw_data:\n"
"... if not math.isnan(value):\n"
"... filtered_data.append(value)\n"
"...\n"
">>> filtered_data\n"
"[56.2, 51.7, 55.3, 52.5, 47.8]"
msgstr ""
#: tutorial/datastructures.rst:656
msgid "More on Conditions"
msgstr "Koullar zerine"
#: tutorial/datastructures.rst:658
msgid ""
"The conditions used in ``while`` and ``if`` statements can contain any "
"operators, not just comparisons."
msgstr ""
"``while`` ve ``if`` deyimlerinde kullanlan koullar sadece karlatrma "
"deil, herhangi bir operatr ierebilir."
#: tutorial/datastructures.rst:662
msgid ""
"The comparison operators ``in`` and ``not in`` are membership tests that "
"determine whether a value is in (or not in) a container. The operators "
"``is`` and ``is not`` compare whether two objects are really the same "
"object. All comparison operators have the same priority, which is lower "
"than that of all numerical operators."
msgstr ""
"Karlatrma operatrleri ``in`` ve ``not in`` bir deerin bir dizide olup "
"olmadn kontrol eder. ``is`` ve ``is not`` operatrleri iki nesnenin "
"gerekten ayn nesne olup olmadn karlatrr. Tm karlatrma "
"operatrleri ayn ncelie sahiptir, bu ncelik ise tm saysal "
"operatrlerden daha dktr."
#: tutorial/datastructures.rst:668
msgid ""
"Comparisons can be chained. For example, ``a < b == c`` tests whether ``a`` "
"is less than ``b`` and moreover ``b`` equals ``c``."
msgstr ""
"Karlatrmalar art arda zincirlenebilir. rnein, ``a < b == c`` ifadesi "
"``a`` deerinin ``b`` deerinden kk olup olmadn test ederken ayn "
"zamanda ``b`` deerinin ``c`` deerine eit olup olmadn test eder."
#: tutorial/datastructures.rst:671
msgid ""
"Comparisons may be combined using the Boolean operators ``and`` and ``or``, "
"and the outcome of a comparison (or of any other Boolean expression) may be "
"negated with ``not``. These have lower priorities than comparison "
"operators; between them, ``not`` has the highest priority and ``or`` the "
"lowest, so that ``A and not B or C`` is equivalent to ``(A and (not B)) or "
"C``. As always, parentheses can be used to express the desired composition."
msgstr ""
"Karlatrmalar ``and`` ve ``or`` Boolean operatrleri kullanlarak "
"birletirilebilir ve bir karlatrmann (veya baka bir Boolean "
"ifadesinin) sonucu ``not`` ile olumsuzlanabilir. Bunlar karlatrma "
"operatrlerinden daha dk nceliklere sahiptir; aralarnda, ``not`` en "
"yksek ncelie ve ``or`` en dk ncelie sahiptir, bylece ``A ve B deil "
"veya C``, ``(A ve (B deil)) veya C`` ile e deerdir. Her zaman olduu "
"gibi, istenen bileimi ifade etmek iin parantezler kullanlabilir."
#: tutorial/datastructures.rst:678
msgid ""
"The Boolean operators ``and`` and ``or`` are so-called *short-circuit* "
"operators: their arguments are evaluated from left to right, and evaluation "
"stops as soon as the outcome is determined. For example, if ``A`` and ``C`` "
"are true but ``B`` is false, ``A and B and C`` does not evaluate the "
"expression ``C``. When used as a general value and not as a Boolean, the "
"return value of a short-circuit operator is the last evaluated argument."
msgstr ""
"Boolean operatrleri ``and`` ve ``or`` *ksa devre* operatrleri olarak "
"adlandrlr: argmanlar soldan saa doru deerlendirilir ve sonu "
"belirlenir belirlenmez deerlendirme durur. rnein, ``A`` ve ``C`` doru "
"ancak ``B`` yanl ise, ``A ve B ve C`` ``C`` ifadesini deerlendirmez. "
"Boolean olarak deil de genel bir deer olarak kullanldnda, ksa devre "
"ilecinin dn deeri son deerlendirilen bamsz deikendir."
#: tutorial/datastructures.rst:685
msgid ""
"It is possible to assign the result of a comparison or other Boolean "
"expression to a variable. For example, ::"
msgstr ""
"Bir deikene, bir karlatrmann sonucunu veya baka bir Boolean "
"ifadesini atamak mmkndr. rnein::"
#: tutorial/datastructures.rst:688
msgid ""
">>> string1, string2, string3 = '', 'Trondheim', 'Hammer Dance'\n"
">>> non_null = string1 or string2 or string3\n"
">>> non_null\n"
"'Trondheim'"
msgstr ""
#: tutorial/datastructures.rst:693
msgid ""
"Note that in Python, unlike C, assignment inside expressions must be done "
"explicitly with the :ref:`walrus operator ` ``:=``. This avoids a common class of problems encountered "
"in C programs: typing ``=`` in an expression when ``==`` was intended."
msgstr ""
"Python'da, C'den farkl olarak, ifadelerin iindeki atamann :ref:`walrus "
"operatr ` ``=`` ile aka "
"yaplmas gerektiini unutmayn. Bu, C programlarnda karlalan yaygn "
"bir sorunu nler: ``==`` yazmak isterken ``=`` yazmak."
#: tutorial/datastructures.rst:703
msgid "Comparing Sequences and Other Types"
msgstr "Diziler ile Dier Veri Tiplerinin Karlatrlmas"
#: tutorial/datastructures.rst:704
msgid ""
"Sequence objects typically may be compared to other objects with the same "
"sequence type. The comparison uses *lexicographical* ordering: first the "
"first two items are compared, and if they differ this determines the outcome "
"of the comparison; if they are equal, the next two items are compared, and "
"so on, until either sequence is exhausted. If two items to be compared are "
"themselves sequences of the same type, the lexicographical comparison is "
"carried out recursively. If all items of two sequences compare equal, the "
"sequences are considered equal. If one sequence is an initial sub-sequence "
"of the other, the shorter sequence is the smaller (lesser) one. "
"Lexicographical ordering for strings uses the Unicode code point number to "
"order individual characters. Some examples of comparisons between sequences "
"of the same type::"
msgstr ""
"Dizi nesneleri tipik olarak ayn dizi trne sahip dier nesnelerle "
"karlatrlabilir. Karlatrmada *szlksel* sralama kullanlr: nce "
"ilk iki e karlatrlr ve farkllarsa bu karlatrmann sonucunu "
"belirler; eitlerse, sonraki iki e karlatrlr ve her iki dizi de "
"tkenene kadar byle devam eder. Karlatrlacak iki enin kendileri de "
"ayn trden diziler ise, szlkbilimsel karlatrma zyinelemeli olarak "
"gerekletirilir. ki dizinin tm eleri eit karsa, diziler eit kabul "
"edilir. Eer dizilerden biri dierinin alt dizisi ise, daha ksa olan dizi "
"daha kk (kk) olandr. Dizgiler iin szlkbilimsel sralama, tek tek "
"karakterleri sralamak iin Unicode kod noktas numarasn kullanr. Ayn "
"trdeki diziler arasndaki karlatrmalara baz rnekler::"
#: tutorial/datastructures.rst:716
msgid ""
"(1, 2, 3) < (1, 2, 4)\n"
"[1, 2, 3] < [1, 2, 4]\n"
"'ABC' < 'C' < 'Pascal' < 'Python'\n"
"(1, 2, 3, 4) < (1, 2, 4)\n"
"(1, 2) < (1, 2, -1)\n"
"(1, 2, 3) == (1.0, 2.0, 3.0)\n"
"(1, 2, ('aa', 'ab')) < (1, 2, ('abc', 'a'), 4)"
msgstr ""
#: tutorial/datastructures.rst:724
msgid ""
"Note that comparing objects of different types with ```` is legal "
"provided that the objects have appropriate comparison methods. For example, "
"mixed numeric types are compared according to their numeric value, so 0 "
"equals 0.0, etc. Otherwise, rather than providing an arbitrary ordering, "
"the interpreter will raise a :exc:`TypeError` exception."
msgstr ""
"Nesnelerin uygun karlatrma yntemlerine sahip olmas kouluyla, farkl "
"trlerdeki nesnelerin ```` ile karlatrlabileceini "
"unutmayn. rnein, kark saysal trler saysal deerlerine gre "
"karlatrlr, bu nedenle 0 eittir 0.0, vb. Bu trler uygun yntemlere "
"sahip deillerse, yorumlayc rastgele bir sralama dndrmek yerine :exc:"
"`TypeError` hatas verir."
#: tutorial/datastructures.rst:732
msgid "Footnotes"
msgstr "Dipnotlar"
#: tutorial/datastructures.rst:733
msgid ""
"Other languages may return the mutated object, which allows method chaining, "
"such as ``d->insert(\"a\")->remove(\"b\")->sort();``."
msgstr ""
"Dier diller, ``d->insert(\"a\")->remove(\"b\")->sort();`` gibi yntem "
"zincirlemesine izin veren deitirilmi nesneyi dndrebilir."