2013 Lenoir–Rhyne Bears football team
The 2013 Lenoir–Rhyne Bears football team represented Lenoir–Rhyne University in the 2013 NCAA Division II football season. They were led by third year head coach Mike Houston and played their home games at Moretz Stadium. They played as a member of the South Atlantic Conference.[1]
2013 Lenoir–Rhyne Bears football | |
---|---|
SAC champion | |
NCAA Division II Championship, L 28–43 vs. Northwest Missouri State | |
Conference | South Atlantic Conference |
2013 record | 13–2 (7–0 SAC) |
Head coach | Mike Houston (3rd season) |
Home stadium | Moretz Stadium |
2013 South Atlantic Conference football standings | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Conf | Overall | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Team | W | L | W | L | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
No. 2 Lenoir–Rhyne $^ | 7 | – | 0 | 13 | – | 2 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
No. 17 Carson–Newman ^ | 5 | – | 2 | 10 | – | 3 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
No. 23 Newberry ^ | 5 | – | 2 | 9 | – | 3 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Catawba | 3 | – | 4 | 6 | – | 5 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Wingate | 3 | – | 4 | 4 | – | 6 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Tusculum | 2 | – | 5 | 4 | – | 7 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Brevard | 2 | – | 5 | 3 | – | 8 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Mars Hill | 1 | – | 6 | 3 | – | 8 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Schedule
Date | Time | Opponent | Rank | Site | Result | Attendance |
---|---|---|---|---|---|---|
September 7 | 7:00 PM | Concord* | L 10–18 | 7,257 | ||
September 14 | 7:00 PM | at Davidson* | W 34–18 | 5,317 | ||
September 21 | 7:00 PM | at Wingate |
| W 34–13 | 2,981 | |
September 28 | 2:30 PM | at Tusculum |
| W 24–10 | 3,208 | |
October 5 | 1:00 PM | Brevard |
| W 41–0 | 7,346 | |
October 12 | 2:00 PM | at North Greenville* | W 35–17 | 3,245 | ||
October 19 | 2:00 PM | No. 23 Newberry |
| W 35–14 | 5,196 | |
October 26 | 1:00 PM | at Mars Hill | No. 24 | W 27–20 | 2,803 | |
November 2 | 2:00 PM | No. 16 Carson–Newman | No. 22 |
| W 37–3 | 7,891 |
November 9 | 12:00 PM | Alderson Broaddus* | No. 18 |
| W 62–24 | 4,371 |
November 16 | 1:30 PM | at Catawba | No. 14 | W 48–15 | 3,374 | |
November 30 | 12:00 PM | No. 18 Carson–Newman* | No. 13 |
| W 27–20 | 4,146 |
December 7 | 12:00 PM | No. 16 North Alabama* | No. 13 |
| W 42–39 | 2,500 |
December 14 | 12:00 PM | No. 15 West Chester* | No. 13 |
| W 42–14 | |
December 21 | 11:05 AM | vs. No. 2 Northwest Missouri State* | No. 13 | L 28–43 | 6,543 | |
|
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
- "Lenoir–Rhyne College 2013". College Football Reference. Retrieved January 24, 2015.
- "2013-14 Football Schedule". Lenoir-Rhyne Bears. Archived from the original on January 28, 2015. Retrieved January 24, 2015.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.