Definition in the textbook is " A group of test inputs that are likely to be processed by the SUT in the same
way." Then can we say that there is some equivalence relation between all members of the set? Must the set be complete (ie there does not exist any equivalent element not in the set) to be considered an equivalence partition?
As a concrete example, say we have some SUT for which n=[5..15] is an equivalence partition. Then is n=[6..14] also an equivalence partition?
Definition in the textbook is " A group of test inputs that are likely to be processed by the SUT in the same way." Then can we say that there is some equivalence relation between all members of the set? Must the set be complete (ie there does not exist any equivalent element not in the set) to be considered an equivalence partition?
As a concrete example, say we have some SUT for which n=[5..15] is an equivalence partition. Then is n=[6..14] also an equivalence partition?