aboutsummaryrefslogtreecommitdiff
path: root/test_brandt.c
AgeCommit message (Collapse)Author
2016-11-01handle n <= m case in m+1st price auctionsMarkus Teich
The lowest possible price from the price map will be the price each bidder has to pay. Since the seller can define the price map, he can set the lowest price to the lowest he is willing to sell one item at.
2016-11-01add todo entryMarkus Teich
2016-11-01test for no biddersMarkus Teich
2016-10-15fixup test_brandtMarkus Teich
2016-10-14make test_brandt ready for M+1st price auctionsMarkus Teich
2016-10-14rework test_brandtMarkus Teich
2016-10-13remove test.h dependency from test_brandt.cMarkus Teich
2016-09-23test_brandt: actually check the outcome correctnesMarkus Teich
2016-09-21minor style fixMarkus Teich
2016-09-21coding style fixesMarkus Teich
2016-09-11public firstprice auction working in test_brandtMarkus Teich
2016-09-08private firstprice auction working in test_brandtMarkus Teich
2016-09-08test_brandt nearly doneMarkus Teich
2016-08-31temporary dump for discussionMarkus Teich
2016-08-17remove unused code in testMarkus Teich
2016-08-17add start callback and further basic testsMarkus Teich
2016-08-17minimal changesMarkus Teich
2016-08-16some stuffMarkus Teich
- finish BRANDT_destroy() - fix include mess related to platform.h and brandt_config.h - add first brandt.c testcase
generated by cgit v1.2.3 (git 2.39.1) at 2025-09-11 15:39:02 +0000