How To: Multi-level subindexing

2 次查看(过去 30 天)
I'm tryig to achieve a proper 1-line ndex/sub-indexing operation, but have thus far failed to get the syntax right
ArrayA = sparse(100,100000);
ArrayA(randi(100*100000,[7000 1])) = (82-36).*rand(7000,1)+36;
[ArrayAFull(:,1),ArrayAFull(:,2),ArrayAFull(:,3)] = find(ArrayA);
ArrayB = sparse(100,100000);
ArrayB(randi(100*100000,[7000 1])) = (90-30).*rand(7000,1)+30;
[ArrayBFull(:,1),ArrayBFull(:,2),ArrayBFull(:,3)] = find(ArrayB);
[~,IdxA,IdxB] = intersect(ArrayAFull(:,[1,2]),ArrayBFull(:,[1,2]),'stable','rows');
t1 = ArrayBFull(ArrayBFull(IdxB,1)==1,:); %This is where things go sour
%The next two lines get me the actually desired matrix
t2 = ArrayBFull(IdxB,:);
t2 = t2(t2(:,1)==1,:);
isequal(t1,t2); %false
Is it possible to compress the t2 lines into a single line, or no?

采纳的回答

Walter Roberson
Walter Roberson 2023-2-7
Yes, it is, but it is fairly ugly to do so. You can call upon subsref() manually, possibly having used substruct() to help build the appropriate structure.
It is usually a lot easier to use a helper function. For example,
SelectRowWhere = @(expression, where) expression(expression(:,1)==where,:);
t2 = SelectRowWhere(ArrayBFul(IdxB,:), 1)
  3 个评论
Walter Roberson
Walter Roberson 2023-2-7
The two line version would typically be faster, as calling an anonymous function is notably slower than calling a non-anonymous function.

请先登录,再进行评论。

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Parallel Computing 的更多信息

标签

产品


版本

R2019b

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by