Hello community,

here is the log from the commit of package ColPack for openSUSE:Factory checked 
in at 2012-03-27 08:56:15
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ColPack (Old)
 and      /work/SRC/openSUSE:Factory/.ColPack.new (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ColPack", Maintainer is ""

Changes:
--------
New Changes file:

--- /dev/null   2012-03-17 10:42:43.883537212 +0100
+++ /work/SRC/openSUSE:Factory/.ColPack.new/ColPack.changes     2012-03-27 
08:56:17.000000000 +0200
@@ -0,0 +1,9 @@
+-------------------------------------------------------------------
+Mon Mar 26 14:35:20 UTC 2012 - [email protected]
+
+- correct source URL 
+
+-------------------------------------------------------------------
+Thu Mar 22 13:00:33 UTC 2012 - [email protected]
+
+- Create new package for ColPack with version 1.0.6 

New:
----
  ColPack-1.0.6.tar.gz
  ColPack.changes
  ColPack.spec
  baselibs.conf
  colpack-return-in-non-void.patch

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ ColPack.spec ++++++
#
# spec file for package ColPack
#
# Copyright (c) 2012 SUSE LINUX Products GmbH, Nuernberg, Germany.
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
# upon. The license for this file, and modifications and additions to the
# file, is the same license as for the pristine package itself (unless the
# license for the pristine package is not an Open Source License, in which
# case the license is the MIT License). An "Open Source License" is a
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.

# Please submit bugfixes or comments via http://bugs.opensuse.org/
#

Name:           ColPack
%define lname   libColPack0
Version:        1.0.6
Release:        0
Summary:        Graph Coloring Library for C/C++
License:        LGPL-3.0
Group:          Development/Libraries/C and C++
Url:            http://www.cscapes.org/coloringpage/
Source:         
http://www.cscapes.org/download/ColPack/%{name}-%{version}.tar.gz
Source2:        baselibs.conf
Patch1:         colpack-return-in-non-void.patch
BuildRequires:  autoconf
BuildRequires:  automake
BuildRequires:  gcc-c++
BuildRequires:  libstdc++-devel
BuildRequires:  libtool
BuildRoot:      %{_tmppath}/%{name}-%{version}-build

%description  
This package provides algorithms for efficient solution of partitioning
problems occuring in the analysis of sparsity patterns in derivative
computations formulated as Graph Coloring problems.

For details see http://www.cscapes.org/coloringpage/software.htm

%package -n %lname
Summary:        Graph Coloring Library for C/C++
Group:          System/Libraries

%description -n %lname
This package provides algorithms for efficient solution of partitioning
problems occuring in the analysis of sparsity patterns in derivative
computations formulated as Graph Coloring problems.

For details see http://www.cscapes.org/coloringpage/software.htm

%package devel
Summary:        Graph Coloring Library for C/C++ -- development files
Group:          Development/Libraries/C and C++
Requires:       %lname = %{version}

%description devel
This package provides algorithms for efficient solution of partitioning
problems occuring in the analysis of sparsity patterns in derivative
computations formulated as Graph Coloring problems.

For details see http://www.cscapes.org/coloringpage/software.htm

This package provides the development environment for ColPack

%prep
%setup -q -n %{name}-%{version}
%patch1 -p1

%build
autoreconf -v --install --force
%configure --prefix=/usr
make %{_smp_mflags}

%install
%makeinstall
find "%buildroot" -type f -name "*.la" -delete;
find "%buildroot" -type f -name "*.a" -delete;
rm -rf %buildroot%{_builddir}/%{name}-%{version}/progs

%post -n %lname -p /sbin/ldconfig

%postun -n %lname -p /sbin/ldconfig

%files -n %lname
%defattr(-,root,root)
%{_libdir}/libColPack.so.*

%files devel
%defattr(-,root,root)
%dir %{_includedir}/ColPack
%{_includedir}/ColPack/*.h
%{_libdir}/libColPack.so

%changelog
++++++ baselibs.conf ++++++
libColPack0
ColPack-devel
        requires -ColPack-<targettype>
        requires "libColPack0-<targettype> = <version>"
++++++ colpack-return-in-non-void.patch ++++++
diff --git a/GraphColoring/GraphColoring.cpp b/GraphColoring/GraphColoring.cpp
index 02f4c82..0125c72 100755
--- a/GraphColoring/GraphColoring.cpp
+++ b/GraphColoring/GraphColoring.cpp
@@ -675,6 +675,7 @@ namespace ColPack
                        cout<<endl;
                                                
                }
+               return(_TRUE);
        }
        
        int GraphColoring::PrintPotentialHub(map< int, int> 
*PotentialHub_Private, int i_thread_num, pair<int, int> pii_ColorCombination) {
@@ -696,6 +697,7 @@ namespace ColPack
                        cout<<endl;
                                                
                }
+               return(_TRUE);
        }
        
                
@@ -1129,6 +1131,7 @@ namespace ColPack
                        pii_pair.second = mii_iter->second; // if 
pii_pair.second < -1, then mii_iter->first is a leaf and its hub can be 
calculated as [-(pii_pair.second+2)]
                        Vertex2ColorCombination_Private[i_thread_num][ 
mii_iter->first ].push_back(pii_pair);
                }
+               return(_TRUE);
        }
 
        
@@ -1325,6 +1328,7 @@ namespace ColPack
                                if( i_ElementCount >= 
i_MaxElementsOfCombination) break;
                        }
                }
+               return(_TRUE);
        }
        
        int GraphColoring::PrintAllColorCombination(map< pair<int, int>, 
Colors2Edge_Value , lt_pii>* Colors2Edge_Private, int i_MaxNumThreads, int 
i_MaxNumOfCombination, int i_MaxElementsOfCombination) {
@@ -1566,6 +1570,7 @@ namespace ColPack
                for(;mib_itr != D1Colors[i_thread_num].end(); mib_itr++) {
                        cout<<flush<<"\t color "<<mib_itr->first<<"; count 
"<<mib_itr->second<<endl;
                }                                                               
+               return(_TRUE);
        }
        
        int GraphColoring::PrintForbiddenColors(map<int, bool>* 
mip_ForbiddenColors,int i_thread_num) {
@@ -1575,6 +1580,7 @@ namespace ColPack
                        cout<< itr->first<<", ";
                }
                cout<<endl;
+               return(_TRUE);
        }
        
        int GraphColoring::PrintSubGraph(map< int, map<int,bool> > *graph) {
@@ -1588,6 +1594,7 @@ namespace ColPack
                        }
                        cout<<endl;
                }
+               return(_TRUE);
 
        }
        
@@ -1861,6 +1868,7 @@ namespace ColPack
                        }
                        cout<<endl;
                }
+               return(_TRUE);
        }
        
        int GraphColoring::BuildForbiddenColors(int i_MaxNumThreads, int 
i_thread_num, int i_CurrentVertex, map<int, bool>* mip_ForbiddenColors, 
map<int, int>* D1Colors, vector<  map <int, int > > *Vertex2ColorCombination) {
@@ -1937,6 +1945,7 @@ namespace ColPack
                                }
                                
                        }
+                       return(_TRUE);
        }
        
        int GraphColoring::StarColoring_serial2() {
@@ -2275,6 +2284,7 @@ namespace ColPack
                                }
                        }
                }
+               return(_TRUE);
        }
        
        int GraphColoring::PrintVertex2ColorCombination_raw (vector<  map <int, 
int > > *Vertex2ColorCombination) {
@@ -2286,6 +2296,7 @@ namespace ColPack
                                cout<<"\t Vertex2ColorCombination["<< i <<"][] 
"<<mii_iter->second<<" c "<<mii_iter->first<<endl;
                        }
                }
+               return(_TRUE);
        }
        
 
-- 
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to