The Cerebellum
The Cerebellum is a bi-monthly peer-reviewed scientific journal founded in 2002. It is published by Springer Science+Business Media on behalf of the Society for Research on the Cerebellum and Ataxias. It is entirely devoted to research about the cerebellum and its roles in ataxias and other disorders.
| Discipline | Neuroscience |
|---|---|
| Language | English |
| Edited by | Mario Manto |
| Publication details | |
| History | 2002-present |
| Publisher | |
| Frequency | Quarterly |
| 3.280 (2009) | |
| Standard abbreviations | |
| ISO 4 | Cerebellum |
| Indexing | |
| CODEN | CERECF |
| ISSN | 1473-4222 (print) 1473-4230 (web) |
| LCCN | 2003213601 |
| OCLC no. | 51268235 |
| Links | |
Abstracting and indexing
The journal is abstracted and indexed in Academic Search, Chemical Abstracts Service EBSCO databases, BIOBASE, EMBASE, Neuroscience Citation Index, PsycINFO, PubMed/MEDLINE, Science Citation Index Expanded, Scopus, Summon by Serial Solutions, and VINITI. According to the Journal Citation Reports, the journal's 2009 impact factor is 3.280.
gollark: Given a desired item, available items and some recipes, I want a list of crafting tasks which must be performed and the required ingredients.
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.
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.