alright, i think this is good enough. i'm too lazy to make it any better. unless anyone points out something crippling or has a good suggestion.

So far so good?

edit: i just realized i'm being inconsistent with my leg-shading. fixed that.
edit2: and i'm lacking the light gray belt in some of them. fixed.

it was fun to make. i don't know what i want to make next though.

oh. i was going to say, there's no dim(L1) in axe. but yeah it's 712 bytes.

nice, yeong!


next java mini-project i'm working on: linear equation solver (via rref).
done. here's the code, it's fairly obfuscated.... so good luck if you want to understand it.

import java.util.Scanner;

public class Solve{
static double[][] matrix;
public static void main(String[] args){
Scanner reader = new Scanner(System.in);
System.out.print("# of variables: ");
int vars = reader.nextInt();
inputValues(vars,vars+1);
for(int col = 0; col < vars; col++){
for(int row = 0; row < vars; row++){
if(row==0)
matrix[col] = rowDiv(matrix[col],matrix[col][col]);
if(row!=col)
matrix[row] = rowAdd(rowDiv(matrix[col],-1/matrix[row][col]),matrix[row]);

}
}
for(int i = 0; i < vars; i++)
System.out.println("xyzuvw".substring(i,i+1) + "= " + Math.round(matrix[i][vars]*1000)/1000.0);

}

public static void inputValues(int rows, int columns){
String equ = "Ax+By+Cz+Du+Ev+Fw".substring(0,rows*3-1) + "=" + "ABCDEFG".substring(rows,rows+1);
matrix = new double[rows][columns];
Scanner reader = new Scanner(System.in);
for(int r = 0; r < rows; r++){
System.out.println("Enter equation " + (r+1) + ": \n" + equ);
for(int c = 0; c < columns; c++){//C++
System.out.print("ABCDEFG".substring(c,c+1)+"= ");
matrix[r][c] = reader.nextInt();
}
System.out.println();
}
}

public static double[] rowDiv(double[] r, double c ){
double[] temp = new double[r.length];
for(int p = 0; p < r.length; p++)
temp[p] = r[p] / c;
return temp;
}

public static double[] rowAdd(double[] i, double[] j){
double[] temp = new double[i.length];
for(int p = 0; p < i.length; p++)
temp[p] = i[p] + j[p];
return temp;
}
}

it can take up to 6 variables, but as far as i know if i modified it a little, it could take an infinite number. it returns numbers to the thousandth decimal place. oh, and it will not tell you if there are no solutions/infinite solutions. it will likely do one of the following things in either of these scenarios:
-tell you that all the variables are 0.
-tell you that all the variables are NaN (not a number)
-tell you that all the variables are either -Infinity or Infinity.

On second thought, I could just check a 1-byte value against all my 1-byte tokens, and then, if i got no hits, load the second byte and check all the two-byte tokens...

But I don't want to have to look all my tokens up in a table... ah well... tibasicdev has a good table.

you don't have to look up all your tokens in a table, i don't think... use ^t on a two byte token will work just as well as it will on a one byte.

get rid of red so we can use in calc?

it's a computer game...

i'm confused... from what source? a string? a program? and parsing them so you can.. display them? store their integer equivalents into a free ram area?