Skip to content

Instantly share code, notes, and snippets.

View jmcomets's full-sized avatar

Jean-Marie Comets jmcomets

View GitHub Profile
@jmcomets
jmcomets / pizza.txt
Last active September 21, 2020 17:20
My homemade pizza recipe
- 300g of T55 caliber flour
- 180g of tap water
- 1-2 tbps of dry baker's yeast
- 3-4 tbsp of olive oil
- 2-3 tsp of sugar
- a few pinches of salt (usually more than you'd think)
1) Mix water, sugar & yeast. Hydrate for ~10 min (there should be bubbles).
2) Flour goes in large bowl with a few pinches of salt to start with. Make a "well" in the flour, and add 2 tbps of olive oil.
3) Get your hands dirty, adding the water/yeast little by little with one hand and mixing with the other.
if v:version < 700 || exists('g:loaded_smart_filename') || &cp
finish
endif
let g:loaded_smart_filename = 1
function! SmartFilename#ForCurrentBuffer()
let l:abs_filename = expand('%:p')
if empty(l:abs_filename)
return ""
endif
@jmcomets
jmcomets / GitHub-Forking.md
Created November 25, 2019 14:46 — forked from Chaser324/GitHub-Forking.md
GitHub Standard Fork & Pull Request Workflow

Whether you're trying to give back to the open source community or collaborating on your own projects, knowing how to properly fork and generate pull requests is essential. Unfortunately, it's quite easy to make mistakes or not know what you should do when you're initially learning the process. I know that I certainly had considerable initial trouble with it, and I found a lot of the information on GitHub and around the internet to be rather piecemeal and incomplete - part of the process described here, another there, common hangups in a different place, and so on.

In an attempt to coallate this information for myself and others, this short tutorial is what I've found to be fairly standard procedure for creating a fork, doing your work, issuing a pull request, and merging that pull request back into the original project.

Creating a Fork

Just head over to the GitHub page and click the "Fork" button. It's just that simple. Once you've done that, you can use your favorite git client to clone your repo or j

Learning How To Learn
=====================
1. INTRO/FOCUSED VS. DIFFUSED THINKING
Can only be in one or the other
Diffused
when writing, write in diffuse mode, edit in focused mode
to engage diffuse brain - before writing, mind-mapping/clustering - take a paper, hold landscape
when you write, you want to create new things, think of new relationships.
DON'T EDIT WHILE YOU WRITE
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
import random
nb_characters = 1 # CHANGE ME
stat_names = ["STR", "DEX", "CON", "INT", "WIS", "CHA"]
print(' / '.join(stat_names))
for _ in range(nb_characters):
stats = []
for stat in stat_names:
@jmcomets
jmcomets / sorcerer-cleric-diff.md
Last active July 16, 2019 14:53
Spells Sorcerers can learn that Clerics can't

Cantrips

  • Infestation
  • Dancing Lights
  • Poison Spray
  • Ray of Frost
  • Booming Blade
  • Shape Water
  • Mold Earth
  • Blade Ward
import java.util.*;
class CompareSortedMaps {
public static <K extends Comparable<K>, V extends Comparable<V>> int compareSortedMaps(SortedMap<K, V> map, SortedMap<K, V> otherMap) {
if (map == null || otherMap == null) {
if (map != null) {
return 1;
}
if (otherMap != null) {
use std::cell::RefCell;
use std::iter::FromIterator;
use std::rc::Rc;
pub struct List<T> {
head: Option<Rc<RefCell<Node<T>>>>,
tail: Option<Rc<RefCell<Node<T>>>>,
}
struct Node<T> {
if v:version < 700 || exists('g:loaded_binary_search') || &cp
"finish
endif
let g:loaded_binary_search = 1
" Runs a binary search over the sorted {elements} given, between {start} and
" {end} (excluded), returning the position of the upper bound of {value} in
" said list. Note: this can be combined with insert() to maintain a sorted
" list.
function! BinarySearch#UpperBound(elements, value, start, end)