private int put( final K key, final V value, final long timestamp, final SharedBufferEntry<K, V> previousSharedBufferEntry, final DeweyNumber version) { SharedBufferPage<K, V> page = pages.get(key); if (page == null) { page = new SharedBufferPage<>(key); pages.put(key, page); } // this assumes that elements are processed in order (in terms of time) int counter = 0; if (previousSharedBufferEntry != null) { ValueTimeWrapper<V> prev = previousSharedBufferEntry.getValueTime(); if (prev != null && prev.getTimestamp() == timestamp) { counter = prev.getCounter() + 1; } } page.add(new ValueTimeWrapper<>(value, timestamp, counter), previousSharedBufferEntry, version); return counter; }
return put(key, value, timestamp, previousSharedBufferEntry, version);
if (computationState.isStartState()) { startTimestamp = timestamp; counter = eventSharedBuffer.put( NFAStateNameHandler.getOriginalNameFromInternal( currentState.getName()), } else { startTimestamp = computationState.getStartTimestamp(); counter = eventSharedBuffer.put( NFAStateNameHandler.getOriginalNameFromInternal( currentState.getName()),