Re: Note to Chuck Crayne

hutch-- wrote: 
Frank,

Must be a matter of taste, i thought it was finished when the C++ junk
started.

Well, I guess it quit being "on topic" at that point. I think it's "interesting" that if you:

1) know machine/assembly language, so you know what code you want to produce, and...

2) know exactly what output your compiler will produce from a given input,

you can produce HLL code that's "as good as" (identical to) what you'd produce by any other means. Those of us who are smart/stubborn/crazy enough to use asm can skip step two and "cut out the middle man"...

I am more than happy to help out a guy after some assembler
code


Yes, and we (most of us) thank you for it!

but the waffle that followed did not have much content.

True. Caused me to make an interesting observation, though... If *you* optimize strlen to shave one cycle off it, and you distribute your library to 1000 users, and they each write a program that uses strlen 1000 times, and distribute it to 1000 end-users, and they each run it 1000 times... that's a hell of a lot of cycles!

If *I* optimize strlen... all I get is the one cycle.

As usual, "what are you going to do with it" determines what's "good" or "worthwhile".

You worried that someone's going to adopt Betov's strlen? :)

Only if we are really lucky. :)

There must be "even worse" in common usage. As you know, I like "open sauce" software, so if I felt like plowing through the C source, I cou;d find a real gem for us to optimize. When I click on the little hieroglyph to "sort by thread" instead of "sort by date", it takes - by wall clock - approximately a minute and fifteen seconds to complete. What kind of a sort algo does *that*???

"Optimizing strlen" is not going to solve this type of problem, but getting rid of the "it doesn't matter" attitude might...

Best,
Frank

P.S. I saved your posts on "qsort" - haven't played with 'em yet...
.

Relevant Pages

  • One more "strlen" - was: Note to Chuck Crayne
    ... optimize strlen to shave one cycle off it, and you distribute your library to 1000 users, and they each write a program that uses strlen 1000 times, and distribute it to 1000 end-users, and they each run it ... We would of course only do strlen once per string, so we have to imagine we've got a lot of strings being thrown at us. ... When I click on the little hieroglyph to "sort by thread" instead of "sort by date", it takes - by wall clock - approximately a minute and fifteen seconds to complete. ... A better approach would be to keep a running index table for every column the user can sort by and every index table should be updated every time Thunderbird recieves an email/post...this way, the click on the glyph merrly selects which index table to use when picking what message headings to show in the window -- no need to run no freak'n algo. ...
    (alt.lang.asm)
  • Re: Sorting a Collection by a certain field
    ... so there isn't a chance to manually compact it. ... If bloat is a concern, ... I can tell, there is no built in 'sort collection' function, so this ... As I cycle through ...
    (microsoft.public.access.modulesdaovba)
  • Re: OT: Cyclisti opinions sought
    ... one because I really want a hobby and as the last cycle I owned was a ... MTB at that sort of price because you'll destroy the ... floppy forks they put on cheap bikes. ...
    (uk.rec.motorcycles)
  • Re: A truely BIJECTIVE BWT is here!
    ... Each cycle in my way is unique. ... Given strings from ... separte cycles are different the compare function need only ... You could sort each cycle indepently and then merge the results ...
    (comp.compression)