Commit graph

18 commits

Author SHA1 Message Date
Prayag Verma
b7783968a0 =pro #19068 All copyrights ranges and single years updated to a range ending in 2016 2016-01-25 10:20:30 +01:00
Björn Antonsson
36e736582b =act #19216 Fix AbstractNodeQueue value nepotism 2015-12-21 15:57:43 +01:00
Björn Antonsson
a43d323d3c =act #19216 Fix AbstractNodeQueue nepotism 2015-12-17 15:04:55 +01:00
Roland Kuhn
1830b729bb =act correct two comments in AbstractNodeQueue.java 2015-10-01 11:14:54 +02:00
Julian Tescher
00f6a58e7c Changes all occurances of Typesafe copyright to extend to 2015 2015-03-10 14:12:19 -07:00
Nitsan Wakart
87aea390b1 Forgotten bracket 2014-08-08 15:34:30 +02:00
Nitsan Wakart
24ac90448d Doc stars err 2014-08-08 15:33:44 +02:00
Nitsan Wakart
a1311d4a93 Fixe documentation to state consumer only access is allowed to poll/peek/peekNode/pollNode 2014-08-08 15:27:12 +02:00
Nitsan Wakart
74d0f0cc6c Fix isEmpty() and count()
isEmpty() need not rely on peek(which is intended for consumer use) and instead compare head to tail.
count() should stop counting at max int to avoid wrap.
2014-08-08 15:17:36 +02:00
Nitsan Wakart
e8cefbf7ba Update AbstractNodeQueue.java
language language....
2014-07-28 15:44:08 +02:00
Nitsan Wakart
5dbdc605b0 Update AbstractNodeQueue.java
Avoid spinning on head when a peek/poll observes a null next but the queue is not empty.
2014-07-28 14:19:34 +02:00
Adam Voss
cce29dfa51 Changes all occurances of Typesafe copyright to extend to 2014. 2014-02-04 21:20:09 -06:00
Patrik Nordwall
615c6b572c =* #2966 Reduce warnings from compile, test, scaladoc 2014-01-24 11:47:57 +01:00
Roland Kuhn
e14f22f2e3 rework LARS, see #3428
- tasks are still enqueued without reading the clock
- in order to be resilient against timer thread over-sleeping the tasks
  are passed to the timer thread using an AbstractNodeQueue and the
  wheel itself is now private to the timer thread
- reuse queue Nodes along the way to minimize allocation costs

The problem with the old implementation was that the timer thread could
sleep too long, then wake up and run multiple buckets in quick
succession. Tasks enqueued just before that event could then get
executed basically immediately, i.e. before their allotted time.
2013-06-19 15:28:23 +02:00
Viktor Klang
1f694a3612 #3405 - fix race between consumer and producer for MPSC 2013-05-28 16:54:58 +02:00
Viktor Klang
c48a2c4aac Renaming peek() to peekNode and making it protected, then creating a new peek that returns T 2013-04-03 20:55:41 +02:00
Viktor Klang
68dfada8bc Moving in isEmpty and count into AbstractNodeQueue 2013-04-03 20:05:20 +02:00
Viktor Klang
fb2decbcda Adding high-performance MPSC queue based mailbox to Akka 2013-03-14 14:37:57 +01:00