Ref: https://github.com/JuliaLang/julia/issues/13024
On Tuesday, September 8, 2015 at 5:17:57 PM UTC-7, Seth wrote:
>
> Thanks, James. Is this worthy of a github issue?
>
> On Tuesday, September 8, 2015 at 5:00:53 PM UTC-7, James Fairbanks wrote:
>>
>> #= This is the function from Base that is bei
Thanks, James. Is this worthy of a github issue?
On Tuesday, September 8, 2015 at 5:00:53 PM UTC-7, James Fairbanks wrote:
>
> #= This is the function from Base that is being used when you call & on
>>> two sparse matrices
>>> function ($f){S,T}(A::AbstractArray{S}, B::AbstractArray{T})
>>>
>
> #= This is the function from Base that is being used when you call & on
>> two sparse matrices
>> function ($f){S,T}(A::AbstractArray{S}, B::AbstractArray{T})
>> F = similar(A, promote_op($F,S,T), promote_shape(size(A),size(B)))
>> for i in eachindex(A,B)
>> @inbounds F[i] =
(and I realize that my code is really just resultmx[r,c] = !b[r,c] but I
wanted to focus on the timing of equivalent boolean operators.)
On Tuesday, September 8, 2015 at 3:21:35 PM UTC-7, Seth wrote:
>
> Hi all,
>
> I ran into some puzzling performance today with sparse matrices. I defined
>
> _c
