2010 Intersport Heilbronn Open
The 2010 Intersport Heilbronn Open (known as the 2010 Intersport Heilbronn Open presented by Wilson for sponsorship reasons) was a professional tennis tournament played on indoor hard courts. It was part of the 2010 ATP Challenger Tour. It took place in Talheim, Germany between 25 and 31 January 2010.
| 2010 Intersport Heilbronn Open | |
|---|---|
| Date | January 25 – January 31 |
| Edition | 23rd |
| Location | Talheim, Germany |
| Champions | |
| Singles | |
 | |
| Doubles | |
 | |
ATP entrants
Seeds
| Country | Player | Rank1 | Seed |
|---|---|---|---|
|
Michael Berrer | 66 | 1 |
|
Daniel Brands | 91 | 2 |
 |
Jan Hernych | 109 | 3 |
 |
Mario Ančić | 115 | 4 |
 |
Harel Levy | 116 | 5 |
 |
Karol Beck | 117 | 6 |
|
Björn Phau | 118 | 7 |
 |
Oleksandr Dolgopolov Jr. | 123 | 8 |
- Rankings are as of January 18, 2010.
Other Entrants
The following players received wildcards into the singles main draw:
The following players received entry from the qualifying draw:
The following player received the lucky loser spot:
Champions
Singles
Doubles
gollark: getItemMeta returns a thing with stackSize, right?
gollark: Also, in that version there, patterns got fed in as a table with numeric indices from 1-9 representing each slot of the crafting table plus an optional qty key for how much the recipe produces.
gollark: Ridiculous. We *need* to be able to break maths in a snippet of code.
gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
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.