Blist | : green_book : A blog powered by gists | Blog library

The union method returns a set that will keep only distinct elements, and it might (maybe?) discard different elements when running and when evaluating in debugger. I'm not sure how deterministic it's supposed to be, but the order could matter.

This could happen if equals() and/or hashCode() for your elements are defined without using something, or if equals()/hashCode() for something's class is defined without using someOtherFlag. How are these classes defined?

Note that for data classes, only the properties that are present in the primary constructor are taken into account for the generated equals and hashcode methods.

remove() works in-place, which means l will be removed from c and that's it, it won't return a new list.

So you don't really need bList, you can just remove l from c and print(c), like this:

You didn't show how you try to get random elements so you could do something what changes order back to original.

You can use random.shuffle(list) to set random order on the list.
And then you can use for item on list: ... to get items without repetition.

You have to parameterize your generic function (the class doesnt't have to be abstract for that):

Since you have a bunch of threads doing random stuff. You might as well have your JPanel update on it's own.

At the end of your main method.

In all likelihood, you have a situation where you update the view with values just received from cList, which causes the body to be recomputed, which causes another onReceive(vm.cList) {...}, which causes a new publisher to be returned by the computed property cList, which emits the values again and repeats the cycle.

Here's an simplified example of what I mean:

As mentioned in the comments, you need to traverse one List only once, but the other List is traversed once for every item in the first List.

Here's one way to go about it.

Your input file looks like this:

Here’s the corrected and completed version: