| const queryObjectId = Symbol("sql_query") | |
| const sql = (string, ...values) => { | |
| const isQuery = query => query.hasOwnProperty(queryObjectId) | |
| let text = '' | |
| for (const [i, s] of string.entries()) { | |
| text += s | |
| if (i !== string.length - 1) { | |
| if (isQuery(values[i])) { |
| fn main() { | |
| // format a number in two’s complement representation | |
| let a: i8 = -1; | |
| assert_eq!(format!("{:b}", a), "11111111"); | |
| // concatenate 3 bit slices | |
| let b: i8 = (0b10 << 4) + (0b10 << 2) + (0b10); | |
| assert_eq!(b, 0b101010); | |
| #[derive(Debug)] | |
| struct User { | |
| name: String, | |
| email: String, | |
| sign_in_count: u64, | |
| active: bool, | |
| } | |
| impl Default for User { | |
| fn default() -> Self { |
| // .babelrc | |
| // {"plugins": [["@babel/plugin-proposal-pipeline-operator", { "proposal": "minimal" }]]} | |
| const pipeable = (class_) => new Proxy({}, { | |
| get: (target, prop) => ( | |
| (prop in class_.prototype) | |
| ? (...args) => (receiver) => class_.prototype[prop].call(receiver, ...args) | |
| : class_[prop].bind(class_) // https://stackoverflow.com/a/30819436/5915221 | |
| ) | |
| }); |
| const gridToLine = (x, y, width, height) => { | |
| return (y * width) + x; | |
| } | |
| const lineTogrid = (a, width, height) => { | |
| const x = a % width; | |
| const y = a / width; | |
| return [x, y] | |
| } |
| // Given a list of sets [set1, set2, set3, ... setn], and a window with start and end such that (end - start) is constant. | |
| // What is the fastest way to get all possible aggregates of the sets by moving start and end by 1 each time? | |
| // | |
| // example: | |
| // const data = [set1, set2, set3, set4, set5, set6, set7, set8, set9]; | |
| // const windowSize = 4 | |
| // const [s, e] = [0, windowSize] | |
| // | |
| // in this case, our result should be: | |
| // const result = [ |
| # inspired by https://khady.info/opam-npm.html | |
| USAGE="A convenience wrapper for opam | |
| USAGE: | |
| opamx [options] [command] | |
| OPTIONS: | |
| -h, --help Print help information |
There are two ways to declare a component in brisk-reconciler:
let%component counterButtons = () => {
let%hook (count, setCount) = Hooks.state(0);
<view>
<button title="Decrement" onPress={() => setCount(count => count - 1)} />
<text text={"Counter: " ++ str(count)} />
| let add = (a, b) => a + b; | |
| // modules with test attribute will be stripped from source in production mode | |
| // running `esy test` should find and run all the functions inside test modules | |
| [@test] | |
| module Test { | |
| [@desciption "1 + 1 is equal to 2"] | |
| let test_1 = () => { | |
| Assert.areEqual(2, add(1, 1)); | |
| } |