2009 Banka Koper Slovenia Open – Doubles
Anabel Medina Garrigues and Virginia Ruano Pascual were the defending champions, but both chose not to participate that year.
Doubles | |
---|---|
2009 Banka Koper Slovenia Open | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 6–4, 6–2 |
Julia Görges and Vladimíra Uhlířová won in the final, 6–4, 6–2, against Camille Pin and Klára Zakopalová.
Seeds
Vera Dushevina / Galina Voskoboeva (Quarterfinals) Eva Hrdinová / Renata Voráčová (First Round) Julia Görges / Vladimíra Uhlířová (Champions) Kristina Barrois / Tathiana Garbin (First Round)
Draw
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 | ||||||||||||||||||||||||
![]() ![]() | 4 | 2 | 1 | ![]() ![]() | 7 | 4 | [6] | ||||||||||||||||||||
ALT | ![]() ![]() | 6 | ALT | ![]() ![]() | 5 | 6 | 10 | ||||||||||||||||||||
WC | ![]() ![]() | 2 | r | ALT | ![]() ![]() | 1 | 3 | ||||||||||||||||||||
4 | ![]() ![]() | 4 | 6 | [7] | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 1 | [10] | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 4 | [9] | ![]() ![]() | 1 | 4 | |||||||||||||||||||||
![]() ![]() | 4 | 6 | [11] | ![]() ![]() | 4 | 2 | |||||||||||||||||||||
![]() ![]() | 0 | 5 | 3 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 7 | ![]() ![]() | 4 | 3 | ||||||||||||||||||||||
![]() ![]() | 4 | 7 | [3] | 3 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
3 | ![]() ![]() | 6 | 64 | [10] | 3 | ![]() ![]() | 4 | 6 | [10] | ||||||||||||||||||
![]() ![]() | 7 | 1 | [10] | ![]() ![]() | 6 | 4 | 3 | ||||||||||||||||||||
![]() ![]() | 66 | 6 | [6] | ![]() ![]() | 7 | 3 | [1] | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 62 | 6 | [10] | |||||||||||||||||||||
2 | ![]() ![]() | 3 | 3 |
gollark: Oh no.
gollark: This isn't very useful. Sorting is generally quite fast.
gollark: Maybe you could use a computationally hard problem like prime factoring somehow.
gollark: It would probably take significant effort to actually construct something satisfying this.
gollark: I think Dan wants incomprehensible to mortals but the answer is exactly 1.
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.