What should I call a function that takes in a collection of sets and two optional parameters N and M, and returns a set of all elements that appear in each of the input sets between N and M times?
Currently I just call it "intersection" (and describe it as an "arbitrary intersection" in a comment), but strictly speaking it's only an (arbitrary) intersection when N == M == length(collection_of_sets), which is the default. On the other extreme when N == 1 and M == length(collection_of_sets) the result is an (arbitrary) union. I'm not really sure what the call the cases for other values of N and M / the general operation represented by the function.
Mostly I want to avoid mathematicians pointing and laughing at my misuse of set theoretical terminology.
David Bell
I love too, loli appreciating user.
Wrong, I love him
Luke Morris
frequency filter
Charles Campbell
It's my understanding that filters are a set theory thing as well so I need to tread carefully.
Josiah Foster
>write an algorithm >get infinite loop and don't know why >leave my house, sitting on the bus >rewrite it in my phone from memory, so I can post it here and ask about it >works perfectly
no you dont make it consistent with the rest of your code and thats it if you want to have a formally correct in all contexts name it's going to be super long and stupid filter is normally used for a function that takes one set and builds another set based on elements that pass the test, which is what you're doing, with a range, you could call it a range filter
I just spent an hour on "Codility" doing a C programming skill test. It was the first time programming C (not C++) in 10+ years. I felt so naked and weak.
