ryan-beckett

import java.io.FileInputStream;
import java.io.IOException;
import java.nio.file.FileVisitResult;
import java.nio.file.FileVisitor;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.nio.file.SimpleFileVisitor;
import java.nio.file.attribute.BasicFileAttributes;
import java.util.ArrayList;

ryan-beckett

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.net.URL;

import javax.xml.XMLConstants;
import javax.xml.transform.Source;
import javax.xml.transform.stream.StreamSource;
import javax.xml.validation.Schema;
import javax.xml.validation.SchemaFactory;

ryan-beckett

import java.math.BigInteger;
import java.security.SecureRandom;
import java.util.HashSet;
import java.util.Random;
import java.util.Set;

/**
 * An efficient implementation of the RSA public-key cipher. All generated
 * exponents used for encryption and decryption are greater than <code>5</code>
 * (to secure against basic attacks, e.g. Chinese Remainder Theorem). The

ryan-beckett

import java.util.*;
import java.lang.*;

////////////////////////////////////////////////////////////////
// A quick and dirty implementation that parses and evaluates a 
// logical expression in post-fix form. From left to right binary
// expressions are extracted (3 tokens), evaluated, and it's result
// is inserted into its place. This is done until the expression is
// gone. E.g.
//

ryan-beckett

	.text
main:

    li $t4, 1, #t4 = counter
i1: ori $t0, $0, 1000
i2: ori $t1, $0, 2000
i3: addi $t2, $t0, 100
i4: #lw $t3, 0($t1)
i5: #lw $t4, 0($t0)
i6: add $t3, $t3, $t4

ryan-beckett

	.text
main:
	#populate arg registers
	li $a0, 1
	li $a1, 2
	li $a2, 3
	li $a3, 4	
	
	#push 5th arg on stack
	li $t0, 10

ryan-beckett

import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;

/**
 * 
 * A generic directed graph that doesn't allow duplicate elements and performs
 * topological sorting to detect cycles. All primitive operations are done in

ryan-beckett

/**
 * 
 * Defines a default handler for notification callbacks.
 * 
 * @author Ryan Beckett
 * @version 1.0
 * 
 */
public abstract class NotificationHandler {

ryan-beckett

import java.util.*;

public class ControllerTest {
    
    private static Controller controller = Controller.getInstance();
    private static View view = new View();
    private static LoginHandler loginHandler = new LoginHandler();
    
    public static void main(String[] args) {
        

ryan-beckett

import java.util.*;

public class CommentStripper {
    
    private StaticTransitionTable transitions;
    private StringBuilder sb;
    private int index;
    private int state;
    private final char EOF = '@';