/*******************************************************************************/ /* Copyright (C) 2008 Jonathan Moore Liles */ /* */ /* This program is free software; you can redistribute it and/or modify it */ /* under the terms of the GNU General Public License as published by the */ /* Free Software Foundation; either version 2 of the License, or (at your */ /* option) any later version. */ /* */ /* This program is distributed in the hope that it will be useful, but WITHOUT */ /* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */ /* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for */ /* more details. */ /* */ /* You should have received a copy of the GNU General Public License along */ /* with This program; see the file COPYING. If not,write to the Free Software */ /* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /*******************************************************************************/ #pragma once #include #include #include #include #include "Loggable.H" #include #include // using namespace std; class Track; class Sequence_Widget; #include "types.h" /* This is the base class for all track types. */ class Sequence : public Fl_Widget, public Loggable { Track *_track; /* track this sequence belongs to */ char *_name; static queue _delete_queue; protected: std::list _widgets; Sequence_Widget *event_widget ( void ); virtual const char *class_name ( void ) { return "Sequence"; } virtual void set ( Log_Entry &e ) { return; } virtual void get ( Log_Entry &e ) { /* s += sprintf( s, ":items " ); */ /* for ( list ::const_iterator i = _widgets.begin(); i != _widgets.end(); i++ ) */ /* { */ /* s += sprintf( s, "0x%X", ((Loggable*)(*i))->id() ); */ /* list ::const_iterator e = i; */ /* if ( ++e != _widgets.end() ) */ /* s += sprintf( s, "," ); */ /* } */ } public: Sequence ( int X, int Y, int W, int H, Track *track=0 ); virtual ~Sequence ( ); const char * name ( void ) const { return _name; } void name ( char *s ) { if ( _name ) free( _name ); _name = s; label( _name ); } void sort ( void ); void remove ( Sequence_Widget *r ); void add ( Sequence_Widget *r ); void select_range ( int X, int W ); void remove_selected ( void ); const std::list widgets ( void ) const { return _widgets; } void queue_delete ( Sequence_Widget *r ) { _delete_queue.push( r ); } Sequence_Widget * overlaps ( Sequence_Widget *r ); virtual Sequence * clone ( void ) { assert( 0 ); } virtual Sequence * clone_empty ( void ) { return NULL; } virtual void snap ( Sequence_Widget *r ); virtual int handle ( int m ); virtual void draw ( void ); virtual nframes_t process ( nframes_t nframes ) { return 0; } };