2011 The Bahamas Women's Open – Doubles
It was the first edition of the tournament.
Natalie Grandin and Vladimíra Uhlířová won in the final against Raquel Kops-Jones and Abigail Spears 6–4, 6–2.
Doubles | |
---|---|
2011 The Bahamas Women's Open | |
Champions | |
Runners-up | |
Final score | 6–4, 6–2 |
Seeds
Natalie Grandin / Vladimíra Uhlířová (Champions) Edina Gallovits-Hall / Monica Niculescu (Semifinals) Raquel Kops-Jones / Abigail Spears (Final) Andrea Hlaváčková / Magdaléna Rybáriková (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 | Finals | ||||||||||||||||||||||||
1 | 6 | 6 | |||||||||||||||||||||||||
4 | 2 | 1 | 6 | 6 | |||||||||||||||||||||||
6 | 1 | [2] | 2 | 3 | |||||||||||||||||||||||
2 | 6 | [10] | 1 | 6 | 7 | ||||||||||||||||||||||
4 | 6 | 5 | [8] | Alt | 1 | 64 | |||||||||||||||||||||
Alt | 4 | 7 | [10] | Alt | 6 | 6 | |||||||||||||||||||||
4 | 6 | [11] | 1 | 3 | |||||||||||||||||||||||
WC | 6 | 4 | [9] | 1 | 6 | 6 | |||||||||||||||||||||
6 | 6 | 3 | 4 | 2 | |||||||||||||||||||||||
4 | 4 | 5 | 4 | ||||||||||||||||||||||||
65 | 6 | [4] | 3 | 7 | 6 | ||||||||||||||||||||||
3 | 7 | 2 | [10] | 3 | 7 | 6 | |||||||||||||||||||||
3 | 5 | 2 | 62 | 4 | |||||||||||||||||||||||
6 | 7 | 1 | 3 | ||||||||||||||||||||||||
2 | 4 | 2 | 6 | 6 | |||||||||||||||||||||||
2 | 6 | 6 |
gollark: If you want to define an infinitely recursive data structure, just make an infinitely recursive function.
gollark: Thanks to lazy evaluation, anything can be infinite!
gollark: *infinite lists
gollark: You could also implement it for, say, trees, though.
gollark: That's specifically for lists though.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.