Simon Flannery TheRayTracer

## lm75a.sh
#!/bin/bash

readonly lm75=0x48 # Slave address with A0, A1, and A2 set to 0v (ground).

while [ $# -gt 0 ]
do
   if [ "$1" == "-debug" ]
   then
      debug=true
   fi

## main
class jug:
    def __init__(self, size):
        self.size = size
        self.volume = 0
        self.waste = 0

    def empty(self):
        self.waste = self.waste + self.volume
        self.volume = 0


## chart.png

      
              4 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                TheRayTracer
                / chart.png
            
            
              Last active
              August 29, 2015 14:10
            
              
                A small collection of scripts to simulate and analyse a game of Monopoly.
              
          
## cpuid.h
#ifndef CPUID_H
#define CPUID_H

#include <memory.h>

#define FAMILY_ID          0x0000F00
#define EXT_FAMILY_ID      0x0F00000

#define PENTIUM4_ID        0x0000F00

## iris_classification_results.png

      
              3 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                TheRayTracer
                / iris_classification_results.png
            
            
              Last active
              August 14, 2017 09:44
            
              
                This R script demonstrates Machine Learning and classification using the Caret package. First, the Iris set is divided into a training set and a test set. Secondly, the model is trained. Then, predictions are queried and accuracy is calculated. Lastly, RoC curves are plotted for evaluation. Plots are generated for each step.
              
          
## main.cpp
#include <iostream>
#include <limits>
#include <cassert>

namespace std {   }
using namespace std;

/* Computes the smallest value such that, when added to 1, is still distinguishable from 1. */
template<typename T>
int epsilon(T& eps)

## main.cpp
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cassert>

## main.cpp
#include <iostream>
#include <bitset>
#include <vector>
#include <cassert>

namespace std {   }
using namespace std;

typedef size_t (*pHashFunc)(const char*);

## main.cpp
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>

#define SAMPLE_SIZE 36000

namespace std {   }
using namespace std;

## main.cpp
#include <iostream>
#include <fstream>
#include <vector>
#include <cassert>
#include <limits>
#include <iomanip>

namespace std {   }
using namespace std;
	#!/bin/bash

	readonly lm75=0x48 # Slave address with A0, A1, and A2 set to 0v (ground).

	while [ $# -gt 0 ]
	do
	if [ "$1" == "-debug" ]
	then
	debug=true
	fi
	class jug:
	def __init__(self, size):
	self.size = size
	self.volume = 0
	self.waste = 0

	def empty(self):
	self.waste = self.waste + self.volume
	self.volume = 0
	#ifndef CPUID_H
	#define CPUID_H

	#include <memory.h>

	#define FAMILY_ID 0x0000F00
	#define EXT_FAMILY_ID 0x0F00000

	#define PENTIUM4_ID 0x0000F00
	#include <iostream>
	#include <limits>
	#include <cassert>

	namespace std { }
	using namespace std;

	/* Computes the smallest value such that, when added to 1, is still distinguishable from 1. */
	template<typename T>
	int epsilon(T& eps)
	#include <iostream>
	#include <fstream>
	#include <iomanip>
	#include <cmath>
	#include <algorithm>
	#include <string>
	#include <vector>
	#include <set>
	#include <cassert>
	#include <iostream>
	#include <bitset>
	#include <vector>
	#include <cassert>

	namespace std { }
	using namespace std;

	typedef size_t (pHashFunc)(const char);