static enum CapCode getHaplotypeSwitchCode(Cap *cap, stList *eventStrings) {
Cap *adjacentCap = cap_getAdjacency(getTerminalCap(cap));
assert(adjacentCap != NULL);
End *end = cap_getEnd(cap);
End *adjacentEnd = cap_getEnd(adjacentCap);
stSortedSet *eventStringsForEnd1 = getEventStrings(end, eventStrings);
stSortedSet *eventStringsForEnd2 = getEventStrings(adjacentEnd, eventStrings);
assert(stSortedSet_size(eventStringsForEnd1) > 0);
assert(stSortedSet_size(eventStringsForEnd2) > 0);
stSortedSet *intersectionOfEventStrings = stSortedSet_getIntersection(
eventStringsForEnd1, eventStringsForEnd2);
enum CapCode code1 = (stSortedSet_size(intersectionOfEventStrings)
!= stSortedSet_size(eventStringsForEnd1) || stSortedSet_size(
intersectionOfEventStrings)
!= stSortedSet_size(eventStringsForEnd2)) ? HAP_SWITCH
: HAP_NOTHING;
stSortedSet_destruct(eventStringsForEnd1);
stSortedSet_destruct(eventStringsForEnd2);
stSortedSet_destruct(intersectionOfEventStrings);
return code1;
}
static void test_stSortedSetIntersection(CuTest* testCase) {
sonLibSortedSetTestSetup();
//Check intersection of empty sets is okay..
stSortedSet *sortedSet3 = stSortedSet_getIntersection(sortedSet, sortedSet2);
CuAssertTrue(testCase, stSortedSet_size(sortedSet3) == 0);
stSortedSet_destruct(sortedSet3);
int32_t i;
for(i=0; i<size; i++) {
stSortedSet_insert(sortedSet, stIntTuple_construct(1, input[i]));
}
//Check intersection of empty and non-empty set is empty.
sortedSet3 = stSortedSet_getIntersection(sortedSet, sortedSet2);
CuAssertTrue(testCase, stSortedSet_size(sortedSet3) == 0);
stSortedSet_destruct(sortedSet3);
//Check intersection of two non-empty, overlapping sets in correct.
stSortedSet_insert(sortedSet2, stIntTuple_construct(1, 0));
stSortedSet_insert(sortedSet2, stIntTuple_construct(1, 1));
stSortedSet_insert(sortedSet2, stIntTuple_construct(1, 5));
sortedSet3 = stSortedSet_getIntersection(sortedSet, sortedSet2);
CuAssertTrue(testCase, stSortedSet_size(sortedSet3) == 2);
stIntTuple *intTuple = stIntTuple_construct(1, 1);
CuAssertTrue(testCase, stSortedSet_search(sortedSet3, intTuple) != NULL);
stIntTuple_destruct(intTuple);
intTuple = stIntTuple_construct(1, 5);
CuAssertTrue(testCase, stSortedSet_search(sortedSet3, intTuple) != NULL);
stIntTuple_destruct(intTuple);
stSortedSet_destruct(sortedSet3);
//Check we get an exception with sorted sets with different comparators.
stSortedSet *sortedSet4 = stSortedSet_construct();
stTry {
stSortedSet_getIntersection(sortedSet, sortedSet4);
} stCatch(except) {
CuAssertTrue(testCase, stExcept_getId(except) == SORTED_SET_EXCEPTION_ID);
}
stTryEnd
stSortedSet_destruct(sortedSet4);
sonLibSortedSetTestTeardown();
}
