summaryrefslogtreecommitdiffstats
path: root/core/dive.h
diff options
context:
space:
mode:
authorGravatar Berthold Stoeger <bstoeger@mail.tuwien.ac.at>2018-11-09 16:28:54 +0100
committerGravatar Dirk Hohndel <dirk@hohndel.org>2018-11-18 16:50:09 -0800
commit9d3a5fa99769d4381f622b97f7776f747a7e562e (patch)
treeb2c002a6d57b33b1e9361f33ad6ec8c5fca01e04 /core/dive.h
parent6b283e598a3a08c6133d66b5d5617370296e7d0e (diff)
downloadsubsurface-9d3a5fa99769d4381f622b97f7776f747a7e562e.tar.gz
Dive list: implement trip_less_than function
As a step towards proper sorting, introduce a trip_less_than() function in core. It simply sorts by the first dive, which should be unique as dives may belong to only one trip. Signed-off-by: Berthold Stoeger <bstoeger@mail.tuwien.ac.at>
Diffstat (limited to 'core/dive.h')
-rw-r--r--core/dive.h1
1 files changed, 1 insertions, 0 deletions
diff --git a/core/dive.h b/core/dive.h
index 790d39d7f..7356f91a1 100644
--- a/core/dive.h
+++ b/core/dive.h
@@ -556,6 +556,7 @@ extern void add_sample_pressure(struct sample *sample, int sensor, int mbar);
extern int legacy_format_o2pressures(const struct dive *dive, const struct divecomputer *dc);
extern bool dive_less_than(const struct dive *a, const struct dive *b);
+extern bool trip_less_than(const struct dive_trip *a, const struct dive_trip *b);
extern void sort_table(struct dive_table *table);
extern struct dive *fixup_dive(struct dive *dive);
extern void fixup_dc_duration(struct divecomputer *dc);