You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have a use case where I need fast prefix sum over the elements of a flex_vector at an index and the ability to find the smallest index in a flex_vector where the prefix sum is greater than or equal to a specified value. This should be doable by decorating the internal nodes with a sum of weights for each of their children where the sum of weights for a leaf node is the sum of the values (possibly after applying some function to the value like measurements in 2-3 finger trees, also possibly allowing for operators other than addition such as min to allow for ordered set/map semantics). I had started writing my own library for a similar datastructure to do this when I came across this project and it seems like you've done pretty much everything I wanted to do except for weights.
If this is something you are interested in doing let me know. If it is not something you are interested in doing but is something you'd be possibly interested in accepting a pull request for, also let me know. Thanks.
The text was updated successfully, but these errors were encountered:
Thanks for the suggestion. I do think that this is indeed an interesting feature.
If this is for a commercial project, maybe we could agree on a development contract for the feature, send me an email to discuss the details. In any case I'd be interested in a pull request in this direction. You can send me an email too to discuss the API details.
I have a use case where I need fast prefix sum over the elements of a flex_vector at an index and the ability to find the smallest index in a flex_vector where the prefix sum is greater than or equal to a specified value. This should be doable by decorating the internal nodes with a sum of weights for each of their children where the sum of weights for a leaf node is the sum of the values (possibly after applying some function to the value like measurements in 2-3 finger trees, also possibly allowing for operators other than addition such as min to allow for ordered set/map semantics). I had started writing my own library for a similar datastructure to do this when I came across this project and it seems like you've done pretty much everything I wanted to do except for weights.
If this is something you are interested in doing let me know. If it is not something you are interested in doing but is something you'd be possibly interested in accepting a pull request for, also let me know. Thanks.
The text was updated successfully, but these errors were encountered: