cubicdaiya

#define PREFIX_FREE(p)                          \
  do {                                          \
    free(p);                                    \
    (p) = NULL;                                 \
  } while(false)

cubicdaiya

function round(num) 
   return math.floor(num+.5)
end

cubicdaiya

def get_ext(ent):
    root, ext = os.path.splitext(ent)
    return ext

cubicdaiya

#!/bin/sh

find . | egrep '#$' | xargs rm 

cubicdaiya

a = [ 1, 15, 2, 3, 3, 31, 34, 99 ];
a.sort();

cubicdaiya

try {
    x = y;
} catch (e) {
    console.log(e.message); // y is not defined
}

cubicdaiya

var memoizer = function (memo, fundamental) {
    var shell = function (n) {
        var result = memo[n];
        if (typeof result !== 'number') {
            result = fundamental(shell, n);
            memo[n] = result;
        }
        return result;
    };

cubicdaiya

int count_str (char *buf, const char *s, int len)
{
    int   c;
    char *p;
    c = 0;
    p = buf;
    while (p != NULL) {
        p = strstr(p, s);
        if (p != NULL) {
            p += len;

cubicdaiya

#include <string.h>

/**
 * The algorithm implemented here is based Boyer-Moore algorithm
 */

// following functions can process ascii character

void bm_create_table (char *pattern, int *skip)
{

cubicdaiya

def configure(conf, libs, headers, funcs):

    if not conf.CheckCC():
        print "c compiler is not installed!"
        return False

    for lib in libs:
        if not conf.CheckLib(lib):
            print "library " + lib + " not installed!"
            return False