C & C++ Ruby on Rails Tutorial: Learn Rails by Example book and screencasts by Michael Hartl. Python Programming Language. 6502asm.com - 6502 compatible assembler and emulator in javascript. Bezier curves - a primer. Preface In order to draw things in 2D, we usually rely on lines, which typically get classified into two categories: straight lines, and curves.
The first of these are as easy to draw as they are easy to make a computer draw. Give a computer the first and last point in the line, and BAM! Straight line. No questions asked. Curves, however, are a much bigger problem. They're named after Pierre Bézier, who is principally responsible for getting them known to the world as a curve well-suited for design work (working for Renault and publishing his investigations in 1962), although he was not the first, or only one, to "invent" these type of curves. So, what if you need to program them yourself?
—Pomax (or in the tweetworld, @TheRealPomax) Note: virtually all Bézier graphics are interactive. This page uses interactive examples, relying heavily on Bezier.js, as well as "real" maths (in LaTeX form) which is typeset using the most excellent MathJax library. This book is open source. So far so good. Language list. [Site] 99 Bottles of Beer. Category:Unimplemented. User:OberoN. MiniUSPL. Still adding instructions.
--OberoN 17:40, 6 November 2011 (UTC) miniUSPL (mini Unic Stack Programming Language) is an esolang. It's also a Turing tarpit. In miniUSPL you have a FIFO stack of characters, and 14 instructions, as well as 14 symbols. These are: = -> Prints the stack[0] as a char $ -> Prints the stack[0] as an int + -> stack[0]=(stack[0]+stack[1]) mod 256 - -> stack[0]=(stack[0]-stack[1]) mod 256 * -> stack[0]=(stack[0]*stack[1]) mod 256 / -> stack[0]=(stack[0]/stack[1]) mod 256 & -> stack[0]=stack[0]&stack[1] | -> stack[0]=stack[0]|stack[1] ^ -> stack[0]=stack[0]^stack[1] > -> Pushes the next char onto the stack < -> Pulls and discards the first item % -> Duplicates and pushes stack[0] onto the stack ( -> While stack[0] isn't equal to the next char, it loops over the 2nd next char { -> Start of an infinite loop } -> End of an infinite loop Programs[edit] This is the Hello World program: >H=>e=>l==>o=> =>W=o>=r>=l>=d>=>!
And this calculates the Fibonacci sequence: Inline. Inline is an esoteric programming language created by OberoN.
Description[edit] Every value is 8-bit long and has a suffix: :b for binaries, :h for hexadecimal, :d for decimal and :a for ASCIIs. :r and :m for indexed addressing is also possible, like [0:h:r] is the address pointed by register 0 and [0:h:m] is the address pointed by memory cell 0. You can write [0-1:h:r] which is the address pointed by 0 and 1 registers, treating 0 as high part and 1 as low, and also [0-1-2:h:r] and such. Suffixes can be nested like :h:r:m:r. In Inline immediate values are closed in parentheses. All other numbers are treated as registers. Every line is treated as a subroutine/labeled code. List of commands[edit] IO[edit] ! Inputs a char in ASCII to the memory. *(s) position. Cat's Eye Technologies: Project Space.