Skip to content

Instantly share code, notes, and snippets.

View LazyRen's full-sized avatar
🇰🇷
Work Hard to be Lazy

Lee, DaeIn LazyRen

🇰🇷
Work Hard to be Lazy
View GitHub Profile
@LazyRen
LazyRen / alias.zsh
Created March 15, 2024 01:04
Remove zsh history entry
# Use TAB to select entries to delete
# Run `fc -R` to reload history file from a current shell.
alias hfzf='history -w; cat ~/.zsh_history | fzf -m > /tmp/to_remove; grep -vxFf /tmp/to_remove ~/.zsh_history > ~/.new_zsh_history; mv ~/.new_zsh_history ~/.zsh_history; rm /tmp/to_remove; history -r'
#!/bin/bash
while "$@"; do :; done
CompileFlags:
Add: -ferror-limit=0
InlayHints:
Designators: Yes
Enabled: Yes
ParameterNames: Yes
DeducedTypes: Yes
Diagnostics:
@LazyRen
LazyRen / tmux.conf
Last active January 22, 2021 07:41 — forked from spicycode/tmux.conf
The best and greatest tmux.conf ever
set-option -g default-shell $SHELL
# 0 is too far from ` ;)
set -g base-index 1
# Automatically set window title
set-window-option -g automatic-rename on
set-option -g set-titles on
#set -g default-terminal screen-256color
@LazyRen
LazyRen / queue.cpp
Created May 24, 2020 15:03
STL queue-like data structure implementation
template <typename T>
class Queue {
private:
using size_type = size_t;
T* arr;
size_type head;
size_type tail;
size_type _size;
size_type _capacity;
static constexpr size_type DEFAULT_CAP = 4;
@LazyRen
LazyRen / pair.cpp
Last active May 24, 2020 15:02
STL pair-like data structure
template <typename T1, typename T2>
class Pair{
public:
T1 first;
T2 second;
constexpr Pair() : first(T1()), second(T2()) {};
Pair(const T1& f, const T2& s) : first(f), second(s) {};
@LazyRen
LazyRen / git_aliases.zsh
Last active November 3, 2023 02:33
git-related alias.
alias ga="git add"
alias gaa="git add --all
"
alias gb="git branch"
alias gba="git branch -a"
# Delete all local branches except for the current & master
alias gbd="git branch | grep -v '$(git branch --show-current)\|master' | xargs git branch -D"
alias gc="git commit"
alias gca="git commit --amend"
@LazyRen
LazyRen / vector.cpp
Last active June 14, 2020 18:24
STL vector-like data structure implementation
#include <cstddef>
#include <utility>
template <typename T>
class Vector {
private:
using size_type = size_t;
T* arr;
size_type _size;
size_type _capacity;
@LazyRen
LazyRen / heap.cpp
Last active June 14, 2020 19:15
STL priority_queue-like data structure implementation
template <typename T>
class Heap {
private:
using size_type = size_t;
T* arr;
size_type _size;
size_type _capacity;
bool is_max_heap;
static constexpr size_type DEFAULT_CAP = 32;
@LazyRen
LazyRen / quicksort.cpp
Last active July 1, 2020 05:05
Quick Sort Algorithm
template <typename T>
void swap(T& a, T& b) {
T tmp = a;
a = b;
b = tmp;
}
/*
* Sort all elements in arr[]; range of closed interval [left, right].
*/