This is an automated email from the git hooks/post-receive script. gregoa pushed a commit to branch master in repository libgraph-perl.
commit 44b9e2662aace56c0226547d29d533224cb0fbff Merge: aed247b 7d3ba6d Author: Steinar H. Gunderson <se...@debian.org> Date: Mon Apr 3 02:59:06 2006 +0200 Imported Debian patch 1:0.69-1 Changes | 86 ++++++- MANIFEST | 166 ++++++------- META.yml | 2 +- debian/changelog | 10 + debian/compat | 1 + debian/control | 4 +- debian/rules | 1 - lib/Graph.pm | 175 ++++++++++---- lib/Graph.pod | 163 +++++++++---- lib/Graph/AdjacencyMap.pm | 8 +- lib/Graph/AdjacencyMap/Heavy.pm | 3 +- lib/Graph/SPTHeapElem.pm | 4 +- lib/Graph/TransitiveClosure.pm | 8 +- lib/Graph/TransitiveClosure/Matrix.pm | 98 ++++---- t/02_trap.t | 10 + t/{02_derived.t => 03_derived.t} | 0 t/{03_dgraph.t => 04_dgraph.t} | 0 t/{04_ugraph.t => 05_ugraph.t} | 0 t/{05_new.t => 06_new.t} | 0 t/{06_gen.t => 07_gen.t} | 0 t/{07_stringify.t => 08_stringify.t} | 0 t/{08_eq.t => 09_eq.t} | 0 t/{09_has_vertices.t => 10_has_vertices.t} | 0 t/{10_vertices.t => 11_vertices.t} | 0 t/{11_has_vertex.t => 12_has_vertex.t} | 0 t/{12_add_vertex.t => 13_add_vertex.t} | 0 t/{13_delete_vertex.t => 14_delete_vertex.t} | 0 t/{14_has_edges.t => 15_has_edges.t} | 0 t/{15_edges.t => 16_edges.t} | 0 t/{16_has_edge.t => 17_has_edge.t} | 0 t/{17_add_edge.t => 18_add_edge.t} | 0 t/{18_delete_edge.t => 19_delete_edge.t} | 0 t/{19_countvertexed.t => 20_countvertexed.t} | 0 t/{20_multivertexed.t => 21_multivertexed.t} | 0 t/{21_refvertexed.t => 22_refvertexed.t} | 0 t/{22_hypervertexed.t => 23_hypervertexed.t} | 0 t/{23_mixvertexed.t => 24_mixvertexed.t} | 0 t/{24_countedged.t => 25_countedged.t} | 0 t/{25_multiedged.t => 26_multiedged.t} | 0 t/{26_omnidirected.t => 27_omnidirected.t} | 0 t/{27_hyperedged.t => 28_hyperedged.t} | 0 t/{28_uniqedged.t => 29_uniqedged.t} | 0 t/{29_mixedged.t => 30_mixedged.t} | 0 t/{30_hypervertex.t => 31_hypervertex.t} | 0 ..._hypervertex_edges.t => 32_hypervertex_edges.t} | 0 t/{32_hyperedge.t => 33_hyperedge.t} | 0 t/{33_omnivertexed.t => 34_omnivertexed.t} | 0 t/{34_uniqvertexed.t => 35_uniqvertexed.t} | 0 t/{35_omniuniqvertexed.t => 36_omniuniqvertexed.t} | 0 ...vertex_implicit.t => 37_hypervertex_implicit.t} | 0 t/{37_vertices_at.t => 38_vertices_at.t} | 0 t/{38_edges_at.t => 39_edges_at.t} | 0 t/{39_edges_from.t => 40_edges_from.t} | 0 t/{40_edges_to.t => 41_edges_to.t} | 0 t/{41_add_path.t => 42_add_path.t} | 0 t/{42_has_path.t => 43_has_path.t} | 0 t/{43_delete_path.t => 44_delete_path.t} | 0 t/{44_add_cycle.t => 45_add_cycle.t} | 0 t/{45_has_cycle.t => 46_has_cycle.t} | 0 t/{46_delete_cycle.t => 47_delete_cycle.t} | 0 t/{47_get_vertex_count.t => 48_get_vertex_count.t} | 0 t/{48_get_edge_count.t => 49_get_edge_count.t} | 0 ..._vertex_attributes.t => 50_vertex_attributes.t} | 0 ...ex_attributes.t => 51_multivertex_attributes.t} | 0 t/{51_edge_attributes.t => 52_edge_attributes.t} | 0 ...edge_attributes.t => 53_multiedge_attributes.t} | 0 t/{53_graph_attributes.t => 54_graph_attributes.t} | 0 t/{54_attributes.t => 55_attributes.t} | 0 t/{55_neighbourhood.t => 56_neighbourhood.t} | 0 t/{56_degree.t => 57_degree.t} | 0 t/{57_connections.t => 58_connections.t} | 0 t/{58_dfs.t => 59_dfs.t} | 0 t/{59_bfs.t => 60_bfs.t} | 0 t/{60_connected.t => 61_connected.t} | 10 +- t/{61_bcc.t => 62_bcc.t} | 10 +- t/{62_scc.t => 63_scc.t} | 18 +- t/{63_mst.t => 64_mst.t} | 0 t/{64_ref.t => 65_ref.t} | 4 +- t/{65_simple.t => 66_simple.t} | 0 t/{66_copy.t => 67_copy.t} | 0 t/{67_transpose.t => 68_transpose.t} | 0 t/{68_complete.t => 69_complete.t} | 0 t/{69_complement.t => 70_complement.t} | 0 t/70_spt.t | 136 ----------- t/71_spt.t | 258 +++++++++++++++++++++ t/{71_transitive.t => 72_transitive.t} | 0 t/{72_diameter.t => 73_diameter.t} | 0 t/{73_random.t => 74_random.t} | 0 t/{74_attribute_array.t => 75_attribute_array.t} | 0 t/{75_attribute_hash.t => 76_attribute_hash.t} | 0 t/{76_adjacency.t => 77_adjacency.t} | 0 t/{77_expect.t => 78_expect.t} | 0 t/{78_unionfind.t => 79_unionfind.t} | 0 t/{79_isomorphic.t => 80_isomorphic.t} | 0 t/{80_dump.t => 81_dump.t} | 0 t/{81_cycle.t => 82_cycle.t} | 0 t/{82_bitmatrix.t => 83_bitmatrix.t} | 0 t/u_re_sd.t | 43 ++++ t/u_te_ae.t | 103 ++++++++ t/u_te_me.t | 32 +++ 100 files changed, 982 insertions(+), 371 deletions(-) diff --cc debian/changelog index 4600dae,0000000..bd69f39 mode 100644,000000..100644 --- a/debian/changelog +++ b/debian/changelog @@@ -1,28 -1,0 +1,38 @@@ ++libgraph-perl (1:0.69-1) unstable; urgency=low ++ ++ * New upstream release. ++ * Switch from debhelper v3 to v5 (no changes needed), and use debian/compat ++ instead of setting DH_COMPAT in debian/rules. Update versioned ++ build-dependency accordingly. ++ * Update to Standards-Version 3.6.2.0 (no changes needed). ++ ++ -- Steinar H. Gunderson <se...@debian.org> Mon, 3 Apr 2006 02:59:06 +0200 ++ +libgraph-perl (1:0.65-2) unstable; urgency=low + + * New maintainer. Thanks to Matt Hope for maintaining the package up till + now. + * Ack my own NMU. (Closes: #299861). + * Make long and short description more descriptive. (Closes: #317658) + + -- Steinar H. Gunderson <se...@debian.org> Sun, 17 Jul 2005 10:08:13 +0200 + +libgraph-perl (1:0.65-1) unstable; urgency=low + + * Non-Maintainer Upload. + * New upstream release (Closes: #299861). + + -- Steinar H. Gunderson <se...@debian.org> Sun, 10 Jul 2005 15:11:49 +0200 + +libgraph-perl (0.20102-1) unstable; urgency=low + + * New upstream release + + -- Matt Hope <do...@debian.org> Tue, 13 Apr 2004 00:08:18 +1000 + +libgraph-perl (0.20101-1) unstable; urgency=low + + * Initial Package + + -- Matt Hope <do...@debian.org> Sat, 12 Apr 2003 20:26:03 +1000 + diff --cc debian/compat index 0000000,0000000..7ed6ff8 new file mode 100644 --- /dev/null +++ b/debian/compat @@@ -1,0 -1,0 +1,1 @@@ ++5 diff --cc debian/control index d1692a9,0000000..05544fa mode 100644,000000..100644 --- a/debian/control +++ b/debian/control @@@ -1,19 -1,0 +1,19 @@@ +Source: libgraph-perl +Section: perl +Priority: optional - Build-Depends-Indep: debhelper (>= 3.0.5), perl (>= 5.6.0) ++Build-Depends-Indep: debhelper (>= 5.0.0), perl (>= 5.6.0) +Maintainer: Steinar H. Gunderson <se...@debian.org> - Standards-Version: 3.6.1 ++Standards-Version: 3.6.2.0 + +Package: libgraph-perl +Architecture: all +Depends: libheap-perl, ${perl:Depends} +Description: Perl module for graph data structures and algorithms + This module contains the Graph module for Perl, a framework for + creating abstract data structures called graphs and hypergraphs. + (It is not for drawing any sort of graphics; for that, see the + GD:: or Graphics:: set of modules.) It also contains implementations + of several well-known algorithms that operate on graphs, such as + finding transitive closures, strongly connected components + (SCCs) and articulation points. + diff --cc debian/rules index a8aad4d,0000000..2fde11a mode 100755,000000..100755 --- a/debian/rules +++ b/debian/rules @@@ -1,52 -1,0 +1,51 @@@ +#!/usr/bin/make -f + +#export DH_VERBOSE=1 - export DH_COMPAT=3 + +PACKAGE=$(shell dh_listpackages) + +ifndef PERL +PERL=/usr/bin/perl +endif + +TMP =$(CURDIR)/debian/$(PACKAGE) + +build: Makefile +Makefile: + dh_testdir + $(PERL) Makefile.PL INSTALLDIRS=vendor + $(MAKE) OPTIMIZE="-O2 -g -Wall" + +clean: + dh_testdir + dh_testroot + rm -f build-stamp + -$(MAKE) realclean + dh_clean + +install: + dh_testdir + dh_testroot + dh_clean -k + dh_installdirs + + $(MAKE) install PREFIX=$(TMP)/usr + + +binary-arch: + +binary-indep: build install + dh_testdir + dh_testroot + dh_installdocs README + dh_installchangelogs Changes + dh_compress + dh_fixperms + dh_installdeb + dh_perl + dh_gencontrol + dh_md5sums + dh_builddeb + +binary: binary-indep binary-arch +.PHONY: build clean binary-indep binary-arch binary -- Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libgraph-perl.git _______________________________________________ Pkg-perl-cvs-commits mailing list Pkg-perl-cvs-commits@lists.alioth.debian.org http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits