| #include <iostream> | |
| #include <string> | |
| #include <chrono> | |
| #include <unordered_map> | |
| #include "tsl/robin_map.h" | |
| #include "robin_hood.h" | |
| using namespace std; | |
| using my_clock = std::chrono::high_resolution_clock; |
| #include <algorithm> | |
| #include <chrono> | |
| #include <iostream> | |
| #include <random> | |
| #define LIKELY(x) __builtin_expect((x), 1) | |
| #define UNLIKELY(x) __builtin_expect((x), 0) | |
| #define NO_INLINE __attribute__((noinline)) | |
| // extremely fast random number generator that also produces very high quality random. |
| function prompt_timer_start { | |
| PROMPT_TIMER=${PROMPT_TIMER:-`date +%s.%3N`} | |
| echo -ne "\033]0;${@}\007" | |
| } | |
| function prompt_svn_stats() { | |
| command -v svn >/dev/null | |
| if [ $? != 0 ]; then | |
| return | |
| fi |
Read https://help.github.com/categories/collaborating-with-issues-and-pull-requests/
from https://www.digitalocean.com/community/tutorials/how-to-rebase-and-update-a-pull-request
| /* Example adapted from http://www.drdobbs.com/database/differential-evolution/184410166 | |
| * | |
| * This implements the DE/rand/1/bin optimization algorithm. | |
| * | |
| */ | |
| /* Initialize individuals */ | |
| for (i=0; i<NP; i++) { | |
| /* randomly initialize all individuals */ | |
| for (j=0; j<D; j++) { |
| Verifying that +martinus is my Bitcoin username. You can send me #bitcoin here: https://onename.io/martinus |
| #set term pngcairo size 1920,1080 enhanced font 'Verdana,10' | |
| set term pngcairo size 3840,2160 enhanced font 'Verdana,10' | |
| set title 'Bitcoin Balance over Time of Last Transaction' | |
| set xlabel 'Last Transaction [Time]' | |
| set ylabel 'Amount [BTC]' | |
| set output 'xy.png' | |
| set logscale y | |
| set xdata time | |
| set timefmt "%s" | |
| set format x "%Y-%m-%d" |
| #pragma once | |
| /// MarsagliaMWC99 is a simple random number generator based on | |
| /// George Marsaglia's MWC (multiply with carry) generator. | |
| /// Although it is very simple, it passes Marsaglia's DIEHARD | |
| /// series of random number generator tests. It is exceptionally fast. | |
| /// | |
| /// @see http://www.codeproject.com/Articles/25172/Simple-Random-Number-Generation | |
| /// @see http://www.bobwheeler.com/statistics/Password/MarsagliaPost.txt | |
| /// @see http://mathforum.org/kb/message.jspa?messageID=1524861 |
| class TrieNode | |
| def initialize | |
| @sub_tries = {} | |
| @end_of_word = false | |
| end | |
| def insert(input) | |
| to_insert = input |
| package com.ankerl.stuff; | |
| import java.lang.reflect.InvocationTargetException; | |
| import java.lang.reflect.Method; | |
| import java.util.ArrayList; | |
| import java.util.Collection; | |
| import java.util.Iterator; | |
| /** | |
| * Calls multiple methods with a single interface. |
