Iteratively compute the Cartesian product of an arbitrary number of sets

by

I’ve written a solution that doesn’t require you to fill up a large collection in memory. Unfortunately, the code required is hundreds of lines long. You may have to wait until it appears in the Guava project (https://github.com/google/guava), which I hope will be by the end of the year. Sorry. 🙁

Note that you may not need such a utility if the number of sets you’re cartesian-producting is a fixed number known at compile time — you could just use that number of nested for loops.

EDIT: the code is released now.

Sets.cartesianProduct()

I think you’ll be very happy with it. It only creates the individual lists as you ask for them; doesn’t fill up memory with all MxNxPxQ of them.

If you want to inspect the source, it’s here.

Enjoy!

More Related Contents:

  1. Generate all combinations from multiple lists
  2. Cartesian product of an arbitrary number of sets
  3. Obtaining a powerset of a set in Java
  4. What is the difference between Set and List?
  5. Picking a random element from a set
  6. Get unique values from ArrayList in Java
  7. Difference between Iterator and Listiterator?
  8. How to generate the power-set of a given List?
  9. Cartesian product of streams in Java 8 as stream (using streams only)
  10. Performance and Memory allocation comparison between List and Set
  11. Fast algorithm to calculate n! / (q!)^r
  12. How to arrange the datas to display in array by given string of days in java?
  13. Java Questions! About List and Objects
  14. Generating all permutations of a given string
  15. Finding the max/min value in an array of primitives using Java
  16. Which Java Collection should I use?
  17. Natural sort order string comparison in Java – is one built in? [duplicate]
  18. How to calculate elapsed time from now with Joda-Time?
  19. How can I access a folder inside of a resource folder from inside my jar File?
  20. Java – Removing duplicates in an ArrayList
  21. Fast algorithm for searching for substrings in a string
  22. Generating all possible permutations of a list recursively
  23. Parallel execution of directed acyclic graph of tasks
  24. Best way to concatenate List of String objects? [duplicate]
  25. Intersection of two strings in Java
  26. What is the sorting algorithm for Java [closed]
  27. Flatten nested arrays in java
  28. Determine the most common occurrence in an array
  29. Get last element of Stream/List in a one-liner
  30. Example of O(n!)?

Leave a Comment