COIN-OR::LEMON - Graph Library

Changeset 1157:761fe0846f49 in lemon for lemon/bits


Ignore:
Timestamp:
09/13/12 11:45:36 (12 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
1158:8d2e55fac752, 1159:7fdaa05a69a1, 1167:c5990f454032
Phase:
public
Message:

Fix clang compilation warnings and errors (#449)

Location:
lemon/bits
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/bits/bezier.h

    r463 r1157  
    160160    const Point d=(a+b)/2;
    161161    const Point e=(b+c)/2;
    162     const Point f=(d+e)/2;
     162    // const Point f=(d+e)/2;
    163163    R f1=_f(Bezier3(p1,a,d,e),_d);
    164164    R f2=_f(Bezier3(e,d,c,p4),_d);
  • lemon/bits/edge_set_extender.h

    r967 r1157  
    524524    // Returns the base node of the iterator
    525525    Node baseNode(const IncEdgeIt &e) const {
    526       return e.direction ? u(e) : v(e);
     526      return e.direction ? this->u(e) : this->v(e);
    527527    }
    528528    // Running node of the iterator
     
    530530    // Returns the running node of the iterator
    531531    Node runningNode(const IncEdgeIt &e) const {
    532       return e.direction ? v(e) : u(e);
     532      return e.direction ? this->v(e) : this->u(e);
    533533    }
    534534
  • lemon/bits/graph_extender.h

    r732 r1157  
    588588    // Returns the base node of the iterator
    589589    Node baseNode(const IncEdgeIt &edge) const {
    590       return edge._direction ? u(edge) : v(edge);
     590      return edge._direction ? this->u(edge) : this->v(edge);
    591591    }
    592592    // Running node of the iterator
     
    594594    // Returns the running node of the iterator
    595595    Node runningNode(const IncEdgeIt &edge) const {
    596       return edge._direction ? v(edge) : u(edge);
     596      return edge._direction ? this->v(edge) : this->u(edge);
    597597    }
    598598
Note: See TracChangeset for help on using the changeset viewer.