issue_comments: 420373780
This data as json
| html_url | issue_url | id | node_id | user | created_at | updated_at | author_association | body | reactions | performed_via_github_app | issue |
|---|---|---|---|---|---|---|---|---|---|---|---|
| https://github.com/pydata/xarray/issues/2399#issuecomment-420373780 | https://api.github.com/repos/pydata/xarray/issues/2399 | 420373780 | MDEyOklzc3VlQ29tbWVudDQyMDM3Mzc4MA== | 1217238 | 2018-09-11T18:28:43Z | 2018-09-11T18:28:43Z | MEMBER | CC @fujiisoup who implemented much of this. I will also take a look at your doc when I have the chance. I do think that handling duplicate matches with indexing is an important use-case. This comes up with nearest neighbor matching as well -- it would be useful to be able to return the full set of matches within a given distance, not just the nearest match. I wonder if it would be more productive to consider a new indexing API for one -> many matches. |
{
"total_count": 0,
"+1": 0,
"-1": 0,
"laugh": 0,
"hooray": 0,
"confused": 0,
"heart": 0,
"rocket": 0,
"eyes": 0
} |
357156174 |