employees.c File Reference

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <derive-c/allocs/std.h>
#include <derive-c/structures/arena/template.h>
#include <derive-c/structures/vector/template.h>
#include <derive-c/structures/hashmap/template.h>

Include dependency graph for employees.c:

Go to the source code of this file.

Classes
struct	name
struct	age
struct	employee
struct	hr_system

Macros
#define	INDEX_BITS   16
#define	V   employee
#define	SELF   employees
#define	T   employees_index
#define	SELF   same_age_employees
#define	K   age
#define	V   same_age_employees
#define	EQ   age_eq
#define	HASH   age_hash
#define	SELF   employees_by_age

Functions
bool	name_eq (const name *name_1, const name *name_2)
bool	age_eq (age const *age_1, age const *age_2)
size_t	age_hash (age const *age)
hr_system	hr_system_new ()
void	hr_system_new_employee (hr_system *self, employee emp)
employee const *	hr_system_newest_of_age (hr_system const *self, age age)
void	hr_system_delete (hr_system *self)
int	main ()

Macro Definition Documentation

EQ

#define EQ   age_eq

Definition at line 55 of file employees.c.

HASH

#define HASH   age_hash

Definition at line 56 of file employees.c.

INDEX_BITS

#define INDEX_BITS   16

Definition at line 44 of file employees.c.

K

#define K   age

Definition at line 53 of file employees.c.

SELF [1/3]

#define SELF   employees

Definition at line 46 of file employees.c.

SELF [2/3]

#define SELF   same_age_employees

Definition at line 46 of file employees.c.

SELF [3/3]

#define SELF   employees_by_age

Definition at line 46 of file employees.c.

T

#define T   employees_index

Definition at line 49 of file employees.c.

V [1/2]

#define V   employee

Definition at line 45 of file employees.c.

V [2/2]

#define V   same_age_employees

Definition at line 45 of file employees.c.

Function Documentation

age_eq()

bool age_eq	(	age const *	age_1,
		age const *	age_2 )

Examples

complex/employees.c.

Definition at line 41 of file employees.c.

{ return age_1->value == age_2->value; }

age_hash()

size_t age_hash

(

age const *

age

)

Examples

complex/employees.c.

Definition at line 42 of file employees.c.

{ return age->value; }

hr_system_delete()

void hr_system_delete

(

hr_system *

self

)

Examples

complex/employees.c.

Definition at line 95 of file employees.c.

                                       {
    employees_delete(&self->data);
 
    employees_by_age_iter iter = employees_by_age_get_iter(&self->by_age);
    employees_by_age_kv const* entry = NULL;
    while ((entry = employees_by_age_iter_next(&iter))) {
        same_age_employees_delete(entry->value);
    }
 
    employees_by_age_delete(&self->by_age);
}

Here is the caller graph for this function:

hr_system_new()

hr_system hr_system_new

(

)

Examples

complex/employees.c.

Definition at line 65 of file employees.c.

                          {
    return (hr_system){
        .data = employees_new_with_capacity_for(1000, stdalloc_get()),
        .by_age = employees_by_age_new(stdalloc_get()),
    };
}

Here is the caller graph for this function:

hr_system_new_employee()

void hr_system_new_employee	(	hr_system *	self,
		employee	emp )

Examples

complex/employees.c.

Definition at line 72 of file employees.c.

                                                           {
    printf("Adding employee %s %s\n", emp.name.forename, emp.name.surname);
    employees_index idx = employees_insert(&self->data, emp);
    same_age_employees* idxes = employees_by_age_try_write(&self->by_age, emp.age);
    if (!idxes) {
        idxes =
            employees_by_age_insert(&self->by_age, emp.age, same_age_employees_new(stdalloc_get()));
    }
    same_age_employees_push(idxes, idx);
}

Here is the caller graph for this function:

hr_system_newest_of_age()

employee const * hr_system_newest_of_age	(	hr_system const *	self,
		age	age )

Examples

complex/employees.c.

Definition at line 83 of file employees.c.

                                                                        {
    same_age_employees const* idxes = employees_by_age_try_read(&self->by_age, age);
    if (!idxes) {
        return NULL;
    }
    if (same_age_employees_size(idxes) == 0) {
        return NULL;
    }
    employees_index const* idx = same_age_employees_read(idxes, same_age_employees_size(idxes) - 1);
    return employees_read(&self->data, *idx);
}

Here is the caller graph for this function:

main()

int main

(

)

Definition at line 107 of file employees.c.

           {
    hr_system hr = hr_system_new();
 
    employee frank = {
        .age = (age){.value = 22},
        .email = "veryverylongemail@someprovider.net",
        .name =
            (name){
                .forename = "Frank",
                .surname = "Lee",
            },
    };
    hr_system_new_employee(&hr, frank);
 
    name bob_name = {
        .forename = "Bob",
        .surname = "Mike",
    };
    employee bob = {
        .age = (age){.value = 22},
        .email = "bib@cool.org",
        .name = bob_name,
    };
    hr_system_new_employee(&hr, bob);
 
    employee const* newest_22 = hr_system_newest_of_age(&hr, (age){.value = 22});
    assert(newest_22);
    assert(name_eq(&newest_22->name, &bob_name));
 
    hr_system_delete(&hr);
}

Here is the call graph for this function:

name_eq()

bool name_eq	(	const name *	name_1,
		const name *	name_2 )

Examples

complex/employees.c.

Definition at line 19 of file employees.c.

                                                     {
    if (!name_1 || !name_2)
        return false;
    if (!name_1->forename || !name_2->forename)
        return false;
    if (!name_1->surname || !name_2->surname)
        return false;
 
    return strcmp(name_1->forename, name_2->forename) == 0 &&
           strcmp(name_1->surname, name_2->surname) == 0;
}

Here is the caller graph for this function: