선별된 목록을 배열에 저장
기존의 temp.json파일에 음식 목록을 선별하여 저장하던 방식에서 선별된 음식 목록을 배열에 저장하는 방식으로 변환 (write함수와 read함수 제거)
Showing
1 changed file
with
13 additions
and
41 deletions
| ... | @@ -66,9 +66,6 @@ app.post('/food/recommendation', function(req, res) { | ... | @@ -66,9 +66,6 @@ app.post('/food/recommendation', function(req, res) { |
| 66 | var kinds = []; | 66 | var kinds = []; |
| 67 | kinds.push(req.body.kinds); | 67 | kinds.push(req.body.kinds); |
| 68 | } | 68 | } |
| 69 | - // var len_shape=shape.length; | ||
| 70 | - // var len_kinds=kinds.length; | ||
| 71 | - | ||
| 72 | var set1 = new Set(); | 69 | var set1 = new Set(); |
| 73 | var set2 = new Set(); | 70 | var set2 = new Set(); |
| 74 | var set3 = new Set(); | 71 | var set3 = new Set(); |
| ... | @@ -93,54 +90,29 @@ app.post('/food/recommendation', function(req, res) { | ... | @@ -93,54 +90,29 @@ app.post('/food/recommendation', function(req, res) { |
| 93 | } else { | 90 | } else { |
| 94 | set2.add(foods); | 91 | set2.add(foods); |
| 95 | } | 92 | } |
| 96 | - if (!price || (price&&users[foods]['price'] <= Number(price)+5000 && users[foods]['price'] >= Number(price)-5000)) { | 93 | + if (!price || (price && users[foods]['price'] <= Number(price) + 5000 && users[foods]['price'] >= Number(price) - 5000)) { |
| 97 | set3.add(foods); | 94 | set3.add(foods); |
| 98 | - console.log(users[foods]['price']); | ||
| 99 | } | 95 | } |
| 100 | } | 96 | } |
| 101 | - console.log(shape); | ||
| 102 | - console.log(kinds); | ||
| 103 | - console.log(set1); | ||
| 104 | - console.log(set2); | ||
| 105 | - console.log(set3); | ||
| 106 | - // console.log('shapeleng:' + shape.length); | ||
| 107 | - // console.log('kinds leng:' + kinds.length); | ||
| 108 | callback(set1, set2, set3); | 97 | callback(set1, set2, set3); |
| 109 | } | 98 | } |
| 110 | 99 | ||
| 111 | add(users, price, shape, kinds, function(set1, set2, set3) { | 100 | add(users, price, shape, kinds, function(set1, set2, set3) { |
| 112 | let difference1 = new Set([...set1].filter(i => set2.has(i))); | 101 | let difference1 = new Set([...set1].filter(i => set2.has(i))); |
| 113 | let difference2 = new Set([...difference1].filter(i => set3.has(i))); | 102 | let difference2 = new Set([...difference1].filter(i => set3.has(i))); |
| 114 | - var list = { | 103 | + var food = [...difference2]; |
| 115 | - food: [...difference2] | 104 | + var length = food.length; |
| 116 | - }; | 105 | + console.log('food 목록: '+food); |
| 117 | - fs.writeFile('data/temp.json', JSON.stringify(list), "utf8", function(err) { | 106 | + console.log('food 갯수: '+length); |
| 118 | - if (err) { | 107 | + var rand = Math.floor(Math.random() * length); //(Math.random() * (max - min)) + min |
| 119 | - console.log(err); | 108 | + var food_value = food[rand]; |
| 120 | - res.status(500).send('Internal Server Error'); | 109 | + console.log('랜덤 food 번호: '+rand); |
| 121 | - } else { | 110 | + res.render('print.ejs', { |
| 122 | - | 111 | + title: 'Recommendation', |
| 123 | - fs.readFile('data/temp.json', 'utf8', function(err, data) { | 112 | + description: 'We recommend this...', |
| 124 | - if (err) { | 113 | + randvalue: food_value |
| 125 | - console.log((err)); | 114 | + }); //rander closed |
| 126 | - res.status(500).send('Internal Server Error'); | ||
| 127 | - } else { | ||
| 128 | - var food = JSON.parse(data)['food']; | ||
| 129 | - var length = food.length; | ||
| 130 | - var rand = Math.floor(Math.random() * length); //(Math.random() * (max - min)) + min | ||
| 131 | - var food_value = food[rand]; | ||
| 132 | - console.log(rand); | ||
| 133 | - res.render('print.ejs', { | ||
| 134 | - title: 'Recommendation', | ||
| 135 | - description: 'We recommend this...', | ||
| 136 | - randvalue: food_value | ||
| 137 | - }); //rander closed | ||
| 138 | - } | ||
| 139 | - }); //readFile closed | ||
| 140 | - } | ||
| 141 | - }); //writeFile closed | ||
| 142 | }); //add closed | 115 | }); //add closed |
| 143 | - | ||
| 144 | } | 116 | } |
| 145 | }); //readFile closed | 117 | }); //readFile closed |
| 146 | }); //post closed | 118 | }); //post closed | ... | ... |
-
Please register or login to post a comment