1989 US Open – Mixed Doubles
Jana Novotná and Jim Pugh were the defending champions but lost in the second round to Zina Garrison and Sherwood Stewart.
Mixed Doubles | |
---|---|
1989 US Open | |
1988 Champions | ![]() ![]() |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 3–6, 6–2, 7–5 |
Robin White and Shelby Cannon won in the final 3–6, 6–2, 7–5 against Meredith McGrath and Rick Leach.
Seeds
Champion seeds are indicated in bold text while text in italics indicates the round in which those seeds were eliminated.
Jana Novotná / Jim Pugh (Second Round)- n/a
Natasha Zvereva / Patrick McEnroe (Second Round) Elizabeth Smylie / John Fitzgerald (Second Round) Patty Fendick / Scott Davis (Second Round) Rosalyn Fairbank-Nideffer / Danie Visser (Second Round) Gigi Fernández / Jorge Lozano (First Round) Elna Reinach / Pieter Aldrich (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
Final
Final | ||||||
![]() ![]() | 3 | 6 | 7 | |||
![]() ![]() | 6 | 2 | 5 | |||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 7 | ||||||||||||||||||||||||
![]() ![]() | 4 | 6 | 1 | ![]() ![]() | 5 | 7 | 4 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 7 | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 4 | 4 | ![]() ![]() | 6 | 3 | ||||||||||||||||||||||
![]() ![]() | 6 | 6 | 8 | ![]() ![]() | 7 | 6 | |||||||||||||||||||||
![]() ![]() | 2 | 3 | ![]() ![]() | 3 | 6 | 1 | |||||||||||||||||||||
![]() ![]() | 3 | 7 | 4 | 8 | ![]() ![]() | 6 | 4 | 6 | |||||||||||||||||||
8 | ![]() ![]() | 6 | 5 | 6 | 8 | ![]() ![]() | 4 | 6 | |||||||||||||||||||
4 | ![]() ![]() | 6 | 3 | ![]() ![]() | 6 | 7 | |||||||||||||||||||||
![]() ![]() | 4 | 0 | r | 4 | ![]() ![]() | 5 | 6 | 2 | |||||||||||||||||||
![]() ![]() | 1 | 4 | ![]() ![]() | 7 | 2 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 2 | ||||||||||||||||||||||
![]() ![]() | 6 | 5 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||||
![]() ![]() | 7 | 7 | ![]() ![]() | 6 | 7 | ||||||||||||||||||||||
![]() ![]() | 3 | 6 | 5 | ![]() ![]() | 4 | 5 | |||||||||||||||||||||
5 | ![]() ![]() | 6 | 7 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
6 | ![]() ![]() | 7 | 2 | 6 | |||||||||||||||||||||||
![]() ![]() | 6 | 6 | 3 | 6 | ![]() ![]() | 7 | 4 | 2 | |||||||||||||||||||
![]() ![]() | 3 | 7 | 2 | ![]() ![]() | 5 | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 5 | 6 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
WC | ![]() ![]() | 0 | 1 | ![]() ![]() | 4 | 3 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 7 | 1 | 6 | |||||||||||||||||||||
![]() ![]() | 4 | 6 | 3 | ![]() ![]() | 6 | 6 | 4 | ||||||||||||||||||||
3 | ![]() ![]() | 6 | 7 | ![]() ![]() | 7 | 5 | 4 | ||||||||||||||||||||
7 | ![]() ![]() | 3 | 6 | ![]() ![]() | 6 | 7 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 7 | ![]() ![]() | 2 | 4 | ||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||
![]() ![]() | 3 | 3 | ![]() ![]() | 1 | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 1 | 4 | |||||||||||||||||||||
![]() ![]() | 4 | 4 | ![]() ![]() | 4 | 7 | 7 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 5 | 5 | |||||||||||||||||||||
ALT | ![]() ![]() | 3 | 3 |
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.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.