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

ADTast-experimental
Last change on this file since 0b66ef9 was 0b66ef9, checked in by Michael Brooks <mlbrooks@…>, 13 months ago

Add linked list performance experiment

  • Property mode set to 100644
File size: 508 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, ui, iters, i) BFX_INSERT_LAST(B_UserItem, lst, ui[i])
6
7#define BOP_INSERT(lst, ui, iters, i) BFX_INSERT_AFTER(B_UserItem, lst, ui[i], iters[i-1])
8#define BOP_REMOVE(lst, ui, iters, i) BFX_REMOVE_FIRST(B_UserItem, lst)
Note: See TracBrowser for help on using the repository browser.