uniquesortableobj.m

Go to the documentation of this file.

function [unqVec,indRight2LeftVec,indLeft2RightVec]=uniquesortableobj(inpVec)
isRowInput = isrow(inpVec);
%
inpVec = inpVec(:);
nInpElems = numel(inpVec);
%
if nargout > 1
    [sortedInpVec,indSortedVec] = sort(inpVec);
else
    sortedInpVec = sort(inpVec);
end
%
isEqualSortedNeighborVec=sortedInpVec(1:nInpElems-1)~=...
    sortedInpVec(2:nInpElems);
%
if (nInpElems ~= 0)
    isEqualSortedNeighborVec = [true; isEqualSortedNeighborVec];
else
    isEqualSortedNeighborVec = zeros(0,1);
end
%
unqVec = sortedInpVec(isEqualSortedNeighborVec);
if nargout > 1
    indRight2LeftVec = indSortedVec(isEqualSortedNeighborVec);
end
%
if nargout == 3
    isEqualSortedNeighborVec = full(isEqualSortedNeighborVec);
    if nInpElems == 0
        indLeft2RightVec = zeros(0,1);
    else
        indLeft2RightVec = cumsum(isEqualSortedNeighborVec);
        indLeft2RightVec(indSortedVec) = indLeft2RightVec;
    end
end
%
if isRowInput
    unqVec = unqVec.';
end