Boost logo

Boost :

Subject: Re: [boost] [Review:Algorithms] Comments about search algorithms
From: Stewart, Robert (Robert.Stewart_at_[hidden])
Date: 2011-09-26 11:40:29

Phil Endecott wrote:
> FYI a benchmark program that I've been using is included
> below.
> for (int round = 0; round<100; ++round) {
> if (use_stdsearch) {
> matches = do_search<
> stdsearcher<string::const_iterator> >(pattern,corpus);
> }
> if (use_bm) {

The conditionals in the loop might affect measurements. Why not multiple loops, each within a conditional?

typedef string::const_iterator it_type;
if (use_stdsearch)
   for (int found(0); round < 100; ++round)
      matches = do_search<stdsearched<it_type> >(
         pattern, corpus);
else if (use_bm)

Furthermore, you're paying the cost to create and destroy the searchers each iteration. I think some of the searches have higher construction overhead that pays off in faster searches thereafter.

Rob Stewart robert.stewart_at_[hidden]
Software Engineer using std::disclaimer;
Dev Tools & Components
Susquehanna International Group, LLP


IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

Boost list run by bdawes at, gregod at, cpdaniel at, john at