[Xastir] Please....

[Curt, WE7U]

On Wed, 12 Jan 2005, Tom Russo wrote:

> Fancy that --- looking over the code it appears to do a linear search through
> the list of existing alerts, doing lots of memory operations on each item in
> the list to shorten the name, and doing a "does this one match?" operation.
>
> Gotta be a more efficient algorithm  than that.  At a minimum, perhaps the
> shortened title could be saved in the alert structure when the alert is
> created or modified, so it doesn't have to go through all those
> strrchr/memmove operations every time it's compared to?

Or a hash table using 1/2/3 key pieces of data from the alert as a
key?

--
Curt, WE7U.   APRS Client Comparisons: http://www.eskimo.com/~archer
"Lotto:    A tax on people who are bad at math." -- unknown
"Windows:  Microsoft's tax on computer illiterates." -- WE7U
"The world DOES revolve around me:  I picked the coordinate system!"