[Git][java-team/trove3][master] 5 commits: Declare compliance with Debian Policy 4.2.1.
Markus Koschany
gitlab at salsa.debian.org
Mon Oct 29 19:14:42 GMT 2018
Markus Koschany pushed to branch master at Debian Java Maintainers / trove3
Commits:
3d182cde by Markus Koschany at 2018-10-29T18:53:50Z
Declare compliance with Debian Policy 4.2.1.
- - - - -
04907844 by Markus Koschany at 2018-10-29T18:55:57Z
Start new changelog entry
- - - - -
c1f7db43 by Markus Koschany at 2018-10-29T19:01:52Z
Remove failing test.
- - - - -
ce33f906 by Markus Koschany at 2018-10-29T19:03:03Z
Update changelog
- - - - -
7702de19 by Markus Koschany at 2018-10-29T19:09:38Z
Fix debian/copyright syntax errors. The license is LGPL-2.1+.
- - - - -
7 changed files:
- debian/changelog
- debian/control
- debian/copyright
- debian/patches/01_build_target_5_0.patch
- debian/patches/add-maven-pom.patch
- + debian/patches/no-CORBA-JDK11.patch
- debian/patches/series
Changes:
=====================================
debian/changelog
=====================================
@@ -1,3 +1,17 @@
+trove3 (3.0.3-5) unstable; urgency=medium
+
+ [ Steffen Möller ]
+ * Team upload.
+ * Update watch - project moved to bitbucket
+ * Using Files-Excluded in d/copyright, formatting.
+
+ [ Markus Koschany ]
+ * Declare compliance with Debian Policy 4.2.1.
+ * Add no-CORBA-JDK11.patch. Remove the test failing with OpenJDK 11.
+ (Closes: #912265)
+
+ -- Markus Koschany <apo at debian.org> Mon, 29 Oct 2018 20:02:06 +0100
+
trove3 (3.0.3-4) unstable; urgency=medium
* Team upload.
=====================================
debian/control
=====================================
@@ -13,7 +13,7 @@ Build-Depends:
javahelper,
junit4,
maven-repo-helper
-Standards-Version: 4.1.4
+Standards-Version: 4.2.1
Vcs-Git: https://anonscm.debian.org/git/pkg-java/trove3.git
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-java/trove3.git
Homepage: http://trove4j.sourceforge.net/
=====================================
debian/copyright
=====================================
@@ -1,8 +1,8 @@
Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
Upstream-Name: Trove
Source: http://trove4j.sourceforge.net/
-
-Files-Excluded: lib/
+Files-Excluded:
+ lib/
javadocs/*
*.jar
@@ -12,7 +12,26 @@ Copyright:
Johan Parent <jparent at users.sourceforge.net>
Jeff Randall <randall at uph.com>
Eric D. Friedman <ericdf at users.sourceforge.net>
-License: GPL-2.1+
+License: LGPL-2.1+
+
+Files: src/gnu/trove/impl/PrimeFinder.java
+ src/gnu/trove/impl/HashFunctions.java
+Copyright: (c) 1999 CERN - European Organization for Nuclear Research.
+License: custom
+ Permission to use, copy, modify, distribute and sell this software and
+ its documentation for any purpose is hereby granted without fee,
+ provided that the above copyright notice appear in all copies and that
+ both that copyright notice and this permission notice appear in
+ supporting documentation. CERN makes no representations about the
+ suitability of this software for any purpose. It is provided "as is"
+ without expressed or implied warranty.
+
+Files: debian/*
+Copyright: 12-April-2007 Arnaud Vandyck <avdyk at debian.org> on .
+ 02-June-2012 Erich Schubert <erich at debian.org> for update to Trove 3
+License: LGPL-2.1+
+
+License: LGPL-2.1+
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
@@ -30,19 +49,4 @@ License: GPL-2.1+
On Debian systems, you can find the LGPL license in:
/usr/share/common-licenses/LGPL-2.1
-Files: src/gnu/trove/impl/PrimeFinder.java
- src/gnu/trove/impl/HashFunctions.java
-Copyright: (c) 1999 CERN - European Organization for Nuclear Research.
-License: custom
- Permission to use, copy, modify, distribute and sell this software and
- its documentation for any purpose is hereby granted without fee,
- provided that the above copyright notice appear in all copies and that
- both that copyright notice and this permission notice appear in
- supporting documentation. CERN makes no representations about the
- suitability of this software for any purpose. It is provided "as is"
- without expressed or implied warranty.
-Files: debian/*
-Copyright: 12-April-2007 Arnaud Vandyck <avdyk at debian.org> on .
- 02-June-2012 Erich Schubert <erich at debian.org> for update to Trove 3
-License: GPL-2.1+
=====================================
debian/patches/01_build_target_5_0.patch
=====================================
@@ -1,7 +1,16 @@
-Index: trove-3.0.3/build.xml
+From: Debian Java Maintainers <pkg-java-maintainers at lists.alioth.debian.org>
+Date: Mon, 29 Oct 2018 19:57:12 +0100
+Subject: _build_target_5_0
+
===================================================================
---- trove-3.0.3.orig/build.xml
-+++ trove-3.0.3/build.xml
+---
+ build.xml | 8 ++++----
+ 1 file changed, 4 insertions(+), 4 deletions(-)
+
+diff --git a/build.xml b/build.xml
+index db1ff1d..e85f287 100644
+--- a/build.xml
++++ b/build.xml
@@ -109,7 +109,7 @@
<target name="compile" depends="generate">
<javac destdir="${output.dest}"
=====================================
debian/patches/add-maven-pom.patch
=====================================
@@ -1,7 +1,18 @@
-Index: trove-3.0.3/resources/maven-manual-deploy-pom.xml
+From: Debian Java Maintainers <pkg-java-maintainers at lists.alioth.debian.org>
+Date: Mon, 29 Oct 2018 19:57:12 +0100
+Subject: add-maven-pom
+
===================================================================
+---
+ resources/maven-manual-deploy-pom.xml | 41 +++++++++++++++++++++++++++++++++++
+ 1 file changed, 41 insertions(+)
+ create mode 100644 resources/maven-manual-deploy-pom.xml
+
+diff --git a/resources/maven-manual-deploy-pom.xml b/resources/maven-manual-deploy-pom.xml
+new file mode 100644
+index 0000000..f826b3f
--- /dev/null
-+++ trove-3.0.3/resources/maven-manual-deploy-pom.xml
++++ b/resources/maven-manual-deploy-pom.xml
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0"
=====================================
debian/patches/no-CORBA-JDK11.patch
=====================================
@@ -0,0 +1,550 @@
+From: Markus Koschany <apo at debian.org>
+Date: Mon, 29 Oct 2018 19:57:55 +0100
+Subject: no CORBA JDK11
+
+CORBA has been removed from OpenJDK 11. Just remove the whole test.
+
+Debian-Bug: https://bugs.debian.org/912265
+Forwarded: not-needed, already removed upstream.
+---
+ test/gnu/trove/set/hash/TLinkedHashSetTest.java | 531 ------------------------
+ 1 file changed, 531 deletions(-)
+ delete mode 100644 test/gnu/trove/set/hash/TLinkedHashSetTest.java
+
+diff --git a/test/gnu/trove/set/hash/TLinkedHashSetTest.java b/test/gnu/trove/set/hash/TLinkedHashSetTest.java
+deleted file mode 100644
+index 5cc7a6c..0000000
+--- a/test/gnu/trove/set/hash/TLinkedHashSetTest.java
++++ /dev/null
+@@ -1,531 +0,0 @@
+-///////////////////////////////////////////////////////////////////////////////
+-// Copyright (c) 2001-2006, Eric D. Friedman All Rights Reserved.
+-// Copyright (c) 2009, Rob Eden All Rights Reserved.
+-// Copyright (c) 2009, Jeff Randall All Rights Reserved.
+-//
+-// This library is free software; you can redistribute it and/or
+-// modify it under the terms of the GNU Lesser General Public
+-// License as published by the Free Software Foundation; either
+-// version 2.1 of the License, or (at your option) any later version.
+-//
+-// This library is distributed in the hope that it will be useful,
+-// but WITHOUT ANY WARRANTY; without even the implied warranty of
+-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+-// GNU General Public License for more details.
+-//
+-// You should have received a copy of the GNU Lesser General Public
+-// License along with this program; if not, write to the Free Software
+-// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+-///////////////////////////////////////////////////////////////////////////////
+-
+-
+-package gnu.trove.set.hash;
+-
+-import junit.framework.TestCase;
+-import org.omg.CORBA.portable.Streamable;
+-
+-import java.io.ByteArrayInputStream;
+-import java.io.ByteArrayOutputStream;
+-import java.io.ObjectInputStream;
+-import java.io.ObjectOutputStream;
+-import java.util.*;
+-
+-
+-/**
+- * Created: Sat Nov 3 10:33:15 2001
+- *
+- * @author Eric D. Friedman
+- * @author Rob Eden
+- * @author Jeff Randall
+- * @version $Id: THashSetTest.java,v 1.1.2.3 2010/03/02 04:09:50 robeden Exp $
+- */
+-
+-public class TLinkedHashSetTest extends TestCase {
+-
+- public TLinkedHashSetTest(String name) {
+- super( name );
+- }
+-
+-
+- public void setUp() throws Exception {
+- super.setUp();
+- }
+-
+-
+- public void tearDown() throws Exception {
+- super.tearDown();
+- }
+-
+-
+- public void testConstructors() throws Exception {
+- Set<String> set = new TLinkedHashSet<String>();
+- assertNotNull( set );
+-
+- String[] strings = {"a", "b", "c", "d"};
+- set.addAll( Arrays.asList( strings ) );
+-
+- Set<String> copy = new TLinkedHashSet<String>( set );
+- assertTrue( "set not a copy: " + set + ", " + copy, set.equals( copy ) );
+-
+- Set<String> another = new TLinkedHashSet<String>( 20 );
+- another.addAll( Arrays.asList( strings ) );
+- assertTrue( "set not equal: " + set + ", " + copy, set.equals( another ) );
+-
+- another = new TLinkedHashSet<String>( 2, 1.0f );
+- another.addAll( Arrays.asList( strings ) );
+- assertTrue( "set not equal: " + set + ", " + copy, set.equals( another ) );
+- }
+-
+-
+- public void testIsEmpty() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- assertTrue( "new set wasn't empty", s.isEmpty() );
+-
+- s.add( "One" );
+- assertTrue( "set with element reports empty", !s.isEmpty() );
+- s.clear();
+- assertTrue( "cleared set reports not-empty", s.isEmpty() );
+- }
+-
+-
+- public void testContains() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- String o = "testContains";
+- s.add( o );
+- assertTrue( "contains failed", s.contains( o ) );
+- }
+-
+-
+- @SuppressWarnings({"ForLoopReplaceableByForEach"})
+- public void testContainsAll() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- String[] o = {"Hello World", "Goodbye World", "Hello Goodbye"};
+- s.addAll( Arrays.asList( o ) );
+- for ( int i = 0; i < o.length; i++ ) {
+- assertTrue( o[i], s.contains( o[i] ) );
+- }
+- assertTrue( "containsAll failed: " + s,
+- s.containsAll( Arrays.asList( o ) ) );
+-
+- String[] more = {"Hello World", "Goodbye World", "Hello Goodbye", "Not There"};
+- assertFalse( "containsAll failed: " + s,
+- s.containsAll( Arrays.asList( more ) ) );
+- }
+-
+-
+- public void testRetainAll() throws Exception {
+- Set<String> set = new TLinkedHashSet<String>();
+- String[] strings = {"Hello World", "Goodbye World", "Hello Goodbye", "Remove Me"};
+- set.addAll( Arrays.asList( strings ) );
+- for ( String string : strings ) {
+- assertTrue( string, set.contains( string ) );
+- }
+-
+- String[] retain = {"Hello World", "Goodbye World", "Hello Goodbye"};
+- assertTrue( "retainAll failed: " + set,
+- set.retainAll( Arrays.asList( retain ) ) );
+- assertTrue( "containsAll failed: " + set,
+- set.containsAll( Arrays.asList( retain ) ) );
+- }
+-
+-
+- public void testRemoveAll() throws Exception {
+- Set<String> set = new TLinkedHashSet<String>();
+- String[] strings = {"Hello World", "Goodbye World", "Hello Goodbye", "Keep Me"};
+- set.addAll( Arrays.asList( strings ) );
+- for ( String string : strings ) {
+- assertTrue( string, set.contains( string ) );
+- }
+-
+- String[] remove = {"Hello World", "Goodbye World", "Hello Goodbye"};
+- assertTrue( "removeAll failed: " + set,
+- set.removeAll( Arrays.asList( remove ) ) );
+- assertTrue( "removeAll failed: " + set,
+- set.containsAll( Arrays.asList( "Keep Me" ) ) );
+-
+- for ( String element : remove ) {
+- assertFalse( element + " still in set: " + set, set.contains( element ) );
+- }
+- assertEquals( 1, set.size() );
+- }
+-
+-
+- public void testAdd() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- assertTrue( "add failed", s.add( "One" ) );
+- assertTrue( "duplicated add succeded", !s.add( "One" ) );
+- }
+-
+-
+- public void testRemove() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- s.add( "One" );
+- s.add( "Two" );
+- assertTrue( "One was not added", s.contains( "One" ) );
+- assertTrue( "One was not removed", s.remove( "One" ) );
+- assertTrue( "One was not removed", !s.contains( "One" ) );
+- assertTrue( "Two was removed", s.contains( "Two" ) );
+- assertEquals( 1, s.size() );
+- }
+-
+-
+- public void testRemoveObjectNotInSet() throws Exception {
+- Set<String> set = new TLinkedHashSet<String>();
+- set.add( "One" );
+- set.add( "Two" );
+- assertTrue( "One was not added", set.contains( "One" ) );
+- assertTrue( "One was not removed", set.remove( "One" ) );
+- assertTrue( "One was not removed", !set.contains( "One" ) );
+- assertTrue( "Two was removed", set.contains( "Two" ) );
+- assertFalse( "Three was removed (non-existant)", set.remove( "Three" ) );
+- assertEquals( 1, set.size() );
+- }
+-
+-
+- public void testSize() throws Exception {
+- Set<Object> o = new TLinkedHashSet<Object>();
+- assertEquals( "initial size was not 0", 0, o.size() );
+-
+- for ( int i = 0; i < 99; i++ ) {
+- o.add( new Object() );
+- assertEquals( "size did not increase after add", i + 1, o.size() );
+- }
+- }
+-
+-
+- public void testClear() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- s.addAll( Arrays.asList( "one", "two", "three" ) );
+- assertEquals( "size was not 3", 3, s.size() );
+- s.clear();
+- assertEquals( "initial size was not 0", 0, s.size() );
+- }
+-
+- public void testIterationOrder() throws Exception {
+- TLinkedHashSet<String> lhs = new TLinkedHashSet<String>();
+- Set<String> s = lhs;
+- s.add("a");
+- s.add("b");
+- s.add("c");
+- //
+- Iterator<String> it = s.iterator();
+- //
+- assertEquals("a", it.next());
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+- //
+- s.add("a");
+- it = s.iterator();
+- //
+- assertEquals("a", it.next());
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+- //
+- s.remove("a");
+- s.add("a");
+- //
+- it = s.iterator();
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+- assertEquals("a", it.next());
+- //
+- lhs.compact();
+- it = s.iterator();
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+- assertEquals("a", it.next());
+- }
+-
+- public void testIteratorRemove() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- s.add("a");
+- s.add("b");
+- s.add("c");
+- //
+- Iterator<String> it = s.iterator();
+- //
+- assertEquals("a", it.next());
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+- it = s.iterator();
+- //
+- assertEquals("a", it.next());
+- it.remove();
+- assertEquals("b", it.next());
+- assertEquals("c", it.next());
+-
+- it = s.iterator();
+- //
+- assertEquals("b", it.next());
+- it.remove();
+- assertEquals("c", it.next());
+-
+- it = s.iterator();
+- //
+- assertEquals("c", it.next());
+- it.remove();
+-
+- assertTrue(s.isEmpty());
+- }
+-
+- public void testSerialize() throws Exception {
+- Set<String> s = new TLinkedHashSet<String>();
+- s.addAll( Arrays.asList( "one", "two", "three" ) );
+- assertEquals(s, s);
+- ByteArrayOutputStream baos = new ByteArrayOutputStream();
+- ObjectOutputStream oos = new ObjectOutputStream( baos );
+- oos.writeObject( s );
+-
+- ByteArrayInputStream bais = new ByteArrayInputStream( baos.toByteArray() );
+- ObjectInputStream ois = new ObjectInputStream( bais );
+-
+- TLinkedHashSet s2 = (TLinkedHashSet) ois.readObject();
+-
+- assertEquals( s, s2 );
+- }
+-
+-
+- public void testToArray() {
+- Set<String> s = new TLinkedHashSet<String>();
+- String[] str = {"hi", "bye", "hello", "goodbye"};
+- s.addAll( Arrays.asList( str ) );
+- Object[] res = s.toArray();
+- Arrays.sort( str );
+- Arrays.sort( res );
+- assertTrue( Arrays.equals( str, res ) );
+- }
+-
+-
+- public void testToArrayWithParams() {
+- Set<String> s = new TLinkedHashSet<String>();
+- String[] str = {"hi", "bye", "hello", "goodbye"};
+- s.addAll( Arrays.asList( str ) );
+- String[] sink = new String[str.length + 2];
+- sink[sink.length - 1] = "residue";
+- sink[sink.length - 2] = "will be cleared";
+- String[] res = s.toArray( sink );
+-
+- Set<String> copy = new HashSet<String>();
+- copy.addAll( Arrays.asList( res ) );
+-
+- Set<String> bogey = new HashSet<String>();
+- bogey.addAll( Arrays.asList( str ) );
+- bogey.add( "residue" );
+- bogey.add( null );
+- assertEquals( bogey, copy );
+- }
+-
+-
+- @SuppressWarnings({"ToArrayCallWithZeroLengthArrayArgument", "SuspiciousToArrayCall"})
+- public void testToArrayAnotherType() throws Exception {
+- Set<Number> set = new TLinkedHashSet<Number>();
+- Number[] nums = {1138, 42, 86, 99, 101};
+- set.addAll( Arrays.asList( nums ) );
+-
+- Integer[] to_int_array_zero = set.toArray( new Integer[0] );
+- assertTrue( "set and array mismatch: " + set +
+- ", " + Arrays.asList( to_int_array_zero ),
+- set.containsAll( Arrays.asList( to_int_array_zero ) ) );
+-
+- Integer[] to_int_array_size = set.toArray( new Integer[set.size()] );
+- assertTrue( "set and array mismatch: " + set +
+- ", " + Arrays.asList( to_int_array_size ),
+- set.containsAll( Arrays.asList( to_int_array_size ) ) );
+-
+-
+- Number[] to_num_array_zero = set.toArray( new Number[0] );
+- assertTrue( "set and array mismatch: " + set +
+- ", " + Arrays.asList( to_num_array_zero ),
+- set.containsAll( Arrays.asList( to_num_array_zero ) ) );
+-
+- Number[] to_num_array_size = set.toArray( new Number[set.size()] );
+- assertTrue( "set and array mismatch: " + set +
+- ", " + Arrays.asList( to_num_array_size ),
+- set.containsAll( Arrays.asList( to_num_array_size ) ) );
+- }
+-
+-
+- @SuppressWarnings({"MismatchedQueryAndUpdateOfCollection"})
+- public void testRehashing() throws Exception {
+- Set<Integer> s = new TLinkedHashSet<Integer>();
+- for ( int i = 0; i < 10000; i++ ) {
+- s.add( new Integer( i ) );
+- }
+- }
+-
+-
+- /**
+- * this tests that we throw when people violate the
+- * general contract for hashcode on java.lang.Object
+- */
+- @SuppressWarnings({"MismatchedQueryAndUpdateOfCollection"})
+- public void testSomeBadlyWrittenObject() {
+- Set<Object> s = new TLinkedHashSet<Object>();
+- boolean didThrow = false;
+- int i = 0;
+- try {
+- for (; i < 101; i++ ) {
+- s.add( new Crap() );
+- }
+- }
+- catch ( IllegalArgumentException e ) {
+- didThrow = true;
+- }
+- assertTrue( "expected TLinkedHashSet to throw an IllegalArgumentException", didThrow );
+- }
+-
+-
+- public void testIterable() {
+-
+- Set<String> set = new TLinkedHashSet<String>();
+- set.add( "One" );
+- set.add( "Two" );
+-
+- for ( String s : set ) {
+- assertTrue( s.equals( "One" ) || s.equals( "Two" ) );
+- }
+- }
+-
+-
+- public void testToString() {
+- Set<String> set = new TLinkedHashSet<String>();
+- set.add( "One" );
+- set.add( "Two" );
+-
+- String to_string = set.toString();
+- assertTrue( to_string,
+- to_string.equals( "{One, Two}" ) || to_string.equals( "{Two, One}" ) );
+- }
+-
+-
+- public void testEquals() {
+- String[] strings = {"hi", "bye", "hello", "goodbye"};
+- Set<String> set = new TLinkedHashSet<String>();
+- set.addAll( Arrays.asList( strings ) );
+- Set<String> other = new TLinkedHashSet<String>();
+- other.addAll( Arrays.asList( strings ) );
+-
+- assertTrue( "sets incorrectly not equal: " + set + ", " + other,
+- set.equals( other ) );
+-
+- String[] mismatched = {"heyya", "whassup", "seeya", "blargh"};
+- Set<String> unequal = new TLinkedHashSet<String>();
+- unequal.addAll( Arrays.asList( mismatched ) );
+-
+- assertFalse( "sets incorrectly equal: " + set + ", " + unequal,
+- set.equals( unequal ) );
+-
+- // Change length, different code branch
+- unequal.add( "whee!" );
+- assertFalse( "sets incorrectly equal: " + set + ", " + unequal,
+- set.equals( unequal ) );
+- }
+-
+-
+- public void testEqualsNonSet() {
+- String[] strings = {"hi", "bye", "hello", "goodbye"};
+- Set<String> set = new TLinkedHashSet<String>();
+- set.addAll( Arrays.asList( strings ) );
+- List<String> other = new ArrayList<String>();
+- other.addAll( Arrays.asList( strings ) );
+-
+- assertFalse( "sets incorrectly equals list: " + set + ", " + other,
+- set.equals( other ) );
+-
+- Map<String, String> map = new HashMap<String, String>();
+- for ( String string : strings ) {
+- map.put( string, string );
+- }
+- assertFalse( "sets incorrectly equals map: " + set + ", " + map,
+- set.equals( map ) );
+- }
+-
+-
+- public void testHashcode() {
+- String[] strings = {"hi", "bye", "hello", "goodbye"};
+- Set<String> set = new TLinkedHashSet<String>();
+- set.addAll( Arrays.asList( strings ) );
+- Set<String> other = new TLinkedHashSet<String>();
+- other.addAll( Arrays.asList( strings ) );
+-
+- assertTrue( "hashcodes incorrectly not equal: " + set + ", " + other,
+- set.hashCode() == other.hashCode() );
+-
+- String[] mismatched = {"heyya", "whassup", "seeya", "blargh"};
+- Set<String> unequal = new TLinkedHashSet<String>();
+- unequal.addAll( Arrays.asList( mismatched ) );
+-
+- assertFalse( "hashcodes unlikely equal: " + set + ", " + unequal,
+- set.hashCode() == unequal.hashCode() );
+- }
+-
+-
+- public void testCompact() {
+- int max_size = 10000;
+- int reduced_size = 100;
+-
+- TLinkedHashSet<Integer> set = new TLinkedHashSet<Integer>( max_size, 1.0f );
+- for ( int index = 1; index <= max_size; index++ ) {
+- set.add( Integer.valueOf( index ) );
+- }
+- assertEquals( max_size, set.size() );
+- int max_length = set._set.length;
+-
+- for ( int index = max_size; index > reduced_size; index-- ) {
+- set.remove( Integer.valueOf( index ) );
+- }
+- assertEquals( reduced_size, set.size() );
+-
+- set.compact();
+- int compacted_length = set._set.length;
+- assertFalse( max_length + " should != " + compacted_length,
+- max_length == compacted_length );
+- }
+-
+-
+- public void testDisabledAutoCompact() {
+- int max_size = 10000;
+- int reduced_size = 100;
+-
+- TLinkedHashSet<Integer> set = new TLinkedHashSet<Integer>( max_size, 1.0f );
+- set.setAutoCompactionFactor( 0.0f ); // Disable
+- for ( int index = 1; index <= max_size; index++ ) {
+- set.add( Integer.valueOf( index ) );
+- }
+- assertEquals( max_size, set.size() );
+- int max_length = set._set.length;
+-
+- for ( int index = max_size; index > reduced_size; index-- ) {
+- set.remove( Integer.valueOf( index ) );
+- }
+- assertEquals( reduced_size, set.size() );
+- int uncompacted_length = set._set.length;
+- assertEquals( max_length, uncompacted_length );
+-
+- set.compact();
+- int compacted_length = set._set.length;
+- assertFalse( uncompacted_length + " should != " + compacted_length,
+- uncompacted_length == compacted_length );
+- }
+-
+-
+- // in this junk class, all instances hash to the same
+- // address, but some objects claim to be equal where
+- // others do not.
+- public static class Crap {
+-
+- public boolean equals( Object other ) {
+- return other instanceof Crap;
+- }
+-
+-
+- public int hashCode() {
+- return System.identityHashCode( this );
+- }
+- }
+-
+-
+- public static void main( String[] args ) throws Exception {
+- junit.textui.TestRunner.run( new TLinkedHashSetTest( "testBadlyWrittenObject" ) );
+- }
+-} // TLinkedHashSetTests
=====================================
debian/patches/series
=====================================
@@ -1,3 +1,4 @@
01_build_target_5_0.patch
add-maven-pom.patch
do-not-copy-junit.jar.patch
+no-CORBA-JDK11.patch
View it on GitLab: https://salsa.debian.org/java-team/trove3/compare/37f7a87489b89352c37f63dfdae6c6c94f129334...7702de1979ae753d225c96eb89c037228d30ddd4
--
View it on GitLab: https://salsa.debian.org/java-team/trove3/compare/37f7a87489b89352c37f63dfdae6c6c94f129334...7702de1979ae753d225c96eb89c037228d30ddd4
You're receiving this email because of your account on salsa.debian.org.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/pkg-java-commits/attachments/20181029/326b1ff4/attachment.html>
More information about the pkg-java-commits
mailing list