11.1.2 Data Types
2 Tipurile de date
Python provides many built-in data types. We
describe three of the most useful
data types here: lists, strings, and dictionaries.
Lists. Python provides a list datatype similar to
lists in Scheme, except instead
of building lists from simpler parts (that is,
using cons pairs in Scheme), the
Python list type is a built-in datatype. The other
important difference is that
Python lists are mutable like mlist from Section
9.3.
Lists are denoted in Python using square
brackets. For example, [] denotes an
empty list and [1, 2] denotes a list containing
two elements. The elements in a
list can be of any type (including other lists).
Elements can be selected from a list using the
list subscript expression:
PrimaryExpression :: SubscriptExpression
SubscriptExpression :: PrimaryExpression [
Expression ]
A subscript expression evaluates to the element
indexed by value of the inner
expression from the list. For example,
a = [1, 2, 3]
a[0] 1
a[1+1] 3
a[3] IndexError: list index out of range
The expression p[0] in Python is analogous to
(car p) in Scheme.
The subscript expression has constant running
time; unlike indexing Scheme
lists, the time required does not depend on the
length of the list even if the selection
index is the end of the list. The reason for this is
that Python stores lists
internally differently from how Scheme stores
as chains of pairs. The elements
of a Python list are stored as a block in
memory, so the location of the k
th element
can be calculated directly by adding k times the
size of one element to the
location of the start of the list.
A subscript expression can also select a range
of elements from the list:
SubscriptExpression :: PrimaryExpression [
BoundLow : BoundHigh ]
Bound :: Expression | e
Subscript expressions with ranges evaluate to a
list containing the elements between
11.1.
Python ofera multe tipuri de date incorporate. Noi
descriem trei din cele mai folosite tipuri de date:
listele, siruri de caractere, si dictionarele.
Listele. Python ofera o lista de date similara cu
listele din Scheme, cu exceptia locului de
construire a listelor din partile mai simple (care
este, utilizarea cons perechi in scheme), tipul listei
Pyton este tipul de date incorporat. O alta
diferenta importanta is ca listele Phyton sunt
mutabile ca lista de la Sectie.
9.3.
Listele sunt notate in Python utilizand paranteze
patrate. De exemplu, [] noteaza o lista goala, dar
[1,2] noteaza o lista care contine doua elemnte.
Elementele dintr-o lista pot fi de orice tip
(incluzand o alta lista). Elementele pot fi selectate
dintr-o lista utilizand lista expresie inscrisa:
ExpreisaPrimara::ExpresieInscrisa
ExpresieInscrisa::ExpresiePrimara[Expresie]
O expresie inscrisa evalueaza la elementul
indexat de valoarea expreisei interioare din
lista. De exemplu,
a = [1, 2, 3]
a[0] 1
a[1+1] 3
a[3] EroareDeIndex: lista indice in afara
domeniului
Expresia p[0] in Python este analogica cu (car p) in
Scheme.
Expreisa inscrisa are timp constant de executare;
spre deosebire de listele Scheme de indexare,
timpul necesarnu depinde de lungimea listei, nici
de selectia indexarii la sfarsitul listei. Motivul
pentru aceasta este ca Python stocheaza listele
diferit fata de modul in care Scheme stocheaza
lanturi de perechi. Elementele unei liste Python
sunt stocate ca un bloc de memorie , deci locatia
elementului k poate fi calculata direct prin
adaugarea de k ori marimea unui element din lista.
O expresie inscrisa de asemenea poate selecta
sirul de elemente dintr-o lista:
ExpresieInscrisa::ExpresiePrimara
[ObligatieScazuta:ObligatieRidicata]
Obligatie :: Expreisa | e
Expresiile inscrise cu siruri evaluate in o lista
cotin elemente intre obligatia scazuta si
obligatia ridicata. Daca obligata scazuta lipseste,
obligatia scazuta este inceputul listei. Daca
obligatia ridicata lipseste, obligatia ridicata este
sfarsitul listei. De exemplu,
a=[1,2,3]
the low bound and the high bound. If the low
bound is missing, the low
bound is the beginning of the list. If the high
bound is missing, the high bound
is the end of the list. For example,
a = [1, 2, 3]
a[:1] [1]
a[1:] [2, 3]
a[42:3] [3]
a[:] [1, 2, 3]
The expression p[1:] in Python is analogous to
(cdr p) in Scheme.
Python lists are mutable (the value of a list can
change after it is created). We
can use list subscripts as the targets for an
assignment expression:
Target :: SubscriptExpression
Assignments using ranges as targets can add
elements to the list as well as changing
the values of existing elements:
a = [1, 2, 3]
a[0] = 7
a [7, 2, 3]
a[1:4] = [4, 5, 6]
a [7, 4, 5, 6]
a[1:] = [6]
a [7, 6]
In the tokenize procedure, we use tokens = [] to
initialize tokens to an empty list,
and use tokens.append(current) to append an
element to the tokens list. The
Python append procedure is similar to the
mlist-append! procedure (except it
works on the empty list, where there is no way
in Scheme to modify the null
input list).
Strings. The other datatype used in tokenize is
the string datatype, named str
in Python. As in Scheme, a String is a sequence
of characters. Unlike Scheme strings which are
mutable, the Python str datatype is immutable.
Once a string
is created its value cannot change. This means
all the string methods that seem
to change the string values actually return new
strings (for example, capitalize()
returns a copy of the string with its first letter
capitalized).
Strings can be enclosed in single quotes (e.g.,
'hello'), double quotes (e.g., ''hello''),
and triple-double quotes (e.g., '' '' ''hello'' '' ''; a
string inside triple quotes can span
a[:1] [1]
a[1:] [2, 3]
a[42:3] [3]
a[:] [1, 2, 3]
Expreisa p[1:] in Python este analogic cu (cdr p) in
Scheme.
Listele Python sunt mutabile(voloare listei poate fi
schimbata dupa ce a fost creata). Noi putem utiliza
listele inscrise ca tinte pentru o expreie de
atribuire:
Tinta :: ExrpesieInscrisa
Atribuirile ce utilizeaza sirurile ca tinte pot
aduga elemente in lista precum si schimba
valoarea elementelor existente:
a = [1, 2, 3]
a[0] = 7
a [7, 2, 3]
a[1:4] = [4, 5, 6]
a [7, 4, 5, 6]
a[1:] = [6]
a [7, 6]
In tokenizarea procedurii, noi utilizam
tokens(jetoane)=[] pentru initializarea jetoanelor
intr-o lista goala, mai utilizam
adaugarea,jetoanelor(actual) pentru a adauga un
element in lista jetoanelor. Adaugarea procedurii
in Python, este similara cu procedrii adaugare-
mlist!(cu excepria cazului cand lucreaza pe lista
goala unde nu exista nici o modalite de a modifica
lista de intrare nula in Scheme).
Siruri de caractere. Alt tip de date utilizat in
tokenizare tipul de datesiruri de caractere,
numit str in Python. Ca in Scheme sirurile de
caractere sunt o secventa de caractere. Spre
deosebire de Scheme, sirurile de caracte care sunt
mutabile, tipurile de date str sunt imuabile in
Python. Ca si in Scheme, un sir de caractere este o
segventa de caractere. Spre deosebire de Scheme,
sirurile de caractere care sunt mutabile, tipurile de
date str sunt imuabile in Python.
Odata ce sirul de caractere a fost creat noi nu mai
putem sa-i schimbam valoarea. Asta inseamna ca
toate metodele sirurilor de caractere care ar parea
ca schimba valoarea sirului de caractere defapt
returneaza siruri noi (de exemplu,
valorifica()returneaza o copie a sirului de caractere
cu primul caracter valorificat).
Sirul poate fi inclus in o singura citata(eg. Salut),
citate duble(eg,salut),si citate duble
triple(eg,salut un sir in citatele duble
triple poate deschide linii multiple). In programul
nostru exemplu, noi utilizam expresia atribuire,
multiple lines). In our example program, we use
the assignment expression,
current = ' ' (two single quotes), to initialize the
value of current to the empty
string. The input, s, is a string object.
The addition operator can be used to
concatenate two strings. In tokenize, we
use current = current + c to update the value of
current to include a new character.
Since strings are immutable there is no string
method analogous to the list
append method. Instead, appending a
character to a string involves creating a
new string object.
Dictionaries. A dictionary is a lookup-table
where values are associated with
keys. The keys can be any immutable type
(strings and numbers are commonly
used as keys); the values can be of any type.
We did not use the dictionary type
in tokenize, but it is very useful for
implementing frames in the evaluator.
A dictionary is denoted using curly brackets.
The empty dictionary is {}. We
add a key-value pair to the dictionary using an
assignment where the left side
is a subscript expression that specifies the key
and the right side is the value
assigned to that key. For example,
birthyear = {}
birthyear['Euclid'] = '300BC'
birthyear['Ada'] = 1815
birthyear['Alan Turing'] = 1912
birthyear['Alan Kay'] = 1940
defines birthyear as a dictionary containing four
entries. The keys are all strings;
the values are numbers, except for Euclids
entry which is a string.
We can obtain the value associated with a key
in the dictionary using a subscript
expression. For example, birthyear['Alan
Turing'] evaluates to 1912. We can
replace the value associated with a key using
the same syntax as adding a keyvalue
pair to the dictionary. The statement,
birthyear['Euclid'] = 300
replaces the value of birthyear['Euclid'] with
the number 300.
The dictionary type also provides a method has
key that takes one input and
produces a Boolean indicating if the dictionary
object contains the input value
curent= (doua citate singure), pentru a initializa
valoarea curentului la sirul gol. Intrarea, s, este un
obiect sir. Adaugarea operatorului poate fi utilizata
pentru concatenarea a doua siruri de caractere. In
tokenizare, noi utilizam curent=curent +c pentru a
actualiza valoarea curentului pentru a include un
caracter nou.
De cand sirurile sunt imuabile nu exista o metoda
de sir analogica metodei de adaugare a listei. In
schimb, adaugarea unui caracter in sir implica
crearea unui obiect sir nou.
Dictionarele. Un dictionar este o lista de cautare
unde valorile sunt associate cu chei. Cheile pot fi
de orice tip imuabil(sirurile si numerele in mod
obisnuit sunt utilizate ca chei); valorile pot fi de
orice tip. Nu folosim dictionarul de tip tokenizare,
dar este foarte util pentru implementarea cadrelor
in evaluator. Un dictionar este notat folosind {}.
Noi adaugam valoarea cheie la dictionar utilizand o
atribuire unde partea stanga este o expresie
inscrisa care specifica cheia si in partea dreapta
este valoarea atribuita pentru acea cheie. De
exemplu,
Anulnasterii = {}
Anulnasterii ['Euclid'] = '300BC'
Anulnasterii ['Ada'] = 1815
Anulnasterii ['Alan Turing'] = 1912
Anulnasterii ['Alan Kay'] = 1940
Defineste anul nasterii ca un dictionare ce contine
patru intrari. Cheile sunt siruri;valorile sunt
numere,cu exceptia intrarii lui Elucid, care este sir.
Noi putem obtine valoare asociata cu o cheie in
dictionar utilizand in expresie inscrisa. De exemplu,
anul nasterii[Alan Turing] evalueaza in 1912. Noi
putem inlocui valoarea asociata cu o cheie
utilizand aceeasi sintaxa ca adaugare a perechii
valori cheie la dictionar. Expresia
anulnasterii['Euclid'] = 300 inlocueste valoarea
anului nasterii [Elucid]cu numarul -300.
Tipul dictionarului de acemenea contine o cheie cu
o metodacare are o intrare si o produce un
Boolean care indica daca obiectul dictionar contine
valoarea de intrare ca cheie. Pentru dictionarul
anul nasterii,
anul nasterii.are cheie(John Backus) Fals
anul nasterii.are cheie ('Ada') Adevarat
Tipul dictionarului de cautare si actualizarea
operatiilor au aproximativ executare constanta:
timpul necesarpentru cautarea valorii asociative
unei chei nu este scalata, deoarece marimea
dictionarului creste. Aceasta se face prin calcularea
unui numar pe baza cheii care determina unde va
as a key. For the birthyear dictionary, fi stocata valoarea asociata(daca aceasta cheie
birthyear.has key('John Backus') False este in dictionar). Numarul este utilizat pentru
birthyear.has key('Ada') True indexarea in o lista Python(deci are un timp
The dictionary type lookup and update constant pentru recuperarea oricarui element).
operations have approximately constant Maparea tastelor la numerele
running time: the time it takes to lookup the corespunzatoarepentru a evita cartografierea mui
value associated with a key does not scale as multor chei la aceeasi locatie este o problema
the size of the dictionary increases. This is done dificila, dar un dictionar Python se descurca bine
by computing a number pentru majoritatea seturilor de chei.
based on the key that determines where the
associated value would be stored (if
that key is in the dictionary). The number is
used to index into a structure similar
to a Python list (so it has constant time to
retrieve any element). Mapping keys
to appropriate numbers to avoid many keys
mapping to the same location in
the list is a difficult problem, but one the
Python dictionary object does well for
most sets of keys.