1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
/*
* Copyright 2009 Nathan Hurst <njh@njhurst.com>
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 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.
*
*/
#include <boost/python.hpp>
#include <boost/python/implicit.hpp>
#include <boost/python/suite/indexing/vector_indexing_suite.hpp>
#include "py2geom.h"
#include "helpers.h"
#include "2geom/line.h"
//#include "2geom/bezier-curve.h"
#include "2geom/point.h"
using namespace boost::python;
template <typename S, typename T>
object wrap_intersection(S const& a, T const& b) {
Geom::OptCrossing oc = intersection(a, b);
return oc?object(*oc):object();
}
std::vector<Geom::Coord> (Geom::Line::*coefficients_vec)() const = &Geom::Line::coefficients;
void wrap_line() {
//line.h
def("intersection", wrap_intersection<Geom::Line, Geom::Line>);
def("intersection", wrap_intersection<Geom::Line, Geom::Ray>);
//def("intersection", wrap_intersection<Geom::Line, Geom::LineSegment>);
def("intersection", wrap_intersection<Geom::Ray, Geom::Line>);
def("intersection", wrap_intersection<Geom::Ray, Geom::Ray>);
//def("intersection", wrap_intersection<Geom::Ray, Geom::LineSegment>);
//def("intersection", wrap_intersection<Geom::LineSegement, Geom::Line>);
//def("intersection", wrap_intersection<Geom::LineSegement, Geom::Ray>);
//def("intersection", wrap_intersection<Geom::LineSegement, Geom::LineSegment>);
class_<Geom::Line>("Line", init<>())
.def(init<Geom::Point const&, Geom::Coord>())
.def(init<Geom::Point const&, Geom::Point const&>())
.def(init<double, double, double>())
//.def(self_ns::str(self))
.def("valueAt", &Geom::Line::valueAt)
.def("coefficients", coefficients_vec)
.def("isDegenerate", &Geom::Line::isDegenerate)
.def("pointAt", &Geom::Line::pointAt)
.def("roots", &Geom::Line::roots)
.def("nearestTime", &Geom::Line::nearestTime)
.def("reverse", &Geom::Line::reverse)
//.def("portion", &Geom::Line::portion)
//.def("segment", &Geom::Line::segment)
.def("derivative", &Geom::Line::derivative)
.def("transformed", &Geom::Line::transformed)
.def("normal", &Geom::Line::normal)
.def("normalAndDist", &Geom::Line::normalAndDist)
.def("setPoints", &Geom::Line::setPoints)
.def("setCoefficients", &Geom::Line::setCoefficients)
;
};
/*
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:fileencoding=utf-8:textwidth=99 :
|
