Fix breakage after CLN update.

(asau)

Added games/rftg version 0.5.2

(wiz)

+ rftg.

(wiz)

Initial import of rftg-0.5.2:
This is a program to play Race for the Galaxy against AI players.

Status:

Vendor Tag: TNF
Release Tags: pkgsrc-20090906

(wiz)

fix PLIST breakage on Linux

(tnn)

Updated net/ntp4 to 4.2.4p7

(tnn)

NTP 4.2.4p7, 2009/05/04
Focus: Security and Bug Fixes
Severity: HIGH
This release fixes the following high-severity vulnerability:
* [Sec 1151] Remote exploit if autokey is enabled.  CVE-2009-1252
  See http://support.ntp.org/security for more information.
  If autokey is enabled (if ntp.conf contains a "crypto pw whatever"
  line) then a carefully crafted packet sent to the machine will cause
  a buffer overflow and possible execution of injected code, running
  with the privileges of the ntpd process (often root).
  Credit for finding this vulnerability goes to Chris Ries of CMU.
This release fixes the following low-severity vulnerabilities:
* [Sec 1144] limited (two byte) buffer overflow in ntpq.  CVE-2009-0159
  Credit for finding this vulnerability goes to Geoff Keating of Apple.
* [Sec 1149] use SO_EXCLUSIVEADDRUSE on Windows
  Credit for finding this issue goes to Dave Hart.
This release fixes a number of bugs and adds some improvements:
* Improved logging
* Fix many compiler warnings
* Many fixes and improvements for Windows
* Adds support for AIX 6.1
* Resolves some issues under MacOS X and Solaris

(tnn)

Updated audio/speex to 1.2rc1nb1

(obache)

Fixes my account name.

(obache)

Prevent override PKGCONFIG_OVERRIDE and make to override linker flag
in speex.pc again.

Bump PKGREVISION.

(obache)

Make it build on DragonFly and probably some others.

(hasso)

Remove todo on jabberd2 -> 2.2.9.

(schnoebe)

Update chat/jabberd2 to 2.2.9

(schnoebe)

bring jabberd2 up to 2.2.9. From the changelog:

What changed:
- Implemented component clustering
- Many virtual hosts in one SM process
- FreeBSD kqueue support
- Implemented PBX integration interface
- crypt() password support for LDAP backend

There is new <local/> section in sm.xml. You may use it to configure
domains serviced by the SM process. Old style domain name in <id/>
section still works for backward compatibility, but the <local/>
section overrides it.  You need to give different <id/> names to
SM instances participating in clustering. Router needs a way to
differenciate these.

There is new <pbx/> section in c2s.xml configuration file. Please
see it if you want to use the PBX integration.

Packaging changes:
    added PKG_OPTIONS_GROUP.mio to control the choice of I/O modules.
    Defaulting to mio-select and mio-poll, which are known to work  with
    NetBSD > 4.0.

(schnoebe)

Note update of www/opengoo package to 1.5.3nb1.

(taca)

Distfile was changed without announce nor changing file name.

It seems that one typo was fixed in
application/controllers/ToolController.class.php.

Introduce DIST_SUBDIR and bump PKGREVISION.  Should be fix PR pkg/41999.

(taca)

Updated graphics/ruby-RMagick to 2.11.1

(obache)

Update RMagick to 2.11.1.

Changes:
RMagick 2.11.1
    o Applied Alexey Borzenkov's mingw patches to extconf.rb.
    o Fixed a bug in Magick.trace_proc that could cause a segv at program exit
      with Ruby 1.9.1 (bug report by Larry Young)
    o Added new CompressionType enum values ZipSCompression, PixCompression,
      Pxr24Compression, B44Compression, B44ACompression (available in
      ImageMagick 6.5.5-4)

(obache)

Updated sysutils/duplicity to 0.5.20

(tnn)

Update to duplicity-0.5.20:
New in v0.5.20 (2009/08/28)
---------------------------
Bugs fixed this release:
408059  Failure due to _logger.log failure for content with special
        characters: TypeError decoding Unicode not supported
412667  "duplicity remove-older-than" asks for passphrase even though
        not required
418170  [PATCH] file names longer then 512 symbols are not supported

New in v0.5.19 (2009/08/06)
---------------------------
Fixed problem where Cygwin was returning -1 for the
hard max open file limit.
On process that complete before waitpid(), log them
and return zero as the process return status.
Make sure 'invalid packet (ctb=14)' from gpg is not
a fatal error.
Copy changes from trunk for duplicity translation.
Allow handling of unicode filenames in log messages.
Ignore unicode() translation errors in log messsages.

(tnn)

NetBSD-current's unzip(1) doesn't appear to look for a zip header anywhere
but byte offset 0. Remove junk header manually until it can be fixed.

(tnn)

Update to dhcpcd-ui-0.4.2

Icons are now built for distribution, so no dependency on SVG -> PNG apps.
Fix compile on NetBSD-4, PR pkg/41980.

(roy)

Updated net/dnsmasq to 2.50

(roy)

Bump to dnsmasq-2.50

Fixes CVE 2009-2957 and CVE 2009-2958

(roy)

Update lang/coq to 8.2pl1

(tonio)

Update lang/coq to 8.2pl1

Changes from V8.1 to V8.2
=========================

Language

- If a fixpoint is not written with an explicit { struct ... }, then
  all arguments are tried successively (from left to right) until one is
  found that satisfies the structural decreasing condition.
- New experimental typeclass system giving ad-hoc polymorphism and
  overloading based on dependent records and implicit arguments.
- New syntax "let 'pat := b in c" for let-binding using irrefutable patterns.
- New syntax "forall {A}, T" for specifying maximally inserted implicit
  arguments in terms.
- Sort of Record/Structure, Inductive and CoInductive defaults to Type
  if omitted.
- Support for optional "where" notation clauses for record fields.
- (Co)Inductive types can be defined as records
  (e.g. "CoInductive stream := { hd : nat; tl : stream }.")
- New syntax "Theorem id1:t1 ... with idn:tn" for proving mutually dependent
  statements.
- Support for sort-polymorphism on constants denoting inductive types.
- Several evolutions of the module system (handling of module aliases,
  functorial module types, an Include feature, etc).
- Prop now a subtype of Set (predicative and impredicative forms).
- Recursive inductive types in Prop with a single constructor of which
  all arguments are in Prop is now considered to be a singleton
  type. It consequently supports all eliminations to Prop, Set and Type.
  As a consequence, Acc_rect has now a more direct proof [possible source
  of easily fixed incompatibility in case of manual definition of a recursor
  in a recursive singleton inductive type].
- New syntax to do implicit generalization in binders and inside terms.
- New tentative syntax for introduction of record objects without mentioning
  the constructor {| field := body; ... |}, turning missing fields into holes
  (compatible with refine and Program).

Vernacular commands

- Added option Global to "Arguments Scope" for section surviving.
- Added option "Unset Elimination Schemes" to deactivate the automatic
  generation of elimination schemes.
