Boolean Indexing support ?

[jjjkkkjjj]

Boolean Indexing support ?

[jjjkkkjjj]

Unfortunately Boolean indexing (and fancy indexing) has not been supported yet in Matft.
But fortunately, I found vdsp function to achieve them.

So I’ll try to implement them! So could you wait for a moment?

And the reason of low performance in element-wise operation is n-dimensional array’s data structure. Therefore, for-loop operations in n-dimensional array such like Matft and numpy tend to be slow.
So, please convert into Swift Array by toArray() until I implement them;

var bar = MfArray(testing, shape: [400,400])
let swiftArray = bar.toArray()  as! [[Int]]
for i in 0..<400 {
    for j in 0..<400 {
        bar[i][j] = bar[i][j] + 1
    }
}

[jjjkkkjjj]

@Ykid
I've implemented Boolean Indexing!! (but i do not check performance...)
Anyway, you can assign values with boolean like this;

let img = MfArray([[1, 2, 3],
                               [4, 5, 6],
                               [7, 8, 9]], mftype: .UInt8)
img[img > 3] = MfArray([10], mftype: .UInt8)
print(img)
/*
mfarray = 
[[	1,		2,		3],
[	10,		10,		10],
[	10,		10,		10]], type=UInt8, shape=[3, 3]
*/

[Ykid]

Great thanks ! Let me verify it these days

[Ykid]

@jjjkkkjjj The implementation is pretty fast ! 👍