napsy

/*
 * A quick example how to generate expression trees using
 * the Go programming language.
 */

package main

import (
    "strings"
    "container/vector"

napsy

package main

import "fmt"

type Sortable interface {
    Less(b Sortable) bool
}

type Person struct {
    age, height int

napsy

package main

import "fmt"

type Sortable interface {
    Less(b Sortable) bool
}

type Person struct {
    age, height int

napsy

package main

func main() {
    for i,v := range []string{"sss", "sffg", "gfdbf"} {
        println("Ime " + string(i+48) + " = " + v[1:3])
    }
}

napsy

#include <stdlib.h>

#include <gtk/gtk.h>

struct MainWindow {
    GtkWidget *window;
    gboolean draw;
    GAsyncQueue *draw_queue;
    cairo_surface_t *surface;
} *main_window;