- Modification of the Scheme command so you can ask for the name to be
  automatically computed (e.g. Scheme Induction for nat Sort Set).
- New command "Combined Scheme" to build combined mutual induction
  principles from existing mutual induction principles.
- New command "Scheme Equality" to build a decidable (boolean) equality
  for simple inductive datatypes and a decision property over this equality
  (e.g.  Scheme Equality for nat).
- Added option "Set Equality Scheme" to make automatic the declaration
  of the boolean equality when possible.
- Source of universe inconsistencies now printed when option
  "Set Printing Universes" is activated.
- New option "Set Printing Existential Instances" for making the display of
  existential variable instances explicit.
- Support for option "[id1 ... idn]", and "-[id1 ... idn]", for the
  "compute"/"cbv" reduction strategy, respectively meaning reduce only, or
  everything but, the constants id1 ... idn. "lazy" alone or followed by
  "[id1 ... idn]", and "-[id1 ... idn]" also supported, meaning apply
  all of beta-iota-zeta-delta, possibly restricting delta.
- New command "Strategy" to control the expansion of constants during
  conversion tests. It generalizes commands Opaque and Transparent by
  introducing a range of levels. Lower levels are assigned to constants
  that should be expanded first.
- New options Global and Local to Opaque and Transparent.
- New command "Print Assumptions" to display all variables, parameters
  or axioms a theorem or definition relies on.
- "Add Rec LoadPath" now provides references to libraries using partially
  qualified names (this holds also for coqtop/coqc option -R).
- SearchAbout supports negated search criteria, reference to logical objects
  by their notation, and more generally search of subterms.
- "Declare ML Module" now allows to import .cmxs files when Coq is
  compiled in native code with a version of OCaml that supports native
  Dynlink (>= 3.11).
- New command "Create HintDb name [discriminated]" to explicitely declare
  a new hint database and optionaly turn on a discrimination net
  implementation to index all the lemmas in the database.
- New commands "Hint Transparent" and "Hint Opaque" to set the unfolding
  status of definitions used by auto. This information is taken into account
  by the discrimination net and the unification algorithm.
- "Hint Extern" now takes an optional pattern and applies the given tactic
  all the time if no pattern is given.
- Specific sort constraints on Record now taken into account.
- "Print LoadPath" supports a path argument to filter the display.

Libraries

- Several parts of the libraries are now in Type, in particular FSets,
  SetoidList, ListSet, Sorting, Zmisc. This may induce a few
  incompatibilities. In case of trouble while fixing existing development,
  it may help to simply declare Set as an alias for Type (see file
  SetIsType).
- New arithmetical library in theories/Numbers. It contains:
  * an abstract modular development of natural and integer arithmetics
    in Numbers/Natural/Abstract and Numbers/Integer/Abstract
  * an implementation of efficient computational bounded and unbounded
    integers that can be mapped to processor native arithmetics.
    See Numbers/Cyclic/Int31 for 31-bit integers and Numbers/Natural/BigN
    for unbounded natural numbers and Numbers/Integer/BigZ for unbounded
    integers.
  * some proofs that both older libraries Arith, ZArith and NArith and
    newer BigN and BigZ implement the abstract modular development.
    This allows in particular BigN and BigZ to already come with a
    large database of basic lemmas and some generic tactics (ring),
  This library has still an experimental status, as well as the
  processor-acceleration mechanism, but both its abstract and its
  concrete parts are already quite usable and could challenge the use
  of nat, N and Z in actual developments. Moreover, an extension of
  this framework to rational numbers is ongoing, and an efficient
  Q structure is already provided (see Numbers/Rational/BigQ), but
  this part is currently incomplete (no abstract layer and generic
  lemmas).
