---
- branch: MAIN
  date: Sat May 18 18:32:19 UTC 2013
  files:
  - new: '1.28'
    old: '1.27'
    path: pkgsrc/math/ntl/Makefile
    pathrev: pkgsrc/math/ntl/Makefile@1.28
    type: modified
  - new: '1.9'
    old: '1.8'
    path: pkgsrc/math/ntl/buildlink3.mk
    pathrev: pkgsrc/math/ntl/buildlink3.mk@1.9
    type: modified
  - new: '1.8'
    old: '1.7'
    path: pkgsrc/math/ntl/distinfo
    pathrev: pkgsrc/math/ntl/distinfo@1.8
    type: modified
  - new: '1.8'
    old: '1.7'
    path: pkgsrc/math/ntl/patches/patch-aa
    pathrev: pkgsrc/math/ntl/patches/patch-aa@1.8
    type: modified
  id: 20130518T183219Z.1b0e03a38b9c24320bf2cb2bfae78fbb2aefa892
  log: "Update math/ntl to version 6.0.0\n\nDifferences from previous version (5.5.2):\n\n\t2013.02.15:
    Changes between NTL 5.5.2 and 6.0\n\n\tReplaced the old template-like macros for
    vectors, matrices, and pairs\n\twith true template classes:  Vec<T>, Mat<T>, and
    Pair<S,T>.  For\n\tbackwards compatibilty, all the names that were used in previous\n\tversions
    (e.g., vec_ZZ_p, mat_ZZ_p) have been replaced with\n\tappropriate typedefs.\n\n\tFor
    many years, I resisted the temptation of using templates, because\n\tcompiler
    support was very inconsistent.  But that no longer seems to\n\tbe the case.\n\n\tThis
    change, while rather sweeping, should create very few, if any,\n\tincompatibilities
    with existing software.  The biggest issue would be\n\tfor software that uses
    the old template-like macros:  such macro\n\tinvocations can simply be replaced
    with appropriate typedefs.\n\n\tMade the conversion interface more complete and
    uniform.  Also, using\n\ttemplate notation, one can and should now write conv<ZZ>(a)
    instead of\n\tto_ZZ(a) (for backward compatibility, all the old names to_XXX are\n\tstill
    there, but many new conversions are not available under these\n\told names).  There
    are many new conversions provided.  Moreover,\n\twhenever there is a conversion
    from a ring R to a ring S, there is a\n\tcorresponding, coefficiet-wise conversion
    from the polynomial ring\n\tR[X] to the polynomial ring R[X].\n\n\tIn addition,
    using the template mechanism, there are generic\n\tconversions for vectors and
    matrices.  For example, if there is a\n\tconversion from S to T, then there is
    automatically a corresponding\n\tcomponent-wise conversion from Vec<S> to Vec<T>.\n\n\tIntroduced
    a more general mechanism for accessing GF2's in packed\n\tstructures via indexing
    (see the class ref_GF2 in the GF2 module).\n\tEmployed ideas from David Harvey
    to make the single-precision FFT\n\tfaster (about twice as fast in many cases).
    \ This speeds up many\n\thigher-level operations.\n\n\tFixed all known bugs.\n"
  module: pkgsrc
  subject: 'CVS commit: pkgsrc/math/ntl'
  unixtime: '1368901939'
  user: agc