Roh Gap-taik
Roh Gap-taik (born 3 May 1964) is a Korean former professional tennis player.
| Country (sports) |  |
|---|---|
| Born | 3 May 1964 Gyeonggi-do, South Korea |
| Height | 5 ft 8 in (173 cm) |
| Plays | Right-handed |
| Singles | |
| Career record | 0–2 (ATP Tour) |
| Career titles | 1 (ATP Challenger) |
| Highest ranking | No. 294 (15 May 1989) |
| Doubles | |
| Highest ranking | No. 451 (21 June 1993) |
Born in Gyeonggi-do, Roh appeared in a total of five Davis Cup ties for South Korea and was a member of the gold medal winning Korean team at the 1986 Asian Games. In his Davis Cup career, between 1985 and 1988, he played in eight singles rubbers and was only beaten once.
Roh, a right-handed player, twice received a wildcard into the main draw of the Korea Open in Seoul, which were his only ATP Tour appearances. He won a Challenger title in Guangzhou in 1988, despite qualifying for the event as a lucky loser.
Since retiring he has had multiple stints serving as South Korea's Davis Cup captain.[1]
Challenger titles
Singles: (1)
| Date | Tournament | Surface | Opponent | Score |
|---|---|---|---|---|
| 13 November 1988 | Guangzhou, China | Hard | .svg.png){kind=small} |
7–5, 6–2 |
gollark: Neither!
gollark: Well, obviously you'll have some items available to build stuff from.
gollark: - Checks if the available-items list already contains the item needed. If so, just return that.- If not, checks for recipes to do what is wanted- If one exists, iterate over them (not sure what to *do* with them)- If none exists, we can't do anything, so just return no tasks, no costs and no outputs.
gollark: ```rusttype Items = HashMap<ItemType, u32>;fn quantity(items: &Items, desired: &ItemType) -> u32 { if let Some(available_quantity) = items.get(desired) { *available_quantity } else { 0 }}fn contains(items: &Items, desired: &Item) -> bool { quantity(items, &to_item_type(desired)) >= desired.quantity}fn satisfies(available: &Items, desired: &Items) -> bool { for (typ, desired_quantity) in desired.iter() { if quantity(available, typ) < *desired_quantity { return false } } true}fn to_map(is: &Vec<Item>) -> Items { let out = HashMap::new(); for i in is.iter() { out.entry(to_item_type_clone(i)) .and_modify(|e| { *e += 1 }) .or_insert(0); } out}fn one_item(i: Item) -> Items { let out = HashMap::new(); out.insert(to_item_type(&i), i.quantity); out}#[derive(Debug, Deserialize, PartialEq, Eq, Serialize, Clone)]pub struct CraftingResult { pub tasks: Vec<Recipe>, pub costs: Items, pub outputs: Items}fn solve(desired: Item, available: Items, recipes: &MultiMap<ItemType, Recipe>) -> CraftingResult { if contains(&available, &desired) { // If our available items list already contains the desired item, yay, we can just do nothing return CraftingResult { tasks: vec![], costs: one_item(desired), outputs: one_item(desired) } } if let Some(recipes) = recipes.get_vec(&to_item_type(&desired)) { for recipe in recipes.iter() { let result = solve() // ??? } } else { CraftingResult { tasks: vec![], costs: HashMap::new(), outputs: HashMap::new() } }}```My code, or at least part of it.
gollark: That is NOT THE HARD PART.
References
- "S. Korea completes sweep of islanders". Saipan Tribune. 17 July 2005.
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.