chengl

5 ms·

1.
Let's Encrypt Intranet(chengl.com)
1 points by chengl 9y ago|0 comments
2.
Multirepo vs. Monorepo(chengl.com)
1 points by chengl 9y ago|0 comments
3.
Working with multiple projects on GKE(chengl.com)
1 points by chengl 10y ago|0 comments
4.
by chengl 10y ago
I hope we will
5.
Kubectl Authentication Made Simple(chengl.com)
1 points by chengl 10y ago|0 comments
6.
by chengl 11y ago
here you go. Variance explained by Martin Odersky in his coursera course https://class.coursera.org/progfun-005/lecture/83 (you need to login to watch it). Or the Scala doc http://docs.scala-lang.org&#
7.
by chengl 12y ago
Cool stuff. But doesn't work for me. It's not saving when I press prefix+Alt+s. Anyone with the same experience? I'm on MBP, tmux 1.9a.
8.
by chengl 13y ago
Many comments suggest to use password managers like lastpass, 1pass, etc. But I think that may not be a good idea: a. What if lastpass/1pass is compromised? b. You have to login to retrieve your password, which is inconvenient. I think
9.
by chengl 13y ago
still down. Fri Aug 9 17:14:24 SGT 2013
10.
LIFX by LIFX Labs(youtube.com)
2 points by chengl 14y ago|0 comments
11.
Mozilla’s Boot 2 Gecko and why it could change the world(knowyourmobile.com)
2 points by chengl 15y ago|0 comments
12.
by chengl 15y ago
What the author mentioned is longest common SUBSEQUENCE (not substring). And it's true that LCS requires O(n^2) if only need to find ONE LCS, using dynamic programming. But if it's required to find ALL longest common subsequence, it definit
13.
#1 in github: impress.js(bartaz.github.com)
1 points by chengl 15y ago|0 comments