blob: 6230a1f598f8fba0ff385d13a2ef815e20ba288d (
plain)
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
|
#include <stdlib.h>
#include <assert.h>
#include "table_stacks.h"
#include "card_stack.h"
#include "card.h"
#include "game.h"
/**
* Search index of table stack in which specified card is in
* @param[in] stack_list Pointer to list of stacks to search
* @param[in] c Card to search
* @return Index of table stack with specified card; invalid index (NUM_TABLE_STACKS) if none found
*/
const uint8_t get_stack_idx_for_card(const table_stacks_t* stack_list, const card c)
{
assert(stack_list != NULL);
uint8_t idx = NUM_TABLE_STACKS;
int16_t old_diff = MAX_CARD;
for(int i=0; i<NUM_TABLE_STACKS; i++)
{
card stackcard = card_stack_top(&stack_list->stacks[i]);
int16_t new_diff = c - stackcard;
assert(new_diff != 0);
if(new_diff < 0) // open card smaller than card on current stack
continue;
if(new_diff < old_diff)
{
old_diff = new_diff;
idx = i;
}
}
return idx;
}
|