public double[] toArray( int offset, int len ) { return list.toArray( offset, len ); } public double[] toArray( double[] dest, int offset, int len ) {
public double[] toArray( int offset, int len ) { synchronized( mutex ) { return list.toArray( offset, len ); } } public double[] toArray( double[] dest, int offset, int len ) {
public double[] toArray( double[] dest, int offset, int len ) { return list.toArray( dest, offset, len ); } public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) {
public double[] toArray( double[] dest, int offset, int len ) { synchronized( mutex ) { return list.toArray( dest, offset, len ); } } public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) {
public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) { return list.toArray( dest, source_pos, dest_pos, len ); }
public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) { synchronized( mutex ) { return list.toArray( dest, source_pos, dest_pos, len ); } }
/** {@inheritDoc} */ public void sort(int fromIndex, int toIndex) { TDoubleList tmp = subList(fromIndex, toIndex); double[] vals = tmp.toArray(); Arrays.sort(vals); set(fromIndex, vals); }
/** * Calculates Transit center from median of coordinates of all transitStops if graph * has transit. If it doesn't it isn't calculated. (mean walue of min, max latitude and longitudes are used) * * Transit center is saved in center variable * * This speeds up calculation, but problem is that median needs to have all of latitudes/longitudes * in memory, this can become problematic in large installations. It works without a problem on New York State. */ public void calculateTransitCenter() { if (hasTransit) { TDoubleList latitudes = new TDoubleLinkedList(); TDoubleList longitudes = new TDoubleLinkedList(); Median median = new Median(); getVertices().stream() .filter(v -> v instanceof TransitStop) .forEach(v -> { latitudes.add(v.getLat()); longitudes.add(v.getLon()); }); median.setData(latitudes.toArray()); double medianLatitude = median.evaluate(); median = new Median(); median.setData(longitudes.toArray()); double medianLongitude = median.evaluate(); this.center = new Coordinate(medianLongitude, medianLatitude); } }
@Override public double[] toArray( int offset, int len ) { return list.toArray( offset, len ); } @Override
@Override public double[] toArray( int offset, int len ) { synchronized( mutex ) { return list.toArray( offset, len ); } } @Override
public double[] toArray( double[] dest, int offset, int len ) { synchronized( mutex ) { return list.toArray( dest, offset, len ); } } public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) {
public double[] toArray( int offset, int len ) { synchronized( mutex ) { return list.toArray( offset, len ); } } public double[] toArray( double[] dest, int offset, int len ) {
@Override public double[] toArray( double[] dest, int offset, int len ) { return list.toArray( dest, offset, len ); } @Override
@Override public double[] toArray( double[] dest, int offset, int len ) { synchronized( mutex ) { return list.toArray( dest, offset, len ); } } @Override
public double[] toArray( double[] dest, int offset, int len ) { return list.toArray( dest, offset, len ); } public double[] toArray( double[] dest, int source_pos, int dest_pos, int len ) {
/** {@inheritDoc} */ public void sort(int fromIndex, int toIndex) { TDoubleList tmp = subList(fromIndex, toIndex); double[] vals = tmp.toArray(); Arrays.sort(vals); set(fromIndex, vals); }
/** {@inheritDoc} */ @Override public void sort(int fromIndex, int toIndex) { TDoubleList tmp = subList(fromIndex, toIndex); double[] vals = tmp.toArray(); Arrays.sort(vals); set(fromIndex, vals); }
public static void makeMonotonicIncreasing(TDoubleList X, double epsilon) { double X2[] = X.toArray(); makeMonotonicIncreasing(X2, epsilon); X.set(0, X2); }
public static void makeMonotonicIncreasing(TDoubleList X, double epsilon) { double X2[] = X.toArray(); makeMonotonicIncreasing(X2, epsilon); X.set(0, X2); }