//===========================================================================
shared_ptr<ParamCurve>
Param2FunctionInt::getConstantParameterCurve(int pardir, double par)
//===========================================================================
{
// Get the current parameter domain
vector<double> mima = getMima();
// End-parameter values of the curve
double param1[2], param2[2];
int idx2 = 1-pardir;
param1[pardir] = param2[pardir] = par;
param1[idx2] = mima[2*idx2];
param2[idx2] = mima[2*idx2+1];
// Make constant parameter curve as a curve-on-surface curve
Point pp1(param1[0], param1[1]), pp2(param2[0], param2[1]);
shared_ptr<SplineCurve> pcrv =
shared_ptr<SplineCurve>(new SplineCurve(pp1, param1[idx2],
pp2, param2[idx2]));
shared_ptr<ParamCurve> constcrv =
shared_ptr<ParamCurve>(new CurveOnSurface(getParamSurface(),
pcrv, true));
return constcrv;
}
void VoronoiCgal_Patch::Compute()
{
m_CgalPatchs = MakePatchs(m_ImageSpline);
for (int i = 0; i < m_CgalPatchs.size(); ++i)
{
m_Delaunay = Delaunay();
insert_polygon(m_Delaunay, m_ImageSpline, i);
insert_polygonInter(m_Delaunay, m_ImageSpline, i);
Mesher mesher(m_Delaunay);
Criteria criteria(0, 100);
mesher.set_criteria(criteria);
mesher.refine_mesh();
mark_domains(m_Delaunay);
LineSegs lineSegs;
for (auto e = m_Delaunay.finite_edges_begin();
e != m_Delaunay.finite_edges_end(); ++e)
{
Delaunay::Face_handle fn = e->first->neighbor(e->second);
//CGAL::Object o = m_Delaunay.dual(e);
if (!fn->is_in_domain() || !fn->info().in_domain())
{
continue;
}
if (!m_Delaunay.is_constrained(*e) && (!m_Delaunay.is_infinite(e->first))
&& (!m_Delaunay.is_infinite(e->first->neighbor(e->second))))
{
Delaunay::Segment s = m_Delaunay.geom_traits().construct_segment_2_object()
(m_Delaunay.circumcenter(e->first),
m_Delaunay.circumcenter(e->first->neighbor(e->second)));
const CgalInexactKernel::Segment_2* seg = &s;
CgalPoint p1(seg->source().hx(), seg->source().hy());
CgalPoint p2(seg->target().hx(), seg->target().hy());
Vector2 pp1(p1.hx(), p1.hy());
Vector2 pp2(p2.hx(), p2.hy());
if (pp1 == pp2)
{
continue;
}
lineSegs.push_back(LineSeg(pp1, pp2));
}
}
for (auto it = lineSegs.begin(); it != lineSegs.end(); ++it)
{
//m_PositionGraph.AddNewLine(it->beg, it->end, );
}
}
m_PositionGraph.ComputeJoints();
//printf("joints: %d\n", m_PositionGraph.m_Joints.size());
//MakeLines();
MakeGraphLines();
}
void test()
{
ttl::pair<int, char> pp1(-1, 'a');
ttl::pair<int, char> pp2 = ttl::make_pair(-2, 'b');
printf("%d, '%c'\n", pp1.first, pp1.second);
pp1.swap(pp2);
printf("%d, '%c'\n", pp1.first, pp1.second);
}
void LineSegment::updateGrips(int* grips, QRectF* grip) const
{
*grips = 3;
QPointF pp(pagePos());
QPointF pp1(pp);
QPointF pp2(pos2() + pp);
QPointF pp3(pos2() * .5 + pp);
grip[2].translate(pp3);
grip[1].translate(pp2);
grip[0].translate(pp1);
}
void ParsePositionTest::TestParsePosition()
{
ParsePosition pp1(0);
if (pp1.getIndex() == 0) {
logln("PP constructor() tested.");
}else{
errln("*** PP getIndex or constructor() result");
}
{
int to = 5;
ParsePosition pp2( to );
if (pp2.getIndex() == 5) {
logln("PP getIndex and constructor(int32_t) tested.");
}else{
errln("*** PP getIndex or constructor(int32_t) result");
}
pp2.setIndex( 3 );
if (pp2.getIndex() == 3) {
logln("PP setIndex tested.");
}else{
errln("*** PP getIndex or setIndex result");
}
}
ParsePosition pp2(3), pp3(5);
//pp2 = new ParsePosition( 3 );
//pp3 = new ParsePosition( 5 );
ParsePosition pp4(5);
if ( pp2 != pp3) {
logln("PP not equals tested.");
}else{
errln("*** PP not equals fails");
}
if (pp3 == pp4) {
logln("PP equals tested.");
}else{
errln(UnicodeString("*** PP equals fails (") + pp3.getIndex() + " != " + pp4.getIndex() + ")");
}
ParsePosition pp5;
pp5 = pp4;
if (pp4 == pp5) {
logln("PP operator= tested.");
}else{
errln("*** PP operator= operator== or operator != result");
}
ParsePosition *ppp = pp5.clone();
if(ppp == &pp5 || *ppp != pp5) {
errln("ParsePosition.clone() failed");
}
delete ppp;
}
TEST_F(TimusProblemsTestClass, TestProblem_1815) // NOLINT
{
Pt p1(0.f, 0.f);
Pt p2(p1);
p2.x = p2.y = 1.f;
ASSERT_EQ(0.f, p1.x);
ASSERT_EQ(1.f, p2.x);
ASSERT_TRUE(sqrt(2.f) - p1.dist(p2) < 0.000001f);
Pt pp1(0.f, 0.f);
Pt pp2(1.f, 0.f);
Pt pp3(0.f, 1.f);
double result = solve_1815(pp1, pp2, pp3, 1, 1, 1);
ASSERT_TRUE(result - 1.9318516526 < 0.0000000001);
}
void LineSegment::updateGrips(int* grips, QRectF* grip) const
{
*grips = 3;
/* if (line()->anchor() == Spanner::ANCHOR_NOTE) {
grip[0].translate(pos());
grip[1].translate(pos2());
grip[2].translate(pos2() * .5);
return;
}
*/
QPointF pp(pagePos());
QPointF pp1(pp);
QPointF pp2(pos2() + pp);
QPointF pp3(pos2() * .5 + pp);
grip[2].translate(pp3);
grip[1].translate(pp2);
grip[0].translate(pp1);
}
cv::Mat TestProjection::test(double userX, double userY, double userZ,
const char* filename) {
//Coordinates of the projection in the real world
/*cv::Point3f p11(-480, 735, -420);
cv::Point3f p12(0, 935, 0);
cv::Point3f p13(0, 220, 0);
cv::Point3f p14(-480, 240, -420);
Plane3d proj1(p11, p12, p13, p14);
cv::Point3f p21(0, 935, 0);
cv::Point3f p22(480, 735, -420);
cv::Point3f p23(480, 240, -420);
cv::Point3f p24(0, 220, 0);
Plane3d proj2(p21, p22, p23, p24);*/
cv::Point3f p11(-590, 725, -350);
cv::Point3f p12(0, 955, 0);
cv::Point3f p13(0, 200, 0);
cv::Point3f p14(-590, 227, -350);
Plane3d proj1(p11, p12, p13, p14);
cv::Point3f p21(0, 955, 0);
cv::Point3f p22(567, 755, -350);
cv::Point3f p23(567, 227, -350);
cv::Point3f p24(0, 200, 0);
Plane3d proj2(p21, p22, p23, p24);
std::vector<Plane3d> planes;
planes.push_back(proj1);
planes.push_back(proj2);
Projection proj(planes);
// proj.print();
//Create the user with the obtained projection coordinates
User u(proj);
//Update his position
u.updatePosition(userX, userY, userZ);
// u.print();
//Create the distorted-corrected plane pairs, using the projections
//on the user's view plane
//Plane 1
//****************************************************************************************************
Plane2d p1 = u.getProjectedPlanes().at(0).to2d();
Plane2d p2(cv::Point2f(0, 0), cv::Point2f(480, 0), cv::Point2f(480, 540), cv::Point2f(0, 540));
// Plane2d p2(cv::Point2f(0, 0), cv::Point2f(230, 0), cv::Point2f(230, 520), cv::Point2f(0, 520));
// Plane2d p2(cv::Point2f(0, 0), cv::Point2f(270, 0), cv::Point2f(270, 405), cv::Point2f(0, 405));
//****************************************************************************************************
//Invert the plane y coordinates
Plane2d inv1 = p1.yInverted();
//Move it so that it's closer to the target plane
cv::Vec2f dist = pjs::distance(inv1, p2);
Plane2d pp1(cv::Point2f(inv1.getPoint(0).x - dist[0], inv1.getPoint(0).y - dist[1]),
cv::Point2f(inv1.getPoint(1).x - dist[0], inv1.getPoint(1).y - dist[1]),
cv::Point2f(inv1.getPoint(2).x - dist[0], inv1.getPoint(2).y - dist[1]),
cv::Point2f(inv1.getPoint(3).x - dist[0], inv1.getPoint(3).y - dist[1]));
//Plane 2
//****************************************************************************************************
Plane2d p3 = u.getProjectedPlanes().at(1).to2d();
Plane2d p4(cv::Point2f(0, 0), cv::Point2f(480, 0), cv::Point2f(480, 540), cv::Point2f(0, 540));
// Plane2d p4(cv::Point2f(0, 0), cv::Point2f(230, 0), cv::Point2f(230, 520), cv::Point2f(0, 520));
// Plane2d p4(cv::Point2f(0, 0), cv::Point2f(270, 0), cv::Point2f(270, 405), cv::Point2f(0, 405));
//****************************************************************************************************
//Invert the plane y coordinates
Plane2d inv2 = p3.yInverted();
//Move it so that it's closer to the target plane
dist = pjs::distance(inv2, p4);
Plane2d pp3(cv::Point2f(inv2.getPoint(0).x - dist[0], inv2.getPoint(0).y - dist[1]),
cv::Point2f(inv2.getPoint(1).x - dist[0], inv2.getPoint(1).y - dist[1]),
cv::Point2f(inv2.getPoint(2).x - dist[0], inv2.getPoint(2).y - dist[1]),
cv::Point2f(inv2.getPoint(3).x - dist[0], inv2.getPoint(3).y - dist[1]));
//***********************
//Load the target image
//***********************
cv::Mat img = cv::imread(filename, CV_LOAD_IMAGE_COLOR);
if (!img.data) {
std::cout << " --(!) Error reading image" << std::endl;
throw std::exception();
}
//Helper object
Utils utils;
//Divide the image in two
// std::vector<cv::Mat> images = utils.divideImageInTwo(img);
//Build the surfaces with their reference planes and their corresponding
//image
Surface s1(pp1, p2);
Surface s2(pp3, p4);
std::vector<Surface*> surfaces;
surfaces.push_back(&s1);
surfaces.push_back(&s2);
int originX;
int padding;
int screenWidth = 1280;
int screenHeight = 800;
//TODO recursive position correction
int width1 = s1.getWidth();
int width2 = s2.getWidth();
int diffW = width1 - width2;
if (diffW < 0) {
originX = screenWidth / 2 - width1;
padding = 0;
} else {
originX = 0 + screenWidth / 2 - width1;
padding = 0;
}
//1st position correction
cv::Point2f origin(originX, 0);
s1.correctBBPosition(origin);
cv::Point2f s1ur = s1.getUpperRightCorner();
s2.correctPosition(s1ur);
cv::Point2f upperLeft = s2.getUpperLeftCorner();
cv::Point2f upperRight = s2.getUpperRightCorner();
double topY;
if (upperLeft.y < upperRight.y) {
topY = upperLeft.y;
} else {
topY = upperRight.y;
}
cv::Size size = utils.getFinalSize(surfaces);
int diffH = screenHeight - size.height;
//2nd position correction if necessary (if second plane is still outside)
if (!topY < 0) {
topY = 0;
}
cv::Point2f newOrigin(originX, -topY + diffH / 2);
s1.correctBBPosition(newOrigin);
s1ur = s1.getUpperRightCorner();
s2.correctPosition(s1ur);
// cv::Size size = utils.getFinalSize(surfaces);
size.width += padding;
size.width = std::max(screenWidth, size.width);
size.height = screenHeight;
cv::Size sizeS1(size.width / 2, size.height);
s1.setSize(sizeS1);
s2.setSize(size);
std::vector<cv::Mat> images = utils.divideImageInTwo(img);
s1.setImage(images.at(0));
s2.setImage(images.at(1));
s1.applyHomography();
s2.applyHomography();
// s1.addTransparency();
// s2.addTransparency();
cv::Mat finalImage = utils.getImageFromSurfaces(surfaces);
surfaces.clear();
return finalImage;
}
void TextLineSegment::draw(QPainter* painter) const
{
TextLine* tl = textLine();
qreal _spatium = spatium();
qreal textlineLineWidth = tl->lineWidth().val() * _spatium;
qreal textlineTextDistance = _spatium * .5;
QPointF pp2(pos2());
QColor color;
bool normalColor = false;
if (selected() && !(score() && score()->printing()))
color = MScore::selectColor[0];
else if (!visible())
color = Qt::gray;
else {
color = curColor();
normalColor = true;
}
qreal l = 0.0;
int sym = subtype() == SEGMENT_MIDDLE ? tl->continueSymbol() : tl->beginSymbol();
if (_text) {
SpannerSegmentType st = subtype();
if (
((st == SEGMENT_SINGLE || st == SEGMENT_BEGIN) && (tl->beginTextPlace() == PLACE_LEFT))
|| ((st == SEGMENT_MIDDLE || st == SEGMENT_END) && (tl->continueTextPlace() == PLACE_LEFT))
) {
QRectF bb(_text->bbox());
l = _text->pos().x() + bb.width() + textlineTextDistance;
}
painter->translate(_text->pos());
painter->setPen(normalColor ? _text->curColor() : color);
_text->draw(painter);
painter->translate(-_text->pos());
}
else if (sym != -1) {
const QRectF& bb = symbols[score()->symIdx()][sym].bbox(magS());
qreal h = bb.height() * .5;
QPointF o = tl->beginSymbolOffset() * _spatium;
painter->setPen(color);
symbols[score()->symIdx()][sym].draw(painter, 1.0, QPointF(o.x(), h + o.y()));
l = bb.width() + textlineTextDistance;
}
QPen pen(normalColor ? tl->lineColor() : color, textlineLineWidth);
pen.setStyle(tl->lineStyle());
painter->setPen(pen);
if (subtype() == SEGMENT_SINGLE || subtype() == SEGMENT_END) {
if (tl->endSymbol() != -1) {
int sym = tl->endSymbol();
const QRectF& bb = symbols[score()->symIdx()][sym].bbox(magS());
qreal h = bb.height() * .5;
QPointF o = tl->endSymbolOffset() * _spatium;
pp2.setX(pp2.x() - bb.width() + textlineTextDistance);
symbols[score()->symIdx()][sym].draw(painter, 1.0, QPointF(pp2.x() + textlineTextDistance + o.x(), h + o.y()));
}
}
QPointF pp1(l, 0.0);
if (tl->beginHook() && tl->beginHookType() == HOOK_45)
pp1.rx() += fabs(tl->beginHookHeight().val() * _spatium * .4);
if (tl->endHook() && tl->endHookType() == HOOK_45)
pp2.rx() -= fabs(tl->endHookHeight().val() * _spatium * .4);
painter->drawLine(QLineF(pp1.x(), pp1.y(), pp2.x(), pp2.y()));
if (tl->beginHook()) {
qreal hh = tl->beginHookHeight().val() * _spatium;
if (subtype() == SEGMENT_SINGLE || subtype() == SEGMENT_BEGIN) {
if (tl->beginHookType() == HOOK_45)
painter->drawLine(QLineF(pp1.x(), pp1.y(), pp1.x() - fabs(hh * .4), pp1.y() + hh));
else
painter->drawLine(QLineF(pp1.x(), pp1.y(), pp1.x(), pp1.y() + hh));
}
}
if (tl->endHook()) {
qreal hh = tl->endHookHeight().val() * _spatium;
if (subtype() == SEGMENT_SINGLE || subtype() == SEGMENT_END) {
if (tl->endHookType() == HOOK_45)
painter->drawLine(QLineF(pp2.x(), pp2.y(), pp2.x() + fabs(hh * .4), pp2.y() + hh));
else
painter->drawLine(QLineF(pp2.x(), pp2.y(), pp2.x(), pp2.y() + hh));
}
}
}
double MinDistTP2 (const Point3d & tp1, const Point3d & tp2,
const Point3d & tp3, const Point3d & p)
{
double lam1, lam2;
double res;
LocalCoordinates (Vec3d (tp1, tp2), Vec3d (tp1, tp3),
Vec3d (tp1, p), lam1, lam2);
int in1 = lam1 >= 0;
int in2 = lam2 >= 0;
int in3 = lam1+lam2 <= 1;
if (in1 && in2 && in3)
{
Point3d pp = tp1 + lam1 * Vec3d(tp1, tp2) + lam2 * Vec3d (tp1, tp3);
res = Dist2 (p, pp);
}
else
{
res = Dist2 (tp1, p);
if (!in1)
{
double hv = MinDistLP2 (tp1, tp3, p);
if (hv < res) res = hv;
}
if (!in2)
{
double hv = MinDistLP2 (tp1, tp2, p);
if (hv < res) res = hv;
}
if (!in3)
{
double hv = MinDistLP2 (tp2, tp3, p);
if (hv < res) res = hv;
}
/*
double d1 = MinDistLP2 (tp1, tp2, p);
double d2 = MinDistLP2 (tp1, tp3, p);
double d3 = MinDistLP2 (tp2, tp3, p);
res = min3 (d1, d2, d3);
*/
}
return res;
Vec3d pp1(tp1, p);
Vec3d v1(tp1, tp2), v2(tp1, tp3);
double c = pp1.Length2();
double cx = -2 * (pp1 * v1);
double cy = -2 * (pp1 * v2);
double cxx = v1.Length2();
double cxy = 2 * (v1 * v2);
double cyy = v2.Length2();
QuadraticPolynomial2V pol (-c, -cx, -cy, -cxx, -cxy, -cyy);
double res2 = - pol.MaxUnitTriangle ();
if (fabs (res - res2) > 1e-8)
cout << "res and res2 differ: " << res << " != " << res2 << endl;
return res2;
}
void PyHelpersTest::RunTests()
{
// Test py::Ptr construction
{
{
// NULL pointer
PyObject * p = NULL;
SHOULDFAIL(py::Ptr(p, /* allowNULL: */false));
py::Ptr pp1(p, /* allowNULL: */true);
TEST((PyObject *)pp1 == NULL);
TEST(pp1.isNULL());
}
// Non-NULL pointer
{
PyObject * p = PyTuple_New(1);
py::Ptr pp2(p);
TEST(!pp2.isNULL());
TEST((PyObject *)pp2 == p);
pp2.release();
TEST(pp2.isNULL());
Py_DECREF(p);
}
// assign
{
PyObject * p = PyTuple_New(1);
TEST(p->ob_refcnt == 1);
py::Ptr pp(NULL, /* allowNULL */ true);
TEST(pp.isNULL());
NTA_DEBUG << "*** Before assign";
pp.assign(p);
NTA_DEBUG << "*** After assign";
TEST(p->ob_refcnt == 2);
TEST(!(pp.isNULL()));
Py_DECREF(p);
TEST(p->ob_refcnt == 1);
}
}
// py::String
{
py::String ps1(std::string("123"));
TEST(PyString_Check(ps1) != 0);
py::String ps2("123", size_t(3));
TEST(PyString_Check(ps2) != 0);
py::String ps3("123");
TEST(PyString_Check(ps3) != 0);
std::string s1(PyString_AsString(ps1));
std::string s2(PyString_AsString(ps2));
std::string s3(PyString_AsString(ps3));
std::string expected("123");
TEST(s1 == expected);
TEST(s2 == expected);
TEST(s3 == expected);
TEST(std::string(ps1) == expected);
TEST(std::string(ps2) == expected);
TEST(std::string(ps3) == expected);
PyObject * p = PyString_FromString("777");
py::String ps4(p);
TEST(std::string(ps4) == std::string("777"));
}
// py::Int
{
py::Int n1(-5);
py::Int n2(-6666);
py::Int n3(long(0));
py::Int n4(555);
py::Int n5(6666);
TEST(n1 == -5);
int x = n2;
int expected = -6666;
TEST(x == expected);
TEST(n3 == 0);
TEST(n4 == 555);
x = n5;
expected = 6666;
TEST(x == expected);
}
// py::Long
{
py::Long n1(-5);
py::Long n2(-66666666);
py::Long n3(long(0));
py::Long n4(555);
py::Long n5(66666666);
TEST(n1 == -5);
long x = n2;
long expected = -66666666;
TEST(x == expected);
TEST(n3 == 0);
TEST(n4 == 555);
x = n5;
expected = 66666666;
TEST(x == expected);
}
// py::UnsignedLong
{
py::UnsignedLong n1((unsigned long)(-5));
py::UnsignedLong n2((unsigned long)(-66666666));
py::UnsignedLong n3((unsigned long)(0));
py::UnsignedLong n4(555);
py::UnsignedLong n5(66666666);
TEST(n1 == (unsigned long)(-5));
TEST(n2 == (unsigned long)(-66666666));
TEST(n3 == 0);
TEST(n4 == 555);
TEST(n5 == 66666666);
}
// py::Float
{
TEST(py::Float::getMax() == std::numeric_limits<double>::max());
TEST(py::Float::getMin() == std::numeric_limits<double>::min());
py::Float max(std::numeric_limits<double>::max());
py::Float min(std::numeric_limits<double>::min());
py::Float n1(-0.5);
py::Float n2(double(0));
py::Float n3(333.555);
py::Float n4(0.02);
py::Float n5("0.02");
TEST(max == py::Float::getMax());
TEST(min == py::Float::getMin());
TEST(n1 == -0.5);
TEST(n2 == 0);
TEST(n3 == 333.555);
TEST(n4 == 0.02);
TEST(n5 == 0.02);
}
// py::Tuple
{
py::String s1("item_1");
py::String s2("item_2");
// Empty tuple
{
py::Tuple empty;
TEST(PyTuple_Check(empty) != 0);
TEST(empty.getCount() == 0);
SHOULDFAIL(empty.setItem(0, s1));
SHOULDFAIL(empty.getItem(0));
}
// One item tuple
{
py::Tuple t1(1);
TEST(PyTuple_Check(t1) != 0);
TEST(t1.getCount() == 1);
t1.setItem(0, s1);
py::String item1(t1.getItem(0));
TEST(std::string(item1) == std::string(s1));
py::String fastItem1(t1.fastGetItem(0));
TEST(std::string(fastItem1) == std::string(s1));
fastItem1.release();
SHOULDFAIL(t1.setItem(1, s2));
SHOULDFAIL(t1.getItem(1));
TEST(t1.getCount() == 1);
}
// 2 items tuple
{
py::Tuple t2(2);
TEST(PyTuple_Check(t2) != 0);
TEST(t2.getCount() == 2);
t2.setItem(0, s1);
py::String item1(t2.getItem(0));
TEST(std::string(item1) == std::string(s1));
py::String fastItem1(t2.fastGetItem(0));
TEST(std::string(fastItem1) == std::string(s1));
fastItem1.release();
t2.setItem(1, s2);
py::String item2(t2.getItem(1));
TEST(std::string(item2) == std::string(s2));
py::String fastItem2(t2.fastGetItem(1));
TEST(std::string(fastItem2) == std::string(s2));
fastItem2.release();
SHOULDFAIL(t2.setItem(2, s2));
SHOULDFAIL(t2.getItem(2));
TEST(t2.getCount() == 2);
}
}
// py::List
{
py::String s1("item_1");
py::String s2("item_2");
// Empty list
{
py::List empty;
TEST(PyList_Check(empty) != 0);
TEST(empty.getCount() == 0);
SHOULDFAIL(empty.setItem(0, s1));
SHOULDFAIL(empty.getItem(0));
}
// One item list
{
py::List t1;
TEST(PyList_Check(t1) != 0);
TEST(t1.getCount() == 0);
t1.append(s1);
py::String item1(t1.getItem(0));
TEST(std::string(item1) == std::string(s1));
py::String fastItem1(t1.fastGetItem(0));
TEST(std::string(fastItem1) == std::string(s1));
fastItem1.release();
TEST(t1.getCount() == 1);
TEST(std::string(item1) == std::string(s1));
SHOULDFAIL(t1.getItem(1));
}
// Two items list
{
py::List t2;
TEST(PyList_Check(t2) != 0);
TEST(t2.getCount() == 0);
t2.append(s1);
py::String item1(t2.getItem(0));
TEST(std::string(item1) == std::string(s1));
py::String fastItem1(t2.fastGetItem(0));
TEST(std::string(fastItem1) == std::string(s1));
fastItem1.release();
t2.append(s2);
TEST(t2.getCount() == 2);
py::String item2(t2.getItem(1));
TEST(std::string(item2) == std::string(s2));
py::String fastItem2(t2.fastGetItem(1));
TEST(std::string(fastItem2) == std::string(s2));
fastItem2.release();
SHOULDFAIL(t2.getItem(2));
}
}
// py::Dict
{
// Empty dict
{
py::Dict d;
TEST(PyDict_Size(d) == 0);
TEST(d.getItem("blah") == NULL);
}
// Failed External PyObject *
{
// NULL object
SHOULDFAIL(py::Dict(NULL));
// Wrong type (must be a dictionary)
py::String s("1234");
try
{
py::Dict d(s.release());
NTA_THROW << "py::Dict d(s) Should fail!!!";
}
catch(...)
{
}
// SHOULDFAIL fails to fail :-)
//SHOULDFAIL(py::Dict(s));
}
// Successful external PyObject *
{
PyObject * p = PyDict_New();
PyDict_SetItem(p, py::String("1234"), py::String("5678"));
py::Dict d(p);
TEST(PyDict_Contains(d, py::String("1234")) == 1);
PyDict_SetItem(d, py::String("777"), py::String("999"));
TEST(PyDict_Contains(d, py::String("777")) == 1);
}
// getItem with default (exisiting and non-exisitng key)
{
py::Dict d;
d.setItem("A", py::String("AAA"));
PyObject * defaultItem = (PyObject *)123;
py::String A(d.getItem("A"));
TEST(std::string(A) == std::string("AAA"));
// No "B" in the dict, so expect to get the default item
PyObject * B = (d.getItem("B", defaultItem));
TEST(B == defaultItem);
PyDict_SetItem(d, py::String("777"), py::String("999"));
TEST(PyDict_Contains(d, py::String("777")) == 1);
}
//NTA_DEBUG << ss << ": " << ss->ob_refcnt;
}
// py::Module
{
py::Module module("sys");
TEST(std::string(PyModule_GetName(module)) == std::string("sys"));
}
// py::Class
{
py::Class c("datetime", "date");
}
// py::Instance
{
py::Tuple args(3);
args.setItem(0, py::Long(2000));
args.setItem(1, py::Long(11));
args.setItem(2, py::Long(5));
py::Instance date("datetime", "date", args, py::Dict());
// Test invoke()
{
py::String result(date.invoke("__str__", py::Tuple(), py::Dict()));
std::string res((const char *)result);
std::string expected("2000-11-05");
TEST(res == expected);
}
// Test hasAttr()
{
py::String result(date.invoke("__str__", py::Tuple(), py::Dict()));
std::string res((const char *)result);
std::string expected("2000-11-05");
TEST(!(date.hasAttr("No such attribute")));
TEST(date.hasAttr("year"));
}
// Test getAttr()
{
py::Int year(date.getAttr("year"));
TEST(2000 == long(year));
}
// Test toString()
{
std::string res((const char *)py::String(date.toString()));
std::string expected("2000-11-05");
TEST(res == expected);
}
}
// Test custom exception
{
py::Tuple args(1);
args.setItem(0, py::String("error message!"));
py::Instance e(PyExc_RuntimeError, args);
e.setAttr("traceback", py::String("traceback!!!"));
PyErr_SetObject(PyExc_RuntimeError, e);
try
{
py::checkPyError(0);
}
catch (const nta::Exception & e)
{
NTA_DEBUG << e.getMessage();
}
}
}
void TextLineBaseSegment::layout()
{
npoints = 0;
TextLineBase* tl = textLineBase();
qreal _spatium = spatium();
if (!tl->diagonal())
_userOff2.setY(0);
switch (spannerSegmentType()) {
case SpannerSegmentType::SINGLE:
case SpannerSegmentType::BEGIN:
_text->setXmlText(tl->beginText());
_text->setFamily(tl->beginFontFamily());
_text->setSize(tl->beginFontSize());
_text->setOffset(tl->beginTextOffset());
_text->setAlign(tl->beginTextAlign());
break;
case SpannerSegmentType::MIDDLE:
case SpannerSegmentType::END:
_text->setXmlText(tl->continueText());
_text->setFamily(tl->continueFontFamily());
_text->setSize(tl->continueFontSize());
_text->setOffset(tl->continueTextOffset());
_text->setAlign(tl->continueTextAlign());
break;
}
_text->setTrack(track());
_text->layout();
if ((isSingleType() || isEndType())) {
_endText->setXmlText(tl->endText());
_endText->setFamily(tl->endFontFamily());
_endText->setSize(tl->endFontSize());
_endText->setOffset(tl->endTextOffset());
_endText->setAlign(tl->endTextAlign());
_endText->setTrack(track());
_endText->layout();
}
else {
_endText->setXmlText("");
}
QPointF pp1;
QPointF pp2(pos2());
// diagonal line with no text - just use the basic rectangle for line (ignore hooks)
if (_text->empty() && _endText->empty() && pp2.y() != 0) {
npoints = 2;
points[0] = pp1;
points[1] = pp2;
setbbox(QRectF(pp1, pp2).normalized());
return;
}
// line has text or is not diagonal - calculate reasonable bbox
qreal x1 = qMin(0.0, pp2.x());
qreal x2 = qMax(0.0, pp2.x());
qreal y0 = point(-textLineBase()->lineWidth());
qreal y1 = qMin(0.0, pp2.y()) + y0;
qreal y2 = qMax(0.0, pp2.y()) - y0;
qreal l = 0.0;
if (!_text->empty()) {
qreal textlineTextDistance = _spatium * .5;
if (((isSingleType() || isBeginType()) && (tl->beginTextPlace() == PlaceText::LEFT)) || ((isMiddleType() || isEndType()) && (tl->continueTextPlace() == PlaceText::LEFT)))
l = _text->pos().x() + _text->bbox().width() + textlineTextDistance;
qreal h = _text->height();
if (textLineBase()->beginTextPlace() == PlaceText::ABOVE)
y1 = qMin(y1, -h);
else if (textLineBase()->beginTextPlace() == PlaceText::BELOW)
y2 = qMax(y2, h);
else {
y1 = qMin(y1, -h * .5);
y2 = qMax(y2, h * .5);
}
x2 = qMax(x2, _text->width());
}
if (textLineBase()->endHookType() != HookType::NONE) {
qreal h = pp2.y() + point(textLineBase()->endHookHeight());
if (h > y2)
y2 = h;
else if (h < y1)
y1 = h;
}
if (textLineBase()->beginHookType() != HookType::NONE) {
qreal h = point(textLineBase()->beginHookHeight());
if (h > y2)
y2 = h;
else if (h < y1)
y1 = h;
}
bbox().setRect(x1, y1, x2 - x1, y2 - y1);
if (!_text->empty())
bbox() |= _text->bbox().translated(_text->pos()); // DEBUG
// set end text position and extend bbox
if (!_endText->empty()) {
_endText->setPos(bbox().right(), 0);
bbox() |= _endText->bbox().translated(_endText->pos());
}
if (!(tl->lineVisible() || score()->showInvisible()))
return;
if (tl->lineVisible() || !score()->printing()) {
QPointF pp1(l, 0.0);
qreal beginHookWidth;
qreal endHookWidth;
if (tl->beginHookType() == HookType::HOOK_45) {
beginHookWidth = fabs(tl->beginHookHeight().val() * _spatium * .4);
pp1.rx() += beginHookWidth;
}
else
beginHookWidth = 0;
if (tl->endHookType() == HookType::HOOK_45) {
endHookWidth = fabs(tl->endHookHeight().val() * _spatium * .4);
pp2.rx() -= endHookWidth;
}
else
endHookWidth = 0;
// don't draw backwards lines (or hooks) if text is longer than nominal line length
bool backwards = !_text->empty() && pp1.x() > pp2.x() && !tl->diagonal();
if ((tl->beginHookType() != HookType::NONE) && (isSingleType() || isBeginType())) {
qreal hh = tl->beginHookHeight().val() * _spatium;
points[npoints] = QPointF(pp1.x() - beginHookWidth, pp1.y() + hh);
++npoints;
points[npoints] = pp1;
}
if (!backwards) {
points[npoints] = pp1;
++npoints;
points[npoints] = pp2;
// painter->drawLine(QLineF(pp1.x(), pp1.y(), pp2.x(), pp2.y()));
if ((tl->endHookType() != HookType::NONE) && (isSingleType() || isEndType())) {
++npoints;
qreal hh = tl->endHookHeight().val() * _spatium;
// painter->drawLine(QLineF(pp2.x(), pp2.y(), pp2.x() + endHookWidth, pp2.y() + hh));
points[npoints] = QPointF(pp2.x() + endHookWidth, pp2.y() + hh);
}
}
}
}
void EmdL1::ComputeFlows()
{
std::map<Postion, int>::iterator iter_all;
int label_now = 0;
for (int i = 0; i < flows.size(); i++)
{
Postion p1, p2;
p1.pos[0] = flows[i]->pParent->pos[0];
p1.pos[1] = flows[i]->pParent->pos[1];
p1.pos[2] = flows[i]->pParent->pos[2];
p2.pos[0] = flows[i]->pChild->pos[0];
p2.pos[1] = flows[i]->pChild->pos[1];
p2.pos[2] = flows[i]->pChild->pos[2];
std::pair<Postion, int> pp1(p1, label_now);
std::pair<Postion, int> pp2(p2, label_now);
std::map<Postion, int>::iterator iter_p1 = AllValidNodes.find(p1);
std::map<Postion, int>::iterator iter_p2 = AllValidNodes.find(p2);
iter_all = AllValidNodes.begin();
bool flag_p1 = iter_p1 == AllValidNodes.end();
bool flag_p2 = iter_p2 == AllValidNodes.end();
if (flag_p1 && flag_p2)
{
label_now++;
AllValidNodes.insert(pp1);
AllValidNodes.insert(pp2);
continue;
}
if (flag_p1 && !flag_p2)
{
pp1.second = iter_p2->second;
AllValidNodes.insert(pp1);
continue;
}
if (!flag_p1 && flag_p2)
{
pp2.second = iter_p1->second;
AllValidNodes.insert(pp2);
continue;
}
if (!flag_p1 && !flag_p2)
{
if (iter_p1->second == iter_p2->second)
continue;
for (iter_all = AllValidNodes.begin(); iter_all != AllValidNodes.end(); iter_all++)
{
if (iter_all->second == iter_p2->second)
iter_all->second = iter_p1->second;
}
continue;
}
}
for (iter_all = AllValidNodes.begin(); iter_all != AllValidNodes.end(); iter_all++)
{
int index_1;
if (m_nDim == 2)
index_1 = iter_all->first.pos[0] + iter_all->first.pos[1] * m_n2;
else
index_1 = iter_all->first.pos[0] + iter_all->first.pos[1] * m_n2 + iter_all->first.pos[2] * m_n2 * m_n3;
if (Histg1[index_1] == 0 && Histg2[index_1] == 0)
iter_all->second = -1;
}
/*
int index_1, index_2;
Postion p1, p2;
if (m_nDim == 2)
{
index_1 = flows[i]->pParent->pos[0] * m_n2 + flows[i]->pParent->pos[1];
index_2 = flows[i]->pChild->pos[0] * m_n2 + flows[i]->pChild->pos[1];
}
else
{
index_1 = flows[i]->pParent->pos[0] * m_n2 * m_n3 + flows[i]->pParent->pos[1] * m_n2 + flows[i]->pParent->pos[2];
index_1 = flows[i]->pChild->pos[0] * m_n2 * m_n3 + flows[i]->pChild->pos[1] * m_n2 + flows[i]->pChild->pos[2];
}
p1.dir = 0;
p1.dir = 0;
if (Histg1[index_1] != 0 || Histg2[index_1] != 0)
p1.dir = 1;
if (Histg1[index_2] != 0 || Histg2[index_2] != 0)
p2.dir = 1;
p1.label = -1;
p2.label = -1;
Flows.resize(1);
Flows[0].flow_in.clear();
Flows[0].flow_out.clear();
int flow_index = 0;
bool new_flow = true;
for (int i = 0; i < flows.size(); i++)
{
Postion in, out;
if (flows[i]->iDir)
{
in.pos[0] = flows[i]->pParent->pos[0];
in.pos[1] = flows[i]->pParent->pos[1];
in.pos[2] = flows[i]->pParent->pos[2];
out.pos[0] = flows[i]->pChild->pos[0];
out.pos[1] = flows[i]->pChild->pos[1];
out.pos[2] = flows[i]->pChild->pos[2];
}
else
{
out.pos[0] = flows[i]->pParent->pos[0];
out.pos[1] = flows[i]->pParent->pos[1];
out.pos[2] = flows[i]->pParent->pos[2];
in.pos[0] = flows[i]->pChild->pos[0];
in.pos[1] = flows[i]->pChild->pos[1];
in.pos[2] = flows[i]->pChild->pos[2];
}
if (new_flow)
{
Flows[flow_index].flow_in.push_back(in);
Flows[flow_index].flow_out.push_back(out);
new_flow = false;
continue;
}
std::list<Postion>::iterator iter_in = std::find(Flows[flow_index].flow_in.begin(), Flows[flow_index].flow_in.end(), in);
std::list<Postion>::iterator iter_out = std::find(Flows[flow_index].flow_out.begin(), Flows[flow_index].flow_out.end(), out);
if (iter_in == Flows[flow_index].flow_in.end() && iter_out == Flows[flow_index].flow_out.end())
{
FlowStructure newflow;
newflow.flow_in.clear();
newflow.flow_out.clear();
Flows.push_back(newflow);
flow_index++;
Flows[flow_index].flow_in.push_back(in);
Flows[flow_index].flow_out.push_back(out);
continue;
}
if (iter_in != Flows[flow_index].flow_in.end() && iter_out != Flows[flow_index].flow_out.end())
continue;
if (iter_in != Flows[flow_index].flow_in.end())
}*/
}
void Enemy_Avatar_Wander_Character_Role::update(Area_Manager *area)
{
if (al_get_time() >= next_check) {
next_check = al_get_time() + (General::rand()%1000)/1000.0*5.0 + 5.0;
const float radius = 200.0f;
Map_Entity *player = area->get_entity(0);
int layer = player->get_layer();
General::Point<float> player_pos = player->get_position();
Area_Loop *loop = GET_AREA_LOOP;
if (!player->input_is_disabled() && layer == entity->get_layer() && !area->point_is_in_no_enemy_zone(player_pos.x, player_pos.y) && !area->get_in_speech_loop() && (!loop || loop->battle_event_is_done()) && loop->get_num_jumping() == 0) {
General::Point<float> this_pos = entity->get_position();
if (General::distance(player_pos.x, player_pos.y, this_pos.x, this_pos.y) <= radius) {
float dx = player_pos.x - this_pos.x;
float dy = player_pos.y - this_pos.y;
float angle1 = atan2(dy, dx) + M_PI / 2.0f;
float angle2 = angle1 + M_PI;
General::Point<float> pp1(
player_pos.x + cos(angle1) * General::TILE_SIZE/2,
player_pos.y + sin(angle1) * General::TILE_SIZE/2
);
General::Point<float> pp2(
player_pos.x + cos(angle2) * General::TILE_SIZE/2,
player_pos.y + sin(angle2) * General::TILE_SIZE/2
);
General::Point<float> tp1(
this_pos.x + cos(angle1) * General::TILE_SIZE/2,
this_pos.y + sin(angle1) * General::TILE_SIZE/2
);
General::Point<float> tp2(
this_pos.x + cos(angle2) * General::TILE_SIZE/2,
this_pos.y + sin(angle2) * General::TILE_SIZE/2
);
std::vector< General::Line<float> > *lines = area->get_collision_lines();
bool collision = false;
for (size_t i = 0; i < lines[layer].size(); i++) {
General::Point<float> p1(lines[layer][i].x1, lines[layer][i].y1);
General::Point<float> p2(lines[layer][i].x2, lines[layer][i].y2);
if (checkcoll_line_line(&pp1, &tp1, &p1, &p2, NULL)) {
collision = true;
break;
}
if (checkcoll_line_line(&pp2, &tp2, &p1, &p2, NULL)) {
collision = true;
break;
}
}
if (!collision) {
Battle_Event_Type type = (Battle_Event_Type)(General::rand() % 3);
float *inputs = player->get_inputs();
player->set_panning_to_entity(entity->get_id());
player->set_input_disabled(true);
if (type != BATTLE_EVENT_SIGHTED && (inputs[Map_Entity::X] != 0.0f || inputs[Map_Entity::Y] != 0.0f)) {
General::Direction d = player->get_direction();
float a;
if (d == General::DIR_N) {
player->get_animation_set()->set_sub_animation("trip-up");
a = M_PI / 2;
}
else if (d == General::DIR_S) {
player->get_animation_set()->set_sub_animation("trip-down");
a = M_PI * 3 / 2;
}
else if (d == General::DIR_E) {
player->get_animation_set()->set_sub_animation("trip");
a = M_PI;
}
else {
player->get_animation_set()->set_sub_animation("trip");
a = 0;
}
a += ((General::rand()%1000)/1000.0f)*M_PI/3 - M_PI/6;
player->get_animation_set()->reset();
if (type == BATTLE_EVENT_TRIPPED) {
engine->play_sample("sfx/trip.ogg");
}
else if (type == BATTLE_EVENT_SLIPPED) {
engine->play_sample("sfx/slip.ogg");
lua_State *stack = area->get_lua_state();
Lua::call_lua(stack, "toss_banana", "iddd>", layer, player_pos.x, player_pos.y, a);
}
}
else {
engine->play_sample("sfx/enemy_alerted.ogg");
player->update_direction(false);
}
GET_AREA_LOOP->set_battle_was_event(type);
entity->kamikaze(this_pos.x + dx * 0.9f, this_pos.y + dy * 0.9f);
return;
}
}
}
}
Wander_Character_Role::update(area);
}
void test_RT()
{
typedef RT Cls;
// _test_cls_regular_3( Cls() );
typedef traits::Bare_point Point;
typedef traits::Weighted_point Weighted_point;
typedef typename Cls::Vertex_handle Vertex_handle;
typedef typename Cls::Cell_handle Cell_handle;
typedef typename Cls::Facet Facet;
typedef typename Cls::Edge Edge;
typedef std::list<Weighted_point> list_point;
typedef typename Cls::Finite_cells_iterator Finite_cells_iterator;
// temporary version
int n, m;
int count = 0;
// For dimension 0, we need to check that the point of highest weight is the
// one that finally ends up in the vertex.
std::cout << " test dimension 0 " << std::endl;
Cls T0;
T0.insert(Weighted_point( Point (0,0,0), 0) );
T0.insert(Weighted_point( Point (0,0,0), 1) );
T0.insert(Weighted_point( Point (0,0,0), -1) );
assert(T0.dimension() == 0);
assert(T0.number_of_vertices() == 1);
assert(T0.finite_vertices_begin()->point().weight() == 1);
std::cout << " test dimension 1 " << std::endl;
Cls T1;
std::cout << " number of inserted points : " ;
Weighted_point p[5];
for ( m=0; m<5; m++) {
if ( (m%2)== 0 )
p[m] = Weighted_point( Point( 2*m,0,0 ), 2 );
else
p[m] = Weighted_point( Point( -2*m+1,0,0 ), 2 );
T1.insert( p[m] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
assert( T1.is_valid() );
std::cout << std::endl << " number of vertices : "
<< T1.number_of_vertices() << std::endl;
std::cout << " number of inserted points : " ;
Weighted_point q[5];
for ( m=0; m<5; m++) {
if ( (m%2)== 0 )
q[m] = Weighted_point( Point( 2*m+1,0,0 ), 5 );
else
q[m] = Weighted_point( Point( -2*m+1,0,0 ), 5 );
T1.insert( q[m] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
assert( T1.is_valid() );
std::cout << std::endl << " number of vertices : "
<< T1.number_of_vertices() << std::endl;
std::cout << " number of inserted points : " ;
Weighted_point r[10];
for ( m=0; m<10; m++) {
if ( (m%2)== 0 )
r[m] = Weighted_point( Point( m,0,0 ), 1 );
else
r[m] = Weighted_point( Point( -m,0,0 ), 1 );
T1.insert( r[m] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
assert( T1.is_valid() );
std::cout << std::endl << " number of vertices : "
<< T1.number_of_vertices() << std::endl;
assert( T1.dimension()==1 );
// The following is distilled from a bug report by Wulue Zhao
// ([email protected]), a student of Tamal Dey.
Point pt0(0,0,0);
Point pt1( 1,0,0), pt2(2,0,0), pt3(3,0,0);
Point pt4(-1,0,0), pt5(-2,0,0), pt6(-3,0,0);
Weighted_point wp0(pt0,10.0);
Weighted_point wp1(pt1,0.0), wp2(pt2,0.0), wp3(pt3,0.0);
Weighted_point wp4(pt4,0.0), wp5(pt5,0.0), wp6(pt6,0.0);
Cls T11;
T11.insert(wp0);
T11.insert(wp1);
T11.insert(wp2);
T11.insert(wp3);
T11.insert(wp4);
T11.insert(wp5);
T11.insert(wp6);
assert(T11.is_valid());
// And another distilled bug report from the same guy.
{
Point p1(-0.07, 0.04, 0.04);
Point p2(0.09, 0.04, 0.04);
Point p3(0.09, -0.05, 0.04);
Point p4(0.05, -0.05, 0.04);
Point p5(0.05, 0.0, 0.04);
Point p6(-0.07, 0.0, 0.04);
Point p7(-0.07, 0.04, -0.04);
Point p8(0.09, 0.04, -0.04);
Point p9(0.09, -0.05, -0.04);
Point p10(0.05, -0.05, -0.04);
Point p11(0.05, 0.0, -0.04);
Point p12(-0.07, 0.0, -0.04);
Weighted_point wp1(p1,0);
Weighted_point wp2(p2,0);
Weighted_point wp3(p3,0);
Weighted_point wp4(p4,0);
Weighted_point wp5(p5,0);
Weighted_point wp6(p6,0);
Weighted_point wp7(p7,0);
Weighted_point wp8(p8,0);
Weighted_point wp9(p9,0);
Weighted_point wp10(p10,0);
Weighted_point wp11(p11,0);
Weighted_point wp12(p12,0);
Weighted_point wp13(p3,0.3); // wp13 has the same coordinates with wp3
Cls T111;
T111.insert(wp1);
T111.insert(wp2);
T111.insert(wp3);
T111.insert(wp13); // it doesnot work inserting wp13 here
T111.insert(wp4);
T111.insert(wp5);
T111.insert(wp6);
T111.insert(wp7);
T111.insert(wp8);
T111.insert(wp9);
T111.insert(wp10);
T111.insert(wp11);
T111.insert(wp12);
assert(T111.is_valid());
}
std::cout << " test dimension 2 " << std::endl;
std::cout << " number of inserted points : " ;
Cls T2;
count = 0 ;
int px=1, py=1;
int qx=-1, qy=2;
Weighted_point s[400];
for (m=0; m<10; m++)
for (n=0; n<10; n++) {
s[m+20*n] = Weighted_point( Point(m*px+n*qx, m*py+n*qy, 0), 1 );
T2.insert( s[m+20*n] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
for (m=10; m<20; m++)
for (n=0; n<10; n++) {
s[m+20*n] = Weighted_point( Point(m*px+n*qx, m*py+n*qy, 0), -1 );
T2.insert( s[m+20*n] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
for (m=0; m<10; m++)
for (n=10; n<20; n++) {
s[m+20*n] = Weighted_point( Point(m*px+n*qx, m*py+n*qy, 0), -2 );
T2.insert( s[m+20*n] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
for (m=10; m<20; m++)
for (n=10; n<20; n++) {
s[m+20*n] = Weighted_point( Point(m*px+n*qx, m*py+n*qy, 0), 5 );
T2.insert( s[m+20*n] );
count++;
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
std::cout << count << '\b' << '\b' << '\b' ;
std::cout.flush();
}
std::cout << std::endl << " number of vertices : "
<< T2.number_of_vertices() << std::endl;
assert( T2.dimension()==2 );
assert( T2.is_valid() );
// dimension 3
std::cout << " test dimension 3" << std::endl;
Cls T;
list_point lp;
int a, b, d;
for (a=0;a!=10;a++)
// for (b=0;b!=10;b++)
for (b=0;b!=5;b++)
// for (d=0;d!=10;d++)
for (d=0;d!=5;d++)
lp.push_back(Weighted_point( Point(a*b-d*a + (a-b)*10 +a ,
a-b+d +5*b,
a*a-d*d+b),
a*b-a*d) );
list_point::iterator it;
count = 0 ;
std::cout << " number of inserted points : " ;
for (it=lp.begin(); it!=lp.end(); ++it){
count++;
T.insert(*it);
if (count <10)
std::cout << count << '\b' ;
else
if (count < 100)
std::cout << count << '\b' << '\b' ;
else
if (count < 1000)
std::cout << count << '\b' << '\b' << '\b' ;
else
std::cout << count << std::endl;
std::cout.flush();
}
std::cout << std::endl;
std::cout << " number of vertices : "
<< T.number_of_vertices() << std::endl;
assert(T.is_valid());
assert(T.dimension()==3);
T.clear();
std::cout << " test iterator range insert" << std::endl;
T.insert (lp.begin(), lp.end());
std::cout << " number of vertices : "
<< T.number_of_vertices() << std::endl;
assert(T.is_valid());
assert(T.dimension()==3);
//test nearest_power_vertex
std::cout << " test nearest_power_vertex " << std::endl;
Point pp1(0.0, 0.0, 0.0);
Point pp2(1.0, 0.0, 0.0);
Point pp3(0.0, 1.0, 0.0);
Point pp4(0.0, 0.0, 1.0);
Point pp5(1.0, 1.0, 0.0);
Point pp6(0.0, 1.0, 1.0);
Point pp7(1.0, 0.0, 1.0);
Point pp8(1.0, 1.0, 1.0);
Weighted_point wpp1(pp1, 1.0);
Weighted_point wpp2(pp2, 2.0);
Weighted_point wpp3(pp3, 1.0);
Weighted_point wpp4(pp4, 4.0);
Weighted_point wpp5(pp5, 1.0);
Weighted_point wpp6(pp6, 1.0);
Weighted_point wpp7(pp7, 1.0);
Weighted_point wpp8(pp8, 8.0);
Cls T3;
T3.insert(wpp1);
Vertex_handle v2 = T3.insert(wpp2);
assert( T3.nearest_power_vertex(Point(0.5,0.5,0.5)) == v2);
T3.insert(wpp3);
Vertex_handle v4 = T3.insert(wpp4);
assert( T3.nearest_power_vertex(Point(0.5,0.5,0.5)) == v4);
T3.insert(wpp5);
T3.insert(wpp6);
T3.insert(wpp7);
// Avoid inserting the same point twice, now that hidden points are handled,
// insert (existing_point) returns Vertex_handle().
// T3.insert(wpp8);
Vertex_handle v8 = T3.insert(wpp8);
Point query(0.5,0.5,0.5);
assert(T3.nearest_power_vertex(query) == v8);
assert(T3.nearest_power_vertex(Weighted_point(query,1.0)) == v8 );
assert(T3.nearest_power_vertex_in_cell(query ,v8->cell()) == v8);
// test dual
std::cout << " test dual member functions" << std::endl;
Finite_cells_iterator fcit = T3.finite_cells_begin();
for( ; fcit != T3.finite_cells_end(); ++fcit) {
Point cc = T3.dual(fcit);
Vertex_handle ncc = T3.nearest_power_vertex(cc);
assert(fcit->has_vertex(ncc));
}
// test Gabriel
std::cout << " test is_Gabriel " << std::endl;
Point q0(0.,0.,0.);
Point q1(2.,0.,0.);
Point q2(0.,2.,0.);
Point q3(0.,0.,2.);
Weighted_point wq0(q0,0.);
Weighted_point wq1(q1,0.);
Weighted_point wq2(q2,0.);
Weighted_point wq3(q3,0.);
Weighted_point wq01(q0,2.);
Cls T4;
Vertex_handle v0 = T4.insert(wq0);
Vertex_handle v1 = T4.insert(wq1);
v2 = T4.insert(wq2);
Vertex_handle v3 = T4.insert(wq3);
Cell_handle c;
int i,j,k,l;
assert(T4.is_facet(v0,v1,v2,c,j,k,l));
i = 6 - (j+k+l);
Facet f = std::make_pair(c,i);
assert(T4.is_Gabriel(c,i));
assert(T4.is_Gabriel(f));
assert(T4.is_facet(v1,v2,v3,c,j,k,l));
i = 6 - (j+k+l);
assert(!T4.is_Gabriel(c,i));
assert(T4.is_edge(v0,v1,c,i,j));
assert(T4.is_Gabriel(c,i,j));
Edge e = make_triple(c,i,j);
assert(T4.is_Gabriel(e));
assert(T4.is_edge(v2,v3,c,i,j));
assert(T4.is_Gabriel(c,i,j));
Vertex_handle v01 = T4.insert(wq01);
(void) v01; // kill warning
assert(T4.is_edge(v2,v3,c,i,j));
assert(!T4.is_Gabriel(c,i,j));
Weighted_point wwq0(q0,0.);
Weighted_point wwq1(q1,0.);
Weighted_point wwq2(q2,0.);
Weighted_point wwq3(q3,5.);
Cls T5;
v0 = T5.insert(wwq0);
v1 = T5.insert(wwq1);
v2 = T5.insert(wwq2);
v3 = T5.insert(wwq3);
assert(T5.nearest_power_vertex(v3->point().point()) == v3);
assert(T5.nearest_power_vertex(v0->point().point()) == v3);
assert(T5.is_Gabriel(v3));
assert(!T5.is_Gabriel(v0));
}