| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Re: Organizing source code |
From: Tony Williams
I think others already mentined it, but if you want something more C++ish
the STL is well worth investigating. Lots of handy templated stuff and it's
about as close to a standard as you'll find in the C++ world and is pretty
efficient. Careful though - it takes no prisoners when it comes to error
checking. Pass STL methods bad data and they
*will* crash.
--
Tony
PS. "One of us! One of us!"
On 10/21/2004 05:28 PM, Geo wrote:
> Thanks!
>
> Geo.
>
> "Tony Williams" wrote in message
> news:41755c3b$1{at}w3.nls.net...
>
>>On 10/18/2004 06:43 PM, Geo wrote:
>>[snip]
>>
>>>As for the string search function, that's simple as I've done it several
>>>times before in everything from assembler to qbasic. But I figured it's
>
> such
>
>>>a common requirement that there just might be an optimized function for
>
> this
>
>>>already. That's supposed to be one of the strengths of c++
>>
>>strstr() is pretty well optimised. If you're searching for long
>>strings in a looong string try a search on Boyer-Moore, but for
>>in-memory stuff strstr() is usually faster.
>>
>>--
>>Tony
>
>
>
--- BBBS/NT v4.01 Flag-5
* Origin: Barktopia BBS Site http://HarborWebs.com:8081 (1:379/45)SEEN-BY: 633/267 270 5030/786 @PATH: 379/45 1 396/45 106/2000 633/267 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.