Muhidin Čoralić
Muhidin Čoralić (born 30 May 1968) is a retired Bosnian-Herzegovinian football player.
| Personal information | |||
|---|---|---|---|
| Full name | Muhidin Čoralić | ||
| Date of birth | 30 May 1968 | ||
| Place of birth | Janja, SFR Yugoslavia | ||
| Height | 1.78 m (5 ft 10 in) | ||
| Playing position(s) | Midfielder | ||
| Senior career* | |||
| Years | Team | Apps | (Gls) |
| Podrinje Janja | |||
| 1986–1987 | FK Sarajevo | 3 | (0) |
| 1989–1990 | Zemun | 21 | (0) |
| 1991 | Bor | 13 | (1) |
| 1991–1993 | Zemun | ||
| 1993–1995 | Alemannia Aachen | ||
| 1995–1996 | SC Jülich 1910 | ||
| 1996–1998 | Bonner SC | 43 | (8) |
| * Senior club appearances and goals counted for the domestic league only | |||
After beginning his career with FK Sarajevo, he moved to FK Zemun where, accepting the loan in 1990-91 to FK Bor, he stayed until 1993. It was then that he moved to Germany where he signed with Alemannia Aachen where he played until 1995. Before retiring, he also played with lower league German clubs SC Jülich 1910 and Bonner SC.
External sources
- Profile in Alemannia Aachen official website
- Profile at Worldfootball.
- Stats from Yugoslav First and Second Leagues at zerodic.com
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.
gollark: (I'm still confused though)
gollark: People have already given helpful suggestions how to, soo...
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.