Hi, I am working on a combinatorial problem called Block Design: Block design - Wikipedia ( specifically Pairwise balanced uniform designs (2-designs or BIBDs) ) I try to group N=25 samples (e.g. integers 1:25) into “blocks” (aka pools) of 5 samples each, where each pair of samples only occurs in…

[image] david.brust: layer(PD, l) = @view M[ ((l-1)*PD.q+1):(l * PD.q), :] I noticed now that M is not an input of layer. Probably it should be.

Function speed up, reduce allocations

lmiq November 17, 2021, 12:33pm 7

I noticed now that M is not an input of layer. Probably it should be.

4 Likes

Topic		Replies	Views
Help to reduce number of allocations General Usage	23	5569	January 6, 2019
Performance Tips for Combinatorial Problem Performance	16	1219	January 10, 2020
Controlling memory allocation using external struct as placeholder General Usage question	5	895	March 11, 2017
Request guidance in optimising the performance of my implementation (running time and allocation) General Usage question	9	1026	April 30, 2018
Avoid calling push! in Base.find Internals & Design	2	817	January 7, 2017