155 karma · joined March 3, 2017
https://gist.github.com/Trung0246/8f801058212d3bbbef82690a31...
Demo (old version with outdated compile flag but still works): https://godbolt.org/z/n9ch4TM3s
It works for gcc/clang/msvc with -O0, -O1, -O2, and even -O3
Alternative: https://annas-archive.org/md5/4dd395c749519a36cb755e6ebbe488...
Alternative (incomplete, only couple first page): https://device.report/m/91235972e8cbf6d6ce84f7cf84ca0ac12623...
Other HDMI stuff: https://pdfhost.io/v/YidEvBDkS_EP92A7E_EP91A7E_DS_V04
Older available here: https://glenwing.github.io/docs/
This may tread too close to DRM tho due to element protection scheme.
robots txt file size is usually small and would not alert external services.
Floor 1: 0691eda5-6d12-46af-997b-7c7137ecfc53 (E E E S E E S)
Floor 2: 47857e86-d1c4-47e5-b72b-10887d4065ea (E E E N W W W N E E E E S)
Floor 3: 6b8dcc36-fedb-4480-9419-4c258de5d51f (N W S W S S E S W W W W S S E E S)
Floor 4: d23ee5f7-2a4e-466d-a1a2-6c97e8d9ed51 (N W N N W N N W W S E S W S W N W N N N N E E E S E N E E E S S E N N E)
End: 6dad5397-df78-40b5-872d-7f4aeaa625b8 (S S S S W N N N W S S S S E S E S S W W N W S W N N)
However these methods are not really accessibility-friendly tho.
var Z = S(S(K(S(S)(K(S(S(K)(K))(S(K)(K))))))(K))(S(K(S(S)(K(S(S(K)(K))(S(K)(K))))))(K));
Unfortunately not works with the `count_fn` function from the wikipedia page :(, `too much recursion`. z = (t (t (t t (t (t (t (t (t t (t (t (t (t (t t)) (t t))) (t (t (t t)) (t t))))) (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t (t (t (t (t (t t)) (t t)))))) (t t))))) (t t (t (t (t (t (t t))))))))) (t (t (t (t (t t (t (t (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t t)) t))) (t t (t t))))) (t (t (t t (t (t (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t t)) t))) (t t (t t))))) (t (t (t t (t (t (t t t)) t))) (t t))))) (t t (t (t (t (t (t t (t (t (t (t (t t)) (t t))) (t (t (t t)) (t t))))) (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t (t (t (t (t (t t)) (t t)))))) (t t))))) (t t (t (t (t t (t (t (t (t (t t (t (t (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t t)) t))) (t t (t t))))) (t (t (t t (t (t (t (t (t t (t (t (t t (t (t (t t t)) t))) (t t)))) (t (t (t t t)) t))) (t t (t t))))) (t (t (t t (t (t (t (t (t t)) (t t)))))) (t t)))))))) (t t)))))))
Original tested but unoptimized and also converted using tool: var K = a => b => a;
var S = a => b => c => a(c)(b(c));
var Z = S(K(S(S(K(S(S(K)(K))(S(K)(K))))(S(K(S(K(S))(K)))(S(K(S(S(K)(K))))(K))))(K(S(S(K))))))(S(S(K(S(S(K(S(K(S))(K)))(S))(K(K))))(S(K(S(S(K(S(K(S))(K)))(S))(K(K))))(S(K(S))(K))))(K(S(S(K(S(S(K)(K))(S(K)(K))))(S(K(S(K(S))(K)))(S(K(S(S(K)(K))))(K))))(K(S(K(S(S(K(S(S(K(S(K(S))(K)))(S))(K(K))))(S(K(S(S(K(S(K(S))(K)))(S))(K(K))))(S(K(S(S(K)(K))))(K))))))(K))))));
https://en.wikipedia.org/wiki/Fixed-point_combinatorLooks like http://archiveiya74codqgiixo33q62qlrqtkgmcitqx5u2oeqnmn5bpcb... is still online.
#define FWD(...) ::std::forward<decltype(__VA_ARGS__)>(__VA_ARGS__)
#define LIFT_CUSTOM(X, CAPTURE) CAPTURE (auto &&... args) \
noexcept(noexcept(X(FWD(args)...))) -> decltype((X(FWD(args)...))) { \
return X(FWD(args)...); \
}
#define LIFT(X) LIFT_CUSTOM(X, [&])How does the gaming industry does this so well? Is it due to low barrier of entries? Or something else I'm unsure of.