2003 Sarasota Clay Court Classic – Doubles
Jelena Dokić and Elena Likhovtseva were the defending champions, but Likhovtseva chose not to compete in 2003. Dokić played with Nadia Petrova, but lost in the quarterfinals.
Doubles | |
---|---|
2003 Sarasota Clay Court Classic | |
Champion | ![]() ![]() |
Runner-up | ![]() ![]() |
Final score | 7–6(10–8), 6–3 |
Liezel Huber and Martina Navratilova won the title.[1][2][3]
Results
Seeds
Jelena Dokić / Nadia Petrova (quarterfinals) Liezel Huber / Martina Navratilova (champions) Barbara Schett / Patty Schnyder (semifinals) Els Callens / Émilie Loit (semifinals)
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Draw
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() ![]() | 3 | 1 | 1 | ![]() ![]() | |||||||||||||||||||||||
![]() ![]() | 2 | 4 | ![]() ![]() | w/o | |||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 7 | 2 | 6 | |||||||||||||||||||||
3 | ![]() ![]() | 4 | 6 | 7 | 3 | ![]() ![]() | 5 | 6 | 4 | ||||||||||||||||||
WC | ![]() ![]() | 6 | 1 | 5 | 3 | ![]() ![]() | 7 | 1 | 6 | ||||||||||||||||||
![]() ![]() | 4 | 6 | 4 | ![]() ![]() | 65 | 6 | 1 | ||||||||||||||||||||
![]() ![]() | 6 | 1 | 6 | ![]() ![]() | 68 | 3 | |||||||||||||||||||||
![]() ![]() | 6 | 4 | 6 | 2 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||
![]() ![]() | 1 | 6 | 3 | ![]() ![]() | 4 | 4 | |||||||||||||||||||||
WC | ![]() ![]() | 0 | 3 | 4 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
4 | ![]() ![]() | 6 | 6 | 4 | ![]() ![]() | 1 | 7 | 62 | |||||||||||||||||||
![]() ![]() | 2 | 6 | 7 | 2 | ![]() ![]() | 6 | 63 | 7 | |||||||||||||||||||
![]() ![]() | 6 | 4 | 66 | ![]() ![]() | 6 | 2 | 2 | ||||||||||||||||||||
Q | ![]() ![]() | 6 | 1 | 5 | 2 | ![]() ![]() | 3 | 6 | 6 | ||||||||||||||||||
2 | ![]() ![]() | 1 | 6 | 7 |
gollark: I mean, on my end, I dislike perl æsthetically, and think it is overreliant on string manipulation and weird regexes.
gollark: And there apparently are, because some bits of the grammar depend on information available only at runtime.
gollark: Well, yes, but if there are instances of unparseable code that makes the language unparseable.
gollark: I read that parsing Perl was equivalent to solving the halting problem.
gollark: I prefer languages which are actually parseable.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.