Hi !
Featured games (85)
games approved by the League of Dukes
Games in Showcase (636)
Games in Android Showcase (178)
games submitted by our members
Games in WIP (687)
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 8688 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);
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.

Dwinin (72 views)
2015-11-07 13:29:08

Rems19 (81 views)
2015-10-31 01:36:56

Rems19 (74 views)
2015-10-31 01:32:37

williamwoles (107 views)
2015-10-23 10:42:59

williamwoles (93 views)
2015-10-23 10:42:45

Jervac_ (107 views)
2015-10-18 23:29:12

DarkCart (135 views)
2015-10-16 00:58:11

KaiHH (116 views)
2015-10-11 14:10:14

KaiHH (156 views)
2015-10-11 13:26:18

BurntPizza (171 views)
2015-10-08 03:11:46
Rendering resources
by Roquen
2015-11-13 14:37:59

Rendering resources
by Roquen
2015-11-13 14:36:58

Math: Resources
by Roquen
2015-10-22 07:46:10

Networking Resources
by Roquen
2015-10-16 07:12:30

Rendering resources
by Roquen
2015-10-15 07:40:48

Math: Inequality properties
by Roquen
2015-10-01 13:30:46

Math: Inequality properties
by Roquen
2015-09-30 16:06:05

HotSpot Options
by Roquen
2015-08-29 11:33:11 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‑
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!