updateNegCache.m

function [neg] = updateNegCache(allNeg, oldNeg, model, sizeLimit)
[bboxes bestDetections detectionsAtThresholds] = detectParallel(allNeg, model, -1, true, false);

neg = [];
ambiguousData = [];
r_idx = randperm(length(allNeg));
for idx=1:length(r_idx)
    i = r_idx(idx);
    if length(neg) > sizeLimit
        break;
    end
    
    bestDetection = bestDetections{i};
    if bestDetection(1).score < -1
        continue;
    end
    
    for j=1:length(bestDetection)
        entry.rootLoc = bestDetection(j).rootLoc;
        entry.partLocs = bestDetection(j).partLocs;
        entry.level = bestDetection(j).level;
        entry.component = bestDetection(j).component;
        entry.im = allNeg(i).im;
        entry.id = allNeg(i).id;
        entry.x1 = bestDetection(j).rootBbox(1);
        entry.y1 = bestDetection(j).rootBbox(2);
        entry.x2 = bestDetection(j).rootBbox(3);
        entry.y2 = bestDetection(j).rootBbox(4);
        neg = [neg; entry];
        if length(neg) > sizeLimit
            break;
        end
    end
    
    dAtThresh = detectionsAtThresholds{i};
    for j=1:length(dAtThresh)
        entry.im = allNeg(i).im;
        entry.id = allNeg(i).id;
        bbox = dAtThresh(j).rootBbox;
        entry.rootLoc = dAtThresh(j).rootLoc;
        entry.partLocs = dAtThresh(j).partLocs;
        entry.level = dAtThresh(j).level;
        entry.component = dAtThresh(j).component;
        entry.x1 = bbox(1);
        entry.y1 = bbox(2);
        entry.x2 = bbox(3);
        entry.y2 = bbox(4);
        ambiguousData = [ambiguousData;entry];
    end
end


% keep old negs that are ambiguous
oldIdSet = java.util.HashSet;
for i=1:length(oldNeg)
    id = oldNeg(i).id;
    oldIdSet.add(id);
end

for i=1:length(ambiguousData)
    if length(neg) > sizeLimit
        break;
    end
    if oldIdSet.contains(ambiguousData(i).id)
        neg = [neg;ambiguousData(i)];
        if length(neg) > sizeLimit
            break;
        end
    end
end