[Lemon-commits] Alpar Juttner: Apply unify-sources.sh to the sou...
Lemon HG
hg at lemon.cs.elte.hu
Fri Aug 9 14:28:21 CEST 2013
details: http://lemon.cs.elte.hu/hg/lemon/rev/dceba191c00d
changeset: 1270:dceba191c00d
user: Alpar Juttner <alpar [at] cs.elte.hu>
date: Fri Aug 09 11:28:17 2013 +0200
description:
Apply unify-sources.sh to the source tree
diffstat:
doc/coding_style.dox | 2 +-
doc/dirs.dox | 2 +-
doc/groups.dox | 6 +-
doc/lgf.dox | 2 +-
doc/min_cost_flow.dox | 2 +-
lemon/adaptors.h | 2 +-
lemon/assert.h | 2 +-
lemon/base.cc | 2 +-
lemon/bellman_ford.h | 2 +-
lemon/bfs.h | 2 +-
lemon/bin_heap.h | 2 +-
lemon/bits/alteration_notifier.h | 2 +-
lemon/bits/array_map.h | 2 +-
lemon/bits/bezier.h | 2 +-
lemon/bits/default_map.h | 2 +-
lemon/bits/edge_set_extender.h | 2 +-
lemon/bits/graph_adaptor_extender.h | 2 +-
lemon/bits/graph_extender.h | 4 +-
lemon/bits/lock.h | 12 +-
lemon/bits/map_extender.h | 2 +-
lemon/bits/path_dump.h | 2 +-
lemon/bits/solver_bits.h | 2 +-
lemon/bits/traits.h | 2 +-
lemon/bits/windows.cc | 4 +-
lemon/bits/windows.h | 2 +-
lemon/capacity_scaling.h | 4 +-
lemon/cbc.cc | 2 +-
lemon/cbc.h | 2 +-
lemon/christofides_tsp.h | 30 +-
lemon/circulation.h | 2 +-
lemon/clp.cc | 2 +-
lemon/clp.h | 2 +-
lemon/concept_check.h | 2 +-
lemon/concepts/bpgraph.h | 6 +-
lemon/concepts/digraph.h | 2 +-
lemon/concepts/graph.h | 2 +-
lemon/concepts/graph_components.h | 10 +-
lemon/concepts/heap.h | 2 +-
lemon/concepts/maps.h | 2 +-
lemon/concepts/path.h | 2 +-
lemon/connectivity.h | 2 +-
lemon/core.h | 24 +-
lemon/cost_scaling.h | 4 +-
lemon/cplex.cc | 2 +-
lemon/cplex.h | 2 +-
lemon/cycle_canceling.h | 8 +-
lemon/dfs.h | 2 +-
lemon/dijkstra.h | 2 +-
lemon/dimacs.h | 2 +-
lemon/edge_set.h | 2 +-
lemon/edmonds_karp.h | 186 +++++++++++-----------
lemon/euler.h | 2 +-
lemon/fractional_matching.h | 2 +-
lemon/full_graph.h | 10 +-
lemon/glpk.cc | 2 +-
lemon/glpk.h | 4 +-
lemon/gomory_hu.h | 2 +-
lemon/graph_to_eps.h | 2 +-
lemon/greedy_tsp.h | 6 +-
lemon/grosso_locatelli_pullan_mc.h | 38 ++--
lemon/hao_orlin.h | 2 +-
lemon/hartmann_orlin_mmc.h | 2 +-
lemon/howard_mmc.h | 12 +-
lemon/insertion_tsp.h | 12 +-
lemon/karp_mmc.h | 2 +-
lemon/kruskal.h | 2 +-
lemon/lgf_reader.h | 4 +-
lemon/lgf_writer.h | 4 +-
lemon/list_graph.h | 4 +-
lemon/lp.h | 2 +-
lemon/lp_base.cc | 2 +-
lemon/lp_base.h | 6 +-
lemon/lp_skeleton.cc | 2 +-
lemon/lp_skeleton.h | 2 +-
lemon/maps.h | 2 +-
lemon/matching.h | 2 +-
lemon/math.h | 2 +-
lemon/max_cardinality_search.h | 292 ++++++++++++++++++------------------
lemon/min_cost_arborescence.h | 2 +-
lemon/nagamochi_ibaraki.h | 30 +-
lemon/nearest_neighbor_tsp.h | 2 +-
lemon/network_simplex.h | 4 +-
lemon/opt2_tsp.h | 2 +-
lemon/path.h | 2 +-
lemon/planarity.h | 2 +-
lemon/preflow.h | 8 +-
lemon/radix_sort.h | 2 +-
lemon/smart_graph.h | 4 +-
lemon/soplex.cc | 2 +-
lemon/soplex.h | 2 +-
lemon/suurballe.h | 2 +-
lemon/time_measure.h | 8 +-
lemon/unionfind.h | 2 +-
test/adaptors_test.cc | 2 +-
test/arc_look_up_test.cc | 12 +-
test/bellman_ford_test.cc | 2 +-
test/bfs_test.cc | 2 +-
test/bpgraph_test.cc | 8 +-
test/circulation_test.cc | 2 +-
test/connectivity_test.cc | 2 +-
test/dfs_test.cc | 4 +-
test/digraph_test.cc | 2 +-
test/dijkstra_test.cc | 2 +-
test/edge_set_test.cc | 2 +-
test/euler_test.cc | 4 +-
test/fractional_matching_test.cc | 2 +-
test/gomory_hu_test.cc | 2 +-
test/graph_copy_test.cc | 12 +-
test/graph_test.cc | 2 +-
test/graph_test.h | 2 +-
test/hao_orlin_test.cc | 2 +-
test/heap_test.cc | 2 +-
test/lgf_reader_writer_test.cc | 6 +-
test/lgf_test.cc | 14 +-
test/lp_test.cc | 2 +-
test/maps_test.cc | 2 +-
test/matching_test.cc | 2 +-
test/max_cardinality_search_test.cc | 6 +-
test/max_clique_test.cc | 18 +-
test/max_flow_test.cc | 8 +-
test/min_cost_arborescence_test.cc | 2 +-
test/min_cost_flow_test.cc | 2 +-
test/min_mean_cycle_test.cc | 4 +-
test/nagamochi_ibaraki_test.cc | 2 +-
test/path_test.cc | 2 +-
test/radix_sort_test.cc | 4 +-
test/suurballe_test.cc | 2 +-
test/time_measure_test.cc | 2 +-
test/tsp_test.cc | 24 +-
tools/dimacs-solver.cc | 2 +-
130 files changed, 523 insertions(+), 523 deletions(-)
diffs (truncated from 3856 to 300 lines):
diff --git a/doc/coding_style.dox b/doc/coding_style.dox
--- a/doc/coding_style.dox
+++ b/doc/coding_style.dox
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/doc/dirs.dox b/doc/dirs.dox
--- a/doc/dirs.dox
+++ b/doc/dirs.dox
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/doc/groups.dox b/doc/groups.dox
--- a/doc/groups.dox
+++ b/doc/groups.dox
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
@@ -429,7 +429,7 @@
which is capable of handling real-valued arc costs (other numerical
data are required to be integer).
-For more details about these implementations and for a comprehensive
+For more details about these implementations and for a comprehensive
experimental study, see the paper \cite KiralyKovacs12MCF.
It also compares these codes to other publicly available
minimum cost flow solvers.
@@ -570,7 +570,7 @@
\image html planar.png
\image latex planar.eps "Plane graph" width=\textwidth
*/
-
+
/**
@defgroup tsp Traveling Salesman Problem
@ingroup algs
diff --git a/doc/lgf.dox b/doc/lgf.dox
--- a/doc/lgf.dox
+++ b/doc/lgf.dox
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/doc/min_cost_flow.dox b/doc/min_cost_flow.dox
--- a/doc/min_cost_flow.dox
+++ b/doc/min_cost_flow.dox
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/adaptors.h b/lemon/adaptors.h
--- a/lemon/adaptors.h
+++ b/lemon/adaptors.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/assert.h b/lemon/assert.h
--- a/lemon/assert.h
+++ b/lemon/assert.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/base.cc b/lemon/base.cc
--- a/lemon/base.cc
+++ b/lemon/base.cc
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bellman_ford.h b/lemon/bellman_ford.h
--- a/lemon/bellman_ford.h
+++ b/lemon/bellman_ford.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bfs.h b/lemon/bfs.h
--- a/lemon/bfs.h
+++ b/lemon/bfs.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bin_heap.h b/lemon/bin_heap.h
--- a/lemon/bin_heap.h
+++ b/lemon/bin_heap.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/alteration_notifier.h b/lemon/bits/alteration_notifier.h
--- a/lemon/bits/alteration_notifier.h
+++ b/lemon/bits/alteration_notifier.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/array_map.h b/lemon/bits/array_map.h
--- a/lemon/bits/array_map.h
+++ b/lemon/bits/array_map.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/bezier.h b/lemon/bits/bezier.h
--- a/lemon/bits/bezier.h
+++ b/lemon/bits/bezier.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/default_map.h b/lemon/bits/default_map.h
--- a/lemon/bits/default_map.h
+++ b/lemon/bits/default_map.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/edge_set_extender.h b/lemon/bits/edge_set_extender.h
--- a/lemon/bits/edge_set_extender.h
+++ b/lemon/bits/edge_set_extender.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/graph_adaptor_extender.h b/lemon/bits/graph_adaptor_extender.h
--- a/lemon/bits/graph_adaptor_extender.h
+++ b/lemon/bits/graph_adaptor_extender.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/graph_extender.h b/lemon/bits/graph_extender.h
--- a/lemon/bits/graph_extender.h
+++ b/lemon/bits/graph_extender.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
@@ -843,7 +843,7 @@
// Alterable extension
typedef AlterationNotifier<BpGraphExtender, Node> NodeNotifier;
- typedef AlterationNotifier<BpGraphExtender, RedNode> RedNodeNotifier;
+ typedef AlterationNotifier<BpGraphExtender, RedNode> RedNodeNotifier;
typedef AlterationNotifier<BpGraphExtender, BlueNode> BlueNodeNotifier;
typedef AlterationNotifier<BpGraphExtender, Arc> ArcNotifier;
typedef AlterationNotifier<BpGraphExtender, Edge> EdgeNotifier;
diff --git a/lemon/bits/lock.h b/lemon/bits/lock.h
--- a/lemon/bits/lock.h
+++ b/lemon/bits/lock.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2012
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
@@ -33,16 +33,16 @@
class Lock {
public:
Lock() {
- pthread_mutex_init(&_lock, 0);
+ pthread_mutex_init(&_lock, 0);
}
~Lock() {
- pthread_mutex_destroy(&_lock);
+ pthread_mutex_destroy(&_lock);
}
void lock() {
- pthread_mutex_lock(&_lock);
+ pthread_mutex_lock(&_lock);
}
void unlock() {
- pthread_mutex_unlock(&_lock);
+ pthread_mutex_unlock(&_lock);
}
private:
@@ -57,7 +57,7 @@
~Lock() {}
void lock() {}
void unlock() {}
- };
+ };
#endif
}
}
diff --git a/lemon/bits/map_extender.h b/lemon/bits/map_extender.h
--- a/lemon/bits/map_extender.h
+++ b/lemon/bits/map_extender.h
@@ -2,7 +2,7 @@
*
* This file is a part of LEMON, a generic C++ optimization library.
*
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
diff --git a/lemon/bits/path_dump.h b/lemon/bits/path_dump.h
--- a/lemon/bits/path_dump.h
+++ b/lemon/bits/path_dump.h
More information about the Lemon-commits
mailing list