Thought of the day – don’t confuse the fight for the battle

Every now and then I formulate to myself some thoughts and current conclusions regarding things in general – be it life philosophy and everything that is derived from it. I’m going to start and write these down just to have them placed somewhere either for others to contemplate or for my future self to laugh …

Continue reading ‘Thought of the day – don’t confuse the fight for the battle’ »

Handling RTL and LTR

This is mainly a note to myself. Two tools to help convert pages from LTR to RTL text directions: RTLit Convert your CSS-formatter file from left-to-right to right-to-left http://rtlit.cloudfoundry.com/ based on: https://github.com/zohararad/rtlit (a Ruby project) CSSjanus: http://code.google.com/p/cssjanus/

Compiling OpenResty (nginx) on OS/X

When building OpenResty (the excellent Lua add-on for nginx) on OS/X I got the following error: Undefined symbols for architecture x86_64: "_pcre_free_study", referenced from: _ngx_pcre_free_studies in ngx_regex.o _ngx_http_lua_ngx_re_match in ngx_http_lua_regex.o _ngx_http_lua_ngx_re_gmatch in ngx_http_lua_regex.o _ngx_http_lua_ngx_re_sub_helper in ngx_http_lua_regex.o _ngx_http_lua_ngx_re_gmatch_cleanup in ngx_http_lua_regex.o _ngx_http_lua_ngx_re_gmatch_gc in ngx_http_lua_regex.o _ngx_http_lua_ngx_re_gmatch_iterator in ngx_http_lua_regex.o … ld: symbol(s) not found for architecture x86_64 To cut …

Continue reading ‘Compiling OpenResty (nginx) on OS/X’ »

Quick guide to Google closure compiler tool

Google’s closure compiler is an impressive tool that parses JavaScript code and make various optimizations on it, including minimizing its size. This post will provide what is needed to effectively utilize it in minimum time. Step 1 – verify consistant property access methods in your code ∞ The first thing you should do is make …

Continue reading ‘Quick guide to Google closure compiler tool’ »

Fastest Scrabble Algorithm ?

After making a small change, I’ve managed to improve the algorithm so that the computer will make a move in under a second every turn. Considering this is all written in pure JavaScript and runs on the browser, I’m starting to wonder whether the algorithm I wrote is the fastest existing scrabble algorithm out there…