source: doc/theses/mike_brooks_MMath/benchmarks/list/op-queue-inslast-remelem.h @ bc17be98

Last change on this file since bc17be98 was 2b01f8e, checked in by Mike Brooks <mlbrooks@…>, 19 months ago

Adjust LL perf to use a random layout of nodes in memory

  • Property mode set to 100644
File size: 523 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// remelem:  removes happen via an element-level operation and inserts happen via the api-provided "last"/"tail"/"back"
4
5#define BOP_TEARDOWN(lst, iters, remNo)     BFX_REMOVE_FIRST(B_UserItem, lst)
6
7#define BOP_INSERT(lst, iters, insNo, item) BFX_INSERT_LAST(B_UserItem, lst, (item))
8#define BOP_REMOVE(lst, iters, remNo)       BFX_REMOVE_HERE(B_UserItem, lst, iters[(remNo)])
Note: See TracBrowser for help on using the repository browser.