Venkatesh-Prasad Ranganath rvprasad

## test_process.py
# Python -- v3.6

import begin
import multiprocessing
import time


def worker(varying_data, fixed_data):
    t = 0
    for j in range(1, 10000):

## test_process_graph.gp
set terminal png
set output "test_process.png"
set logscale
set xlabel "Size of fixed data [Number of ints]"
set ylabel "Performance [seconds per iteration]"
set title "Performance of options vs Size of fixed data"
plot "test_process.csv" using 1:2 title "builtin pool" with linespoints, \
     "test_process.csv" using 1:3 title "custom pool" with linespoints

## test_pool_map_graph.gp
set terminal png
set output "test_pool_map.png"
set logscale
set xlabel "Size of aux data [Number of ints]"
set ylabel "Performance [seconds per iteration]"
set title "Performance of options vs Size of aux data"
plot "test_pool_map.csv" using 1:2 title "without initializer / default chunksize" with linespoints, \
    "test_pool_map.csv" using 1:3 title "with initializer / default chunksize" with linespoints, \
    "test_pool_map.csv" using 1:4 title "without initializer / 250 chunksize" with linespoints, \
    "test_pool_map.csv" using 1:5 title "with initializer / 250 chunksize" with linespoints, \

## testClosuresAndClasses.groovy
class A {
  protected foo() {
    this.bar("Site foo1")
    def x = {
      println("This: ${this.class}")
      this.bar("Site foo2")
    }
    x()
  }

## build.gradle
buildscript {
    repositories {
        jcenter()
        google()
    }

    dependencies {
        classpath 'com.android.tools.build:gradle:3.0.1'
    }
}

## config.txt
hdmi_safe=1
enable_uart=0
gpu_mem=16

## 3NumSorter.groovy
/*
 * Copyright (c) 2018, Venkatesh-Prasad Ranganath
 *
 * Licensed under BSD 3-clause License
 *
 * Author: Venkatesh-Prasad Ranganath
 */

// Sorts three numbers using SAT solving
// Script uses z3 solver (https://github.com/Z3Prover/z3)

## simpleSudokuSolver.groovy
/*
 * Copyright (c) 2018, Venkatesh-Prasad Ranganath
 *
 * Licensed under BSD 3-clause License
 *
 * Author: Venkatesh-Prasad Ranganath
 */

// Solves a simplified version of sudoku (w/ only row and column constraints)
// using SAT solving

## bfsSolver.groovy
/*
 * Copyright (c) 2018, Venkatesh-Prasad Ranganath
 *
 * Licensed under BSD 3-clause License
 *
 * Author: Venkatesh-Prasad Ranganath
 */

import groovy.transform.Field

## dfsSolver.groovy
/*
 * Copyright (c) 2018, Venkatesh-Prasad Ranganath
 *
 * Licensed under BSD 3-clause License
 *
 * Author: Venkatesh-Prasad Ranganath
 */

import groovy.transform.Field
	# Python -- v3.6

	import begin
	import multiprocessing
	import time


	def worker(varying_data, fixed_data):
	t = 0
	for j in range(1, 10000):
	set terminal png
	set output "test_process.png"
	set logscale
	set xlabel "Size of fixed data [Number of ints]"
	set ylabel "Performance [seconds per iteration]"
	set title "Performance of options vs Size of fixed data"
	plot "test_process.csv" using 1:2 title "builtin pool" with linespoints, \
	"test_process.csv" using 1:3 title "custom pool" with linespoints
	set terminal png
	set output "test_pool_map.png"
	set logscale
	set xlabel "Size of aux data [Number of ints]"
	set ylabel "Performance [seconds per iteration]"
	set title "Performance of options vs Size of aux data"
	plot "test_pool_map.csv" using 1:2 title "without initializer / default chunksize" with linespoints, \
	"test_pool_map.csv" using 1:3 title "with initializer / default chunksize" with linespoints, \
	"test_pool_map.csv" using 1:4 title "without initializer / 250 chunksize" with linespoints, \
	"test_pool_map.csv" using 1:5 title "with initializer / 250 chunksize" with linespoints, \
	class A {
	protected foo() {
	this.bar("Site foo1")
	def x = {
	println("This: ${this.class}")
	this.bar("Site foo2")
	}
	x()
	}
	buildscript {
	repositories {
	jcenter()
	google()
	}

	dependencies {
	classpath 'com.android.tools.build:gradle:3.0.1'
	}
	}
	/*
	* Copyright (c) 2018, Venkatesh-Prasad Ranganath
	*
	* Licensed under BSD 3-clause License
	*
	* Author: Venkatesh-Prasad Ranganath
	*/

	// Sorts three numbers using SAT solving
	// Script uses z3 solver (https://github.com/Z3Prover/z3)