15 bool list_is_ok(const list_t * list) {
\r
17 if (list == NULL) return FALSE;
\r
19 if (list->size >= ListSize) return FALSE;
\r
26 void list_clear(list_t * list) {
\r
35 void list_add(list_t * list, int move){
\r
36 list_add_ex(list, move, 0);
\r
41 void list_add_ex(list_t * list, int move, int value) {
\r
43 ASSERT(list_is_ok(list));
\r
44 ASSERT(move_is_ok(move));
\r
45 ASSERT(value>=-32767&&value<=+32767);
\r
47 ASSERT(list->size<ListSize-1);
\r
49 list->move[list->size] = move;
\r
50 list->value[list->size] = value;
\r
56 void list_remove(list_t * list, int index) {
\r
60 ASSERT(list_is_ok(list));
\r
61 ASSERT(index>=0&&index<list->size);
\r
63 for (i = index; i < list->size-1; i++) {
\r
64 list->move[i] = list->move[i+1];
\r
65 list->value[i] = list->value[i+1];
\r
73 bool list_is_empty(const list_t * list) {
\r
75 ASSERT(list_is_ok(list));
\r
77 return list->size == 0;
\r
82 int list_size(const list_t * list) {
\r
84 ASSERT(list_is_ok(list));
\r
91 int list_move(const list_t * list, int index) {
\r
93 ASSERT(list_is_ok(list));
\r
94 ASSERT(index>=0&&index<list->size);
\r
96 return list->move[index];
\r
101 int list_value(const list_t * list, int index) {
\r
103 ASSERT(list_is_ok(list));
\r
104 ASSERT(index>=0&&index<list->size);
\r
106 return list->value[index];
\r
111 void list_copy(list_t * dst, const list_t * src) {
\r
116 ASSERT(list_is_ok(src));
\r
118 dst->size = src->size;
\r
120 for (i = 0; i < src->size; i++) {
\r
121 dst->move[i] = src->move[i];
\r
122 dst->value[i] = src->value[i];
\r
126 // list_move_to_front()
\r
128 void list_move_to_front(list_t * list, int index) {
\r
133 ASSERT(list_is_ok(list));
\r
134 ASSERT(index>=0&&index<list->size);
\r
138 move = list->move[index];
\r
139 value = list->value[index];
\r
141 for (i = index; i > 0; i--) {
\r
142 list->move[i] = list->move[i-1];
\r
143 list->value[i] = list->value[i-1];
\r
146 list->move[0] = move;
\r
147 list->value[0] = value;
\r
153 void list_note(list_t * list) {
\r
157 ASSERT(list_is_ok(list));
\r
159 for (i = 0; i < list->size; i++) {
\r
160 move = list->move[i];
\r
161 ASSERT(move_is_ok(move));
\r
162 list->value[i] = -move_order(move);
\r
168 void list_sort(list_t * list) {
\r
171 int best_index, best_move, best_value;
\r
173 ASSERT(list_is_ok(list));
\r
175 for (i = 0; i < list->size-1; i++) {
\r
178 best_value = list->value[i];
\r
180 for (j = i+1; j < list->size; j++) {
\r
181 if (list->value[j] > best_value) {
\r
183 best_value = list->value[j];
\r
187 if (best_index != i) {
\r
189 best_move = list->move[best_index];
\r
190 ASSERT(best_value==list->value[best_index]);
\r
192 for (j = best_index; j > i; j--) {
\r
193 list->move[j] = list->move[j-1];
\r
194 list->value[j] = list->value[j-1];
\r
197 list->move[i] = best_move;
\r
198 list->value[i] = best_value;
\r
203 for (i = 0; i < list->size-1; i++) {
\r
204 ASSERT(list->value[i]>=list->value[i+1]);
\r
211 bool list_contain(const list_t * list, int move) {
\r
215 ASSERT(list_is_ok(list));
\r
216 ASSERT(move_is_ok(move));
\r
218 for (i = 0; i < list->size; i++) {
\r
219 if (list->move[i] == move) return TRUE;
\r
227 bool list_equal(list_t * list_1, list_t * list_2) {
\r
229 list_t copy_1[1], copy_2[1];
\r
232 ASSERT(list_is_ok(list_1));
\r
233 ASSERT(list_is_ok(list_2));
\r
235 if (list_1->size != list_2->size) return FALSE;
\r
237 list_copy(copy_1,list_1);
\r
241 list_copy(copy_2,list_2);
\r
245 for (i = 0; i < copy_1->size; i++) {
\r
246 if (copy_1->move[i] != copy_2->move[i]) return FALSE;
\r
254 void list_disp(const list_t * list, const board_t * board) {
\r
256 int i, move, value;
\r
259 ASSERT(list_is_ok(list));
\r
260 ASSERT(board_is_ok(board));
\r
262 for (i = 0; i < list->size; i++) {
\r
264 move = list->move[i];
\r
265 value = list->value[i];
\r
267 if (!move_to_can(move,board,string,256)) ASSERT(FALSE);
\r
268 my_log("POLYGLOT %-5s %04X %+4d\n",string,move,value);
\r
271 my_log("POLYGLOT\n");
\r