Let
- Determine
$a$ - Prove that there exists a line
$y = b$ , such that there are three different intersections of$y = b$ ,$y = f(x)$ and$y = g(x)$ , and the x-coordinates of these points form an arithmatic sequence
class CaptureFactory { | |
static *id(fn) { | |
yield fn; | |
} | |
} | |
function dummy() {} | |
class C {} | |
class A extends CaptureFactory { |
Let
/** | |
input | |
``` | |
import * as t from "@babel/types" | |
t.isIdentifier(node) | |
``` | |
output | |
``` |
Note: The ExpressionStatement
and Program
node are omitted in the examples.
match (x) {
when ({ colour: "#000000" }) { "yes" }
else {
"no"
import Benchmark from "benchmark"; | |
import { report } from "./util.mjs"; | |
const suite = new Benchmark.Suite(); | |
const reservedWords = [ | |
"break", | |
"case", | |
"catch", | |
"continue", |
const glob = require("glob"); | |
const fs = require("fs"); | |
glob( | |
"./packages/babel-parser/test/fixtures/**/options.json", | |
{}, | |
function (err, files) { | |
if (err) throw err; | |
for (const file of files) { | |
const contents = JSON.stringify(JSON.parse(fs.readFileSync(file))); |
Workflow:
Sort current dictionary in the order of Block > Cangjie code
node ./sort-dict.mjs /path/to/cangjie5.dict.yaml
Merge Cangjie5.txt
of https://github.com/Jackchows/Cangjie5 to cangjie5.dict.yaml
node ./merge-cangjie5-txt.mjs /path/to/Cangjie5.txt /path/to/cangjie5.dict.yaml
node --expose_gc ./wrapper.js ./payload.js
Expected:
[Function: gc] true
[Function: gc]