2007 US Open – Boys' Doubles
The 2007 US Open – Boys' Doubles was an event that was won by Jonathan Eysseric and Jerome Inzerillo.
Boys' Doubles | |
---|---|
2007 US Open | |
Champion | ![]() ![]() |
Runner-up | ![]() ![]() |
Final score | 6–2, 6–4 |
Seeds
Vladimir Ignatic / Roman Jebavý (Semifinals) Stephen Donald / Greg Jones (Semifinals) Henrique Cunha / Fernando Romboli (First Round) Daniel-Alejandro Lopez / Matteo Trevisan (Quarterfinals) Guillermo Rivera-Aránguiz / Ricardo Urzua-Rivera (First Round) Jonathan Eysseric / Jérôme Inzerillo (Champions) John-Patrick Smith / Andrew Thomas (First Round) Tomas Fabbiano / Andrei Karatchenia (Quarterfinals)
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 | ||||||||||||
1 | ![]() ![]() | 62 | 4 | ||||||||||
6 | ![]() ![]() | 77 | 6 | ||||||||||
6 | ![]() ![]() | 6 | 6 | ||||||||||
![]() ![]() | 2 | 4 | |||||||||||
![]() ![]() | 4 | ||||||||||||
2 | ![]() ![]() | 0 | r | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() ![]() | 3 | 4 | 1 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 66 | 4 | WC | ![]() ![]() | 3 | 4 | |||||||||||||||||||||
WC | ![]() ![]() | 78 | 6 | 1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 3 | 4 | ||||||||||||||||||||||
![]() ![]() | 2 | 2 | ![]() ![]() | 7 | 5 | 65 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 5 | 7 | 77 | |||||||||||||||||||||
7 | ![]() ![]() | 3 | 3 | 1 | ![]() ![]() | 62 | 4 | ||||||||||||||||||||
4 | ![]() ![]() | 6 | 6 | 6 | ![]() ![]() | 77 | 6 | ||||||||||||||||||||
![]() ![]() | 1 | 2 | 4 | ![]() ![]() | 6 | 3 | 6 | ||||||||||||||||||||
![]() ![]() | 3 | 1 | ![]() ![]() | 3 | 6 | 4 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | 4 | ![]() ![]() | 3 | 0 | |||||||||||||||||||||
WC | ![]() ![]() | 5 | 5 | 6 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 7 | 7 | ![]() ![]() | 6 | 2 | 3 | |||||||||||||||||||||
![]() ![]() | 611 | 2 | 6 | ![]() ![]() | 4 | 6 | 6 | ||||||||||||||||||||
6 | ![]() ![]() | 713 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
8 | ![]() ![]() | 4 | 6 | 6 | |||||||||||||||||||||||
![]() ![]() | 6 | 4 | 4 | 8 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
WC | ![]() ![]() | 6 | 6 | WC | ![]() ![]() | 2 | 0 | ||||||||||||||||||||
![]() ![]() | 2 | 4 | 8 | ![]() ![]() | 5 | 6 | 1 | ||||||||||||||||||||
![]() ![]() | 3 | 4 | ![]() ![]() | 7 | 4 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||
![]() ![]() | 2 | 7 | 6 | ![]() ![]() | 2 | 3 | |||||||||||||||||||||
3 | ![]() ![]() | 6 | 5 | 3 | ![]() ![]() | 4 | |||||||||||||||||||||
5 | ![]() ![]() | 66 | 4 | 2 | ![]() ![]() | 0 | r | ||||||||||||||||||||
![]() ![]() | 78 | 6 | ![]() ![]() | 2 | 6 | 1 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 3 | 6 | |||||||||||||||||||||
![]() ![]() | 4 | 4 | ![]() ![]() | 0 | 3 | ||||||||||||||||||||||
![]() ![]() | 77 | 4 | 3 | 2 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 63 | 6 | 6 | ![]() ![]() | 5 | 3 | |||||||||||||||||||||
![]() ![]() | 3 | 2 | 2 | ![]() ![]() | 7 | 6 | |||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: Of course.
gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
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.