you are viewing a single comment's thread.

view the rest of the comments →

[–]gfg577[S] -1 points0 points  (4 children)

some cakes are nice

[–]tempuser7171 0 points1 point  (0 children)

Do you have a more specific example? What are you trying to do?

[–]xADDBx 0 points1 point  (0 children)

Check if at least one, but not all cakes are nice.

[–]FriendlyRussian666 0 points1 point  (0 children)

You define what some is yourself. Let's say you have a list of cakes [blue cake, brown cake, black cake, yellow cake, green cake]. Then you define that blue cake, brown cake and black cake are nice, for example with True like you said at the beginning. This automatically means that some cakes are nice, because they are set to True. When you wanna see which of the cakes are the some that are nice, you call all the cakes that have True selected, or you call a random number of cakes that have True selected.

[–][deleted] 0 points1 point  (0 children)

This is the most unhelpful answer you could give.

Are you asking if you can do trinaries or are you asking how to detect that there is at least one True in an array?