dlion

var basketModule = (function () {
  //Privates
  var basket = [];
  
  function doSomethingPrivate() {
    //
  }
  
  function doSomethingElsePrivate() {
    //...

dlion

//Import mixins
var myModule = (function ( JQ, _ ) {
  
  function privateMethod1() {
    JQ(".container").html("test");
  }
  
  function privateMethod2() {
    console.log( _.min([10, 5, 100, 2, 1000]) );
  }

dlion

/**
 * Autore: Domenico Luciani
 * Data: 28/02/14
 * Esercizio: 2
 * CFU: 9
 */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>

dlion

load_file("rete.hoc")

celsius=35
objref stim[3], ns, nc[4]
access soma[0]
ns = new NetStim()
ns.start=10
ns.number=1
ns.interval=50
ns.noise=1

dlion

create rete[3]

rete[0] {pt3dclear()
    pt3dadd(-12.5, 0, 0, 5)
    pt3dadd(-7.5, 0, 0, 5)
}

rete[1] {pt3dclear()
    pt3dadd(-2.5, 0, 0, 5)
    pt3dadd(2.5, 0, 0, 5)

dlion

#include <stdio.h>
#include <stdlib.h>

void stampaVettore(int *v, int N)
{
    int i;
    for(i=0; i < N; i++)
        printf("%d ", v[i]);
    putchar('\n');
}

dlion

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void stampaVettore(int *v, int n)
{
    int i;
    for(i=0; i < n; i++)
        printf("%d ",v[i]);
    printf("\n\n");

dlion

package main

import "fmt"

func main() {
	array := [6]int{5, 3, 1, 7, 2}
	for k := 0; k <= 5; k++ {
		m := k
		for j := k + 1; j <= 5; j++ {
			if array[j] < array[m] {

dlion

#include <stdio.h>
#include <stdlib.h>

typedef struct albero {
    int valore;
    struct albero *dx;
    struct albero *sx;
} ABR;

ABR* insert(ABR* A, int value)

dlion

Keybase proof

I hereby claim:

• I am dlion on github.
• I am dlion (https://keybase.io/dlion) on keybase.
• I have a public key whose fingerprint is 7214 7EBB B299 706D 8621 43E1 A3D8 68BE 560A CEB0

To claim this, I am signing this object: