Movie links available ?

http://click.hotbot.com/director.asp...ource=LCOSADVF

These data structures and all derivative products are the joint intellectual property of Shrapnel Games Forums and Lonnie Courtney Clay, 50/50 split.
The names assigned to structures, entries, and some description words and sizes may vary from current usage. Just grin and bear it.

struct ker
{
k_pre int;/* Int provides for more than 256 types. With iconic Languages you may need a long */
k_cen int;/* word > 64k combinations, but for English the sparse set is far less than 24*24*24 */
k_suf int;/* the cen is always non null, pre and suf may either or both be null */
k_opi int;/* index of function performed on pre,cen to produce suf */
}
/*
Each of the three components above is a particular node index referencing the set of all node types used
in the structure group given previously. Node types are distinguished by the linking fanin/fanout and processing power.
Ker node classes group together node types for task allocations. The actual ker is rather more complex but
you should get the drift from this example.
*/

struct kernal
{
lex struct ker[n];/* The full set of word components */
bor byte [n][n];/* see bit allocation below */
map byte *[n];/* pointers to whatsoever representations are desired */
}
/*
Note : in all the cases below, the bit allocation may be different from what is specified here, this is only a sample.
Furthermore, the 0/1 values may be swapped as 1/0 for the cases mentioned.
For an entry [n,n*] of bor
bit 0 = 0 if lex [n] is incompatible with lex [n*] else = 1
bit 1 = 0 if lex [n] can only either precede or follow but not do both for [n*] else = 1 and does both
bit 2 = 0 if lex [n] if lex[n*] precedes, else = 1 and follows
bit 3 = 0 if lex [n] gets its inputs direct from preceder [n*] else do op 5-7 on [n*] and = 1
bit 4 = 0 if lex [n] feeds its outputs directly to follower [n*] else do op 5-7 to [n*] and = 1
bit 5,6,7 sample operations
0 = invert, 1 = transpose, 2 = column swap, 3 = row swap
4 = AND mask preceder [n*] with [n] to make follower [n*]
5 =OR mask preceder [n*] with [n] to make follower [n*]
6 = NAND mask preceder [n*] with [n] to make follower [n*]
7 =NOR mask preceder [n*] with [n] to make follower [n*]
*/

Think about THAT a WHILE.

Lonnie Courtney Clay

A storm has blown up, so that was either very good or very bad.....

http://archimedes.stanford.edu/faq97.html
http://click.hotbot.com/director.asp...ource=LCOSADVF

The storm is over, sun is shining. I was going to make a joke, but I was logged off of Aol before I had it typed. So here, you can put these three together :

Hammer, Eskimo, GoodBar

I did a search on Mar* Aurelius and got a surprising single hit :
http://web.naex.sk/imperator/cen.htm

HAVE A DRINK ON THE HOUSE!

I suppose that the Japanese will be next ? For those of you who are not familiar with the contents of the FREEDOM Computing Publications HOTDISK #1 and #2 of 1986, find someone who knows what was in them. This is a sort of inside joke....

Lonnie Courtney Clay

http://nd.essortment.com/whoispolonius_rgjo.htm

I knew there had to be a Polonius beating around the bushes somewhere around here.....

Lonnie Courtney Clay

http://www.msichicago.org/

That was not what I had in mind for a search on Cassini but it will do. Also I noted that the Jupiter probe is called Cassini. So I suppose that I should drag in a couple of exclamations from old Television shows here.

Jumping Jupiter !!!

Great Caesar's Ghost !!!!


Lonnie Courtney Clay