1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
extern crate image; use image::Rgba; use super::*; pub mod network; pub mod gif; /// Returns the difference between the lowest and highest x and y values, respectively. pub fn gen_map_dimensions(min_max: ((i16, i16), (i16, i16))) -> (u32, u32) { let x = min_max.0; let y = min_max.1; ((x.1 - x.0) as u32, (y.1 - y.0) as u32) } /* FIXME Stuck on iterative mut assignment. /// Returns a list of Links connecting the Nodes in the order they were provided. /// E.g. provided a list with three nodes the result would be: /// 1----2----3, dashes representing links. pub fn sequentially_link_nodes<'a, T: Shape + Draw>(nodes: &'a mut [Node<'a, T>]) { let mut b: Option<&mut Node<T>> = None; for (i, node) in nodes.iter_mut().enumerate() { let mut a = node; //let tmp = b; //b = Some(a); if b.is_none() { continue; } a.link(&b.unwrap()); } } */ /// Finds the min and max Nodes and returns ((minX, minY),(maxX, maxY)) pub fn min_max<T: Draw>(list: &[T]) -> ((i16, i16), (i16, i16)) { let mut size: i16 = 6; // TODO let mut elem = Vec::new(); for item in list { let tmp = item.get_size(); if tmp as i16 > size {size = tmp as i16;} elem.push(item.get_coordinate()) } let mut min_x: i16 = 0; let mut min_y: i16 = 0; let mut max_x: i16 = 0; let mut max_y: i16 = 0; // Iterates over the nodes and finds the minimum and maximum x and y values. for c in elem.iter() { if c.x > max_x { max_x = c.x; } if min_x > c.x { min_x = c.x; } if c.y > max_y { max_y = c.y; } if min_y > c.y { min_y = c.y; } } ((min_x -size, max_x +size), (min_y -size, max_y +size)) } /// Sets the additions required to center the pixels on the map. /// This allows for negative placements of Coordinates, when adjusted with this function. pub fn gen_stuff(min_max: ((i16, i16), (i16, i16))) -> (i16, i16) { let x = min_max.0; let y = min_max.1; (-x.0, -y.0) } /// Generates a canvas from the image crate. pub fn gen_canvas(w: u32, h: u32) -> image::ImageBuffer<Rgba<u8>, Vec<u8>> { image::DynamicImage::new_rgba8(w, h).to_rgba() } /* /// Finds the min and max Nodes and returns ((minX, minY),(maxX, maxY)) pub fn gen_min_max<T: Shape + Draw>(list: &[Node<T>]) -> ((i16, i16), (i16, i16)) { let size = get_node_size(&list) as i16; let mut min_x = list[0].geo.x; let mut min_y = list[0].geo.y; let mut max_x = list[0].geo.x; let mut max_y = list[0].geo.y; // Iterates over the nodes and finds the minimum and maximum x and y values. for node in list.iter() { if node.geo.x > max_x { max_x = node.geo.x; } if min_x > node.geo.x { min_x = node.geo.x; } if node.geo.y > max_y { max_y = node.geo.y; } if min_y > node.geo.y { min_y = node.geo.y; } } ((min_x -size, max_x +size), (min_y -size, max_y +size)) } */ /* // TODO pub fn groups_and_links<T: Shape>(path: &Path, groups: &[Group<T>], links: &[Link]) { // TODO implementing. // Node size. let node_size: u32 = get_node_size_from_groups(&groups); let map = Map::new(); // Gets the highest and lowest of all the coordinates. let min_max = min_max(groups); // Stabilizes the picture to have the action in the center of the image. let add = gen_stuff(min_max); // Generates an image buffer. let mut imgbuf = generate_image_buffer(node_size, min_max); for group in groups.iter() { group.draw(&mut imgbuf, add.0 as u32, add.1 as u32, node_size); } for link in links.iter() { link.draw_width(&mut imgbuf, add.0 +node_size as i16/2, add.1 +node_size as i16/2, 3); } let _ = imgbuf.save(&path); } /// Generates an image buffer and will ask for confirmation for larger inputs. pub fn generate_image_buffer(node_size: u32, min_max: ((i16, i16), (i16, i16))) -> image::ImageBuffer<Rgba<u8>, Vec<u8>> { // If there is no image to render. Panic. if min_max == ((0,0),(0,0)) { panic!("Nothing to map!"); } // Gets the resolution of the image let res = gen_map_dimensions(min_max); // Sets the image size. let width = res.0 + node_size*2; let height = res.1 + node_size*2; // Confirm for larger images. if CONFIRMA && width+height >= 10000 { // TODO make this disable-able. // Confirm the image size before proceeding. println!("The image will be {}x{} pixels. Continue? [Y/N]", width, height); let mut input = String::new(); match io::stdin().read_line(&mut input) { Ok(_) => {} Err(error) => println!("error: {}", error), } match input.as_str() { "N\n" => panic!("interrupted"), _ => (), } } // Create a new ImgBuf with width: imgx and height: imgy gen_canvas(width, height) } // TODO pub fn node_and_links<T: Shape>(path: &Path, nodes: &[Node<T>], links: &[Link]) { // Node size. let node_size: u32 = get_node_size(&nodes); let min_max = gen_min_max(nodes); // Stabilizes the picture to have the action in the center of the image. let add = gen_stuff(min_max); // Generates an image buffer. let mut imgbuf = generate_image_buffer(node_size, min_max); // Draws all nodes. map_nodes(&mut imgbuf, &nodes, add, node_size); // Draws all links map_links(&mut imgbuf, &links, add, node_size); println!("Mapped: {} nodes & {} links", nodes.len(), links.len()); // Save the image to local storage. let _ = imgbuf.save(path); } /// Returns the max Node size existing inside a list of Nodes. pub fn get_node_size<T: Shape>(nodes: &[Node<T>]) -> u32 { let mut node_size: u32 = 3; // Minimum default size. for node in nodes.iter() { let rad = node.radius; match rad { Some(val) => {if val > node_size {node_size = val;}} None => (), } } node_size } /// Returns the max Node size existing inside a list of Groups. pub fn get_node_size_from_groups<T: Shape>(groups: &[Group<T>]) -> u32 { let mut node_size: u32 = 3; // Minimum default size. for group in groups.iter() { let tmp = get_node_size(group.get_nodes()); if tmp > node_size {node_size = tmp;} } node_size } */ /* /// Draws the Nodes on an ImageBuffer. pub fn map_nodes<T: Shape>(mut image: &mut ImageBuffer<Rgba<u8>, Vec<u8>>, nodes: &[Node<T>], add: (i16, i16), node_size: u32) { // Iterate over the coordinates and pixels of the image for node in nodes { node.draw(&mut image, add.0 as u32, add.1 as u32, node_size); } } /// Draws the Links on an ImageBuffer. pub fn map_links(mut image: &mut ImageBuffer<Rgba<u8>, Vec<u8>>, links: &[Link], add: (i16, i16), node_size: u32) { // Iterate over the coordinates and pixels of the image for link in links { link.draw(&mut image, add.0 +node_size as i16/2, add.1 +node_size as i16/2); } } pub fn map_groups(mut image: &mut ImageBuffer<Rgba<u8>, Vec<u8>>, links: &[Link], add: (i16, i16), node_size: u32) { //let min_max = gen_min_max(&nodes); let min_max = group::min_max(&groups); // Stabilizes the picture to have the action in the center of the image. let add = gen_stuff(min_max); // Generates an image buffer. let mut imgbuf = image::DynamicImage::new_rgba8(width.into(), height.into()).to_rgba(); map_links(&mut imgbuf, &[link], add, node_size); // Draws all nodes. for group in groups { map_nodes(&mut imgbuf, group.get_nodes(), add, node_size); } } */