io.confluent.parallelconsumer.state.ProcessingShard<K,V>

public class ProcessingShard<K,V>
extends Object

Models the queue of work to be processed, based on the ParallelConsumerOptions.ProcessingOrder modes.

Method Summary

Modifier and Type	Method	Description
`void`	`addWorkContainer(WorkContainer<K,V> wc)`
`long`	`getCountOfWorkAwaitingSelection()`
`long`	`getCountOfWorkTracked()`
`long`	`getCountWorkInFlight()`
`NavigableMap<Long,WorkContainer<K,V>>`	`getEntries()`	Map of offset to WorkUnits.
`Optional<WorkContainer<K,V>>`	`getWorkForOffset(long offset)`
`boolean`	`isEmpty()`
`void`	`onSuccess(WorkContainer<?,?> wc)`
`WorkContainer<K,V>`	`remove(long offset)`
`boolean`	`workIsWaitingToBeProcessed()`

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- ProcessingShard
  
  public ProcessingShard(Object key, ParallelConsumerOptions<?,?> options, PartitionStateManager<K,V> pm)
Method Details
- workIsWaitingToBeProcessed
  
  public boolean workIsWaitingToBeProcessed()
- addWorkContainer
  
  public void addWorkContainer(WorkContainer<K,V> wc)
- onSuccess
  
  public void onSuccess(WorkContainer<?,?> wc)
- isEmpty
  
  public boolean isEmpty()
- getWorkForOffset
  
  public Optional<WorkContainer<K,V>> getWorkForOffset(long offset)
- getCountOfWorkAwaitingSelection
  
  public long getCountOfWorkAwaitingSelection()
- getCountOfWorkTracked
  
  public long getCountOfWorkTracked()
- getCountWorkInFlight
  
  public long getCountWorkInFlight()
- remove
  
  public WorkContainer<K,V> remove(long offset)
- getEntries
  
  public NavigableMap<Long,WorkContainer<K,V>> getEntries()
  
  Map of offset to WorkUnits.
  Uses a ConcurrentSkipListMap instead of a TreeMap as under high pressure there appears to be some concurrency errors (missing WorkContainers).

Class ProcessingShard<K,​V>