Keybase proof
I hereby claim:
- I am haruyama on github.
- I am haruyama (https://keybase.io/haruyama) on keybase.
- I have a public key ASCXnr5_nc0X8FzUg6aCGzxcVIRGlakk7itj-zYINMAHRAo
To claim this, I am signing this object:
突然のご連絡失礼いたします。 | |
J-Tech.devの山本 彩と申します。 | |
エンジニアに特化したヘッドハンターでございます。 | |
国内・海外の企業様の採用を支援させて頂いており、今回もマーケットで一番勢いのある優良なクライアント様についてお話させて頂きたく、ご連絡しました。 | |
現在コロナウイルス感染防止の為、全ての面談を電話面談で実施しております。(Skype, Hangout, Zoom 等) | |
また、ほぼ全ての面接もビデオで実施しております。 |
diff -ur xnp2-0.86.orig/accessories/lzxpack.c xnp2-0.86/accessories/lzxpack.c | |
--- xnp2-0.86.orig/accessories/lzxpack.c 2016-03-09 02:25:48.000000000 +0900 | |
+++ xnp2-0.86/accessories/lzxpack.c 2019-08-03 16:01:28.488689336 +0900 | |
@@ -49,8 +49,8 @@ | |
ctrl = ptr; | |
*ptr++ = 0x00; | |
} | |
- back = min(pos, maxhis); | |
- rem = min(datasize - pos, maxlen); | |
+ back = mymin(pos, maxhis); |
I hereby claim:
To claim this, I am signing this object:
From mathcomp | |
Require Import ssreflect ssrnat. | |
Section naturalNumber. | |
Lemma add0nEqn (n : nat) : 0 + n = n. | |
Proof. by []. Qed. | |
Lemma addn3Eq2n1 (n : nat) : n + 3 = 2 + n + 1. | |
Proof. |
let blacklists = ["https://mail.google.com/*", "*://mail.google.com/*", "@https://mail.google.com/mail/*", "https://twitter.com/*", "https://www.facebook.com/*", "https://feedly.com/*"] | |
map 1G scrollToTop |
#!/bin/bash | |
##################################################################### | |
# Work-around for godeb issue | |
# assumes godeb is available using $GOPATH | |
# You can specify version on the command line, | |
# or else it will try and grab the latest | |
##################################################################### | |
set -e |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
#include <stdbool.h> | |
#include <gmp.h> | |
bool check_symmetry(mpz_t i) | |
{ | |
char* s = mpz_get_str(NULL, 10, i); | |
size_t len = strlen(s); |
(unify-match 1 '(? x) | |
(singleton-stream '())) | |
(unify-match '(? x) 1 | |
(singleton-stream '())) | |
(unify-match '(? x) '(? x) | |
(singleton-stream '())) | |
;(query-syntax-process '(?x ?x)) |
// +build OMIT | |
package main | |
import ( | |
"errors" | |
"fmt" | |
"math/rand" | |
"sort" |
diff --git a/autoload/unite/filters.vim b/autoload/unite/filters.vim | |
index 0156643..d7af4f5 100644 | |
--- a/autoload/unite/filters.vim | |
+++ b/autoload/unite/filters.vim | |
@@ -158,9 +158,9 @@ do | |
local input = vim.eval('tolower(a:input)') | |
local candidates = vim.eval('a:candidates') | |
for i = #candidates-1, 0, -1 do | |
- local word = string.lower(candidates[i].action__path) | |
- or string.lower(candidates[i].word) |