Skip to content

Instantly share code, notes, and snippets.

View VeeDeltaVee's full-sized avatar

Versha Dhankar VeeDeltaVee

  • Microsoft
  • Redmond
  • 16:42 (UTC -07:00)
View GitHub Profile
@VeeDeltaVee
VeeDeltaVee / vim-lsp.log
Created April 5, 2020 10:39
Vim LSP log for omnisharp
05-04-2020 16:02:34:["lsp#register_server", "server registered", "vim-language-server"]
05-04-2020 16:02:35:["lsp#register_server", "server already registered", "vim-language-server"]
05-04-2020 16:02:35:["lsp#register_server", "server registered", "vim-language-server"]
05-04-2020 16:02:35:["vim-lsp signs enabled"]
05-04-2020 16:02:35:["vim-lsp highlighting enabled"]
05-04-2020 16:02:35:["s:on_text_document_did_open()", 1, "startify", "C:\\Users\\Versha\\scoop\\apps\\neovim-nightly\\current\\bin", ""]
05-04-2020 16:02:35:["s:on_text_document_did_change()", 1]
05-04-2020 16:02:35:["s:send_didchange_queue() will be triggered"]
05-04-2020 16:02:36:["s:send_event_queue()"]
05-04-2020 16:02:39:["s:on_text_document_did_close()", 1]
@VeeDeltaVee
VeeDeltaVee / day11.rs
Created December 11, 2018 08:17
Advent of Code 2018 Day 11 solution in Rust
use rayon::prelude::*;
const GRID_SIZE: usize = 300;
fn find_hundreds_digit(value: i64) -> i64 {
(value / 100) % 10
}
fn find_grid_cell_value(x: usize, y: usize, serial: i64) -> i64 {
// internals use (0, 0) as origin
@VeeDeltaVee
VeeDeltaVee / day10.rs
Last active December 10, 2018 07:27
Advent of Code 2018 Day 10 solution in Rust
#[macro_use] extern crate scan_fmt;
use std::io::BufRead;
#[derive(Debug)]
struct Star {
position: (i64, i64),
velocity: (i64, i64)
}
@VeeDeltaVee
VeeDeltaVee / day9.rs
Created December 9, 2018 10:40
Advent of Code 2018 Day 9 solution in Rust
use std::collections::VecDeque;
#[derive(Debug)]
struct ParseInputError {}
/// Parses a line of input to give (number of players, largest marble used)
fn parse_input(input: &str) -> Result<(usize, usize), ParseInputError> {
let numbers: Vec<_> = input
.trim()
.split_whitespace()
@VeeDeltaVee
VeeDeltaVee / day8.rs
Created December 8, 2018 11:06
Advent of Code 2018 Day 8 solution in Rust
#[derive(Debug)]
pub struct Tree {
children: Vec<Tree>,
metadata: Vec<i64>,
}
impl Tree {
fn new() -> Tree {
Tree {
children: Vec::new(),
@VeeDeltaVee
VeeDeltaVee / day6.rs
Created December 6, 2018 09:44
Advent of Code 2018 day 6 solution in Rust
use std::str::FromStr;
use std::num::ParseIntError;
use std::io::Read;
#[derive(Clone, Debug, Hash, PartialEq, Eq, PartialOrd)]
struct Matrix<T> {
rows: usize,
columns: usize,
buf: Vec<T>,
}
@VeeDeltaVee
VeeDeltaVee / day5.rs
Created December 5, 2018 07:59
Advent of Code 2018 Day 5 solution in Rust
use std::io;
fn characters_match(a: char, b: char) -> bool {
return a.to_ascii_lowercase() == b.to_ascii_lowercase() &&
(a.is_ascii_lowercase() && b.is_ascii_uppercase() || a.is_ascii_uppercase() && b.is_ascii_lowercase())
}
fn process_polymer_reaction_step(polymer: &mut String) -> usize {
let mut num_changes = 0;
@VeeDeltaVee
VeeDeltaVee / day4.rs
Last active December 4, 2018 10:06
Advent of Code 2018 Day 4 solution in Rust
extern crate regex;
#[macro_use] extern crate lazy_static;
use std::io::Read;
use std::collections::BTreeMap;
use regex::Regex;
#[derive(Debug)]
struct GuardProfile {
id: usize, // The guard id
@VeeDeltaVee
VeeDeltaVee / main.rs
Created December 3, 2018 13:30
Day2 problem 2 solution for Advent of Code 2018
use std::io::Read;
fn common_str(id1: &str, id2: &str) -> String {
let mut common= String::new();
for (char1, char2) in id1.chars().zip(id2.chars()) {
if char1 == char2 {
common.push(char1);
}
}
@VeeDeltaVee
VeeDeltaVee / main.rs
Created December 3, 2018 13:29
Day 2 Problem 1 solution for Advent of Code 2018
use std::collections::BTreeMap;
use std::io::Read;
fn contains_n_of_any_letter(id: &str, n: i64) -> bool {
let mut frequency_count = BTreeMap::new();
for c in id.chars() {
*frequency_count.entry(c).or_insert(0) += 1;
}