day 22 part 1
This commit is contained in:
parent
2292e4a65f
commit
921e2aaef6
7
d22/Cargo.lock
generated
Normal file
7
d22/Cargo.lock
generated
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
# This file is automatically @generated by Cargo.
|
||||||
|
# It is not intended for manual editing.
|
||||||
|
version = 3
|
||||||
|
|
||||||
|
[[package]]
|
||||||
|
name = "d05"
|
||||||
|
version = "0.1.0"
|
202
d22/input.txt
202
d22/input.txt
File diff suppressed because one or more lines are too long
266
d22/src/a1.rs
266
d22/src/a1.rs
@ -1,4 +1,270 @@
|
|||||||
|
use std::{collections::{HashSet, HashMap}, thread::current};
|
||||||
|
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
enum Move {
|
||||||
|
TurnLeft,
|
||||||
|
TurnRight,
|
||||||
|
MoveForward(i64),
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Hash, Eq, Clone, Copy, PartialEq)]
|
||||||
|
struct Pos (i64, i64);
|
||||||
|
|
||||||
|
|
||||||
|
#[derive(Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]
|
||||||
|
struct Tile {
|
||||||
|
x :i64,
|
||||||
|
y :i64,
|
||||||
|
is_wall :bool,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Tile {
|
||||||
|
fn from(x :i64, y :i64, is_wall :bool) -> Self {
|
||||||
|
Tile { x: x, y: y, is_wall :is_wall }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
fn parse_inp(inp :Vec<String>) -> (Vec<Move>, HashMap<Pos, bool>) {
|
||||||
|
|
||||||
|
|
||||||
|
let tmp = inp.iter().position(|line| line.is_empty()).unwrap();
|
||||||
|
|
||||||
|
let raw_maze = inp[0..tmp].to_vec();
|
||||||
|
let raw_directions = &inp[tmp+1];
|
||||||
|
|
||||||
|
// parse directions
|
||||||
|
// insert spaces before and after each 'R' or 'L'
|
||||||
|
let res = raw_directions.chars().map(|elem| {
|
||||||
|
match elem {
|
||||||
|
'R' | 'L' => { String::from( vec![' ', elem, ' '].iter().collect::<String>() ) }
|
||||||
|
_ => { elem.to_string() }
|
||||||
|
}
|
||||||
|
}).collect::<String>();
|
||||||
|
|
||||||
|
// split on spaces and parse moves
|
||||||
|
let directions :Vec<Move> = res.split(' ').map(|elem| {
|
||||||
|
match elem.parse::<i64>() {
|
||||||
|
Ok(i) => { Move::MoveForward(i) }
|
||||||
|
Err(_) => {
|
||||||
|
match elem {
|
||||||
|
"R" => { Move::TurnRight }
|
||||||
|
"L" => { Move::TurnLeft }
|
||||||
|
_ => { std::process::exit(2); }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}).collect();
|
||||||
|
|
||||||
|
let mut maze :HashMap<Pos, bool> = HashMap::new();
|
||||||
|
// Parse maze
|
||||||
|
for i in raw_maze.iter().enumerate() {
|
||||||
|
|
||||||
|
for i2 in i.1.chars().enumerate() {
|
||||||
|
|
||||||
|
match i2.1 {
|
||||||
|
'.' => { maze.insert(Pos(i2.0 as i64, i.0 as i64), false); }
|
||||||
|
'#' => { maze.insert(Pos(i2.0 as i64, i.0 as i64), true); }
|
||||||
|
_ => {}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
(directions, maze)
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn find_edges(maze :&HashMap<Pos, bool>) -> (Pos, Pos) {
|
||||||
|
|
||||||
|
let mut min = Pos(i64::MAX, i64::MAX);
|
||||||
|
let mut max = Pos(0, 0);
|
||||||
|
|
||||||
|
for tile in maze.keys() {
|
||||||
|
if tile.0 < min.0 {
|
||||||
|
min.0 = tile.0;
|
||||||
|
}
|
||||||
|
if tile.0 > max.0 {
|
||||||
|
max.0 = tile.0;
|
||||||
|
}
|
||||||
|
if tile.1 < min.1 {
|
||||||
|
min.1 = tile.1;
|
||||||
|
}
|
||||||
|
if tile.1 > max.1 {
|
||||||
|
max.1 = tile.1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(min, max)
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn find_player_pos(maze :&HashMap<Pos, bool>, min :&Pos, max :&Pos) -> Pos {
|
||||||
|
|
||||||
|
for i in min.0..max.0 {
|
||||||
|
match maze.get(&Pos(i, min.1)) {
|
||||||
|
Some(b) => {
|
||||||
|
if !b {
|
||||||
|
return Pos(i, min.1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
None => {}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
*min
|
||||||
|
}
|
||||||
|
|
||||||
|
fn move_step (pos :&(Pos, i64), map :&HashMap<Pos, bool>, min :&Pos, max :&Pos) -> Pos {
|
||||||
|
|
||||||
|
let mut fp = pos.0.clone();
|
||||||
|
|
||||||
|
match pos.1 {
|
||||||
|
// right
|
||||||
|
0 => {
|
||||||
|
fp.0 += 1;
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to min
|
||||||
|
fp.0 = min.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.0 += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
// down
|
||||||
|
1 => {
|
||||||
|
fp.1 += 1;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to min
|
||||||
|
fp.1 = min.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.1 += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// left
|
||||||
|
2 => {
|
||||||
|
fp.0 -= 1;
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to max
|
||||||
|
fp.0 = max.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.0 -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// up
|
||||||
|
3 => {
|
||||||
|
fp.1 -= 1;
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to max
|
||||||
|
fp.1 = max.1;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.1 -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
_ => { std::process::exit(3); }
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
fp
|
||||||
|
}
|
||||||
|
|
||||||
|
fn move_forward(steps :i64, pos :&mut (Pos, i64), map :&HashMap<Pos, bool>, min :&Pos, max :&Pos) {
|
||||||
|
|
||||||
|
for _ in 0..steps {
|
||||||
|
|
||||||
|
let future_pos = move_step(pos, map, min, max);
|
||||||
|
if *map.get(&future_pos).unwrap() {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
pos.0 = future_pos;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn evaluate_movement(mut current_pos :(Pos, i64), map :HashMap<Pos, bool>, moves :Vec<Move>, min :&Pos, max :&Pos) -> (Pos, i64) {
|
||||||
|
|
||||||
|
for m in moves {
|
||||||
|
|
||||||
|
match m {
|
||||||
|
// turn right
|
||||||
|
Move::TurnRight => { current_pos.1 = (current_pos.1 + 1) % 4; }
|
||||||
|
|
||||||
|
// turn left
|
||||||
|
Move::TurnLeft => {
|
||||||
|
current_pos.1 -= 1;
|
||||||
|
if current_pos.1 < 0 {
|
||||||
|
current_pos.1 += 4;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Move::MoveForward(steps) => {
|
||||||
|
move_forward(steps, &mut current_pos, &map, min, max);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
current_pos
|
||||||
|
}
|
||||||
|
|
||||||
pub fn run(inp :Vec<String>) {
|
pub fn run(inp :Vec<String>) {
|
||||||
|
|
||||||
|
let (moves, maze) = parse_inp(inp);
|
||||||
|
|
||||||
|
let (min, max) = find_edges(&maze);
|
||||||
|
|
||||||
|
// player consists of Position and rotation
|
||||||
|
// rotation is:
|
||||||
|
// 0: right
|
||||||
|
// 1: down
|
||||||
|
// 2: left
|
||||||
|
// 3: up
|
||||||
|
let player = (find_player_pos(&maze, &min, &max), 0);
|
||||||
|
|
||||||
|
let final_pos = evaluate_movement(player, maze, moves, &min, &max);
|
||||||
|
|
||||||
|
println!("{}, {}, {}", final_pos.0.0, final_pos.0.1, final_pos.1);
|
||||||
|
|
||||||
|
let result = 4 * (final_pos.0.0 + 1) + 1000 * (final_pos.0.1 + 1) + final_pos.1;
|
||||||
|
println!("a1: {}", result);
|
||||||
|
|
||||||
}
|
}
|
267
d22/src/a2.rs
267
d22/src/a2.rs
@ -1,5 +1,272 @@
|
|||||||
|
use std::{collections::{HashSet, HashMap}, thread::current};
|
||||||
|
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
enum Move {
|
||||||
|
TurnLeft,
|
||||||
|
TurnRight,
|
||||||
|
MoveForward(i64),
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Hash, Eq, Clone, Copy, PartialEq)]
|
||||||
|
struct Pos (i64, i64);
|
||||||
|
|
||||||
|
|
||||||
|
#[derive(Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]
|
||||||
|
struct Tile {
|
||||||
|
x :i64,
|
||||||
|
y :i64,
|
||||||
|
is_wall :bool,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Tile {
|
||||||
|
fn from(x :i64, y :i64, is_wall :bool) -> Self {
|
||||||
|
Tile { x: x, y: y, is_wall :is_wall }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
fn parse_inp(inp :Vec<String>) -> (Vec<Move>, HashMap<Pos, bool>) {
|
||||||
|
|
||||||
|
|
||||||
|
let tmp = inp.iter().position(|line| line.is_empty()).unwrap();
|
||||||
|
|
||||||
|
let raw_maze = inp[0..tmp].to_vec();
|
||||||
|
let raw_directions = &inp[tmp+1];
|
||||||
|
|
||||||
|
// parse directions
|
||||||
|
// insert spaces before and after each 'R' or 'L'
|
||||||
|
let res = raw_directions.chars().map(|elem| {
|
||||||
|
match elem {
|
||||||
|
'R' | 'L' => { String::from( vec![' ', elem, ' '].iter().collect::<String>() ) }
|
||||||
|
_ => { elem.to_string() }
|
||||||
|
}
|
||||||
|
}).collect::<String>();
|
||||||
|
|
||||||
|
// split on spaces and parse moves
|
||||||
|
let directions :Vec<Move> = res.split(' ').map(|elem| {
|
||||||
|
match elem.parse::<i64>() {
|
||||||
|
Ok(i) => { Move::MoveForward(i) }
|
||||||
|
Err(_) => {
|
||||||
|
match elem {
|
||||||
|
"R" => { Move::TurnRight }
|
||||||
|
"L" => { Move::TurnLeft }
|
||||||
|
_ => { std::process::exit(2); }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}).collect();
|
||||||
|
|
||||||
|
let mut maze :HashMap<Pos, bool> = HashMap::new();
|
||||||
|
// Parse maze
|
||||||
|
for i in raw_maze.iter().enumerate() {
|
||||||
|
|
||||||
|
for i2 in i.1.chars().enumerate() {
|
||||||
|
|
||||||
|
match i2.1 {
|
||||||
|
'.' => { maze.insert(Pos(i2.0 as i64, i.0 as i64), false); }
|
||||||
|
'#' => { maze.insert(Pos(i2.0 as i64, i.0 as i64), true); }
|
||||||
|
_ => {}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
(directions, maze)
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn find_edges(maze :&HashMap<Pos, bool>) -> (Pos, Pos) {
|
||||||
|
|
||||||
|
let mut min = Pos(i64::MAX, i64::MAX);
|
||||||
|
let mut max = Pos(0, 0);
|
||||||
|
|
||||||
|
for tile in maze.keys() {
|
||||||
|
if tile.0 < min.0 {
|
||||||
|
min.0 = tile.0;
|
||||||
|
}
|
||||||
|
if tile.0 > max.0 {
|
||||||
|
max.0 = tile.0;
|
||||||
|
}
|
||||||
|
if tile.1 < min.1 {
|
||||||
|
min.1 = tile.1;
|
||||||
|
}
|
||||||
|
if tile.1 > max.1 {
|
||||||
|
max.1 = tile.1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(min, max)
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn find_player_pos(maze :&HashMap<Pos, bool>, min :&Pos, max :&Pos) -> Pos {
|
||||||
|
|
||||||
|
for i in min.0..max.0 {
|
||||||
|
match maze.get(&Pos(i, min.1)) {
|
||||||
|
Some(b) => {
|
||||||
|
if !b {
|
||||||
|
return Pos(i, min.1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
None => {}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
*min
|
||||||
|
}
|
||||||
|
|
||||||
|
fn move_step (pos :&(Pos, i64), map :&HashMap<Pos, bool>, min :&Pos, max :&Pos) -> Pos {
|
||||||
|
|
||||||
|
let mut fp = pos.0.clone();
|
||||||
|
|
||||||
|
match pos.1 {
|
||||||
|
// right
|
||||||
|
0 => {
|
||||||
|
fp.0 += 1;
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to min
|
||||||
|
fp.0 = min.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.0 += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
// down
|
||||||
|
1 => {
|
||||||
|
fp.1 += 1;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to min
|
||||||
|
fp.1 = min.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.1 += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// left
|
||||||
|
2 => {
|
||||||
|
fp.0 -= 1;
|
||||||
|
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to max
|
||||||
|
fp.0 = max.0;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.0 -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// up
|
||||||
|
3 => {
|
||||||
|
fp.1 -= 1;
|
||||||
|
|
||||||
|
if map.get(&fp).is_none() {
|
||||||
|
|
||||||
|
// reset to max
|
||||||
|
fp.1 = max.1;
|
||||||
|
|
||||||
|
// move to the start of this row
|
||||||
|
while map.get(&fp).is_none() {
|
||||||
|
fp.1 -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
_ => { std::process::exit(3); }
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
fp
|
||||||
|
}
|
||||||
|
|
||||||
|
fn move_forward(steps :i64, pos :&mut (Pos, i64), map :&HashMap<Pos, bool>, min :&Pos, max :&Pos) {
|
||||||
|
|
||||||
|
for _ in 0..steps {
|
||||||
|
|
||||||
|
let future_pos = move_step(pos, map, min, max);
|
||||||
|
if *map.get(&future_pos).unwrap() {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
pos.0 = future_pos;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
fn evaluate_movement(mut current_pos :(Pos, i64), map :HashMap<Pos, bool>, moves :Vec<Move>, min :&Pos, max :&Pos) -> (Pos, i64) {
|
||||||
|
|
||||||
|
for m in moves {
|
||||||
|
|
||||||
|
match m {
|
||||||
|
// turn right
|
||||||
|
Move::TurnRight => { current_pos.1 = (current_pos.1 + 1) % 4; }
|
||||||
|
|
||||||
|
// turn left
|
||||||
|
Move::TurnLeft => {
|
||||||
|
current_pos.1 -= 1;
|
||||||
|
if current_pos.1 < 0 {
|
||||||
|
current_pos.1 += 4;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Move::MoveForward(steps) => {
|
||||||
|
move_forward(steps, &mut current_pos, &map, min, max);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
current_pos
|
||||||
|
}
|
||||||
|
|
||||||
pub fn run(inp :Vec<String>) {
|
pub fn run(inp :Vec<String>) {
|
||||||
|
|
||||||
|
const SIDE_SIZE : i64 = 4; // 50 real
|
||||||
|
|
||||||
|
let (moves, maze) = parse_inp(inp);
|
||||||
|
|
||||||
|
let (min, max) = find_edges(&maze);
|
||||||
|
|
||||||
|
// player consists of Position and rotation
|
||||||
|
// rotation is:
|
||||||
|
// 0: right
|
||||||
|
// 1: down
|
||||||
|
// 2: left
|
||||||
|
// 3: up
|
||||||
|
let player = (find_player_pos(&maze, &min, &max), 0);
|
||||||
|
|
||||||
|
let final_pos = evaluate_movement(player, maze, moves, &min, &max);
|
||||||
|
|
||||||
|
println!("{}, {}, {}", final_pos.0.0, final_pos.0.1, final_pos.1);
|
||||||
|
|
||||||
|
let result = 4 * (final_pos.0.0 + 1) + 1000 * (final_pos.0.1 + 1) + final_pos.1;
|
||||||
|
println!("a1: {}", result);
|
||||||
|
|
||||||
}
|
}
|
@ -32,7 +32,7 @@ fn read_file(path :&str) -> Vec<String> {
|
|||||||
|
|
||||||
fn main() {
|
fn main() {
|
||||||
|
|
||||||
let inp :Vec<String> = read_file("input.txt");
|
let inp :Vec<String> = read_file("test_input.txt");
|
||||||
|
|
||||||
a1::run(inp.clone());
|
a1::run(inp.clone());
|
||||||
|
|
||||||
|
1
d22/target/.rustc_info.json
Normal file
1
d22/target/.rustc_info.json
Normal file
@ -0,0 +1 @@
|
|||||||
|
{"rustc_fingerprint":15594459422025777716,"outputs":{"8623966523033996810":{"success":true,"status":"","code":0,"stdout":"___.exe\nlib___.rlib\n___.dll\n___.dll\n___.lib\n___.dll\n","stderr":""},"4614504638168534921":{"success":true,"status":"","code":0,"stdout":"rustc 1.65.0 (897e37553 2022-11-02)\nbinary: rustc\ncommit-hash: 897e37553bba8b42751c67658967889d11ecd120\ncommit-date: 2022-11-02\nhost: x86_64-pc-windows-msvc\nrelease: 1.65.0\nLLVM version: 15.0.0\n","stderr":""},"8204103499295538959":{"success":true,"status":"","code":0,"stdout":"___.exe\nlib___.rlib\n___.dll\n___.dll\n___.lib\n___.dll\nC:\\Users\\tfuec\\.rustup\\toolchains\\stable-x86_64-pc-windows-msvc\ndebug_assertions\npanic=\"unwind\"\nproc_macro\ntarget_arch=\"x86_64\"\ntarget_endian=\"little\"\ntarget_env=\"msvc\"\ntarget_family=\"windows\"\ntarget_feature=\"fxsr\"\ntarget_feature=\"sse\"\ntarget_feature=\"sse2\"\ntarget_has_atomic=\"16\"\ntarget_has_atomic=\"32\"\ntarget_has_atomic=\"64\"\ntarget_has_atomic=\"8\"\ntarget_has_atomic=\"ptr\"\ntarget_os=\"windows\"\ntarget_pointer_width=\"64\"\ntarget_vendor=\"pc\"\nwindows\n","stderr":""},"10376369925670944939":{"success":true,"status":"","code":0,"stdout":"___.exe\nlib___.rlib\n___.dll\n___.dll\n___.lib\n___.dll\nC:\\Users\\tfuec\\.rustup\\toolchains\\stable-x86_64-pc-windows-msvc\ndebug_assertions\npanic=\"unwind\"\nproc_macro\ntarget_arch=\"x86_64\"\ntarget_endian=\"little\"\ntarget_env=\"msvc\"\ntarget_family=\"windows\"\ntarget_feature=\"fxsr\"\ntarget_feature=\"sse\"\ntarget_feature=\"sse2\"\ntarget_has_atomic=\"16\"\ntarget_has_atomic=\"32\"\ntarget_has_atomic=\"64\"\ntarget_has_atomic=\"8\"\ntarget_has_atomic=\"ptr\"\ntarget_os=\"windows\"\ntarget_pointer_width=\"64\"\ntarget_vendor=\"pc\"\nwindows\n","stderr":""},"15697416045686424142":{"success":true,"status":"","code":0,"stdout":"___.exe\nlib___.rlib\n___.dll\n___.dll\n___.lib\n___.dll\n","stderr":""}},"successes":{}}
|
3
d22/target/CACHEDIR.TAG
Normal file
3
d22/target/CACHEDIR.TAG
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
Signature: 8a477f597d28d172789f06886806bc55
|
||||||
|
# This file is a cache directory tag created by cargo.
|
||||||
|
# For information about cache directory tags see https://bford.info/cachedir/
|
0
d22/target/debug/.cargo-lock
Normal file
0
d22/target/debug/.cargo-lock
Normal file
@ -0,0 +1 @@
|
|||||||
|
a62220af2acc103e
|
@ -0,0 +1 @@
|
|||||||
|
{"rustc":2347157018072859861,"features":"[]","target":16997346216964277088,"profile":7309141686862299243,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug\\.fingerprint\\d05-54bad1502471c435\\dep-bin-d05"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}
|
BIN
d22/target/debug/.fingerprint/d05-54bad1502471c435/dep-bin-d05
Normal file
BIN
d22/target/debug/.fingerprint/d05-54bad1502471c435/dep-bin-d05
Normal file
Binary file not shown.
@ -0,0 +1 @@
|
|||||||
|
This file has an mtime of when this was started.
|
@ -0,0 +1,6 @@
|
|||||||
|
{"message":"unused imports: `HashSet`, `thread::current`","code":{"code":"unused_imports","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":31,"line_start":1,"line_end":1,"column_start":25,"column_end":32,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":32}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src\\a1.rs","byte_start":43,"byte_end":58,"line_start":1,"line_end":1,"column_start":44,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":44,"highlight_end":59}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_imports)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"remove the unused imports","code":null,"level":"help","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":33,"line_start":1,"line_end":1,"column_start":25,"column_end":34,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":34}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null},{"file_name":"src\\a1.rs","byte_start":41,"byte_end":58,"line_start":1,"line_end":1,"column_start":42,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":42,"highlight_end":59}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused imports: `HashSet`, `thread::current`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:1:25\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m1\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0muse std::{collections::{HashSet, HashMap}, thread::current};\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(unused_imports)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"unused imports: `HashSet`, `thread::current`","code":{"code":"unused_imports","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":24,"byte_end":31,"line_start":1,"line_end":1,"column_start":25,"column_end":32,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":32}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src\\a2.rs","byte_start":43,"byte_end":58,"line_start":1,"line_end":1,"column_start":44,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":44,"highlight_end":59}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"remove the unused imports","code":null,"level":"help","spans":[{"file_name":"src\\a2.rs","byte_start":24,"byte_end":33,"line_start":1,"line_end":1,"column_start":25,"column_end":34,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":34}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null},{"file_name":"src\\a2.rs","byte_start":41,"byte_end":58,"line_start":1,"line_end":1,"column_start":42,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":42,"highlight_end":59}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused imports: `HashSet`, `thread::current`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:1:25\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m1\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0muse std::{collections::{HashSet, HashMap}, thread::current};\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^^^^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"associated function `from` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":384,"byte_end":388,"line_start":23,"line_end":23,"column_start":8,"column_end":12,"is_primary":true,"text":[{"text":" fn from(x :i64, y :i64, is_wall :bool) -> Self {","highlight_start":8,"highlight_end":12}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: associated function `from` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:23:8\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m23\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m fn from(x :i64, y :i64, is_wall :bool) -> Self {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"constant `SIDE_SIZE` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":5620,"byte_end":5629,"line_start":251,"line_end":251,"column_start":11,"column_end":20,"is_primary":true,"text":[{"text":" const SIDE_SIZE : i64 = 4; // 50 real","highlight_start":11,"highlight_end":20}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: constant `SIDE_SIZE` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:251:11\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m251\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m const SIDE_SIZE : i64 = 4; // 50 real\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"associated function `from` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":384,"byte_end":388,"line_start":23,"line_end":23,"column_start":8,"column_end":12,"is_primary":true,"text":[{"text":" fn from(x :i64, y :i64, is_wall :bool) -> Self {","highlight_start":8,"highlight_end":12}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: associated function `from` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:23:8\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m23\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m fn from(x :i64, y :i64, is_wall :bool) -> Self {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"5 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: 5 warnings emitted\u001b[0m\n\n"}
|
@ -0,0 +1 @@
|
|||||||
|
e737b342d3e62e08
|
@ -0,0 +1 @@
|
|||||||
|
{"rustc":2347157018072859861,"features":"[]","target":16997346216964277088,"profile":9251013656241001069,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug\\.fingerprint\\d05-60235cbe9d69ff8a\\dep-bin-d05"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}
|
BIN
d22/target/debug/.fingerprint/d05-60235cbe9d69ff8a/dep-bin-d05
Normal file
BIN
d22/target/debug/.fingerprint/d05-60235cbe9d69ff8a/dep-bin-d05
Normal file
Binary file not shown.
@ -0,0 +1 @@
|
|||||||
|
This file has an mtime of when this was started.
|
@ -0,0 +1,4 @@
|
|||||||
|
{"message":"unused imports: `HashSet`, `thread::current`","code":{"code":"unused_imports","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":31,"line_start":1,"line_end":1,"column_start":25,"column_end":32,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":32}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src\\a1.rs","byte_start":43,"byte_end":58,"line_start":1,"line_end":1,"column_start":44,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":44,"highlight_end":59}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_imports)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"remove the unused imports","code":null,"level":"help","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":33,"line_start":1,"line_end":1,"column_start":25,"column_end":34,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":34}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null},{"file_name":"src\\a1.rs","byte_start":41,"byte_end":58,"line_start":1,"line_end":1,"column_start":42,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":42,"highlight_end":59}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused imports: `HashSet`, `thread::current`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:1:25\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m1\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0muse std::{collections::{HashSet, HashMap}, thread::current};\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(unused_imports)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"unused variable: `inp`","code":{"code":"unused_variables","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":15,"byte_end":18,"line_start":3,"line_end":3,"column_start":12,"column_end":15,"is_primary":true,"text":[{"text":"pub fn run(inp :Vec<String>) {","highlight_start":12,"highlight_end":15}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_variables)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"if this is intentional, prefix it with an underscore","code":null,"level":"help","spans":[{"file_name":"src\\a2.rs","byte_start":15,"byte_end":18,"line_start":3,"line_end":3,"column_start":12,"column_end":15,"is_primary":true,"text":[{"text":"pub fn run(inp :Vec<String>) {","highlight_start":12,"highlight_end":15}],"label":null,"suggested_replacement":"_inp","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused variable: `inp`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:3:12\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m3\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0mpub fn run(inp :Vec<String>) {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11mhelp: if this is intentional, prefix it with an underscore: `_inp`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(unused_variables)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"associated function `from` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":384,"byte_end":388,"line_start":23,"line_end":23,"column_start":8,"column_end":12,"is_primary":true,"text":[{"text":" fn from(x :i64, y :i64, is_wall :bool) -> Self {","highlight_start":8,"highlight_end":12}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: associated function `from` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:23:8\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m23\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m fn from(x :i64, y :i64, is_wall :bool) -> Self {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"3 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: 3 warnings emitted\u001b[0m\n\n"}
|
Binary file not shown.
@ -0,0 +1 @@
|
|||||||
|
This file has an mtime of when this was started.
|
@ -0,0 +1,6 @@
|
|||||||
|
{"message":"unused imports: `HashSet`, `thread::current`","code":{"code":"unused_imports","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":31,"line_start":1,"line_end":1,"column_start":25,"column_end":32,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":32}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src\\a1.rs","byte_start":43,"byte_end":58,"line_start":1,"line_end":1,"column_start":44,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":44,"highlight_end":59}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(unused_imports)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null},{"message":"remove the unused imports","code":null,"level":"help","spans":[{"file_name":"src\\a1.rs","byte_start":24,"byte_end":33,"line_start":1,"line_end":1,"column_start":25,"column_end":34,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":34}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null},{"file_name":"src\\a1.rs","byte_start":41,"byte_end":58,"line_start":1,"line_end":1,"column_start":42,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":42,"highlight_end":59}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused imports: `HashSet`, `thread::current`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:1:25\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m1\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0muse std::{collections::{HashSet, HashMap}, thread::current};\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^^^^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(unused_imports)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"unused imports: `HashSet`, `thread::current`","code":{"code":"unused_imports","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":24,"byte_end":31,"line_start":1,"line_end":1,"column_start":25,"column_end":32,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":32}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null},{"file_name":"src\\a2.rs","byte_start":43,"byte_end":58,"line_start":1,"line_end":1,"column_start":44,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":44,"highlight_end":59}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"remove the unused imports","code":null,"level":"help","spans":[{"file_name":"src\\a2.rs","byte_start":24,"byte_end":33,"line_start":1,"line_end":1,"column_start":25,"column_end":34,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":25,"highlight_end":34}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null},{"file_name":"src\\a2.rs","byte_start":41,"byte_end":58,"line_start":1,"line_end":1,"column_start":42,"column_end":59,"is_primary":true,"text":[{"text":"use std::{collections::{HashSet, HashMap}, thread::current};","highlight_start":42,"highlight_end":59}],"label":null,"suggested_replacement":"","suggestion_applicability":"MachineApplicable","expansion":null}],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: unused imports: `HashSet`, `thread::current`\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:1:25\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m1\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0muse std::{collections::{HashSet, HashMap}, thread::current};\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^^^^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"associated function `from` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a1.rs","byte_start":384,"byte_end":388,"line_start":23,"line_end":23,"column_start":8,"column_end":12,"is_primary":true,"text":[{"text":" fn from(x :i64, y :i64, is_wall :bool) -> Self {","highlight_start":8,"highlight_end":12}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[{"message":"`#[warn(dead_code)]` on by default","code":null,"level":"note","spans":[],"children":[],"rendered":null}],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: associated function `from` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a1.rs:23:8\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m23\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m fn from(x :i64, y :i64, is_wall :bool) -> Self {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m= \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15mnote\u001b[0m\u001b[0m: `#[warn(dead_code)]` on by default\u001b[0m\n\n"}
|
||||||
|
{"message":"constant `SIDE_SIZE` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":5620,"byte_end":5629,"line_start":251,"line_end":251,"column_start":11,"column_end":20,"is_primary":true,"text":[{"text":" const SIDE_SIZE : i64 = 4; // 50 real","highlight_start":11,"highlight_end":20}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: constant `SIDE_SIZE` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:251:11\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m251\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m const SIDE_SIZE : i64 = 4; // 50 real\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^^^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"associated function `from` is never used","code":{"code":"dead_code","explanation":null},"level":"warning","spans":[{"file_name":"src\\a2.rs","byte_start":384,"byte_end":388,"line_start":23,"line_end":23,"column_start":8,"column_end":12,"is_primary":true,"text":[{"text":" fn from(x :i64, y :i64, is_wall :bool) -> Self {","highlight_start":8,"highlight_end":12}],"label":null,"suggested_replacement":null,"suggestion_applicability":null,"expansion":null}],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: associated function `from` is never used\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m--> \u001b[0m\u001b[0msrc\\a2.rs:23:8\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\n\u001b[0m\u001b[1m\u001b[38;5;14m23\u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m|\u001b[0m\u001b[0m \u001b[0m\u001b[0m fn from(x :i64, y :i64, is_wall :bool) -> Self {\u001b[0m\n\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;14m| \u001b[0m\u001b[0m \u001b[0m\u001b[0m\u001b[1m\u001b[38;5;11m^^^^\u001b[0m\n\n"}
|
||||||
|
{"message":"5 warnings emitted","code":null,"level":"warning","spans":[],"children":[],"rendered":"\u001b[0m\u001b[1m\u001b[38;5;11mwarning\u001b[0m\u001b[0m\u001b[1m\u001b[38;5;15m: 5 warnings emitted\u001b[0m\n\n"}
|
@ -0,0 +1 @@
|
|||||||
|
f0fa31a79957e157
|
@ -0,0 +1 @@
|
|||||||
|
{"rustc":2347157018072859861,"features":"[]","target":16997346216964277088,"profile":1021633075455700787,"path":1684066648322511884,"deps":[],"local":[{"CheckDepInfo":{"dep_info":"debug\\.fingerprint\\d05-cd6375c08847f9de\\dep-test-bin-d05"}}],"rustflags":[],"metadata":7797948686568424061,"config":2202906307356721367,"compile_kind":0}
|
1
d22/target/debug/d05.d
Normal file
1
d22/target/debug/d05.d
Normal file
@ -0,0 +1 @@
|
|||||||
|
C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\d05.exe: C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\src\a1.rs C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\src\a2.rs C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\src\main.rs
|
BIN
d22/target/debug/d05.exe
Normal file
BIN
d22/target/debug/d05.exe
Normal file
Binary file not shown.
BIN
d22/target/debug/d05.pdb
Normal file
BIN
d22/target/debug/d05.pdb
Normal file
Binary file not shown.
7
d22/target/debug/deps/d05-54bad1502471c435.d
Normal file
7
d22/target/debug/deps/d05-54bad1502471c435.d
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
c:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05-54bad1502471c435.rmeta: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
c:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05-54bad1502471c435.d: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
src\main.rs:
|
||||||
|
src\a1.rs:
|
||||||
|
src\a2.rs:
|
7
d22/target/debug/deps/d05-cd6375c08847f9de.d
Normal file
7
d22/target/debug/deps/d05-cd6375c08847f9de.d
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
c:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05-cd6375c08847f9de.rmeta: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
c:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05-cd6375c08847f9de.d: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
src\main.rs:
|
||||||
|
src\a1.rs:
|
||||||
|
src\a2.rs:
|
7
d22/target/debug/deps/d05.d
Normal file
7
d22/target/debug/deps/d05.d
Normal file
@ -0,0 +1,7 @@
|
|||||||
|
C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05.exe: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
C:\personal\Programmierdaten\rust\advent_of_code\y2022\d22\target\debug\deps\d05.d: src\main.rs src\a1.rs src\a2.rs
|
||||||
|
|
||||||
|
src\main.rs:
|
||||||
|
src\a1.rs:
|
||||||
|
src\a2.rs:
|
BIN
d22/target/debug/deps/d05.exe
Normal file
BIN
d22/target/debug/deps/d05.exe
Normal file
Binary file not shown.
BIN
d22/target/debug/deps/d05.pdb
Normal file
BIN
d22/target/debug/deps/d05.pdb
Normal file
Binary file not shown.
0
d22/target/debug/deps/libd05-54bad1502471c435.rmeta
Normal file
0
d22/target/debug/deps/libd05-54bad1502471c435.rmeta
Normal file
0
d22/target/debug/deps/libd05-cd6375c08847f9de.rmeta
Normal file
0
d22/target/debug/deps/libd05-cd6375c08847f9de.rmeta
Normal file
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user