/* cairo - a vector graphics library with display and print output

 *

 * Copyright © 2005 Red Hat, Inc

 *

 * This library is free software; you can redistribute it and/or

 * modify it either under the terms of the GNU Lesser General Public

 * License version 2.1 as published by the Free Software Foundation

 * (the "LGPL") or, at your option, under the terms of the Mozilla

 * Public License Version 1.1 (the "MPL"). If you do not alter this

 * notice, a recipient may use your version of this file under either

 * the MPL or the LGPL.

 *

 * You should have received a copy of the LGPL along with this library

 * in the file COPYING-LGPL-2.1; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA

 * You should have received a copy of the MPL along with this library

 * in the file COPYING-MPL-1.1

 *

 * The contents of this file are subject to the Mozilla Public License

 * Version 1.1 (the "License"); you may not use this file except in

 * compliance with the License. You may obtain a copy of the License at

 * http://www.mozilla.org/MPL/

 *

 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY

 * OF ANY KIND, either express or implied. See the LGPL or the MPL for

 * the specific language governing rights and limitations.

 *

 * The Original Code is the cairo graphics library.

 *

 * The Initial Developer of the Original Code is Red Hat, Inc.

 *

 * Contributor(s):

 *	Carl Worth <cworth@cworth.org>

 */

#include "cairoint.h"

#include "cairo-error-private.h"

void

{

    VG (VALGRIND_MAKE_MEM_UNDEFINED (style, sizeof (cairo_stroke_style_t)));

cairo_status_t

			       const cairo_stroke_style_t *other)

{

    if (CAIRO_INJECT_FAULT ())

	return _cairo_error (CAIRO_STATUS_NO_MEMORY);

    VG (VALGRIND_MAKE_MEM_UNDEFINED (style, sizeof (cairo_stroke_style_t)));

    } else {

    }

}

void

{

    VG (VALGRIND_MAKE_MEM_UNDEFINED (style, sizeof (cairo_stroke_style_t)));

/*

 * For a stroke in the given style, compute the maximum distance

 * from the path that vertices could be generated.  In the case

 * of rotation in the ctm, the distance will not be exact.

 */

void

					    const cairo_path_fixed_t *path,

                                            const cairo_matrix_t *ctm,

                                            double *dx, double *dy)

{

    {

    }

    } else {

    }

void

						 const cairo_path_fixed_t *path,

						 const cairo_matrix_t *ctm,

						 double *dx, double *dy)

{

    } else {

    }

void

						 const cairo_path_fixed_t *path,

						 const cairo_matrix_t *ctm,

						 double *dx, double *dy)

{

    {

    }

    } else {

    }

/*

 * Computes the period of a dashed stroke style.

 * Returns 0 for non-dashed styles.

 */

double

{

    double period;

    unsigned int i;

}

/*

 * Coefficient of the linear approximation (minimizing square difference)

 * of the surface covered by round caps

 *

 * This can be computed in the following way:

 * the area inside the circle with radius w/2 and the region -d/2 <= x <= d/2 is:

 *   f(w,d) = 2 * integrate (sqrt (w*w/4 - x*x), x, -d/2, d/2)

 * The square difference to a generic linear approximation (c*d) in the range (0,w) would be:

 *   integrate ((f(w,d) - c*d)^2, d, 0, w)

 * To minimize this difference it is sufficient to find a solution of the differential with

 * respect to c:

 *   solve ( diff (integrate ((f(w,d) - c*d)^2, d, 0, w), c), c)

 * Which leads to c = 9/32*pi*w

 * Since we're not interested in the true area, but just in a coverage estimate,

 * we always divide the real area by the line width (w).

 * The same computation for square caps would be

 *   f(w,d) = 2 * integrate(w/2, x, -d/2, d/2)

 *   c = 1*w

 * but in this case it would not be an approximation, since f is already linear in d.

 */

#define ROUND_MINSQ_APPROXIMATION (9*M_PI/32)

/*

 * Computes the length of the "on" part of a dashed stroke style,

 * taking into account also line caps.

 * Returns 0 for non-dashed styles.

 */

double

{

    double stroked, cap_scale;

    unsigned int i;

    }

        /* Each dash element is used both as on and as off. The order in which they are summed is

	 * irrelevant, so sum the coverage of one dash element, taken both on and off at each iteration */

    } else {

        /* Even (0, 2, ...) dashes are on and simply counted for the coverage, odd dashes are off, thus

	 * their coverage is approximated based on the area covered by the caps of adjacent on dases. */

    }

}

/*

 * Verifies if _cairo_stroke_style_dash_approximate should be used to generate

 * an approximation of the dash pattern in the specified style, when used for

 * stroking a path with the given CTM and tolerance.

 * Always %FALSE for non-dashed styles.

 */

cairo_bool_t

					  const cairo_matrix_t *ctm,

					  double tolerance)

{

    double period;

}

/*

 * Create a 2-dashes approximation of a dashed style, by making the "on" and "off"

 * parts respect the original ratio.

 */

void

				      const cairo_matrix_t *ctm,

				      double tolerance,

				      double *dash_offset,

				      double *dashes,

				      unsigned int *num_dashes)

{

    double coverage, scale, offset;

    /* We stop searching for a starting point as soon as the

     * offset reaches zero.  Otherwise when an initial dash

     * segment shrinks to zero it will be skipped over. */

    }

    /*

     * We want to create a new dash pattern with the same relative coverage,

     * but composed of just 2 elements with total length equal to scale.

     * Based on the formula in _cairo_stroke_style_dash_stroked:

     * scale * coverage = dashes[0] + cap_scale * MIN (dashes[1], line_width)

     *                  = MIN (dashes[0] + cap_scale * (scale - dashes[0]),

     *                         dashes[0] + cap_scale * line_width) = 

     *                  = MIN (dashes[0] * (1 - cap_scale) + cap_scale * scale,

     *	                       dashes[0] + cap_scale * line_width)

     *

     * Solving both cases we get:

     *   dashes[0] = scale * (coverage - cap_scale) / (1 - cap_scale)

     *	  when scale - dashes[0] <= line_width

     *	dashes[0] = scale * coverage - cap_scale * line_width

     *	  when scale - dashes[0] > line_width.

     *

     * Comparing the two cases we get:

     *   second > first

     *   second > scale * (coverage - cap_scale) / (1 - cap_scale)

     *   second - cap_scale * second - scale * coverage + scale * cap_scale > 0

     * 	 (scale * coverage - cap_scale * line_width) - cap_scale * second - scale * coverage + scale * cap_scale > 0

     *   - line_width - second + scale > 0

     *   scale - second > line_width

     * which is the condition for the second solution to be the valid one.

     * So when second > first, the second solution is the correct one (i.e.

     * the solution is always MAX (first, second).

     */

	dashes[0] = 0.0;

	break;

        /* Simplified formula (substituting 0 for cap_scale): */

			scale * coverage - ROUND_MINSQ_APPROXIMATION * style->line_width);

        /*

	 * Special attention is needed to handle the case cap_scale == 1 (since the first solution

	 * is either indeterminate or -inf in this case). Since dash lengths are always >=0, using

	 * 0 as first solution always leads to the correct solution.

	 */

    }