2002 Tennis Masters Series
The table below shows the 2002 Tennis Masters Series schedule.
The ATP Masters Series are part of the elite tour for professional men's tennis organised by the Association of Tennis Professionals.
Results
Singles
Titles Champions
Singles
| # | Player | IN | MI | MO | HA | RO | CA | CI | MA | PA | # | Winning span |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
 | 1 | 5 | - | - | 1 | 3 | 2 | 1 | 2 | 15 | 1990-2002 (13) | |
| 2 | 3 | - | - | 1 | - | 3 | - | 2 | 11 | 1992-2000 (9) | |
 | - | 1 | 3 | - | 3 | - | - | 1 | - | 8 | 1990-1997 (8) | |
| 3 | 1 | - | - | - | 1 | 2 | - | - | 7 | 1990-1997 (8) | |
| 2 | 1 | - | - | 2 | - | - | - | - | 5 | 1991-1993 (3) | |
 | - | - | - | - | - | - | - | 4 | 1 | 5 | 1990-1996 (7) | |
 | - | - | 2 | 1 | 1 | - | 1 | - | - | 5 | 1999-2001 (3) | |
 | 1 | 1 | 1 | 1 | 1 | - | - | - | - | 5 | 1997-1999 (3) | |
 | 1 | - | - | 1 | - | - | 1 | - | 1 | 4 | 1990-1992 (3) | |
 | - | - | 1 | 3 | - | - | - | - | - | 4 | 1994-1997 (4) | |
| - | - | - | - | - | - | 1 | 1 | 1 | 3 | 1996-2000 (5) | |
 | - | - | - | - | - | 1 | - | - | 2 | 3 | 2000-2002 (3) | |
 | - | - | 2 | - | - | - | - | - | - | 2 | 1991-1993 (3) | |
| - | - | 1 | - | - | 1 | - | - | - | 2 | 1990-1991 (2) | |
| 1 | - | - | - | 1 | - | - | - | - | 2 | 1997-2000 (4) | |
 | - | - | - | - | - | 1 | - | 1 | - | 2 | 1996-2000 (5) | |
| - | - | 1 | - | 1 | - | - | - | - | 2 | 2001-2002 (2) | |
 | - | - | - | - | - | - | 1 | - | 1 | 2 | 1991 | |
 | - | - | - | - | - | - | - | 1 | 1 | 2 | 1992-1993 (2) | |
 | - | 1 | - | - | - | - | - | 1 | - | 2 | 1998-1999 (2) | |
| - | - | 1 | - | - | - | 1 | - | - | 2 | 1998-2002 (5) | |
.svg.png){kind=small} | - | - | - | - | - | 1 | 1 | - | - | 2 | 1998 | |
| - | - | - | 1 | - | - | - | 1 | - | 2 | 1993 | |
| - | - | - | 1 | - | - | - | - | - | 1 | 1990 | |
 | - | - | - | - | - | 1 | - | - | - | 1 | 2002 | |
| - | - | - | 1 | - | - | - | - | - | 1 | 1998 | |
| - | - | - | 1 | - | - | - | - | - | 1 | 1996 | |
 | - | - | - | 1 | - | - | - | - | - | 1 | 2002 | |
| - | - | - | - | - | - | - | - | 1 | 1 | 2001 | |
| - | - | - | - | - | - | - | 1 | - | 1 | 2001 | |
| 1 | - | - | - | - | - | - | - | - | 1 | 2002 | |
| - | - | - | - | - | 1 | - | - | - | 1 | 1999 | |
 | - | - | - | - | - | - | - | 1 | - | 1 | 1997 | |
| - | - | - | - | 1 | - | - | - | - | 1 | 2000 | |
| - | - | - | 1 | - | - | - | - | - | 1 | 1991 | |
 | - | - | - | - | - | 1 | - | - | - | 1 | 2001 | |
| - | - | - | - | - | 1 | - | - | - | 1 | 1993 | |
| 1 | - | - | - | - | - | - | - | - | 1 | 1999 | |
| - | - | 1 | - | - | - | - | - | - | 1 | 2000 | |
| - | - | - | - | 1 | - | - | - | - | 1 | 2001 | |
 | - | - | - | - | - | - | - | - | 1 | 1 | 1998 | |
| - | - | - | - | 1 | - | - | - | - | 1 | 1991 | |
| - | - | - | - | - | 1 | - | - | - | 1 | 1997 | |
| # | Player | IN | MI | MO | HA | RO | CA | CI | ST | PA | # | Winning span |
gollark: Interesting project idea: a thing which generates minified incomprehensible code in different languages.
gollark: It doesn't *do* anything. It just looks cool because of the syntax highlighting.
gollark: ```lualocal a="potato"local function b(c)return fs.combine(c,"")end;local function d(c)if b(c)==""then return{}end;local e,f={},c;repeat table.insert(e,1,fs.getName(f))f=fs.getDir(f)until f==""return e end;local function g(h,i,j)return{table.unpack(h,i,j)}end;local function k(l)local m=type(l)if m=="number"then return tostring(l)elseif m=="string"then return textutils.serialise(l)elseif m=="table"then local n="{"for o,p in pairs(l)do n=n..string.format("[%s]=%s,",k(o),k(p))end;return n.."}"elseif m=="boolean"then return tostring(l)else error("Unsupported type "..m)end end;local function q(m)local r=g(m)local s=#r;local p=r[s]r[s]=nil;return r,p end;local t=".crane-persistent/"..a;local function u(v,w)return string.sub(v,1,#w)==w end;local function x(v,w)return string.sub(v,-#w,-1)==w end;local function y(v,z)return string.find(v,z)~=nil end;local function A(B)return function(C)local D={}for E,F in pairs(B)do local l=C[F]if type(l)=="table"thenl=copy(l)end;D[F]=l end;return D end end;local function G(H,c)local I=H;local c=c;if type(c)=="string"then c=d(c)end;for E,J in pairs(c)do if type(I)~="table"then error("Path segment "..J.." is nonexistent or not a directory; full path "..k(c))end;I=I[J]end;return I end;local function K(H,c)local L,M=q(d(c))local N=G(H,L)or H;return N,M end;local function O(P)local m={}local function Q(R)table.insert(m,R)return""end;Q(P:gsub("(.-)\r?\n",Q))return m end;local function S(T,U)local O=O(T)local V={}local R=0;function V.close()end;if not U then function V.readLine()R=R+1;return O[R]end;function V.readAll()return T end else local W=T;function V.read()local X=string.byte(W:sub(1,1))W=W:sub(2)return X end end;return V end;local function Y(Z,U)local V={}function V.close()end;function V.flush()end;if not U then function V.write(m)return Z(m)end;function V.writeLine(m)return Z(m.."\n")end else function V.write(_)return Z(string.char(_))end end;return V end;local function a0(a1)local a2=a1.options;local H=a1.tree;local a3=A{"getName",```
gollark: Yep!
gollark: A fun idea is to either run what they want you to on Linux (and report faithfully the errors) or on a VM.
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.