decomposed.c File Reference

#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <derive-c/algorithm/hash/hashers.h>
#include <derive-c/alloc/std.h>
#include <derive-c/core/prelude.h>
#include <derive-c/derive/std.h>
#include <derive-c/container/map/decomposed/template.h>

Include dependency graph for decomposed.c:

Go to the source code of this file.

Classes
struct	report_id
struct	report
struct	fixed_string

Macros
#define	KEY   uint32_t
#define	KEY_EQ   uint32_t_eq
#define	KEY_HASH   hash_id_uint32_t
#define	VALUE   char const*
#define	NAME   id_to_name
#define	KEY   struct report_id
#define	KEY_EQ   report_id_equality
#define	KEY_HASH   report_id_hash
#define	KEY_DELETE   report_id_delete
#define	VALUE   struct report
#define	VALUE_DELETE   report_delete
#define	NAME   report_map
#define	KEY   struct fixed_string
#define	KEY_EQ   fixed_string_eq
#define	KEY_HASH   fixed_string_hash
#define	VALUE   uint32_t
#define	NAME   fixed_string_map

Functions
void	print_map (id_to_name const *map)
void	id_to_name_example ()
bool	report_id_equality (struct report_id const *report_1, struct report_id const *report_2)
size_t	report_id_hash (struct report_id const *report_id)
void	report_id_delete (struct report_id *self)
void	report_delete (struct report *self)
void	report_map_example ()
bool	fixed_string_eq (struct fixed_string const *str1, struct fixed_string const *str2)
size_t	fixed_string_hash (struct fixed_string const *str)
void	fixed_string_example ()
int	main ()

Macro Definition Documentation

KEY [1/3]

#define KEY   uint32_t

Definition at line 17 of file decomposed.c.

KEY [2/3]

#define KEY   struct report_id

Definition at line 17 of file decomposed.c.

KEY [3/3]

#define KEY   struct fixed_string

Definition at line 17 of file decomposed.c.

KEY_DELETE

#define KEY_DELETE   report_id_delete

Definition at line 82 of file decomposed.c.

KEY_EQ [1/3]

#define KEY_EQ   uint32_t_eq

Definition at line 18 of file decomposed.c.

KEY_EQ [2/3]

#define KEY_EQ   report_id_equality

Definition at line 18 of file decomposed.c.

KEY_EQ [3/3]

#define KEY_EQ   fixed_string_eq

Definition at line 18 of file decomposed.c.

KEY_HASH [1/3]

#define KEY_HASH   hash_id_uint32_t

Definition at line 19 of file decomposed.c.

KEY_HASH [2/3]

#define KEY_HASH   report_id_hash

Definition at line 19 of file decomposed.c.

KEY_HASH [3/3]

#define KEY_HASH   fixed_string_hash

Definition at line 19 of file decomposed.c.

NAME [1/3]

#define NAME   id_to_name

Definition at line 21 of file decomposed.c.

NAME [2/3]

#define NAME   report_map

Definition at line 21 of file decomposed.c.

NAME [3/3]

#define NAME   fixed_string_map

Definition at line 21 of file decomposed.c.

VALUE [1/3]

#define VALUE   char const*

Definition at line 20 of file decomposed.c.

VALUE [2/3]

#define VALUE   struct report

Definition at line 20 of file decomposed.c.

VALUE [3/3]

#define VALUE   uint32_t

Definition at line 20 of file decomposed.c.

VALUE_DELETE

#define VALUE_DELETE   report_delete

Definition at line 84 of file decomposed.c.

Function Documentation

fixed_string_eq()

bool fixed_string_eq	(	struct fixed_string const *	str1,
		struct fixed_string const *	str2 )

Examples

container/map/decomposed.c.

Definition at line 123 of file decomposed.c.

                                                                                       {
    return memcmp(str1->value, str2->value, sizeof(str1->value)) == 0;
}

fixed_string_example()

void fixed_string_example

(

)

Examples

container/map/decomposed.c.

Definition at line 138 of file decomposed.c.

                            {
    printf("Fixed Strings Example:\n");
    fixed_string_map map = fixed_string_map_new(stdalloc_get());
 
    struct fixed_string key1 = {.value = "abc"};
    struct fixed_string key2 = {.value = "def"};
    struct fixed_string key3 = {.value = "ghi"};
 
    fixed_string_map_insert(&map, key1, 123);
    fixed_string_map_insert(&map, key2, 456);
    fixed_string_map_insert(&map, key3, 789);
 
    ASSERT(*fixed_string_map_read(&map, key1) == 123);
    ASSERT(*fixed_string_map_read(&map, key2) == 456);
    ASSERT(*fixed_string_map_read(&map, key3) == 789);
 
    fixed_string_map_iter_const iter = fixed_string_map_get_iter_const(&map);
 
    fixed_string_map_kv_const const* entry = NULL;
    size_t pos = 0;
    while ((entry = fixed_string_map_iter_const_next(&iter))) {
        printf("Position: %zu Key: %.3s Value: %u\n", pos, entry->key->value, *entry->value);
        pos++;
    }
 
    fixed_string_map_delete(&map);
}

