Searched refs:transitions (Results 1 - 5 of 5) sorted by relevance

/openjdk7/jdk/make/tools/src/build/tools/javazic/
H A DTimezone.java46 private List<Long> transitions; field in class:Timezone
56 * at transitions
62 * at transitions
92 * The CRC32 value of the transitions data
128 * @return the number of transitions
131 if (transitions == null) {
134 return transitions.size();
166 return transitions;
243 if (transitions == null) {
244 transitions
[all...]
H A DGen.java88 List<Long> transitions = tz.getTransitions();
89 if (transitions != null) {
101 size = transitions.size();
113 dos.writeLong((((Long)transitions.get(i)).longValue() << 12)
/openjdk7/jdk/src/share/classes/sun/util/calendar/
H A DZoneInfo.java44 * daylight saving time transitions of a time zone.
46 * The daylight saving time transitions are described in the {@link
47 * #transitions transitions} table consisting of a chronological
48 * sequence of transitions of GMT offset and/or daylight saving time
49 * changes. Since all transitions are represented in UTC, in theory,
54 * This table covers transitions from 1900 until 2037 (as of version
63 * The date items, transitions, GMT offset(s), etc. are read from a database
131 * This array describes transitions of GMT offsets of this time
152 private long[] transitions; field in class:ZoneInfo
217 ZoneInfo(String ID, int rawOffset, int dstSavings, int checksum, long[] transitions, int[] offsets, int[] simpleTimeZoneParams, boolean willGMTOffsetChange) argument
[all...]
H A DZoneInfoFile.java122 * transition transitions<sup>2</sup>;
158 * s8 value[length/8]; // transitions in `long'
162 * See {@link ZoneInfo#transitions ZoneInfo.transitions} about the value.
220 * s4 value; // CRC32 value of transitions
607 long[] transitions = null;
664 transitions = new long[n];
674 transitions[i] = val;
737 transitions, offsets, simpleTimeZoneParams,
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/models/
H A DXSDFACM.java351 // In the DFA there will be two transitions from the current state which
589 // contiguous indices to represent the transitions for a particular
862 int [] transitions = fTransTable[i];
863 for (int j = 0; j < transitions.length; ++j) {
864 if (i == transitions[j]) {
1040 * -1 is used to represent bad transitions in the transition table
1102 // for each state, check whether it has overlap transitions
1114 // If "i" is a counting state and exactly one of the transitions
1186 // Do not include transitions which loop back to the
1194 // Do not include transitions whic
[all...]

Completed in 60 milliseconds