Večita plovidba
Večita plovidba (Serbian Cyrillic: Вечита пловидба, trans. Eternal sail) is a compilation album by Serbian and former Yugoslav rock band Galija, released in 1997.
Večita plovidba | ||||
---|---|---|---|---|
Compilation album by | ||||
Released | 1991 | |||
Recorded | 1979 - 1991 | |||
Genre | Rock Progressive rock Folk rock | |||
Length | 75:39 | |||
Label | PGP-RTS Raglas Records | |||
Producer | Various | |||
Galija chronology | ||||
|
Track listing
- "Avanturista" - 4:26
- "Decimen" - 4:53
- "Gospi" - 3:43
- "Digni ruku" - 3:12
- "Još uvek sanjam" - 4:41
- "Put" - 5:54
- "Burna pijana noć" - 4:11
- "Da li si spavala" - 3:09
- "Kad me pogledaš" - 4:38
- "Zebre i bizoni" - 2:59
- "Mi znamo sudbu" - 3:26
- "Žena koje nema" - 4:11
- "Na tvojim usnama" - 3:12
- "Korak do slobode" - 2:52
- "Skadarska" - 4:13
- "Trube" - 3:35
- "Seti se maja" - 3:17
- "Pravo slavlje" - 4:15
Credits
- Nenad Milosavljević - vocals
- Predrag Milosavljević - vocals
- Jean Jacques Roscam - guitar
- Bata Zlatković - flute
- Dušan Karadžić - bass guitar
- Boban Pavlović - drums
- Zoran Radosavljević - bass guitar
- Predrag Milanović - bass guitar
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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.