COIN-OR::LEMON - Graph Library

Changeset 1766:6c59b1386fe8 in lemon-0.x


Ignore:
Timestamp:
11/04/05 16:48:06 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2298
Message:

Tons of todos have been removed.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/lp_base.h

    r1612 r1766  
    304304        for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
    305305          (*this)[j->first]+=j->second;
    306         ///\todo it might be speeded up using "hints"
    307306        const_comp+=e.const_comp;
    308307        return *this;
     
    510509        for (Base::const_iterator j=e.begin(); j!=e.end(); ++j)
    511510          (*this)[j->first]+=j->second;
    512         ///\todo it might be speeded up using "hints"
    513511        return *this;
    514512      }
     
    10021000  {
    10031001    LpSolverBase::Expr tmp(a);
    1004     tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1002    tmp+=b;
    10051003    return tmp;
    10061004  }
     
    10131011  {
    10141012    LpSolverBase::Expr tmp(a);
    1015     tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1013    tmp-=b;
    10161014    return tmp;
    10171015  }
     
    10241022  {
    10251023    LpSolverBase::Expr tmp(a);
    1026     tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1024    tmp*=b;
    10271025    return tmp;
    10281026  }
     
    10361034  {
    10371035    LpSolverBase::Expr tmp(b);
    1038     tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
     1036    tmp*=a;
    10391037    return tmp;
    10401038  }
     
    10471045  {
    10481046    LpSolverBase::Expr tmp(a);
    1049     tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1047    tmp/=b;
    10501048    return tmp;
    10511049  }
     
    11851183  {
    11861184    LpSolverBase::DualExpr tmp(a);
    1187     tmp+=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1185    tmp+=b;
    11881186    return tmp;
    11891187  }
     
    11961194  {
    11971195    LpSolverBase::DualExpr tmp(a);
    1198     tmp-=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1196    tmp-=b;
    11991197    return tmp;
    12001198  }
     
    12071205  {
    12081206    LpSolverBase::DualExpr tmp(a);
    1209     tmp*=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1207    tmp*=b;
    12101208    return tmp;
    12111209  }
     
    12191217  {
    12201218    LpSolverBase::DualExpr tmp(b);
    1221     tmp*=a; ///\todo Doesn't STL have some special 'merge' algorithm?
     1219    tmp*=a;
    12221220    return tmp;
    12231221  }
     
    12301228  {
    12311229    LpSolverBase::DualExpr tmp(a);
    1232     tmp/=b; ///\todo Doesn't STL have some special 'merge' algorithm?
     1230    tmp/=b;
    12331231    return tmp;
    12341232  }
Note: See TracChangeset for help on using the changeset viewer.