Info
此问题已关闭。 请重新打开它进行编辑或回答。
speed up for long list matching
2 次查看(过去 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!