sharow sharow

At the beginning of 2030, I found this essay in my archives. From what I know today, I think it was very insightful at the moment of writing. And I feel it should be published because it can teach us, Rust developers, how to prevent that sad story from happening again.

What killed Haskell, could kill Rust, too

What killed Haskell, could kill Rust, too. Why would I even mention Haskell in this context? Well, Haskell and Rust are deeply related. Not because Rust is Haskell without HKTs. (Some of you know what that means, and the rest of you will wonder for a very long time). Much of the style of Rust is similar in many ways to the style of Haskell. In some sense Rust is a reincarnation of Haskell, with a little bit of C-ish like syntax, a very small amount.

Is Haskell dead?

stage 1: You believe you can make Go do object oriented programming. You want to do this by using clever struct embedding.
stage 2: You believe goroutines will solve all of your problems. You want to use goroutines for anything and everything that you can, who cares if the code becomes a bit more complicated
stage 3: You believe that instead of object oriented programming, interfaces will solve all of your problems. You want to define everything in terms of interfaces
stage 4: You believe channels will solve all of your problems. You want to do everything from synchronization, returning values, and flow control using channels.
stage 5: You now believe Go is not as powerful as people claim it to be. You feel like you're stripped of all of the nice tools and constructs that other languages provide.
stage 6: You realize that stages 1~5 were all just your imagination. You just didn't want to accept the Go way. Everything starts to make sense.
stage 7: You are now at peace

collapsible markdown?

CLICK ME

yes, even hidden code blocks!

print("hello world!")

Mastodon の API を叩くには以下の手順を踏む必要がある:

OAuth2 クライアントを登録する
アクセストークンを取得する
アクセストークンを Authorization ヘッダに指定して API にアクセスする

OAuth2 クライアント登録

Mastodon の Apps API に登録情報を送ってクライアントを払い出してもらう（一度だけやれば OK）.

Machine learning

ML frameworks

How to build a simple image/primary-colour similarity database

A Neural Network in 11 lines of Python

Logistic Regression Vs Decision Trees Vs SVM

Comparing Python Clustering Algorithms

シーケンス図とかフローチャートをしごとで描画することになった場合、テキストから生成できたら楽なので、それ系のツールまとめ

GraphViz

http://www.graphviz.org/

C製
Doxygen, Moinmoinなどと連携可能
ブロック図、クラス図、ネットワーク図など

	; The stack pointer is going to be an index into the stack, and the
	; stack is an array of words. The alternative would be to have the
	; stack pointer me a pointer to memory, but this is perhaps a bit
	; nicer, as where the stack actually lives is totally irrelevant.

	@stack = global [1000 x i64] undef
	@sp = global i64 undef;

	; Now we have the basic stack operations: push, pop, and peek. As can
	; be seen from the definitions, LLVM is typed, which is really nice as

	#include <stdio.h>

	#define SQ(x) (x)*(x)

	#define M0(x,y) SQ(x)+SQ(y)<4?0:0xe0
	#define M1(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M0(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0)):0xc0
	#define M2(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M1(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0xa0
	#define M3(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M2(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x80
	#define M4(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M3(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x60
	#define M5(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M4(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x40

	import sys

	def j(lineno):
	frame = sys._getframe().f_back
	called_from = frame

	def hook(frame, event, arg):
	if event == 'line' and frame == called_from:
	try:
	frame.f_lineno = lineno

	// This is free and unencumbered software released into the public domain.
	//
	// Anyone is free to copy, modify, publish, use, compile, sell, or
	// distribute this software, either in source code form or as a compiled
	// binary, for any purpose, commercial or non-commercial, and by any
	// means.
	//
	// In jurisdictions that recognize copyright laws, the author or authors
	// of this software dedicate any and all copyright interest in the
	// software to the public domain. We make this dedication for the benefit