LIST_SIZE 420 src/board.cpp for (i = 0; i < LIST_SIZE(list); i++) { LIST_SIZE 150 src/list.cpp for (i = 0; i < LIST_SIZE(list); i++) { LIST_SIZE 164 src/list.cpp ASSERT(pos>=0&&pos<=LIST_SIZE(list)); LIST_SIZE 167 src/search.cpp if (LIST_SIZE(SearchInput->list) <= 1) { LIST_SIZE 226 src/search.cpp && LIST_SIZE(SearchRoot->list) >= 2 LIST_SIZE 256 src/search_full.cpp for (i = 0; i < LIST_SIZE(list); i++) list->value[i] = ValueNone; LIST_SIZE 263 src/search_full.cpp for (i = 0; i < LIST_SIZE(list); i++) { LIST_SIZE 270 src/search_full.cpp SearchRoot->move_nb = LIST_SIZE(list); LIST_SIZE 274 src/search_full.cpp new_depth = full_new_depth(depth,move,board,board_is_check(board)&&LIST_SIZE(list)==1,true); LIST_SIZE 546 src/search_full.cpp if (in_check && LIST_SIZE(sort->list) == 1) single_reply = true; // HACK LIST_SIZE 219 src/sort.cpp while (sort->pos < LIST_SIZE(sort->list)) { LIST_SIZE 385 src/sort.cpp while (sort->pos < LIST_SIZE(sort->list)) { LIST_SIZE 570 src/sort.cpp size = LIST_SIZE(list); LIST_SIZE 590 src/sort.cpp size = LIST_SIZE(list); LIST_SIZE 610 src/sort.cpp size = LIST_SIZE(list); LIST_SIZE 630 src/sort.cpp size = LIST_SIZE(list); LIST_SIZE 650 src/sort.cpp size = LIST_SIZE(list);