2 * Copyright 2011-2012 GRNET S.A. All rights reserved.
4 * Redistribution and use in source and binary forms, with or
5 * without modification, are permitted provided that the following
8 * 1. Redistributions of source code must retain the above
9 * copyright notice, this list of conditions and the following
12 * 2. Redistributions in binary form must reproduce the above
13 * copyright notice, this list of conditions and the following
14 * disclaimer in the documentation and/or other materials
15 * provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY GRNET S.A. ``AS IS'' AND ANY EXPRESS
18 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
19 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GRNET S.A OR
21 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
24 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
25 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
27 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
30 * The views and conclusions contained in the software and
31 * documentation are those of the authors and should not be
32 * interpreted as representing official policies, either expressed
33 * or implied, of GRNET S.A.
36 package gr.grnet.aquarium.store
38 import scala.collection.immutable
39 import collection.immutable.SortedMap
40 import gr.grnet.aquarium.logic.accounting.dsl.{DSL, DSLPolicy, Timeslot}
41 import com.ckkloverdos.maybe.Maybe
42 import gr.grnet.aquarium.event.model.PolicyEntry
45 * A store for serialized policy entries.
47 * @author Georgios Gousios <gousiosg@gmail.com>
52 * Load all accounting policies valid after the specified time instance.
53 * The results are returned sorted by PolicyEntry.validFrom
55 def loadPolicyEntriesAfter(after: Long): List[PolicyEntry]
57 def loadAndSortPolicyEntriesWithin(fromMillis: Long, toMillis: Long): SortedMap[Timeslot, PolicyEntry] = {
58 val all = loadPolicyEntriesAfter(0L)
59 val filtered = all.filter { policyEntry ⇒
60 policyEntry.validFrom <= fromMillis &&
61 policyEntry.validTo >= toMillis
64 (immutable.SortedMap[Timeslot, PolicyEntry]() /: filtered) { (map, policyEntry) ⇒
65 map.updated(policyEntry.fromToTimeslot, policyEntry)
69 def loadAndSortPoliciesWithin(fromMillis: Long, toMillis: Long, dsl: DSL): SortedMap[Timeslot, DSLPolicy] = {
70 for((timeslot, policyEntry) <- loadAndSortPolicyEntriesWithin(fromMillis, toMillis))
71 yield (timeslot, dsl.parse(policyEntry.policyYAML))
74 def loadValidPolicyEntryAt(atMillis: Long): Option[PolicyEntry] = {
75 loadPolicyEntriesAfter(0L).find { policyEntry ⇒
76 policyEntry.fromToTimeslot.containsTimeInMillis(atMillis)
80 def loadValidPolicyAt(atMillis: Long, dsl: DSL): Option[DSLPolicy] = {
81 loadValidPolicyEntryAt(atMillis).map(policyEntry ⇒ dsl.parse(policyEntry.policyYAML))
85 * Store an accounting policy.
87 def storePolicyEntry(policy: PolicyEntry): Maybe[RecordID]
90 * Updates the policy record whose id is equal to the id
91 * of the provided policy entry.
93 def updatePolicyEntry(policy: PolicyEntry): Unit
96 * Find a policy by its unique id
98 def findPolicyEntry(id: String): Maybe[PolicyEntry]