Ichthyostega
6bdf0e2cdc
(search & replace). Please feel free to add your name to any files to which you added any contributions. ALL SOURCECODE IS LICENCED UNDER THE TERMS AND CONDITIONS OF THE GPL (2 and above)
156 lines
5 KiB
C++
156 lines
5 KiB
C++
/*
|
|
LOCATINGPIN.hpp - Chaining and constraining the Placement of a Media Object
|
|
|
|
Copyright (C) CinelerraCV
|
|
2007, Hermann Vosseler <Ichthyostega@web.de>
|
|
|
|
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; if not, write to the Free Software
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
/** @file locatingpin.hpp
|
|
** Implementing the Placement mechanics. The various specifications how
|
|
** some MObject is to be placed (logically) within the EDL are given by small
|
|
** LocatingPin objects forming a chain. For resolving the actual position, at the
|
|
** moment (10/07) we use a preliminary implementation to support the most common
|
|
** Placement types (fixed and relative). It is comprised of the nested LocatingSolution
|
|
** and the functions FixedLocation#resolve(LocatingSolution&) and
|
|
** RelativeLocation#resolve(LocatingSolution&) etc. If this is to be extended,
|
|
** we'll need a real spatial discrete constraint solver (and this probably will be
|
|
** some library implementation, because the problem is anything but trivial).
|
|
**
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef MOBJECT_SESSION_LOCATINGPIN_H
|
|
#define MOBJECT_SESSION_LOCATINGPIN_H
|
|
|
|
|
|
#include "cinelerra.h"
|
|
|
|
#include <utility>
|
|
#include <boost/scoped_ptr.hpp>
|
|
using boost::scoped_ptr;
|
|
|
|
|
|
|
|
namespace mobject
|
|
{
|
|
class MObject;
|
|
template<class MO> class Placement;
|
|
typedef Placement<MObject> PMO;
|
|
|
|
namespace session
|
|
{
|
|
class FixedLocation;
|
|
class RelativeLocation;
|
|
|
|
class Track; //TODO
|
|
|
|
|
|
/**
|
|
* Positioning specification, possibliy chained
|
|
* to further specifications. The base class LocatingPin
|
|
* is a "no-op" specification which doesn't constrain the
|
|
* possible locations and thus can be embedded into pristine
|
|
* Placement by default. The Functor operators provide a
|
|
* way to add concrete positioning specifications, thereby
|
|
* defining the position of the MObject to be placed.
|
|
*
|
|
* @note to the implementer of subclasses: LocatingPins are
|
|
* copyable and need to handle cloning (incl the chain)
|
|
*/
|
|
class LocatingPin
|
|
{
|
|
protected:
|
|
typedef cinelerra::Time Time;
|
|
typedef session::Track* Track;
|
|
typedef std::pair<Time,Track> SolutionData; //TODO (ichthyo consideres better passing of solution by subclass)
|
|
struct LocatingSolution;
|
|
|
|
/** next additional Pin, if any */
|
|
scoped_ptr<LocatingPin> next_;
|
|
|
|
/** order to consider when resolving. 0=highest */
|
|
virtual int getPrioLevel () const { return 0; }
|
|
|
|
LocatingPin& addChain (LocatingPin*);
|
|
void resolve (LocatingSolution&) const;
|
|
virtual void intersect (LocatingSolution&) const;
|
|
|
|
public:
|
|
const SolutionData resolve () const;
|
|
bool isOverdetermined () const;
|
|
|
|
/* Factory functions for adding LocatingPins */
|
|
|
|
FixedLocation& operator() (Time start, Track track=0);
|
|
RelativeLocation& operator() (PMO refObj, Time offset=0);
|
|
|
|
LocatingPin (const LocatingPin&);
|
|
LocatingPin& operator= (const LocatingPin&);
|
|
virtual LocatingPin* clone () const;
|
|
virtual ~LocatingPin() {};
|
|
|
|
protected:
|
|
LocatingPin () {};
|
|
|
|
friend class Placement<MObject>;
|
|
|
|
/**
|
|
* @internal helper for the (preliminary)
|
|
* position resolve() implementation.
|
|
* @todo we can't sensibly reason about tracks,
|
|
* because at the moment (10/07) we lack a track implementation...
|
|
* @todo shouldn't we use a range-restriction LocatingPin (subclass)
|
|
* to represent the to-be-found solution? (ichthyo: siehe Trac #100)
|
|
*/
|
|
struct LocatingSolution
|
|
{
|
|
Time minTime;
|
|
Time maxTime;
|
|
Track minTrack;
|
|
Track maxTrack;
|
|
bool impo;
|
|
|
|
LocatingSolution ()
|
|
: minTime(Time::MAX), // TODO: better implementation of "unspecified..."
|
|
maxTime(Time::MIN),
|
|
minTrack(0), // TODO
|
|
maxTrack(0),
|
|
impo(false)
|
|
{ }
|
|
|
|
Time getTime ();
|
|
Track getTrack ();
|
|
|
|
bool is_definite ();
|
|
bool is_impossible ();
|
|
bool still_to_solve ();
|
|
|
|
};
|
|
};
|
|
|
|
|
|
|
|
|
|
} // namespace mobject::session
|
|
|
|
} // namespace mobject
|
|
#endif
|