1 // Copyright 2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 use std::collections::HashSet;
13 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
21 let mut connected = HashSet::new();
22 let mut border = HashSet::new();
24 let middle = XYZ{x: 0, y: 0, z: 0};
25 border.insert(middle);
27 while !border.is_empty() && connected.len() < 10000 {
28 let choice = *(border.iter().next().unwrap());
29 border.remove(&choice);
30 connected.insert(choice);
32 let cxp = XYZ{x: choice.x + 1, y: choice.y, z: choice.z};
33 let cxm = XYZ{x: choice.x - 1, y: choice.y, z: choice.z};
34 let cyp = XYZ{x: choice.x, y: choice.y + 1, z: choice.z};
35 let cym = XYZ{x: choice.x, y: choice.y - 1, z: choice.z};
36 let czp = XYZ{x: choice.x, y: choice.y, z: choice.z + 1};
37 let czm = XYZ{x: choice.x, y: choice.y, z: choice.z - 1};
39 if !connected.contains(&cxp) {
42 if !connected.contains(&cxm){
45 if !connected.contains(&cyp){
48 if !connected.contains(&cym) {
51 if !connected.contains(&czp){
54 if !connected.contains(&czm) {