- Many changes in FSets/FMaps. In practice, compatibility with earlier
  version should be fairly good, but some adaptations may be required.
  * Interfaces of unordered ("weak") and ordered sets have been factorized
    thanks to new features of Coq modules (in particular Include), see
    FSetInterface. Same for maps. Hints in these interfaces have been
    reworked (they are now placed in a "set" database).
  * To allow full subtyping between weak and ordered sets, a field
    "eq_dec" has been added to OrderedType. The old version of OrderedType
    is now called MiniOrderedType and functor MOT_to_OT allow to
    convert to the new version. The interfaces and implementations
    of sets now contain also such a "eq_dec" field.
  * FSetDecide, contributed by Aaron Bohannon, contains a decision
    procedure allowing to solve basic set-related goals (for instance,
    is a point in a particular set ?). See FSetProperties for examples.
  * Functors of properties have been improved, especially the ones about
    maps, that now propose some induction principles. Some properties
    of fold need less hypothesis.
  * More uniformity in implementations of sets and maps: they all use
    implicit arguments, and no longer export unnecessary scopes (see
    bug #1347)
  * Internal parts of the implementations based on AVL have evolved a
    lot. The main files FSetAVL and FMapAVL are now much more
    lightweight now. In particular, minor changes in some functions
    has allowed to fully separate the proofs of operational
    correctness from the proofs of well-balancing: well-balancing is
    critical for efficiency, but not anymore for proving that these
    trees implement our interfaces, hence we have moved these proofs
    into appendix files FSetFullAVL and FMapFullAVL. Moreover, a few
    functions like union and compare have been modified in order to be
    structural yet efficient. The appendix files also contains
    alternative versions of these few functions, much closer to the
    initial Ocaml code and written via the Function framework.
- Library IntMap, subsumed by FSets/FMaps, has been removed from
  Coq Standard Library and moved into a user contribution Cachan/IntMap
- Better computational behavior of some constants (eq_nat_dec and
  le_lt_dec more efficient, Z_lt_le_dec and Positive_as_OT.compare
  transparent, ...) (exceptional source of incompatibilities).
- Boolean operators moved from module Bool to module Datatypes (may need
  to rename qualified references in script and force notations || and &&
  to be at levels 50 and 40 respectively).
- The constructors xI and xO of type positive now have postfix notations
  "~1" and "~0", allowing to write numbers in binary form easily, for instance
  6 is 1~1~0 and 4*p is p~0~0 (see BinPos.v).
- Improvements to NArith (Nminus, Nmin, Nmax), and to QArith (in particular
  a better power function).
- Changes in ZArith: several additional lemmas (used in theories/Numbers),
  especially in Zdiv, Znumtheory, Zpower. Moreover, many results in
  Zdiv have been generalized: the divisor may simply be non-null
  instead of strictly positive (see lemmas with name ending by
  "_full"). An alternative file ZOdiv proposes a different behavior
  (the one of Ocaml) when dividing by negative numbers.
- Changes in Arith: EqNat and Wf_nat now exported from Arith, some
  constructions on nat that were outside Arith are now in (e.g. iter_nat).
- In SetoidList, eqlistA now expresses that two lists have similar elements
  at the same position, while the predicate previously called eqlistA
  is now equivlistA (this one only states that the lists contain the same
  elements, nothing more).
- Changes in Reals:
  * Most statement in "sigT" (including the
    completeness axiom) are now in "sig" (in case of incompatibility,
    use proj1_sig instead of projT1, sig instead of sigT, etc).
  * More uniform naming scheme (identifiers in French moved to English,
    consistent use of 0 -- zero -- instead of O -- letter O --, etc).
  * Lemma on prod_f_SO is now on prod_f_R0.
  * Useless hypothesis of ln_exists1 dropped.
  * New Rlogic.v states a few logical properties about R axioms.
  * RIneq.v extended and made cleaner.
- Slight restructuration of the Logic library regarding choice and classical
  logic. Addition of files providing intuitionistic axiomatizations of
  descriptions: Epsilon.v, Description.v and IndefiniteDescription.v.
- Definition of pred and minus made compatible with the structural
  decreasing criterion for use in fixpoints.
- Files Relations/Rstar.v and Relations/Newman.v moved out to the user
  contribution repository (contribution CoC_History). New lemmas about
  transitive closure added and some bound variables renamed (exceptional
  risk of incompatibilities).

Notations, coercions, implicit arguments and type inference

- More automation in the inference of the return clause of dependent
  pattern-matching problems.
- Experimental allowance for omission of the clauses easily detectable as
  impossible in pattern-matching problems.
- Improved inference of implicit arguments, now working inside record
  declarations.
- New options "Set Maximal Implicit Insertion", "Set Reversible Pattern
  Implicit", "Set Strongly Strict Implicit" and "Set Printing Implicit
  Defensive" for controlling inference and use of implicit arguments.
- New modifier in "Implicit Arguments" to force an implicit argument to
  be maximally inserted.
- New options Global and Local to "Implicit Arguments" for section
  surviving or non export outside module.
- Level "constr" moved from 9 to 8.
- Structure/Record now printed as Record (unless option Printing All is set).
- Support for parametric notations defining constants.
- Insertion of coercions below product types refrains to unfold
  constants (possible source of incompatibility).
- New support for fix/cofix in notations.

Tactic Language

- Second-order pattern-matching now working in Ltac "match" clauses
  (syntax for second-order unification variable is "@?X").
- Support for matching on let bindings in match context using syntax
  "H := body" or "H := body : type".
- (?X ?Y) patterns now match any application instead of only unary
  applications (possible source of incompatibility).
- Ltac accepts integer arguments (syntax is "ltac:nnn" for nnn an integer).
- The general sequence tactical "expr_0 ; [ expr_1 | ... | expr_n ]"
  is extended so that at most one expr_i may have the form "expr .."
  or just "..". Also, n can be different from the number of subgoals
  generated by expr_0. In this case, the value of expr (or idtac in
  case of just "..") is applied to the intermediate subgoals to make
  the number of tactics equal to the number of subgoals.
- A name used as the name of the parameter of a lemma (like f in
  "apply f_equal with (f:=t)") is now interpreted as a ltac variable
  if such a variable exists (this is a possible source of
  incompatibility and it can be fixed by renaming the variables of a
  ltac function into names that do not clash with the lemmas
  parameter names used in the tactic).
- New syntax "Ltac tac ::= ..." to rebind a tactic to a new expression.
- "let rec ... in ... " now supported for expressions without explicit
  parameters; interpretation is lazy to the contrary of "let ... in ...";
  hence, the "rec" keyword can be used to turn the argument of a
  "let ... in ..." into a lazy one.
- Patterns for hypotheses types in "match goal" are now interpreted in
  type_scope.
- A bound variable whose name is not used elsewhere now serves as
  metavariable in "match" and it gets instantiated by an identifier
  (allow e.g. to extract the name of a statement like "exists x, P x").
- New printing of Ltac call trace for better debugging.
- The C-zar (formerly know as declarative) proof language is now properly
  documented.

Tactics

- New tactics "apply -> term", "apply <- term", "apply -> term in
  ident", "apply <- term in ident" for applying equivalences (iff).
- "apply" and "rewrite" now take open terms (terms with undefined existentials)
  as input.
- Slight improvement of the hnf and simpl tactics when applied on
  expressions with explicit occurrences of match or fix.
- New tactics "eapply in", "erewrite", "erewrite in".
- New tactics "ediscriminate", "einjection", "esimplify_eq".
- Tactics "discriminate", "injection", "simplify_eq" now support any
  term as argument. Clause "with" is also supported.
- Unfoldable references can be given by notation's string rather than by name
  in unfold.
- The "with" arguments are now typed using informations from the current goal:
  allows support for coercions and more inference of implicit arguments.
- Application of "f_equal"-style lemmas works better.
- Tactics elim, case, destruct and induction now support variants eelim,
  ecase, edestruct and einduction.
- Tactics destruct and induction now support the "with" option and the
  "in" clause option. If the option "in" is used, an equality is added
  to remember the term to which the induction or case analysis applied
  (possible source of parsing incompatibilities when destruct or induction is
  part of a let-in expression in Ltac; extra parentheses are then required).
- New support for "as" clause in tactics "apply in" and "eapply in".
- Some new intro patterns:
  * intro pattern "?A" genererates a fresh name based on A.
    Caveat about a slight loss of compatibility:
    Some intro patterns don't need space between them. In particular
    intros ?a?b used to be legal and equivalent to intros ? a ? b. Now it
    is still legal but equivalent to intros ?a ?b.
  * intro pattern "(A & ... & Y & Z)" synonym to "(A,....,(Y,Z)))))"
    for right-associative constructs like /\ or exists.
- Several syntax extensions concerning "rewrite":
  * "rewrite A,B,C" can be used to rewrite A, then B, then C. These rewrites
    occur only on the first subgoal: in particular, side-conditions of the
    "rewrite A" are not concerned by the "rewrite B,C".
  * "rewrite A by tac" allows to apply tac on all side-conditions generated by
    the "rewrite A".
  * "rewrite A at n" allows to select occurrences to rewrite: rewrite only
    happen at the n-th exact occurrence of the first successful matching of
    A in the goal.
  * "rewrite 3 A" or "rewrite 3!A" is equivalent to "rewrite A,A,A".
  * "rewrite !A" means rewriting A as long as possible (and at least once).
  * "rewrite 3?A" means rewriting A at most three times.
  * "rewrite ?A" means rewriting A as long as possible (possibly never).
  * many of the above extensions can be combined with each other.
- Introduction patterns better respect the structure of context in presence of
  missing or extra names in nested disjunction-conjunction patterns [possible
  source of rare incompatibilities].
- New syntax "rename a into b, c into d" for "rename a into b; rename c into d"
- New tactics "dependent induction/destruction H [ generalizing id_1 .. id_n ]"
  to do induction-inversion on instantiated inductive families ? la BasicElim.
- Tactics "apply" and "apply in" now able to reason modulo unfolding of
  constants (possible source of incompatibility in situations where apply
  may fail, e.g. as argument of a try or a repeat and in a ltac function);
  versions that do not unfold are renamed into "simple apply" and
  "simple apply in" (usable for compatibility or for automation).
- Tactics "apply" and "apply in" now able to traverse conjunctions and to
  select the first matching lemma among the components of the conjunction;
  tactic "apply" also able to apply lemmas of conclusion an empty type.
- Tactic "apply" now supports application of several lemmas in a row.
- Tactics "set" and "pose" can set functions using notation "(f x1..xn := c)".
- New tactic "instantiate" (without argument).
- Tactic firstorder "with" and "using" options have their meaning swapped for
  consistency with auto/eauto (source of incompatibility).
- Tactic "generalize" now supports "at" options to specify occurrences
  and "as" options to name the quantified hypotheses.
- New tactic "specialize H with a" or "specialize (H a)" allows to transform
  in-place a universally-quantified hypothesis (H : forall x, T x) into its
  instantiated form (H : T a). Nota: "specialize" was in fact there in earlier
  versions of Coq, but was undocumented, and had a slightly different behavior.
- New tactic "contradict H" can be used to solve any kind of goal as long as
  the user can provide afterwards a proof of the negation of the hypothesis H.
  If H is already a negation, say ~T, then a proof of T is asked.
  If the current goal is a negation, say ~U, then U is saved in H afterwards,
  hence this new tactic "contradict" extends earlier tactic "swap", which is
  now obsolete.
- Tactics f_equal is now done in ML instead of Ltac: it now works on any
  equality of functions, regardless of the arity of the function.
- New options "before id", "at top", "at bottom" for tactics "move"/"intro".
- Some more debug of reflexive omega (romega), and internal clarifications.
  Moreover, romega now has a variant "romega with *" that can be also used
  on non-Z goals (nat, N, positive) via a call to a translation tactic named
  zify (its purpose is to Z-ify your goal...). This zify may also be used
  independantly of romega.
- Tactic "remember" now supports an "in" clause to remember only selected
  occurrences of a term.
- Tactic "pose proof" supports name overwriting in case of specialization of an
  hypothesis.
- Semi-decision tactic "jp" for first-order intuitionistic logic moved to user
  contributions (subsumed by "firstorder").

Program

- Moved useful tactics in theories/Program and documented them.
- Add Program.Basics which contains standard definitions for functional
  programming (id, apply, flip...)
- More robust obligation handling, dependent pattern-matching and
  well-founded definitions.
- Program CoFixpoint is accepted, Program Fixpoint uses the new way to infer
  which argument decreases structurally.
- Program Lemma, Axiom etc... now permit to have obligations in the statement
  iff they can be automatically solved by the default tactic.
- Renamed "Obligations Tactic" command to "Obligation Tactic".
- New command "Preterm [ of id ]" to see the actual term fed to Coq for
  debugging purposes.
- New option "Transparent Obligations" to control the declaration of
  obligations as transparent or opaque. All obligations are now transparent
  by default, otherwise the system declares them opaque if possible.
- Changed the notations "left" and "right" to "in_left" and "in_right" to hide
  the proofs in standard disjunctions, to avoid breaking existing scripts when
  importing Program. Also, put them in program_scope.

Type Classes

- New "Class", "Instance" and "Program Instance" commands to define
  classes and instances documented in the reference manual.
- New binding construct "`{Class_1 param_1 .. param_n, Class_2 ...}"
  for binding type classes, usable everywhere.
- New command " Print Classes " and " Print Instances some_class " to
  print tables for typeclasses.
- New default eauto hint database "typeclass_instances" used by the default
  typeclass instance search tactic.
- New theories directory "theories/Classes" for standard typeclasses
  declarations. Module Classes.RelationClasses is a typeclass port of
  Relation_Definitions plus a generic development of algebra on
  n-ary heterogeneous predicates.

Setoid rewriting

- Complete (and still experimental) rewrite of the tactic
  based on typeclasses. The old interface and semantics are
  almost entirely respected, except:

  - Import Setoid is now mandatory to be able to call setoid_replace
  and declare morphisms.

  - "-->", "++>" and "==>" are now right associative notations
  declared at level 55 in scope signature_scope.
  Their introduction may break existing scripts that defined
  them as notations with different levels.

  - One can use [Typeclasses Opaque/Transparent [cst]] to indicate
  that [cst] should not be unfolded during unification for morphism
  resolution, by default all constants are transparent.

  - The [setoid_rewrite]'s semantics change when rewriting with
  a lemma: it can rewrite two different instantiations of the lemma
  at once. Use [setoid_rewrite H at 1] for (almost) the usual semantics.
  [setoid_rewrite] will also try to rewrite under binders now, and can
  succeed on different terms than before. In particular, it will unify under
  let-bound variables. When called through [rewrite], the semantics are
  unchanged though.

  - [Add Morphism term : id] has different semantics when used with
  parametric morphism: it will try to find a relation on the parameters
  too. The behavior has also changed with respect to default relations:
  the most recently declared Setoid/Relation will be used, the documentation
  explains how to customize this behavior.

  - Parametric Relation and Morphism are declared differently, using the
  new [Add Parametric] commands, documented in the manual.

  - Setoid_Theory is now an alias to Equivalence, scripts building objects
  of type Setoid_Theory need to unfold (or [red]) the definitions
  of Reflexive, Symmetric and Transitive in order to get the same goals
  as before. Scripts which introduced variables explicitely will not break.

  - The order of subgoals when doing [setoid_rewrite] with side-conditions
  is now always the same: first the new goal, then the conditions.

- New standard library modules Classes.Morphisms declares
  standard morphisms on refl/sym/trans relations.
  Classes.Morphisms_Prop declares morphisms on propositional
  connectives and Classes.Morphisms_Relations on generalized predicate
  connectives. Classes.Equivalence declares notations and tactics
  related to equivalences and Classes.SetoidTactics defines the
  setoid_replace tactics and some support for the "Add *" interface,
  notably the tactic applied automatically before each "Add Morphism"
  proof.

- User-defined subrelations are supported, as well as higher-order morphisms
  and rewriting under binders. The tactic is also extensible entirely in Ltac.
  The documentation has been updated to cover these features.

- [setoid_rewrite] and [rewrite] now support the [at] modifier to select
  occurrences to rewrite, and both use the [setoid_rewrite] code, even when
  rewriting with leibniz equality if occurrences are specified.

Extraction

- Improved behavior of the Caml extraction of modules: name clashes should
  not happen anymore.
- The command Extract Inductive has now a syntax for infix notations. This
  allows in particular to map Coq lists and pairs onto Caml ones:
    Extract Inductive list => list [ "[]" "(::)" ].
    Extract Inductive prod => "(*)" [ "(,)" ].
- In pattern matchings, a default pattern "| _ -> ..." is now used whenever
  possible if several branches are identical. For instance, functions
  corresponding to decidability of equalities are now linear instead of
  quadratic.
- A new instruction Extraction Blacklist id1 .. idn allows to prevent filename
  conflits with existing code, for instance when extracting module List
  to Ocaml.

CoqIDE

- CoqIDE font defaults to monospace so as indentation to be meaningful.
- CoqIDE supports nested goals and any other kind of declaration in the middle
  of a proof.
- Undoing non-tactic commands in CoqIDE works faster.
- New CoqIDE menu for activating display of various implicit informations.
- Added the possibility to choose the location of tabs in coqide:
  (in Edit->Preferences->Misc)
- New Open and Save As dialogs in CoqIDE which filter *.v files.

Tools

- New stand-alone .vo files verifier "coqchk".
- Extended -I coqtop/coqc option to specify a logical dir: "-I dir -as coqdir".
- New coqtop/coqc option -exclude-dir to exclude subdirs for option -R.
- The binary "parser" has been renamed to "coq-parser".

coqdoc
- Improved coqdoc and dump of globalization information to give more
  meta-information on identifiers. All categories of Coq definitions are
  supported, which makes typesetting trivial in the generated documentation.
- A "--interpolate" option permits to use typesetting information from the
  typechecked part of the file to typeset identifiers appearing in Coq escapings
  inside the documentation.
- Better handling of utf8 ("--utf8" option) and respect of spaces in the source.
- Support for hyperlinking and indexing developments in the TeX output.
- New option "color" of the coqdoc style file to render identifiers using colors.
- Additional macros in the TeX ouput allowing to customize indentation and size of
  empty lines. New environment "coqdoccode" for Coq code.

Miscellaneous

- Coq installation provides enough files so that Ocaml's extensions need not
  the Coq sources to be compiled (this assumes O'Caml 3.10 and Camlp5).
- New commands "Set Whelp Server" and "Set Whelp Getter" to customize the
  Whelp search tool.
- Syntax of "Test Printing Let ref" and "Test Printing If ref" changed into
  "Test Printing Let for ref" and "Test Printing If for ref".
- An overhauled build system (new Makefiles); see dev/doc/build-system.txt.
- Add -browser option to configure script.
- Build a shared library for the C part of Coq, and use it by default on
  non-(Windows or MacOS) systems. Bytecode executables are now pure. The
  behaviour is configurable with -coqrunbyteflags, -coqtoolsbyteflags and
  -custom configure options.
- Complexity tests can be skipped by setting the environment variable
  COQTEST_SKIPCOMPLEXITY.

(tonio)

Import aamath 0.3 as math/aamath.

aamath is a program that reads mathematical expressions in infix
notation and renders them as ASCII art. It may be useful to send
mathematics through text-only media, such as e-mail or newsgroups.

Packaged by Emil Skoeldberg for pkgsrc-wip.

Status:

Vendor Tag: TNF
Release Tags: pkgsrc-base

(asau)

Updated Chemtool to 1.6.12.

(asau)

Updated biology/chemtool to 1.6.12

(asau)

Update to Chemtool 1.6.12.

Changes since previous package:

Chemtool-1.6.12 (June 7, 2009)

This release contains another round of fixes for label positioning
and clipping of bonds around labels. The pen color button has been
replaced by a drop-down menu, and a "white" pen for drawing on
colored backgrounds has been added. Chemtool now automatically
resizes its main window on small (netbook) screens, and it can also
be used in an non-interactive mode to create postscript (etc.) output
from previously created chemtool structure files. The Polish
translation has been updated, and a new Bulgarian translation
has been added.

Chemtool-1.6.11 (August 26, 2007)

This release contains numerous fixes for label positioning and
sub/superscript kerning. Bond length and zoom factor are now
stored with the drawing, bond clipping of multiple bonds was
improved and new special key sequences for circled plus and
minus symbols were added. The configuration dialog now lists
gtklp among the supported print commands. Source layout and
build system were reorganized to make addition of translations
easier, and a Portuguese localization file was added.

Chemtool-1.6.10 (April 8th, 2007)

This release adds PNG export, round brackets, text output in
east-european locales and some new templates. Several bugs
related to special character handling in GTK2, screen display
of labels and exporting to EPS and SVG have been fixed. The
configuration dialog has been redone and now includes support
for kprinter, and the labeling shortcuts no longer interfere
with GTK's menu accelerators.

(asau)

Updated YACAS to 1.2.2.

(asau)

Updated math/yacas to 1.2.2

(asau)

Update to YACAS 1.2.2.
Changes unknown, ChangeLog says: "Changes are none, there is only the now."

(asau)

Relax unnecessarily strict restrictions, SBCL should be portable enough.
If this uncovers bugs, those should be fixed, don't mask them.

(asau)

We want no /opt/schily, so patch the Defaults rules. wrapper already
takes care of absolute options, but the value of INS_BASE is based down
via -D too. Bump revision.

(joerg)

Note update of www/opengoo package to 1.5.3.

(taca)

Update www/opengoo pacakge to 1.5.3.

Changelog
=========

Since 1.5.2
-----------
- bugfix: Cannot create companies with normal user without the
  "Can manage contacts" permission
- bugfix: Auto-upgrade feedback fixed.
- bugfix: Fixed a problem when classifying email (attachments were added
  as new versions of existing files).
- bugfix: Allow email addresses with single quote
- bugfix: Changed several "substr" for "utf8_substr" to avoid errors like
  "null" on dashboard.
- bugfix: Added a default address when sending email reminders.
  Fixes problems when sending reminders.
- bugfix: Fixed some display issues with the "Close" button in objects' view.
- bugfix: Fixed a problem that would cause the Overview to be loaded
  on every tab when clicking the "All" workspace.
- bugfix: Custom properties were not being kept when editing an object.
- bugfix: If a user is subscribed to an object and loses permissions to it
  it will not receive notifications any more.
- bugfix: Error 500 when deleting a user.
- bugfix: Email body was not shown for html emails when ROOT_URL was relative.
- bugfix: Create user from contact was not allowed if user was linked
  to a trashed contact, fix: contact is restored.
- bugfix: Task drag & drop does not allow drag from a workspace to another.
- bugfix: Saving workspace while rendering permissions was allowed, and
  no permissions were saved.
- bugfix: When creating new workspace, user checkboxes did not
  check/uncheck all permissions.
- bugfix: Internal server error when deleting user with its personal workspace.
- bugfix: Instantianting template without parameters was going back
  instead of reloading.
- bugfix: Calendar views was not showing milestones assigned to everybody
  when filtering by "my calendar".
- bugfix: In IE when expanding subtask list, the tasks below them did non
  move aside.
- bugfix: Some mail contents were not included in reply or forward body.
- bugfix: Instantiating repeating tasks with subtasks did not put
  correct status to some subtasks.
- bugfix: isToday function was not returning the correct value sometimes.
- bugfix: Csv export: when a field contains "," export is wrong, field
  must be enclosed with quotes.
- bugfix: Importing more than one contact with no email address overwrites
  the previous one.
- bugfix: Contacts are not linked to companies when importing from csv.
- bugfix: Subscribers and invitation lists were not showing users who have
  group permissions but no individual permissions.
- bugfix: If an error occurs when sending a queued email the email is now
  not deleted.
- bugfix: Mindmap viewer overlaps object linker.
- bugfix: The "include subworkspaces" checkbox for the iCal feed was
  being ignored.
- usability: The user is warned when searching for short strings.

(taca)

should have been deleted with pullup #2844 already

(spz)

Updated comms/asterisk to 1.2.35

(jnemeth)

update to asterisk 1.2.35 which fixes AST-2009-006 -- IAX2 DOS vulnerability

(jnemeth)

Note update of devel/p5-MooseX-Method-Signatures to version 0.24

(seb)

Update p5-MooseX-Method-Signatures from version 0.23 to version 0.24.

Upstream changes:
0.24  Mon, 31 Aug 2009 19:04:14 +0200
  * Rename the meta method's clone method to reify. clone already had a special
    meaning for methods in role applications to classes.

(seb)

Updated comms/gammu to 1.26.0

(wiz)

Update gammu and py-gammu to 1.26.0.
Memory usage was reduced. Tons of bugs were fixed. Support for
reading messages from Motorola phones was improved.
Also BlueTooth support was improved.

(wiz)

Note update of devel/p5-App-Cmd to version 0.301

(seb)

Update p5-App-Cmd from version 0.300 to version 0.301.

Upstream changes:
0.301    2009-09-02
          fix App::Cmd::Simple docs to show ->execute (noticed by MIYAGAWA)

(seb)

Updated graphics/sane-backends to 1.0.20nb3

(wiz)

Fix xsane build by adding back a symbol that was, according to Debian,
accidentally removed in 1.0.20.
Bump PKGREVISION.

(wiz)

Updated pkgtools/pbulk to 0.41

(joerg)

pbulk-0.41:
Create & chown work.log for destdir builds too, as the normal build is
run unprivileged.

(joerg)

PSPP 0.6.1 done.

(asau)

Updated math/pspp to 0.6.1

(asau)

Update to PSPP 0.6.1.
Implement x11 (on by default) and pgsql (off by default) options.

Changes from 0.6.0 to 0.6.1:

  * Statistical bug fixes:
    - Report correct standardized regression coefficients in linear
      regression output (bug #23567).

  * Bug fixes that affect PSPP and PSPPIRE:
    - Avoid crash with pie charts (bug #24014).
    - Don't append % to count totals (bug #24003).
    - Don't crash on bad input (bug #24031).
    - Don't crash if "end data." is not left aligned (bug #24115).
    - Change default workspace value to 64 MB, to avoid unnecessary
      disk accesses on modern machines.

  * PSPPIRE bug fixes:
    - Add ".sav" or ".por" suffix to filename when saving with Save_As
      (bug #23137).
    - Make it possible to reopen the output window on Windows (bug
      #24033).
    - A POSIX regular expression library is now included and used
      automatically if the host does not have one or has one that is
      inadequate.

  * Build fixes and changes:
    - Work around bug in GSL that prevented build with recent GCC
      versions without manually adding -fgnu89-inline to CFLAGS.
    - Also warn about missing prerequisites as we encounter them (bug
      #24445).
    - Distribute necessary files to allow users working from the
      distributed tarball to configure with --enable-gui-tools.
    - Append $(EXEEXT_FOR_BUILD) to output file name when building
      q2c, fixing build problems on Windows.
    - GSL 1.8 or later is now required.
    - Build errors with --enable-relocatable were fixed.

  * The German translations were removed, since native German speakers
    found them too poor to be useful.

Changes from 0.4.0 to 0.6.0:

  * The PSPP license is now version 3 or later of the GNU General
    Public License.  Previously, it was version 2 or later.

  * PSPP now has a graphical interface, called PSPPIRE.  This
    interface allows you to enter data and variable definitions
    interactively.  Commands may be executed in syntax form, or by
    using the interactive dialog boxes available from the dropdown
    menus.

  * A few sample syntax files are now included in the `examples'
    directory.

  * Numerous major and minor bugs have been fixed.

  Build changes:

    * The INSTALL file now reflects the details of how to install
      PSPP.  It is a tailored version of the generic installation
      instructions, instead of a verbatim copy.

    * iconv, which is ordinarily installed as part of a Unix-like
      system, is now required.  If you don't have it already, you can
      install GNU libiconv (http://www.gnu.org/software/libiconv/).

    * libxml2 and zlib are new optional dependencies.  They are
      required to use PSPP's support for reading Gnumeric files.

  Statistical procedure changes:

    * REGRESSION is a new procedure for fitting linear models to data
      via least-squares estimation.

    * NPAR TESTS is a new procedure for non-parametric tests.  In this
      release, it supports binomial and chi-square tests.

    * RANK is a new procedure to rank variables.  It supports numerous
      forms of ranking.

    * FREQUENCIES can now output histograms and pie charts.  These
      features were present in earlier releases, but not documented.

  User interface changes:

    * In many situations where PSPP once terminated with a fatal
      error, PSPP now recovers and continues execution.

    * PSPP is now able to start up and run even if it cannot find its
      configuration files.

    * Journaling of interactive commands to a disk file is now
      implemented.  By default, journaling is enabled, to a file named
      `pspp.jnl' in the current directory.  SET JOURNAL may be used to
      control journaling.

    * The use of `+' between syntax file names on the command line to
      prevent the dictionary from being cleared between their
      executions is no longer supported.  All syntax files are now
      executed as if `+' had been specified.

    * The -d/--define and -u/--undef command line options are no
      longer supported.  Instead, use /usr/bin/env or shell primitives
      to define or clear environment variables before invoking PSPP.

    * If a syntax file named named `rc' is found in a configuration
      directory (such as $HOME/.pspp), it is executed before any
      syntax file specified on the command line.  The -r or
      --no-statrc command line option may be used to disable this
      behavior.

  Output changes:

    * Output configuration options have changed.  Please refer to the
      manual for a full description of the available options.

      In consequence, you will need to reinstall your "devices" file.
      "make install" will do this for you.

    * Most error messages are now written to PSPP output files by
      default.  SET ERROR can be used to disable this behavior.

    * When invoked interactively, PSPP now by default produces output
      on the terminal, piping it through the "more" program.
      Previously, by default output was written only to file
      pspp.list.  On most terminals, the page length used for output
      automatically adapts to the terminal size, even if the terminal
      is resized.

    * ASCII driver:
      - This driver now supports charts in output.  Charts are written
        as separate files that the main output file refers to.  By
        default, charts are written in PNG format to files named
        pspp-1.png, pspp-2.png, and so on.
      - Configurations are provided that use VT100 (and xterm)
        line-drawing characters in tables.  The option "-o list-vt100"
        requests use of this device for output to pspp.list.

    * PostScript driver:

      - The default paper size is now determined using the PAPERSIZE
        environment variable, or the LC_PAPER locale category on
        systems that support it.  If these are not set, the default is
        now A4, instead of US letter.  To make US letter the default,
        set PAPERSIZE to "letter" in your environment.
      - Font metrics are now read from AFM files, instead of
        Groff-format metrics files.  PostScript fonts can now be
        embedded in output.
        In consequence, you will need to install an AFM file for each
        font used in PostScript output.  "make install" will install
        AFM files for the standard PostScript fonts, including the
        ones that the PostScript driver uses by default.
      - Standard paper sizes no longer need to be specified through a
        configuration file.  The "papersize" configuration file is no
        longer needed, or supported.
      - The PostScript prologue is no longer obtained from the
        "ps-prologue" configuration file.  This configuration file is
        no longer needed, or supported.

    * HTML driver:
      - The HTML prologue is no longer obtained from the
        "html-prologue" configuration file.  This configuration file
        is no longer needed, or supported.

  Command language changes:

    * The following commands are new:
      - GET DATA, which currently supports reading Gnumeric files and
        text data files.  It will be extended later to read other
        types of foreign data.
      - CD, to change the current directory.
      - INSERT, to execute a syntax file.
      - DELETE VARIABLES, to remove variables from the active file
        dictionary.
      - ADD DOCUMENT, to add text to active file documents.
      - CLOSE FILE HANDLE (a PSPP extension; see below).
      - XEXPORT, a PSPP extension that is a transformation equivalent
        to EXPORT.

    * The following functions for transformation expressions are new:
      - DATEDIFF, for computing the difference of two dates.
      - DATESUM, for advancing a date by a specified duration.
      - VALUELABEL, to obtain the value label for a value.

    * PSPP now supports very long string variables (over 255 bytes
      long).

    * MATCH FILES now supports the FIRST and LAST subcommands.

    * Previous versions of PSPP prohibited using commands to both read and
      write a single file at the same time.  Now, PSPP allows this, and
      the new version of the file atomically replaces the old version.

    * The following commands are no longer available.  They will be
      re-implemented in a later release:
      - CLEAR TRANSFORMATIONS
      - MATRIX DATA
      - REPEATING DATA

    * The PROCESS IF command, which was deprecated, has been removed.
      You may replace any usage of it by SELECT IF following
      TEMPORARY, which has the same effect.

    * The output format for variables created by VECTOR may now be
      specified as part of the VECTOR syntax.

  "Scratch files", a new PSPP extension:

    A scratch file, like a system file, consists of a dictionary and
    any number of cases.  Small scratch files are stored in memory;
    one that grows too large is written to disk.  By default, any file
    handle whose name begins with # is assumed to refer to a scratch
    file.

    Scratch files can be used just about anywhere a system or portable
    file can be used.  Also, portable files are now allowed in most
    places that system files were allowed in previous PSPP version.

    A new CLOSE FILE HANDLE command allows the storage associated with
    scratch files to be freed.  It also allows file handles to be
    reassigned to new files.

    For more information on scratch files, refer to the "File Handles"
    section in the PSPP manual.  For specifics of what commands now
    allow what kinds of files to be specified, refer to the
    documentation on those particular commands.

  Data access changes:

    * Binary formats and IBM/360 formats, including ASCII/EBCDIC
      translation, are now supported.  Use FILE HANDLE to specify the
      format of these files.

    * Little-endian, big-endian, and VAX-endian formats are now
      supported for integer binary formats when reading and writing
      data files.  The new RIB and WIB subcommands on the SET command
      control endianness of integer data.  The default is the host's
      native endianness.

    * IEEE 754, VAX, and IBM hexadecimal formats are now supported for
      floating point binary formats when reading and writing data
      files.  The new RRB and WRB subcommands on the SET command
      control the floating point format.  The default is the host's
      native floating point format.

    * DATA LIST now supports the SKIP subcommand, to skip records at
      the beginning of a file.  For compatibility, DATA LIST now
      treats N format as F format for FREE and LIST format input.

    * The SAVE and XSAVE commands now support the UNSELECTED,
      PERMISSIONS, NAMES, and MAP subcommands.

    * The EXPORT command has been re-implemented to obtain better
      results.  Support for the UNSELECTED, DIGITS, and TYPE
      subcommands has been added.

    * For compatibility, PRINT now inserts a space at the beginning of
      every output line, even lines that would otherwise be blank,
      when OUTFILE is specified.  (The behavior of WRITE is
      unchanged.)

    * For compatibility, PRINT EJECT now inserts the digit `1' at the
      beginning of each line that should begin a new page.

    * For compatibility, WRITE now outputs the system-missing value as
      a field filled with spaces.  Binary formats are an exception.
      (The behavior of PRINT is unchanged.)

  Documentation:

    * Input and output format descriptions have been rewritten.  They
      now precisely describe what is accepted on input and written on
      output.

    * The descriptions of the PSPP system and portable file formats
      have been extensively revised and improved.

Changes from 0.3.0 to 0.4.0:

  Newly implemented commands and statistical features:
    * EXAMINE, including its graphing features.
    * FREQUENCIES now supports percentiles.
    * ONEWAY.
    * PERMISSIONS.
    * SHOW.
    * SORT CASES now sorts stably, that is, two cases with equal sort
      criteria will be in the same relative order before and after the
      sort.
    * T-TEST (re-written).
    * DATE and USE.  These commands are parsed but otherwise ignored,
      to enhance compatibility with certain command files that invoke
      them unnecessarily.
    * VARIABLE WIDTH, VARIABLE ALIGNMENT, and VARIABLE LEVEL.  These
      currently have no effect on PSPP output, but their values are
      written to and read from system files and thus may affect
      third-party software.
    * SET EPOCH implemented.
    * DATA LIST FREE and DATA LIST LIST now support arbitrary field
      delimiters.
    * FILE HANDLE now supports custom tab widths.

  Long variable names (and other identifiers) are now supported.  Up
  to the first 64 bytes of each identifier is significant.  PSPP now
  reads and writes system files compatible with SPSS version 12.

  New --algorithm and --syntax command line options allow
  SPSS-compatible or enhanced modes to be selected.

  Support for transformation expressions has been rewritten and
  significantly improved.  Refer to the manual for details.

  Calculation of moments (mean, standard deviation, kurtosis,
  skewness) has been rewritten and should now be more accurate.  In
  --algorithm=enhanced mode moments may be more accurate than SPSS in
  some cases.

  Numerous bugs have been fixed, too many to mention here.  Many new
  tests have been added, leading to the discovery and fixing of many
  of these bugs.

  The ASCII output driver can now squeeze multiple blank lines into
  single blank lines.

  Much of the code has been rewritten and refactored.  It is now much
  cleaner.

  The FILE TYPE and REPEATING DATA commands have been disabled for
  this release because their implementations were deemed too buggy to
  be useful.  They will be fixed and replaced in a future release.

  New pspp-mode for Emacs (in pspp-mode.el).

  Added rudimentary command-line completion for interactive input.

  lib/julcal and lib/dcdflib are no longer used, so they have been
  removed.

(asau)

Fixed version to get rid of "Cannot extract adobe-flash-plugin- version"
warnings on non-x86 systems.

(jklos)

Build fixes for openssl-1.0.

(wiz)

Fix build on NetBSD-4.0/i386. Patches from Robert Elz in PR 41963.
(Also sent upstream.)

(wiz)

Remove code that triggers parsing bugs in older gccs (e.g. on
NetBSD-3.1/amd64).
Reported by Michael Lambert and David A. Holland.

(wiz)

Set LICENSE.

(wiz)

Don't use libtool without --mode argument.

(joerg)

Use unzip from base if it exists.

(joerg)

Simplify. Unbreak after unzip changes.

(joerg)

ROOT production release is 5.24.00 now.
It needs newer f2c compiler because of LOC function.

(asau)

Fix compiling against NetBSD popcount libc function.

(roy)

Updated lang/camlp5 to 5.12

(tonio)

Update lang/camlp5 to 5.12
Changes are:
- compatibility with recent versions of ocaml
- possible use of IFDEF and IFNDEF in record labels declarations
- addition of Plexer.utf8_lexing

(tonio)

Allow net/mldonkey to be built with ocaml-3.11.1

(tonio)

Use the right option.

(joerg)

Fix build.

(hasso)

Updated math/genius to 1.0.7.

(asau)

Updated math/genius to 1.0.7.

(asau)

Update Genius Calculator to version 1.0.7.

Changes to 1.0.7:

* SYNTAX: Added a possibility to exactly specify which variables are copied
  into a function's extra dictionary when it is being returned.
    E.g. "`(x) [x0] = (x-x0)" will copy x0 from the current context.  This
  is a lot more efficient than the current behaviour which tries to copy
  everything referenced.
* SYNTAX: Add "local" variables by specifying "local x,y,z" or "local *" as
  the first statement in a function.  Local variables are not visible from
  higher contexts (functions called within)
* CHANGE: all system parameters are now protected and cannot be redefined
  using the "parameter" keyword
* Add UserVariables, UndefineAll, ProtectAll, and add Undefine as an alias to
  undefine.
* Add trigonometric Fourier series related functions:
  NumericalFourierSeriesFunction, NumericalFourierSineSeriesFunction,
  NumericalFourierCosineSeriesFunction, FourierSeriesFunction,
  NumericalFourierSeriesCoefficients, NumericalFourierSineSeriesCoefficients,
  NumericalFourierCosineSeriesCoefficients, PeriodicExtension,
  EvenPeriodicExtension, OddPeriodicExtension
* Fix changing floating point precision!
* Fix uninitialized variable in graphing (Matthias Drochner)
* Improve variable substitution for returned functions to be more efficient.
  Slightly changes behaviour with respect to global functions and variables
  used.
* Plot windows now not treated annoyingly as dialogs
* Fix compilation/decompilation of all function attributes.
* Parse/Evaluate with a syntax error at end of string no longer terminate
  genius
* Updated Mersenne stuff for the newest data from mersenne.org and
  fix MersennePrimeExponents
* Fix opening new files from the command line.
* Update the gel library to use the new language features.
* Various other minor fixes
* Translation updates (Philip Withnall, Jen Ockwell,
  Rodrigo Luiz Marques Flores, Daniel Nylander, Mario Bl耿ttermann, me)

* For some of the changes the author (Jiri) was partially supported by
  NSF grant DMS 0900885 and the University of Illinois at Urbana-Champaign

(asau)

DESTDIR support. Fix getline issues.

(joerg)

Don't bother with finishing library installation.

(joerg)

DESTDIR support, don't depend on libtool mode detection.

(joerg)

Use --mode=install for libtool, don't dependency on the legacy
detection.

(joerg)

Restore DEPENDS, it wasn't mean to be removed. Drop NO_SRC_ON_FTP, it
can be mirrored normally.

(joerg)

Updated security/gnupg to 1.4.10

(wiz)

Update to 1.4.10:

Noteworthy changes in version 1.4.10 (2009-09-02)
-------------------------------------------------

    * 2048 bit RSA keys are now generated by default.  The default
      hash algorithm preferences has changed to prefer SHA-256 over
      SHA-1.  2048 bit DSA keys are now generated to use a 256 bit
      hash algorithm

    * Support v2 OpenPGP cards.

    * The algorithm to compute the SIG_ID status has been changed to
      match the one from 2.0.10.

    * Improved file locking.  Implemented it for W32.

    * Fixed a memory leak which made imports of many keys very slow.

    * Many smaller bug fixes.

    * Support for the Camellia cipher (RFC-5581).

    * Support for HKP keyservers over SSL ("HKPS").

(wiz)

Don't pass down -I and -L without argument for X11_TYPE=modular.

(joerg)

+ bftpd-2.4, fotoxx-8.3, gnupg-1.4.10, libsigc++-2.2.4.2,
  mp3diags-0.99.05.033, nautilus-sendto-1.1.7, raine-0.51.6,
  wine-devel-1.1.29.

(wiz)

Improve getline handling.

(wiz)

Update HOMEPAGE and MASTER_SITES, set LICENSE (GNU GPL v.2).

(asau)

Updated math/cln to 1.3.0

(asau)

Update to CLN 1.3.0.

Changes since previous package:

2009-06-30, version 1.3.0
* Use the GNU autotools as build system.
* Implemented a more portable module dependency mechanism.

2008-04-05, version 1.2.2
* Re-establish CLN-1.2.0 ABI and fix ARM build, both inadvertently broken in
  the previous release.

2008-03-24, version 1.2.1
* Fixed some bugs in the output of numbers larger than 2^32 decimal digits.
* Modifying C/C++ operators like +=, ++, etc. are now enabled by default.

2008-01-19, version 1.2.0
* Save big amounts of memory in computation of some functions and constants by:
    - Avoiding pre-computation of series terms and instead computing them in a
      streamed way.
    - Avoiding computation with excess precision in binary splitting algorithm
      by coercion of intermediate integer values to floating-point as early as
      possible.
* Added support for huge numbers:
    - intC used for all counter loops.
    - intE is now a 64-bit type on all 64-bit platforms and even on selected
      32-bit platforms.
* CLN now uses C++ exceptions for error handling. The cl_abort() hook is not
  supported any more. Please refer to the documentation to learn about existing
  exception types.
* Fixed a bug on i386 where comparing Z/2Z ring zeros returnd random results.
* Removed cl_boolean. Use built-in C++ bool instead.
* Dropped the cln-config script. Please use pkg-config instead.
* Updated infrastructure to that of libtool-1.5.24.
* Changed encoding of all files to UTF-8.
* Fix compilation issues with GCC-4.3.
* Fix linking issues on platforms that don't feature weak symbols (like win32).

(asau)

Update HOMEPAGE.

(wiz)

Updated math/capc-calc to 2.12.4.0

(asau)

Update to calc 2.12.4.0.

User visible changes:

    Fixed a documentation bug for the sgn() builtin.

    Added the 1<<8/2 evaluation example to "help unexpected".  That
    expression evalutes to 128, not 16 as some C programmers might expect.

    Fixed a bug in solve.cal where high was not returned in some situations.

    Fixed a bug reported by Paul & Karen Tomlinson (paulnkaz at pktomlinson
    dot fsnet dot co dot uk) where calling log multiple times with different
    values of epsilon resulted in an incorrect value.

    Fixed a bug where an certains typos (e.g., calling an unknown
    function) would previously cause calc to exit.

(asau)

Add ristretto, now that it's packaged

(martin)