/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.sis.internal.feature;

import java.util.AbstractList;
import org.apache.sis.util.collection.IntegerList;
import org.apache.sis.util.collection.CheckedContainer;

// Branch-dependent imports
import java.time.Instant;


/**
 * Unmodifiable lists of instants.
 *
 * @author  Martin Desruisseaux (Geomatys)
 * @version 0.8
 * @since   0.8
 * @module
 */
final class DateList extends AbstractList<Instant> implements CheckedContainer<Instant> {
    /**
     * The times in multiples of {@link #increment} milliseconds since the {@link #epoch}.
     */
    private final IntegerList times;

    /**
     * The value by which to multiply the {@link #times} values in order to get milliseconds.
     */
    private final long increment;

    /**
     * The epoch in milliseconds since January 1st, 1970 midnight UTC.
     */
    private final long epoch;

    /**
     * Creates a new list for the given times. The given array shall be a temporary one
     * since this constructor modifies the array values for computational purpose.
     */
    DateList(final long[] millis) {
        long min = Long.MAX_VALUE;
        for (final long t : millis) {
            if (t < min) min = t;
        }
        long max = 1;
        for (int i=0; i<millis.length; i++) {
            final long t = (millis[i] -= min);
            if (t > max) max = t;
        }
        long inc = max;
        for (long t : millis) {
            if ((t % inc) != 0) {
                do {
                    final long r = (inc % t);       // Search for greatest common divisor with Euclid's algorithm.
                    inc = t;
                    t = r;
                } while (t != 0);
                if (inc == 1) break;                // No need to check other values.
            }
        }
        epoch = min;
        increment = inc;
        times = new IntegerList(millis.length, Math.toIntExact(max / inc));
        for (final long t : millis) {
            times.add(Math.toIntExact(t / inc));
        }
    }

    /**
     * Returns the kind of elements in this list.
     */
    @Override
    public Class<Instant> getElementType() {
        return Instant.class;
    }

    /**
     * Returns the number of instants in this list.
     */
    @Override
    public int size() {
        return times.size();
    }

    /**
     * Returns the instant at the given index.
     */
    @Override
    public Instant get(final int index) {
        return Instant.ofEpochMilli(times.getInt(index)*increment + epoch);
    }
}

@@ -894,35 +894,19 @@
 sis.
-util.collection.IntegerList
+math.Vector
 ;%0Aim
@@ -1269,40 +1269,8 @@
 s in
- multiples of %7B@link #increment%7D
  mil
@@ -1293,22 +1293,13 @@
 the 
-%7B@link #
 epoch
-%7D
 .%0A  
@@ -1326,1434 +1326,179 @@
 nal 
-IntegerList times;%0A%0A    /**%0A     * The value by which to multiply the %7B@link #times%7D values in order to get milliseconds.%0A     */%0A    private final long increment;%0A%0A    /**%0A     * The epoch in milliseconds since January 1st, 1970 midnight UTC.%0A     */%0A    private final long epoch;%0A%0A    /**%0A     * Creates a new list for the given times. The given array shall be a temporary one%0A     * since this constructor modifies the array values for computational purpose.%0A     */%0A    DateList(final long%5B%5D millis) %7B%0A        long min = Long.MAX_VALUE;%0A        for (final long t : millis) %7B%0A            if (t %3C min) min = t;%0A        %7D%0A        long max = 1;%0A        for (int i=0; i%3Cmillis.length; i++) %7B%0A            final long t = (millis%5Bi%5D -= min);%0A            if (t %3E max) max = t;%0A        %7D%0A        long inc = max;%0A        for (long t : millis) %7B%0A            if ((t %25 inc) != 0) %7B%0A                do %7B%0A                    final long r = (inc %25 t);       // Search for greatest common divisor with Euclid's algorithm.%0A                    inc = t;%0A                    t = r;%0A                %7D while (t != 0);%0A                if (inc == 1) break;                // No need to check other values.%0A            %7D%0A        %7D%0A        epoch = min;%0A        increment = inc;%0A        times = new IntegerList(millis.length, Math.toIntExact(max / inc));%0A        for (final long t : millis) %7B%0A            times.add(Math.toIntExact(t / inc));%0A        %7D
+Vector times;%0A%0A    /**%0A     * Creates a new list for the given times.%0A     */%0A    DateList(final long%5B%5D millis) %7B%0A        times = Vector.create(millis, false).compress(0);
 %0A   
@@ -1970,39 +1970,24 @@
 mes.
-getInt(index)*increment + epoch
+longValue(index)
 );%0A 

Use the compression provided by Vector instead of duplication the code here.