source: doc/theses/mike_brooks_MMath/benchmarks/list/op-stack-inslast-remelem.h @ e9ed2a1

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

Add linked list performance experiment

  • Property mode set to 100644
File size: 502 bytes
Line 
1// stack:    inserts and removes happen at the same end
2// inslast:  stack's action happens at the end called "last", "tail" or "back"
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, ui, iters, i) BFX_REMOVE_LAST(B_UserItem, lst)
6
7#define BOP_INSERT(lst, ui, iters, i) BFX_INSERT_LAST(B_UserItem, lst, ui[i])
8#define BOP_REMOVE(lst, ui, iters, i) BFX_REMOVE_HERE(B_UserItem, lst, iters[NumNodes-(i)-1])
Note: See TracBrowser for help on using the repository browser.