{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":357306244,"defaultBranch":"master","name":"zig","ownerLogin":"saltzm","currentUserCanPush":false,"isFork":true,"isEmpty":false,"createdAt":"2021-04-12T18:55:57.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/3291217?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1618253764.205821","currentOid":""},"activityList":{"items":[{"before":"621be32c5f20eb40e89a133a52e092b172c4188a","after":"cec35ac08db95e8ab18e9eb997bd2eb59ecdfa0a","ref":"refs/heads/master","pushedAt":"2024-09-24T16:19:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"Update capacity comment in lib/std/priority_queue.zig\n\nCo-authored-by: Andrew Kelley <andrew@ziglang.org>","shortMessageHtmlLink":"Update capacity comment in lib/std/priority_queue.zig"}},{"before":"42981fec07e68ef0aff365dc012134c4cf4e9f62","after":"621be32c5f20eb40e89a133a52e092b172c4188a","ref":"refs/heads/master","pushedAt":"2024-09-17T22:26:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"Revert \"Change PriorityQueue to store current length rather than capacity\"\n\nThis reverts commit 42981fec07e68ef0aff365dc012134c4cf4e9f62.","shortMessageHtmlLink":"Revert \"Change PriorityQueue to store current length rather than capa…"}},{"before":"57b66a9223d27bf4b35d3ae002e90385195216c3","after":"42981fec07e68ef0aff365dc012134c4cf4e9f62","ref":"refs/heads/master","pushedAt":"2024-09-17T21:25:20.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"Change PriorityQueue to store current length rather than capacity","shortMessageHtmlLink":"Change PriorityQueue to store current length rather than capacity"}},{"before":"820a07f8e4c5e9f2e4d0cb50ceed287ef2fca112","after":"57b66a9223d27bf4b35d3ae002e90385195216c3","ref":"refs/heads/master","pushedAt":"2024-09-17T16:31:19.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"std.PriorityQueue: Convert to an 'unmanaged'-style API\n\nResolves: #21432.\n\nRemoved the allocator field from the PriorityQueue struct and\nadapted functions to take an allocator where needed.\n\nUpdated tests accordingly.","shortMessageHtmlLink":"std.PriorityQueue: Convert to an 'unmanaged'-style API"}},{"before":"812557bfde3c577b5f00cb556201c71ad5ed6fa4","after":"820a07f8e4c5e9f2e4d0cb50ceed287ef2fca112","ref":"refs/heads/master","pushedAt":"2024-09-17T00:54:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"std.PriorityQueue: Convert to an 'unmanaged'-style API\n\nRemoved the allocator field from the PriorityQueue struct and\nadapted functions to take an allocator where needed.\n\nUpdated tests accordingly.","shortMessageHtmlLink":"std.PriorityQueue: Convert to an 'unmanaged'-style API"}},{"before":"c4c7cb252a4a9c54a1c4eac6c990dec4b61024d4","after":"812557bfde3c577b5f00cb556201c71ad5ed6fa4","ref":"refs/heads/master","pushedAt":"2024-09-16T21:55:51.000Z","pushType":"push","commitsCount":10000,"pusher":{"login":"saltzm","name":"Matthew Saltz","path":"/saltzm","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3291217?s=80&v=4"},"commit":{"message":"std: Restore conventional `compareFn` behavior for `binarySearch`\n\nPR #20927 made some improvements to the `binarySearch` API, but one\nchange I found surprising was the relationship between the left-hand and\nright-hand parameters of `compareFn` was inverted. This is different\nfrom how comparison functions typically behave, both in other parts of\nZig (e.g. `std.math.order`) and in other languages (e.g. C's `bsearch`).\nUnless a strong reason can be identified and documented for doing\notherwise, I think it'll be better to stick with convention.\n\nWhile writing this patch and changing things back to the way they were,\nthe predicates of `lowerBound` and `upperBound` seemed to be the only\nareas that benefited from the inversion. I don't think that benefit is\nworth the cost, personally. Calling `Order.invert()` in the predicates\naccomplishes the same goal.","shortMessageHtmlLink":"std: Restore conventional <code>compareFn</code> behavior for <code>binarySearch</code>"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0yNFQxNjoxOTowNi4wMDAwMDBazwAAAAS_YhCt","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0yNFQxNjoxOTowNi4wMDAwMDBazwAAAAS_YhCt","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xNlQyMTo1NTo1MS4wMDAwMDBazwAAAAS36S_W"}},"title":"Activity · saltzm/zig"}