mirror of
https://github.com/subsurface/subsurface.git
synced 2024-11-28 05:00:20 +00:00
9c253ee6c5
The parser API was very annoying, as a number of tables to-be-filled were passed in as pointers. The goal of this commit is to collect all these tables in a single struct. This should make it (more or less) clear what is actually written into the divelog files. Moreover, it should now be rather easy to search for instances, where the global logfile is accessed (and it turns out that there are many!). The divelog struct does not contain the tables as substructs, but only collects pointers. The idea is that the "divelog.h" file can be included without all the other files describing the numerous tables. To make it easier to use from C++ parts of the code, the struct implements a constructor and a destructor. Sadly, we can't use smart pointers, since the pointers are accessed from C code. Therfore the constructor and destructor are quite complex. The whole commit is large, but was mostly an automatic conversion. One oddity of note: the divelog structure also contains the "autogroup" flag, since that is saved in the divelog. This actually fixes a bug: Before, when importing dives from a different log, the autogroup flag was overwritten. This was probably not intended and does not happen anymore. Signed-off-by: Berthold Stoeger <bstoeger@mail.tuwien.ac.at>
89 lines
3.5 KiB
C
89 lines
3.5 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
#ifndef DIVESITE_H
|
|
#define DIVESITE_H
|
|
|
|
#include "units.h"
|
|
#include "taxonomy.h"
|
|
#include "divelist.h"
|
|
#include <stdlib.h>
|
|
|
|
#ifdef __cplusplus
|
|
#include <QString>
|
|
#include <QObject>
|
|
extern "C" {
|
|
#else
|
|
#include <stdbool.h>
|
|
#endif
|
|
|
|
struct dive_site
|
|
{
|
|
uint32_t uuid;
|
|
char *name;
|
|
struct dive_table dives;
|
|
location_t location;
|
|
char *description;
|
|
char *notes;
|
|
struct taxonomy_data taxonomy;
|
|
};
|
|
|
|
typedef struct dive_site_table {
|
|
int nr, allocated;
|
|
struct dive_site **dive_sites;
|
|
} dive_site_table_t;
|
|
|
|
static const dive_site_table_t empty_dive_site_table = { 0, 0, (struct dive_site **)0 };
|
|
|
|
static inline struct dive_site *get_dive_site(int nr, struct dive_site_table *ds_table)
|
|
{
|
|
if (nr >= ds_table->nr || nr < 0)
|
|
return NULL;
|
|
return ds_table->dive_sites[nr];
|
|
}
|
|
|
|
/* iterate over each dive site */
|
|
#define for_each_dive_site(_i, _x, _ds_table) \
|
|
for ((_i) = 0; ((_x) = get_dive_site(_i, _ds_table)) != NULL; (_i)++)
|
|
|
|
int get_divesite_idx(const struct dive_site *ds, struct dive_site_table *ds_table);
|
|
struct dive_site *get_dive_site_by_uuid(uint32_t uuid, struct dive_site_table *ds_table);
|
|
void sort_dive_site_table(struct dive_site_table *ds_table);
|
|
int add_dive_site_to_table(struct dive_site *ds, struct dive_site_table *ds_table);
|
|
struct dive_site *alloc_or_get_dive_site(uint32_t uuid, struct dive_site_table *ds_table);
|
|
struct dive_site *alloc_dive_site();
|
|
struct dive_site *alloc_dive_site_with_name(const char *name);
|
|
struct dive_site *alloc_dive_site_with_gps(const char *name, const location_t *loc);
|
|
int nr_of_dives_at_dive_site(struct dive_site *ds);
|
|
bool is_dive_site_selected(struct dive_site *ds);
|
|
void free_dive_site(struct dive_site *ds);
|
|
int unregister_dive_site(struct dive_site *ds);
|
|
int register_dive_site(struct dive_site *ds);
|
|
void delete_dive_site(struct dive_site *ds, struct dive_site_table *ds_table);
|
|
struct dive_site *create_dive_site(const char *name, struct dive_site_table *ds_table);
|
|
struct dive_site *create_dive_site_with_gps(const char *name, const location_t *, struct dive_site_table *ds_table);
|
|
struct dive_site *get_dive_site_by_name(const char *name, struct dive_site_table *ds_table);
|
|
struct dive_site *get_dive_site_by_gps(const location_t *, struct dive_site_table *ds_table);
|
|
struct dive_site *get_dive_site_by_gps_and_name(char *name, const location_t *, struct dive_site_table *ds_table);
|
|
struct dive_site *get_dive_site_by_gps_proximity(const location_t *, int distance, struct dive_site_table *ds_table);
|
|
struct dive_site *get_same_dive_site(const struct dive_site *);
|
|
bool dive_site_is_empty(struct dive_site *ds);
|
|
void copy_dive_site_taxonomy(struct dive_site *orig, struct dive_site *copy);
|
|
void copy_dive_site(struct dive_site *orig, struct dive_site *copy);
|
|
void merge_dive_site(struct dive_site *a, struct dive_site *b);
|
|
unsigned int get_distance(const location_t *loc1, const location_t *loc2);
|
|
struct dive_site *find_or_create_dive_site_with_name(const char *name, struct dive_site_table *ds_table);
|
|
void purge_empty_dive_sites(struct dive_site_table *ds_table);
|
|
void clear_dive_site_table(struct dive_site_table *ds_table);
|
|
void move_dive_site_table(struct dive_site_table *src, struct dive_site_table *dst);
|
|
void add_dive_to_dive_site(struct dive *d, struct dive_site *ds);
|
|
struct dive_site *unregister_dive_from_dive_site(struct dive *d);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
QString constructLocationTags(struct taxonomy_data *taxonomy, bool for_maintab);
|
|
|
|
/* Make pointer-to-dive_site a "Qt metatype" so that we can pass it through QVariants */
|
|
Q_DECLARE_METATYPE(dive_site *);
|
|
|
|
#endif
|
|
|
|
#endif // DIVESITE_H
|