Skip to content

Commit

Permalink
initial commit
Browse files Browse the repository at this point in the history
  • Loading branch information
jun68ykt committed Aug 9, 2019
0 parents commit 2bde65e
Show file tree
Hide file tree
Showing 4 changed files with 106 additions and 0 deletions.
1 change: 1 addition & 0 deletions .gitignore
@@ -0,0 +1 @@
/.idea
14 changes: 14 additions & 0 deletions index.html
@@ -0,0 +1,14 @@
<!DOCTYPE html>
<html lang="ja">
<head>
<meta charset="UTF-8">
<title>Q204950</title>
<script src="./main.js"></script>
</head>
<body>
<form name="test">
<input type="file" id="selfile"><br>
<textarea name="txt" rows="10" cols="60" readonly></textarea>
</form>
</body>
</html>
3 changes: 3 additions & 0 deletions input.txt
@@ -0,0 +1,3 @@
a b b d X
a c c a Y
a b d c X
88 changes: 88 additions & 0 deletions main.js
@@ -0,0 +1,88 @@
document.addEventListener('DOMContentLoaded', function() {

var obj1 = document.getElementById("selfile");

obj1.addEventListener("change",function(evt){

var file = evt.target.files;
var reader = new FileReader();
reader.readAsText(file[0]);

reader.onload = function(ev){

//テキストエリアに表示
document.test.txt.value = reader.result.toLowerCase();
var result2=reader.result.toLowerCase().split("\n");

var result3=[];
for (var i = 0; i <result2.length; i++) {
result3.push(result2[i].split(/\s+/));
}

for (var i = 0; i<result3.length; i++) {
if(result3[i].length>=6){
while (result3[i].length>=6){
result3[i].pop();
}
}
}

Array.prototype.divide = function(n){
var ary = this;
var idx = 0;
var results = [];
var length = ary.length;

while (idx + n < length){
var result = ary.slice(idx,idx+n)
results.push(result);
idx = idx + n
}
var rest = ary.slice(idx,length+1)
results.push(rest)
return results;
}

result4=[];
for (var i = 0; i<result3.length; i++) {
result4.push(result3[i].divide(1));
}

for (var i = 0; i<result4.length; i++) {
if(result4[i][4][0].indexOf("x") >= 0){
result4[i][0].unshift(1000);
result4[i][0].unshift("x");
result4[i][1].unshift(100);
result4[i][1].unshift("x");
result4[i][2].unshift(10);
result4[i][2].unshift("x");
result4[i][3].unshift(1);
result4[i][3].unshift("x");
} else if (result4[i][4][0].indexOf("y") >= 0){
result4[i][0].unshift(1000);
result4[i][0].unshift("y");
result4[i][1].unshift(100);
result4[i][1].unshift("y");
result4[i][2].unshift(10);
result4[i][2].unshift("y");
result4[i][3].unshift(1);
result4[i][3].unshift("y");
}
}
console.log(result4);

var result5 = [];
for (var i = 0; i < result4.length; i++) {
for (var j = 0; j < result4[i].length; j++) {
k = result4[i][j][2];
if (!result5[k]) {
result5[k] = [];
}
result5[k].push(result4[i][j]);
}
}
console.log(result5);
}
},false);

});

0 comments on commit 2bde65e

Please sign in to comment.