audinue

public class Node {

    public Node getParentNode() {
        return parentNode;
    }

    public Node getPreviousSibling() {
        return previousSibling;
    }

audinue

/*
SSAO GLSL shader v1.2
assembled by Martins Upitis (martinsh) (devlog-martinsh.blogspot.com)
original technique is made by Arkano22 (www.gamedev.net/topic/550699-ssao-no-halo-artifacts/)

changelog:
1.2 - added fog calculation to mask AO. Minor fixes.
1.1 - added spiral sampling method from here:
(http://www.cgafaq.info/wiki/Evenly_distributed_points_on_sphere)
*/

audinue

package com.example;

import java.io.InputStream;
import java.net.URLClassLoader;
import java.util.jar.Manifest;

public class Foo {

    public void bar() {
    }

audinue

function closest (result, p, a, b, c) {
  var px = p[0]
  var py = p[1]
  var pz = p[2]
  var ax = a[0]
  var ay = a[1]
  var az = a[2]
  var bx = b[0]
  var by = b[1]
  var bz = b[2]

audinue

import java.io.*;
import java.net.*;

abstract class Client
{
  Socket socket;
  ObjectOutputStream out;
  boolean closed;

  void init(final Socket newSocket) {

audinue

package com.example.notification;

import android.app.Activity;
import android.app.Notification;
import android.app.NotificationManager;
import android.app.PendingIntent;
import android.content.Intent;
import android.os.Bundle;
import android.view.*;
import android.widget.*;

audinue

function scaleToFit (
  contentWidth, 
  contentHeight, 
  containerWidth, 
  containerHeight
) {
  var scale = Math.min(containerWidth / contentWidth, containerHeight / contentHeight)
  return {
    x: containerWidth / 2 - contentWidth * scale / 2,
    y: containerHeight / 2 - contentHeight * scale / 2,

audinue

function uuidv4() {
  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function(c) {
    var r = Math.random() * 16 | 0, v = c == 'x' ? r : (r & 0x3 | 0x8);
    return v.toString(16);
  });
}

console.log(uuidv4());

audinue

#include <stdlib.h>
#include <windows.h>
#include <gdiplus.h>

Bitmap* loadBitmap(char* file)
{
    int length = strlen(file) + 1;

    wchar_t* fileW = (wchar_t*) malloc(length * sizeof(wchar_t));

audinue

#include <stdlib.h>
#include <string.h>

typedef struct Entry {
    char* key;
    void* value;
    int   next;
} Entry;

typedef struct Map {