LEMON/LEMON-main Changeset - r778:a143f19f465b

Repositories » LEMON » LEMON-main

Summary
Changelog
Files
Switch To
- loading...
Options
- Lightweight changelog
- Search
Pull Requests

Changeset - r778:a143f19f465b

« 776:eff1ca

779:c160bf »

r778:a143f19f465b

Tue, 29 Sep 2009 13:03:34

[Not Reviewed]

0 comments (0 inline)

kpeter (Peter Kovacs)
kpeter@inf.elte.hu

Make some graph member functions static (#311, #68)

0 6 0

default

6 files changed with 25 insertions and 25 deletions:

lemon/bits/graph_extender.h

lemon/edge_set.h

lemon/full_graph.h

lemon/hypercube_graph.h

lemon/smart_graph.h

lemon/static_graph.h

↑ Collapse diff ↑

lemon/bits/graph_extender.h

Show inline comments

@@ -55,13 +55,13 @@
    int maxId(Arc) const {
      return Parent::maxArcId();
    }

    Node fromId(int id, Node) const {
    static Node fromId(int id, Node) {
      return Parent::nodeFromId(id);
    }

    Arc fromId(int id, Arc) const {
    static Arc fromId(int id, Arc) {
      return Parent::arcFromId(id);
    }

    Node oppositeNode(const Node &node, const Arc &arc) const {
@@ -354,17 +354,17 @@
    int maxId(Edge) const {
      return Parent::maxEdgeId();
    }

    Node fromId(int id, Node) const {
    static Node fromId(int id, Node) {
      return Parent::nodeFromId(id);
    }

    Arc fromId(int id, Arc) const {
    static Arc fromId(int id, Arc) {
      return Parent::arcFromId(id);
    }

    Edge fromId(int id, Edge) const {
    static Edge fromId(int id, Edge) {
      return Parent::edgeFromId(id);
    }

    Node oppositeNode(const Node &n, const Edge &e) const {

lemon/edge_set.h

Show inline comments

@@ -866,9 +866,9 @@
    void first(Arc& arc) const {
      arc.id = arcs.size() - 1;
    }

    void next(Arc& arc) const {
    static void next(Arc& arc) {
      --arc.id;
    }

    void firstOut(Arc& arc, const Node& node) const {
@@ -1172,17 +1172,17 @@
    void first(Arc& arc) const {
      arc.id = arcs.size() - 1;
    }

    void next(Arc& arc) const {
    static void next(Arc& arc) {
      --arc.id;
    }

    void first(Edge& arc) const {
      arc.id = arcs.size() / 2 - 1;
    }

    void next(Edge& arc) const {
    static void next(Edge& arc) {
      --arc.id;
    }

    void firstOut(Arc& arc, const Node& node) const {

lemon/full_graph.h

Show inline comments

@@ -50,9 +50,9 @@
 		    typedef True NodeNumTag;
 		    typedef True ArcNumTag;
 		    Node operator()(int ix) const { return Node(ix); }
-		    int index(const Node& node) const { return node._id; }
+		    static int index(const Node& node) { return node._id; }
 		    Arc arc(const Node& s, const Node& t) const {
 		      return Arc(s._id * _node_num + t._id);
+		    }
@@ -208,9 +208,9 @@
 		    /// Returns the index of the given node. Since it is a static
 		    /// digraph its nodes can be indexed with integers from the range
 		    /// <tt>[0..nodeNum()-1]</tt>.
 		    /// \sa operator()
-		    int index(const Node& node) const { return Parent::index(node); }
+		    static int index(const Node& node) { return Parent::index(node); }
 		    /// \brief Returns the arc connecting the given nodes.
 		    ///
 		    /// Returns the arc connecting the given nodes.
@@ -282,9 +282,9 @@
 		  public:
 		    Node operator()(int ix) const { return Node(ix); }
-		    int index(const Node& node) const { return node._id; }
+		    static int index(const Node& node) { return node._id; }
 		    Edge edge(const Node& u, const Node& v) const {
 		      if (u._id < v._id) {
 		        return Edge(_eid(u._id, v._id));
@@ -579,9 +579,9 @@
 		    /// Returns the index of the given node. Since it is a static
 		    /// graph its nodes can be indexed with integers from the range
 		    /// <tt>[0..nodeNum()-1]</tt>.
 		    /// \sa operator()
-		    int index(const Node& node) const { return Parent::index(node); }
+		    static int index(const Node& node) { return Parent::index(node); }
 		    /// \brief Returns the arc connecting the given nodes.
 		    ///
 		    /// Returns the arc connecting the given nodes.

lemon/hypercube_graph.h

Show inline comments

@@ -261,9 +261,9 @@
 		    int dimension(Arc arc) const {
 		      return arc._id >> _dim;
+		    }
-		    int index(Node node) const {
+		    static int index(Node node) {
 		      return node._id;
+		    }
 		    Node operator()(int ix) const {
@@ -336,9 +336,9 @@
 		    /// \brief The index of a node.
 		    ///
 		    /// Gives back the index of the given node.
 		    /// The lower bits of the integer describes the node.
-		    int index(Node node) const {
+		    static int index(Node node) {
 		      return Parent::index(node);
+		    }
 		    /// \brief Gives back a node by its index.

lemon/smart_graph.h

Show inline comments

@@ -507,25 +507,25 @@
    void first(Node& node) const {
      node._id = nodes.size() - 1;
    }

    void next(Node& node) const {
    static void next(Node& node) {
      --node._id;
    }

    void first(Arc& arc) const {
      arc._id = arcs.size() - 1;
    }

    void next(Arc& arc) const {
    static void next(Arc& arc) {
      --arc._id;
    }

    void first(Edge& arc) const {
      arc._id = arcs.size() / 2 - 1;
    }

    void next(Edge& arc) const {
    static void next(Edge& arc) {
      --arc._id;
    }

    void firstOut(Arc &arc, const Node& v) const {

lemon/static_graph.h

Show inline comments

@@ -91,14 +91,14 @@
 		    void firstIn(Arc& e, const Node& n) const { e.id = node_first_in[n.id]; }
 		    void nextIn(Arc& e) const { e.id = arc_next_in[e.id]; }
 		    int id(const Node& n) const { return n.id; }
 		    Node nodeFromId(int id) const { return Node(id); }
 		    static int id(const Node& n) { return n.id; }
 		    static Node nodeFromId(int id) { return Node(id); }
 		    int maxNodeId() const { return node_num - 1; }
 		    int id(const Arc& e) const { return e.id; }
 		    Arc arcFromId(int id) const { return Arc(id); }
 		    static int id(const Arc& e) { return e.id; }
 		    static Arc arcFromId(int id) { return Arc(id); }
 		    int maxArcId() const { return arc_num - 1; }
 		    typedef True NodeNumTag;
 		    typedef True ArcNumTag;
@@ -267,27 +267,27 @@
 		    /// \brief The node with the given index.
 		    ///
 		    /// This function returns the node with the given index.
 		    /// \sa index()
-		    Node node(int ix) const { return Parent::nodeFromId(ix); }
+		    static Node node(int ix) { return Parent::nodeFromId(ix); }
 		    /// \brief The arc with the given index.
 		    ///
 		    /// This function returns the arc with the given index.
 		    /// \sa index()
-		    Arc arc(int ix) const { return Parent::arcFromId(ix); }
+		    static Arc arc(int ix) { return Parent::arcFromId(ix); }
 		    /// \brief The index of the given node.
 		    ///
 		    /// This function returns the index of the the given node.
 		    /// \sa node()
-		    int index(Node node) const { return Parent::id(node); }
+		    static int index(Node node) { return Parent::id(node); }
 		    /// \brief The index of the given arc.
 		    ///
 		    /// This function returns the index of the the given arc.
 		    /// \sa arc()
-		    int index(Arc arc) const { return Parent::id(arc); }
+		    static int index(Arc arc) { return Parent::id(arc); }
 		    /// \brief Number of nodes.
 		    ///
 		    /// This function returns the number of nodes.

0 comments (0 inline)

...	...	@@ -55,13 +55,13 @@
55	55	int maxId(Arc) const {
56	56	return Parent::maxArcId();
57	57	}
58	58
59		Node fromId(int id, Node) ~~const~~ {
	59	static Node fromId(int id, Node) {
60	60	return Parent::nodeFromId(id);
61	61	}
62	62
63		Arc fromId(int id, Arc) ~~const~~ {
	63	static Arc fromId(int id, Arc) {
64	64	return Parent::arcFromId(id);
65	65	}
66	66
67	67	Node oppositeNode(const Node &node, const Arc &arc) const {
...	...	@@ -354,17 +354,17 @@
354	354	int maxId(Edge) const {
355	355	return Parent::maxEdgeId();
356	356	}
357	357
358		Node fromId(int id, Node) ~~const~~ {
	358	static Node fromId(int id, Node) {
359	359	return Parent::nodeFromId(id);
360	360	}
361	361
362		Arc fromId(int id, Arc) ~~const~~ {
	362	static Arc fromId(int id, Arc) {
363	363	return Parent::arcFromId(id);
364	364	}
365	365
366		Edge fromId(int id, Edge) ~~const~~ {
	366	static Edge fromId(int id, Edge) {
367	367	return Parent::edgeFromId(id);
368	368	}
369	369
370	370	Node oppositeNode(const Node &n, const Edge &e) const {

...	...	@@ -866,9 +866,9 @@
866	866	void first(Arc& arc) const {
867	867	arc.id = arcs.size() - 1;
868	868	}
869	869
870		void next(Arc& arc) ~~const~~ {
	870	static void next(Arc& arc) {
871	871	--arc.id;
872	872	}
873	873
874	874	void firstOut(Arc& arc, const Node& node) const {
...	...	@@ -1172,17 +1172,17 @@
1172	1172	void first(Arc& arc) const {
1173	1173	arc.id = arcs.size() - 1;
1174	1174	}
1175	1175
1176		void next(Arc& arc) ~~const~~ {
	1176	static void next(Arc& arc) {
1177	1177	--arc.id;
1178	1178	}
1179	1179
1180	1180	void first(Edge& arc) const {
1181	1181	arc.id = arcs.size() / 2 - 1;
1182	1182	}
1183	1183
1184		void next(Edge& arc) ~~const~~ {
	1184	static void next(Edge& arc) {
1185	1185	--arc.id;
1186	1186	}
1187	1187
1188	1188	void firstOut(Arc& arc, const Node& node) const {

...	...	@@ -507,25 +507,25 @@
507	507	void first(Node& node) const {
508	508	node._id = nodes.size() - 1;
509	509	}
510	510
511		void next(Node& node) ~~const~~ {
	511	static void next(Node& node) {
512	512	--node._id;
513	513	}
514	514
515	515	void first(Arc& arc) const {
516	516	arc._id = arcs.size() - 1;
517	517	}
518	518
519		void next(Arc& arc) ~~const~~ {
	519	static void next(Arc& arc) {
520	520	--arc._id;
521	521	}
522	522
523	523	void first(Edge& arc) const {
524	524	arc._id = arcs.size() / 2 - 1;
525	525	}
526	526
527		void next(Edge& arc) ~~const~~ {
	527	static void next(Edge& arc) {
528	528	--arc._id;
529	529	}
530	530
531	531	void firstOut(Arc &arc, const Node& v) const {

RhodeCode

Login to your account