2002 Copa Colsanitas – Doubles
Tathiana Garbin and Janette Husárová were the defending champions but none competed this year, as both players decided to play in Dubai at the same week.
Doubles | |
---|---|
2002 Copa Colsanitas | |
Champions | |
Runners-up | |
Final score | 6–2, 6–1 |
Draw | 16 (1WC/1Q/1LL) |
Seeds | 4 |
Virginia Ruano Pascual and Paola Suárez won the title by defeating Tina Križan and Katarina Srebotnik 6–2, 6–1 in the final.
Seeds
Virginia Ruano Pascual / Paola Suárez (Champions) Tina Križan / Katarina Srebotnik (Final) Laura Montalvo / María Emilia Salerni (Semifinals, retired) Lourdes Domínguez Lino / Émilie Loit (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 | 5 | 6 | ||||||||||||||||||||||||
4 | 7 | 3 | 1 | 6 | 6 | ||||||||||||||||||||||
7 | 6 | 3 | 4 | ||||||||||||||||||||||||
Q | 5 | 1 | 1 | 6 | 6 | ||||||||||||||||||||||
4 | 6 | 2 | 0 | 1 | 2 | ||||||||||||||||||||||
1 | 6 | 6 | 3 | 6 | 3 | ||||||||||||||||||||||
6 | 2 | 6 | 6 | 2 | 6 | ||||||||||||||||||||||
3 | 6 | 2 | 1 | 6 | 6 | ||||||||||||||||||||||
WC | 7 | 77 | 2 | 2 | 1 | ||||||||||||||||||||||
LL | 5 | 63 | WC | 65 | 3 | ||||||||||||||||||||||
6 | 1 | 1 | 3 | 77 | 6 | ||||||||||||||||||||||
3 | 4 | 6 | 6 | 3 | 7 | 2r | |||||||||||||||||||||
6 | 6 | 2 | 5 | 1 | |||||||||||||||||||||||
4 | 2 | 3 | 0 | ||||||||||||||||||||||||
0 | 1 | 2 | 6 | 6 | |||||||||||||||||||||||
2 | 6 | 6 |
Qualifying
Seeds
Maria Elena Camerin / Giulia Casoni (Qualified) Stephanie Schaer / Galina Voskoboeva (First round)
Qualifiers
Lucky Losers
Qualifying Draw
First Round | Qualifying Competition | |||||||||
1 | |
8 | ||||||||
WC | |
4 | ||||||||
1 | |
6 | 4 | 6 | ||||||
|
3 | 6 | 4 | |||||||
|
8 | |||||||||
2 | |
4 |
gollark: Oh. Hmm. It isn't 32 bits of output.
gollark: The entire hash is a few tens of arithmetic operations in total, and there are 2^32 possible outputs, so it should be bruteforceable quite fast.
gollark: Or I guess not, due to multiplication.
gollark: This is a weird hash. The bit which actually loops over the characters can only change the lowest 16 bits of a and b.
gollark: Our apiogenesis arrays continue 29183819913% operation.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.