Ana Lucía Migliarini de León
Ana Lucía Migliarini de León (born 16 December 1983 in Montevideo) is a Uruguayan tennis player.
Country (sports) | ![]() |
---|---|
Born | Montevideo, Uruguay | 16 December 1983
Turned pro | 2000 |
Plays | Left-handed (two-handed backhand) |
Prize money | $35,754 |
Singles | |
Career record | 112 - 83 |
Career titles | 3 ITF |
Highest ranking | 338 (31 March 2003) |
Doubles | |
Career record | 86 - 56 |
Career titles | 8 ITF |
Highest ranking | 338 (25 November 2002) |
Team competitions | |
Fed Cup | 16–24 |
Migliarini de León won 3 singles and 8 doubles titles on the ITF tour. On 31 March 2003, she reached her best singles ranking of world number 338. On 25 November 2002, she peaked at world number 338 in the doubles rankings.
Playing for Uruguay at the Fed Cup, Migliarini de León had a win–loss record of 16–24.[1]
ITF finals (11–16)
Singles (3–5)
|
|
Result | Date | Category | Tournament | Surface | Opponent | Score |
---|---|---|---|---|---|---|
Runner-up | 16 April 2001 | 10,000 | Belo Horizonte, Brazil | Hard | ![]() |
4–6, 7–5, 3–6 |
Runner-up | 30 April 2001 | 10,000 | Florianópolis, Brazil | Clay | ![]() |
4–6, 7–5, 3–6 |
Runner-up | 29 July 2001 | 10,000 | Guayaquil, Ecuador | Clay | ![]() |
2–6, 0–6 |
Winner | 2 September 2001 | 10,000 | Montevideo, Uruguay | Clay | ![]() |
6–3, 6–2 |
Winner | 10 June 2002 | 10,000 | Kędzierzyn-Koźle, Poland | Clay | ![]() |
2–6, 6–1, 7–6(4) |
Runner-up | 1 October 2002 | 10,000 | Mexicali, Mexico | Hard | ![]() |
6–4, 3–6, 4–6 |
Runner-up | 7 October 2002 | 10,000 | Los Mochis, Mexico | Clay | ![]() |
5–7, 3–6 |
Winner | 14 June 2002 | 10,000 | Pachuca, Mexico | Clay | ![]() |
6–1, 4–6, 7–5 |
Doubles (8–11)
|
|
Result | Date | Category | Tournament | Surface | Partner | Opponents | Score |
---|---|---|---|---|---|---|---|
Winner | 30 April 2001 | 10,000 | Florianópolis, Brazil | Clay | ![]() |
![]() ![]() |
6–3, 3–6, 6–4 |
Winner | 29 July 2001 | 10,000 | Guayaquil, Ecuador | Clay | ![]() |
![]() ![]() |
6–2, 6–2 |
Runner-up | 6 August 2001 | 10,000 | Lima, Peru | Clay | ![]() |
![]() ![]() |
6–0, 3–6, 2–6 |
Runner-up | 13 August 2001 | 10,000 | La Paz, Bolivia | Clay | ![]() |
![]() ![]() |
2–4 ret. |
Runner-up | 3 June 2002 | 10,000 | Poznań, Poland | Clay | ![]() |
![]() ![]() |
2–6, 2–6 |
Winner | 24 June 2002 | 10,000 | Périgueux, France | Clay | ![]() |
![]() ![]() |
7–6(3), 6–2 |
Winner | 4 August 2002 | 10,000 | Manta, Ecuador | Clay | ![]() |
![]() ![]() |
6–2, 4–6, 6–3 |
Winner | 12 August 2002 | 10,000 | La Paz, Bolivia | Clay | ![]() |
![]() ![]() |
1–6, 6–3, 6–0 |
Runner-up | 19 August 2002 | 10,000 | Asuncion, Paraguay | Clay | ![]() |
![]() ![]() |
4–6, 6–1, 2–6 |
Winner | 1 October 2002 | 10,000 | Mexicali, Mexico | Hard | ![]() |
![]() ![]() |
6–4, 6–2 |
Winner | 7 October 2002 | 10,000 | Los Mochis, Mexico | Clay | ![]() |
![]() ![]() |
7–5, 6–1 |
Runner-up | 14 June 2002 | 10,000 | Pachuca, Mexico | Clay | ![]() |
![]() ![]() |
0–6, 1–6 |
Runner-up | 29 September 2003 | 10,000 | Guadalajara, Mexico | Clay | ![]() |
![]() ![]() |
0–6, 6–3, 3–6 |
Runner-up | 27 October 2003 | 10,000 | Ciudad Obregón, Mexico | Clay | ![]() |
![]() ![]() |
6–1, 2–6, 4–6 |
Runner-up | 3 November 2003 | 10,000 | Los Mochis, Mexico | Clay | ![]() |
![]() ![]() |
2–6, 1–6 |
Runner-up | 5 September 2004 | 10,000 | Asunción, Paraguay | Clay | ![]() |
![]() ![]() |
5–7, 4–6 |
Runner-up | 11 September 2004 | 10,000 | Santiago, Chile | Clay | ![]() |
![]() ![]() |
2–6, 0–6 |
Runner-up | 25 October 2004 | 10,000 | Los Mochis, Mexico | Clay | ![]() |
![]() ![]() |
2–6, 6–3, 5–7 |
Winner | 7 March 2005 | 10,000 | Toluca, Mexico | Hard | ![]() |
![]() ![]() |
6–2, 4–6, 7–5 |
gollark: Actually, that's one idea, but whatever.
gollark: Other data model idea:table of peopletable of companiestable of shares, each of which contains company ID, person ID, quantity.
gollark: This is for some sort of krist shares thing, yes? There are probably better ways to model your data.
gollark: You probably don't want a 2D array anyway.
gollark: Oh no.
References
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.