{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":158752531,"defaultBranch":"master","name":"rstar","ownerLogin":"georust","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2018-11-22T21:42:40.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/10320338?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1715199760.0","currentOid":""},"activityList":{"items":[{"before":"6812c6f54e30c1f1993b1fc95fe62482256576ba","after":null,"ref":"refs/heads/numerical-instability-infinite-recursion","pushedAt":"2024-05-08T20:22:40.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"}},{"before":"0139255a78ada92277ce0d1025c009254ea5b298","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-166-84d12654104e783011f24267145fb6bfccd2a30e","pushedAt":"2024-05-08T20:20:02.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}},{"before":"84d12654104e783011f24267145fb6bfccd2a30e","after":"0139255a78ada92277ce0d1025c009254ea5b298","ref":"refs/heads/master","pushedAt":"2024-05-08T20:20:01.000Z","pushType":"merge_queue_merge","commitsCount":1,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Defend against numerical instability when computing number of clusters (#166)\n\n- [x] I agree to follow the project's [code of\nconduct](https://github.com/georust/geo/blob/master/CODE_OF_CONDUCT.md).\n- [x] I added an entry to `rstar/CHANGELOG.md` if knowledge of this\nchange could be valuable to users.\n---\n\nApparently, it can happen that n.log(k) yields j+eps even though k^j=n\nexactly. After the call to ceil, this ends up with `depth` being one too\nlarge so that the number of clusters can also end up as one in which\ncase the bulk-loading algorithm enters infinite recursion eventually\noverflowing the stack.\n\nThis change defends against this by ensuring that we always build at\nleast two clusters per recursion step thereby actually reducing the\nnumber of objects the next steps has to consider.","shortMessageHtmlLink":"Defend against numerical instability when computing number of clusters ("}},{"before":null,"after":"0139255a78ada92277ce0d1025c009254ea5b298","ref":"refs/heads/gh-readonly-queue/master/pr-166-84d12654104e783011f24267145fb6bfccd2a30e","pushedAt":"2024-05-08T20:13:15.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Defend against numerical instability when computing number of clusters (#166)\n\n- [x] I agree to follow the project's [code of\nconduct](https://github.com/georust/geo/blob/master/CODE_OF_CONDUCT.md).\n- [x] I added an entry to `rstar/CHANGELOG.md` if knowledge of this\nchange could be valuable to users.\n---\n\nApparently, it can happen that n.log(k) yields j+eps even though k^j=n\nexactly. After the call to ceil, this ends up with `depth` being one too\nlarge so that the number of clusters can also end up as one in which\ncase the bulk-loading algorithm enters infinite recursion eventually\noverflowing the stack.\n\nThis change defends against this by ensuring that we always build at\nleast two clusters per recursion step thereby actually reducing the\nnumber of objects the next steps has to consider.","shortMessageHtmlLink":"Defend against numerical instability when computing number of clusters ("}},{"before":"c5354cb97fa3082a14046c5fd2659f79dc4e89ca","after":"6812c6f54e30c1f1993b1fc95fe62482256576ba","ref":"refs/heads/numerical-instability-infinite-recursion","pushedAt":"2024-05-08T20:04:18.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Defend against numerical instability when computing number of clusters\n\nApparently, it can happen that n.log(k) yields j+eps even though k^j=n exactly.\nAfter the call to ceil, this ends up with `depth` being one too large so that\nthe number of clusters can also end up as one in which case the bulk-loading\nalgorithm enters infinite recursion eventually overflowing the stack.\n\nThis change defends against this by ensuring that we always build at least two\nclusters per recursion step thereby actually reducing the number of objects the\nnext steps has to consider.","shortMessageHtmlLink":"Defend against numerical instability when computing number of clusters"}},{"before":"ac6cefe94591b8b269f4f461116d63f9f0f68f6e","after":"c5354cb97fa3082a14046c5fd2659f79dc4e89ca","ref":"refs/heads/numerical-instability-infinite-recursion","pushedAt":"2024-05-08T20:02:56.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Defend against numerical instability when computing number of clusters\n\nApparently, it can happen that n.log(k) yields j+eps even though k^j=n exactly.\nAfter the call to ceil, this ends up with `depth` being one too large so that\nthe number of clusters can also end up as one in which case the bulk-loading\nalgorithm enters infinite recursion eventually overflowing the stack.\n\nThis change defends against this by ensuring that we always build at least two\nclusters per recursion step thereby actually reducing the number of objects the\nnext steps has to consider.","shortMessageHtmlLink":"Defend against numerical instability when computing number of clusters"}},{"before":null,"after":"ac6cefe94591b8b269f4f461116d63f9f0f68f6e","ref":"refs/heads/numerical-instability-infinite-recursion","pushedAt":"2024-05-08T17:17:42.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Defend against numerical instability when computing number of clusters\n\nApparently, it can happen that n.log(k) yields j+eps even though k^j=n exactly.\nAfter the call to ceil, this ends up with `depth` being to large by one so that\nthe number of clusters can end up as one as well in which case the bulk-loading\nalgorithm enters infinite recursion eventually overflowing the stack.\n\nThis change defends against this by ensuring that we always build at least two\nclusters per recursion step thereby actually reducing the number of objects the\nnext steps has to consider.","shortMessageHtmlLink":"Defend against numerical instability when computing number of clusters"}},{"before":"833150d53293d88b27dae972b2cc7cc9db07ce47","after":"664798b04a1fd8cb58aa6a3be14c19204665dbf8","ref":"refs/heads/internal-iteration","pushedAt":"2024-04-25T05:16:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Add internal iteration variants of locate_in_envelope queries and tighten stack space usage a bit","shortMessageHtmlLink":"Add internal iteration variants of locate_in_envelope queries and tig…"}},{"before":null,"after":"833150d53293d88b27dae972b2cc7cc9db07ce47","ref":"refs/heads/internal-iteration","pushedAt":"2024-04-24T19:00:16.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Provide selection methods based on internal iteration\n\nThis avoids the overhead of allocating an internal buffer to keep\ntrack of upcoming nodes when implementing the `Iterator` trait.","shortMessageHtmlLink":"Provide selection methods based on internal iteration"}},{"before":"c903a5cdf00cce4098b8fb12c1074b8bcc63da86","after":null,"ref":"refs/heads/more-robust-new-empty","pushedAt":"2024-04-06T12:48:22.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"}},{"before":"84d12654104e783011f24267145fb6bfccd2a30e","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-162-650a9017169c602df022fa2a695d42beceeb5bdf","pushedAt":"2024-04-06T11:56:53.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}},{"before":"650a9017169c602df022fa2a695d42beceeb5bdf","after":"84d12654104e783011f24267145fb6bfccd2a30e","ref":"refs/heads/master","pushedAt":"2024-04-06T11:56:52.000Z","pushType":"merge_queue_merge","commitsCount":1,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Fix overflows applying selection iterators to empty trees by choosing a more tame value for AABB::new_empty (#162)\n\n- [x] I agree to follow the project's [code of\nconduct](https://github.com/georust/geo/blob/master/CODE_OF_CONDUCT.md).\n- [x] I added an entry to `rstar/CHANGELOG.md` if knowledge of this\nchange could be valuable to users.\n---\n\nCloses #161","shortMessageHtmlLink":"Fix overflows applying selection iterators to empty trees by choosing…"}},{"before":null,"after":"84d12654104e783011f24267145fb6bfccd2a30e","ref":"refs/heads/gh-readonly-queue/master/pr-162-650a9017169c602df022fa2a695d42beceeb5bdf","pushedAt":"2024-04-06T11:50:54.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Fix overflows applying selection iterators to empty trees by choosing a more tame value for AABB::new_empty (#162)\n\n- [x] I agree to follow the project's [code of\nconduct](https://github.com/georust/geo/blob/master/CODE_OF_CONDUCT.md).\n- [x] I added an entry to `rstar/CHANGELOG.md` if knowledge of this\nchange could be valuable to users.\n---\n\nCloses #161","shortMessageHtmlLink":"Fix overflows applying selection iterators to empty trees by choosing…"}},{"before":"c60f938e2ae847e49443a5726a97991b342b178e","after":"c903a5cdf00cce4098b8fb12c1074b8bcc63da86","ref":"refs/heads/more-robust-new-empty","pushedAt":"2024-04-06T06:42:41.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Fix overflows applying selection iterators to empty trees by choosing a more tame value for AABB::new_empty.","shortMessageHtmlLink":"Fix overflows applying selection iterators to empty trees by choosing…"}},{"before":null,"after":"c60f938e2ae847e49443a5726a97991b342b178e","ref":"refs/heads/more-robust-new-empty","pushedAt":"2024-04-06T06:40:27.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Fix overflows apply selection iterators to empty trees by choosing a more tame value for AABB::new_empty.","shortMessageHtmlLink":"Fix overflows apply selection iterators to empty trees by choosing a …"}},{"before":"650a9017169c602df022fa2a695d42beceeb5bdf","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-160-571755927cfa0472d99b38c9a57df69cf2561812","pushedAt":"2024-03-14T15:05:52.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}},{"before":"571755927cfa0472d99b38c9a57df69cf2561812","after":"650a9017169c602df022fa2a695d42beceeb5bdf","ref":"refs/heads/master","pushedAt":"2024-03-14T15:05:51.000Z","pushType":"merge_queue_merge","commitsCount":1,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Use unstable sort for envelopes and node reinsertion (#160)\n\n* Use unstable sort for envelopes and node reinsertion\n\n* Add changelog entry","shortMessageHtmlLink":"Use unstable sort for envelopes and node reinsertion (#160)"}},{"before":null,"after":"650a9017169c602df022fa2a695d42beceeb5bdf","ref":"refs/heads/gh-readonly-queue/master/pr-160-571755927cfa0472d99b38c9a57df69cf2561812","pushedAt":"2024-03-14T15:00:34.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Use unstable sort for envelopes and node reinsertion (#160)\n\n* Use unstable sort for envelopes and node reinsertion\n\n* Add changelog entry","shortMessageHtmlLink":"Use unstable sort for envelopes and node reinsertion (#160)"}},{"before":"6a8769fab14d4762e31a0329243195093ab4e28a","after":"94090870e1e1fe43accd37fa185759f90ad6f19b","ref":"refs/heads/sort-envelopes-by-center","pushedAt":"2024-02-11T08:50:53.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Add Envelope::sort_envelopes_by_center to avoid intermediate coordinates becoming negative.","shortMessageHtmlLink":"Add Envelope::sort_envelopes_by_center to avoid intermediate coordina…"}},{"before":null,"after":"6a8769fab14d4762e31a0329243195093ab4e28a","ref":"refs/heads/sort-envelopes-by-center","pushedAt":"2024-02-11T08:43:37.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"},"commit":{"message":"Add Envelope::sort_envelopes_by_center to avoid intermediate coordinates becoming negative.","shortMessageHtmlLink":"Add Envelope::sort_envelopes_by_center to avoid intermediate coordina…"}},{"before":"571755927cfa0472d99b38c9a57df69cf2561812","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-159-3b327019bf6826941c22bc0b22b87feebe4d69d5","pushedAt":"2024-02-02T20:43:22.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}},{"before":"3b327019bf6826941c22bc0b22b87feebe4d69d5","after":"571755927cfa0472d99b38c9a57df69cf2561812","ref":"refs/heads/master","pushedAt":"2024-02-02T20:43:22.000Z","pushType":"merge_queue_merge","commitsCount":1,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Point trait: correct doc comment (#159)","shortMessageHtmlLink":"Point trait: correct doc comment (#159)"}},{"before":null,"after":"571755927cfa0472d99b38c9a57df69cf2561812","ref":"refs/heads/gh-readonly-queue/master/pr-159-3b327019bf6826941c22bc0b22b87feebe4d69d5","pushedAt":"2024-02-02T20:35:38.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Point trait: correct doc comment (#159)","shortMessageHtmlLink":"Point trait: correct doc comment (#159)"}},{"before":"ae716a7278fe2c581b1f2cf3c1ff36f9d731f0d3","after":null,"ref":"refs/heads/release_012","pushedAt":"2024-01-28T22:04:31.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"frewsxcv","name":"Corey Farwell","path":"/frewsxcv","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/416575?s=80&v=4"}},{"before":"3b327019bf6826941c22bc0b22b87feebe4d69d5","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-157-181210187e40dc5a5ebbb8dfc91c0d8111a0189f","pushedAt":"2024-01-28T21:53:50.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}},{"before":"181210187e40dc5a5ebbb8dfc91c0d8111a0189f","after":"3b327019bf6826941c22bc0b22b87feebe4d69d5","ref":"refs/heads/master","pushedAt":"2024-01-28T21:53:49.000Z","pushType":"merge_queue_merge","commitsCount":1,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Prepare for 0.12.0 release (#157)","shortMessageHtmlLink":"Prepare for 0.12.0 release (#157)"}},{"before":null,"after":"3b327019bf6826941c22bc0b22b87feebe4d69d5","ref":"refs/heads/gh-readonly-queue/master/pr-157-181210187e40dc5a5ebbb8dfc91c0d8111a0189f","pushedAt":"2024-01-28T21:46:36.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"},"commit":{"message":"Prepare for 0.12.0 release (#157)","shortMessageHtmlLink":"Prepare for 0.12.0 release (#157)"}},{"before":null,"after":"ae716a7278fe2c581b1f2cf3c1ff36f9d731f0d3","ref":"refs/heads/release_012","pushedAt":"2024-01-23T19:19:16.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"urschrei","name":"Stephan Hügel","path":"/urschrei","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/131862?s=80&v=4"},"commit":{"message":"Prepare for 0.12.0 release","shortMessageHtmlLink":"Prepare for 0.12.0 release"}},{"before":"8331b8eb264a160c7ec7054b7f9f04578f5f6c3b","after":null,"ref":"refs/heads/use-small-heap-nn-iter","pushedAt":"2024-01-23T18:32:39.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"adamreichold","name":"Adam Reichold","path":"/adamreichold","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12997846?s=80&v=4"}},{"before":"181210187e40dc5a5ebbb8dfc91c0d8111a0189f","after":null,"ref":"refs/heads/gh-readonly-queue/master/pr-154-f9973cf56e8cd37c98315be6393497273969c4e2","pushedAt":"2024-01-23T18:31:37.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"github-merge-queue[bot]","name":null,"path":"/apps/github-merge-queue","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/9919?s=80&v=4"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAERQNFgAA","startCursor":null,"endCursor":null}},"title":"Activity · georust/rstar"}