issue_comments

Table actions

3 rows where author_association = "MEMBER" and issue = 138443211 sorted by updated_at descending

✎ View and edit SQL

This data as json, CSV (advanced)

Suggested facets: created_at (date), updated_at (date)

user 3

issue 1

  • almost-equal grids · 3 ✖

author_association 1

  • MEMBER · 3 ✖
id html_url issue_url node_id user created_at updated_at ▲ author_association body reactions performed_via_github_app issue
201702889 https://github.com/pydata/xarray/issues/784#issuecomment-201702889 https://api.github.com/repos/pydata/xarray/issues/784 MDEyOklzc3VlQ29tbWVudDIwMTcwMjg4OQ== jhamman 2443309 2016-03-26T04:20:10Z 2016-03-26T04:20:10Z MEMBER

@mathause - any reason to keep this open or did we sort this out?

 
{
    "total_count": 0,
    "+1": 0,
    "-1": 0,
    "laugh": 0,
    "hooray": 0,
    "confused": 0,
    "heart": 0,
    "rocket": 0,
    "eyes": 0
}
   almost-equal grids 138443211
192351311 https://github.com/pydata/xarray/issues/784#issuecomment-192351311 https://api.github.com/repos/pydata/xarray/issues/784 MDEyOklzc3VlQ29tbWVudDE5MjM1MTMxMQ== mathause 10194086 2016-03-04T16:45:02Z 2016-03-04T16:45:02Z MEMBER

That sounds good. Do you need both, methodand tolerance?

What I do at the moment is probably not as elegant:

ds.coords['lat'] = np.round(ds['lat'], 4) ds.coords['lon'] = np.round(ds['lon'], 4)

 
{
    "total_count": 0,
    "+1": 0,
    "-1": 0,
    "laugh": 0,
    "hooray": 0,
    "confused": 0,
    "heart": 0,
    "rocket": 0,
    "eyes": 0
}
   almost-equal grids 138443211
192340787 https://github.com/pydata/xarray/issues/784#issuecomment-192340787 https://api.github.com/repos/pydata/xarray/issues/784 MDEyOklzc3VlQ29tbWVudDE5MjM0MDc4Nw== shoyer 1217238 2016-03-04T16:18:17Z 2016-03-04T16:18:17Z MEMBER

This doesn't work automatically, but you can use the method='nearest' and the tolerance argument with .reindex or .reindex_like to align two datasets with different grids, i.e.,

second = first.reindex_like(second, method='nearest', tolerance=0.001)

It would be nice for this to be able to work automatically, but the challenge is picking a heuristic that does not violate the principle of least surprise. A proposed a few ideas in a related issue in pandas (https://github.com/pydata/pandas/issues/9817#issuecomment-115465360).

 
{
    "total_count": 0,
    "+1": 0,
    "-1": 0,
    "laugh": 0,
    "hooray": 0,
    "confused": 0,
    "heart": 0,
    "rocket": 0,
    "eyes": 0
}
   almost-equal grids 138443211

Advanced export

JSON shape: default, array, newline-delimited, object

CSV options: 

CREATE TABLE [issue_comments] (
   [html_url] TEXT,
   [issue_url] TEXT,
   [id] INTEGER PRIMARY KEY,
   [node_id] TEXT,
   [user] INTEGER REFERENCES [users]([id]),
   [created_at] TEXT,
   [updated_at] TEXT,
   [author_association] TEXT,
   [body] TEXT,
   [reactions] TEXT,
   [performed_via_github_app] TEXT,
   [issue] INTEGER REFERENCES [issues]([id])
);
CREATE INDEX [idx_issue_comments_issue]
    ON [issue_comments] ([issue]);
CREATE INDEX [idx_issue_comments_user]
    ON [issue_comments] ([user]);