return (long)(
                        (mBytes[0] << 56) |
                        (mBytes[1] << 48) |
                        (mBytes[2] << 40) |
                        (mBytes[3] << 32) |

class VereniaGame < Game
  name            'Verenia'
  description     'A long lost adventure game turns text-based'
  author          'Denis Defreyne'
  

- (void)setJoined:(BOOL)aIsJoined
{
        [self willChangeValueForKey:@"isJoined"];
        mIsJoined = aIsJoined;
}        [self didChangeValueForKey:@"isJoined"];

#!/usr/bin/env ruby

require 'rubygems'
require 'erb'
require 'feed_tools'

BOOL NKPolygonContainsPoint(NKPolygon polygon, NSPoint point)
{
        // We could implement a fancy ray casting algorithm. but simply making a bezier path
        // And checking if it's inside, is much simpler.
        NSBezierPath *path = [NSBezierPath pathFromPolygon:polygon];

}

/* array structure */
typedef struct vd_array_s vd_array_t;

/* comparator callback type */
typedef int (*vd_array_comparator_callback_t)(void *value_1, void *value_2);

/*
 * array.h
 * vdcore
 *
 * Copyright (c) 2006 Denis Defreyne

{        name = 'constant.other.c';
        match = '\b[A-Z_]+(?!\()\b';
}

this is a test

this is a test 2

this is a test

        puts("> dictionary_create()");
        d = dictionary_create();
        printf("=> %p\n", (void *)d);