altoslib: Start restructuring AltosState harder
[fw/altos] / altoslib / AltosOrderedMetrumRecord.java
1 /*
2  * Copyright © 2013 Keith Packard <keithp@keithp.com>
3  *
4  * This program is free software; you can redistribute it and/or modify
5  * it under the terms of the GNU General Public License as published by
6  * the Free Software Foundation; version 2 of the License.
7  *
8  * This program is distributed in the hope that it will be useful, but
9  * WITHOUT ANY WARRANTY; without even the implied warranty of
10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
11  * General Public License for more details.
12  *
13  * You should have received a copy of the GNU General Public License along
14  * with this program; if not, write to the Free Software Foundation, Inc.,
15  * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
16  */
17
18 package org.altusmetrum.altoslib_1;
19
20 import java.text.ParseException;
21
22 /*
23  * AltosRecords with an index field so they can be sorted by tick while preserving
24  * the original ordering for elements with matching ticks
25  */
26 class AltosOrderedMetrumRecord extends AltosEepromMetrum implements Comparable<AltosOrderedMetrumRecord> {
27
28         public int      index;
29
30         public AltosOrderedMetrumRecord(String line, int in_index, int prev_tick, boolean prev_tick_valid)
31                 throws ParseException {
32                 super(line);
33                 if (prev_tick_valid) {
34                         tick |= (prev_tick & ~0xffff);
35                         if (tick < prev_tick) {
36                                 if (prev_tick - tick > 0x8000)
37                                         tick += 0x10000;
38                         } else {
39                                 if (tick - prev_tick > 0x8000)
40                                         tick -= 0x10000;
41                         }
42                 }
43                 index = in_index;
44         }
45
46         public int compareTo(AltosOrderedMetrumRecord o) {
47                 int     tick_diff = tick - o.tick;
48                 if (tick_diff != 0)
49                         return tick_diff;
50                 return index - o.index;
51         }
52 }