"Sean L. Palmer" <seanpalmer@directvinternet.com> wrote in news:b4nu31$22vc$1@digitaldaemon.com:

> ip address is just 4 bytes ( or 4 ints for a v6 (3 ints and 4 bytes
> for compatibly with v4)) // don't quote me on that its the idea I'm
> trying to get across.
> 

Ok. I agree.
The idea is a new representation for version numbers. The storage is not so
important at first.

>     assert(int.size == 4, "This code will only run in 32 bits cpus");
> that or having the assert put the condition as a string in the
> message, so; assert( int.size == 4); would give "assert failed
> 'int.size==4' is not true at line xxxx in File yyyy"

Both. Sometimes the check have few information.

>> 3 - Module version
>>
>> Each module could have a .version property and a .vendor property. They will be assigned within the module:
> 
> as much as I like the idea, alas it still fails to catch the usual problem .... you forget to increment your version number.
> 
> the only automated solution I can see is allowing modules to be sectioned each section has its "signature" hashed and that is stored both in the module and any places it is imported.

Automatic versioning? Like C# ?
I have sugested only a simple manual versioning.

> classes and structures could also use this (may be with an included length field as the first member)

Yes. It also apply.

> >> 3 - Module version
> >>
> >> Each module could have a .version property and a .vendor property. They will be assigned within the module:
> >
> > as much as I like the idea, alas it still fails to catch the usual problem .... you forget to increment your version number.
> >
> > the only automated solution I can see is allowing modules to be sectioned each section has its "signature" hashed and that is stored both in the module and any places it is imported.
>
> Automatic versioning? Like C# ?
> I have sugested only a simple manual versioning.
>
what does C# do ?

"Sean L. Palmer" wrote:

> From what I understand, a 5x5 matrix would be quite overspecified.
>
> Here's a very gentle intro to some basic GA concepts:
>
> http://sinai.mech.fukui-u.ac.jp/gcj/software/GAcindy/GAcindy.htm
>
> And here's something about your speed:
>
> http://carol.wins.uva.nl/~leo/clifford/sommer.pdf
>
> There is plenty of material on the web about GA.
>
> I haven't tackled your problem but what I've read suggests this is what GA is good at.
>
> Check out Gaigen or boost::clifford if you want to do your own experiments.

Thanks for the links.  sommer is still to fast for me, but I found http://www.mrao.cam.ac.uk/~clifford/introduction/intro/intro.html, which builds up to the concept of multivectors slowly.  It allows somebody like me, who starts understanding only linear algebra, to build up to an understanding of a multivector is.

I haven't yet fininshed the intro at that link, and I'm not even close to understanding how I could use multivectors to model shapes.  But the experts think that GA is good for everything, including defining the kitchen sink.

FWIW, my definition, as I understand so far: A multivector is the linear combination of spaces of different dimensions.  Read the link, if anybody's interested.

--
The Villagers are Online! http://villagersonline.com

.[ (the fox.(quick,brown)) jumped.over(the dog.lazy) ]
.[ (a version.of(English).(precise.more)) is(possible) ]
?[ you want.to(help(develop(it))) ]

"Russell Lewis" <spamhole-2001-07-16@deming-os.org> wrote in message news:3E6E16FD.2000600@deming-os.org...
> One (ugly) solution is a 2D associative array of function pointers, taking ShapeID (an enum, probably) as indexes for both.  But that seems hackish to me and requires that all of my Shape* classes get assigned their own ID...a problematic design.

That's what I'd do. Not the most elegant design, but if you put in a few contracts to ensure that the IDs are set up correctly, it'll do the job efficiently.