IWABUCHI Yu(u)ki (butchi) butchi

## prime-daifugo-utility.nb
superscript[a_, b_] := If[b == 1, a, Superscript[a, b]]
centerDot[li_] := If[Length[li] == 1, First[li], CenterDot @@ li]
j[n_] := If[PrimeQ[n], ToString[PrimePi[n]] <> "番目の素数",
  centerDot[superscript @@@ FactorInteger[n]]]

divisible[check_Integer, OptionsPattern[origin -> True]] :=
 Divisible[#, check] && If[OptionValue[origin], True, # != check] &
divisible[checkLi_List, OptionsPattern[origin -> True]] :=
 AnyTrue[Table[divisible[check, origin -> OptionValue[origin]][#], {check, checkLi}], TrueQ] &

## dot.js
function dot(a, b) {
  const len = Math.max(a.length, a.length);

  let zeros = new Array(len).fill(0);

  let ret;

  ret = zeros.reduce((p, c, i) => {
    const itemA = a[i] || 0;
    const itemB = b[i] || 0;

## fibonacci_word_sequence_definition.js
const s = [];
s[0] = '0';
s[1] = '01';

function fibonacci_word(n) {
  let ret;

  if (n < 2) {
    ret = s[n];

## file0.txt
markdown http リンクにしない

## bitrev.js
const b = 4;
const p = 1 << b;
const r = new Uint32Array(p);
let i = 0;
let j = 0;
while(i < p){
  r[i] = j;
  k = - p ^ (-p / ((i ^ (i + 1)) + 1));
  j ^= k;
  i++;

## file0.js
const LENGTH = 25; // 25×2の50回ランダムウォークする
const MAGNITUDE = 10; // 振動ピクセル幅

// 入力した正の数を正負両方含む配列（倍のサイズ）として返す
function double(arr) {
  let ret = [];

  arr.forEach((num) => {
    ret.push(num);
    ret.push(-num);

## common.css
.hatena-bookmark-button-frame {
  border-radius: 4px;
}

## quadratic-formula
# https://ja.wikipedia.org/wiki/Mathematical_Markup_Language

```replace-list--math-ml
replace mrow(/(.+)/) -> ($1)
replace mfrac(/(.+) (.+)/) -> ($1 / $2)
replace msup(/(.+) (.+)/) -> ($1 ^ $2)
replace msqrt(/(.+)/) -> √($1)
replace mi(/([a-z]+)/) -> $1
replace mn(([1-9][0-9]*)) -> $1
replace mo(=) -> =

## AnimKanpai.js
// timeline functions:
this.frame_19 = function() {
  $(canvas).trigger('end-anim');
  stop();
}

## file0.txt
In[1]:= Map[f, {a, b, c, d, e}]
Out[1]= {f[a], f[b], f[c], f[d], f[e]}
	superscript[a_, b_] := If[b == 1, a, Superscript[a, b]]
	centerDot[li_] := If[Length[li] == 1, First[li], CenterDot @@ li]
	j[n_] := If[PrimeQ[n], ToString[PrimePi[n]] <> "番目の素数",
	centerDot[superscript @@@ FactorInteger[n]]]

	divisible[check_Integer, OptionsPattern[origin -> True]] :=
	Divisible[#, check] && If[OptionValue[origin], True, # != check] &
	divisible[checkLi_List, OptionsPattern[origin -> True]] :=
	AnyTrue[Table[divisible[check, origin -> OptionValue[origin]][#], {check, checkLi}], TrueQ] &
	function dot(a, b) {
	const len = Math.max(a.length, a.length);

	let zeros = new Array(len).fill(0);

	let ret;

	ret = zeros.reduce((p, c, i) => {
	const itemA = a[i] \|\| 0;
	const itemB = b[i] \|\| 0;
	const s = [];
	s[0] = '0';
	s[1] = '01';

	function fibonacci_word(n) {
	let ret;

	if (n < 2) {
	ret = s[n];
	const b = 4;
	const p = 1 << b;
	const r = new Uint32Array(p);
	let i = 0;
	let j = 0;
	while(i < p){
	r[i] = j;
	k = - p ^ (-p / ((i ^ (i + 1)) + 1));
	j ^= k;
	i++;
	const LENGTH = 25; // 25×2の50回ランダムウォークする
	const MAGNITUDE = 10; // 振動ピクセル幅

	// 入力した正の数を正負両方含む配列（倍のサイズ）として返す
	function double(arr) {
	let ret = [];

	arr.forEach((num) => {
	ret.push(num);
	ret.push(-num);
	# https://ja.wikipedia.org/wiki/Mathematical_Markup_Language

	```replace-list--math-ml
	replace mrow(/(.+)/) -> ($1)
	replace mfrac(/(.+) (.+)/) -> ($1 / $2)
	replace msup(/(.+) (.+)/) -> ($1 ^ $2)
	replace msqrt(/(.+)/) -> √($1)
	replace mi(/([a-z]+)/) -> $1
	replace mn(([1-9][0-9]*)) -> $1
	replace mo(=) -> =
	// timeline functions:
	this.frame_19 = function() {
	$(canvas).trigger('end-anim');
	stop();
	}
	In[1]:= Map[f, {a, b, c, d, e}]
	Out[1]= {f[a], f[b], f[c], f[d], f[e]}