algorithmia 1.0.0

extern crate algorithmia;
extern crate rustc_serialize;

use algorithmia::Algorithmia;
use algorithmia::algo::{AlgoResponse, Version};
use std::collections::HashMap;
use std::env;
use rustc_serialize::{json};

macro_rules! hashmap {
    ($( $key: expr => $val: expr ),*) => {{
         let mut map = ::std::collections::HashMap::new();
         $( map.insert($key, $val); )*
         map
    }}
}

// Map of all possible points to their possible destinations (with distances)
type SrcDestMap<'a> = HashMap<&'a str, HashMap<&'a str, u32>>;

// The input format for the kenny/Dijkstra algorithm
type DijkstraInput<'a> = (SrcDestMap<'a>, &'a str, &'a str);

// The output format for the kenny/Dijkstra algorithm
type Route = Vec<String>;

struct RouteMap<'a> {
  map: SrcDestMap<'a>
}

impl<'a> RouteMap<'a> {
    pub fn get_dijkstra_route(self, start: &'a str, end: &'a str) -> AlgoResponse {
        let api_key = match env::var("ALGORITHMIA_API_KEY") {
            Ok(key) => key,
            Err(e) => { panic!("Error getting ALGORITHMIA_API_KEY: {}", e); }
        };
        let client = Algorithmia::client(&*api_key);
        let dijkstra = client.algo(("anowell/Dijkstra", Version::Latest));

        println!("Making request to: {}", dijkstra.to_url());

        // Declaring type explicitly to enforce valid input types during build
        let input_data: DijkstraInput = (self.map, start, end);
        // println!("Input: {:?}", input_data);
        println!("Input:\n{}", json::as_pretty_json(&input_data));

        match dijkstra.pipe(&input_data, None) {
            Ok(response) => response,
            Err(err) => panic!("{}", err),
        }
    }
}

fn main() {
    let mut args = env::args();
    args.next(); // discard args[0]
    let start = args.next().unwrap_or("a".to_string());
    let end = args.next().unwrap_or("c".to_string());

    let input_map = RouteMap {
        map: hashmap!(
            "a" => hashmap!("b" => 1),
            "b" => hashmap!("a" => 2, "c" => 2),
            "c" => hashmap!("b" => 2, "d" => 1),
            "d" => hashmap!("a" => 1, "c" => 3)
        )
    };

    let output = input_map.get_dijkstra_route(&start, &end);
    let result: Route = output.result().unwrap();
    println!("Shortest route: {}", result.join("->"));
    println!("Completed in {} seconds.", output.metadata.duration);
}