mirror of https://github.com/KLayout/klayout.git
152 lines
5.2 KiB
C++
152 lines
5.2 KiB
C++
|
|
/*
|
|
|
|
KLayout Layout Viewer
|
|
Copyright (C) 2006-2019 Matthias Koefferlein
|
|
|
|
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 St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
#include "tlUnitTest.h"
|
|
|
|
#include "dbEdgePairs.h"
|
|
#include "dbEdges.h"
|
|
#include "dbRegion.h"
|
|
|
|
TEST(1)
|
|
{
|
|
db::EdgePairs ep;
|
|
EXPECT_EQ (ep.empty (), true);
|
|
EXPECT_EQ (ep.bbox ().to_string (), "()");
|
|
EXPECT_EQ (ep == db::EdgePairs (), true);
|
|
EXPECT_EQ (ep < db::EdgePairs (), false);
|
|
EXPECT_EQ (ep != db::EdgePairs (), false);
|
|
ep.insert (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (-10, -20), db::Point (90, 80)));
|
|
EXPECT_EQ (ep.empty (), false);
|
|
EXPECT_EQ (ep.size (), size_t (1));
|
|
EXPECT_EQ (ep.bbox ().to_string (), "(-10,-20;110,120)");
|
|
EXPECT_EQ (ep.to_string (), "(10,20;110,120)/(-10,-20;90,80)");
|
|
|
|
ep.clear ();
|
|
EXPECT_EQ (ep.empty (), true);
|
|
EXPECT_EQ (ep.size (), size_t (0));
|
|
EXPECT_EQ (ep.bbox ().to_string (), "()");
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (-10, -20), db::Point (90, 80))));
|
|
EXPECT_EQ (ep == db::EdgePairs (), false);
|
|
EXPECT_EQ (ep < db::EdgePairs (), true);
|
|
EXPECT_EQ (ep != db::EdgePairs (), true);
|
|
EXPECT_EQ (ep != ep, false);
|
|
EXPECT_EQ (ep == ep, true);
|
|
EXPECT_EQ (ep < ep, false);
|
|
EXPECT_EQ (ep.empty (), false);
|
|
EXPECT_EQ (ep.bbox ().to_string (), "(-10,-20;110,120)");
|
|
EXPECT_EQ (ep.to_string (), "(10,20;110,120)/(-10,-20;90,80)");
|
|
|
|
EXPECT_EQ (ep.transformed (db::ICplxTrans (2.0, 0.0, false, db::Vector ())).to_string (), "(20,40;220,240)/(-20,-40;180,160)");
|
|
EXPECT_EQ (ep.to_string (), "(10,20;110,120)/(-10,-20;90,80)");
|
|
ep.transform (db::ICplxTrans (3));
|
|
EXPECT_EQ (ep.empty (), false);
|
|
EXPECT_EQ (ep.bbox ().to_string (), "(-20,-110;120,10)");
|
|
EXPECT_EQ (ep.to_string (), "(20,-10;120,-110)/(-20,10;80,-90)");
|
|
|
|
db::EdgePairs ep2;
|
|
EXPECT_EQ (ep2.empty (), true);
|
|
EXPECT_EQ (ep2.size (), size_t (0));
|
|
EXPECT_EQ (ep2.bbox ().to_string (), "()");
|
|
ep2.swap (ep);
|
|
EXPECT_EQ (ep.empty (), true);
|
|
EXPECT_EQ (ep.size (), size_t (0));
|
|
EXPECT_EQ (ep.bbox ().to_string (), "()");
|
|
EXPECT_EQ (ep2.empty (), false);
|
|
EXPECT_EQ (ep2.size (), size_t (1));
|
|
EXPECT_EQ (ep2.bbox ().to_string (), "(-20,-110;120,10)");
|
|
}
|
|
|
|
TEST(2)
|
|
{
|
|
db::EdgePairs ep;
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (-10, -20), db::Point (90, 80))));
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (90, 80), db::Point (-10, -20))));
|
|
|
|
EXPECT_EQ (ep.to_string (), "(10,20;110,120)/(-10,-20;90,80);(10,20;110,120)/(90,80;-10,-20)");
|
|
|
|
db::EdgePairs ee;
|
|
std::string s = ep.to_string ();
|
|
tl::Extractor ex (s.c_str ());
|
|
EXPECT_EQ (ex.try_read (ee), true);
|
|
EXPECT_EQ (ee.to_string (), "(10,20;110,120)/(-10,-20;90,80);(10,20;110,120)/(90,80;-10,-20)");
|
|
|
|
db::Edges e;
|
|
ep.edges (e);
|
|
EXPECT_EQ (e.to_string (), "(10,20;110,120);(-10,-20;90,80);(10,20;110,120);(90,80;-10,-20)");
|
|
e.clear ();
|
|
ep.first_edges (e);
|
|
EXPECT_EQ (e.to_string (), "(10,20;110,120);(10,20;110,120)");
|
|
e.clear ();
|
|
ep.second_edges (e);
|
|
EXPECT_EQ (e.to_string (), "(-10,-20;90,80);(90,80;-10,-20)");
|
|
|
|
db::Region r;
|
|
ep.polygons (r);
|
|
EXPECT_EQ (r.to_string (), "(-10,-20;10,20;110,120;90,80);(-10,-20;10,20;110,120;90,80)");
|
|
}
|
|
|
|
struct EPTestFilter
|
|
: public db::EdgePairFilterBase
|
|
{
|
|
bool selected (const db::EdgePair &ep) const
|
|
{
|
|
return ep.first ().double_length () < 50;
|
|
}
|
|
|
|
const db::TransformationReducer *vars () const
|
|
{
|
|
return &m_vars;
|
|
}
|
|
|
|
private:
|
|
db::MagnificationReducer m_vars;
|
|
};
|
|
|
|
TEST(3)
|
|
{
|
|
db::EdgePairs ep;
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (50, 50)), db::Edge (db::Point (-10, -20), db::Point (90, 80))));
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (90, 80), db::Point (-10, -20))));
|
|
|
|
EPTestFilter f;
|
|
EXPECT_EQ (ep.filtered (f).to_string (), "");
|
|
ep.filter (f);
|
|
EXPECT_EQ (ep.to_string (), "");
|
|
}
|
|
|
|
TEST(4)
|
|
{
|
|
db::EdgePairs ep;
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (50, 50)), db::Edge (db::Point (-10, -20), db::Point (90, 80))));
|
|
ep.insert (db::EdgePair (db::Edge (db::Point (10, 20), db::Point (110, 120)), db::Edge (db::Point (90, 80), db::Point (-10, -20))));
|
|
|
|
db::Layout ly;
|
|
unsigned int l1 = ly.insert_layer (db::LayerProperties (1, 0));
|
|
db::cell_index_type top_cell = ly.add_cell ("TOP");
|
|
|
|
ep.insert_into_as_polygons (&ly, top_cell, l1, 1);
|
|
|
|
db::Region r (db::RecursiveShapeIterator (ly, ly.cell (top_cell), l1));
|
|
EXPECT_EQ (r.to_string (), "(-10,-21;9,20;50,51;91,80);(-10,-21;9,20;110,121;91,80)");
|
|
}
|