Eelco Hoogendoorn

What I currently do is to let the order in which the annotations are registered be defining for the order in which they are matched. With an optional kwarg to...

yeah... I dont know that there is a general answer to the question of how to implement such comparisons... the other option would be for the matching function to return...

Managed to narrow down the issue. The problem is a lack of conda-forge numpy 1.11 packages for python 3.8. So the build works on py37, or py38 with np1.19 for...

True; this is a conda problem more than anything. But if the purpose of this repo is to provide a complete project skeleton that 'just works', working around / pointing...

Ah I just realized that me pinning to python {{ python }} also really isnt necessary, as the example implies; I thought I inferred that was actually required to get...

Hi; There are various graph-like algorithms that you can *reasonably efficiently* implement using the techniques in this library; at least compared to any python for loops; but its not going...

Ah posted that last comment without refreshing my page; thats a lot more of a self-contained problem! Indeed you could do something like: ``` idx = npi.indices(G.flatten(), C.flatten()) idx =...

I like the spirit of it as well, but I started this project with some design goals in mind that I think are at odds with it. I started this...

You are correct; in some cases the numpy solution leaves a lot of potential gains on the table; however, for my personal use cases it has always been 'good enough'....

1: define sorted. I suppose you mean sorting by the values in each split group; but what does that mean when splitting a multidimensional array in the first place? 2:...