A place to stash experiments I do with godbolt / quickbench / etc.
https://quick-bench.com/q/70Eg-tVt3M4lR4tlMqv3_ZiOcYs
std::map
seems faster below 128 items (when the map is int:int).
(async function generateReplies(document) { | |
// https://conventionalcomments.org/#labels | |
const LABEL = { | |
praise: "👏 praise", | |
nitpick: "🤓 nitpick", | |
suggestion: "💡 suggestion", | |
issue: "🚩 issue", | |
todo: "☑️ todo", | |
question: "❓ question", | |
thought: "💭 thought", |
#!bin/bash | |
issues=`gh issue list -s all -l $1 --json number --jq '.[].number'` | |
echo Relabeling `echo $issues | wc -w` issues | |
for issue in $issues; do | |
gh issue edit --remove-label $1 $issue | |
gh issue edit --add-label $2 $issue | |
done |
A place to stash experiments I do with godbolt / quickbench / etc.
https://quick-bench.com/q/70Eg-tVt3M4lR4tlMqv3_ZiOcYs
std::map
seems faster below 128 items (when the map is int:int).
#include <thrust/scan.h> | |
#include <thrust/device_vector.h> | |
#include <thrust/fill.h> | |
#include <vector> | |
#include <algorithm> | |
#include <cstdlib> | |
int main(int argc, char **argv) | |
{ | |
using T = double; |