pmelanson

import os
import csv
import re

item_block_begin_pattern = re.compile(r"\sitem\s(\S+)")
item_block_end_pattern = re.compile(r"}")
weapon_info_line = re.compile(r"=\s+(.+?)\s*,")
fieldnames = [
    'DisplayName',
    'Weight',

pmelanson

Keybase proof

I hereby claim:

• I am pmelanson on github.
• I am pj2melan (https://keybase.io/pj2melan) on keybase.
• I have a public key ASDfyzQR6IrXGIa3zMbzjUF6dEpqj_wakIv6NvuxTiE4YAo

To claim this, I am signing this object:

pmelanson

# Step-By-Step Gaussian Elimination on Augmented Matrices
# By Tristan Hume

require "rational"

def reduce_down(mat)
  # Use each row going down to cancel lower rows
  # Each iteration of this loop is one step
  rows = mat.length
  (0..rows-2).each do |ri1|

pmelanson

#!/bin/python
# Approximates the definite integral of sin(x) using Simpson's rule.

from math import pi,sin,cos

def simpson_approximation(a, b, n):
	"Approximates the definite integral of sin(x) from a to b with respect to x with 'n' iterations"

	dx = (b-a)/n

pmelanson

#include <iostream>
#include <vector>
#include <boost/intrusive/list.hpp>
using namespace std;

class entity_c : public boost::intrusive::list_base_hook<> {
public:

	const int isconst;
	int notconst;

pmelanson

#include <iostream>
using namespace std;

class object_c {

public:
	int			x,
				y;

	object_c(int X, int Y) : x (X), y (Y){}

pmelanson

#ifndef CLASS_HPP
#define CLASS_HPP //in codeblocks you can just type "guard" then press ctrl-j

#include <whatever>

//if you need another class that you've made, declare it like this
class ineeddis;

class bum {
private:

pmelanson

class_c::class_c (int foo, char bar) : a (foo), b (bar) {
 cout << a << "==" << foo << endl;
 cout << b << "==" << bar << endl;  
}

pmelanson

#include "include/eigen/dense"

int main() {

  const unsigned max = 86800;
//	long double v[max][2];
//	long double d[2] = {3.14159e5, 82.31283e3};
	Eigen::Matrix<long double, 2, 1> v[max];
	Eigen::Matrix<long double, 2, 1> d;
	d(0,0) = 3.14159e5;