Skip to content

Instantly share code, notes, and snippets.

View j-medland's full-sized avatar

John Medland j-medland

  • Control Software Solutions
  • Manchester, UK
  • X @j_medland
View GitHub Profile
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
image_width: 640
image_height: 480
camera_name: usb_cam
camera_matrix:
rows: 3
cols: 3
data: [536.5713701935, 0. , 315.0555172451,
0. , 537.7138835637, 241.0382730485,
0. , 0. , 1. ]
distortion_model: plumb_bob
@j-medland
j-medland / ch08-03-hash-maps.rs
Last active January 18, 2023 15:28
Rust-By-Example Exercises
// https://rust-book.cs.brown.edu/ch08-03-hash-maps.html
// Summary Exercise Part 1
// Given a list of integers, use a vector and return the median (when sorted, the value in the middle position)
// and mode (the value that occurs most often; a hash map will be helpful here) of the list.
use std::collections::HashMap;
fn main() {
// let input :Vec<i32>= Vec::new();
let input = vec![2, 1, 1, 4, 5, 5, 6, 7];