samanthadoran

* (defvar a (nes:make-nes))

A
* (nes:console-on a)

32768
* (setq *print-base* 16)

10
* (6502-cpu:step-cpu (nes:nes-cpu a))

samanthadoran

Keybase proof

I hereby claim:

• I am samanthadoran on github.
• I am samanthadoran (https://keybase.io/samanthadoran) on keybase.
• I have a public key whose fingerprint is 3E7E AAB4 7948 6D13 FD2C F0AF 6283 3710 5308 1FBA

To claim this, I am signing this object:

samanthadoran

[samanthadoran@samdoran-linux scaling-goggles]$ rlwrap sbcl --load "scaling-goggles.lisp" 
This is SBCL 1.3.1, an implementation of ANSI Common Lisp.
More information about SBCL is available at <http://www.sbcl.org/>.

SBCL is free software, provided as is, with absolutely no warranty.
It is mostly in the public domain; some portions are provided under
BSD-style licenses.  See the CREDITS and COPYING files in the
distribution for more information.
To load "split-sequence":
  Load 1 ASDF system:

samanthadoran

* (defvar field (newpack:make-field 10 10))

FIELD
* (newpack:print-field field)
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX

samanthadoran

(in-package :cl-user)

(defpackage #:my-new-package
  (:nicknames #:newpack)
  (:use :cl :cl-user)
  (:export #:mutate))

(in-package :my-new-package)

(defun mutate-step (s acc)

samanthadoran

use std::collections::{HashMap, HashSet};
use super::item::Item;


pub struct Character {
    pub attributes: Item,
    pub inventory: HashMap<String, (Item, i32)>,
    pub feats: HashMap<String, HashMap<String, i32>>,
    pub scores: HashMap<String, i32>,
    pub ability_score_names: HashSet<String>,

samanthadoran

import reader, printer, nre, types, tables, future, env

proc READ(input: string): malData
proc eval_ast(ast: malData, env: Env): malData
proc EVAL(ast: malData, env: Env): malData
proc PRINT(ast: malData): string
proc rep(input: string, env: Env): string


proc READ(input: string): malData =

samanthadoran

//メロさん
#include <iostream>
#include <vector>
#include <math.h>
#include <cstdlib>

using namespace std;

//A "full-adder" of sorts, currently using a while loop rather than multiple circuits
vector<bool> adder(vector<bool>::iterator a, vector<bool>::iterator b)

samanthadoran

#include <iostream>
#include <random>
#include <stack>
#include <vector>
#include <unordered_set>
#include <string>
#include <iterator>
#include "../headers/card.h"

using std::vector;

samanthadoran

#include <iostream>
#include <SFML/Graphics.hpp>
#include <random>
#include <time.h>
#include <vector>
#include <unordered_set>
#include <chrono>
#include "../headers/card.h"

//An optimized function to generate cards, O(n)