VictorTaelin

A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.

An A::B program is a sequence of tokens. Example:

    B# A# #B #A B#

To *compute* a program, we must rewrite neighbor tokens, using the rules:

    A# #A ... becomes ... nothing
    A# #B ... becomes ... #B A#

nakasyou

Urbanist

Futuraみたいなやつ

Inter

BeRealのロゴみたいなやつ(参考)

nakasyou

if (import.meta.env.DEV) {
  const script = document.createElement('script')
  script.src = 'https://cdn.jsdelivr.net/npm/eruda'
  // @ts-ignore global eruda
  script.onload = () => globalThis.eruda.init()
  document.body.append(script)
}

nakasyou

@tailwind base;
@tailwind components;
@tailwind utilities;

nakasyou

#!/bin/bash

# Denoのインストール
curl -fsSL https://deno.land/x/install/install.sh | sh

# .bashrcまたは.zshrcにパスを追加
if [ -n "$ZSH_VERSION" ]; then
  echo 'export DENO_INSTALL="$HOME/.deno"' >> ~/.zshrc
  echo 'export PATH="$DENO_INSTALL/bin:$PATH"' >> ~/.zshrc
  source ~/.zshrc

mizchi

あなたのプロジェクトに Frontend Ops を。

現状

• Full Plan: 1ヶ月 120万
  • 秘密保持契約を行い、ソースコードを分析し、改善を行います
  • 現在受付可能なのは、1月以降です
  • 調査費用は50万~になります
• Lightweight Plan: 外部計測のみ 50万
• 秘密保持契約抜きで外部からの監視を行います

lo48576

• sudo新一 · GitHub
• 754-2019 - IEEE Standard for Floating-Point Arithmetic | IEEE Standard | IEEE Xplore
• Intel® 64 and IA-32 Architectures Software Developer Manuals
• Intel® Instruction Set Extensions Technology

VictorTaelin

THE PROBLEM

🌲 Invert a binary tree! 🌲

Except with 3 catches:

1. It must invert the keys ("bit-reversal permutation")
2. It must be a dependency-free, pure recursive function
3. It must have type Bit -> Tree -> Tree (i.e., a direct recursion with max 1 bit state)

mizchi

/**
 * @prompt
 * 指定されたTypeScriptのファイルから型定義とimportを抽出します
 * $ deno run -A getDeclaration.ts <target>
 */

import ts from "npm:[email protected]";

export function getSourceSummary(filePath: string): string {
  const compilerOptions: ts.CompilerOptions = {