From cca66b9ec4e494c1d919bff0f71a820d8afab1fa Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Sun, 7 Apr 2024 20:24:48 +0200
Subject: Adding upstream version 1.2.2.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 src/live_effects/lpe-rough-hatches.cpp | 591 +++++++++++++++++++++++++++++++++
 1 file changed, 591 insertions(+)
 create mode 100644 src/live_effects/lpe-rough-hatches.cpp

(limited to 'src/live_effects/lpe-rough-hatches.cpp')

diff --git a/src/live_effects/lpe-rough-hatches.cpp b/src/live_effects/lpe-rough-hatches.cpp
new file mode 100644
index 0000000..94aa07c
--- /dev/null
+++ b/src/live_effects/lpe-rough-hatches.cpp
@@ -0,0 +1,591 @@
+// SPDX-License-Identifier: GPL-2.0-or-later
+/** \file
+ * LPE Curve Stitching implementation, used as an example for a base starting class
+ * when implementing new LivePathEffects.
+ *
+ */
+/*
+ * Authors:
+ *   JF Barraud.
+ *
+ * Copyright (C) Johan Engelen 2007 <j.b.c.engelen@utwente.nl>
+ *
+ * Released under GNU GPL v2+, read the file 'COPYING' for more information.
+ */
+
+#include "ui/widget/scalar.h"
+#include "live_effects/lpe-rough-hatches.h"
+
+#include "object/sp-item.h"
+
+#include "xml/repr.h"
+
+#include <2geom/sbasis-math.h>
+#include <2geom/bezier-to-sbasis.h>
+
+// TODO due to internal breakage in glibmm headers, this must be last:
+#include <glibmm/i18n.h>
+
+namespace Inkscape {
+namespace LivePathEffect {
+
+using namespace Geom;
+
+//------------------------------------------------
+// Some goodies to navigate through curve's levels.
+//------------------------------------------------
+struct LevelCrossing{
+    Point pt;
+    double t;
+    bool sign;
+    bool used;
+    std::pair<unsigned,unsigned> next_on_curve;
+    std::pair<unsigned,unsigned> prev_on_curve;
+};
+struct LevelCrossingOrder {
+    bool operator()(LevelCrossing a, LevelCrossing b) {
+        return ( a.pt[Y] < b.pt[Y] );// a.pt[X] == b.pt[X] since we are supposed to be on the same level...
+        //return ( a.pt[X] < b.pt[X] || ( a.pt[X] == b.pt[X]  && a.pt[Y] < b.pt[Y] ) );
+    }
+};
+struct LevelCrossingInfo{
+    double t;
+    unsigned level;
+    unsigned idx;
+};
+struct LevelCrossingInfoOrder {
+    bool operator()(LevelCrossingInfo a, LevelCrossingInfo b) {
+        return a.t < b.t;
+    }
+};
+
+typedef std::vector<LevelCrossing> LevelCrossings;
+
+static std::vector<double>
+discontinuities(Piecewise<D2<SBasis> > const &f){
+    std::vector<double> result;
+    if (f.size()==0) return result;
+    result.push_back(f.cuts[0]);
+    Point prev_pt = f.segs[0].at1();
+    //double old_t  = f.cuts[0];
+    for(unsigned i=1; i<f.size(); i++){
+        if ( f.segs[i].at0()!=prev_pt){
+            result.push_back(f.cuts[i]);
+            //old_t = f.cuts[i];
+            //assert(f.segs[i-1].at1()==f.valueAt(old_t));
+        }
+        prev_pt = f.segs[i].at1();
+    }
+    result.push_back(f.cuts.back());
+    //assert(f.segs.back().at1()==f.valueAt(old_t));
+    return result;
+}
+
+class LevelsCrossings: public std::vector<LevelCrossings>{
+public:
+    LevelsCrossings():std::vector<LevelCrossings>(){};
+    LevelsCrossings(std::vector<std::vector<double> > const &times,
+                    Piecewise<D2<SBasis> > const &f,
+                    Piecewise<SBasis> const &dx){
+
+        for (const auto & time : times){
+            LevelCrossings lcs;
+            for (double j : time){
+                LevelCrossing lc;
+                lc.pt = f.valueAt(j);
+                lc.t = j;
+                lc.sign = ( dx.valueAt(j)>0 );
+                lc.used = false;
+                lcs.push_back(lc);
+            }
+            std::sort(lcs.begin(), lcs.end(), LevelCrossingOrder());
+            push_back(lcs);
+        }
+        //Now create time ordering.
+        std::vector<LevelCrossingInfo>temp;
+        for (unsigned i=0; i<size(); i++){
+            for (unsigned j=0; j<(*this)[i].size(); j++){
+                LevelCrossingInfo elem;
+                elem.t = (*this)[i][j].t;
+                elem.level = i;
+                elem.idx = j;
+                temp.push_back(elem);
+            }
+        }
+        std::sort(temp.begin(),temp.end(),LevelCrossingInfoOrder());
+        std::vector<double> jumps = discontinuities(f);
+        unsigned jump_idx = 0;
+        unsigned first_in_comp = 0;
+        for (unsigned i=0; i<temp.size(); i++){
+            unsigned lvl = temp[i].level, idx = temp[i].idx;
+            if ( i == temp.size()-1 || temp[i+1].t > jumps[jump_idx+1]){
+                std::pair<unsigned,unsigned>next_data(temp[first_in_comp].level,temp[first_in_comp].idx);
+                (*this)[lvl][idx].next_on_curve = next_data;
+                first_in_comp = i+1;
+                jump_idx += 1;
+            }else{
+                std::pair<unsigned,unsigned> next_data(temp[i+1].level,temp[i+1].idx);
+                (*this)[lvl][idx].next_on_curve = next_data;
+            }
+        }
+
+        for (unsigned i=0; i<size(); i++){
+            for (unsigned j=0; j<(*this)[i].size(); j++){
+                std::pair<unsigned,unsigned> next = (*this)[i][j].next_on_curve;
+                (*this)[next.first][next.second].prev_on_curve = std::pair<unsigned,unsigned>(i,j);
+            }
+        }
+    }
+
+    void findFirstUnused(unsigned &level, unsigned &idx){
+        level = size();
+        idx = 0;
+        for (unsigned i=0; i<size(); i++){
+            for (unsigned j=0; j<(*this)[i].size(); j++){
+                if (!(*this)[i][j].used){
+                    level = i;
+                    idx = j;
+                    return;
+                }
+            }
+        }
+    }
+    //set indexes to point to the next point in the "snake walk"
+    //follow_level's meaning:
+    //  0=yes upward
+    //  1=no, last move was upward,
+    //  2=yes downward
+    //  3=no, last move was downward.
+    void step(unsigned &level, unsigned &idx, int &direction){
+        if ( direction % 2 == 0 ){
+            if (direction == 0) {
+                if ( idx >= (*this)[level].size()-1 || (*this)[level][idx+1].used ) {
+                    level = size();
+                    return;
+                }
+                idx += 1;
+            }else{
+                if ( idx <= 0  || (*this)[level][idx-1].used ) {
+                    level = size();
+                    return;
+                }
+                idx -= 1;
+            }
+            direction += 1;
+            return;
+        }
+        //double t = (*this)[level][idx].t;
+        double sign = ((*this)[level][idx].sign ? 1 : -1);
+        //---double next_t = t;
+        //level += 1;
+        direction = (direction + 1)%4;
+        if (level == size()){
+            return;
+        }
+
+        std::pair<unsigned,unsigned> next;
+        if ( sign > 0 ){
+            next = (*this)[level][idx].next_on_curve;
+        }else{
+            next = (*this)[level][idx].prev_on_curve;
+        }
+
+        if ( level+1 != next.first || (*this)[next.first][next.second].used ) {
+            level = size();
+            return;
+        }
+        level = next.first;
+        idx = next.second;
+        return;
+    }
+};
+
+//-------------------------------------------------------
+// Bend a path...
+//-------------------------------------------------------
+
+static Piecewise<D2<SBasis> > bend(Piecewise<D2<SBasis> > const &f, Piecewise<SBasis> bending){
+    D2<Piecewise<SBasis> > ff = make_cuts_independent(f);
+    ff[X] += compose(bending, ff[Y]);
+    return sectionize(ff);
+}
+
+//--------------------------------------------------------
+// The RoughHatches lpe.
+//--------------------------------------------------------
+LPERoughHatches::LPERoughHatches(LivePathEffectObject *lpeobject) :
+    Effect(lpeobject),
+    hatch_dist(0),
+    dist_rdm(_("Frequency randomness:"), _("Variation of distance between hatches, in %."), "dist_rdm", &wr, this, 75),
+    growth(_("Growth:"), _("Growth of distance between hatches."), "growth", &wr, this, 0.),
+//FIXME: top/bottom names are inverted in the UI/svg and in the code!!
+    scale_tf(_("Half-turns smoothness: 1st side, in:"), _("Set smoothness/sharpness of path when reaching a 'bottom' half-turn. 0=sharp, 1=default"), "scale_bf", &wr, this, 1.),
+    scale_tb(_("1st side, out:"), _("Set smoothness/sharpness of path when leaving a 'bottom' half-turn. 0=sharp, 1=default"), "scale_bb", &wr, this, 1.),
+    scale_bf(_("2nd side, in:"), _("Set smoothness/sharpness of path when reaching a 'top' half-turn. 0=sharp, 1=default"), "scale_tf", &wr, this, 1.),
+    scale_bb(_("2nd side, out:"), _("Set smoothness/sharpness of path when leaving a 'top' half-turn. 0=sharp, 1=default"), "scale_tb", &wr, this, 1.),
+    top_edge_variation(_("Magnitude jitter: 1st side:"), _("Randomly moves 'bottom' half-turns to produce magnitude variations."), "bottom_edge_variation", &wr, this, 0),
+    bot_edge_variation(_("2nd side:"), _("Randomly moves 'top' half-turns to produce magnitude variations."), "top_edge_variation", &wr, this, 0),
+    top_tgt_variation(_("Parallelism jitter: 1st side:"), _("Add direction randomness by moving 'bottom' half-turns tangentially to the boundary."), "bottom_tgt_variation", &wr, this, 0),
+    bot_tgt_variation(_("2nd side:"), _("Add direction randomness by randomly moving 'top' half-turns tangentially to the boundary."), "top_tgt_variation", &wr, this, 0),
+    top_smth_variation(_("Variance: 1st side:"), _("Randomness of 'bottom' half-turns smoothness"), "top_smth_variation", &wr, this, 0),
+    bot_smth_variation(_("2nd side:"), _("Randomness of 'top' half-turns smoothness"), "bottom_smth_variation", &wr, this, 0),
+//
+    fat_output(_("Generate thick/thin path"), _("Simulate a stroke of varying width"), "fat_output", &wr, this, true),
+    do_bend(_("Bend hatches"), _("Add a global bend to the hatches (slower)"), "do_bend", &wr, this, true),
+    stroke_width_top(_("Thickness: at 1st side:"), _("Width at 'bottom' half-turns"), "stroke_width_top", &wr, this, 1.),
+    stroke_width_bot(_("At 2nd side:"), _("Width at 'top' half-turns"), "stroke_width_bottom", &wr, this, 1.),
+//
+    front_thickness(_("From 2nd to 1st side:"), _("Width from 'top' to 'bottom'"), "front_thickness", &wr, this, 1.),
+    back_thickness(_("From 1st to 2nd side:"), _("Width from 'bottom' to 'top'"), "back_thickness", &wr, this, .25),
+
+    direction(_("Hatches width and dir"), _("Defines hatches frequency and direction"), "direction", &wr, this, Geom::Point(50,0)),
+//
+    bender(_("Global bending"), _("Relative position to a reference point defines global bending direction and amount"), "bender", &wr, this, Geom::Point(-5,0))
+{
+    registerParameter(&direction);
+    registerParameter(&dist_rdm);
+    registerParameter(&growth);
+    registerParameter(&do_bend);
+    registerParameter(&bender);
+    registerParameter(&top_edge_variation);
+    registerParameter(&bot_edge_variation);
+    registerParameter(&top_tgt_variation);
+    registerParameter(&bot_tgt_variation);
+    registerParameter(&scale_tf);
+    registerParameter(&scale_tb);
+    registerParameter(&scale_bf);
+    registerParameter(&scale_bb);
+    registerParameter(&top_smth_variation);
+    registerParameter(&bot_smth_variation);
+    registerParameter(&fat_output);
+    registerParameter(&stroke_width_top);
+    registerParameter(&stroke_width_bot);
+    registerParameter(&front_thickness);
+    registerParameter(&back_thickness);
+
+    //hatch_dist.param_set_range(0.1, Geom::infinity());
+    growth.param_set_range(0, std::numeric_limits<double>::max());
+    dist_rdm.param_set_range(0, 99.);
+    stroke_width_top.param_set_range(0, std::numeric_limits<double>::max());
+    stroke_width_bot.param_set_range(0, std::numeric_limits<double>::max());
+    front_thickness.param_set_range(0, std::numeric_limits<double>::max());
+    back_thickness.param_set_range(0, std::numeric_limits<double>::max());
+
+    // hide the widgets for direction and bender vectorparams
+    direction.widget_is_visible = false;
+    bender.widget_is_visible = false;
+    // give distinguishing colors to direction and bender on-canvas params
+    direction.set_oncanvas_color(0x00ff7d00);
+    bender.set_oncanvas_color(0xffffb500);
+
+    concatenate_before_pwd2 = false;
+    show_orig_path = true;
+}
+
+LPERoughHatches::~LPERoughHatches()
+= default;
+
+
+void LPERoughHatches::doOnApply(SPLPEItem const *lpeitem)
+{
+    lpeversion.param_setValue("1.2", true);
+}
+
+Geom::Piecewise<Geom::D2<Geom::SBasis> >
+LPERoughHatches::doEffect_pwd2 (Geom::Piecewise<Geom::D2<Geom::SBasis> > const & pwd2_in){
+
+    //std::cout<<"doEffect_pwd2:\n";
+
+    Piecewise<D2<SBasis> > result;
+
+    Piecewise<D2<SBasis> > transformed_pwd2_in = pwd2_in;
+    Point start = pwd2_in.segs.front().at0();
+    Point end = pwd2_in.segs.back().at1();
+    if (end != start ){
+        transformed_pwd2_in.push_cut( transformed_pwd2_in.cuts.back() + 1 );
+        D2<SBasis> stitch( SBasis( 1, Linear(end[X],start[X]) ), SBasis( 1, Linear(end[Y],start[Y]) ) );
+        transformed_pwd2_in.push_seg( stitch );
+    }
+    Point transformed_org = direction.getOrigin();
+    Piecewise<SBasis> tilter;//used to bend the hatches
+    Affine bend_mat;//used to bend the hatches
+
+    if (do_bend.get_value()){
+        Point bend_dir = -rot90(unit_vector(bender.getVector()));
+        double bend_amount = L2(bender.getVector());
+        bend_mat = Affine(-bend_dir[Y], bend_dir[X], bend_dir[X], bend_dir[Y],0,0);
+        transformed_pwd2_in = transformed_pwd2_in * bend_mat;
+        tilter = Piecewise<SBasis>(shift(Linear(-bend_amount),1));
+        OptRect bbox = bounds_exact( transformed_pwd2_in );
+        if (!(bbox)) return pwd2_in;
+        tilter.setDomain((*bbox)[Y]);
+        transformed_pwd2_in = bend(transformed_pwd2_in, tilter);
+        transformed_pwd2_in = transformed_pwd2_in * bend_mat.inverse();
+    }
+    hatch_dist = Geom::L2(direction.getVector())/5;
+    Point hatches_dir = rot90(unit_vector(direction.getVector()));
+    Affine mat(-hatches_dir[Y], hatches_dir[X], hatches_dir[X], hatches_dir[Y],0,0);
+    transformed_pwd2_in = transformed_pwd2_in * mat;
+    transformed_org *= mat;
+
+    std::vector<std::vector<Point> > snakePoints;
+    snakePoints = linearSnake(transformed_pwd2_in, transformed_org);
+    if (!snakePoints.empty()){
+        Piecewise<D2<SBasis> >smthSnake = smoothSnake(snakePoints);
+        smthSnake = smthSnake*mat.inverse();
+        if (do_bend.get_value()){
+            smthSnake = smthSnake*bend_mat;
+            smthSnake = bend(smthSnake, -tilter);
+            smthSnake = smthSnake*bend_mat.inverse();
+        }
+        return (smthSnake);
+    }
+    return pwd2_in;
+}
+
+//------------------------------------------------
+// Generate the levels with random, growth...
+//------------------------------------------------
+std::vector<double>
+LPERoughHatches::generateLevels(Interval const &domain, double x_org){
+    std::vector<double> result;
+    int n = int((domain.min()-x_org)/hatch_dist);
+    double x = x_org +  n * hatch_dist;
+    //double x = domain.min() + double(hatch_dist)/2.;
+    double step = double(hatch_dist);
+    double scale = 1+(hatch_dist*growth/domain.extent());
+    while (x < domain.max()){
+        result.push_back(x);
+        double rdm = 1;
+        if (dist_rdm.get_value() != 0)
+            rdm = 1.+ double((2*dist_rdm - dist_rdm.get_value()))/100.;
+        x+= step*rdm;
+        step*=scale;//(1.+double(growth));
+    }
+    return result;
+}
+
+
+//-------------------------------------------------------
+// Walk through the intersections to create linear hatches
+//-------------------------------------------------------
+std::vector<std::vector<Point> >
+LPERoughHatches::linearSnake(Piecewise<D2<SBasis> > const &f, Point const &org){
+
+    //std::cout<<"linearSnake:\n";
+    std::vector<std::vector<Point> > result;
+    Piecewise<SBasis> x = make_cuts_independent(f)[X];
+    //Remark: derivative is computed twice in the 2 lines below!!
+    Piecewise<SBasis> dx = derivative(x);
+    OptInterval range = bounds_exact(x);
+
+    if (!range) return result;
+    std::vector<double> levels = generateLevels(*range, org[X]);
+    std::vector<std::vector<double> > times;
+    times = multi_roots(x,levels);
+//TODO: fix multi_roots!!!*****************************************
+//remove doubles :-(
+    std::vector<std::vector<double> > cleaned_times(levels.size(),std::vector<double>());
+    for (unsigned i=0; i<times.size(); i++){
+        if ( times[i].size()>0 ){
+            double last_t = times[i][0]-1;//ugly hack!!
+            for (unsigned j=0; j<times[i].size(); j++){
+                if (times[i][j]-last_t >0.000001){
+                    last_t = times[i][j];
+                    cleaned_times[i].push_back(last_t);
+                }
+            }
+        }
+    }
+    times = cleaned_times;
+//*******************************************************************
+
+    LevelsCrossings lscs(times,f,dx);
+
+    unsigned i,j;
+    lscs.findFirstUnused(i,j);
+
+    std::vector<Point> result_component;
+    int n = int((range->min()-org[X])/hatch_dist);
+
+    while ( i < lscs.size() ){
+        int dir = 0;
+        //switch orientation of first segment according to starting point.
+        if ((static_cast<long long>(i) % 2 == n % 2) && ((j + 1) < lscs[i].size()) && !lscs[i][j].used){
+            j += 1;
+            dir = 2;
+        }
+
+        while ( i < lscs.size() ){
+            result_component.push_back(lscs[i][j].pt);
+            lscs[i][j].used = true;
+            lscs.step(i,j, dir);
+        }
+        result.push_back(result_component);
+        result_component = std::vector<Point>();
+        lscs.findFirstUnused(i,j);
+    }
+    return result;
+}
+
+//-------------------------------------------------------
+// Smooth the linear hatches according to params...
+//-------------------------------------------------------
+Piecewise<D2<SBasis> >
+LPERoughHatches::smoothSnake(std::vector<std::vector<Point> > const &linearSnake){
+
+    Piecewise<D2<SBasis> > result;
+    for (const auto & comp : linearSnake){
+        if (comp.size()>=2){
+            Point last_pt = comp[0];
+            //Point last_top = linearSnake[comp][0];
+            //Point last_bot = linearSnake[comp][0];
+            Point last_hdle = comp[0];
+            Point last_top_hdle = comp[0];
+            Point last_bot_hdle = comp[0];
+            Geom::Path res_comp(last_pt);
+            Geom::Path res_comp_top(last_pt);
+            Geom::Path res_comp_bot(last_pt);
+            unsigned i=1;
+            //bool is_top = true;//Inversion here; due to downward y?
+            bool is_top = ( comp[0][Y] < comp[1][Y] );
+
+            while( i+1<comp.size() ){
+                Point pt0 = comp[i];
+                Point pt1 = comp[i+1];
+                Point new_pt = (pt0+pt1)/2;
+                double scale_in = (is_top ? scale_tf : scale_bf );
+                double scale_out = (is_top ? scale_tb : scale_bb );
+                if (is_top){
+                    if (top_edge_variation.get_value() != 0)
+                        new_pt[Y] += double(top_edge_variation)-top_edge_variation.get_value()/2.;
+                    if (top_tgt_variation.get_value() != 0)
+                        new_pt[X] += double(top_tgt_variation)-top_tgt_variation.get_value()/2.;
+                    if (top_smth_variation.get_value() != 0) {
+                        scale_in*=(100.-double(top_smth_variation))/100.;
+                        scale_out*=(100.-double(top_smth_variation))/100.;
+                    }
+                }else{
+                    if (bot_edge_variation.get_value() != 0)
+                        new_pt[Y] += double(bot_edge_variation)-bot_edge_variation.get_value()/2.;
+                    if (bot_tgt_variation.get_value() != 0)
+                        new_pt[X] += double(bot_tgt_variation)-bot_tgt_variation.get_value()/2.;
+                    if (bot_smth_variation.get_value() != 0) {
+                        scale_in*=(100.-double(bot_smth_variation))/100.;
+                        scale_out*=(100.-double(bot_smth_variation))/100.;
+                    }
+                }
+                Point new_hdle_in  = new_pt + (pt0-pt1) * (scale_in /2.);
+                Point new_hdle_out = new_pt - (pt0-pt1) * (scale_out/2.);
+
+                if ( fat_output.get_value() ){
+                    //double scaled_width = double((is_top ? stroke_width_top : stroke_width_bot))/(pt1[X]-pt0[X]);
+                    //double scaled_width = 1./(pt1[X]-pt0[X]);
+                    //Point hdle_offset = (pt1-pt0)*scaled_width;
+                    Point inside = new_pt;
+                    Point inside_hdle_in;
+                    Point inside_hdle_out;
+                    inside[Y]+= double((is_top ? -stroke_width_top : stroke_width_bot));
+                    inside_hdle_in  = inside + (new_hdle_in -new_pt);// + hdle_offset * double((is_top ? front_thickness : back_thickness));
+                    inside_hdle_out = inside + (new_hdle_out-new_pt);// - hdle_offset * double((is_top ? back_thickness : front_thickness));
+
+                    inside_hdle_in  +=  (pt1-pt0)/2*( double((is_top ? front_thickness : back_thickness)) / (pt1[X]-pt0[X]) );
+                    inside_hdle_out -=  (pt1-pt0)/2*( double((is_top ? back_thickness : front_thickness)) / (pt1[X]-pt0[X]) );
+
+                    new_hdle_in  -=  (pt1-pt0)/2*( double((is_top ? front_thickness : back_thickness)) / (pt1[X]-pt0[X]) );
+                    new_hdle_out +=  (pt1-pt0)/2*( double((is_top ? back_thickness : front_thickness)) / (pt1[X]-pt0[X]) );
+                    //TODO: find a good way to handle limit cases (small smoothness, large stroke).
+                    //if (inside_hdle_in[X]  > inside[X]) inside_hdle_in = inside;
+                    //if (inside_hdle_out[X] < inside[X]) inside_hdle_out = inside;
+
+                    if (is_top){
+                        res_comp_top.appendNew<CubicBezier>(last_top_hdle,new_hdle_in,new_pt);
+                        res_comp_bot.appendNew<CubicBezier>(last_bot_hdle,inside_hdle_in,inside);
+                        last_top_hdle = new_hdle_out;
+                        last_bot_hdle = inside_hdle_out;
+                    }else{
+                        res_comp_top.appendNew<CubicBezier>(last_top_hdle,inside_hdle_in,inside);
+                        res_comp_bot.appendNew<CubicBezier>(last_bot_hdle,new_hdle_in,new_pt);
+                        last_top_hdle = inside_hdle_out;
+                        last_bot_hdle = new_hdle_out;
+                    }
+                }else{
+                    res_comp.appendNew<CubicBezier>(last_hdle,new_hdle_in,new_pt);
+                }
+
+                last_hdle = new_hdle_out;
+                i+=2;
+                is_top = !is_top;
+            }
+            if ( i<comp.size() ){
+                if ( fat_output.get_value() ){
+                    res_comp_top.appendNew<CubicBezier>(last_top_hdle,comp[i],comp[i]);
+                    res_comp_bot.appendNew<CubicBezier>(last_bot_hdle,comp[i],comp[i]);
+                }else{
+                    res_comp.appendNew<CubicBezier>(last_hdle,comp[i],comp[i]);
+                }
+            }
+            if ( fat_output.get_value() ){
+                res_comp = res_comp_bot;
+                res_comp.setStitching(true);
+                res_comp.append(res_comp_top.reversed());
+            }
+            result.concat(res_comp.toPwSb());
+        }
+    }
+    return result;
+}
+
+void
+LPERoughHatches::doBeforeEffect (SPLPEItem const*/*lpeitem*/)
+{
+    using namespace Geom;
+    top_edge_variation.resetRandomizer();
+    bot_edge_variation.resetRandomizer();
+    top_tgt_variation.resetRandomizer();
+    bot_tgt_variation.resetRandomizer();
+    top_smth_variation.resetRandomizer();
+    bot_smth_variation.resetRandomizer();
+    dist_rdm.resetRandomizer();
+
+    //original_bbox(lpeitem);
+}
+
+
+void
+LPERoughHatches::resetDefaults(SPItem const* item)
+{
+    Effect::resetDefaults(item);
+
+    Geom::OptRect bbox = item->geometricBounds();
+    Geom::Point origin(0.,0.);
+    Geom::Point vector(50.,0.);
+    if (bbox) {
+        origin = bbox->midpoint();
+        vector = Geom::Point((*bbox)[X].extent()/4, 0.);
+        top_edge_variation.param_set_value( (*bbox)[Y].extent()/10, 0 );
+        bot_edge_variation.param_set_value( (*bbox)[Y].extent()/10, 0 );
+        top_edge_variation.write_to_SVG();
+        bot_edge_variation.write_to_SVG();
+    }
+    //direction.set_and_write_new_values(origin, vector);
+    //bender.param_set_and_write_new_value( origin + Geom::Point(5,0) );
+    direction.set_and_write_new_values(origin + Geom::Point(0,-5), vector);
+    bender.set_and_write_new_values( origin, Geom::Point(5,0) );
+    hatch_dist = Geom::L2(vector)/2;
+}
+
+
+} //namespace LivePathEffect
+} /* namespace Inkscape */
+
+/*
+  Local Variables:
+  mode:c++
+  c-file-style:"stroustrup"
+  c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
+  indent-tabs-mode:nil
+  fill-column:99
+  End:
+*/
+// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4 :
-- 
cgit v1.2.3