[med-svn] [Git][med-team/easel][master] 6 commits: Shorten d/copyright, update copyright years
Andreas Tille (@tille)
gitlab at salsa.debian.org
Thu Nov 12 12:19:40 GMT 2026
Andreas Tille pushed to branch master at Debian Med / easel
Commits:
8f22ddc9 by Andreas Tille at 2026-11-12T11:40:28+01:00
Shorten d/copyright, update copyright years
- - - - -
3f1fc9f2 by Andreas Tille at 2026-11-12T12:20:14+01:00
Overhaul of d/copyright + add lrc.config
- - - - -
edd7e5b2 by Andreas Tille at 2026-11-12T12:32:35+01:00
Add Files: formats/uniprot
- - - - -
2dd37988 by Andreas Tille at 2026-11-12T12:33:22+01:00
Do not override dh_auto_test
- - - - -
d9f65696 by Andreas Tille at 2026-11-12T12:40:52+01:00
Drop unused Build-Depends
- - - - -
b6d3867e by Andreas Tille at 2026-11-12T12:41:03+01:00
Export internal sequence file parser functions used by pyhmmer
- - - - -
6 changed files:
- debian/control
- debian/copyright
- + debian/lrc.config
- + debian/patches/export-internal-symbols-for-pyhmmer.patch
- debian/patches/series
- debian/rules
Changes:
=====================================
debian/control
=====================================
@@ -8,8 +8,7 @@ Section: science
Build-Depends:
debhelper-compat (= 14),
d-shlibs,
- help2man,
- libgsl-dev,
+# libgsl-dev,
mpi-default-dev,
texlive-fonts-recommended,
texlive-latex-base,
=====================================
debian/copyright
=====================================
@@ -4,14 +4,140 @@ Source: https://github.com/EddyRivasLab/easel
Files-Excluded: demotic/*
Files: *
-Copyright: © 2004-2016 Sean R. Eddy
- © 2004-2016 Howard Hughes Medical Institute
- © 2015-2016 President and Fellows of Harvard College
- © 2004-2006 Washington University School of Medicine
+Copyright: 1990-2023 Sean R. Eddy
+ 2015-2023 President and Fellows of Harvard College
+ 2000-2023 Howard Hughes Medical Institute
+ 1995-2006 Washington University School of Medicine
+ 1992-1995 MRC Laboratory of Molecular Biology, UK
License: BSD-3-clause
+Files: easel.c
+Copyright: 1999-2001 David A. Wheeler
+ 2004-2007 HHMI Janelia Farm Research Campus # Freely
+ 2004-2007 HHMI Janelia Farm Research Campus" EASEL_LICENSE "Freely
+ 1990, 1993 The Regents of the University of California
+License: BSD-3-clause
+
+Files: esl_rand64.c
+Copyright: 2004, Makoto Matsumoto and Takuji Nishimura
+ 2016 Kevin Lawler
+License: ISC
+ Permission to use, copy, modify, and/or distribute this software for
+ any purpose with or without fee is hereby granted, provided that the
+ above copyright notice and this permission notice appear in all copies.
+ .
+ THE SOFTWARE IS PROVIDED “AS IS” AND THE AUTHOR DISCLAIMS ALL
+ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
+ OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE
+ FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY
+ DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
+ IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
+ OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+Files: esl_neon.c
+ esl_sse.c
+ esl_vmx.c
+Copyright: 2007 Julien Pommier
+ 1992 Stephen Moshier
+License: Zlib
+ This software is provided 'as-is', without any express or implied
+ warranty. In no event will the authors be held liable for any damages
+ arising from the use of this software.
+ .
+ Permission is granted to anyone to use this software for any purpose,
+ including commercial applications, and to alter it and redistribute it
+ freely, subject to the following restrictions:
+ .
+ 1. The origin of this software must not be misrepresented; you must not
+ claim that you wrote the original software. If you use this software
+ in a product, an acknowledgment in the product documentation would be
+ appreciated but is not required.
+ 2. Altered source versions must be plainly marked as such, and must not be
+ misrepresented as being the original software.
+ 3. This notice may not be removed or altered from any source distribution.
+
+Files: esl_regexp.c
+Copyright: 1986, 1993, 1995 by University of Toronto.
+ Written by Henry Spencer
+License: Spencer-License
+ Permission is granted to anyone to use this software for any
+ purpose on any computer system, and to redistribute it in any way,
+ subject to the following restrictions:
+ .
+ 1. The author is not responsible for the consequences of use of
+ this software, no matter how awful, even if they arise
+ from defects in it.
+ .
+ 2. The origin of this software must not be misrepresented, either
+ by explicit claim or by omission.
+ .
+ 3. Altered versions must be plainly marked as such, and must not
+ be misrepresented (by explicit claim or omission) as being
+ the original software.
+ .
+ 4. This notice must not be removed or altered.
+
+Files: esl_stats.*
+Copyright: 1993 by Sun Microsystems, Inc. All rights reserved.
+License: SUN
+ Developed at SunPro, a Sun Microsystems, Inc. business.
+ Permission to use, copy, modify, and distribute this software is
+ freely granted, provided that this notice is preserved.
+ [as posted by eggcrook at stackexchange.com, 21 Dec 2012]
+
+Files: esl_stopwatch.c
+Copyright: 2012, David Robert Nadeau, http:NadeauSoftware.com
+License: CC-BY-3.0
+ On Debian systems you can find a copy of Creative Commons Attribution 3.0
+ license at /usr/share/common-licenses/CC-BY-3.0
+
+Files: m4/ax_check_compile_flag.m4
+Copyright: 2008 Guido U. Draheim <guidod at gmx.de>
+ 2011 Maarten Bosmans <mkbosmans at gmail.com>
+License: GPL-3+
+
+Files: m4/ax_check_gnu_make.m4
+Copyright: 2008 John Darrington <j.darrington at elvis.murdoch.edu.au>
+ 2015 Enrico M. Crisostomo <enrico.m.crisostomo at gmail.com>
+License: GPL-3+
+
+Files: m4/ax_compiler_vendor.m4
+Copyright: 2008 Steven G. Johnson <stevenj at alum.mit.edu>
+ 2008 Matteo Frigo
+License: GPL-3+
+
+Files: m4/ax_gcc_func_attribute.m4
+Copyright: 2013 Gabriele Svelto <gabriele.svelto at gmail.com>
+License: GPL-3+
+
+Files: m4/ax_prog_cc_mpi.m4
+Copyright: 2010,2011 Olaf Lenz <olenz at icp.uni-stuttgart.de>
+License: GPL-3+
+
+Files: m4/ax_pthread.m4
+Copyright: 2008 Steven G. Johnson <stevenj at alum.mit.edu>
+ 2011 Daniel Richard G. <skunk at iSKUNK.ORG>
+ 2019 Marc Stevens <marc.stevens at cwi.nl>
+License: GPL-3+
+
+Files: formats/uniprot
+Copyright: none
+ These files are marked to be copyrighted by the UniProt Consortium, but this
+ applies to the UniProt database as a whole, not to the individual records.
+License: not-the-CC-BY-ND-3.0
+ Despite the following statement:
+ .
+ Copyrighted by the UniProt Consortium, see http://www.uniprot.org/terms
+ Distributed under the Creative Commons Attribution-NoDerivs License
+ .
+ The above files, as individual records, are not copyrighted. The statement is
+ for the UniProt as a whole.
+Comment: This statement was once discussed and applied in the emboss package
+ See https://lists.debian.org/debian-med/2012/03/msg00097.html
+
Files: debian/*
-Copyright: © 2017 Michael R. Crusoe <michael.crusoe at gmail.com>
+Copyright: 2017 Michael R. Crusoe <michael.crusoe at gmail.com>
+ 2026 Andreas Tille <tille at debian.org>
License: BSD-3-clause
License: BSD-3-clause
@@ -44,340 +170,6 @@ License: BSD-3-clause
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
-Files: esl_stopwatch.c
-Copyright: 2012, David Robert Nadeau, http:NadeauSoftware.com
-License: CC-BY-3.0
- Creative Commons Attribution 3.0 Unported
- .
- CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
- LEGAL SERVICES. DISTRIBUTION OF THIS LICENSE DOES NOT CREATE AN
- ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION
- ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE
- INFORMATION PROVIDED, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
- ITS USE.
- .
- License
- .
- THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE
- COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY
- COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS
- AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED.
- .
- BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE
- TO BE BOUND BY THE TERMS OF THIS LICENSE. TO THE EXTENT THIS LICENSE MAY
- BE CONSIDERED TO BE A CONTRACT, THE LICENSOR GRANTS YOU THE RIGHTS
- CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND
- CONDITIONS.
- .
- 1. Definitions
- .
- a. "Adaptation" means a work based upon the Work, or upon the Work and
- other pre-existing works, such as a translation, adaptation, derivative
- work, arrangement of music or other alterations of a literary or
- artistic work, or phonogram or performance and includes cinematographic
- adaptations or any other form in which the Work may be recast,
- transformed, or adapted including in any form recognizably derived from
- the original, except that a work that constitutes a Collection will not
- be considered an Adaptation for the purpose of this License. For the
- avoidance of doubt, where the Work is a musical work, performance or
- phonogram, the synchronization of the Work in timed-relation with a
- moving image ("synching") will be considered an Adaptation for the
- purpose of this License.
- .
- b. "Collection" means a collection of literary or artistic works, such
- as encyclopedias and anthologies, or performances, phonograms or
- broadcasts, or other works or subject matter other than works listed in
- Section 1(f) below, which, by reason of the selection and arrangement of
- their contents, constitute intellectual creations, in which the Work is
- included in its entirety in unmodified form along with one or more other
- contributions, each constituting separate and independent works in
- themselves, which together are assembled into a collective whole. A work
- that constitutes a Collection will not be considered an Adaptation (as
- defined above) for the purposes of this License.
- .
- c. "Distribute" means to make available to the public the original and
- copies of the Work or Adaptation, as appropriate, through sale or other
- transfer of ownership.
- .
- d. "Licensor" means the individual, individuals, entity or entities that
- offer(s) the Work under the terms of this License.
- .
- e. "Original Author" means, in the case of a literary or artistic work,
- the individual, individuals, entity or entities who created the Work or
- if no individual or entity can be identified, the publisher; and in
- addition (i) in the case of a performance the actors, singers,
- musicians, dancers, and other persons who act, sing, deliver, declaim,
- play in, interpret or otherwise perform literary or artistic works or
- expressions of folklore; (ii) in the case of a phonogram the producer
- being the person or legal entity who first fixes the sounds of a
- performance or other sounds; and, (iii) in the case of broadcasts, the
- organization that transmits the broadcast.
- .
- f. "Work" means the literary and/or artistic work offered under the
- terms of this License including without limitation any production in the
- literary, scientific and artistic domain, whatever may be the mode or
- form of its expression including digital form, such as a book, pamphlet
- and other writing; a lecture, address, sermon or other work of the same
- nature; a dramatic or dramatico-musical work; a choreographic work or
- entertainment in dumb show; a musical composition with or without words;
- a cinematographic work to which are assimilated works expressed by a
- process analogous to cinematography; a work of drawing, painting,
- architecture, sculpture, engraving or lithography; a photographic work
- to which are assimilated works expressed by a process analogous to
- photography; a work of applied art; an illustration, map, plan, sketch
- or three-dimensional work relative to geography, topography,
- architecture or science; a performance; a broadcast; a phonogram; a
- compilation of data to the extent it is protected as a copyrightable
- work; or a work performed by a variety or circus performer to the extent
- it is not otherwise considered a literary or artistic work.
- .
- g. "You" means an individual or entity exercising rights under this
- License who has not previously violated the terms of this License with
- respect to the Work, or who has received express permission from the
- Licensor to exercise rights under this License despite a previous
- violation.
- .
- h. "Publicly Perform" means to perform public recitations of the Work
- and to communicate to the public those public recitations, by any means
- or process, including by wire or wireless means or public digital
- performances; to make available to the public Works in such a way that
- members of the public may access these Works from a place and at a place
- individually chosen by them; to perform the Work to the public by any
- means or process and the communication to the public of the performances
- of the Work, including by public digital performance; to broadcast and
- rebroadcast the Work by any means including signs, sounds or images.
- .
- i. "Reproduce" means to make copies of the Work by any means including
- without limitation by sound or visual recordings and the right of
- fixation and reproducing fixations of the Work, including storage of a
- protected performance or phonogram in digital form or other electronic
- medium.
- .
- 2. Fair Dealing Rights. Nothing in this License is intended to reduce,
- limit, or restrict any uses free from copyright or rights arising from
- limitations or exceptions that are provided for in connection with the
- copyright protection under copyright law or other applicable laws.
- .
- 3. License Grant. Subject to the terms and conditions of this License,
- Licensor hereby grants You a worldwide, royalty-free, non-exclusive,
- perpetual (for the duration of the applicable copyright) license to
- exercise the rights in the Work as stated below:
- .
- a. to Reproduce the Work, to incorporate the Work into one or more
- Collections, and to Reproduce the Work as incorporated in the
- Collections;
- .
- b. to create and Reproduce Adaptations provided that any such
- Adaptation, including any translation in any medium, takes reasonable
- steps to clearly label, demarcate or otherwise identify that changes
- were made to the original Work. For example, a translation could be
- marked "The original work was translated from English to Spanish," or a
- modification could indicate "The original work has been modified.";
- .
- c. to Distribute and Publicly Perform the Work including as incorporated
- in Collections; and,
- .
- d. to Distribute and Publicly Perform Adaptations.
- .
- e. For the avoidance of doubt:
- .
- i. Non-waivable Compulsory License Schemes. In those jurisdictions in
- which the right to collect royalties through any statutory or compulsory
- licensing scheme cannot be waived, the Licensor reserves the exclusive
- right to collect such royalties for any exercise by You of the rights
- granted under this License;
- .
- ii. Waivable Compulsory License Schemes. In those jurisdictions in which
- the right to collect royalties through any statutory or compulsory
- licensing scheme can be waived, the Licensor waives the exclusive right
- to collect such royalties for any exercise by You of the rights granted
- under this License; and,
- .
- iii. Voluntary License Schemes. The Licensor waives the right to collect
- royalties, whether individually or, in the event that the Licensor is a
- member of a collecting society that administers voluntary licensing
- schemes, via that society, from any exercise by You of the rights
- granted under this License.
- .
- The above rights may be exercised in all media and formats whether now
- known or hereafter devised. The above rights include the right to make
- such modifications as are technically necessary to exercise the rights
- in other media and formats. Subject to Section 8(f), all rights not
- expressly granted by Licensor are hereby reserved.
- .
- 4. Restrictions. The license granted in Section 3 above is expressly
- made subject to and limited by the following restrictions:
- .
- a. You may Distribute or Publicly Perform the Work only under the terms
- of this License. You must include a copy of, or the Uniform Resource
- Identifier (URI) for, this License with every copy of the Work You
- Distribute or Publicly Perform. You may not offer or impose any terms on
- the Work that restrict the terms of this License or the ability of the
- recipient of the Work to exercise the rights granted to that recipient
- under the terms of the License. You may not sublicense the Work. You
- must keep intact all notices that refer to this License and to the
- disclaimer of warranties with every copy of the Work You Distribute or
- Publicly Perform. When You Distribute or Publicly Perform the Work, You
- may not impose any effective technological measures on the Work that
- restrict the ability of a recipient of the Work from You to exercise the
- rights granted to that recipient under the terms of the License. This
- Section 4(a) applies to the Work as incorporated in a Collection, but
- this does not require the Collection apart from the Work itself to be
- made subject to the terms of this License. If You create a Collection,
- upon notice from any Licensor You must, to the extent practicable,
- remove from the Collection any credit as required by Section 4(b), as
- requested. If You create an Adaptation, upon notice from any Licensor
- You must, to the extent practicable, remove from the Adaptation any
- credit as required by Section 4(b), as requested.
- .
- b. If You Distribute, or Publicly Perform the Work or any Adaptations or
- Collections, You must, unless a request has been made pursuant to
- Section 4(a), keep intact all copyright notices for the Work and
- provide, reasonable to the medium or means You are utilizing: (i) the
- name of the Original Author (or pseudonym, if applicable) if supplied,
- and/or if the Original Author and/or Licensor designate another party or
- parties (e.g., a sponsor institute, publishing entity, journal) for
- attribution ("Attribution Parties") in Licensor's copyright notice,
- terms of service or by other reasonable means, the name of such party or
- parties; (ii) the title of the Work if supplied; (iii) to the extent
- reasonably practicable, the URI, if any, that Licensor specifies to be
- associated with the Work, unless such URI does not refer to the
- copyright notice or licensing information for the Work; and (iv) ,
- consistent with Section 3(b), in the case of an Adaptation, a credit
- identifying the use of the Work in the Adaptation (e.g., "French
- translation of the Work by Original Author," or "Screenplay based on
- original Work by Original Author"). The credit required by this Section
- 4 (b) may be implemented in any reasonable manner; provided, however,
- that in the case of a Adaptation or Collection, at a minimum such credit
- will appear, if a credit for all contributing authors of the Adaptation
- or Collection appears, then as part of these credits and in a manner at
- least as prominent as the credits for the other contributing authors.
- For the avoidance of doubt, You may only use the credit required by this
- Section for the purpose of attribution in the manner set out above and,
- by exercising Your rights under this License, You may not implicitly or
- explicitly assert or imply any connection with, sponsorship or
- endorsement by the Original Author, Licensor and/or Attribution Parties,
- as appropriate, of You or Your use of the Work, without the separate,
- express prior written permission of the Original Author, Licensor and/or
- Attribution Parties.
- .
- c. Except as otherwise agreed in writing by the Licensor or as may be
- otherwise permitted by applicable law, if You Reproduce, Distribute or
- Publicly Perform the Work either by itself or as part of any Adaptations
- or Collections, You must not distort, mutilate, modify or take other
- derogatory action in relation to the Work which would be prejudicial to
- the Original Author's honor or reputation. Licensor agrees that in those
- jurisdictions (e.g. Japan), in which any exercise of the right granted
- in Section 3(b) of this License (the right to make Adaptations) would be
- deemed to be a distortion, mutilation, modification or other derogatory
- action prejudicial to the Original Author's honor and reputation, the
- Licensor will waive or not assert, as appropriate, this Section, to the
- fullest extent permitted by the applicable national law, to enable You
- to reasonably exercise Your right under Section 3(b) of this License
- (right to make Adaptations) but not otherwise.
- .
- 5. Representations, Warranties and Disclaimer
- .
- UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING, LICENSOR
- OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY
- KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE,
- INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY,
- FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF
- LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS,
- WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE
- EXCLUSION OF IMPLIED WARRANTIES, SO SUCH EXCLUSION MAY NOT APPLY TO YOU.
- .
- 6. Limitation on Liability. EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE
- LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR
- ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES
- ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS
- BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
- .
- 7. Termination
- .
- a. This License and the rights granted hereunder will terminate
- automatically upon any breach by You of the terms of this License.
- Individuals or entities who have received Adaptations or Collections
- from You under this License, however, will not have their licenses
- terminated provided such individuals or entities remain in full
- compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will
- survive any termination of this License.
- .
- b. Subject to the above terms and conditions, the license granted here
- is perpetual (for the duration of the applicable copyright in the Work).
- Notwithstanding the above, Licensor reserves the right to release the
- Work under different license terms or to stop distributing the Work at
- any time; provided, however that any such election will not serve to
- withdraw this License (or any other license that has been, or is
- required to be, granted under the terms of this License), and this
- License will continue in full force and effect unless terminated as
- stated above.
- .
- 8. Miscellaneous
- .
- a. Each time You Distribute or Publicly Perform the Work or a
- Collection, the Licensor offers to the recipient a license to the Work
- on the same terms and conditions as the license granted to You under
- this License.
- .
- b. Each time You Distribute or Publicly Perform an Adaptation, Licensor
- offers to the recipient a license to the original Work on the same terms
- and conditions as the license granted to You under this License.
- .
- c. If any provision of this License is invalid or unenforceable under
- applicable law, it shall not affect the validity or enforceability of
- the remainder of the terms of this License, and without further action
- by the parties to this agreement, such provision shall be reformed to
- the minimum extent necessary to make such provision valid and
- enforceable.
- .
- d. No term or provision of this License shall be deemed waived and no
- breach consented to unless such waiver or consent shall be in writing
- and signed by the party to be charged with such waiver or consent. This
- License constitutes the entire agreement between the parties with
- respect to the Work licensed here. There are no understandings,
- agreements or representations with respect to the Work not specified
- here. Licensor shall not be bound by any additional provisions that may
- appear in any communication from You.
- .
- e. This License may not be modified without the mutual written agreement
- of the Licensor and You.
- .
- f. The rights granted under, and the subject matter referenced, in this
- License were drafted utilizing the terminology of the Berne Convention
- for the Protection of Literary and Artistic Works (as amended on
- September 28, 1979), the Rome Convention of 1961, the WIPO Copyright
- Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996 and
- the Universal Copyright Convention (as revised on July 24, 1971). These
- rights and subject matter take effect in the relevant jurisdiction in
- which the License terms are sought to be enforced according to the
- corresponding provisions of the implementation of those treaty
- provisions in the applicable national law. If the standard suite of
- rights granted under applicable copyright law includes additional rights
- not granted under this License, such additional rights are deemed to be
- included in the License; this License is not intended to restrict the
- license of any rights under applicable law.
- .
- Creative Commons Notice
- .
- Creative Commons is not a party to this License, and makes no warranty
- whatsoever in connection with the Work. Creative Commons will not be
- liable to You or any party on any legal theory for any damages
- whatsoever, including without limitation any general, special,
- incidental or consequential damages arising in connection to this
- license. Notwithstanding the foregoing two (2) sentences, if Creative
- Commons has expressly identified itself as the Licensor hereunder, it
- shall have all rights and obligations of Licensor.
- .
- Except for the limited purpose of indicating to the public that the Work
- is licensed under the CCPL, Creative Commons does not authorize the use
- by either party of the trademark "Creative Commons" or any related
- trademark or logo of Creative Commons without the prior written consent
- of Creative Commons. Any permitted use will be in compliance with
- Creative Commons' then-current trademark usage guidelines, as may be
- published on its website or otherwise made available upon request from
- time to time. For the avoidance of doubt, this trademark restriction
- does not form part of this License.
- .
- Creative Commons may be contacted at http://creativecommons.org/.
-
+License: GPL-3+
+ On Debian systems you can find a full copy of the GNU General Public
+ License version 3 at /usr/share/common-licenses/GPL-3
=====================================
debian/lrc.config
=====================================
@@ -0,0 +1,5 @@
+m4/ax_check_compile_flag.m4
+m4/ax_compiler_vendor.m4
+config.guess
+config.sub
+install-sh
=====================================
debian/patches/export-internal-symbols-for-pyhmmer.patch
=====================================
@@ -0,0 +1,544 @@
+Author: Andreas Tille <tille at debian.org>
+Description: Export internal sequence file parser functions used by pyhmmer
+ pyhmmer links its Cython extension modules against the shared
+ Easel library and re-exports a number of insertion points from
+ esl_sqio_ascii.c (the format-specific callbacks and the parser helpers shared
+ between the text formats) that upstream keeps private to that translation
+ unit. Remove the `static` storage class from them so that they become part
+ of the shared library ABI and can be resolved at link time.
+Author: Andreas Tille <tille at debian.org>
+Forwarded: not-needed
+Last-Update: 2026-11-12
+Assisted-By: DeepSeek V4.1 Flash Free
+
+--- a/esl_sqio_ascii.c
++++ b/esl_sqio_ascii.c
+@@ -36,66 +36,66 @@
+ #include "esl_ssi.h"
+
+ /* format specific routines */
+-static int sqascii_GuessFileFormat(ESL_SQFILE *sqfp, int *ret_fmt);
+-static int sqascii_Position (ESL_SQFILE *sqfp, off_t offset);
+-static void sqascii_Close (ESL_SQFILE *sqfp);
+-static int sqascii_SetDigital (ESL_SQFILE *sqfp, const ESL_ALPHABET *abc);
+-static int sqascii_GuessAlphabet (ESL_SQFILE *sqfp, int *ret_type);
+-static int sqascii_Read (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int sqascii_ReadInfo (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int sqascii_ReadSequence (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int sqascii_ReadWindow (ESL_SQFILE *sqfp, int C, int W, ESL_SQ *sq);
+-static int sqascii_ReadBlock (ESL_SQFILE *sqfp, ESL_SQ_BLOCK *sqBlock, int max_residues, int max_sequences, int max_init_window, int long_target);
+-static int sqascii_Echo (ESL_SQFILE *sqfp, const ESL_SQ *sq, FILE *ofp);
+-
+-static int sqascii_IsRewindable (const ESL_SQFILE *sqfp);
+-static const char *sqascii_GetError (const ESL_SQFILE *sqfp);
+-
+-static int sqascii_OpenSSI (ESL_SQFILE *sqfp, const char *ssifile_hint);
+-static int sqascii_PositionByKey (ESL_SQFILE *sqfp, const char *key);
+-static int sqascii_PositionByNumber(ESL_SQFILE *sqfp, int which);
+-static int sqascii_Fetch (ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq);
+-static int sqascii_FetchInfo (ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq);
+-static int sqascii_FetchSubseq (ESL_SQFILE *sqfp, const char *source, int64_t start, int64_t end, ESL_SQ *sq);
++int sqascii_GuessFileFormat(ESL_SQFILE *sqfp, int *ret_fmt);
++int sqascii_Position (ESL_SQFILE *sqfp, off_t offset);
++void sqascii_Close (ESL_SQFILE *sqfp);
++int sqascii_SetDigital (ESL_SQFILE *sqfp, const ESL_ALPHABET *abc);
++int sqascii_GuessAlphabet (ESL_SQFILE *sqfp, int *ret_type);
++int sqascii_Read (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int sqascii_ReadInfo (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int sqascii_ReadSequence (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int sqascii_ReadWindow (ESL_SQFILE *sqfp, int C, int W, ESL_SQ *sq);
++int sqascii_ReadBlock (ESL_SQFILE *sqfp, ESL_SQ_BLOCK *sqBlock, int max_residues, int max_sequences, int max_init_window, int long_target);
++int sqascii_Echo (ESL_SQFILE *sqfp, const ESL_SQ *sq, FILE *ofp);
++
++int sqascii_IsRewindable (const ESL_SQFILE *sqfp);
++const char *sqascii_GetError (const ESL_SQFILE *sqfp);
++
++int sqascii_OpenSSI (ESL_SQFILE *sqfp, const char *ssifile_hint);
++int sqascii_PositionByKey (ESL_SQFILE *sqfp, const char *key);
++int sqascii_PositionByNumber(ESL_SQFILE *sqfp, int which);
++int sqascii_Fetch (ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq);
++int sqascii_FetchInfo (ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq);
++int sqascii_FetchSubseq (ESL_SQFILE *sqfp, const char *source, int64_t start, int64_t end, ESL_SQ *sq);
+
+ /* Internal routines shared by parsers. */
+-static int loadmem (ESL_SQFILE *sqfp);
+-static int loadbuf (ESL_SQFILE *sqfp);
+-static int nextchar (ESL_SQFILE *sqfp, char *ret_c);
+-static int seebuf (ESL_SQFILE *sqfp, int64_t maxn, int64_t *opt_nres, int64_t *opt_endpos);
+-static void addbuf (ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nres);
+-static void skipbuf (ESL_SQFILE *sqfp, int64_t nskip);
+-static int read_nres(ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nskip, int64_t nres, int64_t *opt_actual_nres);
+-static int skip_whitespace(ESL_SQFILE *sqfp);
++int loadmem (ESL_SQFILE *sqfp);
++int loadbuf (ESL_SQFILE *sqfp);
++int nextchar (ESL_SQFILE *sqfp, char *ret_c);
++int seebuf (ESL_SQFILE *sqfp, int64_t maxn, int64_t *opt_nres, int64_t *opt_endpos);
++void addbuf (ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nres);
++void skipbuf (ESL_SQFILE *sqfp, int64_t nskip);
++int read_nres(ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nskip, int64_t nres, int64_t *opt_actual_nres);
++int skip_whitespace(ESL_SQFILE *sqfp);
+
+ /* EMBL format; also UniProt, TrEMBL */
+-static void config_embl(ESL_SQFILE *sqfp);
+-static void inmap_embl (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
+-static int header_embl(ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int skip_embl (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int end_embl (ESL_SQFILE *sqfp, ESL_SQ *sq);
++void config_embl(ESL_SQFILE *sqfp);
++void inmap_embl (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
++int header_embl(ESL_SQFILE *sqfp, ESL_SQ *sq);
++int skip_embl (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int end_embl (ESL_SQFILE *sqfp, ESL_SQ *sq);
+
+ /* GenBank format; also DDBJ */
+-static void config_genbank(ESL_SQFILE *sqfp);
+-static void inmap_genbank (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
+-static int header_genbank(ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int skip_genbank (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int end_genbank (ESL_SQFILE *sqfp, ESL_SQ *sq);
++void config_genbank(ESL_SQFILE *sqfp);
++void inmap_genbank (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
++int header_genbank(ESL_SQFILE *sqfp, ESL_SQ *sq);
++int skip_genbank (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int end_genbank (ESL_SQFILE *sqfp, ESL_SQ *sq);
+
+ /* FASTA format */
+-static void config_fasta(ESL_SQFILE *sqfp);
+-static void inmap_fasta (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
+-static int header_fasta(ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int skip_fasta (ESL_SQFILE *sqfp, ESL_SQ *sq);
+-static int end_fasta (ESL_SQFILE *sqfp, ESL_SQ *sq);
++void config_fasta(ESL_SQFILE *sqfp);
++void inmap_fasta (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
++int header_fasta(ESL_SQFILE *sqfp, ESL_SQ *sq);
++int skip_fasta (ESL_SQFILE *sqfp, ESL_SQ *sq);
++int end_fasta (ESL_SQFILE *sqfp, ESL_SQ *sq);
+
+ /* daemon format */
+-static void config_daemon(ESL_SQFILE *sqfp);
+-static void inmap_daemon (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
+-static int end_daemon (ESL_SQFILE *sqfp, ESL_SQ *sq);
++void config_daemon(ESL_SQFILE *sqfp);
++void inmap_daemon (ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap);
++int end_daemon (ESL_SQFILE *sqfp, ESL_SQ *sq);
+
+ /* HMMPGMD format */
+-static int fileheader_hmmpgmd(ESL_SQFILE *sqfp);
++int fileheader_hmmpgmd(ESL_SQFILE *sqfp);
+
+
+ /*****************************************************************
+@@ -369,7 +369,7 @@
+ *
+ * Throws: <eslEMEM> on allocation failure.
+ */
+-static int
++int
+ sqascii_GuessFileFormat(ESL_SQFILE *sqfp, int *ret_fmt)
+ {
+ int n = strlen(sqfp->filename);
+@@ -471,7 +471,7 @@
+ * On errors, the state of <sqfp> is indeterminate, and
+ * it should not be used again.
+ */
+-static int
++int
+ sqascii_Position(ESL_SQFILE *sqfp, off_t offset)
+ {
+ int status;
+@@ -527,7 +527,7 @@
+ *
+ * Returns: (void).
+ */
+-static void
++void
+ sqascii_Close(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -587,7 +587,7 @@
+ *
+ * Returns: <eslOK> on success.
+ */
+-static int
++int
+ sqascii_SetDigital(ESL_SQFILE *sqfp, const ESL_ALPHABET *abc)
+ {
+ int status = eslOK;
+@@ -642,7 +642,7 @@
+ * Throws: <eslEMEM> on allocation error;
+ * <eslEINCONCEIVABLE> on unimaginable internal errors.
+ */
+-static int
++int
+ sqascii_GuessAlphabet(ESL_SQFILE *sqfp, int *ret_type)
+ {
+ ESL_SQ *sq = NULL;
+@@ -693,7 +693,7 @@
+ * to an offset of zero), in order to read it a second
+ * time.
+ */
+-static int
++int
+ sqascii_IsRewindable(const ESL_SQFILE *sqfp)
+ {
+ if (sqfp->data.ascii.do_gzip == TRUE) return FALSE;
+@@ -708,7 +708,7 @@
+ * to an offset of zero), in order to read it a second
+ * time.
+ */
+-static const char *
++const char *
+ sqascii_GetError(const ESL_SQFILE *sqfp)
+ {
+ return sqfp->data.ascii.errbuf;
+@@ -739,7 +739,7 @@
+ * Throws: <eslEMEM> on allocation failure;
+ * <eslEINCONCEIVABLE> on internal error.
+ */
+-static int
++int
+ sqascii_Read(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -834,7 +834,7 @@
+ *
+ * Throws: <eslEMEM> on allocation error.
+ */
+-static int
++int
+ sqascii_ReadInfo(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -938,7 +938,7 @@
+ * Throws: <eslEMEM> on allocation failure;
+ * <eslEINCONCEIVABLE> on internal error.
+ */
+-static int
++int
+ sqascii_ReadSequence(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -1111,7 +1111,7 @@
+ *
+ * <eslEMEM> on allocation error.
+ */
+-static int
++int
+ sqascii_ReadWindow(ESL_SQFILE *sqfp, int C, int W, ESL_SQ *sq)
+ {
+ int actual_start;
+@@ -1452,7 +1452,7 @@
+ * Throws: <eslEMEM> on allocation failure;
+ * <eslEINCONCEIVABLE> on internal error.
+ */
+-static int
++int
+ sqascii_ReadBlock(ESL_SQFILE *sqfp, ESL_SQ_BLOCK *sqBlock, int max_residues, int max_sequences, int max_init_window, int long_target)
+ {
+ int i = 0;
+@@ -1635,7 +1635,7 @@
+ *
+ *
+ */
+-static int
++int
+ sqascii_Echo(ESL_SQFILE *sqfp, const ESL_SQ *sq, FILE *ofp)
+ {
+ int status;
+@@ -1733,7 +1733,7 @@
+ *
+ * Throws <eslEMEM> on allocation error.
+ */
+-static int
++int
+ sqascii_OpenSSI(ESL_SQFILE *sqfp, const char *ssifile_hint)
+ {
+ int status;
+@@ -1790,7 +1790,7 @@
+ * In all these cases, the state of <sqfp> becomes
+ * undefined, and the caller should not use it again.
+ */
+-static int
++int
+ sqascii_PositionByKey(ESL_SQFILE *sqfp, const char *key)
+ {
+ uint16_t fh;
+@@ -1838,7 +1838,7 @@
+ * In all these cases, the state of <sqfp> becomes
+ * undefined, and the caller should not use it again.
+ */
+-static int
++int
+ sqascii_PositionByNumber(ESL_SQFILE *sqfp, int which)
+ {
+ uint16_t fh;
+@@ -1870,7 +1870,7 @@
+ *
+ * Throws: <eslEMEM> on allocation error.
+ */
+-static int
++int
+ sqascii_Fetch(ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq)
+ {
+ int status;
+@@ -1901,7 +1901,7 @@
+ *
+ * Throws: <eslEMEM> on allocation error.
+ */
+-static int
++int
+ sqascii_FetchInfo(ESL_SQFILE *sqfp, const char *key, ESL_SQ *sq)
+ {
+ int status;
+@@ -1945,7 +1945,7 @@
+ *
+ * Throws: <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ sqascii_FetchSubseq(ESL_SQFILE *sqfp, const char *source, int64_t start, int64_t end, ESL_SQ *sq)
+ {
+ uint16_t fh;/* SSI file handle */
+@@ -2038,7 +2038,7 @@
+ * Returns <eslOK> (and mpos < mn) if new data is read.
+ * Throws <eslEMEM> on allocation error.
+ */
+-static int
++int
+ loadmem(ESL_SQFILE *sqfp)
+ {
+ void *tmp;
+@@ -2113,7 +2113,7 @@
+ * (sqfp->nc == 0 is the same as eslEOF: no data in the new buffer.)
+ * Can throw an <eslEMEM> error.
+ */
+-static int
++int
+ loadbuf(ESL_SQFILE *sqfp)
+ {
+ void *tmp;
+@@ -2188,7 +2188,7 @@
+ * Return <eslEOF> if we ran out of data in <sqfp>.
+ * May throw an <eslEMEM> error.
+ */
+-static int
++int
+ nextchar(ESL_SQFILE *sqfp, char *ret_c)
+ {
+ int status;
+@@ -2246,7 +2246,7 @@
+ * to make sure that <seebuf()> never counts the same byte twice (hence
+ * the need for the <maxn> limit, which ReadWindow() uses.)
+ */
+-static int
++int
+ seebuf(ESL_SQFILE *sqfp, int64_t maxn, int64_t *opt_nres, int64_t *opt_endpos)
+ {
+ int bpos;
+@@ -2332,7 +2332,7 @@
+ * sq->seq/dsq now holds <nres> new residues
+ * sq->n is incremented by <nres>
+ */
+-static void
++void
+ addbuf(ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nres)
+ {
+ ESL_DSQ x;
+@@ -2358,7 +2358,7 @@
+ * Like addbuf(), but we skip <nskip> residues instead of
+ * reading them.
+ */
+-static void
++void
+ skipbuf(ESL_SQFILE *sqfp, int64_t nskip)
+ {
+ ESL_DSQ x;
+@@ -2385,7 +2385,7 @@
+ * (3) end of file; return eslEOF.
+ *
+ */
+-static int
++int
+ skip_whitespace(ESL_SQFILE *sqfp)
+ {
+ int status;
+@@ -2455,7 +2455,7 @@
+ * ReadWindow() in reverse complement acts like a subseq fetch.
+ *
+ */
+-static int
++int
+ read_nres(ESL_SQFILE *sqfp, ESL_SQ *sq, int64_t nskip, int64_t nres, int64_t *opt_actual_nres)
+ {
+ int64_t n;
+@@ -2527,7 +2527,7 @@
+ * careful to only parse the conserved intersection of these two
+ * very similar formats.
+ */
+-static void
++void
+ config_embl(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -2539,7 +2539,7 @@
+ ascii->parse_end = &end_embl;
+ }
+
+-static void
++void
+ inmap_embl(ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap)
+ {
+ int x;
+@@ -2586,7 +2586,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ header_embl(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ char *s;
+@@ -2710,7 +2710,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ skip_embl(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -2749,7 +2749,7 @@
+ return eslOK;
+ }
+
+-static int
++int
+ end_embl(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -2776,7 +2776,7 @@
+ * ftp://ftp.ncbi.nih.gov/genbank/gbrel.txt
+ */
+
+-static void
++void
+ config_genbank(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -2788,7 +2788,7 @@
+ ascii->parse_end = &end_genbank;
+ }
+
+-static void
++void
+ inmap_genbank(ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap)
+ {
+ int x;
+@@ -2831,7 +2831,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ header_genbank(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ char *s;
+@@ -2896,7 +2896,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ skip_genbank(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -2928,7 +2928,7 @@
+ return eslOK;
+ }
+
+-static int
++int
+ end_genbank(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ int status;
+@@ -2950,7 +2950,7 @@
+ *# 9. Internal routines for FASTA format
+ *****************************************************************/
+
+-static void
++void
+ config_fasta(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -2962,7 +2962,7 @@
+ ascii->parse_end = &end_fasta;
+ }
+
+-static void
++void
+ inmap_fasta(ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap)
+ {
+ int x;
+@@ -3005,7 +3005,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ header_fasta(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ char c;
+@@ -3090,7 +3090,7 @@
+ *
+ * May also throw <eslEMEM> on allocation errors.
+ */
+-static int
++int
+ skip_fasta(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ char c;
+@@ -3129,7 +3129,7 @@
+ }
+
+
+-static int
++int
+ end_fasta(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -3194,7 +3194,7 @@
+ * an option, since the daemon might run continuously.
+ */
+
+-static void
++void
+ config_daemon(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
+@@ -3206,7 +3206,7 @@
+ ascii->parse_end = &end_daemon;
+ }
+
+-static void
++void
+ inmap_daemon(ESL_SQFILE *sqfp, const ESL_DSQ *abc_inmap)
+ {
+ int x;
+@@ -3236,7 +3236,7 @@
+ * The use case is were the sequences are being read from a pipe and a
+ * way is needed to signal the end of the sequence so it can be processed.
+ */
+-static int
++int
+ end_daemon(ESL_SQFILE *sqfp, ESL_SQ *sq)
+ {
+ char c;
+@@ -3375,7 +3375,7 @@
+ *# 11. Internal routines for HMMPGMD format
+ *****************************************************************/
+
+-static int
++int
+ fileheader_hmmpgmd(ESL_SQFILE *sqfp)
+ {
+ ESL_SQASCII_DATA *ascii = &sqfp->data.ascii;
=====================================
debian/patches/series
=====================================
@@ -1,3 +1,4 @@
mans.patch
docs.patch
spelling.patch
+export-internal-symbols-for-pyhmmer.patch
=====================================
debian/rules
=====================================
@@ -43,9 +43,6 @@ override_dh_auto_build:
$(MAKE) -C documentation pdf || { grep -n -A5 '^!' documentation/latex.log; exit 1; }
chmod a-x devkit/cexcerpt
-override_dh_auto_test:
- $(MAKE) tests
-
override_dh_auto_install:
dh_auto_install
install -d debian/tmp/usr/lib/$(MULTIARCH)/pkgconfig debian/tmp/usr/include/easel
View it on GitLab: https://salsa.debian.org/med-team/easel/-/compare/45cf4bebfde6c76a4e45ae441bbbd44ed9cc4f74...b6d3867e39a4cf6383380713590795a0027b4b42
--
View it on GitLab: https://salsa.debian.org/med-team/easel/-/compare/45cf4bebfde6c76a4e45ae441bbbd44ed9cc4f74...b6d3867e39a4cf6383380713590795a0027b4b42
You're receiving this email because of your account on salsa.debian.org. Manage all notifications: https://salsa.debian.org/-/profile/notifications | Help: https://salsa.debian.org/help
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/debian-med-commit/attachments/20261112/1bd8fef6/attachment-0001.htm>
More information about the debian-med-commit
mailing list