h o m e

d o c u m e n t a t i o n

c l a s s h i e r a r c h y

---

Operators.h

//
//  Filename         : Operators.h
//  Author(s)        : Stephane Grabli, Emmanuel Turquin
//  Purpose          : Class gathering stroke creation algorithms
//  Date of creation : 01/07/2003
//


//
//  Copyright (C) : Please refer to the COPYRIGHT file distributed 
//   with this source distribution. 
//
//  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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
//

#ifndef  OPERATORS_H
# define OPERATORS_H

# include <vector>
# include <iostream>
# include "../view_map/Interface1D.h"
# include "Predicates1D.h"
# include "Predicates0D.h"
# include "../view_map/ViewMap.h"
# include "Chain.h"
# include "ChainingIterators.h"
# include "../system/TimeStamp.h"
# include "StrokeShader.h"

class LIB_STROKE_EXPORT Operators {

public:

  typedef vector<Interface1D*>  I1DContainer;
  typedef vector<Stroke*>       StrokesContainer;


  //
  // Operators
  //

  static void select(UnaryPredicate1D& pred);

  static void chain(ViewEdgeInternal::ViewEdgeIterator& it,
                    UnaryPredicate1D& pred,
                    UnaryFunction1D<void>& modifier);

  static void chain(ViewEdgeInternal::ViewEdgeIterator& it,
                    UnaryPredicate1D& pred);  

  static void bidirectionalChain(ChainingIterator& it, UnaryPredicate1D& pred);

  static void bidirectionalChain(ChainingIterator& it);

  static void sequentialSplit(UnaryPredicate0D& startingPred, UnaryPredicate0D& stoppingPred, 
                              float sampling = 0.f);

  static void sequentialSplit(UnaryPredicate0D& pred, 
                              float sampling = 0.f);

  static void recursiveSplit(UnaryFunction0D<double>& func, UnaryPredicate1D& pred, float sampling = 0);

  static void recursiveSplit(UnaryFunction0D<double>& func, UnaryPredicate0D& pred0d, UnaryPredicate1D& pred, float sampling = 0);
    
  static void sort(BinaryPredicate1D& pred);

  static void create(UnaryPredicate1D& pred, vector<StrokeShader*> shaders);

  //
  // Data access
  //

  static ViewEdge* getViewEdgeFromIndex(unsigned i) {
    return dynamic_cast<ViewEdge*>(_current_view_edges_set[i]);
  }
  
  static Chain* getChainFromIndex(unsigned i) {
    return dynamic_cast<Chain*>(_current_chains_set[i]);
  }
    
  static Stroke* getStrokeFromIndex(unsigned i) {
    return _current_strokes_set[i];
  }
  
  static unsigned getViewEdgesSize() {
    return _current_view_edges_set.size();
  }
  
  static unsigned getChainsSize() {
    return _current_chains_set.size();
  }

  static unsigned getStrokesSize() {
    return _current_strokes_set.size();
  }
  
  //
  // Not exported in Python
  //

  static StrokesContainer* getStrokesSet() {
    return &_current_strokes_set;
  }

  static void reset();

private:

  Operators() {}

  static I1DContainer           _current_view_edges_set;
  static I1DContainer           _current_chains_set;
  static I1DContainer*          _current_set;
  static StrokesContainer       _current_strokes_set;
};

#endif // OPERATORS_H

---

Last modified 3 Mar 2008

© Stephane Grabli