vote.h File Reference

header of vote.c More...

#include "lib/sign.h"
#include "lib/dataio.h"
#include "lib/types.h"
#include <stddef.h>

Include dependency graph for vote.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	hashcell
struct	hashtable

Typedefs
typedef struct hashcell	HashCell
typedef struct hashtable	HashTable

Functions
HashCell *	create_hashcell_raw (Key *key)
	Create a hashcell raw object. Takes ownership of key. More...
HashCell *	create_hashcell (const Key *key)
	Create a hashcell object. Copies key. More...
void	free_hashcell (HashCell *hc)
	Free a HasCell object. More...
uint32	hash_function (const Key *key, int size)
	Hash function for Key arrays (HashTable). More...
uint32	find_position (const HashTable *t, const Key *k)
	Find the position to place k at in the HasTable t. If the position in the array is taken, find a new one using linear probing. If no position was found, returns the originally found position of hash_function(). More...
HashTable *	create_hashtable (const CellKey *keys, size_t size)
	Create a HashTable object containing keys elements. Keys position are found with find_position().. More...
void	free_hashtable (HashTable *t)
	Free a HashTable object and all the elements of the table. (Correspond to delete_hashtable in the project subject). More...
Key *	compute_winner (const CellProtected *decl, const CellKey *cadidates, const CellKey *voters, int sizeC, int sizeV)
	Simulates an election process and returns the winner. Checks if declarations are valid and update vote numbers for each candidate. More...

Detailed Description

header of vote.c

Typedef Documentation

HashCell

typedef struct hashcell HashCell

Structure for storing a single Key.

HashTable

typedef struct hashtable HashTable

Structure to store Key objects as an array.

Function Documentation

compute_winner()

Key * compute_winner	(	const CellProtected *	decl,
		const CellKey *	candidates,
		const CellKey *	voters,
		int	sizeC,
		int	sizeV
	)

Simulates an election process and returns the winner. Checks if declarations are valid and update vote numbers for each candidate.

Parameters

decl	list of declaration
cadidates	list of candidates
voters	list of voters
sizeC	size of candidates hashtable
sizeV	size of voters hashtable

Returns

Key* copy of the key of the winning candidate

create_hashcell()

HashCell * create_hashcell

(

const Key *

key

)

Create a hashcell object. Copies key.

Parameters

key

Returns

HashCell*

create_hashcell_raw()

HashCell * create_hashcell_raw

(

Key *

key

)

Create a hashcell raw object. Takes ownership of key.

Parameters

key

Returns

HashCell*

create_hashtable()

HashTable * create_hashtable	(	const CellKey *	keys,
		size_t	size
	)

Create a HashTable object containing keys elements. Keys position are found with find_position()..

Parameters

keys	keys to store
size	size of the table

Returns

HashTable*

find_position()

uint32 find_position	(	const HashTable *	t,
		const Key *	k
	)

Find the position to place k at in the HasTable t. If the position in the array is taken, find a new one using linear probing. If no position was found, returns the originally found position of hash_function().

Parameters

t	Table to store in
k	Key to store

Returns

uint32 : found position.

free_hashcell()

void free_hashcell

(

HashCell *

hc

)

Free a HasCell object.

Parameters

hc	Object to free.

free_hashtable()

void free_hashtable

(

HashTable *

t

)

Free a HashTable object and all the elements of the table. (Correspond to delete_hashtable in the project subject).

Parameters

t	object to free

hash_function()

uint32 hash_function	(	const Key *	key,
		int	size
	)

Hash function for Key arrays (HashTable).

Parameters

key
size	length of the array

Returns

uint32 : position in the array