2005 Rogers Cup – Doubles
Shinobu Asagoe and Ai Sugiyama were the defending champions. They were both present but did not compete together.
Asagoe partnered with Tathiana Garbin, but lost in the semifinals to Conchita Martínez and Virginia Ruano Pascual.
Sugiyama partnered with Daniela Hantuchová, but lost in the semifinals to Anna-Lena Grönefeld and Martina Navratilova.
Doubles | |
---|---|
2005 Rogers Cup | |
Champions | |
Runners-up | |
Final score | 5–7, 6–3, 6–4 |
Anna-Lena Grönefeld and Martina Navratilova won in the final 5–7, 6–3, 6–4, against Conchita Martínez and Virginia Ruano Pascual.
Seeds
The top four seeds received a bye into the second round.
Cara Black / Rennae Stubbs (Quarterfinals) Svetlana Kuznetsova / Nadia Petrova (Quarterfinals, withdrew due to a mid back strain for Kuznetsova) Conchita Martínez / Virginia Ruano Pascual (Final) Daniela Hantuchová / Ai Sugiyama (Semifinals) Anabel Medina Garrigues / Dinara Safina (Quarterfinals) Anna-Lena Grönefeld / Martina Navratilova (Champions) Marion Bartoli / Nicole Pratt (Second Round) Shinobu Asagoe / Tathiana Garbin (Semifinals)
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
Finals
Semifinals | Final | ||||||||||||
6 | 7 | 6 | |||||||||||
4 | 5 | 4 | |||||||||||
6 | 5 | 6 | 6 | ||||||||||
3 | 7 | 3 | 4 | ||||||||||
3 | 3 | 6 | 6 | ||||||||||
8 | 6 | 3 | 2 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | 6 | 4 | 6 | ||||||||||||||||||||||||
7 | 4 | 3 | 2 | 6 | 3 | ||||||||||||||||||||||
5 | 6 | 6 | 1 | 67 | 4 | ||||||||||||||||||||||
2 | 4 | 6 | 7 | 6 | |||||||||||||||||||||||
6 | 6 | 2 | 5 | ||||||||||||||||||||||||
4 | 2 | 6 | 6 | 7 | |||||||||||||||||||||||
6 | 6 | 6 | 6 | 7 | 6 | ||||||||||||||||||||||
4 | 5 | 4 | |||||||||||||||||||||||||
4 | 6 | 6 | |||||||||||||||||||||||||
WC | 7 | 2 | 65 | 3 | 4 | ||||||||||||||||||||||
5 | 6 | 7 | 4 | 7 | 6 | ||||||||||||||||||||||
6 | 4 | 2 | 5 | 4 | |||||||||||||||||||||||
3 | 6 | 6 | 6 | 1 | 6 | ||||||||||||||||||||||
64 | 6 | 1 | 7 | 3 | 6 | 4 | |||||||||||||||||||||
7 | 7 | 0 | 6 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
5 | 6 | 7 | |||||||||||||||||||||||||
Q | 3 | 5 | 5 | 6 | 6 | ||||||||||||||||||||||
6 | 6 | 2 | 4 | ||||||||||||||||||||||||
2 | 3 | 5 | 3 | 2 | |||||||||||||||||||||||
2 | 6 | 1 | 3 | 6 | 6 | ||||||||||||||||||||||
6 | 4 | 6 | 3 | 6 | 3 | ||||||||||||||||||||||
3 | 6 | 0 | 6 | ||||||||||||||||||||||||
3 | 3 | 6 | 6 | ||||||||||||||||||||||||
8 | 6 | 6 | 8 | 6 | 3 | 2 | |||||||||||||||||||||
3 | 1 | 8 | 6 | 4 | 6 | ||||||||||||||||||||||
4 | 6 | 6 | 3 | 6 | 3 | ||||||||||||||||||||||
6 | 4 | 2 | 8 | w/o | |||||||||||||||||||||||
6 | 6 | 2 | |||||||||||||||||||||||||
WC | 1 | 1 | |||||||||||||||||||||||||
2 | w/o | ||||||||||||||||||||||||||
gollark: Check out minoteaur's advanced™ migration engine:```nimproc migrate*(db: DbConn) = let currentVersion = fromDbValue(get db.value("PRAGMA user_version"), int) for mid in (currentVersion + 1) .. migrations.len: db.transaction: logger.log(lvlInfo, "Migrating to schema " & $mid) db.execScript migrations[mid - 1] db.exec("PRAGMA user_version = " & $mid) logger.log(lvlDebug, "DB ready")```
gollark: My DB-using projects include all migration capability too, if sometimes limited to a bunch of `CREATE TABLE IF NOT EXISTS` calls, but if I ever *needed* it I would just make them able to call some functions to migrate the rows.
gollark: Well, yes, unless you write an extension for it, but no fixed length ones, and I can just do complex stuff in the program.
gollark: You're right, maybe just preinstall a rootkit on all the systems with databases?
gollark: I guess my decision to use SQLite and PostgreSQL for basically everything ever, as they don't have these constraints, was good then.
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.