source: doc/theses/mike_brooks_MMath/benchmarks/list/op-queue-inslast-allhead.h @ 748877f

Last change on this file since 748877f 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: 416 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// allhead:  inserts and removes happen via the api-provided "last"/"tail"/"back"/"first"/"tail"/"front"
4
5#define BOP_INSERT(lst, iters, insNo, item)  BFX_INSERT_LAST(B_UserItem, lst, (item))
6#define BOP_REMOVE(lst, iters, remNo)        BFX_REMOVE_FIRST(B_UserItem, lst)
Note: See TracBrowser for help on using the repository browser.