Info
이 질문은 마감되었습니다. 편집하거나 답변을 올리려면 질문을 다시 여십시오.
speed up for long list matching
조회 수: 3 (최근 30일)
이전 댓글 표시
Is there a better way to do this as the length of idtsall is more than 30k? Thanks in advance.
for n = 1:length(idtsall)
ind = find(ismember(idts, idtsall{n}));
if(ind > 0)
ranktsall(n) = rankts(ind);
else
ranktsall(n) = 0;
end
end
댓글 수: 0
답변 (3개)
Walter Roberson
2012년 1월 5일
The two-output ismember will return the index in the second output, allowing you to skip the find() step. The first output of insmember() will indicate whether it was found or not.
[foundit, ind] = ismember(idts, idtsall{n});
if foundit
ranksall(n) = rankts(ind);
else
ranksall(n) = 0;
end
Now, to check: idtsall is a cell array of vectors? All the same size or different sizes?
댓글 수: 3
Jan
2012년 1월 5일
What type and dimension is idts?
ranktsall = zeros(1, length(idtsall); % Pre-allocate!
for n = 1:length(idtsall)
ind = find();
if all(ismember(idts, idtsall{n})) % Explicite ALL
ranktsall(n) = rankts(ind);
end
end
With a pre-allocation the processing is much faster and the else branch is not required anymore.
There can be much faster methods depending of the size and dimensions of idts and the contents of idtsall.
댓글 수: 1
이 질문은 마감되었습니다.
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!