bearzk

>>> a = [(111,555),(333,222)]
>>> a.sort()
>>> a
[(111, 555), (333, 222)]
>>> a.sort(lambda x,y: cmp(x[1],y[1]))
>>> a
[(333, 222), (111, 555)]

bearzk

a    = range(0,10) #[1..11]
odd  = a[::2] #[1,3,5,7,9]
even = a[1::2] #[2,4,6,8,10]

bearzk

Keybase proof

I hereby claim:

• I am bearzk on github.
• I am bearzk (https://keybase.io/bearzk) on keybase.
• I have a public key whose fingerprint is C338 E988 980D 500C B6B9 AE1D 5ED2 A3B8 95F6 00B2

To claim this, I am signing this object:

bearzk

#!/bin/bash
ok=false
echo
for file in $(find . -name '*.rb'); do
	if [ $ok ]; then
	   echo -ne "\033[2A"
	   echo -ne "\033[K"
        fi
	echo $file;
	ruby -c $file;

bearzk

const toString = Object.prototype.toString;

const isType = type => {
  return function (obj) {
    return toString.call(obj) == '[object ' + type + ']';
  };
};

const isFunction = isType('Function');

bearzk

.center {
  display: flex;
  justify-content: center;
  align-items: center;
}

bearzk

htpasswd -nb name password
# name:$apr1$8sRtOm7K$QxQXk5Zo6HhOhujVhovgn0

bearzk

# http://editorconfig.org

root = true

[*]
charset = utf-8
end_of_line = lf
indent_style = space
indent_size = 4
insert_final_newline = true

bearzk

Health Check

Why?

Check the system is working properly, if any errors or anomaly, we want that be detected early than late.

When?

• check availability
• check operation correctness
• check middle-tier or shared service to detect and isolate a failure

bearzk

Queue-Based Load Leveling pattern

Why and When?

Sometimes a part of our application just can not run that fast, it could be for example, avatar processing, email sending, and in these case we don't usually need a response/confirmation that the action is finished, we can push these tasks into queue and handle them asynchronously to take the load off the system.

How?

• push slow tasks into queue