8 // A range of episodes with a start and possibly without an end.
9 type EpisodeRange struct {
10 Type EpisodeType // Must be equal to both the Start and End types; if End is nil, must be equal to the Start type
11 Start *Episode // The start of the range
12 End *Episode // The end of the range; may be nil, which represents an endless range
15 func EpisodeToRange(ep *Episode) *EpisodeRange {
23 // Converts the EpisodeRange into AniDB API range format.
24 func (er *EpisodeRange) String() string {
25 return er.Format(er.scale())
28 func (er *EpisodeRange) Format(width int) string {
29 if er.Start == er.End || (er.End != nil && *(er.Start) == *(er.End)) {
30 return er.Start.Format(width)
34 return fmt.Sprintf("%s-", er.Start.Format(width))
36 return fmt.Sprintf("%s-%s", er.Start.Format(width), er.End.Format(width))
39 func (er *EpisodeRange) FormatLog(max int) string {
40 return er.Format(scale(max))
43 func (er *EpisodeRange) scale() int {
47 s, e := er.Start.scale(), er.End.scale()
54 // If ec is an *Episode, returns true if the Episode is of the same type as the range
55 // and has a Number >= Start.Number; if End is defined, then the episode's Number must
56 // also be <= End.Number.
58 // If ec is an *EpisodeRange, returns true if they are both of the same type and
59 // the ec's Start.Number is >= this range's Start.Number;
60 // also returns true if this EpisodeRange is unbounded or if the ec is bounded
61 // and ec's End.Number is <= this range's End.Number.
63 // If ec is an EpisodeList, returns true if all listed EpisodeRanges are contained
64 // by this EpisodeRange.
66 // Returns false otherwise.
67 func (er *EpisodeRange) ContainsEpisodes(ec EpisodeContainer) bool {
71 if er.Start == nil || er.Start.Type != er.Type ||
72 (er.End != nil && er.End.Type != er.Type) {
73 panic("Invalid EpisodeRange used")
76 switch e := ec.(type) {
78 if e.Type == er.Type && e.Number >= er.Start.Number {
81 } else if e.Number <= er.End.Number {
86 if e.Type == er.Type {
87 if e.Start.Number >= er.Start.Number {
90 } else if e.End == nil {
91 return false // a finite set can't contain an infinite one
92 } else if e.End.Number <= er.End.Number {
98 for _, ec := range e {
99 if !er.ContainsEpisodes(ec) {
109 // Tries to merge a with b, returning a new *EpisodeRange that's
110 // a superset of both a and b.
112 // Returns nil if a and b don't intersect, or are not adjacent.
113 func (a *EpisodeRange) Merge(b *EpisodeRange) (c *EpisodeRange) {
115 c = &EpisodeRange{Type: a.Type}
117 if a.Start.Number == b.Start.Number {
118 if a.Start.Part <= b.Start.Part {
123 } else if a.Start.Number < b.Start.Number {
130 case a.End == nil || b.End == nil:
132 case a.End.Number == b.End.Number:
133 if a.End.Part >= b.End.Part {
138 case a.End.Number > b.End.Number:
147 // Returns true if both ranges are of the same type and
148 // have identical start/end positions
149 func (a *EpisodeRange) Equals(b *EpisodeRange) bool {
150 if a == b { // pointers to the same thing
153 if a == nil || b == nil {
157 if a.Type == b.Type {
158 if a.End == b.End || (a.End != nil && b.End != nil &&
159 a.End.Number == b.End.Number && a.End.Part == b.End.Part) {
160 if a.Start == b.Start || a.Start.Number == b.Start.Number && a.Start.Part == b.Start.Part {
168 // CORNER CASE: e.g. 1.3,2.0 (or 1.3,2) always touch,
169 // even if there's an unlisted 1.4 between them; unless
170 // the part count is known.
171 func (a *EpisodeRange) touches(b *EpisodeRange) bool {
172 if a == nil || b == nil || a.Type != b.Type {
178 // log.Println("same pointers")
180 case a.Start == b.Start, a.End != nil && a.End == b.End:
181 // log.Println("share pointers")
187 // log.Println("both infinite")
190 case b.End.Number == a.Start.Number:
192 // either is whole, or parts are adjacent/overlap
193 case b.End.Part == -1, a.Start.Part == -1,
194 b.End.Part >= a.Start.Part-1:
195 // log.Printf("{ %s [} %s ...", b.End, a.Start)
198 // only if start of next range is whole or is first part
199 case b.End.Number == a.Start.Number-1 && a.Start.Part <= 0:
201 // end is whole, or is last part, or part count is unknown
202 case b.End.Part == -1, b.End.Parts == 0,
203 b.End.Part == b.End.Parts:
204 // log.Printf("{ %s }[ %s ...", b.End, a.Start)
207 case b.End.Number > a.Start.Number:
208 // log.Printf("{ %s [ } %s ...", b.End, a.Start)
214 case a.End.Number == b.Start.Number:
216 case a.End.Part == -1, b.Start.Part == -1,
217 a.End.Part >= b.Start.Part-1:
218 // log.Printf("[ %s {] %s ...", a.End, b.Start)
221 case a.End.Number == b.Start.Number-1 && b.Start.Part <= 0:
223 case a.End.Part == -1, a.End.Parts == 0,
224 a.End.Part == a.End.Parts:
225 // log.Printf("[ %s ]{ %s ...", a.End, b.Start)
228 case a.End.Number > b.Start.Number:
229 // log.Printf("[ %s { ] %s ...", a.End, b.Start)
233 case a.Start.Number == b.Start.Number:
236 // either is whole, or parts are immediately adjacent
237 case a.Start.Part == -1, b.Start.Part == -1,
238 a.Start.Part == b.Start.Part,
239 a.Start.Part == b.Start.Part-1,
240 a.Start.Part == b.Start.Part+1:
241 // log.Printf("[{ %s - %s ]}", a.End, b.Start)
244 case a.End.Number == b.End.Number:
246 case a.End.Part == -1, b.End.Part == -1,
247 a.End.Part == b.End.Part,
248 a.End.Part == b.End.Part-1,
249 a.End.Part == b.End.Part+1:
250 // log.Printf("{[ %s - %s }]", b.End, a.Start)
254 case a.End.Number < b.End.Number:
256 case a.End.Number == b.Start.Number:
258 case a.End.Part == -1, b.Start.Part == -1,
259 a.End.Part >= b.Start.Part-1:
260 // log.Printf("[ %s {] %s }", a.End, b.Start)
263 case a.End.Number == b.Start.Number-1 && b.Start.Part <= 0:
265 case b.End.Part == -1, b.End.Parts == 0,
266 b.End.Part == b.End.Parts:
267 // log.Printf("[ %s ]{ %s }", a.End, b.Start)
270 case a.End.Number > b.Start.Number:
271 // log.Printf("[ %s { ] %s }", a.End, b.Start)
275 case b.End.Number < a.End.Number:
277 case b.End.Number == a.Start.Number:
279 case b.End.Part == -1, a.Start.Part == -1,
280 b.End.Part >= a.Start.Part-1:
281 // log.Printf("{ %s [} %s ]", b.End, a.Start)
284 case b.End.Number == a.Start.Number-1 && a.Start.Part <= 0:
286 case b.End.Part == -1, b.End.Parts == 0,
287 b.End.Part == b.End.Parts:
288 // log.Printf("{ %s }[ %s ]", b.End, a.Start)
291 case b.End.Number > a.Start.Number:
292 // log.Printf("{ %s [ } %s ]", b.End, a.Start)
299 // Parses a string in the AniDB API range format and converts into an EpisodeRange.
300 func ParseEpisodeRange(s string) *EpisodeRange {
301 parts := strings.Split(s, "-")
307 for i := range parts {
308 eps[i] = ParseEpisode(parts[i])
314 // Not an interval (just "epno") --
315 // convert into interval starting and ending in the same episode
320 if len(parts) > 1 && eps[1] != nil && eps[0].Type != eps[1].Type {
323 return &EpisodeRange{