Search:

meh, of all things, i realized Microsoft word uses both OCX and DLLs. lol

But, b in assembly is faster than B in C.




Yea, but it's just like C. (i think you can put member functions in structs, not sure... and actually... i think you can also make things private.
...

Then C is the next best thing... Still not the best. The fastest algorithm really shouldn't be auto generated, which comes with compilers.



That'd be saying the only OOP one out there would be...

True..



I have that... No offence, it sucks for practical use, i'd only use it to learn. Alot of code dosn't even work with it. Like wchar_t... Talk about unsupported...



Be much...

I don't think it's possible to make that bad of a mistake...



One should worrry, it also goes through the processor like everything else. What if there is a faster way? Plus, i'm curious how...

So, basically, as long as i don't have a function call itself, i don't have to worry about anything, right?




Yea, but somthing has to come from some where. This means, something non C++ or...

So in other words, writing functions themselves rather than macros wouldn't change the speed any, just risk chance of crashing.. What do you me recursion? In otherwords, are you talking about calling...

You forget, when you're talkin' FPS and stuffs, ick... A second is like forever, especially if you're like me with ADHD. lol



The more compact, the better... well.. the less code the better....

Not as fast as you think... lol 1ghz... based on my 2.5 i'd have to say that's about 1000 increments and printing them out per second.



If i knew i wouldn't ask. =p



Is it commented at...

The real trick is how they append one string to another so quickly without a while loop when they use the + function. (You can tell it isn't a while loop cause it dosn't take half an hour to do. (and...

Nope... Won't compile. Gives the cannot convert char[4] to char[5] error. =p



no no no, in that example the pointers only held the address of another variable. Thing is, people use (and i think...

It does change the result.



Visual Studio of course... And i know you'll comment that but i have my resons to restricting all my windows projects to visual C++... lol
And yes... Auto 0ed...

Well yea.. But things crash when i use pointers as variables. It won't auto allocate... But wait... Are you saying i could read byte 0 in the ram by declaring a pointer that equals 1? (please do...

i made an edit while you posted, just read up on it.

As for your problem... Might help to use string...



switch (thing[value_at])

Then do all the cases... And for each letter, you make...

That they are, and learning is a concept that comes from combing both. In other words, try it and see what happens. Also, (not reading back yet) if you're using C/C++ your printf will give you.......

But is that really in our hands? Do we really have the ability to tell the computer to read binary in our own way? Waaaaaaaaaaait... we do.... *gets out screw driver*

I missed that part. lol

But a standard like that would have a -0, what the heck?

Actually, my table (i'm learning more and more about binary usign win calc, which seems to hold a biiiiiiit more logic than what you said) says you forgot somthing...

Binary:
1 = 1
2 = 10...

Makes a big difference actually. Singing halves the number of positives intergers.

So basically, in signed ints (32 bits), the first bit is for signing, and the other 31 is the actual numbers?

Here's one for you guys... Let's see if some one could crack how this is possible... My computer is windows xp service pack 2. Now... That would mean it's 32 bit based... So how in the world did it...

Exactly what is it, PKT? I mean what kinda game is it?

And a nice group of tuts are found here in the threads if you look...

I wish i could make a teleporter, there's a gal i know over a thousand miles away that i wouldn't mind going to visit. ;)

a little somthing i found that was amusing...