jpaul / News: Recent posts

jpaul 2.5.1

1. Fixed an embarassing error in the previous release: in jpaul 2.5,
the jpaul.Version.RELEASE field was still "2.4.1". Now, we have a
more automated release procedure, that checks for such mistakes.

2. Adam found and fixed a few datastructures that were not
serializable yet. They are now!

jpaul 2.5

1. Similar to the Java Collections framework, added a
synchronization wrapper for Relations; see the
newly-added static method

Relation.synchronizedRelation(Relation<K,V> rel);

2. New methods: Relation.isEmpty(), Relation.clear()

3. Use wildcards to provide more flexibility in Relations:

New method:
Relation.addAll(K key, Collection<? extends V> values)

(see its Javadoc on why we couldn't simply improve
addAll)... read more

Similar to jpaul 2.4, except for serious changes in jpaul.DataStructs.DisjointSet (now called UnionFind).

jpaul 2.4

"Consolidation" release: no ground-breaking addition, but a lot of
changes triggered by bug reports and feature requests.

THESE CHANGES REQUIRE CHANGES IN THE CLIENT CODE, especially those
that involve name changes. However, I don't expect this to be a
problem: the new names were unused before; just compile with the new
version and next go to the line numbers for all compilation errors;
you should be able to fix everything pretty fast, using a search &
replace strategy. If angry, please consider the fact that all these
changes are supposed to make jpaul easier to use on long term; also,
to avoid being taken by surprise by future changes, please monitor the
bug/feature request trackers on jpaul's web page on SourceForge -
http://sourceforge.net/projects/jpaul. You are invited to take part
in the discussion related to each item on these trackers.... read more

Please read the release notes, and, if you find it useful, download it. Use the bug tracker interface from Sourceforge to add bug reports / feature requests. I give them my full attention and they do get fixed eventually.

Version 2.2.1 fixes a small bug in 2.2 (an unnecesssary dependence on harpoon.Util.Util - a class from the Flex compiler infrastructure). Here is the original email for 2.2:

Version 2.2 adds a new package, jpaul.RegExps, providing
support for generic Non-deterministic Finite Automata (NFAs)
and regular expressions over any alphabet (strings are basically
lists of elements of some type A). The NFA to regexp conversion
is already implemented (it is used in Alex Salcianu's work on
purity/mutation analysis). ... read more

Version 2.2 adds a new package, jpaul.RegExps, providing
support for generic Non-deterministic Finite Automata (NFAs)
and regular expressions over any alphabet (strings are basically
lists of elements of some type A). The NFA to regexp conversion
is already implemented (it is used in Alex Salcianu's work on
purity/mutation analysis).

Another addition is the support for binary trees (a special case
of digraphs). See BinTreeNav and BinTreeUtil in the package
jpaul.Graphs.... read more

1. The biggest change over the previous version (1.0) is the addition of an efficient and generic solver for systems of inequality constraints - new package jpaul.Constraints.

2. A small set constraint solver - package jpaul.Constraints.SetConstraints - has been provided as a test/demo of the generic solver from 1.

3. More data structures: support for the factory pattern, copy-on-write data structures, etc.... read more