root / src / main / scala / gr / grnet / aquarium / logic / accounting / dsl / Timeslot.scala @ 60b216e8
History | View | Annotate | Download (6 kB)
1 |
/* |
---|---|
2 |
* Copyright 2011 GRNET S.A. All rights reserved. |
3 |
* |
4 |
* Redistribution and use in source and binary forms, with or |
5 |
* without modification, are permitted provided that the following |
6 |
* conditions are met: |
7 |
* |
8 |
* 1. Redistributions of source code must retain the above |
9 |
* copyright notice, this list of conditions and the following |
10 |
* disclaimer. |
11 |
* |
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. |
16 |
* |
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. |
29 |
* |
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. |
34 |
*/ |
35 |
|
36 |
package gr.grnet.aquarium.logic.accounting.dsl |
37 |
|
38 |
import java.util.Date |
39 |
import scala.collection.mutable |
40 |
|
41 |
/** |
42 |
* A representation of a timeslot with a start and end date. |
43 |
* |
44 |
* @author Georgios Gousios <gousiosg@gmail.com> |
45 |
*/ |
46 |
case class Timeslot(from: Date, to: Date) |
47 |
extends DSLItem with Ordered[Timeslot] { |
48 |
|
49 |
/* Preconditions to ensure correct object creations */ |
50 |
assert(from != null) |
51 |
assert(to != null) |
52 |
assert(from.before(to)) |
53 |
|
54 |
def startsBefore(t: Timeslot) : Boolean = this.from.before(t.from) |
55 |
|
56 |
def startsAfter(t: Timeslot) : Boolean = this.from.after(t.from) |
57 |
|
58 |
def endsBefore(t: Timeslot) : Boolean = this.to.before(t.to) |
59 |
|
60 |
def endsAfter(t: Timeslot) : Boolean = this.to.after(t.to) |
61 |
|
62 |
def after(t: Timeslot): Boolean = if (this.from.after(t.to)) true else false |
63 |
|
64 |
def before(t: Timeslot): Boolean = if (this.to.before(t.from)) true else false |
65 |
|
66 |
/** |
67 |
* Check whether this time slot fully contains the provided one. |
68 |
*/ |
69 |
def contains(t: Timeslot) : Boolean = t.startsAfter(this) && t.endsBefore(this) |
70 |
|
71 |
/** |
72 |
* Check whether this timeslot contains the provided time instant. |
73 |
*/ |
74 |
def includes(t: Date) : Boolean = |
75 |
if (from.before(t) && to.after(t)) true else false |
76 |
|
77 |
/** |
78 |
* Check whether this timeslot overlaps with the provided one. |
79 |
*/ |
80 |
def overlaps(t: Timeslot) : Boolean = { |
81 |
if (contains(t) || t.contains(this)) |
82 |
return true |
83 |
|
84 |
if (this.includes(t.from) || this.includes(t.to)) |
85 |
return true |
86 |
|
87 |
false |
88 |
} |
89 |
|
90 |
/** |
91 |
* Merges this timeslot with the provided one. If the timeslots overlap, |
92 |
* a list with the resulting merge is returned. If the timeslots do not |
93 |
* overlap, the returned list contains both timeslots in increasing start |
94 |
* date order. |
95 |
*/ |
96 |
def merge(t: Timeslot) : List[Timeslot] = { |
97 |
if (overlaps(t)) { |
98 |
val nfrom = if (from.before(t.from)) from else t.from |
99 |
val nto = if (to.after(t.to)) to else t.to |
100 |
List(Timeslot(nfrom, nto)) |
101 |
} else |
102 |
if (this.from.before(t.from)) |
103 |
List(this, t) |
104 |
else |
105 |
List(t, this) |
106 |
} |
107 |
|
108 |
/** |
109 |
* Split the timeslot in two parts at the provided timestamp, if the |
110 |
* timestamp falls within the timeslot boundaries. |
111 |
*/ |
112 |
def slice(d: Date) : List[Timeslot] = |
113 |
if (includes(d)) |
114 |
List(Timeslot(from, d), Timeslot(d,to)) |
115 |
else |
116 |
List(this) |
117 |
|
118 |
/** |
119 |
* Find and return the timeslots whithin which this Timeslot overrides |
120 |
* with the provided list of timeslots. For example if: |
121 |
* |
122 |
* - `this == Timeslot(7,20)` |
123 |
* - `list == List(Timeslot(1,3), Timeslot(6,8), Timeslot(11,15))` |
124 |
* |
125 |
* the result will be: `List(Timeslot(7,8), Timeslot(11,15))` |
126 |
*/ |
127 |
def overlappingTimeslots(list: List[Timeslot]) : List[Timeslot] = { |
128 |
|
129 |
val result = new mutable.ListBuffer[Timeslot]() |
130 |
|
131 |
list.foreach { |
132 |
t => |
133 |
if (t.contains(this)) result += this |
134 |
else if (this.contains(t)) result += t |
135 |
else if (t.overlaps(this) && t.startsBefore(this)) result += this.slice(t.to).head |
136 |
else if (t.overlaps(this) && t.startsAfter(this)) result += this.slice(t.from).tail.head |
137 |
} |
138 |
result.toList |
139 |
} |
140 |
|
141 |
/** |
142 |
* Find and return the timeslots whithin which this Timeslot does not |
143 |
* override with the provided list of timeslots. For example if: |
144 |
* |
145 |
* - `this == Timeslot(7,20)` |
146 |
* - `list == List(Timeslot(1,3), Timeslot(6,8), Timeslot(11,15))` |
147 |
* |
148 |
* the result will be: `List(Timeslot(9,10), Timeslot(15,20))` |
149 |
*/ |
150 |
def nonOverlappingTimeslots(list: List[Timeslot]): List[Timeslot] = { |
151 |
|
152 |
val overlaps = list.filter(t => this.overlaps(t)) |
153 |
|
154 |
if (overlaps.isEmpty) |
155 |
return List(this) |
156 |
|
157 |
def build(acc: List[Timeslot], listPart: List[Timeslot]): List[Timeslot] = { |
158 |
|
159 |
listPart match { |
160 |
case Nil => acc |
161 |
case x :: Nil => build(acc, List()) |
162 |
case x :: y :: rest => |
163 |
build(acc ++ List(Timeslot(x.to, y.from)), y :: rest) |
164 |
} |
165 |
} |
166 |
|
167 |
val head = overlaps.head |
168 |
val last = overlaps.reverse.head |
169 |
|
170 |
val start = if (head.startsAfter(this)) List(Timeslot(this.from, head.from)) else List() |
171 |
val end = if (last.endsBefore(this)) List(Timeslot(last.to, this.to)) else List() |
172 |
|
173 |
start ++ build(List(), overlaps) ++ end |
174 |
} |
175 |
|
176 |
/** |
177 |
* Compares the starting times of two timeslots. |
178 |
*/ |
179 |
def compare(that: Timeslot): Int = { |
180 |
if (this.startsBefore(that)) -1 |
181 |
else if (this.startsAfter(that)) 1 |
182 |
else 0 |
183 |
} |
184 |
|
185 |
/** |
186 |
* Converts the timeslot to the amount of hours it represents |
187 |
*/ |
188 |
def hours: Double = (to.getTime - from.getTime).toDouble / 1000.0 / 60.0 / 60.0 |
189 |
} |