-
Notifications
You must be signed in to change notification settings - Fork 2
/
optimizer.h
48 lines (37 loc) · 1.39 KB
/
optimizer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
Brickoptimizer - optimize the price of Bricklinks Wanted List
Copyright (C) 2013 Gustavo Miranda Teixeira ([email protected])
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version provided this disclaimer remains
unchanged.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __INCLUDE_OPTIMIZER_H__
#define __INCLUDE_OPTIMIZER_H__
#include "mask.h"
//maximum number of stores that we will look for the combination
#define MAX_STORES 4
typedef struct store_t
{
long id;
float* items;
long* store_item_id;
mask_t items_mask;
int store_num;
int num_items;
struct store_t* next;
} store_t;
int store_init(int num_items);
int store_add(long id);
int store_end();
int store_add_item(long store_id, int item_index, long store_item_id, float item_price);
int store_num();
int store_best_match (int fixed_index, mask_t match, store_t* cur_store);
#endif