#include <time.h>
#include <stdio.h>
#include <stdlib.h>
+#include <string.h>
#include <math.h>
#include "coords.h"
#include "vikcoord.h"
#include "viktrack.h"
#include "globals.h"
+#include "dems.h"
VikTrack *vik_track_new()
{
GList *iter = tr->trackpoints;
+ if (!iter->next) /* one-point track */
+ return NULL;
+
{ /* test if there's anything worth calculating */
gboolean okay = FALSE;
while ( iter )
return NULL;
}
-
+ iter = tr->trackpoints;
g_assert ( num_chunks < 16000 );
{
double *h, *alpha, *B, *m;
int i;
+ int orig_n = n;
+ double new_x[3], new_f[3];
+
+ if (n==0) return;
+ if (n==1) {
+ new_x[0] = x[0];
+ new_f[0] = f[0];
+ new_x[1] = x[0]+0.00001;
+ new_f[1] = f[0];
+ x = new_x;
+ f = new_f;
+ n = 3;
+ }
+ if (n==2) {
+ new_x[0] = x[0];
+ new_f[0] = f[0];
+ new_x[1] = x[1];
+ new_f[1] = f[1];
+ new_x[2] = x[1] + x[1]-x[0];
+ new_f[2] = f[1] + f[1]-f[0];
+ x = new_x;
+ f = new_f;
+ n = 3;
+ }
/* we're solving a linear system of equations of the form Ax = B.
* The matrix a is tridiagonal and consists of coefficients in
m[i] = (B[i]-h[i+1]*m[i+1])/alpha[i];
}
- for (i=0; i<n-1; i++) {
+ for (i=0; i<orig_n-1; i++) {
double mi, mi1;
mi = (i==(n-2)) ? 0 : m[i];
mi1 = (i==0) ? 0 : m[i-1];
g_assert ( num_chunks < 16000 );
+#ifdef XXXXXXXXXXXXXXXXXX
+ iter = tr->trackpoints;
+ while (iter) {
+
+ }
+#endif /*XXXXXXXXXXXXXXXXXX*/
+
t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
duration = t2 - t1;
return NULL;
if (duration < 0) {
- fprintf(stderr, "negative duration: unsorted trackpoint timestamps?\n");
+ g_warning("negative duration: unsorted trackpoint timestamps?\n");
return NULL;
}
pt_count = vik_track_get_tp_count(tr);
compute_spline(numpts, t, s, p);
- /*
- printf("Got spline\n");
- for (i=0; i<numpts-1; i++) {
- printf("a = %15f b = %15f c = %15f d = %15f\n", p[i].a, p[i].b, p[i].c, p[i].d);
- }
- */
-
/* the spline gives us distances at chunk_dur intervals. from these,
* we obtain average speed in each interval.
*/
}
/* by Alex Foobarian */
-VikCoord *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist )
+VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist )
{
gdouble dist = vik_track_get_length_including_gaps(tr) * reldist;
gdouble current_dist = 0.0;
gdouble current_inc = 0.0;
- VikCoord *rv;
if ( tr->trackpoints )
{
GList *iter = tr->trackpoints->next;
+ GList *last_iter = NULL;
while (iter)
{
current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
current_dist += current_inc;
if ( current_dist >= dist )
break;
+ last_iter = iter;
iter = iter->next;
}
+ if (!iter) /* passing the end the track */
+ return (last_iter ? last_iter->data : NULL);
/* we've gone past the dist already, was prev trackpoint closer? */
/* should do a vik_coord_average_weighted() thingy. */
if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) )
iter = iter->prev;
+ return VIK_TRACKPOINT(iter->data);
+
+ }
+ return NULL;
+}
+
+gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt )
+{
+ *min_alt = 25000;
+ *max_alt = -5000;
+ if ( tr && tr->trackpoints && tr->trackpoints->data && (VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE) ) {
+ GList *iter = tr->trackpoints->next;
+ gdouble tmp_alt;
+ while (iter)
+ {
+ tmp_alt = VIK_TRACKPOINT(iter->data)->altitude;
+ if ( tmp_alt > *max_alt )
+ *max_alt = tmp_alt;
+ if ( tmp_alt < *min_alt )
+ *min_alt = tmp_alt;
+ iter = iter->next;
+ }
+ return TRUE;
+ }
+ return FALSE;
+}
+
+void vik_track_marshall ( VikTrack *tr, guint8 **data, guint *datalen)
+{
+ GList *tps;
+ GByteArray *b = g_byte_array_new();
+ guint len;
+ guint intp, ntp;
+
+ g_byte_array_append(b, (guint8 *)tr, sizeof(*tr));
+
+ /* we'll fill out number of trackpoints later */
+ intp = b->len;
+ g_byte_array_append(b, (guint8 *)&len, sizeof(len));
+
+ tps = tr->trackpoints;
+ ntp = 0;
+ while (tps) {
+ g_byte_array_append(b, (guint8 *)tps->data, sizeof(VikTrackpoint));
+ tps = tps->next;
+ ntp++;
+ }
+ *(guint *)(b->data + intp) = ntp;
+
+ len = (tr->comment) ? strlen(tr->comment)+1 : 0;
+ g_byte_array_append(b, (guint8 *)&len, sizeof(len));
+ if (tr->comment) g_byte_array_append(b, (guint8 *)tr->comment, len);
+ *data = b->data;
+ *datalen = b->len;
+ g_byte_array_free(b, FALSE);
+}
+
+VikTrack *vik_track_unmarshall (guint8 *data, guint datalen)
+{
+ guint len;
+ VikTrack *new_tr = vik_track_new();
+ VikTrackpoint *new_tp;
+ guint ntp;
+ gint i;
- rv = g_malloc(sizeof(VikCoord));
- *rv = VIK_TRACKPOINT(iter->data)->coord;
+ /* only the visibility is needed */
+ new_tr->visible = ((VikTrack *)data)->visible;
+ data += sizeof(*new_tr);
- return rv;
+ ntp = *(guint *)data;
+ data += sizeof(ntp);
+ for (i=0; i<ntp; i++) {
+ new_tp = vik_trackpoint_new();
+ memcpy(new_tp, data, sizeof(*new_tp));
+ data += sizeof(*new_tp);
+ new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp);
}
- return NULL;
+
+ len = *(guint *)data;
+ data += sizeof(len);
+ if (len) {
+ new_tr->comment = g_strdup((gchar *)data);
+ }
+ return new_tr;
+}
+
+void vik_track_apply_dem_data ( VikTrack *tr )
+{
+ GList *tp_iter;
+ gint16 elev;
+ tp_iter = tr->trackpoints;
+ while ( tp_iter ) {
+ /* TODO: of the 4 possible choices we have for choosing an elevation
+ * (trackpoint in between samples), choose the one with the least elevation change
+ * as the last */
+ elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord) );
+ if ( elev != VIK_DEM_INVALID_ELEVATION )
+ VIK_TRACKPOINT(tp_iter->data)->altitude = elev;
+ tp_iter = tp_iter->next;
+ }
+}
+
+/* appends t2 to t1, leaving t2 with no trackpoints */
+void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 )
+{
+ if ( t1->trackpoints ) {
+ GList *tpiter = t1->trackpoints;
+ while ( tpiter->next )
+ tpiter = tpiter->next;
+ tpiter->next = t2->trackpoints;
+ t2->trackpoints->prev = tpiter;
+ } else
+ t1->trackpoints = t2->trackpoints;
+ t2->trackpoints = NULL;
}
projects / andy / viking.git / blobdiff