1 /*
2  *  Make.org Core API
3  *  Copyright (C) 2018 Make.org
4  *
5  * This program is free software: you can redistribute it and/or modify
6  *  it under the terms of the GNU Affero General Public License as
7  *  published by the Free Software Foundation, either version 3 of the
8  *  License, or (at your option) any later version.
9  *
10  *  This program is distributed in the hope that it will be useful,
11  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
12  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13  *  GNU Affero General Public License for more details.
14  *
15  *  You should have received a copy of the GNU Affero General Public License
16  *  along with this program.  If not, see <https://www.gnu.org/licenses/>.
17  *
18  */
19 
20 package org.make.api.keyword
21 
22 import org.make.api.technical.IdGeneratorComponent
23 import org.make.core.technical.Pagination
24 import org.make.core.question.QuestionId
25 import org.make.core.keyword._
26 
27 import scala.concurrent.Future
28 import scala.concurrent.ExecutionContext.Implicits.global
29 
30 trait DefaultKeywordServiceComponent extends KeywordServiceComponent {
31   this: PersistentKeywordServiceComponent with IdGeneratorComponent =>
32 
33   override lazy val keywordService: KeywordService = new DefaultKeywordService
34 
35   class DefaultKeywordService extends KeywordService {
36 
37     override def get(key: String, questionId: QuestionId): Future[Option[Keyword]] = {
38       persistentKeywordService.get(key, questionId)
39     }
40 
41     override def findTop(questionId: QuestionId, limit: Pagination.Limit): Future[Seq[Keyword]] = {
42       persistentKeywordService.findTop(questionId, limit)
43     }
44 
45     override def addAndReplaceTop(questionId: QuestionId, keywords: Seq[Keyword]): Future[Unit] = {
46       for {
47         _           <- persistentKeywordService.resetTop(questionId)
48         allKeywords <- persistentKeywordService.findAll(questionId)
49         (existingKeywords, newKeywords) = keywords.partition(kw => allKeywords.exists(_.key == kw.key))
50         _ <- persistentKeywordService.updateTop(questionId, existingKeywords)
51         _ <- persistentKeywordService.createKeywords(questionId, newKeywords)
52       } yield {}
53     }
54   }
55 }