GNUnet  0.20.0
Data Fields
MapEntry Union Reference

Entry in the map. More...

Collaboration diagram for MapEntry:
[legend]

Data Fields

struct SmallMapEntry * sme
 Variant used if map entries only contain a pointer to the key. More...
 
struct BigMapEntry * bme
 Variant used if map entries contain the full key. More...
 
uint32_t key
 Key for the entry. More...
 
void * value
 Value of the entry. More...
 
struct MapEntry * next
 If there is a hash collision, we create a linked list. More...
 

Detailed Description

Entry in the map.

An entry in the hash map.

Definition at line 90 of file container_multihashmap.c.

Field Documentation

◆ sme

struct SmallMapEntry * MapEntry::sme

Variant used if map entries only contain a pointer to the key.

Definition at line 95 of file container_multihashmap.c.

Referenced by GNUNET_CONTAINER_multihashmap_get_multiple(), GNUNET_CONTAINER_multihashmap_remove(), GNUNET_CONTAINER_multihashmap_remove_all(), GNUNET_CONTAINER_multipeermap_contains(), GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_CONTAINER_multishortmap_contains(), GNUNET_CONTAINER_multishortmap_contains_value(), GNUNET_CONTAINER_multishortmap_get(), GNUNET_CONTAINER_multishortmap_get_multiple(), GNUNET_CONTAINER_multishortmap_get_random(), GNUNET_CONTAINER_multishortmap_iterate(), GNUNET_CONTAINER_multishortmap_put(), GNUNET_CONTAINER_multishortmap_remove(), GNUNET_CONTAINER_multishortmap_remove_all(), GNUNET_CONTAINER_multiuuidmap_contains(), GNUNET_CONTAINER_multiuuidmap_get(), GNUNET_CONTAINER_multiuuidmap_get_multiple(), GNUNET_CONTAINER_multiuuidmap_get_random(), GNUNET_CONTAINER_multiuuidmap_put(), GNUNET_CONTAINER_multiuuidmap_remove(), grow(), and update_next_cache_sme().

◆ bme

struct BigMapEntry * MapEntry::bme

Variant used if map entries contain the full key.

Definition at line 100 of file container_multihashmap.c.

Referenced by GNUNET_CONTAINER_multihashmap_get_multiple(), GNUNET_CONTAINER_multihashmap_remove_all(), GNUNET_CONTAINER_multipeermap_contains(), GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CONTAINER_multishortmap_contains(), GNUNET_CONTAINER_multishortmap_contains_value(), GNUNET_CONTAINER_multishortmap_get(), GNUNET_CONTAINER_multishortmap_get_multiple(), GNUNET_CONTAINER_multishortmap_get_random(), GNUNET_CONTAINER_multishortmap_iterate(), GNUNET_CONTAINER_multishortmap_put(), GNUNET_CONTAINER_multishortmap_remove(), GNUNET_CONTAINER_multishortmap_remove_all(), GNUNET_CONTAINER_multiuuidmap_contains(), GNUNET_CONTAINER_multiuuidmap_get(), GNUNET_CONTAINER_multiuuidmap_get_multiple(), GNUNET_CONTAINER_multiuuidmap_get_random(), GNUNET_CONTAINER_multiuuidmap_put(), grow(), and update_next_cache_bme().

◆ key

uint32_t MapEntry::key

Key for the entry.

Definition at line 53 of file container_multihashmap32.c.

Referenced by gnunet-chk.Chk::__init__(), gnunet-chk.AESKey::__init__(), and gnunet-chk.Chk::uri().

◆ value

void* MapEntry::value

Value of the entry.

Definition at line 58 of file container_multihashmap32.c.

Referenced by gnunet_testing.StatisticsCondition::check(), and gnunet_testing.StatisticsCondition::evaluate().

◆ next

struct MapEntry* MapEntry::next

If there is a hash collision, we create a linked list.

Definition at line 63 of file container_multihashmap32.c.

The documentation for this union was generated from the following files: