This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[package] | |
name = "gh-pr-cli" | |
version = "0.1.0" | |
edition = "2021" | |
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html | |
[dependencies] | |
async-openai = "0.10.2" | |
dotenvy = "0.15.7" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
mods \ total mods in pool | |
desired \______________________________________________ | |
| 1 | 2 | 3 | 4 | 5 | 6 | | |
-------------|-------|-------|-------|-------|-------|------- | |
1 | 0.667 | 0.667 | 0.633 | 0.563 | 0.500 | 0.450 | | |
-------------|-------|-------|-------|-------|-------|------- | |
2 | 0.000 | 0.333 | 0.367 | 0.267 | 0.200 | 0.160 | | |
-------------|-------|-------|-------|-------|-------|------- | |
3 | 0.000 | 0.000 | 0.200 | 0.087 | 0.050 | 0.035 | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <CoreFoundation/CoreFoundation.h> | |
#include <stdio.h> | |
int main() | |
{ | |
CFStringRef DO_NOT_DISTURB = CFStringCreateWithCString(kCFAllocatorDefault, "doNotDisturb", kCFStringEncodingUTF8); | |
CFStringRef APP_ID = CFStringCreateWithCString(kCFAllocatorDefault, "com.apple.notificationcenterui", kCFStringEncodingUTF8); | |
Boolean keyExists; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Stack extends Array { | |
top() { | |
return this[this.length - 1]; | |
} | |
size() { | |
return this.length; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Hypothetical distribution of study results in a population with 0% prevalence using a test with 98.5% selectivity | |
[0.0078, 0.0084]: | | |
[0.0084, 0.0090]: | | |
[0.0090, 0.0096]: || | |
[0.0096, 0.0102]: ||||| | |
[0.0102, 0.0108]: ||||||||| | |
[0.0108, 0.0114]: |||||||||||||||||| | |
[0.0114, 0.0120]: |||||||||||||||||||||||||||||||| | |
[0.0120, 0.0126]: |||||||||||||||||||||||||||||||||||||||||||||||| |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstddef> | |
#include <iomanip> | |
#include <iostream> | |
#include <sstream> | |
#include <string> | |
using namespace std; | |
class Foo { | |
public: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const fs = require('fs'); | |
const mathWASM = fs.readFileSync('./math.wasm'); | |
const mainWASM = fs.readFileSync('./main.wasm'); | |
async function main() { | |
// Both modules will share this table | |
const table = new WebAssembly.Table({ | |
element: "anyfunc", | |
initial: 3, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
There are a certain number of doors (usually 3). Behind one is a prize. Behind the others are goats. | |
The contestant picks a door, and then the host removes one of the non-selected choices that did contain | |
the prize. The contestant is given the option to either keep their original choice, or switch to one of | |
the remaining doors. What should they do? | |
Let's simulate their potential decisions to find out! | |
*/ | |
const doors = [1, 2, 3] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Copyright (C) 2015 Comcast Cable Communications, LLC | |
// Contact Us: http://customer.xfinity.com/contact-us/ | |
// Intended use of this message is to display critical and time sensitive notifications to customers. | |
/* | |
This program is free software; you can redistribute it and/or | |
modify it under the terms of the GNU General Public License | |
as published by the Free Software Foundation; either version 2 | |
of the License, or (at your option) any later version. | |
This program is distributed in the hope that it will be useful, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use strict' | |
const async = makeGenerator => function () { | |
const generator = makeGenerator.apply(this, arguments); | |
const handle = result => | |
result.done | |
? Promise.resolve(result.value) | |
: Promise.resolve(result.value) | |
.then(res => handle(generator.next(res))) |
NewerOlder