# HG changeset patch
# User alpar
# Date 1131121131 0
# Node ID 657de7e5043cd9843cfbfbeccc072f049cdc24f2
# Parent a67ec111236c27a61f3a943164472c2f2e8609c4
SnapShot -> Snapshot
diff -r a67ec111236c -r 657de7e5043c lemon/list_graph.h
--- a/lemon/list_graph.h Fri Nov 04 16:10:23 2005 +0000
+++ b/lemon/list_graph.h Fri Nov 04 16:18:51 2005 +0000
@@ -412,7 +412,7 @@
///referencing a moved edge remain
///valid. However InEdge's and OutEdge's
///may be invalidated.
- ///\warning This functionality cannot be used together with the SnapShot
+ ///\warning This functionality cannot be used together with the Snapshot
///feature.
///\todo It could be implemented in a bit faster way.
Node split(Node n, bool connect = true)
@@ -436,9 +436,8 @@
///restore() function.
///
///\warning Edge and node deletions cannot be restored.
- ///\warning SnapShots cannot be nested.
- ///\todo \c SnapShot or \c Snapshot?
- class SnapShot : protected AlterationNotifier::ObserverBase,
+ ///\warning Snapshots cannot be nested.
+ class Snapshot : protected AlterationNotifier::ObserverBase,
protected AlterationNotifier::ObserverBase
{
protected:
@@ -496,17 +495,17 @@
///Default constructur.
///To actually make a snapshot you must call save().
///
- SnapShot() : g(0) {}
+ Snapshot() : g(0) {}
///Constructor that immediately makes a snapshot.
///This constructor immediately makes a snapshot of the graph.
///\param _g The graph we make a snapshot of.
- SnapShot(ListGraph &_g) {
+ Snapshot(ListGraph &_g) {
regist(_g);
}
///\bug Is it necessary?
///
- ~SnapShot()
+ ~Snapshot()
{
if(g) deregist();
}
@@ -573,7 +572,7 @@
///
///\sa concept::UndirGraph.
///
- ///\todo SnapShot, reverseEdge(), changeTarget(), changeSource(), contract()
+ ///\todo Snapshot, reverseEdge(), changeTarget(), changeSource(), contract()
///haven't been implemented yet.
///
class UndirListGraph : public ExtendedUndirListGraphBase {
diff -r a67ec111236c -r 657de7e5043c lemon/smart_graph.h
--- a/lemon/smart_graph.h Fri Nov 04 16:10:23 2005 +0000
+++ b/lemon/smart_graph.h Fri Nov 04 16:18:51 2005 +0000
@@ -249,11 +249,11 @@
class SmartGraph : public ExtendedSmartGraphBase {
public:
- class SnapShot;
- friend class SnapShot;
+ class Snapshot;
+ friend class Snapshot;
protected:
- void restoreSnapShot(const SnapShot &s)
+ void restoreSnapshot(const Snapshot &s)
{
while(s.edge_numInEdge's and OutEdge's
///may be invalidated.
- ///\warning This functionality cannot be used together with the SnapShot
+ ///\warning This functionality cannot be used together with the Snapshot
///feature.
///\todo It could be implemented in a bit faster way.
Node split(Node n, bool connect = true)
@@ -300,9 +300,9 @@
///restore() function.
///\note After you restore a state, you cannot restore
///a later state, in other word you cannot add again the edges deleted
- ///by restore() using another SnapShot instance.
+ ///by restore() using another Snapshot instance.
///
- class SnapShot
+ class Snapshot
{
SmartGraph *g;
protected:
@@ -315,12 +315,12 @@
///Default constructor.
///To actually make a snapshot you must call save().
///
- SnapShot() : g(0) {}
+ Snapshot() : g(0) {}
///Constructor that immediately makes a snapshot
///This constructor immediately makes a snapshot of the graph.
///\param _g The graph we make a snapshot of.
- SnapShot(SmartGraph &_g) :g(&_g) {
+ Snapshot(SmartGraph &_g) :g(&_g) {
node_num=g->nodes.size();
edge_num=g->edges.size();
}
@@ -351,7 +351,7 @@
void restore()
{
- g->restoreSnapShot(*this);
+ g->restoreSnapshot(*this);
}
};
};
@@ -376,7 +376,7 @@
///the \ref concept::UndirGraph "UndirGraph" concept.
///\sa concept::UndirGraph.
///
- ///\todo SnapShot hasn't been implemented yet.
+ ///\todo Snapshot hasn't been implemented yet.
///
class UndirSmartGraph : public ExtendedUndirSmartGraphBase {
};