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 // Check if the given range is not nil, has a defined start
148 // and, if it has an end, that the end ends after the start.
149 func (er *EpisodeRange) Valid() bool {
151 case er == nil, er.Start == nil:
155 case er.Start.Number < er.End.Number:
157 case er.Start.Number > er.End.Number:
159 case er.Start.Part <= er.End.Part:
166 // Simplifies the Start/End ranges if one contains the other.
167 // Sets the pointers to be identical if the range is modified.
169 // Modifies in-place, returns itself.
170 func (er *EpisodeRange) Simplify() *EpisodeRange {
172 case er.Start.ContainsEpisodes(er.End):
174 case er.End != nil && er.End.ContainsEpisodes(er.Start):
180 // Splits the range into one or two ranges, using the given
181 // Episode as the split point. The Episode is not included in
182 // the resulting ranges.
183 func (er *EpisodeRange) Split(ep *Episode) []*EpisodeRange {
184 if !er.ContainsEpisodes(ep) { // implies same type
185 return []*EpisodeRange{er}
188 return []*EpisodeRange{nil, nil}
205 case a.ContainsEpisodes(ep) && b.ContainsEpisodes(ep):
206 return []*EpisodeRange{nil, nil}
207 case a.ContainsEpisodes(ep):
213 if a.Number == b.Number && b.Parts > 0 {
222 return []*EpisodeRange{nil, r.Simplify()}
223 case b.ContainsEpisodes(ep):
229 if b.Number == a.Number {
233 } else if b.Part < 0 {
242 return []*EpisodeRange{r.Simplify(), nil}
269 return []*EpisodeRange{ra, rb}
273 // Returns true if both ranges are of the same type and
274 // have identical start/end positions
275 func (a *EpisodeRange) Equals(b *EpisodeRange) bool {
276 if a == b { // pointers to the same thing
279 if a == nil || b == nil {
283 if a.Type == b.Type {
284 if a.End == b.End || (a.End != nil && b.End != nil &&
285 a.End.Number == b.End.Number && a.End.Part == b.End.Part) {
286 if a.Start == b.Start || a.Start.Number == b.Start.Number && a.Start.Part == b.Start.Part {
294 // CORNER CASE: e.g. 1.3,2.0 (or 1.3,2) always touch,
295 // even if there's an unlisted 1.4 between them; unless
296 // the part count is known.
297 func (a *EpisodeRange) touches(b *EpisodeRange) bool {
298 if a == nil || b == nil || a.Type != b.Type {
304 // log.Println("same pointers")
306 case a.Start == b.Start, a.End != nil && a.End == b.End:
307 // log.Println("share pointers")
313 // log.Println("both infinite")
316 case b.End.Number == a.Start.Number:
318 // either is whole, or parts are adjacent/overlap
319 case b.End.Part == -1, a.Start.Part == -1,
320 b.End.Part >= a.Start.Part-1:
321 // log.Printf("{ %s [} %s ...", b.End, a.Start)
324 // only if start of next range is whole or is first part
325 case b.End.Number == a.Start.Number-1 && a.Start.Part <= 0:
327 // end is whole, or is last part, or part count is unknown
328 case b.End.Part == -1, b.End.Parts == 0,
329 b.End.Part == b.End.Parts:
330 // log.Printf("{ %s }[ %s ...", b.End, a.Start)
333 case b.End.Number > a.Start.Number:
334 // log.Printf("{ %s [ } %s ...", b.End, a.Start)
340 case a.End.Number == b.Start.Number:
342 case a.End.Part == -1, b.Start.Part == -1,
343 a.End.Part >= b.Start.Part-1:
344 // log.Printf("[ %s {] %s ...", a.End, b.Start)
347 case a.End.Number == b.Start.Number-1 && b.Start.Part <= 0:
349 case a.End.Part == -1, a.End.Parts == 0,
350 a.End.Part == a.End.Parts:
351 // log.Printf("[ %s ]{ %s ...", a.End, b.Start)
354 case a.End.Number > b.Start.Number:
355 // log.Printf("[ %s { ] %s ...", a.End, b.Start)
359 case a.Start.Number == b.Start.Number:
362 // either is whole, or parts are immediately adjacent
363 case a.Start.Part == -1, b.Start.Part == -1,
364 a.Start.Part == b.Start.Part,
365 a.Start.Part == b.Start.Part-1,
366 a.Start.Part == b.Start.Part+1:
367 // log.Printf("[{ %s - %s ]}", a.End, b.Start)
370 case a.End.Number == b.End.Number:
372 case a.End.Part == -1, b.End.Part == -1,
373 a.End.Part == b.End.Part,
374 a.End.Part == b.End.Part-1,
375 a.End.Part == b.End.Part+1:
376 // log.Printf("{[ %s - %s }]", b.End, a.Start)
380 case a.End.Number < b.End.Number:
382 case a.End.Number == b.Start.Number:
384 case a.End.Part == -1, b.Start.Part == -1,
385 a.End.Part >= b.Start.Part-1:
386 // log.Printf("[ %s {] %s }", a.End, b.Start)
389 case a.End.Number == b.Start.Number-1 && b.Start.Part <= 0:
391 case b.End.Part == -1, b.End.Parts == 0,
392 b.End.Part == b.End.Parts:
393 // log.Printf("[ %s ]{ %s }", a.End, b.Start)
396 case a.End.Number > b.Start.Number:
397 // log.Printf("[ %s { ] %s }", a.End, b.Start)
401 case b.End.Number < a.End.Number:
403 case b.End.Number == a.Start.Number:
405 case b.End.Part == -1, a.Start.Part == -1,
406 b.End.Part >= a.Start.Part-1:
407 // log.Printf("{ %s [} %s ]", b.End, a.Start)
410 case b.End.Number == a.Start.Number-1 && a.Start.Part <= 0:
412 case b.End.Part == -1, b.End.Parts == 0,
413 b.End.Part == b.End.Parts:
414 // log.Printf("{ %s }[ %s ]", b.End, a.Start)
417 case b.End.Number > a.Start.Number:
418 // log.Printf("{ %s [ } %s ]", b.End, a.Start)
425 // Parses a string in the AniDB API range format and converts into an EpisodeRange.
426 func ParseEpisodeRange(s string) *EpisodeRange {
427 parts := strings.Split(s, "-")
433 for i := range parts {
434 eps[i] = ParseEpisode(parts[i])
440 // Not an interval (just "epno") --
441 // convert into interval starting and ending in the same episode
446 if len(parts) > 1 && eps[1] != nil && eps[0].Type != eps[1].Type {
449 return &EpisodeRange{