debian/0000775000000000000000000000000012302724527007174 5ustar debian/rules0000775000000000000000000000516712302724460010261 0ustar #!/usr/bin/make -f BUILDDIR = $(CURDIR)/debian/build PYVERS := $(shell pyversions -vr debian/control) # The directories below are versioned. We only support the packages for the # stable version of Octave mpath = $(shell octave-config -p LOCALFCNFILEDIR) bpath = $(shell octave-config -p LOCALOCTFILEDIR) %: dh $@ --buildsystem=autoconf --builddirectory=$(BUILDDIR) --with python2 override_dh_auto_reconf: [ -e bin/scripts ] || mkdir -p bin/scripts cp -f /usr/share/misc/config.guess /usr/share/misc/config.sub bin/scripts libtoolize --force --automake aclocal -Im4 autoreconf -i automake override_dh_auto_configure: override_dh_auto_reconf for v in $(PYVERS); do \ dh_auto_configure --builddirectory=$(BUILDDIR)$$v \ -- $(extra_flags) \ --prefix=/usr \ --srcdir=$(CURDIR) \ --enable-shared \ PYTHON=/usr/bin/python$$v \ OCT_INSTALL_DIR=$(bpath) M_INSTALL_DIR=$(mpath) \ GUILE=guile GUILE_CONFIG=guile-config; \ done override_dh_auto_build: for v in $(PYVERS); do \ dh_auto_build --builddirectory=$(BUILDDIR)$$v; \ done override_dh_clean: dh_clean --exclude='*.orig' for v in $(PYVERS); do \ rm -rf $(BUILDDIR)$$v; \ done override_dh_auto_build: # to prevent bug in install due to build-%/config.status being deleted after build target is done mkdir -p $(CURDIR)/debian/tmp for v in $(PYVERS); do \ dh_auto_build --builddirectory=$(BUILDDIR)$$v; \ done override_dh_strip: dh_strip find debian/octave-nlopt/usr/lib -name *.oct | \ xargs strip --strip-unneeded --remove-section=.comment override_dh_makeshlibs: dh_makeshlibs $(shell for v in $(PYVERS); do printf -- "-X/usr/lib/python$$v/dist-packages "; done) override_dh_shlibdeps: dh_shlibdeps -- \ debian/libnlopt0/usr/lib/*/libnlopt.so.* \ -Tdebian/libnlopt0.substvars dh_shlibdeps -- \ debian/libnlopt-guile0/usr/lib/*/libnlopt_guile.so.* \ -Tdebian/libnlopt-guile0.substvars dh_shlibdeps -- \ debian/octave-nlopt/usr/lib/*/octave/site/oct/*/*.oct \ -Tdebian/octave-nlopt.substvars dh_shlibdeps -- \ debian/python-nlopt/usr/lib/python*/dist-packages/*.so* \ -Tdebian/python-nlopt.substvars override_dh_auto_install: for v in $(PYVERS); do \ dh_auto_install --builddirectory=$(BUILDDIR)$$v; \ done dh_numpy find debian/tmp/usr/lib/python* \ -name '*.pyc' -o -name '*.pyo' \ -o -name '*.la' -o -name '*.a' | xargs rm override_dh_link: for package in libnlopt-dev libnlopt-guile0 octave-nlopt python-nlopt; do \ rm -rf debian/$$package/usr/share/doc/$$package; \ done dh_link override_dh_auto_test: for v in $(PYVERS); do \ dh_auto_test --builddirectory=$(BUILDDIR)$$v \ -- $(extra_flags); \ done debian/watch0000664000000000000000000000022512227441307010222 0ustar version=3 opts=dversionmangle=s/\+dfsg$// \ http://ab-initio.mit.edu/wiki/index.php/NLopt .*/nlopt-(.*)\.tar\.gz \ debian debian/orig-tar.sh debian/octave-nlopt.install0000664000000000000000000000004212227441307013171 0ustar usr/share/octave usr/lib/*/octave debian/copyright0000664000000000000000000002100512227441307011123 0ustar Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: NLopt Upstream-Contact: Steven G. Johnson Source: http://ab-initio.mit.edu/wiki/index.php/NLopt Files: * Copyright: 2007-2011 Massachusetts Institute of Technology License: MIT Comment: NLopt combines several free/open-source nonlinear optimization libraries by various authors. See the COPYING, COPYRIGHT, and README files in the subdirectories for the original copyright and licensing information of these packages. . The compiled NLopt library, i.e. the combined work of all of the included optimization routines, is licensed under the conjunction of all of these licensing terms. Currently, the most restrictive terms are for the code in the "luksan" directory, which is licensed under the GNU Lesser General Public License (GNU LGPL), version 2.1 or later (see luksan/COPYRIGHT). . That means that the compiled NLopt library is governed by the terms of the LGPL. Other portions of NLopt, including any modifications to the abovementioned packages, are licensed under the standard "MIT License". Files: bobyqa/* Copyright: 2009 M. J. D. Powell 2010 Massachusetts Institute of Technology License: MIT Files: cobyla/* Copyright: 1992, Michael J. D. Powell 2004, Jean-Sebastien Roy 2008, Steven G. Johnson License: MIT Files: luksan/* Copyright: Ladislav Luksan, 2007. Many of sparse matrix modules were prepared by Miroslav Tuma. License: LGPL-2.1+ Files: newuoa/* Copyright: 2004 M. J. D. Powell 2007-2011 Massachusetts Institute of Technology License: MIT Files: slsqp/* Copyright: 1988 Dieter Kraft 1994 Association for Computing Machinery 2001, 2002 Enthought, Inc. 2003-2009 SciPy Developers. 2010 Massachusetts Institute of Technology. License: BSD-3-clause Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: . a. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. b. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. c. Neither the name of the Enthought nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. . THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Comment: C http://permalink.gmane.org/gmane.comp.python.scientific.devel/6725 C ------ C From: Deborah Cotton C Date: Fri, 14 Sep 2007 12:35:55 -0500 C Subject: RE: Algorithm License requested C To: Alan Isaac C C Prof. Issac, C C In that case, then because the author consents to [the ACM] releasing C the code currently archived at http://www.netlib.org/toms/733 under the C BSD license, the ACM hereby releases this code under the BSD license. C C Regards, C C Deborah Cotton, Copyright & Permissions C ACM Publications C 2 Penn Plaza, Suite 701** C New York, NY 10121-0701 C permissions@acm.org C 212.869.7440 ext. 652 C Fax. 212.869.0481 C ------ Files: stogo/* Copyright: 1998 by S. Zertchaninov and K. Madsen. License: MIT Comment: ---------------------------------------------------------------------- . The StoGO source code on the authors' web site has no copyright or license information, but I (Steven G. Johnson) contacted the author K. Madsen for clarification and he gave me permission to distribute it under the MIT license above. See the correspondence below: . ---------------------------------------------------------------------- Date: Fri, 24 Aug 2007 10:46:09 +0200 From: Kaj Madsen To: stevenj@math.mit.edu Subject: RE: open source license for StoGO software? . The MIT licence is ok with me, and so is your copyright suggestion. . Kaj Madsen. . -----Original Message----- From: Steven G. Johnson [mailto:stevenj@fftw.org] Sent: 23. august 2007 22:23 To: Kaj Madsen Subject: RE: open source license for StoGO software? . On Thu, 23 Aug 2007, Kaj Madsen wrote: > Many thanks for your mail. You can definitely consider the software as > open source, please use it as you like, however please refer to us if > you publish results based on the software. > > I am now in a heavy administrative position as a Head of Department > (has been since 1998, therefore I never really followed up on this). > The paper was never published, however I am attaching two fdf-files, > one with the paper, one with some descriptions of the code. I hope > this makes sense, otherwise please don't hesitate to contact me again. . Thanks so much for your response! . To be open source it needs some specific open-source license to specify the permissions in legal terms. The simplest open-source license is probably the MIT license, is this okay? . http://opensource.org/licenses/mit-license.php . Also, I need to know who the authors are for the copyright statement. Should I list it as: Copyright (c) 1998 by S. Zertchaninov and K. Madsen ? . Thanks again! I will definitely cite it if I publish any results based on StoGO! (It's one of the few public global-optimization programs that is able to exploit gradient information.) . Regards, Steven G. Johnson License: LGPL-2.1+ This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. . This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. . You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA . On Debian GNU/Linux systems, the complete text of the GNU General Public License (GPL) version 2.1 can be found at /usr/share/common-licenses/LGPL-2.1. License: MIT Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: . The above copyright notice and this permission notice shall be ncluded in all copies or substantial portions of the Software. . THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Files: debian/* Copyright: 2011-2012, Christophe Trophime 2012, Sergey B Kirpichev License: GPL-3+ On Debian GNU/Linux systems, the complete text of the GNU General Public License (GPL) version 3 can be found at /usr/share/common-licenses/GPL-3. debian/README.source0000664000000000000000000000023012227441307011344 0ustar nlopt for Debian ---------------- ./luksan/v999-07.pdf ./stogo/paper.pdf ./stogo/techreport.pdf ./direct/userguide.pdf have been removed from sources debian/libnlopt0.shlibs0000664000000000000000000000004012227441307012275 0ustar libnlopt 0 libnlopt0 (>= 2.2.4) debian/libnlopt0.symbols0000664000000000000000000003104512247573320012515 0ustar libnlopt.so.0 libnlopt0 #MINVER# * Build-Depends-Package: libnlopt-dev NLOGLS@Base 2.2.4 NLOGSP@Base 2.2.4 NLOPTC@Base 2.2.4 NLOPTM@Base 2.2.4 NLOPTV@Base 2.2.4 NLOSLS@Base 2.2.4 NLOSR@Base 2.2.4 NLOSRT@Base 2.2.4 NLOSSP@Base 2.2.4 NLO_ADD_EQUALITY_CONSTRAINT@Base 2.2.4 NLO_ADD_EQUALITY_MCONSTRAINT@Base 2.2.4 NLO_ADD_INEQUALITY_CONSTRAINT@Base 2.2.4 NLO_ADD_INEQUALITY_MCONSTRAINT@Base 2.2.4 NLO_COPY@Base 2.2.4 NLO_CREATE@Base 2.2.4 NLO_DESTROY@Base 2.2.4 NLO_FORCE_STOP@Base 2.2.4 NLO_GET_ALGORITHM@Base 2.2.4 NLO_GET_DIMENSION@Base 2.2.4 NLO_GET_FORCE_STOP@Base 2.2.4 NLO_GET_FTOL_ABS@Base 2.2.4 NLO_GET_FTOL_REL@Base 2.2.4 NLO_GET_INITIAL_STEP@Base 2.2.4 NLO_GET_LOWER_BOUNDS@Base 2.2.4 NLO_GET_MAXEVAL@Base 2.2.4 NLO_GET_MAXTIME@Base 2.2.4 NLO_GET_POPULATION@Base 2.2.4 NLO_GET_STOPVAL@Base 2.2.4 NLO_GET_UPPER_BOUNDS@Base 2.2.4 NLO_GET_XTOL_ABS@Base 2.2.4 NLO_GET_XTOL_REL@Base 2.2.4 NLO_GET_vector_storage@Base 2.2.4 NLO_OPTIMIZE@Base 2.2.4 NLO_REMOVE_EQUALITY_CONSTRAINTS@Base 2.2.4 NLO_REMOVE_INEQUALITY_CONSTRAINTS@Base 2.2.4 NLO_SET_DEFAULT_INITIAL_STEP@Base 2.2.4 NLO_SET_FORCE_STOP@Base 2.2.4 NLO_SET_FTOL_ABS@Base 2.2.4 NLO_SET_FTOL_REL@Base 2.2.4 NLO_SET_INITIAL_STEP1@Base 2.2.4 NLO_SET_INITIAL_STEP@Base 2.2.4 NLO_SET_LOCAL_OPTIMIZER@Base 2.2.4 NLO_SET_LOWER_BOUNDS1@Base 2.2.4 NLO_SET_LOWER_BOUNDS@Base 2.2.4 NLO_SET_MAXEVAL@Base 2.2.4 NLO_SET_MAXTIME@Base 2.2.4 NLO_SET_MAX_OBJECTIVE@Base 2.2.4 NLO_SET_MIN_OBJECTIVE@Base 2.2.4 NLO_SET_POPULATION@Base 2.2.4 NLO_SET_STOPVAL@Base 2.2.4 NLO_SET_UPPER_BOUNDS1@Base 2.2.4 NLO_SET_UPPER_BOUNDS@Base 2.2.4 NLO_SET_XTOL_ABS1@Base 2.2.4 NLO_SET_XTOL_ABS@Base 2.2.4 NLO_SET_XTOL_REL@Base 2.2.4 NLO_SET_vector_storage@Base 2.2.4 auglag_minimize@Base 2.2.4 auglag_verbose@Base 2.2.4 bobyqa@Base 2.2.4 ccsa_quadratic_minimize@Base 2.3 ccsa_verbose@Base 2.3 cdirect@Base 2.2.4 cdirect_hybrid@Base 2.2.4 cdirect_hybrid_unscaled@Base 2.2.4 cdirect_hyperrect_compare@Base 2.2.4 cdirect_uf@Base 2.2.4 cdirect_unscaled@Base 2.2.4 chevolutionarystrategy@Base 2.4 cobyla@Base 2.2.4 cobyla_minimize@Base 2.2.4 crs_minimize@Base 2.2.4 direct_dirchoose_@Base 2.2.4 direct_dirdivide_@Base 2.2.4 direct_dirdoubleinsert_@Base 2.2.4 direct_direct_@Base 2.2.4 direct_dirget_i__@Base 2.2.4 direct_dirgetlevel_@Base 2.2.4 direct_dirgetmaxdeep_@Base 2.2.4 direct_dirheader_@Base 2.2.4 direct_dirinfcn_@Base 2.2.4 direct_dirinit_@Base 2.2.4 direct_dirinitlist_@Base 2.2.4 direct_dirinsertlist_@Base 2.2.4 direct_dirpreprc_@Base 2.2.4 direct_dirreplaceinf_@Base 2.2.4 direct_dirsamplef_@Base 2.2.4 direct_dirsamplepoints_@Base 2.2.4 direct_dirsummary_@Base 2.2.4 direct_optimize@Base 2.2.4 isres_minimize@Base 2.2.4 luksan_mxdcmd__@Base 2.2.4 luksan_mxdcmu__@Base 2.2.4 luksan_mxdcmv__@Base 2.2.4 luksan_mxdrcb__@Base 2.2.4 luksan_mxdrcf__@Base 2.2.4 luksan_mxdrmm__@Base 2.2.4 luksan_mxdrsu__@Base 2.2.4 luksan_mxucop__@Base 2.2.4 luksan_mxudir__@Base 2.2.4 luksan_mxudot__@Base 2.2.4 luksan_mxuneg__@Base 2.2.4 luksan_mxuzer__@Base 2.2.4 luksan_mxvcop__@Base 2.2.4 luksan_mxvdif__@Base 2.2.4 luksan_mxvdir__@Base 2.2.4 luksan_mxvdot__@Base 2.2.4 luksan_mxvine__@Base 2.2.4 luksan_mxvlin__@Base 2.2.4 luksan_mxvmax__@Base 2.2.4 luksan_mxvneg__@Base 2.2.4 luksan_mxvsav__@Base 2.2.4 luksan_mxvscl__@Base 2.2.4 luksan_mxvset__@Base 2.2.4 luksan_pcbs04__@Base 2.2.4 luksan_plip@Base 2.2.4 luksan_plis@Base 2.2.4 luksan_pnet@Base 2.2.4 luksan_pnint1__@Base 2.2.4 luksan_ps1l01__@Base 2.2.4 luksan_pulsp3__@Base 2.2.4 luksan_pulvp3__@Base 2.2.4 luksan_pyadc0__@Base 2.2.4 luksan_pyfut1__@Base 2.2.4 luksan_pyrmc0__@Base 2.2.4 luksan_pytrcd__@Base 2.2.4 luksan_pytrcg__@Base 2.2.4 luksan_pytrcs__@Base 2.2.4 mlsl_minimize@Base 2.2.4 mma_minimize@Base 2.2.4 mma_verbose@Base 2.2.4 newuoa@Base 2.2.4 nil@Base 2.2.4 nldrmd_minimize@Base 2.2.4 nldrmd_minimize_@Base 2.2.4 nlo_add_equality_constraint@Base 2.2.4 nlo_add_equality_constraint_@Base 2.2.4 nlo_add_equality_constraint__@Base 2.2.4 nlo_add_equality_mconstraint@Base 2.2.4 nlo_add_equality_mconstraint_@Base 2.2.4 nlo_add_equality_mconstraint__@Base 2.2.4 nlo_add_inequality_constraint@Base 2.2.4 nlo_add_inequality_constraint_@Base 2.2.4 nlo_add_inequality_constraint__@Base 2.2.4 nlo_add_inequality_mconstraint@Base 2.2.4 nlo_add_inequality_mconstraint_@Base 2.2.4 nlo_add_inequality_mconstraint__@Base 2.2.4 nlo_copy@Base 2.2.4 nlo_copy_@Base 2.2.4 nlo_copy__@Base 2.2.4 nlo_create@Base 2.2.4 nlo_create_@Base 2.2.4 nlo_create__@Base 2.2.4 nlo_destroy@Base 2.2.4 nlo_destroy_@Base 2.2.4 nlo_destroy__@Base 2.2.4 nlo_force_stop@Base 2.2.4 nlo_force_stop_@Base 2.2.4 nlo_force_stop__@Base 2.2.4 nlo_get_algorithm@Base 2.2.4 nlo_get_algorithm_@Base 2.2.4 nlo_get_algorithm__@Base 2.2.4 nlo_get_dimension@Base 2.2.4 nlo_get_dimension_@Base 2.2.4 nlo_get_dimension__@Base 2.2.4 nlo_get_force_stop@Base 2.2.4 nlo_get_force_stop_@Base 2.2.4 nlo_get_force_stop__@Base 2.2.4 nlo_get_ftol_abs@Base 2.2.4 nlo_get_ftol_abs_@Base 2.2.4 nlo_get_ftol_abs__@Base 2.2.4 nlo_get_ftol_rel@Base 2.2.4 nlo_get_ftol_rel_@Base 2.2.4 nlo_get_ftol_rel__@Base 2.2.4 nlo_get_initial_step@Base 2.2.4 nlo_get_initial_step_@Base 2.2.4 nlo_get_initial_step__@Base 2.2.4 nlo_get_lower_bounds@Base 2.2.4 nlo_get_lower_bounds_@Base 2.2.4 nlo_get_lower_bounds__@Base 2.2.4 nlo_get_maxeval@Base 2.2.4 nlo_get_maxeval_@Base 2.2.4 nlo_get_maxeval__@Base 2.2.4 nlo_get_maxtime@Base 2.2.4 nlo_get_maxtime_@Base 2.2.4 nlo_get_maxtime__@Base 2.2.4 nlo_get_population@Base 2.2.4 nlo_get_population_@Base 2.2.4 nlo_get_population__@Base 2.2.4 nlo_get_stopval@Base 2.2.4 nlo_get_stopval_@Base 2.2.4 nlo_get_stopval__@Base 2.2.4 nlo_get_upper_bounds@Base 2.2.4 nlo_get_upper_bounds_@Base 2.2.4 nlo_get_upper_bounds__@Base 2.2.4 nlo_get_vector_storage@Base 2.2.4 nlo_get_vector_storage_@Base 2.2.4 nlo_get_vector_storage__@Base 2.2.4 nlo_get_xtol_abs@Base 2.2.4 nlo_get_xtol_abs_@Base 2.2.4 nlo_get_xtol_abs__@Base 2.2.4 nlo_get_xtol_rel@Base 2.2.4 nlo_get_xtol_rel_@Base 2.2.4 nlo_get_xtol_rel__@Base 2.2.4 nlo_optimize@Base 2.2.4 nlo_optimize_@Base 2.2.4 nlo_optimize__@Base 2.2.4 nlo_remove_equality_constraints@Base 2.2.4 nlo_remove_equality_constraints_@Base 2.2.4 nlo_remove_equality_constraints__@Base 2.2.4 nlo_remove_inequality_constraints@Base 2.2.4 nlo_remove_inequality_constraints_@Base 2.2.4 nlo_remove_inequality_constraints__@Base 2.2.4 nlo_set_default_initial_step@Base 2.2.4 nlo_set_default_initial_step_@Base 2.2.4 nlo_set_default_initial_step__@Base 2.2.4 nlo_set_force_stop@Base 2.2.4 nlo_set_force_stop_@Base 2.2.4 nlo_set_force_stop__@Base 2.2.4 nlo_set_ftol_abs@Base 2.2.4 nlo_set_ftol_abs_@Base 2.2.4 nlo_set_ftol_abs__@Base 2.2.4 nlo_set_ftol_rel@Base 2.2.4 nlo_set_ftol_rel_@Base 2.2.4 nlo_set_ftol_rel__@Base 2.2.4 nlo_set_initial_step1@Base 2.2.4 nlo_set_initial_step1_@Base 2.2.4 nlo_set_initial_step1__@Base 2.2.4 nlo_set_initial_step@Base 2.2.4 nlo_set_initial_step_@Base 2.2.4 nlo_set_initial_step__@Base 2.2.4 nlo_set_local_optimizer@Base 2.2.4 nlo_set_local_optimizer_@Base 2.2.4 nlo_set_local_optimizer__@Base 2.2.4 nlo_set_lower_bounds1@Base 2.2.4 nlo_set_lower_bounds1_@Base 2.2.4 nlo_set_lower_bounds1__@Base 2.2.4 nlo_set_lower_bounds@Base 2.2.4 nlo_set_lower_bounds_@Base 2.2.4 nlo_set_lower_bounds__@Base 2.2.4 nlo_set_max_objective@Base 2.2.4 nlo_set_max_objective_@Base 2.2.4 nlo_set_max_objective__@Base 2.2.4 nlo_set_maxeval@Base 2.2.4 nlo_set_maxeval_@Base 2.2.4 nlo_set_maxeval__@Base 2.2.4 nlo_set_maxtime@Base 2.2.4 nlo_set_maxtime_@Base 2.2.4 nlo_set_maxtime__@Base 2.2.4 nlo_set_min_objective@Base 2.2.4 nlo_set_min_objective_@Base 2.2.4 nlo_set_min_objective__@Base 2.2.4 nlo_set_population@Base 2.2.4 nlo_set_population_@Base 2.2.4 nlo_set_population__@Base 2.2.4 nlo_set_stopval@Base 2.2.4 nlo_set_stopval_@Base 2.2.4 nlo_set_stopval__@Base 2.2.4 nlo_set_upper_bounds1@Base 2.2.4 nlo_set_upper_bounds1_@Base 2.2.4 nlo_set_upper_bounds1__@Base 2.2.4 nlo_set_upper_bounds@Base 2.2.4 nlo_set_upper_bounds_@Base 2.2.4 nlo_set_upper_bounds__@Base 2.2.4 nlo_set_vector_storage@Base 2.2.4 nlo_set_vector_storage_@Base 2.2.4 nlo_set_vector_storage__@Base 2.2.4 nlo_set_xtol_abs1@Base 2.2.4 nlo_set_xtol_abs1_@Base 2.2.4 nlo_set_xtol_abs1__@Base 2.2.4 nlo_set_xtol_abs@Base 2.2.4 nlo_set_xtol_abs_@Base 2.2.4 nlo_set_xtol_abs__@Base 2.2.4 nlo_set_xtol_rel@Base 2.2.4 nlo_set_xtol_rel_@Base 2.2.4 nlo_set_xtol_rel__@Base 2.2.4 nlogls@Base 2.2.4 nlogls_@Base 2.2.4 nlogsp@Base 2.2.4 nlogsp_@Base 2.2.4 nlopt_add_equality_constraint@Base 2.2.4 nlopt_add_equality_mconstraint@Base 2.2.4 nlopt_add_inequality_constraint@Base 2.2.4 nlopt_add_inequality_mconstraint@Base 2.2.4 nlopt_add_precond_equality_constraint@Base 2.3 nlopt_add_precond_inequality_constraint@Base 2.3 nlopt_algorithm_name@Base 2.2.4 nlopt_compute_rescaling@Base 2.2.4 nlopt_copy@Base 2.2.4 nlopt_count_constraints@Base 2.2.4 nlopt_create@Base 2.2.4 nlopt_destroy@Base 2.2.4 nlopt_eval_constraint@Base 2.2.4 nlopt_force_stop@Base 2.2.4 nlopt_get_algorithm@Base 2.2.4 nlopt_get_dimension@Base 2.2.4 nlopt_get_force_stop@Base 2.2.4 nlopt_get_ftol_abs@Base 2.2.4 nlopt_get_ftol_rel@Base 2.2.4 nlopt_get_initial_step@Base 2.2.4 nlopt_get_local_search_algorithm@Base 2.2.4 nlopt_get_lower_bounds@Base 2.2.4 nlopt_get_maxeval@Base 2.2.4 nlopt_get_maxtime@Base 2.2.4 nlopt_get_population@Base 2.2.4 nlopt_get_stochastic_population@Base 2.2.4 nlopt_get_stopval@Base 2.2.4 nlopt_get_upper_bounds@Base 2.2.4 nlopt_get_vector_storage@Base 2.2.4 nlopt_get_xtol_abs@Base 2.2.4 nlopt_get_xtol_rel@Base 2.2.4 nlopt_init_genrand@Base 2.2.4 nlopt_isinf@Base 2.2.4 nlopt_iurand@Base 2.2.4 nlopt_local_search_alg_deriv@Base 2.2.4 nlopt_local_search_alg_nonderiv@Base 2.2.4 nlopt_local_search_maxeval@Base 2.2.4 nlopt_max_constraint_dim@Base 2.2.4 nlopt_minimize@Base 2.2.4 nlopt_minimize_constrained@Base 2.2.4 nlopt_minimize_econstrained@Base 2.2.4 nlopt_munge_data@Base 2.4 nlopt_new_rescaled@Base 2.2.4 nlopt_nrand@Base 2.2.4 nlopt_optimize@Base 2.2.4 nlopt_optimize_limited@Base 2.2.4 nlopt_qsort_r@Base 2.2.4 nlopt_remove_equality_constraints@Base 2.2.4 nlopt_remove_inequality_constraints@Base 2.2.4 nlopt_reorder_bounds@Base 2.4 nlopt_rescale@Base 2.2.4 nlopt_seconds@Base 2.2.4 nlopt_set_default_initial_step@Base 2.2.4 nlopt_set_force_stop@Base 2.2.4 nlopt_set_ftol_abs@Base 2.2.4 nlopt_set_ftol_rel@Base 2.2.4 nlopt_set_initial_step1@Base 2.2.4 nlopt_set_initial_step@Base 2.2.4 nlopt_set_local_optimizer@Base 2.2.4 nlopt_set_local_search_algorithm@Base 2.2.4 nlopt_set_lower_bounds1@Base 2.2.4 nlopt_set_lower_bounds@Base 2.2.4 nlopt_set_max_objective@Base 2.2.4 nlopt_set_maxeval@Base 2.2.4 nlopt_set_maxtime@Base 2.2.4 nlopt_set_min_objective@Base 2.2.4 nlopt_set_munge@Base 2.2.4 nlopt_set_population@Base 2.2.4 nlopt_set_precond_max_objective@Base 2.3 nlopt_set_precond_min_objective@Base 2.3 nlopt_set_stochastic_population@Base 2.2.4 nlopt_set_stopval@Base 2.2.4 nlopt_set_upper_bounds1@Base 2.2.4 nlopt_set_upper_bounds@Base 2.2.4 nlopt_set_vector_storage@Base 2.2.4 nlopt_set_xtol_abs1@Base 2.2.4 nlopt_set_xtol_abs@Base 2.2.4 nlopt_set_xtol_rel@Base 2.2.4 nlopt_slsqp@Base 2.2.4 nlopt_sobol_create@Base 2.2.4 nlopt_sobol_destroy@Base 2.2.4 nlopt_sobol_next01@Base 2.2.4 nlopt_sobol_next@Base 2.2.4 nlopt_sobol_skip@Base 2.2.4 nlopt_srand@Base 2.2.4 nlopt_srand_time@Base 2.2.4 nlopt_srand_time_default@Base 2.2.4 nlopt_stochastic_population@Base 2.2.4 nlopt_stop_dx@Base 2.2.4 nlopt_stop_evals@Base 2.2.4 nlopt_stop_evalstime@Base 2.2.4 nlopt_stop_f@Base 2.2.4 nlopt_stop_forced@Base 2.2.4 nlopt_stop_ftol@Base 2.2.4 nlopt_stop_time@Base 2.2.4 nlopt_stop_time_@Base 2.2.4 nlopt_stop_x@Base 2.2.4 nlopt_stop_xs@Base 2.2.4 nlopt_time_seed@Base 2.2.4 nlopt_unscale@Base 2.2.4 nlopt_urand@Base 2.2.4 nlopt_version@Base 2.2.4 nloptc@Base 2.2.4 nloptc_@Base 2.2.4 nloptm@Base 2.2.4 nloptm_@Base 2.2.4 nloptv@Base 2.2.4 nloptv_@Base 2.2.4 nlosls@Base 2.2.4 nlosls_@Base 2.2.4 nlosr@Base 2.2.4 nlosr_@Base 2.2.4 nlosrt@Base 2.2.4 nlosrt_@Base 2.2.4 nlossp@Base 2.2.4 nlossp_@Base 2.2.4 praxis_@Base 2.2.4 rb_tree_check@Base 2.2.4 rb_tree_destroy@Base 2.2.4 rb_tree_destroy_with_keys@Base 2.2.4 rb_tree_find@Base 2.2.4 rb_tree_find_gt@Base 2.2.4 rb_tree_find_le@Base 2.2.4 rb_tree_find_lt@Base 2.2.4 rb_tree_init@Base 2.2.4 rb_tree_insert@Base 2.2.4 rb_tree_max@Base 2.2.4 rb_tree_min@Base 2.2.4 rb_tree_pred@Base 2.2.4 rb_tree_remove@Base 2.2.4 rb_tree_resort@Base 2.2.4 rb_tree_shift_keys@Base 2.2.4 rb_tree_succ@Base 2.2.4 sbplx_minimize@Base 2.2.4 sbplx_verbose@Base 2.2.4 debian/source/0000775000000000000000000000000012227441307010472 5ustar debian/source/format0000664000000000000000000000001412227441307011700 0ustar 3.0 (quilt) debian/orig-tar.exclude0000664000000000000000000000011512227441307012266 0ustar luksan/v999-07.pdf stogo/paper.pdf stogo/techreport.pdf direct/userguide.pdf debian/libnlopt-dev.links0000664000000000000000000000006312227441307012632 0ustar usr/share/doc/libnlopt0 usr/share/doc/libnlopt-dev debian/libnlopt0.docs0000664000000000000000000000002112227441307011740 0ustar NEWS README TODO debian/orig-tar.sh0000775000000000000000000000060112247573320011255 0ustar #!/bin/sh -e # called by uscan with '--upstream-version' PKG=nlopt DIR=$PKG-$2 TAR=../${PKG}_$2+dfsg.orig.tar.gz # clean up the upstream tarball tar xvf $3 tar -c -z -f $TAR -X debian/orig-tar.exclude $DIR rm -rf $DIR $3 # move to directory 'tarballs' if [ -r .svn/deb-layout ] then . .svn/deb-layout mv $TAR $origDir echo "moved $TAR to $origDir" fi exit 0 debian/libnlopt-dev.install0000664000000000000000000000015112227441307013156 0ustar usr/include usr/lib/*/libnlopt.so usr/lib/*/libnlopt.a usr/lib/*/pkgconfig/nlopt.pc usr/share/man/man3/* debian/libnlopt0.lintian-overrides0000664000000000000000000000057312247573320014465 0ustar # See http://lists.debian.org/debian-devel/2012/05/msg00852.html libnlopt0: hardening-no-stackprotector usr/lib/*/libnlopt.so.* # To be discussed with upstream. # # For 2.4, grep exit shows, that problem is in # direct/direct-internal.h: ASRT macro, used in ./direct/DIRsubrout.c; # stogo/local.cc and stogo/tools.cc sources. libnlopt0: shlib-calls-exit usr/lib/*/libnlopt.so.* debian/patches/0000775000000000000000000000000012247573320010624 5ustar debian/patches/guile-fix-deprecated-calls.patch0000664000000000000000000003615412247573320016741 0ustar Description: Fix some deprecated calls in autogenerated nlopt-guile.cpp Warnings: SCM_VECTORP is deprecated. Use scm_is_vector instead. SCM_VECTOR_LENGTH is deprecated. Use scm_c_vector_length instead. Author: Sergey B Kirpichev Forwarded: no --- swig/nlopt-guile.cpp | 134 +++++++++++++++++++++++++-------------------------- 1 file changed, 67 insertions(+), 67 deletions(-) --- a/swig/nlopt-guile.cpp +++ b/swig/nlopt-guile.cpp @@ -1485,8 +1485,8 @@ std::vector< double > *result = 0 ; { - if (SCM_VECTORP(argv[0])) { - unsigned long size = SCM_VECTOR_LENGTH(argv[0]); + if (scm_is_vector(argv[0])) { + unsigned long size = scm_c_vector_length(argv[0]); temp1 = std::vector(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg1 = &temp1; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg4 = &temp4; for (unsigned long i=0; i(size); arg4 = &temp4; for (unsigned long i=0; i(size); arg4 = &temp4; for (unsigned long i=0; i(size); arg4 = &temp4; for (unsigned long i=0; i(size); arg6 = &temp6; for (unsigned long i=0; i(size); arg6 = &temp6; for (unsigned long i=0; i(size); arg6 = &temp6; for (unsigned long i=0; i(size); arg6 = &temp6; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i(size); arg2 = &temp2; for (unsigned long i=0; i Forwarded: no --- configure.ac | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) --- a/configure.ac +++ b/configure.ac @@ -408,7 +408,7 @@ dnl ----------------------------------------------------------------------- -AC_CONFIG_FILES([ +AC_OUTPUT([ Makefile nlopt.pc api/Makefile debian/compat0000664000000000000000000000000212227441307010370 0ustar 9 debian/README.Debian0000664000000000000000000000035212227441307011233 0ustar nlopt for Debian ---------------- initial build for squeeze see http://ab-initio.mit.edu/wiki/index.php/NLopt_manual for some examples -- Christophe Trophime Mon, 03 Jan 2011 14:26:50 +0100 debian/libnlopt0.install0000664000000000000000000000003012227441307012456 0ustar usr/lib/*/libnlopt.so.* debian/octave-nlopt.links0000664000000000000000000000006312227441307012646 0ustar usr/share/doc/libnlopt0 usr/share/doc/octave-nlopt debian/python-nlopt.links0000664000000000000000000000006312227441307012706 0ustar usr/share/doc/libnlopt0 usr/share/doc/python-nlopt debian/python-nlopt.install0000664000000000000000000000002012227441307013225 0ustar usr/lib/python* debian/changelog0000664000000000000000000000755012302724527011055 0ustar nlopt (2.4.1+dfsg-1ubuntu1) trusty; urgency=medium * Call libtoolize with --force to update libtool.m4. -- Matthias Klose Mon, 24 Feb 2014 21:18:59 +0100 nlopt (2.4.1+dfsg-1build1) trusty; urgency=medium * Rebuild for octave 3.8. -- Matthias Klose Mon, 24 Feb 2014 18:26:01 +0000 nlopt (2.4.1+dfsg-1) unstable; urgency=low * New upstream version (Closes: #728556) * Bump up Standards-Version (to 3.9.5) * Change Section to libs for libnlopt-guile0 -- Sergey B Kirpichev Tue, 03 Dec 2013 18:19:26 +0400 nlopt (2.4+dfsg-1) unstable; urgency=low * New upstream version * Fix lintian error: vcs-field-not-canonical * Fix permissions on debian/orig-tar.sh * Remove patches, applied by upstream * Refresh patches for the new upstream release * Update debian/libnlopt0.symbols * Change octave-nlopt priority to optional (See: #706761) * Override lintian error(X) shlib-calls-exit for libnlopt0 -- Sergey B Kirpichev Sat, 16 Nov 2013 15:27:46 +0400 nlopt (2.3+dfsg-2) unstable; urgency=low [ Tim Gardner ] * Add 04-python-includes.patch to detect correct include python paths (Closes: #697638) [ Sergey B Kirpichev ] * Removed debian/docs * Drop unused override for octave-nlopt: missing-dependency-on-libc * Bump up Standards-Version (to 3.9.4) * Ignore shared libraries in nlopt-python (fix postinst/rm-has- useless-call-to-ldconfig lintian warning's) [ Christophe Trophime ] * Updated patches following DEP3 (python-includes.patch, configure.patch and swig.patch) [ Sergey B Kirpichev ] * Added Forwarded: headers for patches 01-03 * Set octave-nlopt priority (optional -> extra), according to the policy * Unfuzz patches with "quilt refresh -pab --no-index --no-timestamps --diffstat" * Renamed patches (foo_bar.patch -> foo-bar.patch, git-format-patch's default naming scheme) * Added missing Forwarded: headers for debian/patches/* * Point to related bug for python-includes.patch * Drop unused override for libnlopt-guile0 * Fix FTBFS dh_auto_test: error: unable to chdir to debian/build (Closes: #718054) -- Sergey B Kirpichev Wed, 16 Oct 2013 09:40:44 +0200 nlopt (2.3+dfsg-1) unstable; urgency=low [ Christophe Trophime ] * fix lintian error * fix override disparity [ Sergey B Kirpichev ] * New upstream version (Closes: #682273) * Adopt machine-readable debian/copyright file format * Add symbols control file for libnlopt.so * Provide /usr/share/doc in libnlopt0 package, make symlinks for others * Simplify debian/rules * Reformat debian/control, drop trailing spaces * Fix some short/long descriptions * Move manpages to libnlopt-dev, add nlopt.pc (Closes: #695659) * Drop unused override (revert back "fix lintian error") * Add shlibs file for libnlopt0 * Fix Depends * Fix override disparities: change priority to optional and revert back Section's for source package and libnlopt0 (revert back "fix override disparity") * Cleanup debian/README.source * Update debian/libnlopt0.symbols for new release * Drop get-orig-source target, repackage upstream tarball with uscan -- Christophe Trophime Wed, 12 Dec 2012 13:30:53 +0100 nlopt (2.2.4+dfsg-2) unstable; urgency=low [Sergey B Kirpichev] * Install libnlopt_guile.so (Closes: #679619) * Add multiarch support [ Rafael Laboissiere ] * debian/rules: - Install the .oct file in the appropriate directory (Closes: #679617) * Add Sergey B Kirpichev to Uploaders -- Christophe Trophime Wed, 27 Jun 2012 12:05:11 +0200 nlopt (2.2.4+dfsg-1) unstable; urgency=low * Initial release (Closes: #610623) -- Christophe Trophime Tue, 07 Jun 2011 23:42:16 +0200 debian/control0000664000000000000000000001355012247573320010604 0ustar Source: nlopt Section: math Priority: optional Maintainer: Debian Science Maintainers Uploaders: Sergey B Kirpichev , Christophe Trophime Build-Depends: debhelper (>= 9), dpkg-dev (>= 1.16.1~), autotools-dev, libtool, automake, g++ (>= 4.2), octave-pkg-dev (>= 1.0.1), python-all-dev (>= 2.6.6-3~), python-numpy, guile-1.8, guile-1.8-dev Standards-Version: 3.9.5 X-Python-Version: >= 2.6 Homepage: http://ab-initio.mit.edu/wiki/index.php/NLopt Vcs-Svn: svn://anonscm.debian.org/debian-science/packages/nlopt Vcs-Browser: http://svn.debian.org/viewsvn/debian-science/packages/nlopt Package: libnlopt0 Section: libs Architecture: any Multi-Arch: same Pre-Depends: ${misc:Pre-Depends} Depends: ${shlibs:Depends}, ${misc:Depends} Description: nonlinear optimization library NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: . * Callable from C, C++, Fortran, GNU Octave, Python, GNU Guile, GNU R. * A common interface for many different algorithms * Support for large-scale optimization. * Both global and local optimization algorithms. * Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. . This package provides the shared libraries required to run programs compiled with NLopt. To compile your own programs you also need to install libnlopt-dev. Package: libnlopt-dev Architecture: any Section: libdevel Depends: libnlopt0 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} Description: nonlinear optimization library -- development package NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: . * Callable from C, C++, Fortran, GNU Octave, Python, GNU Guile, GNU R. * A common interface for many different algorithms * Support for large-scale optimization. * Both global and local optimization algorithms. * Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. . This package contains the header files, static libraries and symbolic links that developers using NLopt library will need. Package: python-nlopt Architecture: any Section: python Depends: libnlopt0 (= ${binary:Version}), ${shlibs:Depends}, ${python:Depends}, ${misc:Depends} Provides: ${python:Provides} Description: nonlinear optimization library -- Python bindings NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: . * Callable from C, C++, Fortran, GNU Octave, Python, GNU Guile, GNU R. * A common interface for many different algorithms * Support for large-scale optimization. * Both global and local optimization algorithms. * Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. . This package contains the Python bindings. Package: octave-nlopt Architecture: any Depends: libnlopt0 (= ${binary:Version}), ${misc:Depends}, ${shlibs:Depends}, ${octave:Depends} Description: nonlinear optimization library -- GNU Octave package NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: . * Callable from C, C++, Fortran, GNU Octave, Python, GNU Guile, GNU R. * A common interface for many different algorithms * Support for large-scale optimization. * Both global and local optimization algorithms. * Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. . This package contains the module for the GNU Octave. Package: libnlopt-guile0 Section: libs Architecture: any Multi-Arch: same Pre-Depends: ${misc:Pre-Depends} Depends: libnlopt0 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends}, guile-1.8 Description: nonlinear optimization library -- Guile bindings NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms. Its features include: . * Callable from C, C++, Fortran, GNU Octave, Python, GNU Guile, GNU R. * A common interface for many different algorithms * Support for large-scale optimization. * Both global and local optimization algorithms. * Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. * Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. . This package contains the bindings for GNU Guile. debian/libnlopt-guile0.install0000664000000000000000000000006212227441307013566 0ustar usr/lib/*/libnlopt_guile.so* usr/share/guile/site debian/libnlopt-guile0.links0000664000000000000000000000006612227441307013244 0ustar usr/share/doc/libnlopt0 usr/share/doc/libnlopt-guile0 debian/libnlopt-guile0.lintian-overrides0000664000000000000000000000030712227441307015560 0ustar # it's ok for plugin: libnlopt-guile0: non-dev-pkg-with-shlib-symlink usr/lib/*/libnlopt_guile.so.* usr/lib/*/libnlopt_guile.so libnlopt-guile0: no-symbols-control-file usr/lib/*/libnlopt_guile.so.*