@Override public int compare(TaskStatusEvent arg0, TaskStatusEvent arg1) { if (arg1.getTimestamp() > arg0.getTimestamp()) { return -1; } else if (arg1.getTimestamp() == arg0.getTimestamp()) { return 0; } else { return 1; } } };
private TaskStatusEvent findEldestEvent() { // We don't lock anything because in the worst case, we just put things in out of order which // while not perfect, won't cause any actual harm. Out of order meaning between jobids, not // within the same job id. Whether this is the best strategy (as opposed to fullest deque) // is arguable. TaskStatusEvent current = null; for (final Deque<TaskStatusEvent> queue : items.values()) { if (queue == null) { continue; } final TaskStatusEvent item = queue.peek(); if (current == null || (item.getTimestamp() < current.getTimestamp())) { current = item; } } return current; }
final String eventDate = DATE_FORMATTER.print(event.getTimestamp()); final long unusedDurationMillis = clock.now().getMillis() - event.getTimestamp();
final long timestamp = event.getTimestamp(); final TaskStatus status = checkNotNull(event.getStatus()); final State state = checkNotNull(status.getState());
jobId, hostname, item.getTimestamp()); item.getTimestamp());
@Override public int compare(TaskStatusEvent arg0, TaskStatusEvent arg1) { if (arg1.getTimestamp() > arg0.getTimestamp()) { return -1; } else if (arg1.getTimestamp() == arg0.getTimestamp()) { return 0; } else { return 1; } } };
@Override protected long getTimestamp(final TaskStatusEvent event) { return event.getTimestamp(); }
long timestamp = checkNotNull(event.getTimestamp()); TaskStatus status = checkNotNull(event.getStatus()); State state = checkNotNull(status.getState());