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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
// Copyright (C) 2003 Dominique Devriese <devriese@kde.org>
// 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., 51 Franklin Street, Fifth Floor, Boston, MA
// 02110-1301, USA.
#include "other_type.h"
#include "bogus_imp.h"
#include "point_imp.h"
#include "locus_imp.h"
#include "../misc/common.h"
#include "../misc/calcpaths.h"
#include "../misc/goniometry.h"
#include "../kig/kig_part.h"
#include "../kig/kig_view.h"
#include "../kig/kig_commands.h"
#include <functional>
#include <algorithm>
#include <cmath>
using std::find;
static const struct ArgsParser::spec argsspecLocus[] =
{
{ HierarchyImp::stype(), "hierarchy", "SHOULD NOT BE SEEN", false },
{ CurveImp::stype(), "curve", "SHOULD NOT BE SEEN", false }
};
KIG_INSTANTIATE_OBJECT_TYPE_INSTANCE( LocusType )
LocusType::LocusType()
: ArgsParserObjectType( "Locus", argsspecLocus, 2 )
{
}
LocusType::~LocusType()
{
}
ObjectImp* LocusType::calc( const Args& args, const KigDocument& ) const
{
using namespace std;
assert( args.size() >= 2 );
const Args firsttwo( args.begin(), args.begin() + 2 );
Args fixedargs( args.begin() + 2, args.end() );
if ( ! margsparser.checkArgs( firsttwo ) ) return new InvalidImp;
for ( Args::iterator i = fixedargs.begin(); i != fixedargs.end(); ++i )
if ( ! (*i)->valid() )
return new InvalidImp;
const ObjectHierarchy& hier =
static_cast<const HierarchyImp*>( args[0] )->data();
const CurveImp* curveimp = static_cast<const CurveImp*>( args[1] );
return new LocusImp( curveimp->copy(), hier.withFixedArgs( fixedargs ) );
}
bool LocusType::inherits( int type ) const
{
return type == ID_LocusType ? true : Parent::inherits( type );
}
const ObjectImpType* LocusType::resultId() const
{
return LocusImp::stype();
}
KIG_INSTANTIATE_OBJECT_TYPE_INSTANCE( CopyObjectType )
CopyObjectType::CopyObjectType()
: ObjectType( "Copy" )
{
}
CopyObjectType::~CopyObjectType()
{
}
CopyObjectType* CopyObjectType::instance()
{
static CopyObjectType t;
return &t;
}
bool CopyObjectType::inherits( int ) const
{
return false;
}
ObjectImp* CopyObjectType::calc( const Args& parents, const KigDocument& ) const
{
assert( parents.size() == 1 );
return parents[0]->copy();
}
const ObjectImpType* CopyObjectType::impRequirement( const ObjectImp*, const Args& ) const
{
return ObjectImp::stype();
}
const ObjectImpType* CopyObjectType::resultId() const
{
// we don't know what we return..
return ObjectImp::stype();
}
const ObjectImpType* LocusType::impRequirement( const ObjectImp* o, const Args& parents ) const
{
assert( parents.size() >= 2 );
Args firsttwo( parents.begin(), parents.begin() + 2 );
if ( o == parents[0] || o == parents[1] )
return margsparser.impRequirement( o, firsttwo );
else
{
const HierarchyImp* h = dynamic_cast<const HierarchyImp*>( parents[0] );
if ( h )
{
PointImp* p = new PointImp( Coordinate() );
Args hargs( parents.begin()+ 2, parents.end() );
hargs.push_back( p );
ArgsParser hparser = h->data().argParser();
const ObjectImpType* ret = hparser.impRequirement( o, hargs );
delete p;
return ret;
}
else
return ObjectImp::stype();
};
}
const LocusType* LocusType::instance()
{
static const LocusType t;
return &t;
}
std::vector<ObjectCalcer*> CopyObjectType::sortArgs( const std::vector<ObjectCalcer*>& os ) const
{
assert( os.size() == 1 );
return os;
}
std::vector<ObjectCalcer*> LocusType::sortArgs( const std::vector<ObjectCalcer*>& args ) const
{
assert( args.size() >= 2 );
std::vector<ObjectCalcer*> firsttwo( args.begin(), args.begin() + 2 );
firsttwo = margsparser.parse( firsttwo );
std::copy( args.begin() + 2, args.end(), std::back_inserter( firsttwo ) );
return firsttwo;
}
Args LocusType::sortArgs( const Args& args ) const
{
assert( args.size() >= 2 );
Args firsttwo( args.begin(), args.begin() + 2 );
firsttwo = margsparser.parse( firsttwo );
std::copy( args.begin() + 2, args.end(), std::back_inserter( firsttwo ) );
return firsttwo;
}
Args CopyObjectType::sortArgs( const Args& args ) const
{
assert( args.size() == 1 );
return args;
}
bool CopyObjectType::isDefinedOnOrThrough( const ObjectImp*, const Args& ) const
{
// TODO: vragen aan parent ?
// TODO: translate the above TODO ?
return false;
}
|
