[gentoo-commits] gentoo-x86 commit in dev-libs/libtommath: metadata.xml ChangeLog

[Jorge Manuel B. S. Vicetto (jmbsvicetto)]

jmbsvicetto    09/03/22 04:10:57

  Modified:             metadata.xml ChangeLog
  Log:
  Removing hawking as a maintainer since he was retired.
  (Portage version: 2.2_rc26/cvs/Linux x86_64)

Revision  Changes    Path
1.4                  dev-libs/libtommath/metadata.xml

file : http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/metadata.xml?rev=1.4&view=markup
plain: http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/metadata.xml?rev=1.4&content-type=text/plain
diff : http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/metadata.xml?r1=1.3&r2=1.4

Index: metadata.xml
===================================================================
RCS file: /var/cvsroot/gentoo-x86/dev-libs/libtommath/metadata.xml,v
retrieving revision 1.3
retrieving revision 1.4
diff -u -r1.3 -r1.4
--- metadata.xml	25 Sep 2008 14:44:03 -0000	1.3
+++ metadata.xml	22 Mar 2009 04:10:56 -0000	1.4
@@ -1,62 +1,61 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
 <pkgmetadata>
-<herd>no-herd</herd>
-<maintainer>
-    <email>hawking@g.o</email>
-    <name>Ali Polatel</name>
-</maintainer>
-<longdescription>
-LibTomMath is a free open source portable number theoretic multiple-precision 
-integer library written entirely in C. (phew!). The library is designed to 
-provide a simple to work with API that provides fairly efficient routines that 
-build out of the box without configuration.
+  <herd>no-herd</herd>
+  <maintainer>
+    <email>maintainer-needed@g.o</email>
+  </maintainer>
+  <longdescription>
+    LibTomMath is a free open source portable number theoretic multiple-precision 
+    integer library written entirely in C. (phew!). The library is designed to 
+    provide a simple to work with API that provides fairly efficient routines that 
+    build out of the box without configuration.
 
-The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ 
-v6.00 [with SP5] without configuration. The source code is arranged to make it 
-easy to dive into a particular area very quickly. The code is also littered with 
-comments [This is one of the on going goals] that help explain the algorithms and 
-their implementations. Ideally the code will serve as an educational tool in the 
-future for CS students studying number theory.
+    The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ 
+    v6.00 [with SP5] without configuration. The source code is arranged to make it 
+    easy to dive into a particular area very quickly. The code is also littered with 
+    comments [This is one of the on going goals] that help explain the algorithms and 
+    their implementations. Ideally the code will serve as an educational tool in the 
+    future for CS students studying number theory.
 
-The library provides a vast array of highly optimized routines from various 
-branches of number theory.
+    The library provides a vast array of highly optimized routines from various 
+    branches of number theory.
 
-    * Simple Algebraic
-          o Addition
-          o Subtraction
-          o Multiplication
-          o Squaring
-          o Division 
-    * Digit Manipulation
-          o Shift left/right whole digits (mult by 2b by moving digits)
-          o Fast multiplication/division by 2 and 2k for k>1
-          o Binary AND, OR and XOR gates 
-    * Modular Reductions
-          o Barrett Reduction (fast for any p)
-          o Montgomery Reduction (faster for any odd p)
-          o DR Reduction (faster for any restricted p see manual)
-          o 2k Reduction (fast reduction modulo 2p - k)
-          o The exptmod logic can use any of the four reduction algorithms when 
-appropriate with a single function call. 
-    * Number Theoretic
-          o Greatest Common Divisor
-          o Least Common Multiple
-          o Jacobi Symbol Computation (falls back to Legendre for prime moduli)
-          o Multiplicative Inverse
-          o Extended Euclidean Algorithm
-          o Modular Exponentiation
-          o Fermat and Miller-Rabin Primality Tests, utility function such as 
-is_prime and next_prime 
-    * Miscellaneous
-          o Root finding over Z
-          o Pseudo-random integers
-          o Signed and Unsigned comparisons 
-    * Optimizations
-          o Fast Comba based Multiplier, Squaring and Montgomery routines.
-          o Montgomery, Diminished Radix and Barrett based modular 
-exponentiation.
-          o Karatsuba and Toom-Cook multiplication algorithms.
-          o Many pointer aliasing optimiztions throughout the entire library. 
-</longdescription>
+      * Simple Algebraic
+            o Addition
+            o Subtraction
+            o Multiplication
+            o Squaring
+            o Division 
+      * Digit Manipulation
+            o Shift left/right whole digits (mult by 2b by moving digits)
+            o Fast multiplication/division by 2 and 2k for k>1
+            o Binary AND, OR and XOR gates 
+      * Modular Reductions
+            o Barrett Reduction (fast for any p)
+            o Montgomery Reduction (faster for any odd p)
+            o DR Reduction (faster for any restricted p see manual)
+            o 2k Reduction (fast reduction modulo 2p - k)
+            o The exptmod logic can use any of the four reduction algorithms when 
+              appropriate with a single function call. 
+      * Number Theoretic
+            o Greatest Common Divisor
+            o Least Common Multiple
+            o Jacobi Symbol Computation (falls back to Legendre for prime moduli)
+            o Multiplicative Inverse
+            o Extended Euclidean Algorithm
+            o Modular Exponentiation
+            o Fermat and Miller-Rabin Primality Tests, utility function such as 
+              is_prime and next_prime 
+      * Miscellaneous
+            o Root finding over Z
+            o Pseudo-random integers
+            o Signed and Unsigned comparisons 
+      * Optimizations
+            o Fast Comba based Multiplier, Squaring and Montgomery routines.
+            o Montgomery, Diminished Radix and Barrett based modular 
+              exponentiation.
+            o Karatsuba and Toom-Cook multiplication algorithms.
+            o Many pointer aliasing optimiztions throughout the entire library. 
+  </longdescription>
 </pkgmetadata>



1.25                 dev-libs/libtommath/ChangeLog

file : http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/ChangeLog?rev=1.25&view=markup
plain: http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/ChangeLog?rev=1.25&content-type=text/plain
diff : http://sources.gentoo.org/viewcvs.py/gentoo-x86/dev-libs/libtommath/ChangeLog?r1=1.24&r2=1.25

Index: ChangeLog
===================================================================
RCS file: /var/cvsroot/gentoo-x86/dev-libs/libtommath/ChangeLog,v
retrieving revision 1.24
retrieving revision 1.25
diff -u -r1.24 -r1.25
--- ChangeLog	25 Sep 2008 14:44:03 -0000	1.24
+++ ChangeLog	22 Mar 2009 04:10:56 -0000	1.25
@@ -1,6 +1,10 @@
 # ChangeLog for dev-libs/libtommath
-# Copyright 1999-2008 Gentoo Foundation; Distributed under the GPL v2
-# $Header: /var/cvsroot/gentoo-x86/dev-libs/libtommath/ChangeLog,v 1.24 2008/09/25 14:44:03 hawking Exp $
+# Copyright 1999-2009 Gentoo Foundation; Distributed under the GPL v2
+# $Header: /var/cvsroot/gentoo-x86/dev-libs/libtommath/ChangeLog,v 1.25 2009/03/22 04:10:56 jmbsvicetto Exp $
+
+  22 Mar 2009; Jorge Manuel B. S. Vicetto <jmbsvicetto@g.o>
+  metadata.xml:
+  Removing hawking as a maintainer since he was retired.
 
   25 Sep 2008; Ali Polatel <hawking@g.o> metadata.xml:
   Add myself to metadata.xml.