Shohei Yokoyama abarth500

## gist:bea5bd5ce8fa910a06f13cd5c99e855d
// https://overpass-turbo.eu/
// 上記のURLに行ってこのコードをペーストし、地図でBBOXを指定し、実行する。
[out:json];
way["highway"]({{bbox}});
foreach((._;>;);out;);

## attachInterrupt.cpp
const int ledPin = 7;
const int speakerPin = 9;

void setup() {
  pinMode(2, INPUT_PULLUP);
  pinMode(7, OUTPUT);
  pinMode(9, OUTPUT);
  attachInterrupt(0, speaker, FALLING);
}

## index.html
Promise.all(
	["workspace.xml", "toolbox.xml"].map(async file => {
		return fetch(file).then(
			(res) => {
				return res.text();
			}
		);
	})
).then((xmls) => {
	xmls.forEach((xml) => {

## lcs.js
    // prettified version of what can be found here:
    // https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence#JavaScript
    function LCS(a, b) {
        var m = a.length,
            n = b.length,
            C = [],
            i,
            j;

        for (i = 0; i <= m; i++) C.push([0]);

## index.js
//Parameter K
var k = 30;

//need async and flickr lib
// npm install async
// npm install flickrapi

/* Internal Arguments for the algorithm A
var c = {};
var n = 0;

## gist:23c1cd3e4e93399c5cb5
node execute.js whisky-in-europe.example --bbox=-19.69,36.03,26.37,59.18 --search=whisky --max=10000

## gist:980a0a1e939ce8d121b4
node execute.js Disneyland.example --bbox=-117.928104,33.8034,-117.915487,33.81802 --max=10000

## gist:b8d6233ffcea528a3ae4
cd node_modules\bbox2heatmap

## gist:4e0f3d4531738114b075
cd c:\sobig\
npm install bbox2heatmap

## start.bat
start output\index.html
	// https://overpass-turbo.eu/
	// 上記のURLに行ってこのコードをペーストし、地図でBBOXを指定し、実行する。
	[out:json];
	way["highway"]({{bbox}});
	foreach((._;>;);out;);
	const int ledPin = 7;
	const int speakerPin = 9;

	void setup() {
	pinMode(2, INPUT_PULLUP);
	pinMode(7, OUTPUT);
	pinMode(9, OUTPUT);
	attachInterrupt(0, speaker, FALLING);
	}
	Promise.all(
	["workspace.xml", "toolbox.xml"].map(async file => {
	return fetch(file).then(
	(res) => {
	return res.text();
	}
	);
	})
	).then((xmls) => {
	xmls.forEach((xml) => {
	// prettified version of what can be found here:
	// https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence#JavaScript
	function LCS(a, b) {
	var m = a.length,
	n = b.length,
	C = [],
	i,
	j;

	for (i = 0; i <= m; i++) C.push([0]);
	//Parameter K
	var k = 30;

	//need async and flickr lib
	// npm install async
	// npm install flickrapi

	/* Internal Arguments for the algorithm A
	var c = {};
	var n = 0;