source: doc/theses/mike_brooks_MMath/benchmarks/list/op-queue-inslast-inselem.h@ d2e6f84

Last change on this file since d2e6f84 was 6c58850, checked in by Michael Brooks <mlbrooks@…>, 6 weeks ago

Revise data in linked-list plots with streamlined harness and data from runs on swift.

No change to text discussing the plots, so some of that discussion is now stale.

Harness changes allow more ifdef feature disabling and eliminate side-array usage, keeping all per-node harness state inside the list nodes.

Completely disable the interleaving experiment, which was not giving discernable data.

  • Property mode set to 100644
File size: 562 bytes
Line 
1// queue: inserts and removes happen at opposite ends
2// inslast: elements flow from "last", "tail" or "back", to "first," "head" or "front"
3// inselem: inserts happen via an element-level operation and removes happen via the api-provided "first"/"tail"/"front"
4
5#define BOP_INIT(lst, item) BFX_INSERT_LAST(B_UserItem, lst, (item))
6
7#define BOP_INSERT(lst, lastInsIter, item) BFX_INSERT_AFTER(B_UserItem, lst, (item), lastInsIter)
8#define BOP_REMOVE(lst, remIter) BFX_REMOVE_FIRST(B_UserItem, lst)
9#define BOP_SWITCH_REMDIR(fwd, rev) fwd
Note: See TracBrowser for help on using the repository browser.