Here is the caller graph for this function:

fixed_string_hash()

size_t fixed_string_hash

(

struct fixed_string const *

str

)

Examples

container/map/decomposed.c.

Definition at line 127 of file decomposed.c.

                                                         {
    return hash_murmurhash_string_4(str->value);
}

id_to_name_example()

void id_to_name_example

(

)

Examples

container/map/decomposed.c.

Definition at line 36 of file decomposed.c.

                          {
    printf("Id to Name Map Example:\n");
    id_to_name map = id_to_name_new(stdalloc_get());
 
    id_to_name_insert(&map, 23, "hello");
    id_to_name_insert(&map, 10, "bob");
    id_to_name_insert(&map, 42, "meaning");
    ASSERT(strcmp(*id_to_name_read(&map, 42), "meaning") == 0);
 
    print_map(&map);
 
    char const** entry = id_to_name_write(&map, 23);
    ASSERT(entry);
    *entry = "a different string!";
 
    print_map(&map);
 
    id_to_name_delete(&map);
}

Here is the call graph for this function:

Here is the caller graph for this function:

main()

int main

(

)

Definition at line 166 of file decomposed.c.

           {
    id_to_name_example();
    report_map_example();
    fixed_string_example();
}

Here is the call graph for this function:

print_map()

void print_map

(

id_to_name const *

map

)

Examples

container/map/decomposed.c.

Definition at line 24 of file decomposed.c.

                                      {
    printf("Map has items:\n");
    id_to_name_iter_const iter = id_to_name_get_iter_const(map);
 
    id_to_name_kv_const const* entry = NULL;
    size_t pos = 0;
    while ((entry = id_to_name_iter_const_next(&iter))) {
        printf("position: %zu key: %" PRIu32 " string: %s\n", pos, *entry->key, *entry->value);
        pos++;
    }
}

Here is the caller graph for this function:

report_delete()

void report_delete

(

struct report *

self

)

Examples

container/map/decomposed.c.

Definition at line 77 of file decomposed.c.

{ free(self->description); }

Here is the call graph for this function:

Here is the caller graph for this function:

report_id_delete()

void report_id_delete

(

struct report_id *

self

)

Examples

container/map/decomposed.c.

Definition at line 70 of file decomposed.c.

{ free(self->name); }

Here is the call graph for this function:

report_id_equality()

bool report_id_equality	(	struct report_id const *	report_1,
		struct report_id const *	report_2 )

Examples

container/map/decomposed.c.

Definition at line 61 of file decomposed.c.

                                                                                            {
    return strcmp(report_1->name, report_2->name) == 0 && report_1->section == report_2->section;
}

report_id_hash()

size_t report_id_hash

(

struct report_id const *

report_id

)

Examples

container/map/decomposed.c.

Definition at line 65 of file decomposed.c.

                                                         {
    return hash_combine(hash_murmurhash_string(report_id->name),
                        hash_id_uint32_t(&report_id->section));
}

Here is the call graph for this function:

report_map_example()

void report_map_example

(

)

Examples

container/map/decomposed.c.

Definition at line 88 of file decomposed.c.

                          {
    printf("Report Map Example:\n");
    report_map map = report_map_new(stdalloc_get());
 
    struct report_id id1 = {.name = strdup("Report A"), .section = 1};
    struct report_id id2 = {.name = strdup("Report B"), .section = 2};
 
    report_map_insert(&map, id1,
                      (struct report){.description = strdup("Description A"), .value = 100});
    report_map_insert(&map, id2,
                      (struct report){.description = strdup("Description B"), .value = 200});
 
    ASSERT(strcmp(report_map_read(&map, id1)->description, "Description A") == 0);
 
    {
        report_map_iter_const iter = report_map_get_iter_const(&map);
        report_map_kv_const const* entry = NULL;
        size_t pos = 0;
        while ((entry = report_map_iter_const_next(&iter))) {
            printf("Position: %zu Key: %s Section: %u Value: %d\n", pos, entry->key->name,
                   entry->key->section, entry->value->value);
            pos++;
        }
    }
 
    struct report entry = report_map_remove(&map, id1);
    report_delete(&entry);
 
    report_map_delete(&map);
}

Here is the call graph for this function:

Here is the caller graph for this function: