/** * Returns the current depth of the stack. */ public int size() { return _list.size(); }
public float l2Norm2() { return data.size(); }
public int timesSize() { return startTimes.size(); }
private int size() { return data.size(); }
/** {@inheritDoc} */ public boolean hasNext() { return cursor < size(); }
/** {@inheritDoc} */ public int max() { if ( size() == 0 ) { throw new IllegalStateException("cannot find maximum of an empty list"); } int max = Integer.MIN_VALUE; for ( int i = 0; i < _pos; i++ ) { if ( _data[ i ] > max ) { max = _data[ i ]; } } return max; }
/** {@inheritDoc} */ public int min() { if ( size() == 0 ) { throw new IllegalStateException( "cannot find minimum of an empty list" ); } int min = Integer.MAX_VALUE; for ( int i = 0; i < _pos; i++ ) { if ( _data[i] < min ) { min = _data[i]; } } return min; }
/** * get a single end time * * @return a single end time */ public int getEndTime() { if (endTimes.size() == 0) { return 0; } return endTimes.get(0); }
/** {@inheritDoc} */ @Override public String toString() { final StringBuilder buf = new StringBuilder( "{" ); for ( int i = 0, end = _pos - 1; i < end; i++ ) { buf.append( _data[ i ] ); buf.append( ", " ); } if ( size() > 0 ) { buf.append( _data[ _pos - 1 ] ); } buf.append( "}" ); return buf.toString(); }
/** * get a single start time * * @return a single start time */ public int getStartTime() { if (startTimes.size() == 0) { return 0; } return startTimes.get(0); }
/** * Removes and returns the value at the top of the stack. * * @return an <code>int</code> value */ public int pop() { return _list.removeAt( _list.size() - 1 ); }
/** * Returns the value at the top of the stack. * * @return an <code>int</code> value */ public int peek() { return _list.get( _list.size() - 1 ); }
public Map<Integer, String> getOrderedObjectNames() { if (namesOrder == null) { return null; } LinkedHashMap<Integer, String> lm = new LinkedHashMap<Integer, String> (); for (int i = 0; i < namesOrder.size(); i++) { int nm = namesOrder.get(i); lm.put(nm, objectNames.get(nm)); } return lm; }
@Override public boolean hasOverlapTimes() { for (int i = 0; i < this.startTimes.size(); i++) { int startTime = this.startTimes.get(i); int endTime = this.endTimes.get(i); if (startTime >= endTime && endTime != -1) { return true; } } return false; }
@Override public boolean isOpened24_7() { boolean opened24_7 = isOpenedEveryDay(); if (opened24_7) { if (startTimes != null && startTimes.size() > 0) { for (int i = 0; i < startTimes.size(); i++) { int startTime = startTimes.get(i); int endTime = endTimes.get(i); if (startTime == 0 && endTime / 60 == 24) { return true; } } } else { return true; } } return false; }
/** * set a single start time, erase all previously added start times * * @param s startTime to set */ public void setStartTime(int s) { setSingleValueForArrayList(startTimes, s); if (endTimes.size() != 1) { setSingleValueForArrayList(endTimes, 0); } }
/** * set a single end time, erase all previously added end times * * @param e endTime to set */ public void setEndTime(int e) { setSingleValueForArrayList(endTimes, e); if (startTimes.size() != 1) { setSingleValueForArrayList(startTimes, 0); } }
public int getArrivalTime() { if(route.getSchedule() != null && depTime != -1) { int tm = depTime; TIntArrayList intervals = route.getSchedule().avgStopIntervals; for(int i = start; i <= end; i++) { if(i == end) { return tm; } if(intervals.size() > i) { tm += intervals.get(i); } else { break; } } } return -1; }