Java-Gaming.org Hi !
Featured games (83)
games approved by the League of Dukes
Games in Showcase (539)
Games in Android Showcase (132)
games submitted by our members
Games in WIP (603)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  Combine two ArrayList(s), omit duplicates  (Read 7305 times)
0 Members and 1 Guest are viewing this topic.
Offline Sanxion

Junior Devvie




Java games rock!


« Posted 2003-01-15 06:19:42 »

Is using a HashSet the  fastest way to combine two ArrayList(s) and omit duplicates?

ArrayList a1, a2; // fill them with junk

HashSet hash = new HashSet(a1);
hash.addAll(a2);
Offline ryanm

Senior Devvie


Projects: 1
Exp: 15 years


Used to be bleb


« Reply #1 - Posted 2003-01-15 08:12:19 »

You could just do

ArrayList a1, a2; // fill with junk

a1.removeAll( a2 ); // removes duplicates
a1.addAll( a2 ); // combines lists

You might also want to use LinkedLists instead of ArrayLists in order to avoid costly removing-from-an-array operations, and the annoying array-growing operation.  Anyhoo, as long as your chosen collection implements the java.util.Collection interface, you can do the above.
Offline abies

Senior Devvie





« Reply #2 - Posted 2003-01-15 18:42:13 »

Exact testing needs to be done, but I do think that HashSet version should be an order of magnitude faster.

In theory HashSet insert is O(1) and ArrayList remove of _single_ element is O(n). So here we have O(n) versus O(n^2) complexity, a BIG difference.

Of course, for small n, other costs will be important. But I do not expect that remove version will be faster for anything over 5-6 elements.

Artur Biesiadowski
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline opinali

Junior Newbie




Java games rock!


« Reply #3 - Posted 2003-02-01 08:07:24 »

If both ArrayLists are sorted, the fastest way is coding a loop that iterates both arrays in parallel and for each iteration, copies the lower-ordering element to a new array.
Pages: [1]
  ignore  |  Print  
 
 
You cannot reply to this message, because it is very, very old.

 

Add your game by posting it in the WIP section,
or publish it in Showcase.

The first screenshot will be displayed as a thumbnail.

rwatson462 (31 views)
2014-12-15 09:26:44

Mr.CodeIt (23 views)
2014-12-14 19:50:38

BurntPizza (50 views)
2014-12-09 22:41:13

BurntPizza (84 views)
2014-12-08 04:46:31

JscottyBieshaar (45 views)
2014-12-05 12:39:02

SHC (59 views)
2014-12-03 16:27:13

CopyableCougar4 (57 views)
2014-11-29 21:32:03

toopeicgaming1999 (123 views)
2014-11-26 15:22:04

toopeicgaming1999 (114 views)
2014-11-26 15:20:36

toopeicgaming1999 (32 views)
2014-11-26 15:20:08
Resources for WIP games
by kpars
2014-12-18 10:26:14

Understanding relations between setOrigin, setScale and setPosition in libGdx
by mbabuskov
2014-10-09 22:35:00

Definite guide to supporting multiple device resolutions on Android (2014)
by mbabuskov
2014-10-02 22:36:02

List of Learning Resources
by Longor1996
2014-08-16 10:40:00

List of Learning Resources
by SilverTiger
2014-08-05 19:33:27

Resources for WIP games
by CogWheelz
2014-08-01 16:20:17

Resources for WIP games
by CogWheelz
2014-08-01 16:19:50

List of Learning Resources
by SilverTiger
2014-07-31 16:29:50
java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!