{\n\n let a = get_value(current_instruction[2], pointer + 1, program, relative_base);\n\n let b = get_value(current_instruction[1], pointer + 2, program, relative_base);\n","file_path":"src/intcode.rs","rank":36,"score":116124.53871987731},{"content":"#[aoc_generator(day3)]\n\npub fn input_generator(input: &str) -> Vec<(DistanceMap, PointSet)> {\n\n input\n\n .lines()\n\n .map(|x| parse_points(x))\n\n .map(build_points)\n\n .collect()\n\n}\n\n\n","file_path":"src/day3.rs","rank":37,"score":110393.35485309093},{"content":"fn parse_instruction(params: i64) -> Vec {\n\n format!(\"{:05}\", params)\n\n .chars()\n\n .map(|x| x.to_digit(10).unwrap() as i64)\n\n .collect()\n\n}\n\n\n","file_path":"src/intcode.rs","rank":38,"score":94864.36176435329},{"content":"fn run_program(program: &mut [usize]) {\n\n let mut pointer = 0;\n\n loop {\n\n let current_instruction = program[pointer];\n\n match current_instruction {\n\n 1 => {\n\n let pos_a = program[pointer + 1];\n\n let pos_b = program[pointer + 2];\n\n let result = program[pointer + 3];\n\n program[result] = program[pos_a] + program[pos_b];\n\n }\n\n 2 => {\n\n let pos_a = program[pointer + 1];\n\n let pos_b = program[pointer + 2];\n\n let result = program[pointer + 3];\n\n program[result] = program[pos_a] * program[pos_b];\n\n }\n\n 99 => return,\n\n _ => {}\n\n };\n\n pointer += 4;\n\n }\n\n}\n\n\n","file_path":"src/day2.rs","rank":39,"score":91513.70386502016},{"content":"fn process(cycles: i64, planets: &mut Coord) -> i64 {\n\n //println!(\"Cycle: 0 Planets: {:?}\", planets);\n\n for _cycle in 0..cycles {\n\n let p_copy = planets.to_owned();\n\n for mut a in planets.iter_mut() {\n\n for b in p_copy.iter() {\n\n gravitate(&mut a, &b);\n\n }\n\n }\n\n for i in 0..4 {\n\n apply_velocity(planets.get_mut(i).unwrap());\n\n }\n\n //println!(\"Cycle: {} Planets: {:?}\", cycle, planets);\n\n }\n\n planets.iter().map(|x| x.compute_energy()).sum()\n\n}\n\n\n","file_path":"src/day12.rs","rank":41,"score":90055.7630395193},{"content":"fn display_output(input: &[i64]) {\n\n for c in input {\n\n print!(\"{}\", (*c as u8) as char);\n\n }\n\n}\n\n\n\nconst SCAFFOLD: i64 = 35;\n\nconst SPACE: i64 = 46;\n\nconst NEW_LINE: i64 = 10;\n\n\n","file_path":"src/day17.rs","rank":42,"score":87327.72345621118},{"content":"fn to_index(i: i64) -> usize {\n\n i.try_into().unwrap()\n\n}\n\n\n\npub type Program = HashMap;\n\npub type Output = Vec;\n\n\n\npub enum IntCodeResult {\n\n Halt(Output),\n\n Input(i64, i64, Output),\n\n}\n\n\n","file_path":"src/intcode.rs","rank":43,"score":86933.60123765963},{"content":"fn parse_line(line: &str) -> Recipe {\n\n let captures = LINE_REGEX.captures(line).unwrap();\n\n let result = Ingredient {\n\n amount: captures[2].parse().unwrap(),\n\n name: captures[3].to_owned(),\n\n };\n\n let ingredients = captures[1]\n\n .split(\", \")\n\n .map(|element| {\n\n let captures = INGREDIENT_REGEX.captures(element).unwrap();\n\n Ingredient {\n\n amount: captures[1].parse().unwrap(),\n\n name: captures[2].to_owned(),\n\n }\n\n })\n\n .collect();\n\n Recipe {\n\n result,\n\n ingredients,\n\n }\n\n}\n\n\n","file_path":"src/day14.rs","rank":44,"score":84190.53324630817},{"content":"fn count_blocks(output: &[i64]) -> usize {\n\n let mut iter = output.iter();\n\n let mut blocks = HashSet::new();\n\n while let Some(x) = iter.next() {\n\n let y = iter.next().unwrap();\n\n let t = iter.next().unwrap();\n\n if *t == 2 {\n\n blocks.insert((x, y));\n\n }\n\n }\n\n blocks.len()\n\n}\n\n\n","file_path":"src/day13.rs","rank":46,"score":83185.25967224227},{"content":"fn find_move(screen: &Screen) -> i64 {\n\n let (ball_x, _) = screen.iter().find(|e| *e.1 == 4).unwrap_or((&(0, 0), &0)).0;\n\n let (paddle_x, _) = screen.iter().find(|e| *e.1 == 3).unwrap_or((&(0, 0), &0)).0;\n\n\n\n println!(\"B: {}, P:{}\", ball_x, paddle_x);\n\n\n\n match ball_x.cmp(paddle_x) {\n\n Ordering::Equal => 0,\n\n Ordering::Greater => 1,\n\n Ordering::Less => -1,\n\n }\n\n}\n\n\n","file_path":"src/day13.rs","rank":47,"score":83185.25967224227},{"content":"fn find_score(output: &[i64]) -> usize {\n\n let mut iter = output.iter();\n\n loop {\n\n if let Some(x) = iter.next() {\n\n let y = iter.next().unwrap();\n\n let score = iter.next().unwrap();\n\n if *x == -1 && *y == 0 {\n\n return *score as usize;\n\n }\n\n } else {\n\n return 0;\n\n }\n\n }\n\n}\n\n\n","file_path":"src/day13.rs","rank":48,"score":83185.25967224227},{"content":"fn get_location(input: &[i64], line_length: usize, x: usize, y: usize) -> i64 {\n\n let index = x + (y * line_length);\n\n //println!(\"Looking up {} {:?}\", index, input.get(index));\n\n *input.get(index).unwrap_or(&SPACE)\n\n}\n\n\n","file_path":"src/day17.rs","rank":49,"score":81993.6937454209},{"content":"fn find_line_length(input: &[i64]) -> usize {\n\n input.iter().take_while(|x| **x != NEW_LINE).count() + 1\n\n}\n\n\n","file_path":"src/day17.rs","rank":50,"score":81518.87548340633},{"content":"fn run_program(program: &mut [i32], input: i32) -> i32 {\n\n let mut pointer = 0;\n\n let mut output = 0;\n\n loop {\n\n let current_instruction = parse_instruction(program[to_index(pointer)]);\n\n //println!(\"Command {} {:?}\", pointer, current_instruction);\n\n let opcode = (current_instruction[3] * 10) + current_instruction[4];\n\n match opcode {\n\n 1 => {\n\n let a = get_value(current_instruction[2], pointer + 1, program);\n\n let b = get_value(current_instruction[1], pointer + 2, program);\n\n let r = program[to_index(pointer + 3)];\n\n //println!(\"ADD {} + {} = {} WRITE TO {}\", a, b, a + b, r);\n\n program[to_index(r)] = a + b;\n\n pointer += 4;\n\n }\n\n 2 => {\n\n let a = get_value(current_instruction[2], pointer + 1, program);\n\n let b = get_value(current_instruction[1], pointer + 2, program);\n\n let r = program[to_index(pointer + 3)];\n","file_path":"src/day5.rs","rank":51,"score":81395.83658578424},{"content":"fn parse_points(raw_points: &str) -> Vec {\n\n raw_points.split(',').map(|s| s.to_owned()).collect()\n\n}\n\n\n","file_path":"src/day3.rs","rank":52,"score":78828.84947398944},{"content":"fn count_orbits(o: &str, orbits: &Orbits) -> i32 {\n\n if let Some(o) = orbits.get(o) {\n\n 1 + count_orbits(o, orbits)\n\n } else {\n\n 0\n\n }\n\n}\n\n\n","file_path":"src/day6.rs","rank":53,"score":78488.7488239583},{"content":"#[aoc(day2, part2)]\n\npub fn solve_part2(input: &[usize]) -> usize {\n\n for (i, j) in iproduct!(0..99, 0..99) {\n\n let mut input_copy = input.to_owned();\n\n input_copy[1] = i;\n\n input_copy[2] = j;\n\n run_program(&mut input_copy);\n\n if input_copy[0] == 19_690_720 {\n\n return (i * 100) + j;\n\n }\n\n }\n\n panic!(\"Unable to find answer\")\n\n}\n","file_path":"src/day2.rs","rank":54,"score":77423.34550653334},{"content":"#[aoc(day4, part2)]\n\npub fn solve_part2(input: &[i32]) -> usize {\n\n let low = input.get(0).unwrap();\n\n let high = input.get(1).unwrap();\n\n (*low..*high)\n\n .map(split_number)\n\n .filter(|x| check_long_pairs(x))\n\n .filter(|x| check_ascending(x))\n\n .count()\n\n}\n","file_path":"src/day4.rs","rank":55,"score":77423.34550653334},{"content":"#[aoc(day1, part1)]\n\npub fn solve_part1(input: &[i32]) -> i32 {\n\n input.iter().map(|n| (n / 3) - 2).sum()\n\n}\n\n\n","file_path":"src/day1.rs","rank":56,"score":77423.34550653334},{"content":"#[aoc(day4, part1)]\n\npub fn solve_part1(input: &[i32]) -> usize {\n\n let low = input.get(0).unwrap();\n\n let high = input.get(1).unwrap();\n\n (*low..*high)\n\n .map(split_number)\n\n .filter(|x| check_pairs(x))\n\n .filter(|x| check_ascending(x))\n\n .count()\n\n}\n\n\n","file_path":"src/day4.rs","rank":57,"score":77423.34550653334},{"content":"#[aoc(day5, part2)]\n\npub fn solve_part2(input: &[i32]) -> i32 {\n\n let mut input = input.to_owned();\n\n run_program(&mut input, 5)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn example1() {\n\n let input = \"3,0,4,0,99\";\n\n assert_eq!(solve_part1(&input_generator(&input)), 1);\n\n }\n\n\n\n #[test]\n\n fn example2() {\n\n let input = \"3,9,8,9,10,9,4,9,99,-1,8\";\n\n assert_eq!(run_program(&mut input_generator(&input), 8), 1);\n\n assert_eq!(run_program(&mut input_generator(&input), 7), 0);\n","file_path":"src/day5.rs","rank":58,"score":77423.34550653334},{"content":"#[aoc(day5, part1)]\n\npub fn solve_part1(input: &[i32]) -> i32 {\n\n let mut input = input.to_owned();\n\n run_program(&mut input, 1)\n\n}\n\n\n","file_path":"src/day5.rs","rank":59,"score":77423.34550653334},{"content":"pub fn solve_part2(input: &[i32]) -> i32 {\n\n let series = (5..10).collect::>();\n\n permutations_of(&series)\n\n .map(|x| run_series_2(input.to_owned(), x))\n\n .max()\n\n .unwrap()\n\n}\n","file_path":"src/day7.rs","rank":60,"score":77423.34550653334},{"content":"#[aoc(day1, part2)]\n\npub fn solve_part2(input: &[i32]) -> i32 {\n\n input.iter().map(|n| (n / 3) - 2).map(add_extra_fuel).sum()\n\n}\n","file_path":"src/day1.rs","rank":61,"score":77423.34550653334},{"content":"#[aoc(day12, part2)]\n\npub fn solve_part2(input: &Coord) -> usize {\n\n let mut planets = input.to_owned();\n\n let mut counter = 0;\n\n let mut x_cycles = HashMap::new();\n\n let mut y_cycles = HashMap::new();\n\n let mut z_cycles = HashMap::new();\n\n loop {\n\n let p_copy = planets.to_owned();\n\n for mut a in planets.iter_mut() {\n\n for b in p_copy.iter() {\n\n gravitate(&mut a, &b);\n\n }\n\n }\n\n for i in 0..4 {\n\n apply_velocity(planets.get_mut(i).unwrap());\n\n }\n\n counter += 1;\n\n check_for_periods(&mut x_cycles, input, &planets, 0, counter);\n\n check_for_periods(&mut y_cycles, input, &planets, 1, counter);\n\n check_for_periods(&mut z_cycles, input, &planets, 2, counter);\n","file_path":"src/day12.rs","rank":62,"score":77423.34550653334},{"content":"#[aoc(day8, part2)]\n\npub fn solve_part2(input: &[i32]) -> usize {\n\n let layer_size = 6 * 25;\n\n let layer_count = input.len() / layer_size;\n\n\n\n println!();\n\n\n\n for x in 0..layer_size {\n\n let pixel = gen_pixel(input, x, layer_size, layer_count);\n\n\n\n if pixel == 1 {\n\n print!(\"{}\", pixel);\n\n } else {\n\n print!(\" \");\n\n }\n\n if (x + 1) % 25 == 0 {\n\n println!();\n\n }\n\n }\n\n println!();\n\n 0\n\n}\n","file_path":"src/day8.rs","rank":63,"score":77423.34550653334},{"content":"#[aoc(day6, part1)]\n\npub fn solve_part1(input: &Orbits) -> i32 {\n\n let mut orbit_count = 0;\n\n for k in input.keys() {\n\n orbit_count += count_orbits(k, input);\n\n }\n\n orbit_count\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn example1() {\n\n let input = \"COM)B\\nB)C\\nC)D\\nD)E\\nE)F\\nB)G\\nG)H\\nD)I\\nE)J\\nJ)K\\nK)L\";\n\n assert_eq!(solve_part1(&input_generator(&input)), 42);\n\n }\n\n}\n","file_path":"src/day6.rs","rank":64,"score":77423.34550653334},{"content":"#[aoc(day2, part1)]\n\npub fn solve_part1(input: &[usize]) -> usize {\n\n let mut input = input.to_owned();\n\n input[1] = 12;\n\n input[2] = 2;\n\n\n\n run_program(&mut input);\n\n input[0]\n\n}\n\n\n","file_path":"src/day2.rs","rank":65,"score":77423.34550653334},{"content":"#[aoc(day8, part1)]\n\npub fn solve_part1(input: &[i32]) -> usize {\n\n let input = input.to_owned();\n\n let mut layers = Vec::new();\n\n let layer_size = 6 * 25;\n\n let layer_count = input.len() / layer_size;\n\n for x in 0..layer_count {\n\n let start = x * layer_size;\n\n layers.push(&input[start..start + layer_size]);\n\n }\n\n layers.sort_by(compare_images);\n\n let biggest = layers.first().unwrap();\n\n let ones = biggest.iter().filter(|x| **x == 1).count();\n\n let twos = biggest.iter().filter(|x| **x == 2).count();\n\n\n\n ones * twos\n\n}\n\n\n","file_path":"src/day8.rs","rank":66,"score":77423.34550653334},{"content":"fn render_screen(screen: &mut Screen, output: &[i64]) {\n\n let mut iter = output.iter();\n\n\n\n while let Some(x) = iter.next() {\n\n let y = iter.next().unwrap();\n\n let block_type = iter.next().unwrap();\n\n screen.insert((*x, *y), *block_type);\n\n }\n\n\n\n let max_x = screen.keys().map(|k| k.0).max().unwrap();\n\n let max_y = screen.keys().map(|k| k.1).max().unwrap();\n\n\n\n println!(\"Max X: {} Max Y: {}\", max_x, max_y);\n\n\n\n for y in 0..=19 {\n\n for x in 0..=36 {\n\n if let Some(block_type) = screen.get(&(x, y)) {\n\n match block_type {\n\n 0 => print!(\" \"),\n\n 1 => print!(\"W\"),\n","file_path":"src/day13.rs","rank":67,"score":76015.10037599536},{"content":"#[aoc(day16, part1)]\n\npub fn solve_part_1(input: &Vec) -> i32 {\n\n let result = (0..100).fold(input.clone(), |acc, _| process(&acc));\n\n let answer: String = result.iter().take(8).map(|d| format!(\"{}\", d)).collect();\n\n\n\n answer.parse().unwrap()\n\n}\n\n\n","file_path":"src/day16.rs","rank":68,"score":74098.44547183359},{"content":"#[aoc(day16, part2)]\n\npub fn solve_part_2(input: &Vec) -> i32 {\n\n let input: Vec = input\n\n .iter()\n\n .cycle()\n\n .take(input.len() * 10000)\n\n .cloned()\n\n .collect();\n\n\n\n let result = (0..100).fold(input, |acc, i| {\n\n println!(\"Processing: {}\", i);\n\n process(&acc)\n\n });\n\n let offset: usize = result\n\n .iter()\n\n .take(7)\n\n .map(|d| format!(\"{}\", d))\n\n .collect::()\n\n .parse()\n\n .unwrap();\n\n\n","file_path":"src/day16.rs","rank":69,"score":74098.44547183359},{"content":"fn compute_ore(cook_book: &[Recipe], shopping_list: &Pantry) -> i64 {\n\n println!(\"Shopping List: {:?}\", shopping_list);\n\n let mut ore_needed = 0;\n\n for (ingredient_name, amount) in shopping_list {\n\n let recipe = cook_book\n\n .iter()\n\n .find(|r| *ingredient_name == r.result.name)\n\n .unwrap();\n\n\n\n let ore_ingredient = recipe.ingredients.get(0).unwrap();\n\n let batches = if 0 == amount % recipe.result.amount {\n\n amount / recipe.result.amount\n\n } else {\n\n (amount / recipe.result.amount) + 1\n\n };\n\n\n\n ore_needed += batches * ore_ingredient.amount;\n\n }\n\n ore_needed\n\n}\n\n\n","file_path":"src/day14.rs","rank":70,"score":73228.79891253781},{"content":"#[aoc(day3, part1)]\n\npub fn solve_part1(input: &[(DistanceMap, PointSet)]) -> i32 {\n\n let (_, wire_a) = &input[0];\n\n let (_, wire_b) = &input[1];\n\n wire_a\n\n .intersection(wire_b)\n\n .map(|x| calc_distance(*x))\n\n .min()\n\n .unwrap()\n\n}\n\n\n","file_path":"src/day3.rs","rank":71,"score":71358.91747423785},{"content":"#[aoc(day3, part2)]\n\npub fn solve_part2(input: &[(DistanceMap, PointSet)]) -> i32 {\n\n let (distance_a, wire_a) = &input[0];\n\n let (distance_b, wire_b) = &input[1];\n\n wire_a\n\n .intersection(wire_b)\n\n .map(|p| calc_distance_2(&distance_a, &distance_b, *p))\n\n .min()\n\n .unwrap()\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn example1() {\n\n let input = \"R75,D30,R83,U83,L12,D49,R71,U7,L72\\nU62,R66,U55,R34,D71,R55,D58,R83\";\n\n assert_eq!(solve_part1(&input_generator(&input)), 159);\n\n }\n\n\n","file_path":"src/day3.rs","rank":72,"score":71358.91747423785},{"content":"fn get_value(value_type: i32, i: i32, program: &[i32]) -> i32 {\n\n if value_type == 1 {\n\n //println!(\"Direct {}\", i);\n\n program[to_index(i)]\n\n } else {\n\n let lookup_index = to_index(program[to_index(i)]);\n\n //println!(\"Indirect {} -> {}\", i, lookup_index);\n\n program[lookup_index]\n\n }\n\n}\n\n\n","file_path":"src/day5.rs","rank":73,"score":70210.20142760783},{"content":"type Screen = HashMap<(i64, i64), i64>;\n\n\n","file_path":"src/day13.rs","rank":74,"score":69479.40392585115},{"content":"fn is_intersection(input: &[i64], line_length: usize, x: usize, y: usize) -> bool {\n\n get_location(input, line_length, x, y) == SCAFFOLD\n\n && get_location(input, line_length, x + 1, y) == SCAFFOLD\n\n && get_location(input, line_length, x - 1, y) == SCAFFOLD\n\n && get_location(input, line_length, x, y + 1) == SCAFFOLD\n\n && get_location(input, line_length, x, y - 1) == SCAFFOLD\n\n}\n\n\n","file_path":"src/day17.rs","rank":75,"score":67357.63139496234},{"content":"#[derive(Debug, Copy, Clone)]\n\nenum Action {\n\n Keep,\n\n Negate,\n\n Drop,\n\n}\n\n\n","file_path":"src/day16.rs","rank":78,"score":61079.716976992095},{"content":"fn build_points(directions: Vec) -> (DistanceMap, HashSet<(i32, i32)>) {\n\n let mut current_location = (0, 0);\n\n let mut points = HashSet::new();\n\n let mut distance = HashMap::new();\n\n let mut counter = 0;\n\n for direction in directions {\n\n let d = &direction[..1];\n\n let n = direction[1..].parse::().unwrap();\n\n let (xo, yo) = match d {\n\n \"R\" => (1, 0),\n\n \"D\" => (0, -1),\n\n \"U\" => (0, 1),\n\n \"L\" => (-1, 0),\n\n _ => panic!(\"Unknown direction {}\", d),\n\n };\n\n for _ in 0..n {\n\n counter += 1;\n\n let (x1, y1) = current_location;\n\n let new_location = (x1 + xo, y1 + yo);\n\n current_location = new_location;\n\n points.insert(new_location);\n\n update_distance(&mut distance, new_location, counter);\n\n }\n\n }\n\n (distance, points)\n\n}\n\n\n","file_path":"src/day3.rs","rank":80,"score":48784.77817664684},{"content":"type Pantry = HashMap;\n\n\n","file_path":"src/day14.rs","rank":81,"score":48550.99016500078},{"content":"fn run_series_2<'a>(_program: Vec, _series: impl Iterator- ) -> i32 {\n\n 0\n\n}\n\n\n","file_path":"src/day7.rs","rank":82,"score":46260.41045539006},{"content":"fn check_for_periods(\n\n periods: &mut HashMap
,\n\n original: &Coord,\n\n current: &Coord,\n\n dimension: usize,\n\n cycle: i64,\n\n) {\n\n for (i, x) in original.iter().enumerate() {\n\n if let Entry::Vacant(v) = periods.entry(i) {\n\n let body = current.get(i).unwrap();\n\n if x.position[dimension] == body.position[dimension] && body.velocity[dimension] == 0 {\n\n // println!(\n\n // \"Found cycle for {:?} {} on cycle: {}\",\n\n // current.get(i).unwrap(),\n\n // dimension,\n\n // cycle\n\n // );\n\n v.insert(cycle);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/day12.rs","rank":83,"score":40265.76963656088},{"content":"fn find_needed_ore(\n\n cook_book: &[Recipe],\n\n shopping_list: &mut Pantry,\n\n pantry: &mut Pantry,\n\n recipe: &Recipe,\n\n amount: i64,\n\n) {\n\n let amount = match pantry.entry(recipe.result.name.clone()) {\n\n Entry::Occupied(mut e) => {\n\n let store_amount = e.get_mut();\n\n if *store_amount > 0 {\n\n let new_amount = amount - *store_amount;\n\n println!(\n\n \"Taking from the store {} - {} = {}\",\n\n amount, store_amount, new_amount\n\n );\n\n *store_amount -= amount;\n\n new_amount\n\n } else {\n\n amount\n","file_path":"src/day14.rs","rank":84,"score":39297.303081897655},{"content":"fn to_index(i: i32) -> usize {\n\n i.try_into().unwrap()\n\n}\n\n\n","file_path":"src/day5.rs","rank":85,"score":36348.21695582779},{"content":"fn check_pairs(password: &[i8]) -> bool {\n\n (0..5).zip(1..6).any(|x| pair_test(password, &x))\n\n}\n\n\n","file_path":"src/day4.rs","rank":86,"score":34634.26950724149},{"content":"fn check_ascending(password: &[i8]) -> bool {\n\n password\n\n .iter()\n\n .scan(-1 as i8, |state, x| {\n\n if *state <= *x {\n\n *state = *x;\n\n Some(true)\n\n } else {\n\n Some(false)\n\n }\n\n })\n\n .all(|x| x)\n\n}\n\n\n","file_path":"src/day4.rs","rank":87,"score":34634.26950724149},{"content":"fn apply_velocity(planet: &mut Body) {\n\n for i in 0..3 {\n\n planet.position[i] += planet.velocity[i];\n\n }\n\n}\n\n\n\npub type Coord = [Body];\n\n//\n\n\n","file_path":"src/day12.rs","rank":88,"score":34634.26950724149},{"content":"fn lcm(a: usize, b: usize) -> usize {\n\n let div = gcd(a, b);\n\n (a / div) * b\n\n}\n\n\n","file_path":"src/day12.rs","rank":89,"score":34001.43295393142},{"content":"fn gcd(a: usize, b: usize) -> usize {\n\n let mut a = a;\n\n let mut b = b;\n\n while b != 0 {\n\n let t = b;\n\n b = a % b;\n\n a = t\n\n }\n\n a\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn example1() {\n\n let input = \"\";\n\n assert_eq!(\n\n generate_input(&input),\n","file_path":"src/day12.rs","rank":90,"score":34001.43295393142},{"content":"fn check_long_pairs(password: &[i8]) -> bool {\n\n let mut count = 1;\n\n let mut last = -1;\n\n\n\n for p in password {\n\n if last == *p {\n\n count += 1;\n\n } else {\n\n if count == 2 {\n\n return true;\n\n }\n\n count = 1;\n\n }\n\n last = *p;\n\n }\n\n count == 2\n\n}\n\n\n","file_path":"src/day4.rs","rank":91,"score":33872.30721565884},{"content":"fn add_extra_fuel(fuel: i32) -> i32 {\n\n let mut total_fuel = fuel;\n\n let mut current_fuel = fuel;\n\n loop {\n\n current_fuel = (current_fuel / 3) - 2;\n\n if current_fuel <= 0 {\n\n return total_fuel;\n\n }\n\n total_fuel += current_fuel;\n\n }\n\n}\n\n\n","file_path":"src/day1.rs","rank":92,"score":33872.30721565884},{"content":"fn calc_distance((x, y): (i32, i32)) -> i32 {\n\n //println!(\"Intersection: {} {} {}\", x, y, x.abs() + y.abs());\n\n x.abs() + y.abs()\n\n}\n\n\n","file_path":"src/day3.rs","rank":93,"score":33178.657372870715},{"content":"fn gravitate(planet: &mut Body, other: &Body) {\n\n for i in 0..3 {\n\n // println!(\n\n // \"Comparing {:?} {:?} {:?}\",\n\n // planet,\n\n // other,\n\n // planet.position[i].cmp(&other.position[i])\n\n // );\n\n match planet.position[i].cmp(&other.position[i]) {\n\n Ordering::Equal => {}\n\n Ordering::Greater => {\n\n planet.velocity[i] -= 1;\n\n }\n\n Ordering::Less => planet.velocity[i] += 1,\n\n }\n\n //println!(\"Compared {:?} {:?}\", planet, other);\n\n }\n\n}\n\n\n","file_path":"src/day12.rs","rank":94,"score":33178.657372870715},{"content":"fn split_number(password: i32) -> Vec {\n\n let str_number = format!(\"{}\", password);\n\n str_number\n\n .chars()\n\n .map(|c| c.to_digit(10).unwrap() as i8)\n\n .collect()\n\n}\n\n\n","file_path":"src/day4.rs","rank":95,"score":33104.63940170162},{"content":"fn parse_instruction(params: i32) -> Vec {\n\n format!(\"{:05}\", params)\n\n .chars()\n\n .map(|x| x.to_digit(10).unwrap() as i32)\n\n .collect()\n\n}\n\n\n","file_path":"src/day5.rs","rank":96,"score":33104.63940170162},{"content":"fn process(signal: &Vec) -> Vec {\n\n (0..signal.len())\n\n .map(|i| process_digit(signal, i + 1))\n\n .collect()\n\n}\n\n\n","file_path":"src/day16.rs","rank":97,"score":32416.69508128806},{"content":"fn compare_images(a: &&[i32], b: &&[i32]) -> std::cmp::Ordering {\n\n let a_ones = a.iter().filter(|x| **x == 0).count();\n\n let b_ones = b.iter().filter(|x| **x == 0).count();\n\n\n\n a_ones.cmp(&b_ones)\n\n}\n\n\n","file_path":"src/day8.rs","rank":98,"score":30527.32309009659},{"content":"fn process_digit(signal: &Vec, position: usize) -> i32 {\n\n let cycle = iter::repeat(Action::Drop)\n\n .take(position)\n\n .chain(iter::repeat(Action::Keep).take(position))\n\n .chain(iter::repeat(Action::Drop).take(position))\n\n .chain(iter::repeat(Action::Negate).take(position))\n\n .cycle()\n\n .skip(1);\n\n signal\n\n .iter()\n\n .zip(cycle)\n\n .map(|(n, action)| match action {\n\n Action::Keep => *n,\n\n Action::Negate => -n,\n\n Action::Drop => 0,\n\n })\n\n .sum::()\n\n .abs()\n\n % 10\n\n}\n\n\n","file_path":"src/day16.rs","rank":99,"score":30430.070500678463}],"string":"[\n {\n \"content\": \"#[aoc_generator(day19)]\\n\\npub fn input_generator(input: &str) -> Program {\\n\\n intcode::input_generator(input)\\n\\n}\\n\\n\\n\\n#[cached(\\n\\n convert = r#\\\"{format!(\\\"{},{}\\\",x,y)}\\\"#,\\n\\n create = \\\"{UnboundCache::new()}\\\",\\n\\n type = \\\"UnboundCache\\\"\\n\\n)]\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 0,\n \"score\": 171258.99464076897\n },\n {\n \"content\": \"#[aoc_generator(day13)]\\n\\npub fn input_generator(input: &str) -> Program {\\n\\n intcode::input_generator(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 1,\n \"score\": 171258.99464076897\n },\n {\n \"content\": \"#[aoc_generator(day9)]\\n\\npub fn input_generator(input: &str) -> Program {\\n\\n intcode::input_generator(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day9.rs\",\n \"rank\": 3,\n \"score\": 171258.99464076897\n },\n {\n \"content\": \"pub fn input_generator(input: &str) -> Program {\\n\\n input\\n\\n .split(',')\\n\\n .map(|d| d.parse::().unwrap())\\n\\n .enumerate()\\n\\n .fold(HashMap::new(), |mut acc, instruction| {\\n\\n let (index, instruction) = instruction;\\n\\n acc.insert(index, instruction);\\n\\n acc\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"109,1,204,-1,1001,100,1,100,1008,100,16,101,1006,101,0,99\\\";\\n\\n let expected = input\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 4,\n \"score\": 171258.99464076897\n },\n {\n \"content\": \"#[aoc_generator(day17)]\\n\\npub fn input_generator(input: &str) -> Program {\\n\\n intcode::input_generator(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 5,\n \"score\": 171258.99464076897\n },\n {\n \"content\": \"#[aoc(day9, part2)]\\n\\npub fn solve_part2(input: &Program) -> i64 {\\n\\n let mut input = input.to_owned();\\n\\n match run_program(&mut input, 0, 0, vec![2]) {\\n\\n IntCodeResult::Halt(output) => {\\n\\n println!(\\\"{:?}\\\", output);\\n\\n output[0]\\n\\n }\\n\\n _ => panic!(\\\"Not expecting more input\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/day9.rs\",\n \"rank\": 6,\n \"score\": 170302.0779835194\n },\n {\n \"content\": \"#[aoc(day9, part1)]\\n\\npub fn solve_part1(input: &Program) -> i64 {\\n\\n let mut input = input.to_owned();\\n\\n match run_program(&mut input, 0, 0, vec![1]) {\\n\\n IntCodeResult::Halt(output) => {\\n\\n println!(\\\"{:?}\\\", output);\\n\\n output[0]\\n\\n }\\n\\n _ => panic!(\\\"Not expecting more input\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day9.rs\",\n \"rank\": 7,\n \"score\": 170302.0779835194\n },\n {\n \"content\": \"#[aoc(day19, part2)]\\n\\npub fn solve_part2(input: &Program) -> i64 {\\n\\n for i in 1800 as i64.. {\\n\\n if i % 100 == 0 {\\n\\n println!(\\\"Round {}\\\", i);\\n\\n }\\n\\n for (x, y) in (0..=i).zip((0..=i).rev()) {\\n\\n //println!(\\\"Testing {} {}\\\", x, y);\\n\\n if check_box(input, x, y) {\\n\\n println!(\\\"Found it {} {}\\\", x, y);\\n\\n print_beam(\\n\\n input,\\n\\n 110,\\n\\n x - 5,\\n\\n y - 5,\\n\\n vec![(x, y), (x + 99, y), (x, y + 99)],\\n\\n );\\n\\n return x + (y * 10000);\\n\\n }\\n\\n }\\n\\n }\\n\\n -1\\n\\n}\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 8,\n \"score\": 170302.07798351944\n },\n {\n \"content\": \"#[aoc(day17, part2)]\\n\\npub fn solve_part2(input: &Program) -> i64 {\\n\\n let mut program = input.to_owned();\\n\\n program.insert(0, 2);\\n\\n let main_sequence = \\\"A,A,B,C,B,A,C,B,C,A\\\\n\\\".chars();\\n\\n let a_sequence = \\\"L,6,R,12,L,6,L,8,L,8\\\\n\\\".chars();\\n\\n let b_sequence = \\\"L,6,R,12,R,8,L,8\\\\n\\\".chars();\\n\\n let c_sequence = \\\"L,4,L,4,L,6\\\\n\\\".chars();\\n\\n let display = \\\"n\\\\n\\\".chars();\\n\\n\\n\\n let input: Vec = main_sequence\\n\\n .chain(a_sequence)\\n\\n .chain(b_sequence)\\n\\n .chain(c_sequence)\\n\\n .chain(display)\\n\\n .map(|x| x as i64)\\n\\n .rev()\\n\\n .collect();\\n\\n\\n\\n println!(\\\"INPUT: {:?}\\\", input);\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 9,\n \"score\": 170302.0779835194\n },\n {\n \"content\": \"#[aoc_generator(day7)]\\n\\npub fn input_generator(input: &str) -> intcode::Program {\\n\\n intcode::input_generator(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day7.rs\",\n \"rank\": 10,\n \"score\": 163835.81840905844\n },\n {\n \"content\": \"#[aoc(day7, part1)]\\n\\npub fn solve_part1(input: &intcode::Program) -> i64 {\\n\\n let series = (0..5).collect::>();\\n\\n permutations_of(&series)\\n\\n .map(|x| run_series(input.to_owned(), x))\\n\\n .max()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day7.rs\",\n \"rank\": 11,\n \"score\": 162922.6896054765\n },\n {\n \"content\": \"fn is_beam(program: &Program, x: i64, y: i64) -> bool {\\n\\n let mut program = program.to_owned();\\n\\n if let IntCodeResult::Halt(output) = run_program(&mut program, 0, 0, vec![x, y]) {\\n\\n 1 == *output.first().unwrap()\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 13,\n \"score\": 149156.95899622364\n },\n {\n \"content\": \"fn get_value(value_type: i64, i: i64, program: &Program, relative_base: i64) -> i64 {\\n\\n //println!(\\\"LOOKUP: {} {} {}\\\", value_type, i, relative_base);\\n\\n match value_type {\\n\\n 1 => *program.get(&to_index(i)).unwrap_or(&0),\\n\\n 2 => {\\n\\n let relative_offset = *program.get(&to_index(i)).unwrap_or(&0);\\n\\n // println!(\\n\\n // \\\"RELATIVE: {} {} {}\\\",\\n\\n // relative_base,\\n\\n // relative_offset,\\n\\n // relative_base + relative_offset\\n\\n // );\\n\\n\\n\\n *program\\n\\n .get(&to_index(relative_offset + relative_base))\\n\\n .unwrap_or(&0)\\n\\n }\\n\\n 0 => {\\n\\n let lookup_index = to_index(*program.get(&to_index(i)).unwrap_or(&0));\\n\\n *program.get(&lookup_index).unwrap_or(&0)\\n\\n }\\n\\n _ => panic!(\\\"Unknown value type: {}\\\", value_type),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 14,\n \"score\": 147416.03869879653\n },\n {\n \"content\": \"fn check_box(program: &Program, x: i64, y: i64) -> bool {\\n\\n is_beam(program, x, y) && is_beam(program, x + 99, y) && is_beam(program, x, y + 99)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 15,\n \"score\": 146906.46752341266\n },\n {\n \"content\": \"fn print_beam(program: &Program, size: i64, x: i64, y: i64, highlights: Vec<(i64, i64)>) {\\n\\n for x in x..=x + size {\\n\\n for y in y..=y + size {\\n\\n if highlights.contains(&(x, y)) && is_beam(program, x, y) {\\n\\n print!(\\\"1\\\");\\n\\n } else if highlights.contains(&(x, y)) && !is_beam(program, x, y) {\\n\\n print!(\\\"0\\\")\\n\\n } else if is_beam(program, x, y) {\\n\\n print!(\\\"x\\\");\\n\\n } else {\\n\\n print!(\\\".\\\");\\n\\n }\\n\\n }\\n\\n println!(\\\"\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 16,\n \"score\": 146355.53963968848\n },\n {\n \"content\": \"fn get_index(value_type: i64, i: i64, program: &Program, relative_base: i64) -> usize {\\n\\n match value_type {\\n\\n 2 => {\\n\\n let relative_offset = *program.get(&to_index(i)).unwrap_or(&0);\\n\\n // println!(\\n\\n // \\\"RELATIVE INDEX: {} {} {}\\\",\\n\\n // relative_base,\\n\\n // relative_offset,\\n\\n // relative_base + relative_offset\\n\\n // );\\n\\n to_index(relative_offset + relative_base)\\n\\n }\\n\\n 0 => to_index(*program.get(&to_index(i)).unwrap_or(&0)),\\n\\n _ => panic!(\\\"Unknown value type: {}\\\", value_type),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 17,\n \"score\": 141808.8948721147\n },\n {\n \"content\": \"fn run_series<'a>(program: intcode::Program, series: impl Iterator- ) -> i64 {\\n\\n let mut output = 0;\\n\\n for phase in series {\\n\\n match intcode::run_program(&mut program.clone(), 0, 0, vec![output, *phase]) {\\n\\n intcode::IntCodeResult::Halt(o) => output = o[0],\\n\\n intcode::IntCodeResult::Input(_, _, _) => (),\\n\\n }\\n\\n }\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day7.rs\",\n \"rank\": 18,\n \"score\": 130955.44746392296\n },\n {\n \"content\": \"#[aoc_generator(day6)]\\n\\npub fn input_generator(input: &str) -> Orbits {\\n\\n let mut nodes = HashMap::new();\\n\\n\\n\\n for x in input.lines() {\\n\\n let mut n = x.split(')');\\n\\n let node_a = n.next().unwrap().to_owned();\\n\\n let node_b = n.next().unwrap().to_owned();\\n\\n nodes.insert(node_b, node_a);\\n\\n }\\n\\n nodes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day6.rs\",\n \"rank\": 19,\n \"score\": 124708.07522320216\n },\n {\n \"content\": \"#[aoc(day17, part1)]\\n\\npub fn solve_part1(input: &Program) -> usize {\\n\\n let mut program = input.to_owned();\\n\\n let result = run_program(&mut program, 0, 0, vec![]);\\n\\n\\n\\n match result {\\n\\n IntCodeResult::Halt(output) => {\\n\\n display_output(&output);\\n\\n let line_length = find_line_length(&output);\\n\\n println!(\\\"Size: {}\\\", line_length);\\n\\n println!(\\n\\n \\\"First Line: {:?}\\\",\\n\\n output\\n\\n .iter()\\n\\n .take(line_length)\\n\\n .enumerate()\\n\\n .collect::
>()\\n\\n );\\n\\n\\n\\n let intersections = iproduct!(0..line_length, 0..(output.len() / line_length))\\n\\n .filter(move |(x, y)| is_intersection(&output, line_length, *x, *y))\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 21,\n \"score\": 123974.26492410013\n },\n {\n \"content\": \"#[aoc(day19, part1)]\\n\\npub fn solve_part1(input: &Program) -> usize {\\n\\n let mut beam = HashSet::new();\\n\\n\\n\\n for (x, y) in iproduct!(0..50 as i64, 0..50 as i64) {\\n\\n if is_beam(input, x, y) {\\n\\n beam.insert((x, y));\\n\\n }\\n\\n }\\n\\n beam.len()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day19.rs\",\n \"rank\": 22,\n \"score\": 123974.26492410013\n },\n {\n \"content\": \"#[aoc(day13, part1)]\\n\\npub fn solve_part1(input: &Program) -> usize {\\n\\n let mut input = input.to_owned();\\n\\n match run_program(&mut input, 0, 0, vec![1]) {\\n\\n IntCodeResult::Halt(output) => {\\n\\n println!(\\\"{:?} {}\\\", output, output.len());\\n\\n count_blocks(&output)\\n\\n }\\n\\n _ => panic!(\\\"Not expecting more input\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 23,\n \"score\": 123974.26492410013\n },\n {\n \"content\": \"#[aoc(day13, part2)]\\n\\npub fn solve_part2(input: &Program) -> usize {\\n\\n let mut input = input.to_owned();\\n\\n input.insert(0, 2);\\n\\n let mut pointer = 0;\\n\\n let mut relative_index = 0;\\n\\n let mut counter = 0;\\n\\n let mut screen = HashMap::new();\\n\\n\\n\\n loop {\\n\\n let joystick = find_move(&screen);\\n\\n println!(\\\"Move {} --> joystick {}\\\", counter, joystick);\\n\\n\\n\\n match run_program(&mut input, pointer, relative_index, vec![joystick]) {\\n\\n IntCodeResult::Halt(output) => {\\n\\n if 0 != count_blocks(&output) {\\n\\n println!(\\\"Hmm, expected no blocks... found {}\\\", count_blocks(&output));\\n\\n }\\n\\n render_screen(&mut screen, &output);\\n\\n return find_score(&output);\\n\\n }\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 24,\n \"score\": 123974.26492410012\n },\n {\n \"content\": \"#[aoc(day14, part1)]\\n\\npub fn solve_part1(input: &[Recipe]) -> i64 {\\n\\n let fuel_recipe = input.iter().find(|r| r.result.name == \\\"FUEL\\\").unwrap();\\n\\n let mut shopping_list = HashMap::new();\\n\\n let mut pantry = HashMap::new();\\n\\n find_needed_ore(input, &mut shopping_list, &mut pantry, fuel_recipe, 1);\\n\\n compute_ore(input, &shopping_list)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"10 ORE => 10 A\\\\n1 ORE => 1 B\\\\n7 A, 1 B => 1 C\\\\n7 A, 1 C => 1 D\\\\n7 A, 1 D => 1 E\\\\n7 A, 1 E => 1 FUEL\\\";\\n\\n let result = solve_part1(&generate_input(&input));\\n\\n assert_eq!(\\n\\n result, 31,\\n\\n \\\"Expected fuel consumption to be 31 but got {}\\\",\\n\\n result\\n\\n );\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 26,\n \"score\": 123751.15856595262\n },\n {\n \"content\": \"#[aoc(day12, part1)]\\n\\npub fn solve_part1(input: &Coord) -> i64 {\\n\\n let mut planets = input.to_owned();\\n\\n process(1000, &mut planets)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 27,\n \"score\": 123751.15856595262\n },\n {\n \"content\": \"#[aoc_generator(day4)]\\n\\npub fn input_generator(input: &str) -> Vec {\\n\\n input\\n\\n .split('-')\\n\\n .map(|x| x.parse::().unwrap())\\n\\n .collect::>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 28,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day8)]\\n\\npub fn input_generator(input: &str) -> Vec {\\n\\n input\\n\\n .chars()\\n\\n .map(|x| x.to_digit(10).unwrap() as i32)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day8.rs\",\n \"rank\": 29,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day16)]\\n\\npub fn generate_input(input: &str) -> Vec {\\n\\n input\\n\\n .trim()\\n\\n .chars()\\n\\n .map(|c| c.to_digit(10).unwrap() as i32)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 30,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day1)]\\n\\npub fn input_generator(input: &str) -> Vec {\\n\\n input.lines().map(|s| s.parse::().unwrap()).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day1.rs\",\n \"rank\": 31,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day5)]\\n\\npub fn input_generator(input: &str) -> Vec {\\n\\n input\\n\\n .split(',')\\n\\n .map(|d| d.parse::().unwrap())\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 32,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day14)]\\n\\npub fn generate_input(input: &str) -> Vec {\\n\\n input.lines().map(parse_line).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 33,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day2)]\\n\\npub fn input_generator(input: &str) -> Vec {\\n\\n input\\n\\n .split(',')\\n\\n .map(|d| d.parse::().unwrap())\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day2.rs\",\n \"rank\": 34,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"#[aoc_generator(day12)]\\n\\npub fn generate_input(input: &str) -> Vec {\\n\\n let reg = Regex::new(r\\\"^$\\\").unwrap();\\n\\n\\n\\n input\\n\\n .lines()\\n\\n .map(|l| {\\n\\n let matches = reg.captures(l).unwrap();\\n\\n let position = [\\n\\n matches[1].parse::().unwrap(),\\n\\n matches[2].parse::().unwrap(),\\n\\n matches[3].parse::().unwrap(),\\n\\n ];\\n\\n Body {\\n\\n position,\\n\\n ..Default::default()\\n\\n }\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 35,\n \"score\": 119317.63056453102\n },\n {\n \"content\": \"pub fn run_program(\\n\\n program: &mut Program,\\n\\n pointer: i64,\\n\\n relative_base: i64,\\n\\n mut input: Vec,\\n\\n) -> IntCodeResult {\\n\\n let mut pointer = pointer;\\n\\n let mut output = Vec::new();\\n\\n let mut relative_base = relative_base;\\n\\n loop {\\n\\n let current_instruction = parse_instruction(program[&to_index(pointer)]);\\n\\n // println!(\\n\\n // \\\"Command {} {} {:?}\\\",\\n\\n // pointer, relative_base, current_instruction\\n\\n // );\\n\\n let opcode = (current_instruction[3] * 10) + current_instruction[4];\\n\\n match opcode {\\n\\n 1 => {\\n\\n let a = get_value(current_instruction[2], pointer + 1, program, relative_base);\\n\\n let b = get_value(current_instruction[1], pointer + 2, program, relative_base);\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 36,\n \"score\": 116124.53871987731\n },\n {\n \"content\": \"#[aoc_generator(day3)]\\n\\npub fn input_generator(input: &str) -> Vec<(DistanceMap, PointSet)> {\\n\\n input\\n\\n .lines()\\n\\n .map(|x| parse_points(x))\\n\\n .map(build_points)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 37,\n \"score\": 110393.35485309093\n },\n {\n \"content\": \"fn parse_instruction(params: i64) -> Vec {\\n\\n format!(\\\"{:05}\\\", params)\\n\\n .chars()\\n\\n .map(|x| x.to_digit(10).unwrap() as i64)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 38,\n \"score\": 94864.36176435329\n },\n {\n \"content\": \"fn run_program(program: &mut [usize]) {\\n\\n let mut pointer = 0;\\n\\n loop {\\n\\n let current_instruction = program[pointer];\\n\\n match current_instruction {\\n\\n 1 => {\\n\\n let pos_a = program[pointer + 1];\\n\\n let pos_b = program[pointer + 2];\\n\\n let result = program[pointer + 3];\\n\\n program[result] = program[pos_a] + program[pos_b];\\n\\n }\\n\\n 2 => {\\n\\n let pos_a = program[pointer + 1];\\n\\n let pos_b = program[pointer + 2];\\n\\n let result = program[pointer + 3];\\n\\n program[result] = program[pos_a] * program[pos_b];\\n\\n }\\n\\n 99 => return,\\n\\n _ => {}\\n\\n };\\n\\n pointer += 4;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day2.rs\",\n \"rank\": 39,\n \"score\": 91513.70386502016\n },\n {\n \"content\": \"fn process(cycles: i64, planets: &mut Coord) -> i64 {\\n\\n //println!(\\\"Cycle: 0 Planets: {:?}\\\", planets);\\n\\n for _cycle in 0..cycles {\\n\\n let p_copy = planets.to_owned();\\n\\n for mut a in planets.iter_mut() {\\n\\n for b in p_copy.iter() {\\n\\n gravitate(&mut a, &b);\\n\\n }\\n\\n }\\n\\n for i in 0..4 {\\n\\n apply_velocity(planets.get_mut(i).unwrap());\\n\\n }\\n\\n //println!(\\\"Cycle: {} Planets: {:?}\\\", cycle, planets);\\n\\n }\\n\\n planets.iter().map(|x| x.compute_energy()).sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 41,\n \"score\": 90055.7630395193\n },\n {\n \"content\": \"fn display_output(input: &[i64]) {\\n\\n for c in input {\\n\\n print!(\\\"{}\\\", (*c as u8) as char);\\n\\n }\\n\\n}\\n\\n\\n\\nconst SCAFFOLD: i64 = 35;\\n\\nconst SPACE: i64 = 46;\\n\\nconst NEW_LINE: i64 = 10;\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 42,\n \"score\": 87327.72345621118\n },\n {\n \"content\": \"fn to_index(i: i64) -> usize {\\n\\n i.try_into().unwrap()\\n\\n}\\n\\n\\n\\npub type Program = HashMap;\\n\\npub type Output = Vec;\\n\\n\\n\\npub enum IntCodeResult {\\n\\n Halt(Output),\\n\\n Input(i64, i64, Output),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 43,\n \"score\": 86933.60123765963\n },\n {\n \"content\": \"fn parse_line(line: &str) -> Recipe {\\n\\n let captures = LINE_REGEX.captures(line).unwrap();\\n\\n let result = Ingredient {\\n\\n amount: captures[2].parse().unwrap(),\\n\\n name: captures[3].to_owned(),\\n\\n };\\n\\n let ingredients = captures[1]\\n\\n .split(\\\", \\\")\\n\\n .map(|element| {\\n\\n let captures = INGREDIENT_REGEX.captures(element).unwrap();\\n\\n Ingredient {\\n\\n amount: captures[1].parse().unwrap(),\\n\\n name: captures[2].to_owned(),\\n\\n }\\n\\n })\\n\\n .collect();\\n\\n Recipe {\\n\\n result,\\n\\n ingredients,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 44,\n \"score\": 84190.53324630817\n },\n {\n \"content\": \"fn count_blocks(output: &[i64]) -> usize {\\n\\n let mut iter = output.iter();\\n\\n let mut blocks = HashSet::new();\\n\\n while let Some(x) = iter.next() {\\n\\n let y = iter.next().unwrap();\\n\\n let t = iter.next().unwrap();\\n\\n if *t == 2 {\\n\\n blocks.insert((x, y));\\n\\n }\\n\\n }\\n\\n blocks.len()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 46,\n \"score\": 83185.25967224227\n },\n {\n \"content\": \"fn find_move(screen: &Screen) -> i64 {\\n\\n let (ball_x, _) = screen.iter().find(|e| *e.1 == 4).unwrap_or((&(0, 0), &0)).0;\\n\\n let (paddle_x, _) = screen.iter().find(|e| *e.1 == 3).unwrap_or((&(0, 0), &0)).0;\\n\\n\\n\\n println!(\\\"B: {}, P:{}\\\", ball_x, paddle_x);\\n\\n\\n\\n match ball_x.cmp(paddle_x) {\\n\\n Ordering::Equal => 0,\\n\\n Ordering::Greater => 1,\\n\\n Ordering::Less => -1,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 47,\n \"score\": 83185.25967224227\n },\n {\n \"content\": \"fn find_score(output: &[i64]) -> usize {\\n\\n let mut iter = output.iter();\\n\\n loop {\\n\\n if let Some(x) = iter.next() {\\n\\n let y = iter.next().unwrap();\\n\\n let score = iter.next().unwrap();\\n\\n if *x == -1 && *y == 0 {\\n\\n return *score as usize;\\n\\n }\\n\\n } else {\\n\\n return 0;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 48,\n \"score\": 83185.25967224227\n },\n {\n \"content\": \"fn get_location(input: &[i64], line_length: usize, x: usize, y: usize) -> i64 {\\n\\n let index = x + (y * line_length);\\n\\n //println!(\\\"Looking up {} {:?}\\\", index, input.get(index));\\n\\n *input.get(index).unwrap_or(&SPACE)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 49,\n \"score\": 81993.6937454209\n },\n {\n \"content\": \"fn find_line_length(input: &[i64]) -> usize {\\n\\n input.iter().take_while(|x| **x != NEW_LINE).count() + 1\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 50,\n \"score\": 81518.87548340633\n },\n {\n \"content\": \"fn run_program(program: &mut [i32], input: i32) -> i32 {\\n\\n let mut pointer = 0;\\n\\n let mut output = 0;\\n\\n loop {\\n\\n let current_instruction = parse_instruction(program[to_index(pointer)]);\\n\\n //println!(\\\"Command {} {:?}\\\", pointer, current_instruction);\\n\\n let opcode = (current_instruction[3] * 10) + current_instruction[4];\\n\\n match opcode {\\n\\n 1 => {\\n\\n let a = get_value(current_instruction[2], pointer + 1, program);\\n\\n let b = get_value(current_instruction[1], pointer + 2, program);\\n\\n let r = program[to_index(pointer + 3)];\\n\\n //println!(\\\"ADD {} + {} = {} WRITE TO {}\\\", a, b, a + b, r);\\n\\n program[to_index(r)] = a + b;\\n\\n pointer += 4;\\n\\n }\\n\\n 2 => {\\n\\n let a = get_value(current_instruction[2], pointer + 1, program);\\n\\n let b = get_value(current_instruction[1], pointer + 2, program);\\n\\n let r = program[to_index(pointer + 3)];\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 51,\n \"score\": 81395.83658578424\n },\n {\n \"content\": \"fn parse_points(raw_points: &str) -> Vec {\\n\\n raw_points.split(',').map(|s| s.to_owned()).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 52,\n \"score\": 78828.84947398944\n },\n {\n \"content\": \"fn count_orbits(o: &str, orbits: &Orbits) -> i32 {\\n\\n if let Some(o) = orbits.get(o) {\\n\\n 1 + count_orbits(o, orbits)\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day6.rs\",\n \"rank\": 53,\n \"score\": 78488.7488239583\n },\n {\n \"content\": \"#[aoc(day2, part2)]\\n\\npub fn solve_part2(input: &[usize]) -> usize {\\n\\n for (i, j) in iproduct!(0..99, 0..99) {\\n\\n let mut input_copy = input.to_owned();\\n\\n input_copy[1] = i;\\n\\n input_copy[2] = j;\\n\\n run_program(&mut input_copy);\\n\\n if input_copy[0] == 19_690_720 {\\n\\n return (i * 100) + j;\\n\\n }\\n\\n }\\n\\n panic!(\\\"Unable to find answer\\\")\\n\\n}\\n\",\n \"file_path\": \"src/day2.rs\",\n \"rank\": 54,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day4, part2)]\\n\\npub fn solve_part2(input: &[i32]) -> usize {\\n\\n let low = input.get(0).unwrap();\\n\\n let high = input.get(1).unwrap();\\n\\n (*low..*high)\\n\\n .map(split_number)\\n\\n .filter(|x| check_long_pairs(x))\\n\\n .filter(|x| check_ascending(x))\\n\\n .count()\\n\\n}\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 55,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day1, part1)]\\n\\npub fn solve_part1(input: &[i32]) -> i32 {\\n\\n input.iter().map(|n| (n / 3) - 2).sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day1.rs\",\n \"rank\": 56,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day4, part1)]\\n\\npub fn solve_part1(input: &[i32]) -> usize {\\n\\n let low = input.get(0).unwrap();\\n\\n let high = input.get(1).unwrap();\\n\\n (*low..*high)\\n\\n .map(split_number)\\n\\n .filter(|x| check_pairs(x))\\n\\n .filter(|x| check_ascending(x))\\n\\n .count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 57,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day5, part2)]\\n\\npub fn solve_part2(input: &[i32]) -> i32 {\\n\\n let mut input = input.to_owned();\\n\\n run_program(&mut input, 5)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"3,0,4,0,99\\\";\\n\\n assert_eq!(solve_part1(&input_generator(&input)), 1);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn example2() {\\n\\n let input = \\\"3,9,8,9,10,9,4,9,99,-1,8\\\";\\n\\n assert_eq!(run_program(&mut input_generator(&input), 8), 1);\\n\\n assert_eq!(run_program(&mut input_generator(&input), 7), 0);\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 58,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day5, part1)]\\n\\npub fn solve_part1(input: &[i32]) -> i32 {\\n\\n let mut input = input.to_owned();\\n\\n run_program(&mut input, 1)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 59,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"pub fn solve_part2(input: &[i32]) -> i32 {\\n\\n let series = (5..10).collect::>();\\n\\n permutations_of(&series)\\n\\n .map(|x| run_series_2(input.to_owned(), x))\\n\\n .max()\\n\\n .unwrap()\\n\\n}\\n\",\n \"file_path\": \"src/day7.rs\",\n \"rank\": 60,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day1, part2)]\\n\\npub fn solve_part2(input: &[i32]) -> i32 {\\n\\n input.iter().map(|n| (n / 3) - 2).map(add_extra_fuel).sum()\\n\\n}\\n\",\n \"file_path\": \"src/day1.rs\",\n \"rank\": 61,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day12, part2)]\\n\\npub fn solve_part2(input: &Coord) -> usize {\\n\\n let mut planets = input.to_owned();\\n\\n let mut counter = 0;\\n\\n let mut x_cycles = HashMap::new();\\n\\n let mut y_cycles = HashMap::new();\\n\\n let mut z_cycles = HashMap::new();\\n\\n loop {\\n\\n let p_copy = planets.to_owned();\\n\\n for mut a in planets.iter_mut() {\\n\\n for b in p_copy.iter() {\\n\\n gravitate(&mut a, &b);\\n\\n }\\n\\n }\\n\\n for i in 0..4 {\\n\\n apply_velocity(planets.get_mut(i).unwrap());\\n\\n }\\n\\n counter += 1;\\n\\n check_for_periods(&mut x_cycles, input, &planets, 0, counter);\\n\\n check_for_periods(&mut y_cycles, input, &planets, 1, counter);\\n\\n check_for_periods(&mut z_cycles, input, &planets, 2, counter);\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 62,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day8, part2)]\\n\\npub fn solve_part2(input: &[i32]) -> usize {\\n\\n let layer_size = 6 * 25;\\n\\n let layer_count = input.len() / layer_size;\\n\\n\\n\\n println!();\\n\\n\\n\\n for x in 0..layer_size {\\n\\n let pixel = gen_pixel(input, x, layer_size, layer_count);\\n\\n\\n\\n if pixel == 1 {\\n\\n print!(\\\"{}\\\", pixel);\\n\\n } else {\\n\\n print!(\\\" \\\");\\n\\n }\\n\\n if (x + 1) % 25 == 0 {\\n\\n println!();\\n\\n }\\n\\n }\\n\\n println!();\\n\\n 0\\n\\n}\\n\",\n \"file_path\": \"src/day8.rs\",\n \"rank\": 63,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day6, part1)]\\n\\npub fn solve_part1(input: &Orbits) -> i32 {\\n\\n let mut orbit_count = 0;\\n\\n for k in input.keys() {\\n\\n orbit_count += count_orbits(k, input);\\n\\n }\\n\\n orbit_count\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"COM)B\\\\nB)C\\\\nC)D\\\\nD)E\\\\nE)F\\\\nB)G\\\\nG)H\\\\nD)I\\\\nE)J\\\\nJ)K\\\\nK)L\\\";\\n\\n assert_eq!(solve_part1(&input_generator(&input)), 42);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/day6.rs\",\n \"rank\": 64,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day2, part1)]\\n\\npub fn solve_part1(input: &[usize]) -> usize {\\n\\n let mut input = input.to_owned();\\n\\n input[1] = 12;\\n\\n input[2] = 2;\\n\\n\\n\\n run_program(&mut input);\\n\\n input[0]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day2.rs\",\n \"rank\": 65,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"#[aoc(day8, part1)]\\n\\npub fn solve_part1(input: &[i32]) -> usize {\\n\\n let input = input.to_owned();\\n\\n let mut layers = Vec::new();\\n\\n let layer_size = 6 * 25;\\n\\n let layer_count = input.len() / layer_size;\\n\\n for x in 0..layer_count {\\n\\n let start = x * layer_size;\\n\\n layers.push(&input[start..start + layer_size]);\\n\\n }\\n\\n layers.sort_by(compare_images);\\n\\n let biggest = layers.first().unwrap();\\n\\n let ones = biggest.iter().filter(|x| **x == 1).count();\\n\\n let twos = biggest.iter().filter(|x| **x == 2).count();\\n\\n\\n\\n ones * twos\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day8.rs\",\n \"rank\": 66,\n \"score\": 77423.34550653334\n },\n {\n \"content\": \"fn render_screen(screen: &mut Screen, output: &[i64]) {\\n\\n let mut iter = output.iter();\\n\\n\\n\\n while let Some(x) = iter.next() {\\n\\n let y = iter.next().unwrap();\\n\\n let block_type = iter.next().unwrap();\\n\\n screen.insert((*x, *y), *block_type);\\n\\n }\\n\\n\\n\\n let max_x = screen.keys().map(|k| k.0).max().unwrap();\\n\\n let max_y = screen.keys().map(|k| k.1).max().unwrap();\\n\\n\\n\\n println!(\\\"Max X: {} Max Y: {}\\\", max_x, max_y);\\n\\n\\n\\n for y in 0..=19 {\\n\\n for x in 0..=36 {\\n\\n if let Some(block_type) = screen.get(&(x, y)) {\\n\\n match block_type {\\n\\n 0 => print!(\\\" \\\"),\\n\\n 1 => print!(\\\"W\\\"),\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 67,\n \"score\": 76015.10037599536\n },\n {\n \"content\": \"#[aoc(day16, part1)]\\n\\npub fn solve_part_1(input: &Vec) -> i32 {\\n\\n let result = (0..100).fold(input.clone(), |acc, _| process(&acc));\\n\\n let answer: String = result.iter().take(8).map(|d| format!(\\\"{}\\\", d)).collect();\\n\\n\\n\\n answer.parse().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 68,\n \"score\": 74098.44547183359\n },\n {\n \"content\": \"#[aoc(day16, part2)]\\n\\npub fn solve_part_2(input: &Vec) -> i32 {\\n\\n let input: Vec = input\\n\\n .iter()\\n\\n .cycle()\\n\\n .take(input.len() * 10000)\\n\\n .cloned()\\n\\n .collect();\\n\\n\\n\\n let result = (0..100).fold(input, |acc, i| {\\n\\n println!(\\\"Processing: {}\\\", i);\\n\\n process(&acc)\\n\\n });\\n\\n let offset: usize = result\\n\\n .iter()\\n\\n .take(7)\\n\\n .map(|d| format!(\\\"{}\\\", d))\\n\\n .collect::()\\n\\n .parse()\\n\\n .unwrap();\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 69,\n \"score\": 74098.44547183359\n },\n {\n \"content\": \"fn compute_ore(cook_book: &[Recipe], shopping_list: &Pantry) -> i64 {\\n\\n println!(\\\"Shopping List: {:?}\\\", shopping_list);\\n\\n let mut ore_needed = 0;\\n\\n for (ingredient_name, amount) in shopping_list {\\n\\n let recipe = cook_book\\n\\n .iter()\\n\\n .find(|r| *ingredient_name == r.result.name)\\n\\n .unwrap();\\n\\n\\n\\n let ore_ingredient = recipe.ingredients.get(0).unwrap();\\n\\n let batches = if 0 == amount % recipe.result.amount {\\n\\n amount / recipe.result.amount\\n\\n } else {\\n\\n (amount / recipe.result.amount) + 1\\n\\n };\\n\\n\\n\\n ore_needed += batches * ore_ingredient.amount;\\n\\n }\\n\\n ore_needed\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 70,\n \"score\": 73228.79891253781\n },\n {\n \"content\": \"#[aoc(day3, part1)]\\n\\npub fn solve_part1(input: &[(DistanceMap, PointSet)]) -> i32 {\\n\\n let (_, wire_a) = &input[0];\\n\\n let (_, wire_b) = &input[1];\\n\\n wire_a\\n\\n .intersection(wire_b)\\n\\n .map(|x| calc_distance(*x))\\n\\n .min()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 71,\n \"score\": 71358.91747423785\n },\n {\n \"content\": \"#[aoc(day3, part2)]\\n\\npub fn solve_part2(input: &[(DistanceMap, PointSet)]) -> i32 {\\n\\n let (distance_a, wire_a) = &input[0];\\n\\n let (distance_b, wire_b) = &input[1];\\n\\n wire_a\\n\\n .intersection(wire_b)\\n\\n .map(|p| calc_distance_2(&distance_a, &distance_b, *p))\\n\\n .min()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"R75,D30,R83,U83,L12,D49,R71,U7,L72\\\\nU62,R66,U55,R34,D71,R55,D58,R83\\\";\\n\\n assert_eq!(solve_part1(&input_generator(&input)), 159);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 72,\n \"score\": 71358.91747423785\n },\n {\n \"content\": \"fn get_value(value_type: i32, i: i32, program: &[i32]) -> i32 {\\n\\n if value_type == 1 {\\n\\n //println!(\\\"Direct {}\\\", i);\\n\\n program[to_index(i)]\\n\\n } else {\\n\\n let lookup_index = to_index(program[to_index(i)]);\\n\\n //println!(\\\"Indirect {} -> {}\\\", i, lookup_index);\\n\\n program[lookup_index]\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 73,\n \"score\": 70210.20142760783\n },\n {\n \"content\": \"type Screen = HashMap<(i64, i64), i64>;\\n\\n\\n\",\n \"file_path\": \"src/day13.rs\",\n \"rank\": 74,\n \"score\": 69479.40392585115\n },\n {\n \"content\": \"fn is_intersection(input: &[i64], line_length: usize, x: usize, y: usize) -> bool {\\n\\n get_location(input, line_length, x, y) == SCAFFOLD\\n\\n && get_location(input, line_length, x + 1, y) == SCAFFOLD\\n\\n && get_location(input, line_length, x - 1, y) == SCAFFOLD\\n\\n && get_location(input, line_length, x, y + 1) == SCAFFOLD\\n\\n && get_location(input, line_length, x, y - 1) == SCAFFOLD\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day17.rs\",\n \"rank\": 75,\n \"score\": 67357.63139496234\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nenum Action {\\n\\n Keep,\\n\\n Negate,\\n\\n Drop,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 78,\n \"score\": 61079.716976992095\n },\n {\n \"content\": \"fn build_points(directions: Vec) -> (DistanceMap, HashSet<(i32, i32)>) {\\n\\n let mut current_location = (0, 0);\\n\\n let mut points = HashSet::new();\\n\\n let mut distance = HashMap::new();\\n\\n let mut counter = 0;\\n\\n for direction in directions {\\n\\n let d = &direction[..1];\\n\\n let n = direction[1..].parse::().unwrap();\\n\\n let (xo, yo) = match d {\\n\\n \\\"R\\\" => (1, 0),\\n\\n \\\"D\\\" => (0, -1),\\n\\n \\\"U\\\" => (0, 1),\\n\\n \\\"L\\\" => (-1, 0),\\n\\n _ => panic!(\\\"Unknown direction {}\\\", d),\\n\\n };\\n\\n for _ in 0..n {\\n\\n counter += 1;\\n\\n let (x1, y1) = current_location;\\n\\n let new_location = (x1 + xo, y1 + yo);\\n\\n current_location = new_location;\\n\\n points.insert(new_location);\\n\\n update_distance(&mut distance, new_location, counter);\\n\\n }\\n\\n }\\n\\n (distance, points)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 80,\n \"score\": 48784.77817664684\n },\n {\n \"content\": \"type Pantry = HashMap;\\n\\n\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 81,\n \"score\": 48550.99016500078\n },\n {\n \"content\": \"fn run_series_2<'a>(_program: Vec, _series: impl Iterator- ) -> i32 {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day7.rs\",\n \"rank\": 82,\n \"score\": 46260.41045539006\n },\n {\n \"content\": \"fn check_for_periods(\\n\\n periods: &mut HashMap
,\\n\\n original: &Coord,\\n\\n current: &Coord,\\n\\n dimension: usize,\\n\\n cycle: i64,\\n\\n) {\\n\\n for (i, x) in original.iter().enumerate() {\\n\\n if let Entry::Vacant(v) = periods.entry(i) {\\n\\n let body = current.get(i).unwrap();\\n\\n if x.position[dimension] == body.position[dimension] && body.velocity[dimension] == 0 {\\n\\n // println!(\\n\\n // \\\"Found cycle for {:?} {} on cycle: {}\\\",\\n\\n // current.get(i).unwrap(),\\n\\n // dimension,\\n\\n // cycle\\n\\n // );\\n\\n v.insert(cycle);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 83,\n \"score\": 40265.76963656088\n },\n {\n \"content\": \"fn find_needed_ore(\\n\\n cook_book: &[Recipe],\\n\\n shopping_list: &mut Pantry,\\n\\n pantry: &mut Pantry,\\n\\n recipe: &Recipe,\\n\\n amount: i64,\\n\\n) {\\n\\n let amount = match pantry.entry(recipe.result.name.clone()) {\\n\\n Entry::Occupied(mut e) => {\\n\\n let store_amount = e.get_mut();\\n\\n if *store_amount > 0 {\\n\\n let new_amount = amount - *store_amount;\\n\\n println!(\\n\\n \\\"Taking from the store {} - {} = {}\\\",\\n\\n amount, store_amount, new_amount\\n\\n );\\n\\n *store_amount -= amount;\\n\\n new_amount\\n\\n } else {\\n\\n amount\\n\",\n \"file_path\": \"src/day14.rs\",\n \"rank\": 84,\n \"score\": 39297.303081897655\n },\n {\n \"content\": \"fn to_index(i: i32) -> usize {\\n\\n i.try_into().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 85,\n \"score\": 36348.21695582779\n },\n {\n \"content\": \"fn check_pairs(password: &[i8]) -> bool {\\n\\n (0..5).zip(1..6).any(|x| pair_test(password, &x))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 86,\n \"score\": 34634.26950724149\n },\n {\n \"content\": \"fn check_ascending(password: &[i8]) -> bool {\\n\\n password\\n\\n .iter()\\n\\n .scan(-1 as i8, |state, x| {\\n\\n if *state <= *x {\\n\\n *state = *x;\\n\\n Some(true)\\n\\n } else {\\n\\n Some(false)\\n\\n }\\n\\n })\\n\\n .all(|x| x)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 87,\n \"score\": 34634.26950724149\n },\n {\n \"content\": \"fn apply_velocity(planet: &mut Body) {\\n\\n for i in 0..3 {\\n\\n planet.position[i] += planet.velocity[i];\\n\\n }\\n\\n}\\n\\n\\n\\npub type Coord = [Body];\\n\\n//\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 88,\n \"score\": 34634.26950724149\n },\n {\n \"content\": \"fn lcm(a: usize, b: usize) -> usize {\\n\\n let div = gcd(a, b);\\n\\n (a / div) * b\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 89,\n \"score\": 34001.43295393142\n },\n {\n \"content\": \"fn gcd(a: usize, b: usize) -> usize {\\n\\n let mut a = a;\\n\\n let mut b = b;\\n\\n while b != 0 {\\n\\n let t = b;\\n\\n b = a % b;\\n\\n a = t\\n\\n }\\n\\n a\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn example1() {\\n\\n let input = \\\"\\\";\\n\\n assert_eq!(\\n\\n generate_input(&input),\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 90,\n \"score\": 34001.43295393142\n },\n {\n \"content\": \"fn check_long_pairs(password: &[i8]) -> bool {\\n\\n let mut count = 1;\\n\\n let mut last = -1;\\n\\n\\n\\n for p in password {\\n\\n if last == *p {\\n\\n count += 1;\\n\\n } else {\\n\\n if count == 2 {\\n\\n return true;\\n\\n }\\n\\n count = 1;\\n\\n }\\n\\n last = *p;\\n\\n }\\n\\n count == 2\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 91,\n \"score\": 33872.30721565884\n },\n {\n \"content\": \"fn add_extra_fuel(fuel: i32) -> i32 {\\n\\n let mut total_fuel = fuel;\\n\\n let mut current_fuel = fuel;\\n\\n loop {\\n\\n current_fuel = (current_fuel / 3) - 2;\\n\\n if current_fuel <= 0 {\\n\\n return total_fuel;\\n\\n }\\n\\n total_fuel += current_fuel;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day1.rs\",\n \"rank\": 92,\n \"score\": 33872.30721565884\n },\n {\n \"content\": \"fn calc_distance((x, y): (i32, i32)) -> i32 {\\n\\n //println!(\\\"Intersection: {} {} {}\\\", x, y, x.abs() + y.abs());\\n\\n x.abs() + y.abs()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day3.rs\",\n \"rank\": 93,\n \"score\": 33178.657372870715\n },\n {\n \"content\": \"fn gravitate(planet: &mut Body, other: &Body) {\\n\\n for i in 0..3 {\\n\\n // println!(\\n\\n // \\\"Comparing {:?} {:?} {:?}\\\",\\n\\n // planet,\\n\\n // other,\\n\\n // planet.position[i].cmp(&other.position[i])\\n\\n // );\\n\\n match planet.position[i].cmp(&other.position[i]) {\\n\\n Ordering::Equal => {}\\n\\n Ordering::Greater => {\\n\\n planet.velocity[i] -= 1;\\n\\n }\\n\\n Ordering::Less => planet.velocity[i] += 1,\\n\\n }\\n\\n //println!(\\\"Compared {:?} {:?}\\\", planet, other);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day12.rs\",\n \"rank\": 94,\n \"score\": 33178.657372870715\n },\n {\n \"content\": \"fn split_number(password: i32) -> Vec {\\n\\n let str_number = format!(\\\"{}\\\", password);\\n\\n str_number\\n\\n .chars()\\n\\n .map(|c| c.to_digit(10).unwrap() as i8)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day4.rs\",\n \"rank\": 95,\n \"score\": 33104.63940170162\n },\n {\n \"content\": \"fn parse_instruction(params: i32) -> Vec {\\n\\n format!(\\\"{:05}\\\", params)\\n\\n .chars()\\n\\n .map(|x| x.to_digit(10).unwrap() as i32)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day5.rs\",\n \"rank\": 96,\n \"score\": 33104.63940170162\n },\n {\n \"content\": \"fn process(signal: &Vec) -> Vec {\\n\\n (0..signal.len())\\n\\n .map(|i| process_digit(signal, i + 1))\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 97,\n \"score\": 32416.69508128806\n },\n {\n \"content\": \"fn compare_images(a: &&[i32], b: &&[i32]) -> std::cmp::Ordering {\\n\\n let a_ones = a.iter().filter(|x| **x == 0).count();\\n\\n let b_ones = b.iter().filter(|x| **x == 0).count();\\n\\n\\n\\n a_ones.cmp(&b_ones)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day8.rs\",\n \"rank\": 98,\n \"score\": 30527.32309009659\n },\n {\n \"content\": \"fn process_digit(signal: &Vec, position: usize) -> i32 {\\n\\n let cycle = iter::repeat(Action::Drop)\\n\\n .take(position)\\n\\n .chain(iter::repeat(Action::Keep).take(position))\\n\\n .chain(iter::repeat(Action::Drop).take(position))\\n\\n .chain(iter::repeat(Action::Negate).take(position))\\n\\n .cycle()\\n\\n .skip(1);\\n\\n signal\\n\\n .iter()\\n\\n .zip(cycle)\\n\\n .map(|(n, action)| match action {\\n\\n Action::Keep => *n,\\n\\n Action::Negate => -n,\\n\\n Action::Drop => 0,\\n\\n })\\n\\n .sum::()\\n\\n .abs()\\n\\n % 10\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/day16.rs\",\n \"rank\": 99,\n \"score\": 30430.070500678463\n }\n]"}}},{"rowIdx":685,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/ecs/src/world.rs"},"repo_name":{"kind":"string","value":"lukebitts/Luck"},"commit":{"kind":"string","value":"aef25bc3442872789228e14989d203afe3cc8a52"},"file_code":{"kind":"string","value":"use mopa::Any;\n\nuse super::entity::Entities;\nuse super::component::Components;\nuse super::{Entity, System};\nuse std::any::TypeId;\n\npub struct World {\n entities: Entities,\n components: Components,\n systems: Vec>,\n to_destroy: Vec,\n}\n\nunsafe impl Send for World {}\nunsafe impl Sync for World {}\n\npub struct WorldBuilder {\n systems: Vec>,\n}\n\nimpl WorldBuilder {\n \n #[allow(unknown_lints)]\n #[allow(inline_always)]\n #[inline(always)]\n pub fn new() -> Self {\n WorldBuilder { systems: Vec::new() }\n }\n\n \n \n pub fn with_system(mut self, system: T) -> Self {\n self.systems.push(Box::new(system));\n self\n }\n\n \n pub fn build(self) -> World {\n World {\n entities: Entities::new(),\n components: Components::new(),\n systems: self.systems,\n to_destroy: Vec::new(),\n }\n }\n\n \n \n pub fn build_with_capacity(self, capacity: usize) -> World {\n World {\n entities: Entities::with_capacity(capacity),\n components: Components::with_capacity(capacity),\n systems: self.systems,\n to_destroy: Vec::new(),\n }\n }\n}\n\nfn match_entity_signature(system: &System, components: &Box<[TypeId]>) -> bool {\n let signature = system.signature();\n let mut count = 0;\n for s in &*signature {\n if components.contains(&s) {\n count = count + 1;\n }\n }\n\n count == signature.len()\n}\n\nimpl World {\n \n pub fn create_entity(&mut self) -> Entity {\n self.entities.create_entity()\n }\n\n \n \n \n \n \n \n \n pub fn destroy_entity(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity) && !self.to_destroy.contains(&entity));\n\n self.to_destroy.push(entity);\n }\n\n \n \n #[allow(unknown_lints)]\n #[allow(inline_always)]\n #[inline(always)]\n pub fn is_valid(&self, entity: Entity) -> bool {\n self.entities.is_valid(entity)\n }\n\n \n \n \n \n \n pub fn add_component(&mut self, entity: Entity, component: T) -> &mut T {\n \n \n assert!(self.entities.is_valid(entity));\n self.components.add_component::(entity.id() as usize, component)\n }\n\n \n \n \n \n pub fn get_component(&self, entity: Entity) -> Option<&T> {\n assert!(self.entities.is_valid(entity));\n self.components.get_component::(entity.id() as usize)\n }\n\n \n \n \n \n pub fn get_component_mut(&mut self, entity: Entity) -> Option<&mut T> {\n assert!(self.entities.is_valid(entity));\n self.components.get_component_mut::(entity.id() as usize)\n }\n\n \n \n \n \n pub fn remove_component(&mut self, entity: Entity) -> Option {\n assert!(self.entities.is_valid(entity));\n self.components.remove_component::(entity.id() as usize)\n }\n\n \n \n \n pub fn remove_all_components(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity));\n self.components.remove_all_components(entity.id() as usize)\n }\n\n \n pub fn get_system_mut(&mut self) -> Option<&mut T> {\n self.systems.iter_mut().filter_map(|s| s.downcast_mut::()).next()\n }\n\n \n pub fn get_system(&self) -> Option<&T> {\n self.systems.iter().filter_map(|s| s.downcast_ref::()).next()\n }\n\n \n \n \n pub fn apply(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity));\n\n let World { ref mut systems, ref mut components, .. } = *self;\n for system in systems.iter_mut() {\n if match_entity_signature(&**system,\n &components.generate_signature(entity.id() as usize)) {\n if !system.has_entity(entity) {\n system.on_entity_added(entity);\n }\n } else if system.has_entity(entity) {\n system.on_entity_removed(entity);\n }\n }\n }\n\n \n \n pub fn process(&mut self) {\n use rayon::par_iter::*;\n\n let mut callbacks = Vec::with_capacity(self.systems.len());\n\n self.systems \n .par_iter()\n .map(|s| s.process(self))\n .collect_into(&mut callbacks);\n\n for callback in &mut callbacks {\n (*callback)(self);\n }\n\n self.destroy_scheduled_entities();\n }\n\n fn destroy_scheduled_entities(&mut self) {\n let to_destroy = self.to_destroy.clone();\n for entity in to_destroy {\n self.remove_all_components(entity);\n self.apply(entity);\n self.entities.destroy_entity(entity);\n }\n self.to_destroy.clear();\n }\n}\n\nimpl Drop for World {\n fn drop(&mut self) {\n for entity in &self.entities {\n self.to_destroy.push(entity);\n }\n\n self.destroy_scheduled_entities();\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::WorldBuilder;\n use super::super::{Signature, Entity, System, World};\n use std::ops::FnMut;\n use std::any::TypeId;\n use std;\n\n #[derive(Default, PartialEq, Debug)]\n struct PositionComponent(f32, f32, f32);\n #[derive(Default)]\n struct VelocityComponent(f32, f32, f32);\n\n #[derive(Default)]\n struct SpatialSystem {\n entities: Vec,\n marker: bool,\n }\n impl_system!(SpatialSystem, (PositionComponent), {\n \n \n Box::new(move |w: &mut World|{\n if !w.get_system::().unwrap().marker {\n \n \n assert_eq!(w.get_system::().unwrap().marker, false);\n w.get_system_mut::().unwrap().marker = true;\n }\n })\n });\n impl Drop for SpatialSystem {\n fn drop(&mut self) {\n assert_eq!(self.entities.len(), 0);\n }\n }\n\n #[derive(Default)]\n struct VelocitySystem {\n entities: Vec,\n marker: bool,\n }\n impl_system!(VelocitySystem, (PositionComponent, VelocityComponent), {\n \n \n\n let v1 = PositionComponent(0.0, 0.0, 0.0);\n\n Box::new(move |w: &mut World|{\n if !w.get_system::().unwrap().marker {\n assert_eq!(w.get_system::().unwrap().marker, true);\n w.get_system_mut::().unwrap().marker = true;\n assert_eq!(v1, v1);\n }\n })\n });\n impl Drop for VelocitySystem {\n fn drop(&mut self) {\n assert_eq!(self.entities.len(), 0);\n }\n }\n\n #[test]\n fn creation() {\n let w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .build();\n\n assert!(w.get_system::().is_some());\n assert!(w.get_system::().is_none());\n assert_eq!(w.systems.len(), 1);\n\n let w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .with_system(VelocitySystem::default())\n .build();\n\n assert!(w.get_system::().is_some());\n assert!(w.get_system::().is_some());\n assert_eq!(w.systems.len(), 2);\n }\n\n #[test]\n fn component_system_operations() {\n let mut w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .with_system(VelocitySystem::default())\n .build();\n\n let e1 = w.create_entity();\n w.add_component(e1, PositionComponent::default());\n w.add_component(e1, VelocityComponent::default());\n w.apply(e1);\n\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n\n w.remove_component::(e1);\n w.apply(e1);\n\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().entities.len(), 0);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.destroy_entity(e1);\n\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.process();\n\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.process();\n }\n\n}\n"},"prefix":{"kind":"string","value":"use mopa::Any;\n\nuse super::entity::Entities;\nuse super::component::Components;\nuse super::{Entity, System};\nuse std::any::TypeId;\n\npub struct World {\n entities: Entities,\n components: Components,\n systems: Vec>,\n to_destroy: Vec,\n}\n\nunsafe impl Send for World {}\nunsafe impl Sync for World {}\n\npub struct WorldBuilder {\n systems: Vec>,\n}\n\nimpl WorldBuilder {\n \n #[allow(unknown_lints)]\n #[allow(inline_always)]\n #[inline(always)]\n pub fn new() -> Self {\n WorldBuilder { systems: Vec::new() }\n }\n\n \n \n pub fn with_system(mut self, system: T) -> Self {\n self.systems.push(Box::new(system));\n self\n }\n\n \n pub fn build(self) -> World {\n World {\n entities: Entities::new(),\n components: Components::new(),\n systems: self.systems,\n to_destroy: Vec::new(),\n }\n }\n\n \n \n pub fn build_with_capacity(self, capacity: usize) -> World {\n World {\n entities: Entities::with_capacity(capacity),\n components: Components::with_capacity(capacity),\n systems: self.systems,\n to_destroy: Vec::new(),\n }\n }\n}\n\nfn match_entity_signature(system: &System, components: &Box<[TypeId]>) -> bool {\n let signature = system.signature();\n let mut count = 0;\n for s in &*signature {\n if components.contains(&s) {\n count = count + 1;\n }\n }\n\n count == signature.len()\n}\n\nimpl World {\n \n pub fn create_entity(&mut self) -> Entity {\n self.entities.create_entity()\n }\n\n \n \n \n \n \n \n \n pub fn destroy_entity(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity) && !self.to_destroy.contains(&entity));\n\n self.to_destroy.push(entity);\n }\n\n \n \n #[allow(unknown_lints)]\n #[allow(inline_always)]\n #[inline(always)]\n pub fn is_valid(&self, entity: Entity) -> bool {\n self.entities.is_valid(entity)\n }\n\n \n \n \n \n \n pub fn add_component(&mut self, entity: Entity, component: T) -> &mut T {\n \n \n assert!(self.entities.is_valid(entity));\n self.components.add_component::(entity.id() as usize, component)\n }\n\n \n \n \n \n pub fn get_component(&self, entity: Entity) -> Option<&T> {\n assert!(self.entities.is_valid(entity));\n self.components.get_component::(entity.id() as usize)\n }\n\n \n \n \n \n pub fn get_component_mut(&mut self, entity: Entity) -> Option<&mut T> {\n assert!(self.entities.is_valid(entity));\n self.components.get_component_mut::(entity.id() as usize)\n }\n\n \n \n \n \n pub fn remove_component(&mut self, entity: Entity) -> Option {\n assert!(self.entities.is_valid(entity));\n self.components.remove_component::(entity.id() as usize)\n }\n\n \n \n \n pub fn remove_all_components(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity));\n self.components.remove_all_components(entity.id() as usize)\n }\n\n \n pub fn get_system_mut(&mut self) -> Option<&mut T> {\n self.systems.iter_mut().filter_map(|s| s.downcast_mut::()).next()\n }\n\n \n pub fn get_system(&self) -> Option<&T> {\n self.systems.iter().filter_map(|s| s.downcast_ref::()).next()\n }\n\n \n \n \n pub fn apply(&mut self, entity: Entity) {\n assert!(self.entities.is_valid(entity));\n\n let World { ref mut systems, ref mut components, .. } = *self;\n for system in systems.iter_mut() {\n if match_entity_signature(&**system,\n &components.generate_signature(entity.id() as usize)) {\n if !system.has_entity(entity) {\n system.on_entity_added(entity);\n }\n } else if system.has_entity(entity) {\n system.on_entity_removed(entity);\n }\n }\n }\n\n \n \n pub fn process(&mut self) {\n use rayon::par_iter::*;\n\n let mut callbacks = Vec::with_capacity(self.systems.len());\n\n "},"suffix":{"kind":"string","value":"\n\n fn destroy_scheduled_entities(&mut self) {\n let to_destroy = self.to_destroy.clone();\n for entity in to_destroy {\n self.remove_all_components(entity);\n self.apply(entity);\n self.entities.destroy_entity(entity);\n }\n self.to_destroy.clear();\n }\n}\n\nimpl Drop for World {\n fn drop(&mut self) {\n for entity in &self.entities {\n self.to_destroy.push(entity);\n }\n\n self.destroy_scheduled_entities();\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::WorldBuilder;\n use super::super::{Signature, Entity, System, World};\n use std::ops::FnMut;\n use std::any::TypeId;\n use std;\n\n #[derive(Default, PartialEq, Debug)]\n struct PositionComponent(f32, f32, f32);\n #[derive(Default)]\n struct VelocityComponent(f32, f32, f32);\n\n #[derive(Default)]\n struct SpatialSystem {\n entities: Vec,\n marker: bool,\n }\n impl_system!(SpatialSystem, (PositionComponent), {\n \n \n Box::new(move |w: &mut World|{\n if !w.get_system::().unwrap().marker {\n \n \n assert_eq!(w.get_system::().unwrap().marker, false);\n w.get_system_mut::().unwrap().marker = true;\n }\n })\n });\n impl Drop for SpatialSystem {\n fn drop(&mut self) {\n assert_eq!(self.entities.len(), 0);\n }\n }\n\n #[derive(Default)]\n struct VelocitySystem {\n entities: Vec,\n marker: bool,\n }\n impl_system!(VelocitySystem, (PositionComponent, VelocityComponent), {\n \n \n\n let v1 = PositionComponent(0.0, 0.0, 0.0);\n\n Box::new(move |w: &mut World|{\n if !w.get_system::().unwrap().marker {\n assert_eq!(w.get_system::().unwrap().marker, true);\n w.get_system_mut::().unwrap().marker = true;\n assert_eq!(v1, v1);\n }\n })\n });\n impl Drop for VelocitySystem {\n fn drop(&mut self) {\n assert_eq!(self.entities.len(), 0);\n }\n }\n\n #[test]\n fn creation() {\n let w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .build();\n\n assert!(w.get_system::().is_some());\n assert!(w.get_system::().is_none());\n assert_eq!(w.systems.len(), 1);\n\n let w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .with_system(VelocitySystem::default())\n .build();\n\n assert!(w.get_system::().is_some());\n assert!(w.get_system::().is_some());\n assert_eq!(w.systems.len(), 2);\n }\n\n #[test]\n fn component_system_operations() {\n let mut w = WorldBuilder::new()\n .with_system(SpatialSystem::default())\n .with_system(VelocitySystem::default())\n .build();\n\n let e1 = w.create_entity();\n w.add_component(e1, PositionComponent::default());\n w.add_component(e1, VelocityComponent::default());\n w.apply(e1);\n\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n\n w.remove_component::(e1);\n w.apply(e1);\n\n assert_eq!(w.get_system::().unwrap().entities.len(), 1);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().entities.len(), 0);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.destroy_entity(e1);\n\n assert_eq!(w.get_system::().unwrap().has_entity(e1), true);\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.process();\n\n assert_eq!(w.get_system::().unwrap().has_entity(e1), false);\n\n w.process();\n }\n\n}\n"},"middle":{"kind":"string","value":"self.systems \n .par_iter()\n .map(|s| s.process(self))\n .collect_into(&mut callbacks);\n\n for callback in &mut callbacks {\n (*callback)(self);\n }\n\n self.destroy_scheduled_entities();\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// A trait that describes which components the system should process. It is split from the\n\n/// System trait to allow it to be implemented through the impl_signature macro.\n\npub trait Signature : mopa::Any + Send + Sync {\n\n /// Should return the components this system expects to process.\n\n fn signature(&self) -> Box<[TypeId]>;\n\n}\n\n\n","file_path":"src/ecs/src/system.rs","rank":1,"score":123332.91070441963},{"content":"/// A trait that every System struct should implement.\n\npub trait System : Signature {\n\n // TODO: Add a on_drop event? Implementing Drop for a system is useless since it is only\n\n // called after the World already cleaned it.\n\n\n\n /// Should return true if an entity add event has been received by this System.\n\n fn has_entity(&self, entity: Entity) -> bool;\n\n\n\n /// This event is fired everytime the signature of an entity matches the signature of the\n\n /// system and the system has not received this entity yet (checked through has_entity).\n\n fn on_entity_added(&mut self, entity: Entity);\n\n\n\n /// This event is fired everytime the signature of an entity doesn't match the signature of the\n\n /// system the system has a reference to this entity (checked through has_entity).\n\n fn on_entity_removed(&mut self, entity: Entity);\n\n\n\n /// This event is fired every frame. Only read only operations can be done during the proccess\n\n /// itself since this step is run concurrently. Multable changes have to be done inside the\n\n /// returning function witch will be run in order depending on the orther the systems were\n\n /// added to the World.\n\n fn process(&self, _: &World) -> Box {\n","file_path":"src/ecs/src/system.rs","rank":2,"score":91302.64345194987},{"content":"/// Normalizes x and y. Also makes sure y is orthogonal to x.\n\npub fn orthonormalize(x: &mut Vector3, y: &mut Vector3) {\n\n *x = normalize(*x);\n\n *y = normalize(*x - *y * dot(*y, *x));\n\n}\n","file_path":"src/math/src/extensions.rs","rank":3,"score":82128.01477523068},{"content":"/// Returns a perspective matrix from the camera parameters.\n\npub fn frustum(left: f32,\n\n right: f32,\n\n bottom: f32,\n\n top: f32,\n\n near_val: f32,\n\n far_val: f32)\n\n -> Matrix4 {\n\n let mut result = Matrix4::zero();\n\n\n\n result.c0.x = (2.0 * near_val) / (right - left);\n\n result.c1.y = (2.0 * near_val) / (top - bottom);\n\n result.c2.x = (right + left) / (right - left);\n\n result.c2.y = (top + bottom) / (top - bottom);\n\n result.c2.w = 1.0;\n\n\n\n result.c2.z = far_val / (far_val - near_val);\n\n result.c3.z = -(far_val * near_val) / (far_val - near_val);\n\n\n\n result\n\n}\n","file_path":"src/math/src/extensions.rs","rank":4,"score":55062.31172451815},{"content":"/// Returns an orthogonal matrix from the camera parameters.\n\npub fn ortho(left: f32,\n\n right: f32,\n\n bottom: f32,\n\n top: f32,\n\n near_val: f32,\n\n far_val: f32)\n\n -> Matrix4 {\n\n let mut res = Matrix4::one();\n\n res.c0.x = 2.0 / (right - left);\n\n res.c1.y = 2.0 / (top - bottom);\n\n res.c3.x = -(right + left) / (right - left);\n\n res.c3.y = -(top + bottom) / (top - bottom);\n\n\n\n res.c2.z = 1.0 / (far_val - near_val);\n\n res.c3.z = -near_val / (far_val - near_val);\n\n\n\n res\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":5,"score":55062.31172451815},{"content":"/// Returns true if a box (or aabb) is inside the defined 6 plane frustrum.\n\npub fn is_box_in_frustum(origin: Vector3,\n\n half_dim: Vector3,\n\n planes: [Vector4; 6])\n\n -> FrustumTestResult {\n\n let corner_offsets = [Vector3::new(-1.0, -1.0, -1.0),\n\n Vector3::new(-1.0, -1.0, 1.0),\n\n Vector3::new(-1.0, 1.0, -1.0),\n\n Vector3::new(-1.0, 1.0, 1.0),\n\n Vector3::new(1.0, -1.0, -1.0),\n\n Vector3::new(1.0, -1.0, 1.0),\n\n Vector3::new(1.0, 1.0, -1.0),\n\n Vector3::new(1.0, 1.0, 1.0)];\n\n let mut ret = 1;\n\n for plane in &planes {\n\n let plane_normal = Vector3::new(plane.x, plane.y, plane.z);\n\n let mut idx = vector_to_index(plane_normal);\n\n\n\n let mut test_point = origin + half_dim * corner_offsets[idx as usize];\n\n\n\n if half_plane_test(test_point, plane_normal, plane.w) == 0 {\n","file_path":"src/math/src/extensions.rs","rank":6,"score":50808.842977349224},{"content":"/// Scales a matrix by a vector3.\n\npub fn scale(m: Matrix4, v: Vector3) -> Matrix4 {\n\n let mut res = Matrix4::one();\n\n res.c0 = m[0] * v[0];\n\n res.c1 = m[1] * v[1];\n\n res.c2 = m[2] * v[2];\n\n res.c3 = m[3];\n\n res\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":7,"score":44209.35005659563},{"content":"/// Translates a matrix by a vector3.\n\npub fn translate(m: Matrix4, v: Vector3) -> Matrix4 {\n\n let mut m = m;\n\n\n\n m.c3.x += v.x;\n\n m.c3.y += v.y;\n\n m.c3.z += v.z;\n\n\n\n m\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":8,"score":44209.35005659563},{"content":"/// Returns a look at matrix from the supplied parameters. Eye is the camera position, center is\n\n/// the location you want the camera to point, up is the up direction in whichever abstraction\n\n/// you are working with (usually `Vector3::new(0, 1, 0)`).\n\npub fn look_at(eye: Vector3, center: Vector3, up: Vector3) -> Matrix4 {\n\n let f = normalize(center - eye);\n\n let s = normalize(cross(up, f));\n\n let u = cross(f, s);\n\n\n\n let mut result = Matrix4::one();\n\n result.c0.x = s.x;\n\n result.c1.x = s.y;\n\n result.c2.x = s.z;\n\n result.c0.y = u.x;\n\n result.c1.y = u.y;\n\n result.c2.y = u.z;\n\n result.c0.z = f.x;\n\n result.c1.z = f.y;\n\n result.c2.z = f.z;\n\n result.c3.x = -dot(s, eye);\n\n result.c3.y = -dot(u, eye);\n\n result.c3.z = -dot(f, eye);\n\n result\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":9,"score":38415.23752223341},{"content":"type EntityKey = u64;\n\n\n\n/// A type used to represent an entity. Objects of this type can be copied and `Entities::is_alive`\n\n/// is guaranteed to return false if the entity was destroyed, even taking in account id reuse.\n\n#[derive(Copy, Clone, Eq, PartialEq, Debug)]\n\npub struct Entity {\n\n id: EntityId,\n\n key: EntityKey,\n\n}\n\n\n\nimpl Entity {\n\n /// Returns the id of the entity in the Entities object (or the World). You can't\n\n /// differentiate dead or alive entities just by their id.\n\n pub fn id(&self) -> EntityId {\n\n self.id\n\n }\n\n}\n\n\n\n/// An object to hold entities and their ids. Entities are stored sequentially and\n\n/// when an entity is destroyed, it's id is reused and old instances of Entity objects that pointed\n","file_path":"src/ecs/src/entity.rs","rank":10,"score":27124.94274488366},{"content":"fn vector_to_index(v: Vector3) -> i32 {\n\n let mut idx = 0;\n\n if v.z >= 0.0 {\n\n idx |= 1;\n\n }\n\n if v.y >= 0.0 {\n\n idx |= 2;\n\n }\n\n if v.x >= 0.0 {\n\n idx |= 4;\n\n }\n\n idx\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":11,"score":25712.93111444486},{"content":"//! }\n\n//! }\n\n//! ```\n\n\n\nuse std::any::TypeId;\n\nuse std::ops::FnMut;\n\n\n\nuse super::Entity;\n\nuse super::World;\n\nuse mopa;\n\n\n\n/// A trait that describes which components the system should process. It is split from the\n\n/// System trait to allow it to be implemented through the impl_signature macro.\n","file_path":"src/ecs/src/system.rs","rank":12,"score":23333.900984677803},{"content":"//! }\n\n//!\n\n//! impl System for S1 {\n\n//! fn has_entity(&self, entity: Entity) -> bool {\n\n//! self.entities.iter().enumerate().find(|e| *e.1 == entity).is_some()\n\n//! }\n\n//! fn on_entity_added(&mut self, entity: Entity) {\n\n//! self.entities.push(entity);\n\n//! }\n\n//! fn on_entity_removed(&mut self, entity: Entity) {\n\n//! self.entities.retain(|&x| x != entity);\n\n//! }\n\n//! fn process(&self, _: &World) -> Box {\n\n//! //[...]\n\n//! //Read only operations, like finding which entities need processing.\n\n//! Box::new(move |w: &mut World|{\n\n//! //[...]\n\n//! //Operations that mutate the world, you can access the system state through\n\n//! //w.get_system::()\n\n//! })\n","file_path":"src/ecs/src/system.rs","rank":13,"score":23331.78585856222},{"content":" }\n\n fn on_entity_added(&mut self, entity: Entity) {\n\n self.entities.push(entity);\n\n }\n\n fn on_entity_removed(&mut self, entity: Entity) {\n\n self.entities.retain(|&x| x != entity);\n\n }\n\n fn process(&self, _: &World) -> Box {\n\n $process\n\n }\n\n }\n\n };\n\n\n\n ( $name:ty , ( $( $mask:path ),+ ) ) => {\n\n impl_system!($name, ( $($mask),+ ), {\n\n fn ret(_: &mut World) {}\n\n Box::new(ret)\n\n });\n\n };\n\n}\n","file_path":"src/ecs/src/system.rs","rank":14,"score":23331.415676724337},{"content":"//! System is the trait the must be implemented by every system.\n\n//! # Example\n\n//! ```\n\n//! use luck_ecs::{Entity, System, Signature, World};\n\n//! use std::any::TypeId;\n\n//! use std::ops::FnMut;\n\n//!\n\n//! struct S1 {\n\n//! entities: Vec\n\n//! }\n\n//!\n\n//!\n\n//! //You can implement the signature yourself or use the `impl_signature!` macro.\n\n//! impl Signature for S1 {\n\n//! fn signature(&self) -> Box<[TypeId]> {\n\n//! Box::new([\n\n//! TypeId::of::(),\n\n//! TypeId::of::()\n\n//! ])\n\n//! }\n","file_path":"src/ecs/src/system.rs","rank":15,"score":23331.32343931033},{"content":" fn ret(_: &mut World) {}\n\n Box::new(ret)\n\n }\n\n}\n\n\n\nmopafy!(System);\n\n\n\n/// A macro to make it easier to implement the Signature trait.\n\n/// # Example\n\n/// ```\n\n/// #[macro_use] extern crate luck_ecs;\n\n///\n\n/// fn main() {\n\n/// use luck_ecs::{Entity, System, Signature, World};\n\n/// use std::any::TypeId;\n\n///\n\n/// struct S1 {\n\n/// entities: Vec\n\n/// }\n\n///\n","file_path":"src/ecs/src/system.rs","rank":16,"score":23328.4136780977},{"content":" /// Constructs a new instance of `Components`. The internal vector is empty and will only\n\n /// allocate when a component is added.\n\n #[allow(unknown_lints)]\n\n #[allow(inline_always)]\n\n #[inline(always)]\n\n pub fn new() -> Self {\n\n Components {\n\n components: Vec::new(),\n\n signatures: Vec::new(),\n\n }\n\n }\n\n\n\n /// Constructs a new instance of `Components`. The internal vector is initialized with the\n\n /// specified capacity.\n\n #[allow(unknown_lints)]\n\n #[allow(inline_always)]\n\n #[inline(always)]\n\n pub fn with_capacity(capacity: usize) -> Self {\n\n Components {\n\n components: Vec::with_capacity(capacity),\n","file_path":"src/ecs/src/component.rs","rank":17,"score":23328.318485566397},{"content":"\n\n map.remove::()\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n /// Removes every component associated with the `index`.\n\n pub fn remove_all_components(&mut self, index: usize) {\n\n if self.components.get_mut(index).map(|map| *map = AnyMap::new()).is_some() {\n\n self.signatures[index] = Box::new([]);\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::Components;\n\n\n\n #[derive(Debug, Eq, PartialEq)]\n","file_path":"src/ecs/src/component.rs","rank":18,"score":23327.780419409693},{"content":" signatures: Vec::new(),\n\n }\n\n }\n\n\n\n /// Returns a list with every component associated with the `index`.\n\n pub fn generate_signature(&mut self, index: usize) -> Box<[TypeId]> {\n\n self.signatures.get(index).cloned().unwrap_or_default()\n\n }\n\n\n\n /// Adds the `component` to the internal component list associated with the number\n\n /// `index`.\n\n pub fn add_component(&mut self, index: usize, component: T) -> &mut T {\n\n while self.components.len() <= index {\n\n self.components.push(AnyMap::new());\n\n self.signatures.push(Box::new([]));\n\n }\n\n\n\n match self.components[index].insert(component) {\n\n Some(_) => (),\n\n None => {\n","file_path":"src/ecs/src/component.rs","rank":19,"score":23326.766970043},{"content":"/// impl_signature!(S1, (u32, i32));\n\n/// }\n\n/// ```\n\n#[macro_export]\n\nmacro_rules! impl_signature {\n\n ( $name:ty , ( $( $mask:path ),+ ) ) => {\n\n impl<'a> Signature for $name {\n\n fn signature(&self) -> Box<[TypeId]> {\n\n Box::new([ $(std::any::TypeId::of::<$mask>()),+ ])\n\n }\n\n }\n\n }\n\n}\n\n\n\nmacro_rules! impl_system {\n\n ( $name:ty , ( $( $mask:path ),+ ) , $process:block ) => {\n\n impl_signature!($name, ( $($mask),+ ) );\n\n impl<'a> System for $name {\n\n fn has_entity(&self, entity: Entity) -> bool {\n\n self.entities.iter().enumerate().find(|e| *e.1 == entity).is_some()\n","file_path":"src/ecs/src/system.rs","rank":20,"score":23326.291626231294},{"content":" }\n\n\n\n /// If there is a component of type T associated with the number `index`, a mutable reference\n\n /// to this component is returned. If index is out of bounds or the number is not associated\n\n /// with the component type, None is returned.\n\n pub fn get_component_mut(&mut self, index: usize) -> Option<&mut T> {\n\n if let Some(map) = self.components.get_mut(index) {\n\n map.get_mut::()\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n /// Removes the component `T` associated with the number `index` and returns it.\n\n pub fn remove_component(&mut self, index: usize) -> Option {\n\n if let Some(map) = self.components.get_mut(index) {\n\n let mut signature = Vec::new();\n\n signature.extend_from_slice(&*self.signatures[index]);\n\n signature.retain(|x| *x != TypeId::of::());\n\n self.signatures[index] = signature.into_boxed_slice();\n","file_path":"src/ecs/src/component.rs","rank":21,"score":23325.733551889727},{"content":" struct FooComponent(u32);\n\n\n\n #[test]\n\n fn with_reference() {\n\n static INT_REF: &'static i32 = &15;\n\n\n\n #[derive(Debug, Eq, PartialEq)]\n\n struct RefHolder<'a> {\n\n r: &'a i32,\n\n }\n\n\n\n let mut comp_list = Components::new();\n\n comp_list.add_component(0usize, RefHolder { r: INT_REF });\n\n\n\n assert_eq!(comp_list.get_component_mut::(0usize).unwrap().r, &15);\n\n }\n\n\n\n #[test]\n\n fn addition_and_recovery() {\n\n let mut comp_list = Components::new();\n","file_path":"src/ecs/src/component.rs","rank":22,"score":23325.07154938627},{"content":"//! A module for the `Components` type. Through a `Components` you can add and remove\n\n//! any type that implements `Any` and has no non-static references.\n\n//! Should be used through the `World` and not directly.\n\nextern crate anymap;\n\n\n\nuse self::anymap::AnyMap;\n\nuse std::any::{Any, TypeId};\n\n\n\n/// This type holds a `Vec`. Entities are identified by their id (the 'key' of the\n\n/// vector) and AnyMap can hold one of each component type. An entity can only have either\n\n/// 0 or 1 component for a given component type. If you have entities 1 and 500 alive the\n\n/// vector will keep 500 `AnyMap`'s in memory. Even if you destroy every entity the memory\n\n/// of the components won't be freed. There's no way to \"drain\" the memory due to the\n\n/// way entity handles work.\n\npub struct Components {\n\n components: Vec,\n\n signatures: Vec>,\n\n}\n\n\n\nimpl Components {\n","file_path":"src/ecs/src/component.rs","rank":23,"score":23324.845000249312},{"content":" let mut signature = Vec::new();\n\n signature.extend_from_slice(&*self.signatures[index]);\n\n signature.push(TypeId::of::());\n\n self.signatures[index] = signature.into_boxed_slice();\n\n }\n\n }\n\n\n\n self.get_component_mut::(index)\n\n .expect(\"Component we just added was not found. This should never happen\")\n\n }\n\n\n\n /// If there is a component of type T associated with the number `index`, a reference to this\n\n /// component is returned. If index is out of bounds or the number is not associated with the\n\n /// component type, None is returned.\n\n pub fn get_component(&self, index: usize) -> Option<&T> {\n\n if let Some(map) = self.components.get(index) {\n\n map.get::()\n\n } else {\n\n None\n\n }\n","file_path":"src/ecs/src/component.rs","rank":24,"score":23324.088609595412},{"content":" for index in 0usize..100_000usize {\n\n assert_eq!(*comp_list.add_component(index, FooComponent(0u32)), FooComponent(0u32));\n\n assert_eq!(*comp_list.get_component::(index).unwrap(),\n\n FooComponent(0u32));\n\n assert_eq!(*comp_list.get_component_mut::(index).unwrap(),\n\n FooComponent(0u32));\n\n }\n\n }\n\n\n\n #[test]\n\n fn removal() {\n\n let mut comp_list = Components::new();\n\n let index = 0usize;\n\n\n\n assert_eq!(*comp_list.add_component(index, FooComponent(0u32)), FooComponent(0u32));\n\n assert_eq!(*comp_list.add_component(index, FooComponent(1u32)), FooComponent(1u32));\n\n\n\n assert_eq!(*comp_list.get_component::(index).unwrap(), FooComponent(1u32));\n\n assert_eq!(comp_list.remove_component::(index).unwrap(), FooComponent(1u32));\n\n assert_eq!(comp_list.get_component::(index).is_none(), true);\n\n assert_eq!(comp_list.remove_component::(index).is_none(), true);\n\n }\n\n}\n","file_path":"src/ecs/src/component.rs","rank":25,"score":23319.64496391107},{"content":" /// Constructs a new instance of `Entities`. The internal vectors are initialized with the\n\n /// specified capacity.\n\n /// # Examples\n\n /// ```\n\n /// use luck_ecs::entity::Entities;\n\n /// let mut entities: Entities = Entities::with_capacity(10);\n\n /// //The resulting Entities object will only allocate after the 11th entity is created.\n\n /// ```\n\n #[allow(unknown_lints)]\n\n #[allow(inline_always)]\n\n #[inline(always)]\n\n pub fn with_capacity(capacity: usize) -> Self {\n\n Entities {\n\n free_entity_ids: Vec::with_capacity(capacity),\n\n entities: Vec::with_capacity(capacity),\n\n }\n\n }\n\n\n\n /// Creates a new entity and return it's identification.\n\n /// # Examples\n","file_path":"src/ecs/src/entity.rs","rank":26,"score":22830.314742075363},{"content":" pub fn is_valid(&self, entity: Entity) -> bool {\n\n if let Some(key) = self.entities.get(entity.id as usize) {\n\n *key == entity.key\n\n } else {\n\n false\n\n }\n\n }\n\n}\n\n\n\nimpl iter::IntoIterator for Entities {\n\n type Item = Entity;\n\n type IntoIter = EntitiesIntoIterator;\n\n\n\n fn into_iter(self) -> Self::IntoIter {\n\n EntitiesIntoIterator {\n\n entities: self,\n\n index: 0,\n\n }\n\n }\n\n}\n","file_path":"src/ecs/src/entity.rs","rank":27,"score":22827.655297511956},{"content":" }\n\n }\n\n\n\n /// Constructs a new instance of `Entities`. The internal vectors are empty and will only\n\n /// allocate when an entity is created.\n\n /// # Examples\n\n /// ```\n\n /// use luck_ecs::entity::Entities;\n\n /// let mut entities = Entities::new();\n\n /// ```\n\n #[allow(unknown_lints)]\n\n #[allow(inline_always)]\n\n #[inline(always)]\n\n pub fn new() -> Self {\n\n Entities {\n\n free_entity_ids: Vec::new(),\n\n entities: Vec::new(),\n\n }\n\n }\n\n\n","file_path":"src/ecs/src/entity.rs","rank":28,"score":22827.411795675558},{"content":"\n\nimpl<'a> iter::IntoIterator for &'a Entities {\n\n type Item = Entity;\n\n type IntoIter = EntitiesIterator<'a>;\n\n\n\n fn into_iter(self) -> Self::IntoIter {\n\n EntitiesIterator {\n\n entities: self,\n\n index: 0,\n\n }\n\n }\n\n}\n\n\n\n/// An iterator that moves out the Entities object. Returns only entities that are valid.\n\npub struct EntitiesIntoIterator {\n\n entities: Entities,\n\n index: usize,\n\n}\n\n\n\nimpl iter::Iterator for EntitiesIntoIterator {\n","file_path":"src/ecs/src/entity.rs","rank":29,"score":22826.18626413114},{"content":"/// to the destroyed entity are considered dead.\n\npub struct Entities {\n\n free_entity_ids: Vec,\n\n entities: Vec,\n\n}\n\n\n\nimpl Entities {\n\n // Generates a new entity id and key either by reusing old ones or creating new ones.\n\n fn generate_entity_id(&mut self) -> (EntityId, EntityKey) {\n\n let free_id = self.free_entity_ids.pop();\n\n\n\n match free_id {\n\n None => {\n\n self.entities.push(1);\n\n (self.entities.len() as EntityId - 1, 1)\n\n }\n\n Some(free_id) => {\n\n let key = unsafe { self.entities.get_unchecked(free_id as usize) };\n\n (free_id, *key)\n\n }\n","file_path":"src/ecs/src/entity.rs","rank":30,"score":22826.089139651092},{"content":" /// entities.destroy_entity(entity);\n\n /// assert!(!entities.is_valid(entity));\n\n /// ```\n\n pub fn destroy_entity(&mut self, entity: Entity) {\n\n if self.is_valid(entity) {\n\n self.free_entity_ids.push(entity.id);\n\n self.entities[entity.id as usize] = self.entities[entity.id as usize] + 1;\n\n }\n\n }\n\n\n\n /// Returns the state of an entity. Entities created through an `Entities` object will return\n\n /// true. If they are destroyed or the `Entity` is invalid it will return false.\n\n /// # Examples\n\n /// ```\n\n /// use luck_ecs::entity::Entities;\n\n /// let mut entities: Entities = Entities::with_capacity(1);\n\n /// let entity = entities.create_entity();\n\n /// entities.destroy_entity(entity);\n\n /// assert!(!entities.is_valid(entity));\n\n /// ```\n","file_path":"src/ecs/src/entity.rs","rank":31,"score":22825.87116449901},{"content":" /// ```\n\n /// use luck_ecs::entity::Entities;\n\n /// let mut entities: Entities = Entities::with_capacity(1);\n\n /// let entity = entities.create_entity();\n\n /// ```\n\n #[allow(unknown_lints)]\n\n #[allow(inline_always)]\n\n #[inline(always)]\n\n pub fn create_entity(&mut self) -> Entity {\n\n let (id, key) = self.generate_entity_id();\n\n Entity { id: id, key: key }\n\n }\n\n\n\n /// Marks an entity as dead. The entity object is still in a valid state but call to\n\n /// `Entity::is_valid` will return false. Dead entities are ignored by the function.\n\n /// # Examples\n\n /// ```\n\n /// use luck_ecs::entity::Entities;\n\n /// let mut entities: Entities = Entities::with_capacity(1);\n\n /// let entity = entities.create_entity();\n","file_path":"src/ecs/src/entity.rs","rank":32,"score":22825.504087841255},{"content":"/// An iterator that does not move the Entities object. Returns only entities that are valid.\n\npub struct EntitiesIterator<'a> {\n\n entities: &'a Entities,\n\n index: usize,\n\n}\n\n\n\nimpl<'a> iter::Iterator for EntitiesIterator<'a> {\n\n type Item = Entity;\n\n fn next(&mut self) -> Option {\n\n loop {\n\n if let Some(key) = self.entities.entities.get(self.index) {\n\n self.index = self.index + 1;\n\n if !self.entities.free_entity_ids.contains(&((self.index - 1) as EntityId)) {\n\n return Some(Entity {\n\n id: (self.index - 1) as EntityId,\n\n key: *key,\n\n });\n\n } else {\n\n continue;\n\n }\n","file_path":"src/ecs/src/entity.rs","rank":33,"score":22825.45845153182},{"content":" // fn c() {\n\n // let mut entities: Entities = Entities::with_capacity(1_000_000usize);\n\n // for _ in 0..1_000_000 {\n\n // let _: Entity = entities.create_entity();\n\n // }\n\n // }\n\n // b.iter(c);\n\n // }\n\n\n\n // Tests the creation of 500.000 entities and the generation of their id's\n\n #[test]\n\n fn creation() {\n\n let mut entities: Entities = Entities::with_capacity(500_000usize);\n\n\n\n let base = EntityId::max_value() - 500_000;\n\n for i in base..EntityId::max_value() {\n\n let e: Entity = entities.create_entity();\n\n assert_eq!(((e.id + base), e.key), (i, 1));\n\n }\n\n }\n","file_path":"src/ecs/src/entity.rs","rank":34,"score":22825.238226510588},{"content":"\n\n // Tests the destruction and recreation of the entities and the reuse of deleted entity id's\n\n #[test]\n\n fn destruction_recreation() {\n\n let sample = 500_000usize;\n\n let mut entities: Entities = Entities::with_capacity(sample);\n\n\n\n let mut entity_list = Vec::with_capacity(sample);\n\n for i in 0..sample {\n\n let e: Entity = entities.create_entity();\n\n assert_eq!((e.id, e.key), (i as EntityId, 1));\n\n entity_list.push(e);\n\n }\n\n\n\n thread_rng().shuffle(&mut entity_list[..]);\n\n\n\n for e in entity_list {\n\n entities.destroy_entity(e);\n\n assert_eq!(entities.is_valid(e), false);\n\n let ne: Entity = entities.create_entity();\n","file_path":"src/ecs/src/entity.rs","rank":35,"score":22824.02778226625},{"content":"//! A module for two types, `Entity`and `Entities`. `Entity` represents an entity inside an\n\n//! `Entities` object which is responsible for managing an entity lifetime. The `Entities` type\n\n//! should be used through the `World` and not directly.\n\n\n\nuse std::iter;\n\n\n\n/// EntityId is a type that changes according to the pointer size of the target machines.\n\n/// It is supported `u64` for x64 machines and `u32` for x86 machines. Machines with\n\n/// different sizes might not work.\n\npub type EntityId = u64;\n","file_path":"src/ecs/src/entity.rs","rank":36,"score":22823.59788769363},{"content":" } else {\n\n return None;\n\n }\n\n }\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod test {\n\n // extern crate test;\n\n extern crate rand;\n\n use self::rand::{Rng, thread_rng};\n\n // use self::test::Bencher;\n\n use super::{Entity, Entities, EntityId};\n\n\n\n // Benchmark to test time time it takes to create a million entities, with level 3\n\n // optimizations the average time is 2,545,401 ns\n\n // #[bench]\n\n // fn creation_time(b: &mut Bencher) {\n","file_path":"src/ecs/src/entity.rs","rank":37,"score":22823.41861739785},{"content":" let mut iter = (&entities).into_iter();\n\n assert_eq!(iter.next(), Some(ent_list[0]));\n\n assert_eq!(iter.next(), Some(ent_list[1]));\n\n assert_eq!(iter.next(), Some(ent_list[3]));\n\n assert_eq!(iter.next(), None);\n\n\n\n }\n\n\n\n // Test to check if EntityId is smaller or equal to usize, since vectors use usize as key and\n\n // EntityId is used as the key of the vector.\n\n #[test]\n\n #[allow(unknown_lints)]\n\n #[allow(unused_comparisons)]\n\n #[allow(absurd_extreme_comparisons)]\n\n fn type_size() {\n\n let max_id = EntityId::max_value() as u64;\n\n let max_usize = usize::max_value() as u64;\n\n\n\n if max_id > max_usize || EntityId::min_value() < 0 {\n\n panic!(\"Type must be contained by usize\")\n\n }\n\n }\n\n}\n","file_path":"src/ecs/src/entity.rs","rank":38,"score":22822.93957560089},{"content":" type Item = Entity;\n\n fn next(&mut self) -> Option {\n\n loop {\n\n if let Some(key) = self.entities.entities.get(self.index) {\n\n self.index = self.index + 1;\n\n if !self.entities.free_entity_ids.contains(&((self.index - 1) as EntityId)) {\n\n return Some(Entity {\n\n id: (self.index - 1) as EntityId,\n\n key: *key,\n\n });\n\n } else {\n\n continue;\n\n }\n\n } else {\n\n return None;\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/ecs/src/entity.rs","rank":39,"score":22821.807857558302},{"content":" assert_eq!((ne.id, ne.key), (e.id, e.key + 1));\n\n }\n\n }\n\n\n\n #[test]\n\n // Tests the iterator logic\n\n fn iteration() {\n\n let mut entities: Entities = Entities::new();\n\n\n\n let ent_list = [entities.create_entity(),\n\n entities.create_entity(),\n\n entities.create_entity(),\n\n entities.create_entity()];\n\n\n\n for (i, e) in (&entities).into_iter().enumerate() {\n\n assert_eq!(e, ent_list[i]);\n\n }\n\n\n\n entities.destroy_entity(ent_list[2]);\n\n\n","file_path":"src/ecs/src/entity.rs","rank":40,"score":22821.27377592302},{"content":"fn half_plane_test(p: Vector3, normal: Vector3, offset: f32) -> i32 {\n\n let dist = dot(p, normal) + offset;\n\n if dist > 0.02 {\n\n 1\n\n } else if dist < -0.02 {\n\n 0\n\n } else {\n\n 2\n\n }\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":59,"score":20125.03447205598},{"content":"#![allow(unused_features)]\n\n#![warn(missing_docs)]\n\n\n\n//#![feature(test)]\n\n//#![feature(fnbox)]\n\n\n\n//! TODO: Fill the documentation\n\n\n\n#[macro_use]\n\nextern crate mopa;\n\nextern crate rayon;\n\n\n\npub mod entity;\n\nmod component;\n\n#[macro_use]\n\npub mod system;\n\nmod world;\n\n\n\npub use entity::Entity;\n\npub use component::Components;\n\npub use system::{System, Signature};\n\npub use world::{World, WorldBuilder};\n","file_path":"src/ecs/src/lib.rs","rank":60,"score":17.872438188000544},{"content":"use std::ops::{Add, Mul};\n\nuse num::traits::{One, Zero};\n\nuse super::{Matrix4, Vector3, atan2, cross, cos, sin};\n\n\n\n/// A [quaternion](https://en.wikipedia.org/wiki/Quaternion) type.\n\n#[derive(Default, PartialEq, Debug, Copy, Clone)]\n\npub struct Quaternion {\n\n ///\n\n pub x: f32,\n\n ///\n\n pub y: f32,\n\n ///\n\n pub z: f32,\n\n ///\n\n pub w: f32,\n\n}\n\n\n\nimpl Quaternion {\n\n /// Returns a new instance of a quaternion with the specified values.\n\n pub fn new(x: f32, y: f32, z: f32, w: f32) -> Self {\n","file_path":"src/math/src/quaternion.rs","rank":61,"score":11.328614089368376},{"content":" }\n\n\n\n fn yaw(&self) -> f32 {\n\n let q = *self;\n\n (-2.0 * (q.x * q.z - q.w * q.y)).asin()\n\n }\n\n}\n\n\n\nimpl Zero for Quaternion {\n\n fn zero() -> Self {\n\n Quaternion::new(0.0, 0.0, 0.0, 1.0)\n\n }\n\n fn is_zero(&self) -> bool {\n\n Quaternion::zero() == *self\n\n }\n\n}\n\n\n\nimpl One for Quaternion {\n\n fn one() -> Self {\n\n Quaternion::new(1.0, 1.0, 1.0, 1.0)\n","file_path":"src/math/src/quaternion.rs","rank":62,"score":10.65688219135194},{"content":" pub min: Vector3,\n\n /// The maximum value.\n\n pub max: Vector3,\n\n}\n\n\n\nimpl Default for Aabb {\n\n /// Returns a null AABB.\n\n fn default() -> Aabb {\n\n let mut r = Aabb {\n\n min: Vector3::zero() + 1.0,\n\n max: Vector3::zero() - 1.0,\n\n };\n\n r.set_null();\n\n r\n\n }\n\n}\n\n\n\nimpl Aabb {\n\n /// Returns a new instance of Aabb with the specified values.\n\n pub fn new(p1: Vector3, p2: Vector3) -> Self {\n","file_path":"src/math/src/aabb.rs","rank":63,"score":9.727759718227901},{"content":" }\n\n\n\n /// Returns a vertex list for this Aabb. Useful for debug rendering or operations that\n\n /// require every point and not just the min and max.\n\n pub fn vertices(&self) -> [Vector3; 8] {\n\n [self.min,\n\n Vector3::new(self.max.x, self.min.y, self.min.z),\n\n Vector3::new(self.min.x, self.max.y, self.min.z),\n\n Vector3::new(self.min.x, self.min.y, self.max.z),\n\n Vector3::new(self.min.x, self.max.y, self.max.z),\n\n Vector3::new(self.max.x, self.min.y, self.max.z),\n\n Vector3::new(self.max.x, self.max.y, self.min.z),\n\n self.max]\n\n }\n\n\n\n /// This function considers the Aabb as a box, rotates it and then calculates a new Aabb for\n\n /// the rotated box. Rotating the same Aabb over and over will only make it grow.\n\n pub fn rotate(&mut self, orientation: super::Quaternion) {\n\n let mut v = self.vertices();\n\n\n","file_path":"src/math/src/aabb.rs","rank":64,"score":8.479642376192107},{"content":" let mut r = Aabb::default();\n\n r.extend_by_vec(p1);\n\n r.extend_by_vec(p2);\n\n r\n\n }\n\n\n\n /// Returns a new instance of Aabb considering a center and a radius.\n\n pub fn with_center(center: Vector3, radius: f32) -> Self {\n\n let mut r = Aabb::default();\n\n r.extend_by_radius(center, radius);\n\n r\n\n }\n\n\n\n /// Sets the Aabb to an invalid state.\n\n pub fn set_null(&mut self) {\n\n *self = Aabb {\n\n min: Vector3::new(1.0, 1.0, 1.0),\n\n max: Vector3::new(-1.0, -1.0, -1.0),\n\n };\n\n }\n","file_path":"src/math/src/aabb.rs","rank":65,"score":8.38620105674871},{"content":" pub fn extend_by_aabb(&mut self, aabb: Aabb) {\n\n if !aabb.is_null() {\n\n self.extend_by_vec(aabb.min);\n\n self.extend_by_vec(aabb.max);\n\n }\n\n }\n\n\n\n /// TODO\n\n pub fn extend_disk(&mut self, c: Vector3, n: Vector3, r: f32) {\n\n if super::length(n) < 1e-12 {\n\n self.extend_by_vec(c);\n\n } else {\n\n let norm = super::normalize(n);\n\n let x = (1.0 - norm.x).sqrt() * r;\n\n let y = (1.0 - norm.y).sqrt() * r;\n\n let z = (1.0 - norm.y).sqrt() * r;\n\n self.extend_by_vec(c + Vector3::new(x, y, z));\n\n self.extend_by_vec(c - Vector3::new(x, y, z));\n\n }\n\n }\n","file_path":"src/math/src/aabb.rs","rank":66,"score":8.295783890503309},{"content":" }\n\n\n\n /// Combines two Aabb's and the result in as Aabb that encompasses both parameters.\n\n pub fn combine(&mut self, aabb1: Aabb, aabb2: Aabb) {\n\n self.min = Vector3::new(super::min(aabb1.min.x, aabb2.min.x),\n\n super::min(aabb1.min.y, aabb2.min.y),\n\n super::min(aabb1.min.z, aabb2.min.z));\n\n self.max = Vector3::new(super::max(aabb1.max.x, aabb2.max.x),\n\n super::max(aabb1.max.y, aabb2.max.y),\n\n super::max(aabb1.max.z, aabb2.max.z));\n\n }\n\n\n\n /// Returns true if this Aabb contains the aabb parameter.\n\n pub fn contains(&self, aabb: Aabb) -> bool {\n\n let mut result = true;\n\n result = result && self.min.x <= aabb.min.x;\n\n result = result && self.min.y <= aabb.min.y;\n\n result = result && aabb.max.x <= self.max.x;\n\n result = result && aabb.max.y <= self.max.y;\n\n result\n","file_path":"src/math/src/aabb.rs","rank":67,"score":8.255984608840372},{"content":" ret\n\n }\n\n}\n\n\n\nimpl Mul> for Quaternion {\n\n type Output = Vector3;\n\n fn mul(self, rhs: Vector3) -> Vector3 {\n\n let quat_vector = Vector3::new(self.x, self.y, self.z);\n\n let uv = cross(quat_vector, rhs);\n\n let uuv = cross(quat_vector, uv);\n\n\n\n rhs + ((uv * self.w) + uuv) * 2f32\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::Quaternion;\n\n use super::super::Vector3;\n\n use num::traits::{One, Zero};\n","file_path":"src/math/src/quaternion.rs","rank":68,"score":8.09708777563528},{"content":"\n\n /// Checks the Aabb state.\n\n pub fn is_null(&self) -> bool {\n\n self.min.x > self.max.x || self.min.y > self.max.y || self.min.z > self.max.z\n\n }\n\n\n\n /// Extends the Aabb size by a value. This value is subtracted from the min vector and\n\n /// added to the max vector.\n\n pub fn extend_by_value(&mut self, val: f32) {\n\n if !self.is_null() {\n\n self.min = self.min - Vector3::new(val, val, val);\n\n self.max = self.max + Vector3::new(val, val, val);\n\n }\n\n }\n\n\n\n /// Extends the Aabb by a Vector3. The min vector becomes a combination of itself and the\n\n /// parameter p, having the smallest value of both. The same goes for the max vector.\n\n pub fn extend_by_vec(&mut self, p: Vector3) {\n\n if !self.is_null() {\n\n self.min = super::min(p, self.min);\n","file_path":"src/math/src/aabb.rs","rank":69,"score":8.004078743492284},{"content":" let mut mat_model = super::Matrix4::one();\n\n mat_model = mat_model * orientation.to_mat4();\n\n\n\n for vertex in &mut v {\n\n let temp = mat_model * super::Vector4::new(vertex.x, vertex.y, vertex.z, 1.0);\n\n *vertex = super::Vector3::new(temp.x, temp.y, temp.z);\n\n }\n\n\n\n self.min = v[0];\n\n self.max = v[0];\n\n\n\n for vertex in &v {\n\n self.min = super::min(self.min, *vertex);\n\n self.max = super::max(self.max, *vertex);\n\n }\n\n }\n\n}\n","file_path":"src/math/src/aabb.rs","rank":70,"score":7.388182561280377},{"content":" self.max = super::max(p, self.max);\n\n } else {\n\n self.min = p;\n\n self.max = p;\n\n }\n\n }\n\n\n\n /// Extends an aabb by the specified radius.\n\n pub fn extend_by_radius(&mut self, p: Vector3, radius: f32) {\n\n let r = Vector3::::new(radius, radius, radius);\n\n if !self.is_null() {\n\n self.min = super::min(p - r, self.min);\n\n self.max = super::max(p - r, self.max);\n\n } else {\n\n self.min = p - r;\n\n self.max = p + r;\n\n }\n\n }\n\n\n\n /// Extends this aabb so the parameter aabb can fit within it.\n","file_path":"src/math/src/aabb.rs","rank":71,"score":7.203916199777408},{"content":"//! A module for the AABB type. It also exposes an enum type for intersection tests.\n\n\n\nuse super::Vector3;\n\nuse num::traits::{Zero, One};\n\n\n\n/// The return type of `Aabb::intersect`.\n\n#[derive(Copy, Clone, Eq, PartialEq)]\n\npub enum IntersectionType {\n\n ///\n\n INSIDE,\n\n ///\n\n INTERSECT,\n\n ///\n\n OUTSIDE,\n\n}\n\n\n\n/// An AABB represented by two `Vector3`.\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Aabb {\n\n /// The minimum value.\n","file_path":"src/math/src/aabb.rs","rank":72,"score":6.230538231147824},{"content":"#![warn(missing_docs)]\n\n#![warn(unused)]\n\n\n\n//! TODO: Fill the documentation\n\n\n\nextern crate glm;\n\nextern crate num;\n\n\n\npub mod aabb;\n\nmod quaternion;\n\nmod extensions;\n\n\n\npub use glm::*;\n\npub use aabb::Aabb;\n\npub use quaternion::*;\n\npub use extensions::*;\n","file_path":"src/math/src/lib.rs","rank":73,"score":6.118785857989355},{"content":"use super::{Vector3, Vector4, Matrix4, normalize, cross, dot};\n\nuse num::traits::{Zero, One};\n\n\n\n/// Returns a look at matrix from the supplied parameters. Eye is the camera position, center is\n\n/// the location you want the camera to point, up is the up direction in whichever abstraction\n\n/// you are working with (usually `Vector3::new(0, 1, 0)`).\n","file_path":"src/math/src/extensions.rs","rank":74,"score":6.067908863181045},{"content":"extern crate luck_ecs;\n\nextern crate luck_math;\n\nextern crate luck_core;\n\n\n\npub use luck_ecs as ecs;\n\npub use luck_math as math;\n\npub use luck_core as core;\n","file_path":"src/lib.rs","rank":75,"score":5.7868992219825515},{"content":" /// Returns true if both Aabb's a sufficiently similar.\n\n pub fn similar_to(&self, b: Aabb, diff: f32) -> bool {\n\n if self.is_null() || b.is_null() {\n\n return false;\n\n }\n\n\n\n let acceptable_diff = ((self.diagonal() + b.diagonal()) / 2.0) * diff;\n\n let mut min_diff = self.min - b.min;\n\n min_diff = Vector3::new(min_diff.x.abs(), min_diff.y.abs(), min_diff.z.abs());\n\n if min_diff.x > acceptable_diff.x {\n\n return false;\n\n }\n\n if min_diff.y > acceptable_diff.y {\n\n return false;\n\n }\n\n if min_diff.z > acceptable_diff.z {\n\n return false;\n\n }\n\n\n\n let mut max_diff = self.max - b.max;\n","file_path":"src/math/src/aabb.rs","rank":76,"score":5.665930984227547},{"content":" Quaternion {\n\n x: x,\n\n y: y,\n\n z: z,\n\n w: w,\n\n }\n\n }\n\n\n\n /// Converts a rotation vector3 into a quaternion. The vector paramater should be supplied\n\n /// in radians.\n\n pub fn from_euler(v: Vector3) -> Self {\n\n // TODO: Should this receive parameters in degrees or radians?\n\n let c = cos(v * 0.5);\n\n let s = sin(v * 0.5);\n\n\n\n let mut ret = Quaternion::zero();\n\n\n\n ret.w = c.x * c.y * c.z + s.x * s.y * s.z;\n\n ret.x = s.x * c.y * c.z - c.x * s.y * s.z;\n\n ret.y = c.x * s.y * c.z + s.x * c.y * s.z;\n","file_path":"src/math/src/quaternion.rs","rank":77,"score":5.418220532430256},{"content":" }\n\n}\n\n\n\nimpl Add for Quaternion {\n\n type Output = Quaternion;\n\n fn add(self, rhs: Quaternion) -> Quaternion {\n\n Quaternion::new(self.x + rhs.x, self.y + rhs.y, self.z + rhs.z, self.w + rhs.w)\n\n }\n\n}\n\n\n\nimpl Mul for Quaternion {\n\n type Output = Quaternion;\n\n fn mul(self, rhs: Quaternion) -> Quaternion {\n\n let mut ret = Quaternion::one();\n\n\n\n ret.w = (self.w * rhs.w) - (self.x * rhs.x) - (self.y * rhs.y) - (self.z * rhs.z);\n\n ret.x = (self.w * rhs.x) + (self.x * rhs.w) + (self.y * rhs.z) - (self.z * rhs.y);\n\n ret.y = (self.w * rhs.y) + (self.y * rhs.w) + (self.z * rhs.x) - (self.x * rhs.z);\n\n ret.z = (self.w * rhs.z) + (self.z * rhs.w) + (self.x * rhs.y) - (self.y * rhs.x);\n\n\n","file_path":"src/math/src/quaternion.rs","rank":78,"score":4.884210096003048},{"content":" pub fn scale(&mut self, s: Vector3, o: Vector3) {\n\n if !self.is_null() {\n\n self.min = self.min - o;\n\n self.max = self.max - o;\n\n\n\n self.min = self.min * s;\n\n self.max = self.max * s;\n\n\n\n self.min = self.min + o;\n\n self.max = self.max + o;\n\n }\n\n }\n\n\n\n /// Returns true if both Aabb's overlap.\n\n pub fn overlaps(&self, bb: Aabb) -> bool {\n\n !((self.is_null() || bb.is_null()) || (bb.min.x > self.max.x || bb.max.x < self.min.x) ||\n\n (bb.min.y > self.max.y || bb.max.y < self.min.y) ||\n\n (bb.min.z > self.max.z || bb.max.z < self.min.z))\n\n }\n\n\n","file_path":"src/math/src/aabb.rs","rank":79,"score":4.750786871122639},{"content":"\n\n /// Returns the center of the aabb. If the Aabb is null, Vector3::zero is returned.\n\n pub fn center(&self) -> Vector3 {\n\n if !self.is_null() {\n\n let d = self.diagonal();\n\n self.min + (d * 0.5)\n\n } else {\n\n Vector3::zero()\n\n }\n\n }\n\n\n\n /// Translates the Aabb by a vector.\n\n pub fn translate(&mut self, v: Vector3) {\n\n if !self.is_null() {\n\n self.min = self.min + v;\n\n self.max = self.max + v;\n\n }\n\n }\n\n\n\n /// Scales the Aabb by s considering o as the origin.\n","file_path":"src/math/src/aabb.rs","rank":80,"score":3.810857153083732},{"content":"\n\n #[test]\n\n #[allow(approx_constant)] //1.5708 being near pi/2 is not relevant\n\n fn conversion_operations() {\n\n let q = Quaternion::new(1.0, 0.0, 0.0, 1.0);\n\n\n\n // We need some back and forth conversions since the same euler angle can be represented\n\n // in different ways.\n\n let mut q = Quaternion::from_euler(q.to_euler()).to_euler();\n\n //Due to precision loss we need some rounding\n\n q.x = (q.x * 10000.0).round() / 10000.0;\n\n assert_eq!(q, Vector3::new(1.5708, -0.0, 0.0));\n\n\n\n // TODO: Test Quaternion::to_mat4\n\n }\n\n\n\n #[test]\n\n fn num_operations() {\n\n assert_eq!(Quaternion::zero(), Quaternion::new(0.0, 0.0, 0.0, 1.0));\n\n assert_eq!(Quaternion::one(), Quaternion::new(1.0, 1.0, 1.0, 1.0));\n","file_path":"src/math/src/quaternion.rs","rank":81,"score":3.754885954649541},{"content":"![](\"https://travis-ci.org/lukebitts/Luck.svg\")
\n\n\n\n![](\"documentation/images/logo.png\")
\n\n\n\n# Luck\n\n\n\nLuck is a personal game engine project I'm working on to help me learn Rust. I\n\ndo not actively support it besides working on whatever interests me, but feel\n\nfree to use this code if it is in any way useful to you. It is not by any means\n\ncompleted and/or stable.\n\n\n\n\n\n## Sub-projects\n\n\n\nThis project is divided into several sub-projects:\n\n\n\n### ECS\n\n\n\nLuck ECS is an Entity-Component system, it has no dependecy on the rest of the\n\nengine and can be used by itself.\n\n\n\n### Math\n\n\n\nLuck Math depends on glm-rs and reexports the library adding a few functions and\n\ntypes that glm-rs did not port from glm. It provides a Quaternion and AABB\n\ntypes.\n\n\n\n### Core\n\n\n\n Luck Core is the implementation of the engine as a framework, there you can\n\n find rendering code, physics, cameras, etc. It has a number of dependecies\n\n which can be found in the cargo file.\n\n\n\n# Building\n\n\n\nTo build Luck, simply run `cargo build` in the root folder. It requires\n\n`rustc 1.8.0-nightly (57c357d89 2016-02-16)`. Due to some of the dependecies\n\nit can't be compiled on stable yet.\n\n\n\n# Travis\n\n\n\nThe project doesn't build on Travis because [Clippy][clippy] requires a very\n\nspecific `rustc` version. I'll fix it eventually.\n\n\n\n[clippy]: https://github.com/Manishearth/rust-clippy\n","file_path":"README.md","rank":82,"score":3.746898056374145},{"content":"\n\n let q = Quaternion::one();\n\n assert_eq!(q + q, Quaternion::new(2.0, 2.0, 2.0, 2.0));\n\n\n\n let q = Quaternion::zero();\n\n assert_eq!(q * q, q);\n\n\n\n let q = Quaternion::new(1.0, 0.0, 0.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(2.0, 0.0, 0.0, 0.0));\n\n\n\n let q = Quaternion::new(0.0, 1.0, 0.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(0.0, 2.0, 0.0, 0.0));\n\n\n\n let q = Quaternion::new(0.0, 0.0, 1.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(0.0, 0.0, 2.0, 0.0));\n\n\n\n let q = Quaternion::new(1.0, 0.0, 0.0, 1.0);\n\n let v = Vector3::new(1.0, 1.0, 1.0);\n\n assert_eq!(q * v, Vector3::new(1.0, -3.0, 1.0));\n\n }\n\n\n\n}\n","file_path":"src/math/src/quaternion.rs","rank":83,"score":3.4145506180563525},{"content":" ret.c2.z = 1.0 - 2.0 * (q.x).powi(2) - 2.0 * (q.y).powi(2);\n\n\n\n ret\n\n }\n\n\n\n /// Returns the quaternion rotation in euler angles. The resulting angle is represented\n\n /// in radians.\n\n pub fn to_euler(&self) -> Vector3 {\n\n // TODO: Should this return in degrees or radians?\n\n Vector3::new(self.pitch(), self.yaw(), self.roll())\n\n }\n\n\n\n fn roll(&self) -> f32 {\n\n let q = *self;\n\n atan2(2.0 * (q.x * q.y + q.w * q.z), q.w * q.w + q.x * q.x - q.y * q.y - q.z * q.z)\n\n }\n\n\n\n fn pitch(&self) -> f32 {\n\n let q = *self;\n\n atan2(2.0 * (q.y * q.z + q.w * q.x), q.w * q.w - q.x * q.x - q.y * q.y + q.z * q.z)\n","file_path":"src/math/src/quaternion.rs","rank":84,"score":3.333072692141014},{"content":" ret.z = c.x * c.y * s.z - s.x * s.y * c.z;\n\n\n\n ret\n\n }\n\n\n\n /// Creates a rotation matrix from the quaternion.\n\n pub fn to_mat4(&self) -> Matrix4 {\n\n let mut ret = Matrix4::::one();\n\n let q = self;\n\n\n\n ret.c0.x = 1.0 - 2.0 * (q.y).powi(2) - 2.0 * (q.z).powi(2);\n\n ret.c0.y = 2.0 * q.x * q.y + 2.0 * q.z * q.w;\n\n ret.c0.z = 2.0 * q.x * q.z - 2.0 * q.y * q.w;\n\n\n\n ret.c1.x = 2.0 * q.x * q.y - 2.0 * q.z * q.w;\n\n ret.c1.y = 1.0 - 2.0 * (q.x).powi(2) - 2.0 * (q.z).powi(2);\n\n ret.c1.z = 2.0 * q.y * q.z + 2.0 * q.x * q.w;\n\n\n\n ret.c2.x = 2.0 * q.x * q.z + 2.0 * q.y * q.w;\n\n ret.c2.y = 2.0 * q.y * q.z - 2.0 * q.x * q.w;\n","file_path":"src/math/src/quaternion.rs","rank":85,"score":3.108507769858699},{"content":" max_diff = Vector3::new(max_diff.x.abs(), max_diff.y.abs(), max_diff.z.abs());\n\n if max_diff.x > acceptable_diff.x {\n\n return false;\n\n }\n\n if max_diff.y > acceptable_diff.y {\n\n return false;\n\n }\n\n if max_diff.z > acceptable_diff.z {\n\n return false;\n\n }\n\n\n\n true\n\n }\n\n\n\n /// Returns the perimeter of the Aabb.\n\n pub fn perimeter(&self) -> f32 {\n\n let wx = self.max.x - self.min.x;\n\n let wy = self.max.y - self.min.y;\n\n\n\n 2.0 * (wx + wy)\n","file_path":"src/math/src/aabb.rs","rank":86,"score":2.8936102494301985},{"content":"# Contributing to Luck\n\n\n\nFeel free to send a pull request or open an issue. I can't guarantee that I will\n\nanswer, but I'm not actively ignoring this project.\n\n\n\n## Documentation and wording mistakes\n\n\n\nSince english is not my first language, the comments and documentation may be difficult to understand and/or have spelling mistakes. Feel free to open an issue or send a pull request to fix.\n","file_path":"CONTRIBUTING.md","rank":87,"score":2.5496921078886103},{"content":"\n\n /// Returns the diagonal of the AABB which is defined as Aabb::max - Aabb::min. If the Aabb\n\n /// is null, Vector3::zero() is returned.\n\n pub fn diagonal(&self) -> Vector3 {\n\n if !self.is_null() {\n\n self.max - self.min\n\n } else {\n\n Vector3::zero()\n\n }\n\n }\n\n\n\n /// Returns the longest edge.\n\n pub fn longest_edge(&self) -> f32 {\n\n self.diagonal().x.max(self.diagonal().y).max(self.diagonal().z)\n\n }\n\n\n\n /// Returns the shortest edge.\n\n pub fn shortest_edge(&self) -> f32 {\n\n self.diagonal().x.min(self.diagonal().y).min(self.diagonal().z)\n\n }\n","file_path":"src/math/src/aabb.rs","rank":88,"score":2.4169862063500824},{"content":"# Change Log\n\n\n\nAll notable per-release changes will be documented in this file. This project\n\nadheres to [Semantic Versioning][sv].\n\n\n\n[sv]: http://semver.org/\n\n\n\n## Unreleased\n\n### Added\n\n* Added support to rust stable.\n\n\n\n### Removed\n\n* Removed dependency on Clippy and added allow unknown lints to the Clippy\n\n allow lints. Clippy should still be run on the project but through Cargo.\n\n* Removed benchmark tests since they are unstable.\n\n* Removed dependency on FnBox since it is still unstable (and there is no\n\n advantage over FnMut?)\n\n\n\n## 0.2.0 (2016-02-24) 🍀\n\n### Added\n\n* Added a language disclaimer to the CONTRIBUTING file.\n\n* Added a rustfmt.toml to the project.\n\n* Added a .travis.yml file to support integration with Travis.\n\n* Added code to the math module.\n\n* Added a \"Building\" session to the README file.\n\n\n\n### Changed\n\n* Changed the README file to look prettier in github.\n\n* Bumped the version of the ECS module from 0.1.0 to 0.1.1\n\n* Created some tests for the Quaternion code and fixed a bug with quaternion\n\n multiplication.\n\n\n\n## 0.1.0 (2016-02-22)\n\n### Added\n\n* Completed the ECS module. Fully documented.\n\n\n\n## 0.0.1 (2016-02-20)\n\n* Initial release\n","file_path":"CHANGELOG.md","rank":89,"score":2.3204857198845388},{"content":"\n\n/// The result of a call to `is_box_in_frustum`\n\n#[derive(Eq, PartialEq)]\n\npub enum FrustumTestResult {\n\n ///\n\n OUTSIDE = 0,\n\n ///\n\n INSIDE = 1,\n\n ///\n\n INTERSECT = 3,\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":90,"score":2.1603048517417305},{"content":" ret = 0;\n\n break;\n\n }\n\n\n\n idx = vector_to_index(-plane_normal);\n\n test_point = origin + half_dim * corner_offsets[idx as usize];\n\n\n\n if half_plane_test(test_point, plane_normal, plane.w) == 0 {\n\n ret |= 2;\n\n }\n\n }\n\n\n\n match ret {\n\n 0 => FrustumTestResult::OUTSIDE,\n\n 1 => FrustumTestResult::INSIDE,\n\n 3 => FrustumTestResult::INTERSECT,\n\n _ => unreachable!(),\n\n }\n\n}\n\n\n","file_path":"src/math/src/extensions.rs","rank":91,"score":1.648352955037661},{"content":" /// Calculates the intersection type between two Aabb's.\n\n pub fn intersect(&self, b: Aabb) -> IntersectionType {\n\n if self.is_null() || b.is_null() {\n\n return IntersectionType::OUTSIDE;\n\n }\n\n\n\n if (self.max.x < b.min.x) || (self.min.x > b.max.x) || (self.max.y < b.min.y) ||\n\n (self.min.y > b.max.y) || (self.max.z < b.min.z) || (self.min.z > b.max.z) {\n\n return IntersectionType::OUTSIDE;\n\n }\n\n\n\n if (self.min.x <= b.min.x) && (self.max.x >= b.max.x) && (self.min.y <= b.min.y) &&\n\n (self.max.y >= b.max.y) && (self.min.z <= b.min.z) &&\n\n (self.max.z >= b.max.z) {\n\n return IntersectionType::INSIDE;\n\n }\n\n\n\n IntersectionType::INTERSECT\n\n }\n\n\n","file_path":"src/math/src/aabb.rs","rank":92,"score":1.3696065971002849}],"string":"[\n {\n \"content\": \"/// A trait that describes which components the system should process. It is split from the\\n\\n/// System trait to allow it to be implemented through the impl_signature macro.\\n\\npub trait Signature : mopa::Any + Send + Sync {\\n\\n /// Should return the components this system expects to process.\\n\\n fn signature(&self) -> Box<[TypeId]>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ecs/src/system.rs\",\n \"rank\": 1,\n \"score\": 123332.91070441963\n },\n {\n \"content\": \"/// A trait that every System struct should implement.\\n\\npub trait System : Signature {\\n\\n // TODO: Add a on_drop event? Implementing Drop for a system is useless since it is only\\n\\n // called after the World already cleaned it.\\n\\n\\n\\n /// Should return true if an entity add event has been received by this System.\\n\\n fn has_entity(&self, entity: Entity) -> bool;\\n\\n\\n\\n /// This event is fired everytime the signature of an entity matches the signature of the\\n\\n /// system and the system has not received this entity yet (checked through has_entity).\\n\\n fn on_entity_added(&mut self, entity: Entity);\\n\\n\\n\\n /// This event is fired everytime the signature of an entity doesn't match the signature of the\\n\\n /// system the system has a reference to this entity (checked through has_entity).\\n\\n fn on_entity_removed(&mut self, entity: Entity);\\n\\n\\n\\n /// This event is fired every frame. Only read only operations can be done during the proccess\\n\\n /// itself since this step is run concurrently. Multable changes have to be done inside the\\n\\n /// returning function witch will be run in order depending on the orther the systems were\\n\\n /// added to the World.\\n\\n fn process(&self, _: &World) -> Box {\\n\",\n \"file_path\": \"src/ecs/src/system.rs\",\n \"rank\": 2,\n \"score\": 91302.64345194987\n },\n {\n \"content\": \"/// Normalizes x and y. Also makes sure y is orthogonal to x.\\n\\npub fn orthonormalize(x: &mut Vector3, y: &mut Vector3) {\\n\\n *x = normalize(*x);\\n\\n *y = normalize(*x - *y * dot(*y, *x));\\n\\n}\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 3,\n \"score\": 82128.01477523068\n },\n {\n \"content\": \"/// Returns a perspective matrix from the camera parameters.\\n\\npub fn frustum(left: f32,\\n\\n right: f32,\\n\\n bottom: f32,\\n\\n top: f32,\\n\\n near_val: f32,\\n\\n far_val: f32)\\n\\n -> Matrix4 {\\n\\n let mut result = Matrix4::zero();\\n\\n\\n\\n result.c0.x = (2.0 * near_val) / (right - left);\\n\\n result.c1.y = (2.0 * near_val) / (top - bottom);\\n\\n result.c2.x = (right + left) / (right - left);\\n\\n result.c2.y = (top + bottom) / (top - bottom);\\n\\n result.c2.w = 1.0;\\n\\n\\n\\n result.c2.z = far_val / (far_val - near_val);\\n\\n result.c3.z = -(far_val * near_val) / (far_val - near_val);\\n\\n\\n\\n result\\n\\n}\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 4,\n \"score\": 55062.31172451815\n },\n {\n \"content\": \"/// Returns an orthogonal matrix from the camera parameters.\\n\\npub fn ortho(left: f32,\\n\\n right: f32,\\n\\n bottom: f32,\\n\\n top: f32,\\n\\n near_val: f32,\\n\\n far_val: f32)\\n\\n -> Matrix4 {\\n\\n let mut res = Matrix4::one();\\n\\n res.c0.x = 2.0 / (right - left);\\n\\n res.c1.y = 2.0 / (top - bottom);\\n\\n res.c3.x = -(right + left) / (right - left);\\n\\n res.c3.y = -(top + bottom) / (top - bottom);\\n\\n\\n\\n res.c2.z = 1.0 / (far_val - near_val);\\n\\n res.c3.z = -near_val / (far_val - near_val);\\n\\n\\n\\n res\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 5,\n \"score\": 55062.31172451815\n },\n {\n \"content\": \"/// Returns true if a box (or aabb) is inside the defined 6 plane frustrum.\\n\\npub fn is_box_in_frustum(origin: Vector3,\\n\\n half_dim: Vector3,\\n\\n planes: [Vector4; 6])\\n\\n -> FrustumTestResult {\\n\\n let corner_offsets = [Vector3::new(-1.0, -1.0, -1.0),\\n\\n Vector3::new(-1.0, -1.0, 1.0),\\n\\n Vector3::new(-1.0, 1.0, -1.0),\\n\\n Vector3::new(-1.0, 1.0, 1.0),\\n\\n Vector3::new(1.0, -1.0, -1.0),\\n\\n Vector3::new(1.0, -1.0, 1.0),\\n\\n Vector3::new(1.0, 1.0, -1.0),\\n\\n Vector3::new(1.0, 1.0, 1.0)];\\n\\n let mut ret = 1;\\n\\n for plane in &planes {\\n\\n let plane_normal = Vector3::new(plane.x, plane.y, plane.z);\\n\\n let mut idx = vector_to_index(plane_normal);\\n\\n\\n\\n let mut test_point = origin + half_dim * corner_offsets[idx as usize];\\n\\n\\n\\n if half_plane_test(test_point, plane_normal, plane.w) == 0 {\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 6,\n \"score\": 50808.842977349224\n },\n {\n \"content\": \"/// Scales a matrix by a vector3.\\n\\npub fn scale(m: Matrix4, v: Vector3) -> Matrix4 {\\n\\n let mut res = Matrix4::one();\\n\\n res.c0 = m[0] * v[0];\\n\\n res.c1 = m[1] * v[1];\\n\\n res.c2 = m[2] * v[2];\\n\\n res.c3 = m[3];\\n\\n res\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 7,\n \"score\": 44209.35005659563\n },\n {\n \"content\": \"/// Translates a matrix by a vector3.\\n\\npub fn translate(m: Matrix4, v: Vector3) -> Matrix4 {\\n\\n let mut m = m;\\n\\n\\n\\n m.c3.x += v.x;\\n\\n m.c3.y += v.y;\\n\\n m.c3.z += v.z;\\n\\n\\n\\n m\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 8,\n \"score\": 44209.35005659563\n },\n {\n \"content\": \"/// Returns a look at matrix from the supplied parameters. Eye is the camera position, center is\\n\\n/// the location you want the camera to point, up is the up direction in whichever abstraction\\n\\n/// you are working with (usually `Vector3::new(0, 1, 0)`).\\n\\npub fn look_at(eye: Vector3, center: Vector3, up: Vector3) -> Matrix4 {\\n\\n let f = normalize(center - eye);\\n\\n let s = normalize(cross(up, f));\\n\\n let u = cross(f, s);\\n\\n\\n\\n let mut result = Matrix4::one();\\n\\n result.c0.x = s.x;\\n\\n result.c1.x = s.y;\\n\\n result.c2.x = s.z;\\n\\n result.c0.y = u.x;\\n\\n result.c1.y = u.y;\\n\\n result.c2.y = u.z;\\n\\n result.c0.z = f.x;\\n\\n result.c1.z = f.y;\\n\\n result.c2.z = f.z;\\n\\n result.c3.x = -dot(s, eye);\\n\\n result.c3.y = -dot(u, eye);\\n\\n result.c3.z = -dot(f, eye);\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 9,\n \"score\": 38415.23752223341\n },\n {\n \"content\": \"type EntityKey = u64;\\n\\n\\n\\n/// A type used to represent an entity. Objects of this type can be copied and `Entities::is_alive`\\n\\n/// is guaranteed to return false if the entity was destroyed, even taking in account id reuse.\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Debug)]\\n\\npub struct Entity {\\n\\n id: EntityId,\\n\\n key: EntityKey,\\n\\n}\\n\\n\\n\\nimpl Entity {\\n\\n /// Returns the id of the entity in the Entities object (or the World). You can't\\n\\n /// differentiate dead or alive entities just by their id.\\n\\n pub fn id(&self) -> EntityId {\\n\\n self.id\\n\\n }\\n\\n}\\n\\n\\n\\n/// An object to hold entities and their ids. Entities are stored sequentially and\\n\\n/// when an entity is destroyed, it's id is reused and old instances of Entity objects that pointed\\n\",\n \"file_path\": \"src/ecs/src/entity.rs\",\n \"rank\": 10,\n \"score\": 27124.94274488366\n },\n {\n \"content\": \"fn vector_to_index(v: Vector3) -> i32 {\\n\\n let mut idx = 0;\\n\\n if v.z >= 0.0 {\\n\\n idx |= 1;\\n\\n }\\n\\n if v.y >= 0.0 {\\n\\n idx |= 2;\\n\\n }\\n\\n if v.x >= 0.0 {\\n\\n idx |= 4;\\n\\n }\\n\\n idx\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math/src/extensions.rs\",\n \"rank\": 11,\n \"score\": 25712.93111444486\n },\n {\n \"content\": \"//! }\\n\\n//! }\\n\\n//! ```\\n\\n\\n\\nuse std::any::TypeId;\\n\\nuse std::ops::FnMut;\\n\\n\\n\\nuse super::Entity;\\n\\nuse super::World;\\n\\nuse mopa;\\n\\n\\n\\n/// A trait that describes which components the system should process. It is split from the\\n\\n/// System trait to allow it to be implemented through the impl_signature macro.\\n\",\n \"file_path\": \"src/ecs/src/system.rs\",\n \"rank\": 12,\n \"score\": 23333.900984677803\n },\n {\n \"content\": \"//! }\\n\\n//!\\n\\n//! impl System for S1 {\\n\\n//! fn has_entity(&self, entity: Entity) -> bool {\\n\\n//! self.entities.iter().enumerate().find(|e| *e.1 == entity).is_some()\\n\\n//! }\\n\\n//! fn on_entity_added(&mut self, entity: Entity) {\\n\\n//! self.entities.push(entity);\\n\\n//! }\\n\\n//! fn on_entity_removed(&mut self, entity: Entity) {\\n\\n//! self.entities.retain(|&x| x != entity);\\n\\n//! }\\n\\n//! fn process(&self, _: &World) -> Box {\\n\\n//! //[...]\\n\\n//! //Read only operations, like finding which entities need processing.\\n\\n//! Box::new(move |w: &mut World|{\\n\\n//! //[...]\\n\\n//! //Operations that mutate the world, you can access the system state through\\n\\n//! //w.get_system::()\\n\\n//! })\\n\",\n \"file_path\": \"src/ecs/src/system.rs\",\n \"rank\": 13,\n \"score\": 23331.78585856222\n },\n {\n \"content\": \" }\\n\\n fn on_entity_added(&mut self, entity: Entity) {\\n\\n self.entities.push(entity);\\n\\n }\\n\\n fn on_entity_removed(&mut self, entity: Entity) {\\n\\n self.entities.retain(|&x| x != entity);\\n\\n }\\n\\n fn process(&self, _: &World) -> Box {\\n\\n $process\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n ( $name:ty , ( $( $mask:path ),+ ) ) => {\\n\\n impl_system!($name, ( $($mask),+ ), {\\n\\n fn ret(_: &mut World) {}\\n\\n Box::new(ret)\\n\\n });\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"src/ecs/src/system.rs\",\n \"rank\": 14,\n \"score\": 23331.415676724337\n },\n {\n \"content\": \"//! System is the trait the must be implemented by every system.\\n\\n//! # Example\\n\\n//! ```\\n\\n//! use luck_ecs::{Entity, System, Signature, World};\\n\\n//! use std::any::TypeId;\\n\\n//! use std::ops::FnMut;\\n\\n//!\\n\\n//! struct S1 {\\n\\n//! entities: Vec\\n\\n//! }\\n\\n//!\\n\\n//!\\n\\n//! //You can implement the signature yourself or use the `impl_signature!` macro.\\n\\n//! impl Signature for S1 {\\n\\n//! fn signature(&self) -> Box<[TypeId]> {\\n\\n//! Box::new([\\n\\n//! TypeId::of::
\n\n\n\n\n\n\n\n# Luck\n\n\n\nLuck is a personal game engine project I'm working on to help me learn Rust. I\n\ndo not actively support it besides working on whatever interests me, but feel\n\nfree to use this code if it is in any way useful to you. It is not by any means\n\ncompleted and/or stable.\n\n\n\n\n\n## Sub-projects\n\n\n\nThis project is divided into several sub-projects:\n\n\n\n### ECS\n\n\n\nLuck ECS is an Entity-Component system, it has no dependecy on the rest of the\n\nengine and can be used by itself.\n\n\n\n### Math\n\n\n\nLuck Math depends on glm-rs and reexports the library adding a few functions and\n\ntypes that glm-rs did not port from glm. It provides a Quaternion and AABB\n\ntypes.\n\n\n\n### Core\n\n\n\n Luck Core is the implementation of the engine as a framework, there you can\n\n find rendering code, physics, cameras, etc. It has a number of dependecies\n\n which can be found in the cargo file.\n\n\n\n# Building\n\n\n\nTo build Luck, simply run `cargo build` in the root folder. It requires\n\n`rustc 1.8.0-nightly (57c357d89 2016-02-16)`. Due to some of the dependecies\n\nit can't be compiled on stable yet.\n\n\n\n# Travis\n\n\n\nThe project doesn't build on Travis because [Clippy][clippy] requires a very\n\nspecific `rustc` version. I'll fix it eventually.\n\n\n\n[clippy]: https://github.com/Manishearth/rust-clippy\n","file_path":"README.md","rank":82,"score":3.746898056374145},{"content":"\n\n let q = Quaternion::one();\n\n assert_eq!(q + q, Quaternion::new(2.0, 2.0, 2.0, 2.0));\n\n\n\n let q = Quaternion::zero();\n\n assert_eq!(q * q, q);\n\n\n\n let q = Quaternion::new(1.0, 0.0, 0.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(2.0, 0.0, 0.0, 0.0));\n\n\n\n let q = Quaternion::new(0.0, 1.0, 0.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(0.0, 2.0, 0.0, 0.0));\n\n\n\n let q = Quaternion::new(0.0, 0.0, 1.0, 1.0);\n\n assert_eq!(q * q, Quaternion::new(0.0, 0.0, 2.0, 0.0));\n\n\n\n let q = Quaternion::new(1.0, 0.0, 0.0, 1.0);\n\n let v = Vector3::new(1.0, 1.0, 1.0);\n\n assert_eq!(q * v, Vector3::new(1.0, -3.0, 1.0));\n\n }\n\n\n\n}\n","file_path":"src/math/src/quaternion.rs","rank":83,"score":3.4145506180563525},{"content":" ret.c2.z = 1.0 - 2.0 * (q.x).powi(2) - 2.0 * (q.y).powi(2);\n\n\n\n ret\n\n }\n\n\n\n /// Returns the quaternion rotation in euler angles. The resulting angle is represented\n\n /// in radians.\n\n pub fn to_euler(&self) -> Vector3