justinmeiners

(use srfi-1)

(define (advance ls n)
  (if (< n 1)
      ls
      (advance (cdr ls) (- n 1))))

(define (subset ls start count)
  (define (build-cell it i)
    (if (= i count)

justinmeiners

import math

def sqrt(x_0, guess, tol):
    x = guess
    while math.fabs(x*x - x_0) > tol:
        x = (x*x - x_0) / (2.0 * x)
    return x

print(sqrt(2.0, 2.0, 0.0001))

justinmeiners

(define (eval-html templ env)

  (define (lookup-var key env)
    (let ((pair (assoc key env)))
         (if (pair? pair)
            (cdr pair)
            '())))
             
  (define (tag? templ)

justinmeiners

# Created By: Justin Meiners (2012)
# This was really useful at one point. I doubt it still is. 
from pymel.all import *
import pymel

selection_list = pymel.core.ls(type="transform", selection=True)

for node in selection_list:    
    node.centerPivots()
    point = node.getRotatePivot(space="world")

justinmeiners

PS3

• Cell
• Cell Architecture Explained
• Hard to Develop For
• SPU Assembly Cheat Sheet
• The Cell Project
• The Cell Broadband Engine
• The Potential of the Cell Processor for Scientific Computing (PDF)
• What is DMA

justinmeiners

; ParenScript experiment
; https://common-lisp.net/project/parenscript/reference.html
; https://gitlab.common-lisp.net/parenscript/parenscript

; typical functions
(defun fib (n)
  (cond ((= n 0) 0)
        ((= n 1) 1)
        (t (+ (fib (- n 1)) (fib (- n 2))))))

justinmeiners

// Created By: Justin Meiners (2018)
pragma solidity ^0.4.24;

// https://en.wikipedia.org/wiki/Dutch_auction

contract DutchAuction {
    uint public askingPrice;
    address public auctioneer;
    address public winner;
    address public seller;

justinmeiners

# Created By: Justin Meiners (2017)
# simple calculations
# -------------------------------

import math

def volume_cone(radius, height):
    volume = math.pi * (radius**2.0) * (height / 3.0)
    return volume

justinmeiners

Learn You a Haskell Notes

Learn You a Haskell For Great Good

I tried going through this book a few times when I was younger, but lacked the mathematical knowledge to understand a lot of what was going on. Now the functional ideas and type system are a breeze but lazinesss is still very new and mysterious.

Haskell Overview

Referential transparency: if a function is called multiple times with the same inputs, it will produce the same outputs.

justinmeiners

// how to write a struct to a buffer.

typedef struct {
   int version;
   int count;
   char id[8];
} FileInfo;

FileInfo info;