public virtual void TestQueries()
{
Single_Renamed = Single(Random());
Parallel_Renamed = Parallel(Random());
QueryTest(new TermQuery(new Term("f1", "v1")));
QueryTest(new TermQuery(new Term("f1", "v2")));
QueryTest(new TermQuery(new Term("f2", "v1")));
QueryTest(new TermQuery(new Term("f2", "v2")));
QueryTest(new TermQuery(new Term("f3", "v1")));
QueryTest(new TermQuery(new Term("f3", "v2")));
QueryTest(new TermQuery(new Term("f4", "v1")));
QueryTest(new TermQuery(new Term("f4", "v2")));
BooleanQuery bq1 = new BooleanQuery();
bq1.Add(new TermQuery(new Term("f1", "v1")), Occur.MUST);
bq1.Add(new TermQuery(new Term("f4", "v1")), Occur.MUST);
QueryTest(bq1);
Single_Renamed.IndexReader.Dispose();
Single_Renamed = null;
Parallel_Renamed.IndexReader.Dispose();
Parallel_Renamed = null;
Dir.Dispose();
Dir = null;
Dir1.Dispose();
Dir1 = null;
Dir2.Dispose();
Dir2 = null;
}
public virtual void TestQueriesCompositeComposite()
{
Single_Renamed = Single(Random(), true);
Parallel_Renamed = Parallel(Random(), true);
Queries();
Single_Renamed.IndexReader.Dispose();
Single_Renamed = null;
Parallel_Renamed.IndexReader.Dispose();
Parallel_Renamed = null;
Dir.Dispose();
Dir = null;
Dir1.Dispose();
Dir1 = null;
Dir2.Dispose();
Dir2 = null;
}
private static int FindNextClosest(List <PathDefWithClosed> Paths)
{
QuadTreeNode Root = new QuadTreeNode();
PolyLineSet.Bounds B = new PolyLineSet.Bounds();
for (int i = 0; i < Paths.Count; i++)
{
if (Paths[i].Closed == false)
{
B.FitPoint(Paths[i].Vertices.First());
B.FitPoint(Paths[i].Vertices.Last());
}
}
Root.xstart = B.TopLeft.X - 10;
Root.xend = B.BottomRight.X + 10;
Root.ystart = B.TopLeft.Y - 10;
Root.yend = B.BottomRight.Y + 10;
for (int i = 0; i < Paths.Count; i++)
{
if (Paths[i].Closed == false)
{
Root.Insert(new SegmentEndContainer()
{
PathID = i, Point = Paths[i].Vertices.First(), Side = SideEnum.Start
}, 5);
Root.Insert(new SegmentEndContainer()
{
PathID = i, Point = Paths[i].Vertices.Last(), Side = SideEnum.End
}, 5);
}
}
RectangleF R = new RectangleF();
R.Width = 3;
R.Height = 3;
for (int i = 0; i < Paths.Count; i++)
{
var P = Paths[i];
if (P.Closed == false)
{
var PF = P.Vertices[0];
var PF2 = P.Vertices[1];
var PathDir = PF - PF2;// MathHelpers.Difference(PF, PF2);
PathDir.Normalize();
R.X = (float)(P.Vertices.First().X - 1.5);
R.Y = (float)(P.Vertices.First().Y - 1.5);
int startmatch = -1;
int endmatch = -1;
double closestdistance = B.Width() + B.Height();
Root.CallBackInside(R, delegate(QuadTreeItem QI)
{
var S = QI as SegmentEndContainer;
if (S.PathID == i)
{
return(true);
}
if (P.Width != Paths[S.PathID].Width)
{
return(true);
}
PointD Dir2;
if (S.Side == SideEnum.Start)
{
var S2 = Paths[S.PathID].Vertices[1];
Dir2 = S2 - S.Point;
Dir2.Normalize();
}
else
{
var S2 = Paths[S.PathID].Vertices[Paths[S.PathID].Vertices.Count() - 2];
Dir2 = S2 - S.Point;
Dir2.Normalize();
}
double dotted = Dir2.Dot(PathDir);
var D = PointD.Distance(S.Point, PF);
if (D < 1.0)
{
// D -= dotted * 3.0;
if (D < closestdistance)
{
closestdistance = D;
if (S.Side == SideEnum.Start)
{
startmatch = S.PathID;
}
else
{
endmatch = S.PathID;
}
}
}
return(true);
});
if (startmatch > -1 || endmatch > -1)
{
if (endmatch > -1)
{
if (closestdistance > 0)
{
Paths[endmatch].Vertices.Remove(Paths[endmatch].Vertices.Last());
}
Paths[endmatch].Vertices.AddRange(Paths[i].Vertices);
if (Paths[endmatch].Vertices.First() == Paths[endmatch].Vertices.Last())
{
Console.WriteLine("closed path with {0} points during stage 4a", Paths[endmatch].Vertices.Count());
Paths[endmatch].Closed = true;
}
Paths.Remove(Paths[i]);
// Console.WriteLine(" 4a");
return(1);
}
if (startmatch > -1)
{
Paths[i].Vertices.Reverse();
if (closestdistance > 0)
{
Paths[i].Vertices.Remove(Paths[i].Vertices.Last());
}
Paths[i].Vertices.AddRange(Paths[startmatch].Vertices);
if (Paths[i].Vertices.First() == Paths[i].Vertices.Last())
{
Console.WriteLine("closed path with {0} points during stage 4b", Paths[i].Vertices.Count());
Paths[i].Closed = true;
}
Paths.Remove(Paths[startmatch]);
//Console.WriteLine(" 4b");
return(1);
}
}
PF = P.Vertices.Last();
R.X = (float)(P.Vertices.First().X - 1.5);
R.Y = (float)(P.Vertices.First().Y - 1.5);
startmatch = -1;
endmatch = -1;
closestdistance = B.Width() + B.Height();
Root.CallBackInside(R, delegate(QuadTreeItem QI)
{
var S = QI as SegmentEndContainer;
if (S.PathID == i)
{
return(true);
}
if (P.Width != Paths[S.PathID].Width)
{
return(true);
}
var D = PointD.Distance(S.Point, PF);
if (D < 1.0 && D < closestdistance)
{
closestdistance = D;
if (S.Side == SideEnum.Start)
{
startmatch = S.PathID;
}
else
{
endmatch = S.PathID;
}
}
return(true);
});
if (startmatch > -1 || endmatch > -1)
{
if (endmatch > -1)
{
Paths[i].Vertices.Reverse();
if (closestdistance > 0)
{
Paths[endmatch].Vertices.Remove(Paths[endmatch].Vertices.Last());
}
Paths[endmatch].Vertices.AddRange(Paths[i].Vertices);
if (Paths[endmatch].Vertices.First() == Paths[endmatch].Vertices.Last())
{
Console.WriteLine("closed path with {0} points during stage 4c", Paths[endmatch].Vertices.Count());
Paths[endmatch].Closed = true;
}
Paths.Remove(Paths[i]);
// Console.WriteLine(" 4c");
return(1);
}
if (startmatch > -1)
{
if (closestdistance > 0)
{
Paths[i].Vertices.Remove(Paths[i].Vertices.Last());
}
Paths[i].Vertices.AddRange(Paths[startmatch].Vertices);
if (Paths[i].Vertices.First() == Paths[i].Vertices.Last())
{
Console.WriteLine("closed path with {0} points during stage 4d", Paths[i].Vertices.Count());
Paths[i].Closed = true;
}
Paths.Remove(Paths[startmatch]);
// Console.WriteLine(" 4d");
return(1);
}
}
}
}
return(0);
}