class Asearch { get INITPAT() {return 0x80000000;} // 0100,0000,0000,0000,0000,0000,0000,0000 get MAXCHAR() {return 0x100;} get INITSTATE() {return [this.INITPAT, 0, 0, 0];} constructor(source) { this.source = source; this.shiftpat = Array(this.MAXCHAR).map(_ => 0); this.epsilon = 0; let mask = this.INITPAT; const ref = this.unpack(this.source); for (const item of ref) { // 0x20 is a space if (item === 0x20) { this.epsilon |= mask; } else { this.shiftpat[item] |= mask; this.shiftpat[this.toupper(item)] |= mask; this.shiftpat[this.tolower(item)] |= mask; mask >>>= 1; } } this.acceptpat = mask; } isupper(c) { // 0x41 = A, 0x5a = Z return (c >= 0x41) && (c <= 0x5a); } islower(c) { // 0x61 = a, 0x7a = z return (c >= 0x61) && (c <= 0x7a); } tolower(c) { return this.isupper(c) ? c + 0x20 : c; } toupper(c) { return this.islower(c) ? c - 0x20 : c; } state(str = '') { let i0 = this.INITSTATE[0]; let i1 = this.INITSTATE[1]; let i2 = this.INITSTATE[2]; let i3 = this.INITSTATE[3]; const ref = this.unpack(str); for (const item of ref) { const mask = this.shiftpat[item]; i3 = (i3 & this.epsilon) | ((i3 & mask) >>> 1) | (i2 >>> 1) | i2; i2 = (i2 & this.epsilon) | ((i2 & mask) >>> 1) | (i1 >>> 1) | i1; i1 = (i1 & this.epsilon) | ((i1 & mask) >>> 1) | (i0 >>> 1) | i0; i0 = (i0 & this.epsilon) | ((i0 & mask) >>> 1); i1 |= i0 >>> 1; i2 |= i1 >>> 1; i3 |= i2 >>> 1; } return [i0, i1, i2, i3]; } match(str, ambig = 0) { if (!(ambig < this.INITSTATE.length)) { ambig = this.INITSTATE.length - 1; } const s = this.state(str); return (s[ambig] & this.acceptpat) !== 0; } unpack(str) { return str.split('') .flatMap(char => { const code = char.charCodeAt(0); if (code > 0xFF) { return [(code & 0xFF00) >>> 8, code & 0xFF]; } return [code & 0xFF]; }); } }

const range = n => [...Array(n).keys()]; // [0,1,2,...,n-1]を返す function fizzSearch({word, list, func = w => w, limit = undefined} = {}) { // 検索keyword及び検索候補が空のときは何もしない if (word.trim() === '' || list.length === 0) return []; // 空白文字で区切った文字列を並び替える const permutation = getPermutation(word.split(/\s/)).map(wordList => ` ${wordList.join(' ')} `); // ambigの最大値を計算する // permutationは、文字列を並び替えただけなので、どれも長さは一緒 let maxAmbig = Math.floor(permutation[0].length / 4) + 1; maxAmbig = maxAmbig > 4 ? 4 : maxAmbig; // ambigの値に応じて検索する // limit < list.lengthなら検索を打ち切る const results = []; let matchedNum = 0; (() => { for (const ambig of range(maxAmbig)) { let matches = new Set(); for (const targetWord of permutation) { const prevSize = matches.size; const asearch = new Asearch(targetWord); // 検索したものを重複を取り除いて追加する const temp = list.filter(word => asearch.match(func(word), ambig)); temp.forEach(word => matches.add(word)); matchedNum += matches.size - prevSize; if (limit && matchedNum > limit) { results.push([...matches]); return; } } results.push([...matches]); } })(); // 重複を取り除いて返す return results.map((list, i, lists) => i === 0 ? list: list.filter(word => !lists[i-1].includes(word))); } function fizzSearch2(word, list, func = w => w) { // 検索keyword及び検索候補が空のときは何もしない if (word.trim() === '' || list.length === 0) return []; // 空白文字で区切った文字列を並び替える const permutation = getPermutation(word.split(/\s/)).map(wordList => ` ${wordList.join(' ')} `); // ambigの最大値を計算する // permutationは、文字列を並び替えただけなので、どれも長さは一緒 let maxAmbig = Math.floor(permutation[0].length / 4) + 1; maxAmbig = maxAmbig > 4 ? 4 : maxAmbig; // ambigの値に応じて検索する const searchedLists = range(maxAmbig) .map(i => permutation.flatMap(targetWord =>{ const asearch = new Asearch(targetWord); return list.filter(word => asearch.match(func(word), i)); })) // 重複を取り除く .map((list, i, lists) => i === 0 ? list : list.filter(word => !lists[i-1].includes(word))) .map(list => [...new Set(list)]); //const searchedList = permutation // .flatMap(targetWord => [...asearched(targetWord), ...hanukeSearch(targetWord, list)]); return searchedLists; }

import '/api/code/takker/fizzSearch/script.js'; export default function(word, list, func = w => w) { return fizzSearch(word, list, func); }

// wordの歯抜け検索をlistから行い、matchした文字列のリストを返す function hanukeSearch(word, list) { const regexString = word .match(/./ug)// 書記素ごとに分割 .map(char => char.replace(/[.*+?^=!:${}()|[\]\/\\]/ug, '\\$&'))// 正規表現のescape .map(char => `${char}.*`) .join(''); const reg = RegExp(regexString, 'ui'); return list.filter(title => reg.test(title)); }

// 重複は考慮していない function getPermutation(list) { if (list.length == 0) return list; if (list.length == 1) return [list]; if (list.length == 2) return [[list[0],list[1]],[list[1],list[0]]]; return list.flatMap(first => { const restList = list.filter(item => item !== first); return getPermutation(restList).map(permutation => [first, ...permutation]); }); }