Lines Matching defs:segments
896 * Converts a list of events to a list of segments to draw. Assumes list is
899 * The algorithm goes over all the events and creates a set of segments
900 * ordered by start time. This list of segments is then converted into a
912 * <li>All segments drawn will maintain at least minPixels height, except
950 LinkedList<DNASegment> segments = new LinkedList<DNASegment>();
1024 if (segments.size() == 0) {
1025 addNewSegment(segments, event, strands, firstJulianDay, 0, minMinutes);
1030 DNASegment lastSegment = segments.getLast();
1045 int i = segments.size();
1047 while (--i >= 0 && endMinute < segments.get(i).startMinute);
1051 for (; i >= 0 && startMinute <= (currSegment = segments.get(i)).endMinute; i--) {
1065 segments.add(i + 1, rhs);
1069 + segments.get(i).toString());
1082 // referencing the segments to the right and left of the
1084 segments.add(i++, lhs);
1088 + segments.get(i).toString());
1093 if (i + 1 < segments.size()) {
1094 DNASegment rhs = segments.get(i + 1);
1098 segments.remove(currSegment);
1107 DNASegment lhs = segments.get(i - 1);
1111 segments.remove(currSegment);
1133 addNewSegment(segments, event, strands, firstJulianDay, lastSegment.endMinute,
1137 weaveDNAStrands(segments, firstJulianDay, strands, top, bottom, dayXs);
1163 // This processes all the segments, sorts them by color, and generates a
1165 private static void weaveDNAStrands(LinkedList<DNASegment> segments, int firstJulianDay,
1167 // First, get rid of any colors that ended up with no segments
1179 for (DNASegment segment : segments) {
1227 * segments across day boundaries and ensures a minimum size for segments.
1229 private static void addNewSegment(LinkedList<DNASegment> segments, Event event,
1245 addNewSegment(segments, lhs, strands, firstJulianDay, minStart, minMinutes);
1273 segments.add(segment);