diff options
author | Gard Spreemann <gspr@nonempty.org> | 2022-04-29 13:54:09 +0200 |
---|---|---|
committer | Gard Spreemann <gspr@nonempty.org> | 2022-04-29 13:54:09 +0200 |
commit | fb4866e1d827389db17d74e5986d848617c8ef72 (patch) | |
tree | 46093502435ec117b137991a51acbe7f67b41dbc /wasserstein/include/auction_oracle_kdtree_restricted.hpp | |
parent | 66702d9cf122703964dbe22319ae8d97424d496f (diff) | |
parent | 8fbae1d789b3c9d7e9b079284c85489d8dcd7e65 (diff) |
Merge tag 'v1.0.0' into dfsg/latestdfsg/latest
Version 1.0.0
Diffstat (limited to 'wasserstein/include/auction_oracle_kdtree_restricted.hpp')
-rw-r--r-- | wasserstein/include/auction_oracle_kdtree_restricted.hpp | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/wasserstein/include/auction_oracle_kdtree_restricted.hpp b/wasserstein/include/auction_oracle_kdtree_restricted.hpp index f0e7ac6..e86a5d5 100644 --- a/wasserstein/include/auction_oracle_kdtree_restricted.hpp +++ b/wasserstein/include/auction_oracle_kdtree_restricted.hpp @@ -270,7 +270,6 @@ IdxValPair<Real_> AuctionOracleKDTreeRestricted<Real_, PointContainer_>::get_opt // and vice versa. size_t best_item_idx { k_invalid_index }; - size_t second_best_item_idx { k_invalid_index }; size_t best_diagonal_item_idx { k_invalid_index }; Real best_item_value; Real second_best_item_value; @@ -297,17 +296,14 @@ IdxValPair<Real_> AuctionOracleKDTreeRestricted<Real_, PointContainer_>::get_opt best_item_idx = proj_item_idx; best_item_value = proj_item_value; second_best_item_value = best_diagonal_item_value_; - second_best_item_idx = best_diagonal_item_idx; } else if (proj_item_value < second_best_diagonal_item_value_) { best_item_idx = best_diagonal_item_idx; best_item_value = best_diagonal_item_value_; second_best_item_value = proj_item_value; - second_best_item_idx = proj_item_idx; } else { best_item_idx = best_diagonal_item_idx; best_item_value = best_diagonal_item_value_; second_best_item_value = second_best_diagonal_item_value_; - second_best_item_idx = second_best_diagonal_item_idx_; } } else { // for normal bidder get 2 best items among non-diagonal points from |