-=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- (c) WidthPadding Industries 1987 0|449|0 -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=-

JL235

Post PHP server-side execution
30th July 2010

Continue executing a PHP script after page has been sent

JL235

onLoad events
21st July 2010

a bit more durable then using the onLoad function

JL235

Gradients
26th July 2009

Generic gradients ready to use

JL235

Mathematical Line
21st April 2008

a linear equation from two points

JL235

Algorithms: Binary Trees Example
7th October 2007

Here is an example of a Binary Tree. Binary Trees are used for storing data where each node holds two more nodes on it's left and right branch. When you input a value to the root node it is passed to the left branch if it is less then the current value or *snip*

JL235

Algorithms: Linked List Example
7th October 2007

Here is an example of how to implement a simple linked list. It also uses recursion to implement some of the functions. For example there are two reverse functions, one which uses iteration and one which uses recursion.
[code]Type List
Field firstNode.N*snip*

JL235

Inselkampf Bot
22nd February 2007

I wondered if it were possible to make a bot for Inselkampf, and 2 hours later here it is. Now logs in itself, and finds the session id to be used. Current version posted is for use with a Ruby terminal as it has print outs of buildings it makes and fails *snip*

JL235

List v.1.2
8th December 2006

Dynamic Arrays in Blitz Max

JL235

Dynamic Array v.1.2
7th December 2006

Dynamic Arrays in Blitz
More - Older Posts