source: doc/theses/mike_brooks_MMath/benchmarks/list/op-queue-insfirst-remelem.h @ 508671e

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

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

  • Property mode set to 100644
File size: 528 bytes
Line 
1// queue:    inserts and removes happen at opposite ends
2// insfirst: elements flow from "first," "head" or "front", to "last", "tail" or "back"
3// remelem:  removes happen via an element-level operation and inserts happen via the api-provided "first"/"head"/"front"
4
5#define BOP_TEARDOWN(lst, iters, remNo)      BFX_REMOVE_LAST(B_UserItem, lst)
6
7#define BOP_INSERT(lst, iters, insNo, item)  BFX_INSERT_FIRST(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.