| Commit message (Expand) | Author | Age | Files | Lines |
| * | Cache both ends of the queue to give O(1) peek and peek_r | Matthew Sackman | 2011-10-12 | 1 | -37/+68 |
| * | Do not use q1+q4 length when calculating permitted ?s - if you do, then as th... | Matthew Sackman | 2011-10-11 | 1 | -5/+4 |
| * | Add peek and peek_r to lqueue, and use them in needs_timeout. Whilst this is ... | Matthew Sackman | 2011-10-11 | 2 | -10/+18 |
| * | When under memory pressure, we want to limit the size of q2 and q3, not just ... | Matthew Sackman | 2011-10-11 | 2 | -161/+132 |
| * | Merging default to bug24455 | Matthew Sackman | 2011-10-11 | 6 | -219/+211 |
| |\ |
|
| | * | Merged bug24461 into default | Emile Joubert | 2011-10-06 | 11 | -128/+146 |
| | |\ |
|
| | | * | inline publish/5 | Matthias Radestock | 2011-10-06 | 1 | -31/+25 |
| | | * | Merged bug24459 into default | Emile Joubert | 2011-10-05 | 1 | -30/+34 |
| | | |\ |
|
| | | | * | merge default into bug24459 | Matthias Radestock | 2011-10-01 | 1 | -30/+34 |
| | | | |\ |
|
| | | | | * | keep track of uncommitted acks in a list instead of a queue | Matthias Radestock | 2011-10-01 | 1 | -17/+15 |
| | | | | * | collect acks in lists rather than queues | Matthias Radestock | 2011-10-01 | 1 | -20/+26 |
| | | * | | | Merged bug24462 into default | Emile Joubert | 2011-10-04 | 1 | -1/+1 |
| | | |\ \ \ |
|
| | | | * | | | Don't blow up when nodes policy is used. | Simon MacMullen | 2011-10-03 | 1 | -1/+1 |
| | * | | | | | make the rabbit_event API more pleasant to use and less costly | Matthias Radestock | 2011-10-01 | 4 | -157/+151 |
| | | |_|/ /
| |/| | | |
|
| * | | | | | Ensure that we push ?-bordering ?s into ? eagerly. | Matthew Sackman | 2011-10-11 | 2 | -10/+22 |
| * | | | | | Merging default into bug24455 | Matthew Sackman | 2011-10-04 | 4 | -648/+271 |
| |\ \ \ \ \
| |_|/ / /
|/| | | | |
|
| | * | | | | simplify delta calculation in push_betas_to_deltas | Matthias Radestock | 2011-10-03 | 1 | -65/+47 |
| | * | | | | fix indentation | Matthias Radestock | 2011-10-02 | 1 | -2/+1 |
| | * | | | | save a line | Matthias Radestock | 2011-10-02 | 1 | -3/+2 |
| | * | | | | merge heads | Matthias Radestock | 2011-10-02 | 1 | -1/+1 |
| | |\ \ \ \ |
|
| | | * | | | | Make lqueue opaque | Matthew Sackman | 2011-10-02 | 1 | -1/+1 |
| | * | | | | | refactor: get rid of #merge_funs | Matthias Radestock | 2011-10-02 | 1 | -54/+29 |
| | * | | | | | some small cosmetic changes and tiny tweaks | Matthias Radestock | 2011-10-02 | 1 | -13/+13 |
| | |/ / / / |
|
| | * | | | | Drop unneeded queue impls, tidy lqueue, add specs etc | Matthew Sackman | 2011-10-02 | 6 | -820/+28 |
| | * | | | | Avoid lots of combine_delta calls | Matthew Sackman | 2011-10-02 | 2 | -45/+87 |
| | * | | | | Merging default into bug24455 | Matthew Sackman | 2011-10-02 | 7 | -80/+87 |
| | |\ \ \ \ |
|
| | * | | | | | Avoid delta's low end extending beyond the low end of q3 | Matthew Sackman | 2011-09-30 | 1 | -16/+21 |
| | * | | | | | Merging default into bug24455 | Matthew Sackman | 2011-09-30 | 4 | -240/+380 |
| | |\ \ \ \ \ |
|
| | * | | | | | | Count the quota properly on beta -> delta. Also, fprof shows that the queue:l... | Matthew Sackman | 2011-09-29 | 2 | -51/+97 |
| | * | | | | | | Count properly | Matthew Sackman | 2011-09-28 | 1 | -4/+4 |
| | * | | | | | | Change one or two things around a little bit | Matthew Sackman | 2011-09-28 | 2 | -114/+83 |
| | * | | | | | | Add 2,3-finger_tree implementation. | Matthew Sackman | 2011-09-26 | 3 | -1/+288 |
| | * | | | | | | Merging default into bug24455 | Matthew Sackman | 2011-09-26 | 8 | -18/+34 |
| | |\ \ \ \ \ \ |
|
| | * | | | | | | | bpqueue is very dependent on the performance of queue:join. fqueue makes queu... | Matthew Sackman | 2011-09-23 | 2 | -32/+152 |
| * | | | | | | | | merge bug24323 into default | Matthias Radestock | 2011-10-03 | 53 | -1153/+1701 |
| |\ \ \ \ \ \ \ \
| | |_|_|_|_|/ /
| |/| | | | | | |
|
| | * | | | | | | | optimise resource lookup | Matthias Radestock | 2011-10-03 | 2 | -8/+10 |
| | * | | | | | | | improve performance by bypassing mnesia for queue lookup | Matthias Radestock | 2011-10-03 | 1 | -11/+10 |
| | | |_|_|/ / /
| |/| | | | | |
|
| | * | | | | | | optimise interaction of limiter with single queues | Matthias Radestock | 2011-10-01 | 1 | -0/+1 |
| | * | | | | | | switch vq pending_ack from dict to gb_trees | Matthias Radestock | 2011-10-01 | 1 | -14/+13 |
| | * | | | | | | optimise vq:drain_confirmed for the common case | Matthias Radestock | 2011-10-01 | 1 | -1/+5 |
| | | |_|_|/ /
| |/| | | | |
|
| | * | | | | | yes, this really does gain ~1% with MCM with two erlang schedulers | Matthias Radestock | 2011-10-01 | 1 | -3/+9 |
| | | |_|_|/
| |/| | | |
|
| | * | | | | speed up acks a bit | Matthias Radestock | 2011-10-01 | 1 | -10/+5 |
| | * | | | | refactor: extract gb_trees_fold/3 and gb_trees_foreach/2 | Matthias Radestock | 2011-10-01 | 3 | -11/+17 |
| | * | | | | refactor: eliminate gratuitous differences in 'confirm' code | Matthias Radestock | 2011-10-01 | 2 | -17/+17 |
| | * | | | | refactor: one gb_trees_cons is quite enough | Matthias Radestock | 2011-10-01 | 3 | -15/+11 |
| | * | | | | a few minor tweaks, essentially cosmetic | Matthias Radestock | 2011-09-30 | 1 | -7/+7 |
| | * | | | | avoid creation of intermediate binaries by using io_lists | Matthias Radestock | 2011-09-30 | 1 | -3/+2 |
| | * | | | | performance improving short cut | Matthias Radestock | 2011-09-30 | 1 | -0/+2 |
| | * | | | | cosmetic | Matthias Radestock | 2011-09-30 | 1 | -2/+1 |
| | | |_|/
| |/| | |
|
| | * | | | correct formatting | Matthias Radestock | 2011-09-30 | 1 | -13/+14 |