Could one calculate the hashes for each entry, sort them, and then
generate the hash for the collection?
On Thu, 7 Mar 2024 at 06:59, Mark Struberg wrote:
>
> The question to me is how we can make it more robust.
> In a Collection (but actually also in most lists) the order in which you get
> th
On 2024/03/07 06:58:30 Mark Struberg wrote:
> The question to me is how we can make it more robust.
> In a Collection (but actually also in most lists) the order in which you get
> the values (Iterator or get(i)) is not deterministic. It can be different in
> one list than in another - even if th
Hi.
In relation to
https://issues.apache.org/jira/browse/MATH-1667
I'm trying to regenerate the (live) site of [Math], but
I've lost track of the "right" way to do it in accordance
with the latest contents of the POM file; there is a
profile named "site-checkout" but running
$ mvn -P site-chec
Please see https://commons.apache.org/site-publish.html
Gary
On Thu, Mar 7, 2024, 9:10 AM Gilles Sadowski wrote:
> Hi.
>
> In relation to
> https://issues.apache.org/jira/browse/MATH-1667
> I'm trying to regenerate the (live) site of [Math], but
> I've lost track of the "right" way to do it i
One comment about the collection comparison...
For any collection that actually implements List, equality should *include*
order, not attempt to ignore it, right? The contract of a list is that the
order is consistent, and two lists with the same items in different order,
should not be considered
Le jeu. 7 mars 2024 à 15:20, Gary Gregory a écrit :
>
> Please see https://commons.apache.org/site-publish.html
Thanks.
Trying
$ mvn scm-publish:publish-scm
results in
---CUT---
[ERROR] Failed to execute goal
org.apache.maven.plugins:maven-scm-publish-plugin:3.2.1:publish-scm
(default-cli) on p
