/*
- * mlt_geometry.h -- provides the geometry API
+ * mlt_geometry.c -- provides the geometry API
* Copyright (C) 2004-2005 Ushodaya Enterprises Limited
* Author: Charles Yates <charles.yates@pandora.be>
*
geometry_item prev = current->prev;
geometry_item next = current->next;
- float prev_value = 0;
- float next_value = 0;
- float value = 0;
+ double prev_value = 0;
+ double next_value = 0;
+ double value = 0;
while( prev != NULL && !prev->data.f[ i ] ) prev = prev->prev;
while( next != NULL && !next->data.f[ i ] ) next = next->next;
self->item->data.f[4] = 1;
}
}
+ else if ( item->next != NULL && item->prev != NULL )
+ {
+ item->prev->next = item->next;
+ item->next->prev = item->prev;
+ }
else if ( item->next != NULL )
{
item->next->prev = item->prev;
else if ( item->prev != NULL )
{
item->prev->next = item->next;
- item->next->prev = item->prev;
}
free( item );
// Get the local/private structure
geometry self = this->local;
- // return the length
+ // set the length
self->length = length;
}
else
{
memset( item, 0, sizeof( struct mlt_geometry_item_s ) );
+ item->frame = position;
item->mix = 100;
}
// Get the first item
geometry_item place = self->item;
- while( place != NULL && position < place->data.frame )
+ while( place != NULL && position != place->data.frame )
place = place->next;
if ( place != NULL && position == place->data.frame )
}
// Get the key at the position or the next following
-int mlt_geometry_key( mlt_geometry this, mlt_geometry_item item, int position )
+int mlt_geometry_next_key( mlt_geometry this, mlt_geometry_item item, int position )
{
// Get the local/private geometry structure
geometry self = this->local;
return place == NULL;
}
+// Get the key at the position or the previous key
+int mlt_geometry_prev_key( mlt_geometry this, mlt_geometry_item item, int position )
+{
+ // Get the local/private geometry structure
+ geometry self = this->local;
+
+ // Get the first item
+ geometry_item place = self->item;
+
+ while( place != NULL && place->next != NULL && position >= place->next->data.frame )
+ place = place->next;
+
+ if ( place != NULL )
+ memcpy( item, &place->data, sizeof( struct mlt_geometry_item_s ) );
+
+ return place == NULL;
+}
+
char *mlt_geometry_serialise_cut( mlt_geometry this, int in, int out )
{
+ geometry self = this->local;
struct mlt_geometry_item_s item;
char *ret = malloc( 1000 );
int used = 0;
if ( mlt_geometry_fetch( this, &item, item.frame ) )
break;
+ // If the first key is larger than the current position
+ // then do nothing here
+ if ( self->item->data.frame > item.frame )
+ {
+ item.frame ++;
+ continue;
+ }
+
// To ensure correct seeding, ensure all values are fixed
item.f[0] = 1;
item.f[1] = 1;
// Typically, we move from key to key
else if ( item.frame < out )
{
- if ( mlt_geometry_key( this, &item, item.frame ) )
+ if ( mlt_geometry_next_key( this, &item, item.frame ) )
break;
// Special case - crop at the out point