Re: HLA Lib

Actually, the "separate predicting number of digits before padding"
was researched quite well. Take a look at the threads over in CLAX for
the idea.
can you post links please?

I tried a *lot* of different ways to do generic numeric
conversion. (actually, the "subtract" algorithm in the library still
needs to be replace by Terje's algorithm; "subtract" is faster on a P4
[where I developed the code], but Terje's algorithm is faster on most
other processors).

allright, i will do some comparison to FASMLIB speed. (and maybe steal
some faster HLAlib algos) We'll see, algos in FASMLIB are simple (not
optimized) and straightforward.

Just something I'm avoiding. If someone wants to do buffered I/O, I
encourage them to rethink their algorithms if speed is an issue.

of course, library shouldn't be used where speed matters a lot. But as
long as you have initialization code, and things CAN be done faster
(with buffering), why not? It's your decision to increase simplicity
of usage, thus limiting yourself.

some init and finishing codes are a must-have for solid design
library. How are you going to implement heap for linux without it?

The first memory-management call sets things up. There is no
"finishing code" required for heap management.

I looked at your heap manager a little. First of all - do you rely on
system to clean up all mappings after your app? That isn't very nice
way to do things, and shouldn't occur in professional code.

Otherwise, your heap manager seems good.

Personally i think aligning blocks to 8 bytes is not enough,
especially if you use dynamic strings often (i believe HLA does this).
I decided to set 64 byte aligning, wasting more memory if there are
lot of blocks, but making small consectutive enlargings of block much
faster.

_geti_ is based around readln. Readln will return a line feed the
*first* time EOF occurs, it raise an exception if you try to read more
data from the input. This behavior, btw, was modified based on *your*
suggestions from the last time we had this discussion.
Sorry, missed the modification.

Still, i cannot say i would be satisfied with such behavior. This
silently emulates end of line which is not there. You should AT LEAST
mention it in documentation, but i think this deserves more proper
solution than such workaround. Your readln routine should report EOF
(special exception?) instead of simulating EOL there.

.

Relevant Pages

  • Millers errorbars (was: Re: Spacecraft earth-flyby data reveals
    ... Filter the averaged data so as to remove noise. ... What he did is subtract what he thought was a linear ... paper dealt with his complete algorithm). ... and that same reason applies to the errorbars as well, ...
    (sci.physics.research)
  • Re: Cross Correlating Road Grade information
    ... The point circled was verified with my 'working' algorithm which I posted ... Subtract the mean from x once and for all. ... Compute the 0'th lag correlation coefficient Rxy' ... have to abandon standard functions like XCORR. ...
    (comp.dsp)
  • Re: Can anyone improve this any further......
    ... > Sean Kenwrick wrote: ... >> previous post) which uses a multiple and a subtract instead of a ... Your algorithm looked promising at first until I realised that I ...
    (comp.lang.c)
  • Conjugate Gradient Algorithm Identification for Quad. Prog.
    ... Right-Click and select View Source to view the algorithm. ... // find best variables to add and subtract ... iadd = i; ... isub = i; ...
    (sci.math.num-analysis)
  • Re: Can a "value" overflow?
    ... You'll probably have to generate a special exception for INT_MIN, ... modify your algorithm. ... The overflow happens to the value itself, so you can't save it by using ...
    (comp.lang.c)